Datasets:

neuralwork

/

arxiver

like 335

Follow

neuralwork 51

2310.09131

Machine learning-based prediction of Q-voter model in complex networks

In this article, we consider machine learning algorithms to accurately predict two variables associated with the $Q$-voter model in complex networks, i.e., (i) the consensus time and (ii) the frequency of opinion changes. Leveraging nine topological measures of the underlying networks, we verify that the clustering coefficient (C) and information centrality (IC) emerge as the most important predictors for these outcomes. Notably, the machine learning algorithms demonstrate accuracy across three distinct initialization methods of the $Q$-voter model, including random selection and the involvement of high- and low-degree agents with positive opinions. By unraveling the intricate interplay between network structure and dynamics, this research sheds light on the underlying mechanisms responsible for polarization effects and other dynamic patterns in social systems. Adopting a holistic approach that comprehends the complexity of network systems, this study offers insights into the intricate dynamics associated with polarization effects and paves the way for investigating the structure and dynamics of complex systems through modern machine learning methods.

Aruane M. Pineda, Paul Kent, Colm Connaughton, Francisco A. Rodrigues

2023-10-13T14:18:03Z

http://arxiv.org/abs/2310.09131v1

# Machine learning-based prediction of \(Q\)-voter model in complex networks ###### Abstract In this article, we consider machine learning algorithms to accurately predict two variables associated with the \(Q\)-voter model in complex networks, i.e., (i) the consensus time and (ii) the frequency of opinion changes. Leveraging nine topological measures of the underlying networks, we verify that the clustering coefficient (C) and information centrality (IC) emerge as the most important predictors for these outcomes. Notably, the machine learning algorithms demonstrate accuracy across three distinct initialization methods of the \(Q\)-voter model, including random selection and the involvement of high- and low-degree agents with positive opinions. By unraveling the intricate interplay between network structure and dynamics, this research sheds light on the underlying mechanisms responsible for polarization effects and other dynamic patterns in social systems. Adopting a holistic approach that comprehends the complexity of network systems, this study offers insights into the intricate dynamics associated with polarization effects and paves the way for investigating the structure and dynamics of complex systems through modern methods of machine learning. _Keywords_: Complex networks structure, \(Q\)-voter model, Polarization, Network measures, Machine learning algorithms ## 1 Introduction Interactions among the components of a complex system have given rise to properties not present in its isolated parts [1]. For instance, the collective behavior of ants in a colony provides a compelling illustration of emergence. While individually following simple rules, ants exhibit complex behaviors such as efficient food foraging, elaborate nest construction, and coordinated defense [2]. Such an emergence phenomenon significantly extends beyond the natural world, since it also manifests within our society through intricate interactions among agents, groups, and institutions. A substantial consequence of emergence is social polarization, according to which agents develop increasingly extreme opinions and display diminished tolerance for opposing viewpoints, ultimately leading to societal divisions. Numerous studies have associated the phenomenon with negative outcomes in political contexts, as seen in the recent elections in both Brazil and the United States [3, 4, 5, 6]. In Brazil, heightened polarization culminated in a significant event on January 8, 2023, when key institutions in Brasilia, the capital of Brazil, were invaded. This event was the result of escalating tensions stemming from polarized political discourse. The Supreme Federal Court, the National Congress building, and the Presidential Palace were among the targeted institutions. Similarly, the United States also faced its own challenges associated with polarization. A notable incident occurred on January 6, 2021, when a crowd stormed the United States Capitol in an attempt to overturn the results of the presidential election. Therefore, the causes and effects of polarization in social networks must be comprehended so that effective communication strategies and social interventions that mitigate its detrimental impact can be designed [7, 8]. Towards a deeper understanding of social polarization, various mathematical models have been developed [9] and the most sophisticated ones have recently considered the dynamics of interactions between agents and their underlying structure. Indeed, consensus models must be simulated in complex networks to be more realistic, since the network topology heavily influences both their dynamics and the final result of consensus generation [10]. Several models, including the Ising model, the Sznajd model, the voter model, the naming game, the bounded confidence model, and the \(Q\)-voter model, address complex phenomena stemming from interactions among individuals in social and physical contexts and are adapted for complex networks. Researchers employ these models to identify conditions fostering consensus emergence and network features facilitating the process. Simulations within complex networks are crucial to achieving a more accurate portrayal of consensus formation. The intricate network topology significantly influences model dynamics and consequently impacts consensus generation outcomes [11]. The Ising model, originating from physics, focuses on material magnetization by representing the magnetic orientation of spins in a three-dimensional lattice. The interaction between neighboring spins aims to minimize the system's energy, leading to phenomena like the Ising phase transition [12, 13, 14, 15]. In contrast, the Sznajd model explores how similar opinions can influence others. The premise is that people with coinciding opinions are more likely to persuade others, leading to the formation of opinion clusters [16, 17, 18, 19]. Meanwhile, the voter model simplifies decision-making in a population, where individuals adopt the majority opinion of their neighbors, illustrating how social influences can drive convergence towards dominant opinions or polarization [20, 9]. The naming game addresses language evolution, where individuals attempt to communicate and reach a consensus on names for concepts, balancing communicative efficiency and linguistic diversity [21, 9, 22, 23]. Bounded confidence explores how opinions change through social interactions, assuming people update their opinions only when the difference from others' opinions falls within a specific limit [24, 25]. Finally, the \(Q\)-voter model offers an approach to simulate collective decisions within groups of individuals. In this model, each agent adopts the opinion of one of its randomly selected \(Q\)-neighbors. These \(Q\)-neighbors represent a subset of neighboring agents, and the extent of this subset, denoted by \(Q\), significantly influences the dynamics of opinion diffusion. This model investigates how connectivity and information exchange between individuals impact consensus formation. By studying how opinions spread through the \(Q\)-voter framework, researchers gain insights into the emergence of consensus, polarization, or the coexistence of diverse viewpoints within a population [9, 26, 27]. In [28], researchers investigate the impact of polarization in the three-state \(Q\)-voter model, considering limited confidence and noise. By incorporating these factors, the study reveals how agent interactions lead to the formation of groups with divergent opinions, complicating the convergence to a single opinion. Similarly, [29] examines the role of anticonformity and limited confidence in the \(Q\)-voter model. This study demonstrates that anticonformity amplifies polarization and emphasizes the coexistence of groups with similar yet distinct opinions, especially when limited confidence is present. Furthermore, [30] introduces a mathematical model that examines the effects of conformity and anticonformity on opinion polarization. This study investigates a similar opinion dynamics model based on the \(Q\)-voter, analyzing how the interplay between these behaviors influences the formation of groups with divergent opinions. These collective studies substantially contribute to a deeper understanding of the underlying dynamics of opinion polarization in social contexts. Empirical investigations have consistently provided compelling evidence that different network topologies exhibit varying degrees of polarization and consensus formation [31, 32, 33, 34, 35]. For example, recent studies have shown the adoption of the \(Q\)-voter model within modular networks can result in highly polarized public opinions [31]. On the other hand, in scale-free networks, highly connected agents can expedite the process of consensus formation while potentially amplifying extreme polarization [32]. Furthermore, studies have delved into the influence of network clustering, degree distribution, and other network properties on the dynamics of consensus formation [9], highlighting the crucial role of network topology in the development of realistic models for comprehending consensus formation within complex networks. By considering the intricate interplay between network structure and opinion dynamics, researchers can attain a more comprehensive understanding of the factors that shape the emergence of consensus and polarization. Given the significant influence of network topology on the emergence of consensus, an essential question is whether it is feasible to develop a machine learning model that can forecast dynamic variables based on network properties. Such an inquiry has been widely explored in various fields, including the prediction of both epidemics in human contact networks [36, 37] and synchronization in coupled oscillators [38, 37]. The investigations have not only demonstrated the possibility of forecasting the behavior of dynamic systems from the network topology but also underscored the importance of comprehending the relationship between network structure and dynamics in those systems as in the recent article by Brooks and Porter [39]. Both our study and the one by Brooks and Porter share a common focus on complex phenomena within social networks. We employ interdisciplinary approaches that integrate complex network theory, system dynamics, and machine learning. Both studies acknowledge the pivotal role of network structure in shaping social dynamics and investigate opinion dynamics within social networks, although with different emphases. While both studies delve into opinion dynamics, our research primarily centers on utilizing machine learning to predict variables based on the \(Q\)-voter model. In contrast, Brooks and Porter's research delves into how media exposure influences ideological content within social networks. This distinction underscores the significance of media in their study, while our research places a strong emphasis on network structure and agent interactions. The application of machine learning algorithms in the study for the prediction of consensus time and frequency of opinion changes in the \(Q\)-voter model offers several advantages. Machine learning promotes the capture of complex patterns, learning from historical data, and adaptation to evolving dynamics; it is a powerful tool for uncovering intricate relationships and enhancing predictive accuracy. Moreover, its use in the context of \(Q\)-voter represents a novel approach, pushing the boundaries of traditional analysis and providing new insights into the mechanisms driving opinion dynamics in complex social systems. The consensus is a significant metric that indicates the level of agreement among agents in a network. Conversely, the frequency of opinion changes reflects a network's ability to maintain its beliefs and showcases the level of volatility in the system. Understanding and mitigating the effects of polarization in complex network systems is of utmost importance, as it can significantly impact both the consensus formation process and the stability of opinions within a network. Both metrics play a crucial role in the comprehension of the behavior of social systems and offer insights into the factors contributing to stability or instability within such systems [40]. This study provides valuable insights into the intricate relationship between network structure and social dynamics, highlighting the potential of complex network measures for analyzing dynamic systems. Additionally, it demonstrates the effectiveness of complex network structures in accurately predicting the consensus time and frequency of opinion changes within the \(Q\)-voter model using machine learning algorithms. The significance of each network feature in these predictions was evaluated, revealing the clustering coefficient (C) and information centrality (IC) as the most influential measures for predicting these outcomes. Furthermore, the robustness of these predictions was tested using three distinct initialization methods in the \(Q\)-voter model, specifically assessing the model's behavior when initialized with high degree, low degree, and a random selection of agents with positive opinions. The article is organized as follows: Section 2 is divided into four parts. The first part introduces the simulated \(Q\)-voter model, Subsection 2.2 describes the investigated networks, Subsection 2.3 explains the network measurements, and Subsection 2.4 presents the machine learning algorithms used for prediction. Section 3 provides the results, and Section 4 is dedicated to relevant observations and conclusions. ## 2 Methods ### Stochastic simulation of \(Q\)-voter model In the context of the \(Q\)-voter model, a group of \(Q\) agents (\(Q\)-voters) influences the opinion of a single agent. This interaction determines the number of neighbors considered by an agent for decision-making, as dictated by the parameter \(Q\). This model is particularly interesting for studies of social dynamics since it captures the impact of group influence, conformity, and social reinforcement on opinion dynamics. Furthermore, it exhibits a rich phase-transition behavior, depending on the value of \(Q\) and network topology, leading to various outcomes such as consensus, fragmentation, and coexistence of opinions [41, 42, 43, 44, 45]. Introduced in [46], its applicability extends to all integer-values of \(Q>\)0, meaning that \(Q\) can encompass a range of values greater than 0. Furthermore, by setting \(Q\)=1, we directly return to the standard voter model. Within this framework, the possibility of repetition is considered, implying that a specific neighbor can be selected multiple times. Thus, when \(Q\) is greater than the number of neighbors (the degree of a node), the opinion of the same neighbor will be taken into account more than once. Consider a network of \(N\) voters (also known as agents, nodes, spins, or individuals). Each is defined by a single dynamical binary variable \(s(x,t)=j\), where \(j=+1\) or \(j=-1\), \(x=1,...,N\), and \(t\) represents time. From a social standpoint, \(s(x,t)\) represents a two-point psychometric scale (yes/no, agree/disagree) opinion of an agent placed at node \(x\) at time \(t\) on a particular subject. The initial fraction of agents with positive opinions (\(p+\)) is fixed at the beginning of the simulation and randomly distributed to the network nodes. Parameter \(\epsilon\) represents the probability of an agent \(x\) acting independently of their neighbors, indicating their unwillingness to yield to group pressure. Consequently, \((1-\epsilon)\) represents conformity, influencing the likelihood of an agent adopting the majority opinion of her/his neighbors. Note that the individual opinion of the selected agent \(x\) is not taken into account in the probability of opinion change or retention in the dynamics. Table 1 shows the fixed parameters of \(Q\)-voter, including the number of nodes in complex networks (\(N=1,000\)), probability of an agent acting independently (\(\epsilon=0.01\)), an initial fraction of agents with positive opinions (\(p+=0.20\)), and the number of neighbors (\(Q=2\)). The value of \(\beta\) represents the probability of an agent changing their opinion to the opposite when there is no consensus among their neighbors. The parameters were fixed toward establishing a consistent baseline for our machine learning-based prediction of consensus time and frequency of opinion changes. Consensus time is the relaxation time of a finite-size system needed to approach a stationary state. By keeping them constant, our exploration can focus on the impact of other variables and a more thorough analysis of our machine learning model's predictive performance regarding the desired outcomes can be conducted. The initial percentage of agents selected was modified to have a positive opinion in three ways: through random agent selection, and by selecting high- and low-degree agents. Algorithm 1 exemplifies the stochastic simulation, followed by an illustration in Figure 1 of the model. In other words, all agents have a binary opinion, represented here by the colors red and blue. Suppose an agent has a red opinion; then, their opinion can be altered based on the following social response: the probability of non-conformity, i.e., reluctance to yield to group pressure, with a probability \(\epsilon\), of changing their opinion. Alternatively, conformity (1-\(\epsilon\)) represents the probability of behaving like their neighbors. If the neighbors share a consensus, meaning they all have the same opinion, the agent will switch to the blue color or remain in the red color. However, if there is no consensus among the neighbors, with a probability \(\beta\), the agent will switch to the blue color, and with a probability of 1-\(\beta\), they will maintain their opinion. ### Networks Nine complex network measures were examined, as discussed in Subsection 2.3. The analysis involved eight distinct topological structures, including Erdos-Renyi [48], Barabasi-Albert linear [49], Barabasi-Albert nonlinear with \(\alpha=0.5\) and \(\alpha=1.5\)[50], Lancichinetti-Fortunato-Radicchi (LFR) graphs [51], Watts-Strogatz [52], Waxman [53], and path graph [54]. The Erdos-Renyi network model is generated by randomly adding connections between nodes with a uniform probability. In contrast, the non-linear \begin{table} \begin{tabular}{l c c} \hline Parameter & Default Value & Description \\ \hline \(N\) & 1,000 & Number of nodes \\ \(\epsilon\) & 0.01 & Probability of an agent acting independently (non-conformity) \\ \(Q\) & 2 & Neighbor consideration for decision-making \\ \(p_{+}\) & 0.20 & Initial fraction of agents with positive opinions \\ \(\beta\) & 0.20 & Probability to alter opinion with no consensus among neighbors \\ \hline \end{tabular} \end{table} Table 1: \(Q\)-voter model parameters with default values. ``` 1:Initialize a complex network of size \(N\) representing the agents 2: Assign each agent a binary variable, \(s(x,t)\) with \(x\in[1,N]\) at time \(t\), whose values +1 or -1 representing two opposing opinions (\(j=+1\) or \(j=-1\)) 3:for each time step \(t\)do 4: Randomly select an agent \(x\) 5: Randomly choose \(Q\) neighbors of agent \(x\) (allowing for repetition) 6:if all \(Q\) neighbors have the same state then 7: agent \(x\) takes the value of the \(Q\) neighbors 8:else 9: agent \(x\) flips with probability \(\epsilon\) 10:endif 11: Update the time 12:endfor ``` **Algorithm 1**\(Q\)-voter model algorithm Figure 1: Illustration of the \(Q\)-voter model: All agents have a binary opinion, represented here by the colors red and blue. Suppose an agent has a red opinion; then, their opinion can be altered based on the following social response: the probability of non-conformity, i.e., reluctance to yield to group pressure, with a probability \(\epsilon\) of changing their opinion. Alternatively, there is conformity (1-\(\epsilon\)), which represents the probability of acting like their neighbors. If the neighbors have a consensus, meaning they all share the same opinion, the agent will switch to the blue color or remain in the red color. However, if there is no consensus among the neighbors, with a probability \(\beta\), the agent will switch to the blue color, and with a probability of 1-\(\beta\), they will maintain their opinion. The figure was created by the authors and is based on [47]. Barabasi-Albert model is constructed iteratively, incorporating preferential attachment of new nodes to existing ones through a non-linear function that considers the node's connections. The LFR model is widely employed for creating networks with realistic community structures, assigning nodes to communities based on degree and community size distributions, and establishing connections that consider both intra- and inter-community links. The Watts-Strogatz model introduces the concept of small-world networks by randomly rewiring a portion of links in a regular lattice. A path graph is a specific type of graph in graph theory that consists of a linear sequence of connected nodes, where each node is linked to the next node in the sequence by a single edge. This creates a structure resembling a straight line of nodes, and it is often used as a simple representation of an ordered sequence of elements or events. A path graph is created by defining the nodes in the desired order and connecting them sequentially with edges. Lastly, the Waxman model takes into account geographic proximity and node attractiveness to determine the formation of connections, considering both physical distances and random appeal. For each of the mentioned networks, Appendix A provides details of the Python functions used, and 100 unique instances were generated, with each network consisting of \(N=1,000\) nodes and an average degree ranging from 9 to 10, that is, the available dataset comprises 800 instances of complex networks (denoted as \(i\)). ### Network Measurements To effectively capture and explain the dataset's predominant variability, a visual representation of the principal component analysis (PCA) plot is provided in Appendix C. This PCA plot serves as a powerful tool for gaining insights into the underlying patterns and structures within the dataset. Subsequently, the \(Q\)-voter model was simulated in each of these structures to measure the time taken to reach consensus (\(Y_{i}\)) and the total number of opinion changes that occurred in the model (\(C_{i}\)). It is hypothesized that both \(Y_{i}\) and \(C_{i}\) can be predicted using a feature vector derived from the network structure, denoted as \(\mathbf{X_{i}}=X_{i1},X_{i2},\ldots,X_{ik}\), where \(X_{ik}\) represents the \(k\)-th measure extracted from network \(i\). The subsequent explanation primarily focuses on the prediction of \(Y_{i}\), although the same process is applied to the prediction of \(C_{i}\). Therefore, the learning model is defined by \[Y_{i}=f(\mathbf{X}_{i})+\delta. \tag{1}\] The goal is to infer the function \(f()\) that relates \(Y_{i}\) to the network measures. Estimating \(Y_{i}\) is treated as a regression problem, where \(\delta\) represents a random error term independent of \(\mathbf{X}_{i}\), following a normal distribution with a mean of zero and a standard deviation of \(\sigma\). While feature selection and model comparison algorithms can be used to identify components of \(\mathbf{X}_{i}\) that contribute to predicting \(Y_{i}\), this study employed conventional network measures which are presented in Table 2. The first measure utilized in this study was the clustering coefficient (C), a local measure, which quantifies the extent to which nodes in a network tend to form tightly connected clusters. It assesses the likelihood of two neighbors of a node being connected, reflecting the local clustering patterns within the network [52]. Closeness centrality (CLC), another local measure, was employed to calculate the proximity of a node to all other nodes in the network. It reflects the average distance between a node and all other nodes, indicating the efficiency of information or resource flow within the local neighborhood of a node [55]. Betweenness centrality (BC) is a measure that identifies nodes acting as critical intermediaries in the network. BC quantifies the extent to which a node lies on the shortest paths between other pairs of nodes, thus indicating its influence over the flow of information or resources within its vicinity [56]. The shortest path length (SPL) measures the minimum number of edges required to traverse between two nodes in the network, providing insights into network connectivity and the efficiency of information or resource transfer within local regions of the network [57]. Degree Pearson correlation coefficient (PC) examines the correlation between the degrees of connected nodes, capturing the tendency of nodes with similar degrees to connect and indicating the presence of assortativity or disassortativity within the network [58]. Information centrality (IC) assesses the importance of a node based on its ability to control the flow of information in the network, considering the number of shortest paths that pass through the node [59]. Subgraph centrality (SC) measures the importance of a node within its local subgraph by considering the closed walks that pass through the node, capturing its influence within specific network neighborhoods [60]. Approximate Current Flow Betweenness Centrality (AC) quantifies the extent to which a node controls the flow of electric current in the network, considering the current paths between all pairs of [61]. Finally, Eigenvector centrality (EC) determines a node's importance based on its neighboring nodes' centrality, assigning higher importance to nodes connected to other important nodes and capturing the concept of influence [62]. Such measures, collectively used here, provide valuable insights into complex network structures, connectivity, efficiency, influence, and community organization [63]. Details and equations for each of the mentioned measures, along with the Python functions used, are provided in B. \begin{table} \begin{tabular}{|c|l|c|} \hline & **Network Measures** & **Acronym** \\ \hline \(X_{1}\) & Clustering coefficient & C \\ \(X_{2}\) & Closeness centrality & CLC \\ \(X_{3}\) & Betweenness centrality & BC \\ \(X_{4}\) & Shortest path length & SPL \\ \(X_{5}\) & Degree Pearson correlation coefficient & PC \\ \(X_{6}\) & Information centrality & IC \\ \(X_{7}\) & Subgraph centrality & SC \\ \(X_{8}\) & Approx. Current flow betweenness centrality & AC \\ \(X_{9}\) & Eigenvector centrality & EC \\ \hline \end{tabular} \end{table} Table 2: Measures of complex networks used here. ### Machine learning algorithms The machine learning algorithms utilized are the least absolute shrinkage and selection operator (LASSO), multi-layer perceptron regressor (MLP), random forest (RF), and extreme gradient boosting (XGBoost). Among the several techniques used to improve the proposed machine learning algorithms, nested cross-validation, shuffle, and grid search are highlighted. The former is a multi-round cross-validation procedure adopted in machine learning for model selection and performance assessment [64]. It is a more rigorous model selection and performance evaluation than traditional cross-validation since it reduces the risk of overfitting and provides a more accurate estimate of the model's performance on unseen data [65]. Its main idea is the existence of an outer loop, which divides the data into training and test sets, and an inner one, which uses cross-validation to determine optimal values for the model's hyperparameters. Shuffle was employed during nested cross-validation to avoid possible biases in the selection of training and testing data, ensuring the model learned in a balanced way throughout the range of data. Finally, grid search searched for the best model hyperparameters by systematically exploring different combinations of possible values for them. The set of techniques used significantly contributed to the development of a more robust and accurate model. A 5-fold outer shuffle cross-validation and a 5-fold inner cross-validation were also adopted, following similar approaches described in previous studies [66]. During the inner folds, a grid search hyperparameter optimization was performed - specific details can be found in Table 1 in the Appendix D. The coefficient of determination, R2, is a metric used to measure how well a regression model fits the data [67]. However, when we add more predictors to the model, R2 can increase even if these new predictors don't really help explain the variation in the dependent variable. To address this, we use the R2 adjusted, which considers the number of predictors and penalizes the inclusion of irrelevant ones. This adjustment gives us a more accurate evaluation of how well our model predicts the outcome. In simpler terms, we prefer R2 adjusted over R2 because it prevents values from being artificially inflated by including unnecessary predictors. This ensures a more reliable assessment of our model's performance. The schematic in Figure 2 provides an overview of the comprehensive process outlined in this article, which encompasses several steps: \(a)\) Generation of complex networks: We generate the eight types of networks under study. \(b_{1})\) Calculation of topological measures: In this step, we compute the nine topological measures for all the previously generated complex networks. \(b_{2})\) Implementation of the \(Q\)-voter model: In this stage, we implement the \(Q\)-voter model on each of the complex networks using three distinct initialization methods represented by colored circles: high-degree (purple), low-degree (green), and random selection (orange). This analysis is performed for both \(Y_{i}\) (consensus time) and \(C_{i}\) (frequency of opinion changes). \(c)\) Creation of the dataset: A dataset is constructed containing information from all generated networks. Each row represents a specific network, and the columns contain topological measure calculations. The dataset also includes values for initialization methods (high-degree, low-degree, and random selection) for both \(Y_{i}\) (consensus time) and \(C_{i}\) (frequency of opinion changes). \(d\)) Application of machine learning algorithms: Based on the collected information, machine learning algorithms are used to conduct further analyses and extract significant insights and summary statistics from the generated data. ## 3 Results Figure 3 presents boxplots illustrating four machine learning algorithms: LASSO (light brown box), RF (pink box), XGBoost (blue box), and MLP (yellow box) for predicting \(Y_{i}\). It is worth noting that RF (box 2, pink) and XGBoost (box 3, blue) exhibit the tallest boxes, indicating their tendency to yield higher average adjusted R2 values compared to the other algorithms. Furthermore, LASSO, RF, and XGBoost consistently produce the best results across all initialization methods, including high degree, low degree, and random selection. These three algorithms were selected for further analysis to predict \(C_{i}\), and the results are presented in Figure 4. Remarkably, LASSO (box 1, light brown) and RF (box 2, pink) emerge as the tallest boxes, suggesting their inclination to yield higher average adjusted R2 values compared to XGBoost. For this reason, we chose the RF algorithm, which stood out as the best in both figures, to illustrate the following figures (Figure 5 and Figure 6). In Figures 5-A and B, we refer to the variables \(Y_{i}\) and \(C_{i}\), respectively, and illustrate the relationship between predicted values (\(\hat{\mathrm{y}}\)) on the y-axis and their corresponding original values (y) on the x-axis. Each point in the plot represents a specific data instance, where the x-coordinate indicates the actual value, and the y-coordinate represents the predicted value. The red dotted line represents a linear regression model, which provides an approximation of the overall trend in the data, aiding in the visualization of our model's predictive performance. For \(Y_{i}\) (Figure 5-(A)), we calculated Pearson's correlation coefficients, resulting in values of 0.998 for high-degree initialization (purple dots), 0.991 for low-degree initialization (green dots), and 0.990 for random selection (orange dots). Additionally, we computed the adjusted R2 values, which were 0.996, 0.982, and 0.968, respectively, for the same initialization methods. For \(C_{i}\) (Figure 5-(B)), we also calculated Pearson's correlation coefficients, yielding values of 0.999 for high-degree initialization, 0.991 for low-degree initialization, and 0.991 for random selection. The adjusted R2 values were 0.997, 0.983, and 0.945, respectively. These results underscore the correlations observed between the original and predicted values for both \(Y_{i}\) and \(C_{i}\), regardless of the initialization method used. The RF algorithm assessed the input variables (network features) in our model. It evaluates the significance of variables by observing the improvement they provide to the model when incorporated into decision trees. The prioritization of network features based on their average importance across different initialization methods, as depicted in Figure 6, provides valuable insights into their predictive capabilities. In this analysis, the features were ranked according to their average importance, considering Figure 2: Schematic Overview of the process outlined in this article. The process involves several key steps: a) Generation of complex networks: In this initial step, we create complex networks for analysis. In this illustrative example, we generate four networks labeled as \(i=1\), \(i=2\), \(i=3\), and \(i=4\), each consisting of a total of 10 nodes. It’s worth noting that in our article, we generate a set of 800 complex networks. \(b_{1}\)) Calculation of topological measures: In this step, we compute various topological measures for all the previously generated complex networks. However, for the sake of simplification in this illustration, we focus on a single measure: Betweenness Centrality (BC). We apply this calculation to one of the four networks, specifically network \(i=4\). \(b_{2}\)) Implementation of the \(Q\)-voter model: In this stage, we implement the \(Q\)-voter model on each of the complex networks using three distinct initialization methods represented by colored circles: high-degree (purple), low-degree (green), and random selection (orange). This analysis is performed for both \(Y_{i}\) (consensus time) and \(C_{i}\) (frequency of opinion changes). For the sake of simplification, we select only network \(i=4\) to illustrate this process. \(c\)) Creation of the dataset: In this step, we construct a dataset that contains information from all the generated networks. Each row of the table represents a specific network, and the columns contain the calculations of topological measures for these complex networks. Additionally, we include the corresponding values for initialization methods (high-degree, low-degree, and random selection) regarding \(Y_{i}\) and \(C_{i}\). For illustration purposes, we present information only for network \(i=4\), including BC and \(Y_{i}\). However, in the full article, our table encompass 800 rows and 15 columns, comprising nine topological measures, along with three variations of initialization methods for \(Y_{i}\) and \(C_{i}\). \(d\)) Application of machine learning algorithms: Finally, based on the gathered information, we apply machine learning algorithms to conduct further analyses and obtain significant insights and summary statistics from the data generated in the previous steps. three initialization methods: high degree (purple bar), low degree (green bar), and random selection (orange bar). Upon analyzing the bar chart (Figure 6), it becomes apparent that network features with higher average importance occupy the top positions. Notably, when attempting to predict \(Y_{i}\), the clustering coefficient (C) emerges as the most significant measure (Figure 6-A). This indicates that the network's structure, particularly the formation of cohesive groups, plays a crucial role in the speed of consensus attainment within the \(Q\)-voter model. In terms of \(C_{i}\), information centrality (IC) stands out as the most relevant network measure (Figure 6-B). This suggests that the dissemination and influence of information within the network play a fundamental role in the dynamics of opinion changes. These network measures play vital roles in predicting different aspects of the \(Q\)-voter model. These inferences underscore the significance of different network aspects concerning the various phenomena under study. While the C focuses on consensus formation, IC pertains to opinion changes. These findings offer valuable insights for comprehending and forecasting the behavior of voter models in broader contexts. In contrast, measures such as eigenvector centrality (EC), Degree Pearson correlation coefficient (PC), and subgraph centrality (SC) do not exhibit significant predictive capabilities in these scenarios. Also, note that, individually, the CLC (represented by the purple bar in Figure 6-A) becomes more relevant in networks initialized with a high degree of connectivity, while the AC (indicated by the orange bar in Figure 6-A) is more significant in the randomly initialized networks. CLC gains importance when the dynamics of the \(Q\)-voter model are initiated by selecting nodes with a higher degree, as it measures how easily a node can communicate or influence other nodes in the network. When starting the dynamics with high-degree nodes, these high-degree nodes can have a substantial influence on the spread of opinions, and CLC can capture this capacity for influence. Similarly, the significance of the AC centrality measure when initiating the dynamics of the \(Q\)-voter model by selecting nodes randomly may be related to the definition of this centrality measure and the dynamics of opinion propagation in the \(Q\)-voter model on a network. AC is a measure that reflects the efficiency with which a node can transmit information or influence others in the network. When the dynamics of the \(Q\)-voter model are initiated randomly, there is no initial preference for high-degree or low-degree nodes. Therefore, it is crucial to identify nodes that can effectively facilitate the spread of opinions throughout the network, and AC can highlight nodes playing an important role in this regard. Finally, the learning curve was calculated specifically for the two best results achieved using the high-degree initialization method for \(Y_{i}\) (adjusted R2 = 0.996) and \(C_{i}\) (adjusted R2 = 0.997). By manipulating the size of the training set, the learning curve offers valuable insights into the model's predictive capabilities [68]. This approach provides the advantage of understanding how the model's performance improves as more training instances are used, focusing on the most promising initialization methods. The findings depicted in Figures D1 indicate that the complete database is not indispensable for achieving the highest level of validation accuracy. Surprisingly, even with a mere 200 training instances, the model demonstrated exceptional performance. These results emphasize that a relatively smaller training set can still yield satisfactory results. ## 4 Conclusions In this article, we predicted dynamic variables associated with \(Q\)-voter models based on network properties. We verified that the prediction is very accurate and determined which features most contribute to the emergence of polarization. Mainly, we show that the clustering coefficient and information centrality are the most important measures to quantify these patterns of connections. Moreover, variations in the initialization method, to start the dynamic of the \(Q\)-voter model with a positive opinion, were performed to predict consensus of the time (\(Y_{i}\)) and frequency of opinion changes (\(C_{i}\)). Initially, agents were randomly selected, following the original method of the \(Q\)-voter model. Subsequently, agents with the highest degree were identified and selected to Figure 3: Each boxplot represents the distribution of adjusted R2 values for the corresponding machine learning algorithms (LASSO, RF, XGBoost, and MLP), considering different initialization methods (high degree, low degree, and random selection) to predict \(Y_{i}\). Among the algorithms, box 2 and box 3 correspond to the RF and XGBoost algorithms, respectively, and show the highest adjusted R2 values. This indicates that, on average, the RF and XGBoost algorithms outperform the other algorithms (LASSO and MLP) in terms of predictive accuracy. investigate their potential for strongly influencing the overall opinion dynamics due to their extensive connections. Lastly, agents with the lowest degree of connectivity were considered initiators of the dynamics to explore the potential impact of less influential agents on opinion evolution. Although modifications in the initialization methods of positive opinions affect the results, their impact is relatively small. Indeed, subsequent interactions and information exchange among agents tend to overshadow the influence of the initially selected agents, leading to a consensus of opinions and a limited long-term impact of the initial agent selection. Nonetheless, the exploration of the role of both highly connected and less connected agents provided valuable insights into the complex dynamics of opinion formation and consensus emergence within the \(Q\)-voter model. We found that, regardless of the initialization method used to start the Q-voter model, the initial influence of the selected agents tends to decrease over time. This occurs because, as agents interact and exchange information, their opinions are influenced by others. Over time, opinions begin to converge towards a consensus, and the initial influence of randomly selected, high- or low-connectivity agents becomes equivalent Figure 4: Each boxplot represents the distribution of adjusted R2 values for the corresponding machine learning algorithm (LASSO, RF, and XGBoost), considering different initialization methods (high degree, low degree, and random selection) to predict \(C_{i}\). Box 1, which corresponds to the LASSO algorithm, is the highest. This indicates that, on average, the adjusted R2 values for the LASSO algorithm are higher compared to the other algorithms (RF and XGBoost) considered. since there is not a significantly superior initialization method over the others; all of them yield equally good results. When we say that the absence of influential agents contributes to a more efficient consensus, we mean that the absence of agents with disproportionate influence in the network means that each agent plays a similar role in shaping the collective opinion. This is important because polarization often occurs when a few extremely influential agents have a disproportionate impact on others' opinions. In the article [69], the authors investigate the influence of highly connected individuals in opinion dynamics. Their research illustrates that a small number of highly connected individuals can significantly influence the polarization of opinions within a network. Furthermore, Sunstein's book 'Republic: Divided Democracy in the Age of Social Media' [70] provides insights into the role of online platforms and highly influential users in shaping public discourse, potentially leading to polarization. If all agents have similar influence, it is less likely that a few highly influential agents dominate the conversation and pull the collective opinion to opposite extremes. Figure 5: Illustration showing the relationship between their corresponding original values (y) and predicted values (\(\hat{y}\)) for (A) Time and (B) Frequency regarding the selection of agents with high degree (purple dots), low degree (green dots), and random selection (orange dots) for the initiation of dynamics. This analysis was conducted using the RF algorithm. Therefore, the absence of highly influential agents can contribute to a more balanced and less polarized decision-making process. Expanding our methodology to explore the variance prediction within the \(Q\)-voter model can provide further insights into the factors that contribute to diverse outcomes in social dynamics. Future work in this direction will contribute to a more comprehensive understanding of the complex nature of polarization and its potential implications. By leveraging machine learning algorithms and complex network features, this study can advance research in the field of complex systems and pave the way for future investigations on the dynamics of polarization in various social contexts. Overall, the combination of machine learning algorithms and complex network analysis has the potential to revolutionize our comprehension of social systems, leading to a Figure 6: The examination of the most crucial features, which are determined based on the average importance of complex network measures, was conducted to predict both (A) \(Y_{i}\) and (B) \(C_{i}\) using various initialization methods. These methods encompassed the selection of agents with the highest degree (purple bars), lowest degree (green bars), and random selection (orange bars) to initiate the dynamics. Notably, the clustering coefficient (C) and information centrality (IC) consistently emerged as the two most significant measures in both scenarios. This analysis was carried out employing the RF algorithm. deeper understanding of human behavior and the development of strategies that promote positive societal outcomes. A.M.P acknowledges the support of the Sao Paulo Research Foundation (FAPESP), grant 2021/13843-2. P. K. gratefully acknowledges support from the Engineering and Physical Sciences Research Council and Medical Research Council through the Mathematics of Systems I Centre for Doctoral Training at the University of Warwick (reference EP/L015374/1). F.A.R. acknowledges CNPq (grant 309266/2019-0) and FAPESP (grant 19/23293-0) for the financial support given for this research. This research was conducted with the computational resources of the Center for Research in Mathematical Sciences Applied to Industry (CeMEAI) funded by FAPESP, grant 2013/07375-0. ## Appendix A Construction of Complex Networks In this appendix, parameters involved in network generation are presented in tabular format. The network values were adjusted to ensure that the average degree of all networks fell within the range of 9 to 10. * **Erdos-Renyi:** We used the nx.erdos_renyi_graph function from NetworkX to create an Erdos-Renyi network [71]. The following table provides information concerning the creation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **p**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **n**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **n**: The number of nodes in the network. * **n**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **n**: The number of nodes in the network. * **n**: The probability for edge creation. The model chooses each of the possible edges with probability \(p\). * **seed**: Indicator of random number generation state. In our case, it is set to None, which means the default random number generation state is used. * **directed**: If True, this function returns a directed network. In our case, it is set to False, indicating that the network is undirected. * **Barabasi Linear, Barabasi Non-Linear (0.5), Barabasi Non-Linear (1.5):** We employed the graph.Barabasi function to create networks following the Barabasi-Albert model [72]. The subsequent table furnishes specific details regarding the generation of this network. **Parameter Descriptions:** * **n**: The number of nodes in the network. * **n**: The number of nodes in the network. * **n**: The number of nodes in the generated network. In the example, 1000 nodes were created. * **m**: The number of outgoing edges generated for each node or a list containing the number of outgoing edges for each node explicitly. In the example, each node has 5 outgoing edges. * **outpref**: A boolean value that determines whether the out-degree of a node affects its citation probability. In the example, it is set to True. * **directed**: A boolean value that determines whether the generated network is directed. In the example, it is set to False, indicating that the network is undirected. * **power**: The power constant of the nonlinear model. In the example, the value is 1.0, representing the linear model. * **zero_appeal**: The attractiveness of nodes with degree zero. In the example, it is set to 1. * **implementation**: The algorithm used to generate the network. In the example, it is set to psumtree, which uses a partial prefix-sum tree. * **start_from**: If provided and not None, this parameter uses another network as a starting point for the preferential attachment model. In the example, no starting network is specified (None). Note that to generate the Barabasi networks in a non-linear manner, we modified the power parameter to 0.5 and later to 1.5. * **LFR (Lancichinetti-Fortunato-Radicchi Benchmark)**: We generated LFR networks using the LFR_benchmark_graph function [73]. A table following this one provides information on how this network was generated. **Parameter Descriptions:** \begin{table} \begin{tabular}{|l|l|} \hline **Parameter** & **Value** \\ \hline \(n\) & 1000 \\ \(\tau_{1}\) & 3 \\ \(\tau_{2}\) & 1.5 \\ \(\mu\) & 0.1 \\ \(average\_degree\) & 10 \\ \(min\_degree\) & None \\ \(max\_degree\) & None \\ \(min\_community\) & 100 \\ \(max\_community\) & None \\ \(tol\) & \(1\times 10^{-7}\) \\ \(max\_iters\) & 500 \\ \(seed\) & 10 \\ \hline \end{tabular} \end{table} Table 3: Parameters for the LFR Benchmark network model. * **n**: Number of nodes in the created network. * \(\tau_{1}\): Power law exponent for the degree distribution of the created network. This value must be strictly greater than one. * \(\tau_{2}\): Power law exponent for the community size distribution in the created network. This value must be strictly greater than one. * \(\mu\): Fraction of inter-community edges incident to each node. This value must be in the interval \([0,1]\). * **average_degree**: Desired average degree of nodes in the created network. This value must be in the interval \([0,n]\). * **min_degree**: Minimum degree of nodes in the created graph. This value must be in the interval [0, n]. * **max_degree**: Maximum degree of nodes in the created network. If not specified, this is set to \(n\), the total number of nodes in the network. * **min_community**: Minimum size of communities in the network. If not specified, this is set to min_degree. * **max_community**: Maximum size of communities in the network. If not specified, this is set to \(n\), the total number of nodes in the network. * **tol**: Tolerance when comparing floats, specifically when comparing average degree values. * **max_iters (int)**: The maximum number of iterations to attempt in order to create community sizes, degree distribution, and community affiliations. * **seed(integer, random_state, or None - default)**: An indicator of the random number generation state. * **Watts-Strogatz:** We used the nx.watts_strogatz_graph from the NetworkX library to generate a Watts-Strogatz network [74]. The following table contains information about the values of each parameter of this network. **Parameter Descriptions:** * **n**: The number of nodes. * **k**: Each node is joined with its k nearest neighbors in a ring topology. * **p**: The probability of rewiring each edge. * **Waxman:** We used the nx.waxman_graph function from the NetworkX library to generate a Waxman network [75]. **Parameter Descriptions:** \begin{table} \begin{tabular}{|c|c|} \hline **Parameter** & **Value** \\ \hline n & 1000 \\ k & 10 \\ p & 0.01 \\ \hline \end{tabular} \end{table} Table 4: Parameters for the Watts-Strogatz network model. * **n**: Number of nodes. * _beta_: Model parameter. * \(alpha\): Model parameter. * **L**: The maximum distance between nodes is set to be the maximum distance between any pair of nodes. * **domain**: Domain size, given as a tuple of the form (\(x\_min\), \(y\_min\), \(x\_max\), \(y\_max\)). * **metric**: Euclidean distance metric is used. * **seed (integer, random_state, or None)**: Indicator of random number generation state (default is None). * **Path:** We used the nx.path_graph function from the NetworkX library to generate this network [76]. Note that in our code available on GitHub here for generating networks, we have added specific lines of code for the path graph to ensure that the average degree falls within the range of 9 to 10, aligning with the characteristics of the other networks generated. **Parameter Descriptions:** * **n**: Number of nodes. ## Appendix B Network Measurement Details ### Clustering coefficient (C) The local clustering coefficient (C) is an important metric in network and graph analysis that quantifies the tendency of neighbors of a node in a network to cluster together. In other words, it measures the degree of connectivity among the direct neighbors of a specific node, which is useful for understanding community structure and cohesion \begin{table} \begin{tabular}{|c|c|} \hline **Parameter** & **Value** \\ \hline n & 1000 \\ \hline \end{tabular} \end{table} Table 6: Parameters for the Path network model. \begin{table} \begin{tabular}{|c|c|} \hline **Parameter** & **Value** \\ \hline n & 1000 \\ beta & 0.12 \\ alpha & 0.1 \\ L & None \\ domain & (0, 0, 1, 1) \\ metric & function \\ seed & None (default) \\ \hline \end{tabular} \end{table} Table 5: Parameters for the Waxman network model. within a network. The mathematical formula for calculating C of a node \(v\) in a graph is as follows: \[C(v)=\frac{2*E(v)}{k_{v}*(k_{v}-1)}\] (11) where: \(C(v)\) is the local clustering coefficient of node \(v\). * \(E(v)\) is the number of edges between the direct neighbors of \(v\) (i.e., the triangles that include node \(v\)). * \(k_{v}\) is the degree of node \(v\), which is the number of direct neighbors it has. The **transitivity_local_undirected(mode="zero")** is a Python function commonly employed in network analysis using the Igraph library. This function calculates the C for individual nodes within a graph. It operates in "zero" mode, which specifically considers triangles in the network that share exactly one node with the node being analyzed. The output of this function is a data structure, typically a list or a similar container, containing the C corresponding to each node in the graph. Finally, we calculate the mean to get a final value. ### **Closeness Centrality (CLC)** Local closeness centrality (CLC) is a network analysis metric that measures how close a node is to all the other nodes in its local neighborhood within a graph. It quantifies how quickly information can spread from a specific node to its neighboring nodes. Nodes with higher CLC are considered to be more central within their local environment, as they can reach other nodes more efficiently. The mathematical formula for the CLC of a node \(v\) is as follows: \[CLC(v)=\frac{1}{\sum_{u\neq v}}d(v,u)\] where: * \(CLC(v)\) is the local closeness centrality of node \(v\). * \(d(v,u)\) represents the shortest path distance between nodes \(v\) and \(u\) in the graph. The \(\sum\) in the denominator calculates the sum of the shortest path distances from node \(v\) to all other nodes \(u\) in its local neighborhood. The **closeness_centrality(normalized=True)** function is a commonly used Python function in network analysis using the Igraph library. This function calculates CLC measures for each node in a graph. When we use normalized=True, it indicates that we want the CLC values to be normalized. In other words, the values are adjusted to be within the range of 0 to 1, making these measures comparable across different graphs, regardless of the network's size or scale. Finally, by calculating the average of these normalized measures, we obtain a representative value of the average closeness centrality in the network, which is useful for assessing the communication efficiency of nodes within their respective local environments. ### **Betweenness Centrality (BC)** Betweenness Centrality (BC) is a fundamental metric in network analysis that assesses the importance of nodes as crucial intermediaries in communications within a network. Mathematically, the formula for calculating the BC of a node is as follows: \[BC(v)=\sum_{s\neq v\neq t}\frac{\phi_{st}(v)}{\phi_{st}}\] where: * \(BC(v)\) is the betweenness centrality of node \(v\). * \(\phi_{st}\) is the total number of shortest paths (geodesics) between nodes \(s\) and \(t\). * \(\phi_{st}(v)\) is the number of shortest paths between \(s\) and \(t\) that pass through node \(v\). The **betweenness_centrality()** function is a specific feature of the NetworkX library, widely used for network analysis in Python. This function is responsible for calculating BC in a graph. Essentially, it assesses the importance of each node within the graph by measuring how often a node acts as a crucial bridge in the shortest paths between other nodes in the network. The result of this function is a dictionary where the keys represent the nodes in the graph, and the corresponding values are the BC measures associated with these nodes. This analysis is valuable for identifying nodes that play a critical role as intermediaries in communication or the transportation of information within a network. ### **Shortest path length (SPL)** The Shortest Path Length (SPL), also known as the length of the shortest path, is a metric that describes the distance between two nodes in a graph, representing the minimum number of edges or weighted edges required to travel from node A to node B within the network. The formula to calculate the SPL between two nodes can be described as: * SPL(A, B) = the smallest number of edges between nodes A and B. In Python, we can calculate the SPL libraries such as Igraph. For example, the **average_path_length()** function in calculates the average shortest path length between nodes in the network, providing a valuable measure for evaluating the efficiency of transportation, communication, and connectivity in a network. ### **Degree Pearson correlation coefficient (PC)** The Pearson Correlation Coefficient for Degrees (PC) is a metric that assesses the linear relationship between the degrees of nodes in a graph. It measures the tendency of nodes with similar degrees to connect or whether they prefer to link to nodes with different degrees. This measure is important for understanding how the network is organized in terms of node degrees, indicating whether there is a tendency for assortativity (positive correlation) or disassortativity (negative correlation) in the network's connectivity. The formula for calculating the PC is given by: \[PC=\frac{\sum_{(x_{i}-\hat{x})*(y_{i}-\hat{y})}}{\sum(x_{i}-\hat{x})^{2}*\sum(y_ {i}-\hat{y})^{2}}\] where: * \(PC(v)\) is the Pearson Correlation Coefficient. * \(x_{i}\) and \(y_{i}\) are the degrees of the nodes. * \(\hat{x}\) and \(\hat{y}\) are the means of the node degrees. In Python, we can calculate the Pearson Correlation Coefficient for Degrees using libraries such as NetworkX. The functions **degree_pearson_correlation_coefficient()** in NetworkX can be used to calculate this measure on a graph represented by the respective libraries. The result will inform us about the nature of the network's connectivity about node degrees, which is useful for network analysis and characterization. ### **Information centrality (IC)** Information centrality (IC) is a network metric used to assess the importance of nodes in a graph in terms of how they facilitate the flow of information or communication within the network. This metric is based on the idea that some nodes may act as critical points for the efficient dissemination of information in a network. Information centrality measures the amount of information a node is capable of controlling or transmitting to other nodes in the network. The mathematical formula for IC is defined as: \[IC(v)=\sum_{u\neq v}\frac{1}{d(v,u)}\] where: * \(IC(v)\) is the information centrality of node \(v\). * \(\sum\) represents the sum over all nodes \(u\) different from \(v\). * \(d(v,u)\) is the geodesic distance between nodes \(u\) and \(v\), i.e., the length of the shortest path between them. This formula calculates the information centrality of a node by summing the inverses of the geodesic distances between the node in question \(v\) and all other nodes \(u\) in the graph. The shorter the path between \(v\) and \(u\), the greater the contribution of node \(u\) to the information centrality of \(v\). Therefore, nodes that are closer to \(v\) will have a higher contribution to its information centrality. In Python, we can use the **information_centrality()** function from NetworkX to calculate the IC for the nodes in a graph. The function returns a dictionary where the keys are the nodes in the graph, and the values are the corresponding information centrality scores. This allows us to identify the most critical nodes in the network in terms of their ability to influence the flow of information. ### **Subgraph centrality (SC)** Subgraph centrality is a network centrality (SC) metric that assesses the importance of a node based on how many subgraphs containing that node are connected in the network. In other words, it measures how central a node is in terms of its participation in interconnected subgraphs. The mathematical formula for SC is defined as follows: \[SC(v)=\sum_{S\subseteq N\setminus\{v\}}\left(\frac{1}{1+|E(S)|}\right) \tag{2.2}\] where: * \(SC(v)\) is the subgraph centrality of node \(v\). * \(S\) is a subset of the neighbors of \(v\). * \(N\) is the set of neighbors of \(v\). * \(E(S)\) is the number of edges in the subgraph induced by \(S\). This formula calculates the SC of a node \(v\) by summing the contributions of all subsets of its neighbors. The more subsets contain \(v\), and the more these subsets are interconnected (have fewer edges), the higher the subgraph centrality of \(v\). In Python, we can use the **subgraph_centrality()** function from NetworkX to calculate the SC for the nodes in a graph. The function returns a dictionary where the keys are the nodes in the graph, and the values are the corresponding SC scores. This allows us to identify nodes that play a crucial role in connecting interconnected subgraphs in the network. Keep in mind that the calculation can be computationally expensive in large networks due to the need to evaluate many subsets of neighbors for each node. ### **Approx. Current flow betweenness centrality (AC)** Approximate current flow betweenness centrality is a metric that assesses the importance of nodes based on their ability to influence the flow of electrical current within a network. Unlike the traditional approach to betweenness centrality, which precisely calculates exact paths, this methodology employs numerical methods, such as Monte Carlo algorithms, to estimate the flow of current between all pairs of nodes in the network. This approach makes it suitable for large-scale and complex networks. To calculate this centrality metric in Python, we use the **approximate_current_flow_betweenness_centrality** function from the NetworkX library. The result is a dictionary that associates each node in the network with its approximate centrality value. This metric plays a vital role in network analysis across various domains, aiding in the identification of key points of control and influence. ### **Eigenvector centrality (EC)** Eigenvector centrality (EC) is a measure of centrality in a network or graph that assesses the relative importance of a node based on its connections to other nodes in the network. The underlying idea is that nodes connected to other important nodes are themselves important. Therefore, eigenvector centrality takes into account not only the number of connections a node has but also the importance of the nodes to which it is connected. The mathematical formula to calculate the EC of a node in a graph is defined by the following equation: \[EC(v)=\frac{1}{\lambda}\sum_{u\in N(v)}w(u,v)\cdot C(u)\] where: * \(EC(v)\) is the eigenvector centrality of node \(v\). * \(\lambda\) is the eigenvalue associated with the largest eigenvalue of the adjacency matrix of the graph. * \(\sum\) represents the sum over all nodes \(u\) connected to node \(v\). * \(w(u,v)\) is the weight of the edge between nodes \(u\) and \(v\). * \(C(u)\) is the eigenvector centrality of node \(u\). The **eigenvector_centrality()** function is part of the Igraph library in Python, used to calculate eigenvector centrality in a graph. EC is a measure that assesses the importance of nodes in a graph based on their connections, taking into account the importance of the nodes to which they are connected. The EC values are not scaled, meaning they reflect the raw measure of importance for each node in the graph. To obtain a single centrality measure for the entire graph, it's common to calculate the average of the centrality values for all nodes. The Python code used to generate the \(Q\)-voter model, as well as the complex networks and measures of complex networks, is available for access at [77]. ## Appendix C Principal Component Analysis (PCA) The analysis of cumulative explained variance provides valuable insights into the dimensionality reduction achieved by the PCA algorithm. The plot of cumulative explained variance illustrates the amount of information retained as the number of principal components increases (Figure 12). This information helps determine the minimum number of principal components required to capture a significant portion of the original data's variability, considering the dataset with 800 rows and 9 columns. This analysis is crucial for making decisions regarding the dimensionality reduction process, in the context of changing network topologies every 100 rows. On the other hand, the plot of the reduced data using the principal components visually represents the transformed dataset in a lower-dimensional space (Figure 12). By visualizing the data in this reduced space, which is particularly important in the case of high-dimensional data with 9 complex network measures, a better understanding of its structure and potential patterns or clusters that may exist is gained. These plots play a vital role in validating the effectiveness of the PCA algorithm in capturing the most relevant features of the data while reducing its dimensionality, considering the complexity and diversity of the network measures across different network topologies. Additionally, the proximity of data points in the reduced space reflects the similarity between the models, allowing for the identification of clusters or groupings within each network topology and across different topologies. This further aids in understanding the relationships and similarities among different instances in the dataset, facilitating comparative analysis and identification of common characteristics or trends. Overall, these plots provide valuable insights into the data, aiding in analysis, interpretation, and model comparison, particularly in the context of complex networks with multiple measures and changing topologies. ## Appendix D Grid search hyperparameter tuning Table D1 shows the hyperparameters optimized by grid search. \begin{table} \begin{tabular}{l l l} \multicolumn{2}{c}{**Table D1.** Hyperparameters for each machine learning algorithm optimized by grid search optimizer.} \\ \hline **Predictor** & \multicolumn{2}{c}{**Hyperparameters and description**} & \multicolumn{2}{c}{**Values**} \\ \hline \multirow{6}{*}{**RF**} & - max\_depth: Maximum depth of the tree. & [10,20,30,40,50] \\ & - max\_features: Number of features to be considered & [2,3,4] \\ & toward a best split. \\ \cline{2-3} & - min\_samples\_leaf : Minimum number of & [1,2,4] \\ & samples required to be at a leaf node. \\ & - min\_samples\_split: Minimum number of & [2,5,10] \\ & samples for the split of an internal node. \\ & - n\_estimators: Number of trees in the forest. & [100,200,300] \\ \hline **LASSO** & - regularization parameter. & range 0.0001 to 0.0005 \\ \hline \multirow{6}{*}{**MLP**} & - activation: Activation function for the hidden layer. & [identity, logistic, tanh, relu] \\ & - solver: Solver for weight optimization. & [lbfgs, sgd, adam] \\ & - alpha: L2 penalty (regularization term) parameter. & [0.0001,1e-5,0.01,0.001] \\ & - batch\_size: Size of minibatches for stochastic optimizers. & [1000,5000] \\ & - learning\_rate: Learning rate schedule for weight updates. & [constant, invscaling, adaptive] \\ & - learning\_rate\_init: Initial learning rate used. & [0.001,0.01,0.1,0.2,0.3] \\ \hline \multirow{2}{*}{**XGBoost**} & - subsample: fraction of observations to be & [0.6,0.8,1.0] \\ & randomly sampled in each tree. \\ \cline{2-3} & - max\_depth: maximum depth of each tree. & [3,4,5] \\ \hline \end{tabular} \end{table} Table D1: Hyperparameters for each machine learning algorithm optimized by grid search optimizer.

2303.09009

Accelerated Gradient and Skew-Symmetric Splitting Methods for a Class of Monotone Operator Equations

A class of monotone operator equations, which can be decomposed into sum of a gradient of a strongly convex function and a linear and skew-symmetric operator, is considered in this work. Based on discretization of the generalized gradient flow, gradient and skew-symmetric splitting (GSS) methods are proposed and proved to convergent in linear rate. To further accelerate the convergence, an accelerated gradient flow is proposed and accelerated gradient and skew-symmetric splitting (AGSS) methods are developed, which extends the acceleration among the existing works on the convex minimization to a more general class of monotone operator equations. In particular, when applied to smooth saddle point systems with bilinear coupling, an accelerated transformed primal-dual (ATPD) method is proposed and shown to achieve linear rates with optimal lower iteration complexity.

Long Chen, Jingrong Wei

2023-03-16T00:49:54Z

http://arxiv.org/abs/2303.09009v1

Accelerated Gradient and Skew-Symmetric Splitting Methods for A Class of Monotone Operator Equations ###### Abstract A class of monotone operator equations, which can be decomposed into sum of a gradient of a strongly convex function and a linear and skew-symmetric operator, is considered in this work. Based on discretization of the generalized gradient flow, gradient and skew-symmetric splitting (GSS) methods are proposed and proved to convergent in linear rate. To further accelerate the convergence, an accelerated gradient flow is proposed and accelerated gradient and skew-symmetric splitting (AGSS) methods are developed, which extends the acceleration among the existing works on the convex minimization to a more general class of monotone operator equations. In particular, when applied to smooth saddle point systems with bilinear coupling, an accelerated transformed primal-dual (ATPD) method is proposed and shown to achieve linear rates with optimal lower iteration complexity. Keywords:Monotone operator accelerated iterative method dynamical system convergence analysis Lyapunov function saddle point problem Msc: 37N40 47H05 47J25 65B99 65J15 65L20 ## 1 Introduction Consider the nonlinear equation \[\mathcal{A}(x)=0,\quad x\in\mathbb{R}^{n}, \tag{1}\] ###### Abstract We consider the (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-Gaussian (generalized)-(generalized)-Gaussian (generalized)-Gaussian (generalized)-(generalized)-Gaussian (generalized)-(generalized)-Gaussian (generalized)-(generalized)-(generalized)-Gaussian (generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)-(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized-)(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized))-(generalized(generalized))-(generalized(generalized))-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)(generalized)-(generalized)(generalized)-generalized(generalized))(generalized(generalized)-generalized(generalized))-(generalized(generalized))-(generalized(generalized))-(generalized(generalized))(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized(generalized))-(generalized(generalized))-(generalized(generalized))-(generalized)(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized)(generalized)(generalized)-(generalized)(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized(generalized))-(generalized)(generalized)-(generalized)(generalized(generalized))-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized)(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized)(generalized)-(generalized)(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized(generalized))(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized)-(generalized))-(generalized(generalized))-(generalized(generalized))(generalized)-(generalized)(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized)(generalized)(generalized)-(generalized))-(generalized())(generalized(generalized))-(generalized)(generalized))-(generalized()(generalized))-(generalized(generalized))-(generalized)(generalized))-(generalized(generalized))-(generalized(generalized))-(generalized)(generalized)-(generalized)(generalized)-(generalized))(generalized-(generalized))-(generalized)(generalized)(generalized)-(generalized)(generalized)-(generalized)(generalized))-(generalized(generalized))-(generalized)(generalized)-(generalized)(generalized)-(generalized))(generalized)-(generalized)(generalized)-(generalized))(generalized-(generalized))(generalized)-(generalized)(generalized))-(generalized)(generalized)(generalized)-(generalized)(generalized))-(generalized)(generalized)-(generalized))(generalized())-(generalized)(generalized)-(generalized)((generalized))-(generalized)(generalized)-(generalized))(generalized)-(generalized)((generalized))-(generalized))-(generalized)((generalized))-(generalized)(generalized))-(generalized())(generalized)-(generalized))(generalized())-(generalized)(generalized))-(generalized)(generalized))(generalized-((generalized)))-(generalized())-generalized()(generalized))((generalized))-(generalized(generalized))-(generalized)(generalized))( generated so that \((u_{k},p_{k})\in\mathcal{H}_{k}^{u}\times\mathcal{H}_{k}^{p}\), with \(\mathcal{H}_{0}^{u}=\operatorname{Span}\left\{u_{0}\right\}\), \(\mathcal{H}_{0}^{p}=\operatorname{Span}\left\{p_{0}\right\}\), and \[\begin{array}{l}\mathcal{H}_{k+1}^{u}:=\operatorname{Span}\left\{u_{i}, \nabla_{u}\mathcal{L}\left(\tilde{u}_{i},\tilde{p}_{i}\right):\forall\tilde{u} _{i}\in\mathcal{H}_{i}^{u},\tilde{p}_{i}\in\mathcal{H}_{i}^{p},0\leq i\leq k \right\},\\ \mathcal{H}_{k+1}^{p}:=\operatorname{Span}\left\{p_{i},\nabla_{p}\mathcal{L} \left(\tilde{u}_{i},\tilde{p}_{i}\right):\forall\tilde{u}_{i}\in\mathcal{H}_{ i}^{p},\tilde{p}_{i}\in\mathcal{H}_{i}^{u},0\leq i\leq k\right\}.\end{array}\] In [37], it is shown that if the duality gap \(\Delta(u,p):=\max_{q}\mathcal{L}(u,q)-\min_{v}\mathcal{L}(v,p)\) is required to be bounded by \(\epsilon_{\mathrm{out}}\), the number of iterations needed is at least \[\Omega\left(\sqrt{\kappa(f)+\kappa^{2}(\mathcal{N})+\kappa(g)}\cdot|\ln \epsilon_{\mathrm{out}}|\right)\] where \(\kappa(f),\kappa(g)\) are condition numbers of \(f,g\) respectively, \(\kappa(\mathcal{N})=\|B\|/\sqrt{\mu_{f}\mu_{g}}\) measuring the coupling, and \(\Omega\) means the iteration complexity bounded below asymptotically, up to a constant. A few optimal first-order algorithms are developed in recent literature [27; 36]. If further the proximal oracles for \(f,g\) are allowed, the lower complexity bound of the class of first-order algorithms is \(\Omega\left(\kappa(\mathcal{N})|\ln\epsilon_{\mathrm{out}}|\right)\). We refer to [10; 11] for an optimal proximal method. One more important class is for linear operator \(\mathcal{A}\) which has the following decomposition: \[\mathcal{A}=\mathcal{A}^{\mathrm{sym}}+\mathcal{A}^{\mathrm{skew}},\] where \(\mathcal{A}^{\mathrm{sym}}=(\mathcal{A}+\mathcal{A}^{\intercal})/2\) is the symmetric (Hermitian for complex matrices) part and \(\mathcal{A}^{\mathrm{skew}}=(\mathcal{A}-\mathcal{A}^{\intercal})/2\) is the skew-symmetric part. The condition \(\mathcal{A}\) is monotone is equivalent to \(\mathcal{A}^{\mathrm{sym}}\) is symmetric and positive definite (SPD) and \(\lambda_{\min}(\mathcal{A}^{\mathrm{sym}})\geq\mu\). Bai, Golub, and Ng in [3] proposed the Hermitian/skew-Hermitian splitting method (HSS) for solving general non-Hermitian positive definite linear systems \(\mathcal{A}x=b\): \[\begin{array}{l}(\alpha I+\mathcal{A}^{\mathrm{sym}})x_{k+\frac{1}{2}}=( \alpha I-\mathcal{A}^{\mathrm{skew}})x_{k}+b\\ (\alpha I+\mathcal{A}^{\mathrm{skew}})x_{k+1}=(\alpha I-\mathcal{A}^{\mathrm{ sym}})x_{k+\frac{1}{2}}+b.\end{array} \tag{6}\] The iterative method (6) solves the equations for the symmetric (Hermitian) part and skew-symmetric (skew-Hermitian) part alternatively. For the HSS method (6), efficient solvers for linear operators \((\alpha I+\mathcal{A}^{\mathrm{sym}})^{-1}\) and \((\alpha I+\mathcal{A}^{\mathrm{skew}})^{-1}\) are needed. A linear convergence rate of \(\frac{\sqrt{\kappa(\mathcal{A}^{\mathrm{sym}})}-1}{\sqrt{\kappa(\mathcal{A}^{ \mathrm{sym}})}+1}\) can be achieved for an optimal choice of parameter \(\alpha\). Several variants of the method are derived and analyzed in [2; 4; 5]. Benzi and Golub [7] applied the HSS method for solving the linear saddle point problems with preconditioning strategy. For a general non-singular matrix \(\mathcal{A}\), \(\mathcal{A}^{\mathrm{sym}}\) may not be positive definite. But we can always find a transformation operator \(\mathcal{M}\) s.t. \(\mathcal{AM}\) admits the decomposition (3) and the transformed system has a similar or better condition number. Indeed the existence of the solution to the equation \(\mathcal{A}x=b\) can be interpreted as the following inf-sup condition: \[\inf_{y\in\mathbb{R}^{n}}\sup_{x\in\mathbb{R}^{n}}\frac{(\mathcal{A}x,y)}{\|x \|\|y\|}\geq\mu. \tag{7}\] The inf-sup condition is equivalent to: for any \(y\in\mathbb{R}^{n}\), there exists \(x\in\mathbb{R}^{n}\), such that \[(\mathcal{A}x,y)\geq C_{1}\|y\|^{2},\quad\text{ and }\ \|x\|\leq C_{2}\|y\|. \tag{8}\] If we can find a linear operator \(\mathcal{M}\) s.t. \(x=\mathcal{M}y\) satisfying (8), then \(\mathcal{AM}\) will satisfy (3) with the symmetric and skew-symmetric decomposition. A large class of iterative methods for solving the linear saddle point systems can be derived by different choices of \(\mathcal{M}\); see [8] and the references therein. A transformation has also been proposed for nonlinear saddle point problems recently in [14] and the resulting algorithm is called the transformed primal-dual (TPD) method. We shall develop our iterative methods based on discretization of ODE flows. Namely we treat \(x(t)\) as a continuous function of an artificial time variable \(t\) and design ODE systems \(x^{\prime}(t)=\mathcal{G}(x(t))\) so that the \(x^{\star}\) is a stable equilibrium point of the corresponding dynamic system, i.e., \(\mathcal{G}(x^{*})=0\) and \(\lim_{t\to\infty}x(t)=x^{*}\). Then we apply ODE solvers to obtain various iterative methods. By doing this way, we can borrow the stability analysis for dynamic systems and convergence theory of ODE solvers. In particular, the dynamic systems and accelerated iterative methods for the convex minimization (4) is analyzed via a unified Lyapunov-based approach in [13]; see also [1] for maximally monotone operators. However, there is few investigation on the ODE flows for (1), and iterative methods with accelerated linear rates. The most popular choice is the generalized gradient flow: \[x^{\prime}(t)=-\mathcal{A}(x(t)). \tag{9}\] Although \(\mathcal{A}\) is not the gradient of some scalar function when \(\mathcal{N}\neq 0\), we still use the name convention for the convex case \(\mathcal{N}=0\). One can easily show the exponential stability of \(x^{\star}\) using the monotonicity of \(\mathcal{A}\). Discretization for the generalized gradient flow (9) leads to iteration methods for solving (1). The implicit Euler scheme with step size \(\alpha_{k}\) is the unconditionally stable proximal method \((I+\alpha_{k}\mathcal{A})(x_{k+1})=x_{k}\). The explicit Euler scheme gives the generalized gradient descent method: \[x_{k+1}=x_{k}-\alpha_{k}\mathcal{A}(x_{k}). \tag{10}\] For \(\alpha_{k}=\mu/L_{\mathcal{A}}^{2}\), we have the linear convergence \[\|x_{k+1}-x^{\star}\|^{2}\leq\left(1-1/\kappa^{2}(\mathcal{A})\right)\|x_{k+1 }-x^{\star}\|^{2}.\] But this linear rate is pretty slow when \(\kappa(\mathcal{A})\gg 1\) since the dependence is \(\kappa^{2}(\mathcal{A})\). To achieve the accuracy \(\|x_{k+1}-x^{\star}\|^{2}\leq\epsilon_{\mathrm{out}}\), \(\mathcal{O}(\kappa^{2}(\mathcal{A})|\ln\epsilon_{\mathrm{out}}|)\) iterations are needed. In contrast, for convex optimization, i.e., \(\mathcal{N}=0\), the rate for the gradient descent method is \(1-1/\kappa(F)\) for step size \(\alpha_{k}=1/L_{F}\). To speed up the convergence, we explore more property from the decomposition (3). Let \(B^{\intercal}=\mathrm{upper}(\mathcal{N})\) be the upper triangular part of \(\mathcal{N}\) and \(B^{\mathrm{sym}}=B+B^{\intercal}\) be a symmetrization of \(B\). Based on the splitting \(\mathcal{N}=B^{\mathrm{sym}}-2B\) or \(\mathcal{N}=2B^{\intercal}-B^{\mathrm{sym}}\), we develop Gradient and skew-Symmetric Splitting (GSS) methods: \[\frac{x_{k+1}-x_{k}}{\alpha}=-\left(\nabla F(x_{k})+B^{\mathrm{sym}}x_{k}-2Bx _{k+1}\right), \tag{11}\] or \[\frac{x_{k+1}-x_{k}}{\alpha}=-\left(\nabla F(x_{k})-B^{\mathrm{sym}}x_{k}+2B^ {\intercal}x_{k+1}\right). \tag{12}\] Notice that \(B\) is lower triangular, both (11) and (12) are explicit schemes as \(x_{k+1}\) can be computed via forward (for (11)) or backward (for (12)) substitution. We prove that they achieve the linear convergence rate \[\|x_{k}-x^{\star}\|^{2}\leq\left(\frac{1}{1+4/\max\{\kappa(B^{\rm sym}),\kappa(F )\}}\right)^{k}6\|x_{0}-x^{\star}\|^{2}.\] where \(\kappa(B^{\rm sym})=L_{B^{\rm sym}}/\mu\) with \(L_{B^{\rm sym}}=\|B^{\rm sym}\|\) for \(\alpha=\min\left\{\frac{1}{4L_{B^{\rm sym}}},\frac{1}{4L_{F}}\right\}\). In particular for the linear problem \(\nabla F=\mu I\), this can be viewed as accelerated overrelaxation (AOR) methods [19; 20] for a linear shifted skew-symmetric system. To further accelerate the convergence rate, following [29], we introduce an accelerated gradient flow \[\begin{cases}x^{\prime}=y-x,\\ y^{\prime}=x-y-\frac{1}{\mu}(\nabla F(x)+\mathcal{N}y).\end{cases} \tag{13}\] Comparing with the accelerated gradient flow in [29] for convex optimization, the difference is the gradient and skew-symmetric splitting \(\mathcal{A}(x)\to\nabla F(x)+\mathcal{N}y\). We propose several iterative schemes based on various discretization of (13). Provided that a fast solver for computing the shifted skew-symmetric operator \((\beta I+\mathcal{N})^{-1}\) is available, we give an implicit-explicit (IMEX) Euler scheme for (13) as a version of Accelerated Gradient and skew-Symmetric Splitting (AGSS) methods: \[\begin{split}\frac{\hat{x}_{k+1}-x_{k}}{\alpha_{k}}& =y_{k}-\hat{x}_{k+1},\\ \frac{y_{k+1}-y_{k}}{\alpha_{k}}&=\hat{x}_{k+1}-y_{k+ 1}-\frac{1}{\mu}\left(\nabla F(\hat{x}_{k+1})+\mathcal{N}y_{k+1}\right),\\ \frac{x_{k+1}-x_{k}}{\alpha_{k}}&=y_{k+1}-x_{k+1}. \end{split} \tag{14}\] The scheme (14) is implicit for \(y_{k+1}\) as each iteration needs to solve a shifted skew-symmetric equation \((\beta I+\mathcal{N})y_{k+1}=b(\hat{x}_{k+1},y_{k})\) with \(\beta=1+\mu/\alpha_{k}\). For the fixed step size \(\alpha_{k}=1/\sqrt{\kappa(F)}\), the convergence rate is accelerated to \[\|x_{k+1}-x^{\star}\|^{2}+\|y_{k+1}-x^{\star}\|^{2}\leq\left(\frac{1}{1+1/ \sqrt{\kappa(F)}}\right)^{k}2\mathcal{E}_{0}/\mu,\] where \(\mathcal{E}_{0}=D_{F}(x_{0},x^{\star})+\frac{\mu}{2}\|y_{0}-x^{\star}\|^{2}\) and \(D_{F}\) is the Bregman divergence of \(F\). We also allow an inexact solver for approximating \((\beta I+\mathcal{N})^{-1}\) using perturbation argument to control the inner solve error. For linear systems, comparing with HSS, we achieve the same accelerated rate without treating the symmetric part implicitly, i.e., no need to compute \((\alpha I+\mathcal{A}^{\rm sym})^{-1}\). To fully avoid computing \((\beta I+\mathcal{N})^{-1}\), we provide an explicit AGSS scheme combining acceleration of \(F\) and AOR technique for \(\mathcal{N}\): \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha} =y_{k}-\hat{x}_{k+1}, \tag{15}\] \[\frac{y_{k+1}-y_{k}}{\alpha} =\hat{x}_{k+1}-y_{k+1}-\frac{1}{\mu}\left(\nabla F(\hat{x}_{k+1}) +B^{\text{sym}}y_{k}-2By_{k+1}\right),\] \[\frac{x_{k+1}-x_{k}}{\alpha} =y_{k+1}-\frac{1}{2}(x_{k+1}+\hat{x}_{k+1}).\] For the step size \(\alpha=\min\left\{\frac{\mu}{2L_{B^{\text{sym}}}},\sqrt{\frac{\mu}{2L_{F}}}\right\}\), we obtain the accelerated linear convergence for scheme (15) \[\|x_{k+1}-x^{\star}\|^{2}\leq\left(\frac{1}{1+1/\max\{4\kappa(B^{\text{sym}}), \sqrt{8\kappa(F)}\}}\right)^{k}\frac{2\mathcal{E}_{0}^{\alpha B}}{\mu}\] where \(\mathcal{E}_{0}^{\alpha B}=D_{F}(x_{0},x^{\star})+\frac{1}{2}\|y-x^{\star}\|_ {\mu I-2\alpha B^{\text{sym}}}^{2}\) is nonnegative according to our choice of the step size. The proposed accelerated methods has wide applications. This extends the acceleration among the existing works on the convex minimization [17; 31; 32] to a more general class of monotone operator equations. As an example, we apply to smooth strongly-convex-strongly-concave saddle point systems with bilinear coupling (5) and derive first-order algorithms achieving optimal lower iteration complexity \(\Omega\left(\sqrt{\kappa(f)+\kappa^{2}(\mathcal{N})+\kappa(g)}\cdot|\ln\epsilon _{\text{out}}|\right)\); see Section 5.2 for variants and details. For affinely constrained optimization problems: \[\min_{u\in\mathbb{R}^{m}}f(u)\] subject to \[Bu=b,\] we combine the transformed primal-dual method developed in [14] and the accelerated gradient flow to propose an accelerated transformed primal-dual (ATPD) method: \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha} =y_{k}-\hat{x}_{k+1}, \tag{16}\] \[\frac{v_{k+1}-v_{k}}{\alpha} =\frac{1}{2}(\hat{u}_{k+1}-v_{k+1})-\frac{1}{\mu_{f}}\mathcal{I}_ {\mathcal{V}}^{-1}(\nabla f(\hat{u}_{k+1})+B^{\intercal}q_{k}),\] \[\frac{q_{k+1}-q_{k}}{\alpha} =\hat{p}_{k+1}-q_{k+1}-\mathcal{I}_{\mathcal{Q}}^{-1}(Sp_{k+1}+Bv _{k}-2Bv_{k+1}+B\mathcal{I}_{\mathcal{V}}^{-1}f(u_{k+1})),\] \[\frac{x_{k+1}-\hat{x}_{k+1}}{\alpha} =(y_{k+1}-y_{k})-\frac{1}{4}(x_{k+1}-\hat{x}_{k+1}).\] where \(x=(u,p)\), \(y=(v,q)\), \(\mathcal{I}_{\mathcal{V}},\mathcal{I}_{\mathcal{Q}}\) are SPD operators and \(S=B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\). The complexity of the explicit scheme (16) is \[\mathcal{O}(\sqrt{\kappa_{\mathcal{I}_{\mathcal{V}}}(f)}\,\kappa_{\mathcal{I} _{\mathcal{Q}}}(S)|\ln\epsilon_{\text{out}}|)\] which suggests that \(\mathcal{I}_{\mathcal{Q}}^{-1}\) is better chosen as a preconditioner for the Schur complement \(S=B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\). In particular, when \(\mathcal{I}_{\mathcal{V}}\) is a scaled identity and \(\mathcal{I}_{\mathcal{Q}}=S\), the outer iteration complexity is \(\mathcal{O}(\sqrt{\kappa_{\mathcal{I}_{\mathcal{V}}}(f)}|\ln\epsilon_{\rm out }|)\). Iterative methods for computing \(S^{-1}r\) can be thought of as an inner iteration which can be a linear inner solver or a non-linear one. The linear solver will enter the estimate by the factor \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)\). The non-linear inner solver for \(S^{-1}\), e.g., the conjugate gradient method, can be estimated by the perturbation argument on controlling the residual \(\varepsilon_{\rm in}\) developed in Section 4.4. The total iteration complexity for the accelerated transformed primal-dual method is \[\mathcal{O}\left(|\ln\epsilon_{\rm out}||\ln\varepsilon_{\rm in}|\sqrt{\kappa_ {\mathcal{I}_{\mathcal{V}}}(f)\,\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)}\right),\] which achieves the optimal complexity bound for affinely constrained problems [35]. The strong convexity of \(f\) can be further relaxed to \[f_{\beta}(u)=f(u)+\frac{\beta}{2}\|Bu-b\|^{2}\] by using augmented Lagrangian method (ALM). Then \(\mu_{f}>0\) can be relaxed to \(\mu_{f_{\beta}}>0\); see discussion in Section 5.3. For the rest of the paper, we first review convex function theory and Lyapunov analysis theory in Section 2, as basic preliminaries for our proofs. The generalized gradient flow and convergence of GSS methods for the considered monotone equation are proposed in Section 3. Then in Section 4, we extend the accelerated gradient flow in convex minimization and derive AGSS methods with accelerated linear rates. As applications, we propose accelerated first-order algorithms for convex-concave saddle point problems with bilinear coupling in Section 5. In particular, we give optimal algorithms for strongly-convex-strongly-concave saddle point systems. Concluding remarks are addressed in Section 6. ## 2 Preliminary In this section, we follow [30] to introduce notation and preliminaries in convex function theory. We also briefly review a unified convergence analysis of first order convex optimization methods via strong Lyapunov functions established in [13]. ### Convex function Let \(\mathcal{X}\) be a finite-dimensional Hilbert space with inner product \((\cdot,\cdot)\) and norm \(\|\cdot\|\). \(\mathcal{X}^{\prime}\) is the linear space of all linear and continuous mappings \(T:\mathcal{X}\to\mathbb{R}\), which is called the dual space of \(\mathcal{X}\), and \(\langle\cdot,\cdot\rangle\) denotes the duality pair between \(\mathcal{X}\) and \(\mathcal{X}^{\prime}\). For any proper closed convex and \(C^{1}\) function \(F:\mathcal{X}\to\mathbb{R}\), the Bregman divergence of \(F\) is defined as \[D_{F}(x,y):=F(x)-F(y)-\langle\nabla F(y),x-y\rangle.\] We say \(F\in\mathcal{S}_{\mu}\) or \(\mu\)-strongly convex with \(\mu\geqslant 0\) if \(F\) is differentiable and \[D_{F}(x,y)\geqslant\frac{\mu}{2}\left\|x-y\right\|^{2},\quad\forall x,y\in \mathcal{X}.\] In addition, denote \(F\in\mathcal{S}_{\mu,L}\) if \(F\in\mathcal{S}_{\mu}\) and there exists \(L>0\) such that \[D_{F}(x,y)\leqslant\frac{L}{2}\left\|x-y\right\|^{2},\quad\forall x,y\in \mathcal{X}.\] For fixed \(y\in\mathcal{X},D_{F}(\cdot,y)\) is convex as \(F\) is convex and \[\nabla D_{F}(\cdot,y)=\nabla F(\cdot)-\nabla F(y).\] For \(F\in\mathcal{S}_{\mu,L}\), we have \[\frac{\mu}{2}\|x-y\|^{2}\leq D_{F}(x,y)\leq\frac{L}{2}\|x-y\|^{2}.\] Especially for \(F(x)=\frac{1}{2}\|x\|^{2}\), Bregman divergence reduces to the half of the squared distance \(D_{F}(x,y)=D_{F}(y,x)=\frac{1}{2}\|x-y\|^{2}\). In general \(D_{F}(x,y)\) is non-symmetric in terms of \(x\) and \(y\). A symmetrized Bregman divergence is defined as \[\langle\nabla F(y)-\nabla F(x),y-x\rangle=D_{F}(y,x)+D_{F}(x,y).\] By direct calculation, we have the following three-terms identity. Lemma 1 (Bregman divergence identity [12]): _If function \(F:\mathcal{X}\to\mathbb{R}\) is differentiable, then for any \(x,y,z\in\mathcal{X}\), it holds that_ \[\langle\nabla F(x)-\nabla F(y),y-z\rangle=D_{F}(z,x)-D_{F}(z,y)-D_{F}(y,x). \tag{17}\] When \(F(x)=\frac{1}{2}\|x\|^{2}\), identity (17) becomes \[(x-y,y-z)=\frac{1}{2}\|z-x\|^{2}-\frac{1}{2}\|z-y\|^{2}-\frac{1}{2}\|y-x\|^{2}.\] For a non-smooth function \(F\), the subgradient is a set-valued function defined as \[\partial F(x):=\left\{\xi\in\mathcal{X}^{\prime}:F(y)-F(x)\geqslant\langle\xi,y-x\rangle,\quad\forall y\in\mathcal{X}\right\}.\] For a proper, closed and convex function \(F:\mathcal{X}\to\mathbb{R}\), \(\partial F(x)\) is a nonempty bounded set for \(x\in\mathcal{X}\)[30]. It is evident that the subgradient for smooth \(F\) is a single-valued function reduced to the gradient, that is \(\partial F(x)=\{\nabla F(x)\}\). We extend the set \(\mathcal{S}_{\mu}\) using the notion of subgradient: \(F\in\mathcal{S}_{\mu}\) if for all \(x,y\in\mathcal{X}\), \[F(y)\geqslant F(x)+\langle\xi,y-x\rangle+\frac{\mu}{2}\|x-y\|^{2},\quad\forall \xi\in\partial F(x).\] Similar to the smooth case, if \(F\in\mathcal{S}_{\mu}\), then \[\langle\xi-\eta,x-y\rangle\geqslant\mu\|x-y\|^{2},\quad\forall x,y\in \mathcal{X},\xi\in\partial F(x),\eta\in\partial F(y).\] Given a convex function \(F\), define the proximal operator of \(F\) as \[\operatorname{prox}_{\gamma F}(y):=\operatorname*{argmin}_{x}F(x)+\frac{1}{2 \gamma}\|x-y\|^{2}, \tag{18}\] for some \(\gamma>0\). The proximal operator is well-defined since the function \(F(\cdot)+\frac{1}{2\gamma}\|\cdot\)\(-y\|^{2}\) is strongly convex. ### Inner product and preconditioners The standard \(l^{2}\) dot product of Euclidean space \((\cdot,\cdot)\) is usually chosen as the inner product and the norm induced is the Euclidean norm. We now introduce inner product \((\cdot,\cdot)_{\mathcal{I}_{\mathcal{X}}}\) induced by a given SPD operator \(\mathcal{I}_{\mathcal{X}}:\mathcal{X}\to\mathcal{X}\) defined as follows \[(x,y)_{\mathcal{I}_{\mathcal{X}}}:=(\mathcal{I}_{\mathcal{X}}x,y)=(x,\mathcal{ I}_{\mathcal{X}}y),\quad\forall x,y\in\mathcal{X}\] and associated norm \(\|\cdot\|_{\mathcal{I}_{\mathcal{X}}}\), given by \(\|x\|_{\mathcal{I}_{\mathcal{X}}}=(x,x)_{\mathcal{I}_{\mathcal{X}}}^{1/2}\). The dual norm w.r.t the \(\mathcal{I}_{\mathcal{X}}\)-norm is defined as: for \(\ell\in\mathcal{X}^{\prime}\) \[\|\ell\|_{\mathcal{X}^{\prime}}=\sup_{0\neq x\in\mathcal{X}}\frac{\langle\ell,x\rangle}{\|x\|_{\mathcal{I}_{\mathcal{X}}}}=(\ell,\ell)_{\mathcal{I}_{ \mathcal{X}}^{-1}}^{1/2}=\left(\mathcal{I}_{\mathcal{X}}^{-1}\ell,\ell\right) ^{1/2}.\] We shall generalize the convexity and Lipschitz continuity with respect to \(\mathcal{I}_{\mathcal{X}}\)-norm: we say \(F\in\mathcal{S}_{\mu_{F,\mathcal{I}_{\mathcal{X}}}}\) with \(\mu_{F,\mathcal{I}_{\mathcal{X}}}\geqslant 0\) if \(F\) is differentiable and \[D_{F}(x,y)\geqslant\frac{\mu_{F,\mathcal{I}_{\mathcal{X}}}}{2}\left\|x-y\right\| _{\mathcal{I}_{\mathcal{X}}}^{2},\quad\forall x,y\in\mathcal{X}.\] In addition, denote \(f\in\mathcal{S}_{\mu_{F,\mathcal{I}_{\mathcal{X}}},L_{F,\mathcal{I}_{\mathcal{ X}}}}\) if \(f\in\mathcal{S}_{\mu_{F,\mathcal{I}_{\mathcal{X}}}}\) and there exists \(L_{f,\mathcal{I}_{\mathcal{X}}}>0\) such that \[D_{F}(x,y)\leq\frac{L_{f,\mathcal{I}_{\mathcal{X}}}}{2}\left\|x-y\right\|_{ \mathcal{I}_{\mathcal{X}}}^{2},\quad\forall x,y\in\mathcal{X}.\] The gradient method in the inner product \(\mathcal{I}_{\mathcal{X}}\) reads as: \[x_{k+1}=x_{k}-\mathcal{I}_{\mathcal{X}}^{-1}\nabla F(x_{k}), \tag{19}\] where \(\mathcal{I}_{\mathcal{X}}^{-1}\) can be understood as a preconditioner. The convergence rate of the preconditioned gradient descent iteration (19) is \(1-1/\kappa_{\mathcal{I}_{\mathcal{X}}}(F)\) with condition number \(\kappa_{\mathcal{I}_{\mathcal{X}}}(F)=L_{F,\mathcal{I}_{\mathcal{X}}}/\mu_{F, \mathcal{I}_{\mathcal{X}}}\). To simplify notation, we skip \(\mathcal{I}_{\mathcal{X}}\) in the constants \(\mu\) and \(L\), e.g., write \(\mu_{F,\mathcal{I}_{\mathcal{X}}}\) as \(\mu_{F}\), but keep in the condition number, e.g. \(\kappa_{\mathcal{I}_{\mathcal{X}}}(F)\), to emphasize that the condition number is measured in the \(\mathcal{I}_{\mathcal{X}}\) inner product. For two symmetric operators \(A,B:\mathcal{X}\to\mathcal{X}\), we say \(A\geq(>)B\) if \(A-B\) is positive semidefinite (definite). Therefore \(A>0\) means \(A\) is SPD. One can easily verify that \(A\geq B\) is equivalent to \(\lambda_{\min}(B^{-1}A)\geq 1\) or \(\lambda_{\max}(A^{-1}B)\leq 1\) for two non-singular and symmetric operators. ### Lyapunov analysis In order to study the stability of an equilibrium \(x^{*}\) of a dynamical system defined by an autonomous system \[x^{\prime}=\mathcal{G}(x(t)), \tag{20}\] Lyapunov introduced the so-called Lyapunov function \(\mathcal{E}(x)\)[25; 18], which is non-negative and the equilibrium point \(x^{*}\) satisfies \(\mathcal{E}\left(x^{*}\right)=0\) and the Lyapunov condition: \(-\nabla\mathcal{E}(x)\cdot\mathcal{G}(x)>0\) for \(x\) near the equilibrium point \(x^{*}\). That is the flow \(\mathcal{G}(x)\) may not be in the perfect \(-\nabla\mathcal{E}(x)\) direction but contains positive component in that direction. Then the (local) decay property of \(\mathcal{E}(x)\) along the trajectory \(x(t)\) of the autonomous system (20) can be derived immediately: \[\frac{\mathrm{d}}{\mathrm{d}t}\mathcal{E}(x(t))=\nabla\mathcal{E}(x)\cdot x^{ \prime}(t)=\nabla\mathcal{E}(x)\cdot\mathcal{G}(x)<0.\] To further establish the convergence rate of \(\mathcal{E}(x(t))\), Chen and Luo [13] introduced the strong Lyapunov condition: \(\mathcal{E}(x)\) is a Lyapunov function and there exist constant \(q\geqslant 1\), strictly positive function \(c(x)\) and function \(p(x)\) such that \[-\nabla\mathcal{E}(x)\cdot\mathcal{G}(x)\geq c(x)\mathcal{E}^{q}(x)+p^{2}(x)\] holds true near \(x^{*}\). From this, one can derive the exponential decay \(\mathcal{E}(x(t))=O\left(e^{-ct}\right)\) for \(q=1\) and the algebraic decay \(\mathcal{E}(x(t))=O\left(t^{-1/(q-1)}\right)\) for \(q>1\). Furthermore if \(\|x-x^{*}\|^{2}\leq C\mathcal{E}(x)\), then we can derive the exponential stability of \(x^{*}\) from the exponential decay of Lyapunov function \(\mathcal{E}(x)\). Note that for an optimization problem, we have freedom to design the vector field \(\mathcal{G}(x)\) and Lyapunov function \(\mathcal{E}(x)\). ## 3 Gradient and skew-Symmetric Splitting Methods In this section, we shall consider the generalized gradient flow \[x^{\prime}(t)=-\mathcal{A}(x(t)), \tag{21}\] and derive several iterative methods for solving \(\mathcal{A}(x)=0\) by applying ODE solvers to (21). Based on the gradient and skew-symmetric splitting (3), we apply Accelerated OverRelaxation (AOR) technique to the non-symmetric part to obtain explicit schemes with linear convergence rate \((1+c/\kappa(\mathcal{A}))^{-1}\). ### Stability Define the Lyapunov function: \[\mathcal{E}_{q}(x)=\frac{1}{2}\|x-x^{*}\|^{2}. \tag{22}\] For \(x(t)\) solving the gradient flow (21): \[\frac{\mathrm{d}}{\mathrm{d}t}\mathcal{E}_{q}(x(t))=\langle\nabla\mathcal{E}_ {q}(x),x^{\prime}\rangle=-\langle x-x^{*},\mathcal{A}(x)-\mathcal{A}(x^{*}) \rangle\leq-2\mu\mathcal{E}_{q}(x),\] which leads to the exponential decay \[\mathcal{E}_{q}(x(t))\leq e^{-2\mu t}\mathcal{E}_{q}(x(0))\] and consequently the solution \(x^{*}\) is an exponentially stable equilibrium point of the dynamic system defined by (21). ### Implicit Euler Schemes The implicit Euler scheme for the generalized gradient flow (21) with step size \(\alpha_{k}>0\) is \[x_{k+1}-x_{k}=-\alpha_{k}\mathcal{A}(x_{k+1}), \tag{23}\] which is equivalent to the proximal iteration \[(I+\alpha_{k}\mathcal{A})(x_{k+1})=x_{k}. \tag{24}\] As \(\mathcal{A}\) is strongly monotone and Liptschitz continuous, the operator \((I+\alpha_{k}\mathcal{A})^{-1}\), which is called the resolvent of \(\mathcal{A}\), is nonexpansive [9] and has a unique fixed point [34]. Using the identity of squares and the strong monotonicity, we have \[\mathcal{E}_{q}(x_{k+1})-\mathcal{E}_{q}(x_{k}) =(x_{k+1}-x_{k},x_{k+1}-x^{\star})-\frac{1}{2}\|x_{k+1}-x_{k}\|^{2}\] \[=\,-\alpha_{k}\left\langle\mathcal{A}(x_{k+1})-\mathcal{A}(x^{ \star}),x_{k+1}-x^{\star}\right\rangle-\frac{1}{2}\|x_{k+1}-x_{k}\|^{2}\] \[\leq\,-2\alpha_{k}\mu\mathcal{E}_{q}(x_{k+1}), \tag{25}\] from which the linear convergence follows naturally \[\|x_{k+1}-x^{\star}\|^{2}\leq\frac{1}{1+2\alpha_{k}\mu}\|x_{k}-x^{\star}\|^{2}.\] There is no restriction on the step size which is known as the unconditional stability of the implicit Euler method. Choosing \(\alpha_{k}\gg 1\) will accelerate the convergence with the price of solving a regularized nonlinear problem (24), which is usually not practical. The implicit Euler method is present here as a reference to measure the difference of other methods. ### Explicit Euler Schemes The explicit Euler scheme for the generalized gradient flow (21) leads to the gradient decent method: \[x_{k+1}=x_{k}-\alpha_{k}\mathcal{A}(x_{k}). \tag{26}\] We write (26) as a correction of the implicit Euler scheme (23), i.e., \[x_{k+1}-x_{k}=-\alpha_{k}\mathcal{A}(x_{k+1})+\alpha_{k}(\mathcal{A}(x_{k+1}) -\mathcal{A}(x_{k})),\] and follow (25) to obtain \[\mathcal{E}_{q}(x_{k+1})-\mathcal{E}_{q}(x_{k})= (x_{k+1}-x_{k},x_{k+1}-x^{\star})-\frac{1}{2}\|x_{k+1}-x_{k}\|^{2} \tag{27}\] \[\leq -2\alpha_{k}\mu\mathcal{E}_{q}(x_{k+1})-\frac{1}{2}\|x_{k+1}-x_{k }\|^{2}\] \[-\alpha_{k}\left\langle\mathcal{A}(x_{k})-\mathcal{A}(x_{k+1}),x_ {k+1}-x^{\star}\right\rangle.\] Here we use the implicit Euler scheme as the reference scheme and call the term \(\alpha_{k}(\mathcal{A}(x_{k})-\mathcal{A}(x_{k+1}),x_{k+1}-x^{\star})\) a mis-matching term. Using the Cauchy-Schwarz inequality and the Lipschitz continuity of \(\mathcal{A}\), \[\alpha_{k}|\left<\mathcal{A}(x_{k})-\mathcal{A}(x_{k+1}),x_{k+1}- x^{\star}\right>|\] \[\leq\frac{\alpha_{k}}{2\mu}\|\mathcal{A}(x_{k})-\mathcal{A}(x_{k+ 1})\|^{2}+\frac{\alpha_{k}\mu}{2}\|x_{k+1}-x^{\star}\|^{2}\] \[\leq\frac{\alpha_{k}L_{\mathcal{A}}^{2}}{2\mu}\|x_{k+1}-x_{k}\|^{ 2}+\alpha_{k}\mu\,\mathcal{E}_{q}(x_{k+1})\] Substitute back to (27) and let \(\alpha_{k}\leq\frac{\mu}{L_{\mathcal{A}}^{2}}\), we have the linear reduction \[\mathcal{E}_{q}(x_{k+1})\leq\frac{1}{1+\alpha_{k}\mu}\mathcal{E}_{q}(x_{k}).\] In particular when \(\alpha_{k}=\frac{\mu}{L_{\mathcal{A}}^{2}}\), \[\mathcal{E}_{q}(x_{k+1})\leq\frac{1}{1+1/\kappa^{2}(\mathcal{A})}\mathcal{E}_{ q}(x_{k}).\] Remark 1: Using another identity on squares \[\mathcal{E}_{q}(x_{k+1})-\mathcal{E}_{q}(x_{k})=(x_{k+1}-x_{k},x_{k}-x^{\star })+\frac{1}{2}\|x_{k+1}-x_{k}\|^{2},\] and the monotonicity at \(x_{k}\), the upper bound of the step size can be relaxed to \(\alpha_{k}<2\mu/L_{\mathcal{A}}^{2}\) and for \(\alpha_{k}=\mu/L_{\mathcal{A}}^{2}\), the rate can be improved to \(1-1/\kappa^{2}(\mathcal{A})\). Here we emphasize the approach of using the implicit Euler method as the reference and the estimate of the mis-match terms. The obtained linear rate is slightly worse but still in the same order of \(\kappa(\mathcal{A})\) as \((1+\delta)^{-1}=1-\delta+\mathcal{O}(\delta^{2})\). ### Accelerated Overrelaxation Methods for Shifted skew-Symmetric Problems In this subsection, we consider the shifted skew-symmetric linear system \[(\mu I+\mathcal{N})x=b, \tag{28}\] which is a special case of (1) with \(F(x)=\frac{\mu}{2}\|x\|^{2}-(b,x)\) and \(\mathcal{A}(x)=(\mu I+\mathcal{N})x-b\). An efficient solver for (28) is an ingredient of the accelerated gradient and skew-symmetric splitting method for the nonlinear equation (1) we shall develop later on. The system (28) can be solved with Krylov subspace methods. For example, minimal residual methods [23; 24] based on the Lanczos algorithm require short recurrences of vector storage. The convergence theorem using Chebyshev polynomial [24] shows that the residual converges with a linear rate of \(O((1+\mu/\|\mathcal{N}\|)^{-1})\). Compared with Krylov subspace methods for solving (28), our method to be presented enjoys a similar linear convergence rate but with a much simpler form and in-space vector storage. Recall that, for the matrix equation \[(D-L-U)x=b,\] where \(D\) a diagonal matrix, and \(L\) and \(U\) are strictly lower and upper triangular matrix, respectively, the **A**ccelerated **O**ver**R**elaxation (AOR) method [19; 20] with the acceleration parameter \(r\) and relaxation factor \(\omega>1\) is in the form \[(D-rL)x_{k+1}=[(1-\omega)D+(\omega-r)L+\omega U]x_{k}+\omega b,\] which is a two-parameter generalization of the successive overrelaxation (SOR) method. We shall apply AOR to (28) with well-designed \(r\) and \(\omega\). As \(\mathcal{N}=-\mathcal{N}^{\intercal}\), all diagonal entries of \(\mathcal{N}\) are zero. Let \(B^{\intercal}=\mathrm{upper}(\mathcal{N})\) be the upper triangular part of \(\mathcal{N}\). Then \(\mathcal{N}=B^{\intercal}-B\). Let \(B^{\mathrm{sym}}=B+B^{\intercal}\) be a symmetrization of \(B\). We have the splitting \[\mathcal{N} =B^{\mathrm{sym}}-2B,\quad\text{and} \tag{29}\] \[\mathcal{N} =2B^{\intercal}-B^{\mathrm{sym}}. \tag{30}\] As a symmetric matrix, all eigenvalues of \(B^{\mathrm{sym}}\) are real. Let \(\lambda_{1}\leq\cdots\leq\lambda_{n}\) be the eigenvalues of \(B^{\mathrm{sym}}\). Since \(\mathrm{trace}(B^{\mathrm{sym}})=0\), we know \(\lambda_{1}<0\) and \(\lambda_{n}>0\). That is \(B^{\mathrm{sym}}\) is symmetric but indefinite. Define \(L_{B^{\mathrm{sym}}}=\|B^{\mathrm{sym}}\|=\max\{|\lambda_{1}|,\lambda_{n}\}\) and \(\kappa(B^{\mathrm{sym}})=L_{B^{\mathrm{sym}}}/\mu\). We discretize the gradient flow (21) by the matrix splitting (29) and treat \(B^{\mathrm{sym}}\) as the explicit term: \[\frac{x_{k+1}-x_{k}}{\alpha}=-\left(\mu x_{k+1}+B^{\mathrm{sym}}x_{k}-2Bx_{k +1}-b\right). \tag{31}\] The update of \(x_{k+1}\) is equivalent to solve \[\left[(1+\alpha\mu)I-2\alpha B\right]x_{k+1}=x_{k}-\alpha(B^{\mathrm{sym}}x_{ k}-b), \tag{32}\] which is AOR for solving \[(\mu I-B+B^{\intercal})x=b\] with \(r=\frac{2\alpha\mu}{1+\alpha\mu}\) and \(\omega=\frac{\alpha\mu}{1+\alpha\mu}\). The left hand side of (32) is an invertible lower-triangular matrix and \(x_{k+1}\) can be efficiently computed by a forward substitution. We can also use the splitting (30) to get another AOR scheme \[\frac{x_{k+1}-x_{k}}{\alpha}=-\left(\mu x_{k+1}-B^{\mathrm{sym}}x_{k}+2B^{ \intercal}x_{k+1}-b\right), \tag{33}\] for which \(x_{k+1}\) can be efficiently computed by a backward substitution. For a symmetric matrix \(M\), we define \[\left\|x\right\|_{M}^{2}:=(x,x)_{M}:=x^{\intercal}Mx.\] When \(M\) is SPD, \((\cdot,\cdot)_{M}\) defines an inner product with the induced norm \(\|x\|_{M}\). For a general symmetric matrix, \(\|\cdot\|_{M}\) may not be a norm. However the following identity for squares still holds: \[2(a,b)_{M}=\|a\|_{M}^{2}+\|b\|_{M}^{2}-\|a-b\|_{M}^{2}. \tag{34}\] Without loss of generality, we focus on the convergence analysis of scheme (31). Notice that when \(0<\alpha<1/L_{B^{\text{sym}}}\), \(I\pm\alpha B^{\text{sym}}\) is SPD. For \(0<\alpha<1/L_{B^{\text{sym}}}\), consider the Lyapunov function \[\mathcal{E}^{\alpha B}(x)=\frac{1}{2}\|x-x^{\star}\|^{2}-\frac{ \alpha}{2}\|x-x^{\star}\|_{B^{\text{sym}}}^{2}=\frac{1}{2}\|x-x^{\star}\|_{I- \alpha B^{\text{sym}}}^{2}, \tag{35}\] which is nonnegative and \(\mathcal{E}^{\alpha B}(x)=0\) if and only if \(x=x^{\star}\). Noted that \(\mathcal{E}^{\alpha B}\) might be negative without control on the step size as \(B^{\text{sym}}\) is indefinite. Theorem 3.1: _Let \(\{x_{k}\}\) be the sequence generated by (31) with arbitrary initial guess \(x_{0}\) and step size \(0<\alpha<1/L_{B^{\text{sym}}}\). Then for the Lyapunov function (35),_ \[\mathcal{E}^{\alpha B}(x_{k+1})\leq\frac{1}{1+\alpha\mu}\mathcal{E}^{\alpha B }(x_{k}). \tag{36}\] _In particular, for \(\alpha=\frac{1}{2L_{B^{\text{sym}}}}\), we have_ \[\|x_{k}-x^{\star}\|^{2}\leq\left(\frac{1}{1+\mu/(2L_{B^{\text{sym}}})}\right) ^{k}3\|x_{0}-x^{\star}\|^{2}. \tag{37}\] Proof: We use the identity for squares (34): \[\frac{1}{2}\|x_{k+1}-x^{\star}\|^{2}-\frac{1}{2}\|x_{k}-x^{\star} \|^{2}=(x_{k+1}-x^{\star},x_{k+1}-x_{k})-\frac{1}{2}\|x_{k+1}-x_{k}\|^{2}. \tag{38}\] We write GSS scheme (31) as a correction of the implicit Euler scheme \[x_{k+1}-x_{k}=-\alpha(\mathcal{A}(x_{k+1})-\mathcal{A}(x^{\star}))+\alpha B^ {\text{sym}}(x_{k+1}-x_{k}).\] For the first term, we have \[-\alpha\langle x_{k+1}-x^{\star},\mathcal{A}(x_{k+1})-\mathcal{A}(x^{\star}) \rangle=-\alpha\mu\|x_{k+1}-x^{\star}\|^{2}.\] We use the identity (34) to expand the cross term as \[(x_{k+1}-x^{\star},x_{k+1}-x_{k})_{\alpha B^{\text{sym}}} = \frac{1}{2}\|x_{k+1}-x^{\star}\|_{\alpha B^{\text{sym}}}^{2}+ \frac{1}{2}\|x_{k+1}-x_{k}\|_{\alpha B^{\text{sym}}}^{2}\] \[-\frac{1}{2}\|x_{k}-x^{\star}\|_{\alpha B^{\text{sym}}}^{2}.\] Substitute back to (38) and rearrange the terms, we obtain the identity \[\mathcal{E}^{\alpha B}(x_{k+1})-\mathcal{E}^{\alpha B}(x_{k})\] \[= -\alpha\mu\|x_{k+1}-x^{\star}\|^{2}-\frac{1}{2}\|x_{k+1}-x_{k}\|_ {I-\alpha B^{\text{sym}}}^{2}\] \[= -\alpha\mu\,\mathcal{E}^{\alpha B}(x_{k+1})-\frac{\alpha\mu}{2}\| x_{k+1}-x^{\star}\|_{I+\alpha B^{\text{sym}}}^{2}-\frac{1}{2}\|x_{k+1}-x_{k}\|_{I- \alpha B^{\text{sym}}}^{2}.\] As \(0<\alpha<1/L_{B^{\mathrm{sym}}}\), \(I\pm\alpha B^{\mathrm{sym}}\) is SPD and the last two terms are non-positive. Dropping them, we obtain the inequality \[\mathcal{E}^{\alpha B}(x_{k+1})-\mathcal{E}^{\alpha B}(x_{k})\leq-\alpha\mu \,\mathcal{E}^{\alpha B}(x_{k+1})\] and (36) follows by arrangement. When \(\alpha=1/(2L_{B^{\mathrm{sym}}})\), we have the bound \[\frac{1}{4}\|x-x^{\star}\|^{2}\leq\mathcal{E}^{\alpha B}(x)\leq\frac{3}{4}\|x -x^{\star}\|^{2} \tag{39}\] which implies (37). For SOR type iterative methods, usually spectral analysis [4; 6; 20] is applied to the error matrix which is in general non-symmetric and harder to estimate. The Lyapunov analysis provides a new and relatively simple tool and more importantly enables us to study nonlinear systems. ### Gradient and skew-Symmetric Splitting Methods for Nonlinear Problems For non-linear equation (1), we treat \(\nabla F\) explicitly and propose the following Gradient and skew-Symmetric Splitting (GSS) scheme \[\frac{x_{k+1}-x_{k}}{\alpha}=-\left(\nabla F(x_{k})+B^{\mathrm{sym}}x_{k}-2Bx _{k+1}\right). \tag{40}\] Similarly, modification on (33) gives another GSS scheme \[\frac{x_{k+1}-x_{k}}{\alpha}=-\left(\nabla F(x_{k})-B^{\mathrm{sym}}x_{k}+2B ^{\intercal}x_{k+1}\right). \tag{41}\] Both schemes are explicit as \(\nabla F(x_{k})\) is known. We focus on the GSS method (40). The proof for (41) follows in line with a sign change in the following Lyapunov function \[\mathcal{E}^{\alpha BD}(x_{k}):=\frac{1}{2}\|x_{k}-x^{\star}\|_{I-\alpha B^{ \mathrm{sym}}}^{2}-\alpha D_{F}(x^{\star},x_{k}). \tag{42}\] Lemma 2: _For \(F\in\mathcal{S}_{\mu,L_{F}}\) and \(\alpha<1/\max\{2L_{B^{\mathrm{sym}}},2L_{F}\}\), the Lyapunov function \(\mathcal{E}^{\alpha BD}(x)\geq 0\) and \(\mathcal{E}^{\alpha BD}(x)=0\) if and only if \(x=x^{\star}\)._ Proof: Since \(F\in\mathcal{S}_{\mu,L_{F}}\), the Bregman divergence is non-negative and \[D_{F}(x^{\star},x)\leq\frac{L_{F}}{2}\|x-x^{\star}\|^{2}.\] Then for \(\alpha<1/\max\{2L_{B^{\mathrm{sym}}},2L_{F}\}\), \[\mathcal{E}^{\alpha BD}(x) \geq\frac{1}{2}\|x-x^{\star}\|^{2}-\frac{\alpha}{2}\|x-x^{\star} \|_{B^{\mathrm{sym}}}-\frac{\alpha L_{F}}{2}\|x-x^{\star}\|^{2}\] \[\geq\frac{1}{2}\|x-x^{\star}\|^{2}-\frac{1}{4L_{B^{\mathrm{sym}} }}\|x-x^{\star}\|_{B^{\mathrm{sym}}}^{2}-\frac{1}{4}\|x-x^{\star}\|^{2}\] \[\geq 0.\] If \(x\neq x^{\star}\), then the second \(\geq\) becomes \(>\). So \(\mathcal{E}^{\alpha BD}(x)=0\) if and only if \(x=x^{\star}\). **Theorem 2**: _Let \(\{x_{k}\}\) be the sequence generated by the AOR method (40) with arbitrary initial guess \(x_{0}\) and step size \(\alpha<1/\max\{2L_{B^{\text{sym}}},2L_{F}\}\). Then for the discrete Lyapunov function (42), we have_ \[\mathcal{E}^{\alpha BD}(x_{k+1})\leq\frac{1}{1+\alpha\mu}\mathcal{E}^{\alpha BD }(x_{k}).\] _In particular, for \(\alpha=\min\left\{\frac{1}{4L_{B^{\text{sym}}}},\frac{1}{4L_{F}}\right\}\), we have_ \[\|x_{k}-x^{\star}\|^{2}\leq\left(1+1/\max\left\{4\kappa(B^{\text{sym}}),4 \kappa(F)\right\}\right)^{-k}6\|x_{0}-x^{\star}\|^{2}. \tag{43}\] Proof: We write the scheme (40) as a correction of implicit Euler scheme \[x_{k+1}-x_{k}=-\alpha(\mathcal{A}(x_{k+1})-\mathcal{A}(x^{\star}))+\alpha B^{ \text{sym}}(x_{k+1}-x_{k})+\alpha(\nabla F(x_{k+1})-\nabla F(x_{k})).\] The first two terms are treated as before; see the proof of Theorem 1. The last cross term is expanded using the identity (17) for the Bregman divergence: \[\langle x_{k+1}-x^{\star},\nabla F(x_{x+1})-\nabla F(x_{k})\rangle=D_{F}(x^{ \star},x_{k+1})+D_{F}(x_{k+1},x_{k})-D_{F}(x^{\star},x_{k}).\] Substituting back to (38) and rearranging the terms, we obtain the identity \[\mathcal{E}^{\alpha BD}(x_{k+1})-\mathcal{E}^{\alpha BD}(x_{k})= -\alpha\mu\mathcal{E}^{\alpha BD}(x_{k+1})-\frac{\alpha\mu}{2}\| x_{k+1}-x^{\star}\|_{I+\alpha B^{\text{sym}}}^{2}\] \[-\alpha^{2}\mu D_{F}(x^{\star},x_{k+1})\] \[-\frac{1}{2}\|x_{k+1}-x_{k}\|_{I-\alpha B^{\text{sym}}}^{2}+ \alpha D_{F}(x_{k+1},x_{k}).\] When \(\alpha<1/\max\{2L_{B^{\text{sym}}},2L_{F}\}\), \(I\pm\alpha B^{\text{sym}}\) is SPD and \[\alpha D_{F}(x_{k+1},x_{k})\leq\frac{\alpha L_{F}}{2}\|x_{k+1}-x_{k}\|^{2} \leq\frac{1}{4}\|x_{k+1}-x_{k}\|^{2}\leq\frac{1}{2}\|x_{k+1}-x_{k}\|_{I-\alpha B ^{\text{sym}}}^{2}.\] Thus the last two terms are non-positive. Dropping all non-positive terms, we obtain the inequality \[\mathcal{E}^{\alpha BD}(x_{k+1})-\mathcal{E}^{\alpha BD}(x_{k})\leq-\alpha\mu \mathcal{E}^{\alpha BD}(x_{k+1})\] and the linear reduction follows by arrangement. When \(\alpha=\min\left\{\frac{1}{4L_{B^{\text{sym}}}},\frac{1}{4L_{F}}\right\}\), we have the bound \[\frac{1}{8}\|x-x^{\star}\|^{2}\leq\mathcal{E}^{\alpha BD}(x)\leq\frac{3}{4}\| x-x^{\star}\|^{2} \tag{44}\] which implies (43). Notice the rate in Theorem 2 is \((1+c/\kappa)\) for \(\kappa=\max\{\kappa(F),\kappa(B^{\text{sym}})\}\) which matches the rate of the gradient descent method for convex optimization problems. We expect a combination of the accelerated gradient flow and AOR for the skew-symmetric part will give an accelerated explicit scheme. ## 4 Accelerated Gradient and skew-Symmetric Splitting Methods In this section, we develop the accelerated gradient flow and propose Accelerated Gradient and skew-Symmetric Splitting (AGSS) methods with accelerated linear rates. For the implicit-explicit scheme, we can relax to inexact inner solvers with computable error tolerance. ### Accelerated Gradient Flow Following [29], we introduce an auxiliary variable \(y\) and an accelerated gradient flow \[\begin{cases}x^{\prime}=y-x,\\ y^{\prime}=x-y-\dfrac{1}{\mu}(\nabla F(x)+\mathcal{N}y).\end{cases} \tag{45}\] Denote the vector field on the right hand side of (45) by \(\mathcal{G}(x,y)\). Then \(\mathcal{G}(x^{\star},x^{\star})=0\) and thus \((x^{\star},x^{\star})\) is an equilibrium point of (45). Comparing with the accelerated flow in [29] for convex optimization, the difference is to split \(\mathcal{A}(x)\to\nabla F(x)+\mathcal{N}y\). The gradient component is accelerated by using the accelerated gradient methods for convex optimization and the skew-symmetric component is accelerated by AOR. We first show \((x^{\star},x^{\star})\) is exponentially stable. Consider the Lyapunov function: \[\mathcal{E}(x,y)=D_{F}(x,x^{\star})+\frac{\mu}{2}\|y-x^{\star}\|^{2}. \tag{46}\] As \(F\) is strongly convex, \(\mathcal{E}(x,y)\geq 0\) and \(\mathcal{E}(x,y)=0\) iff \(x=y=x^{\star}\). Furthermore, function \(D_{F}(\cdot,x^{\star})\in\mathcal{S}_{\mu,L_{F}}\). Lemma 3: _For function \(F\in\mathcal{S}_{\mu}\), we have_ \[\langle\nabla F(x)-\nabla F(x^{\star}),x-x^{\star}\rangle\geq D_{F}(x,x^{ \star})+\frac{\mu}{2}\|x-x^{\star}\|^{2}, \tag{47}\] Proof: By direct computation, \(\langle\nabla F(x)-\nabla F(x^{\star}),x-x^{\star}\rangle=D_{F}(x,x^{\star})+ D_{F}(x^{\star},x)\) and thus (47) follows from the bound \[\min\{D_{F}(x,x^{\star}),D_{F}(x^{\star},x)\}\geq\frac{\mu}{2}\|x-x^{\star}\| ^{2},\] for a convex function \(F\in\mathcal{S}_{\mu}\). We then verify the strong Lyapunov property. Lemma 4: **(Strong Lyapunov Property)** _Assume function \(F\in\mathcal{S}_{\mu}\). Then for the Lyapunov function (46) and the accelerated gradient flow vector field \(\mathcal{G}\), the following strong Lyapunov property holds_ \[-\nabla\mathcal{E}(x,y)\cdot\mathcal{G}(x,y)\geq\mathcal{E}(x,y)+\frac{\mu}{ 2}\|y-x\|^{2}. \tag{48}\] Proof: First of all, as \(\mathcal{G}(x^{\star},x^{\star})=0\), \[-\nabla\mathcal{E}(x,y)\cdot\mathcal{G}(x,y)=-\nabla\mathcal{E}(x,y)\cdot( \mathcal{G}(x,y)-\mathcal{G}(x^{\star},x^{\star})).\] Direct computation gives \[-\nabla\mathcal{E}(x,y)\cdot\mathcal{G}(x,y) =\langle\nabla D_{F}(x;x^{\star}),x-x^{\star}-(y-x^{\star}) \rangle-\mu(y-x^{\star},x-x^{\star})\] \[\quad+\mu\|y-x^{\star}\|^{2}+\langle\nabla F(x)-\nabla F(x^{ \star}),y-x^{\star}\rangle+(y-x^{\star},\mathcal{N}(y-x^{\star}))\] \[=\langle\nabla F(x)-\nabla F(x^{\star}),x-x^{\star}\rangle+\mu\| y-x^{\star}\|^{2}-\mu(y-x^{\star},x-x^{\star})\] where we have used \(\nabla D_{F}(x;x^{\star})=\nabla F(x)-\nabla F(x^{\star})\) and \((y-x^{\star},\mathcal{N}(y-x^{\star}))=0\) since \(\mathcal{N}\) is skew-symmetric. Using the bound (47) and the identity for squares (34): \[\frac{\mu}{2}\|y-x^{\star}\|^{2}-\mu(y-x^{\star},x-x^{\star})=\frac{\mu}{2}\|y -x\|^{2}-\frac{\mu}{2}\|x-x^{\star}\|^{2},\] we obtain (48). The calculation is more clear when \(\nabla F(x)=Hx\) is linear with \(H=\nabla^{2}F\geq\mu I\). Then \(-\nabla\mathcal{E}(x,y)\cdot\mathcal{G}(x,y)\) is a quadratic form of \((x-x^{\star},y-x^{\star})^{\intercal}\). We calculate the corresponding matrix as \[\begin{pmatrix}H&0\\ 0&\mu I\end{pmatrix}\begin{pmatrix}I&-I\\ -I+\frac{1}{\mu}H&I+\frac{1}{\mu}\mathcal{N}\end{pmatrix}=\begin{pmatrix}H&-H \\ -\mu I+H&\mu+\mathcal{N}\end{pmatrix}.\] For a quadratic form, \(v^{\intercal}Mv=v^{\intercal}\operatorname{sym}(M)v\). We have \[\operatorname{sym}\begin{pmatrix}H&-H\\ -\mu I+H&\mu I+\mathcal{N}\end{pmatrix} =\begin{pmatrix}H&-\mu I/2\\ -\mu I/2&\mu I\end{pmatrix}\] \[\geq\begin{pmatrix}H/2&0\\ 0&\mu I/2\end{pmatrix}+\frac{\mu}{2}\begin{pmatrix}I&-I\\ -I&I\end{pmatrix},\] where in the last step we use the convexity \(H\geq\mu I\). Then (48) follows. To see how the condition number changes using the accelerated gradient flow, we consider the following \(2\times 2\) matrix \[G=\begin{pmatrix}-1&1\\ 1-a&-1+b\text{i}\end{pmatrix} \tag{49}\] with \(a\geq 1\) representing the eigenvalue of \(\nabla^{2}F/\mu\) and \(b\text{i}\) for \(\mathcal{N}/\mu\) as the eigenvalue of skew-symmetric matrix is pure imaginary. Then the eigenvalue of \(G\) is \[\lambda(G)=-1+\frac{b\pm\sqrt{b^{2}+4(a-1)}}{2}\text{i}.\] The real part is always \(-1\) which implies the decay property of ODE \(x^{\prime}=Gx\). The spectral radius is \[|\lambda|=\mathcal{O}(\sqrt{a})+\mathcal{O}(|b|),\quad\text{as }a\gg 1,|b|\gg 1.\] As a comparison, \(|a+bi|=\sqrt{a^{2}+b^{2}}=\mathcal{O}(a)+\mathcal{O}(|b|)\). We accelerate the dependence from \(\mathcal{O}(a)\) to \(\mathcal{O}(\sqrt{a})\). ### Implicit Euler Schemes If we apply the implicit Euler method for the accelerated gradient system (45), the linear convergence is a direct consequence of the strong Lyapunov property (48). Consider \[\frac{x_{k+1}-x_{k}}{\alpha_{k}} =\mathcal{G}^{x}(x_{k+1},y_{k+1}):=y_{k+1}-x_{k+1}, \tag{50a}\] \[\frac{y_{k+1}-y_{k}}{\alpha_{k}} =\mathcal{G}^{y}(x_{k+1},y_{k+1}):=x_{k+1}-y_{k+1}-\frac{1}{\mu} (\nabla F(x_{k+1})+\mathcal{N}y_{k+1}). \tag{50b}\] As we have shown before, the implicit Euler method is unconditionally stable and yield superlinear convergence with the price of solving a nonlinear equation system where \(x_{k+1}\) and \(y_{k+1}\) are coupled together, which is usually not practical. We present the convergence analysis here as a reference to measure the difference of other methods. Denote \(\mathcal{E}_{k}=\mathcal{E}(x_{k},y_{k})\) and \(z_{k}=(x_{k},y_{k})\). Using the \(\mu\)-convexity of the Lyapunov function (46) and the strong Lyapunov property in Lemma 4, we have \[\mathcal{E}_{k+1}-\mathcal{E}_{k} \leq(\nabla\mathcal{E}_{k+1},z_{k+1}-z_{k})-\frac{\mu}{2}\|z_{k+ 1}-z_{k}\|^{2}\] \[=\alpha_{k}\left\langle\nabla\mathcal{E}_{k+1},\mathcal{G}(z_{k +1})\right\rangle-\frac{\mu}{2}\|z_{k+1}-z_{k}\|^{2}\] \[\leq\,-\alpha_{k}\mathcal{E}_{k+1},\] from which the linear convergence follows naturally \[\mathcal{E}_{k+1}\leq\frac{1}{1+\alpha_{k}}\mathcal{E}_{k}\] for arbitrary step size \(\alpha_{k}>0\). ### Implicit and Explicit Schemes If we treat the skew symmetric part implicit, we can achieve the acceleration like the convex optimization problem. Consider the following **IM**plicit and **EX**plicit (IMEX) scheme of the accelerated gradient flow: \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha_{k}} =y_{k}-\hat{x}_{k+1}, \tag{51a}\] \[\frac{y_{k+1}-y_{k}}{\alpha_{k}} =\hat{x}_{k+1}-y_{k+1}-\frac{1}{\mu}\left(\nabla F(\hat{x}_{k+1}) +\mathcal{N}y_{k+1}\right),\] (51b) \[\frac{x_{k+1}-x_{k}}{\alpha_{k}} =y_{k+1}-x_{k+1}. \tag{51c}\] We first treat \(y\) is known as \(y_{k}\) and solve the first equation to get \(\hat{x}_{k+1}\) and then with known \(\hat{x}_{k+1}\) to solve the following shifted skew-symmetric equation \[\left[(1+\alpha_{k})I+\frac{\alpha_{k}}{\mu}\mathcal{N}\right]y_{k+1}=b(\hat{ x}_{k+1},y_{k}), \tag{52}\] with known right hand side \(b(\hat{x}_{k+1},y_{k})=\alpha_{k}\hat{x}_{k+1}-\frac{\alpha_{k}}{\mu}\nabla F( \hat{x}_{k+1})+y_{k}\). Then with computed \(y_{k+1}\), we can solve for \(x_{k+1}\) again using an implicit discretization of \(x^{\prime}=y-x\). In terms of the ODE solvers, (51) is known as the predictor-corrector method. The intermediate approximation \(\hat{x}_{k+1}\) is a predictor and \(x_{k+1}\) is a corrector. As the skew-symmetric part is treated implicitly, the scheme is expected to achieve the accelerated linear rate as the accelerated gradient method for minimizing the convex function \(F\). For simplicity, we denote \[\mathcal{E}_{k}=\mathcal{E}(x_{k},y_{k}),\quad\hat{\mathcal{E}}_{k+1}=\mathcal{ E}(\hat{x}_{k+1},y_{k+1}) \tag{53}\] for the Lyapunov function \(\mathcal{E}\) defined in (46). Lemma 5: _Assume function \(F\in\mathcal{S}_{\mu}\). Let \((\hat{x}_{k},y_{k})\) be the sequence generated by the accelerated gradient method (51). Then for \(k\geq 0\),_ \[\hat{\mathcal{E}}_{k+1}-\mathcal{E}_{k}\leq -\alpha_{k}\hat{\mathcal{E}}_{k+1}-\alpha_{k}\left\langle\nabla D _{F}(\hat{x}_{k+1},x^{\star}),y_{k+1}-y_{k}\right\rangle-\frac{\mu}{2}\left\| y_{k+1}-y_{k}\right\|^{2}\] \[-\frac{\alpha_{k}\mu}{2}\|y_{k+1}-\hat{x}_{k+1}\|^{2}-\frac{\mu}{ 2}\|\hat{x}_{k+1}-x_{k}\|^{2}.\] Proof: The Lyapunov function \(\mathcal{E}(x,y)\) is \(\mu\)-convex. Thus we have \[\hat{\mathcal{E}}_{k+1}-\mathcal{E}_{k}\leq \left\langle\partial_{x}\mathcal{E}(\hat{x}_{k+1},y_{k+1}),\hat{x} _{k+1}-x_{k}\right\rangle+\left\langle\partial_{y}\mathcal{E}(\hat{x}_{k+1},y _{k+1}),y_{k+1}-y_{k}\right\rangle\] \[-\frac{\mu}{2}\|\hat{x}_{k+1}-x_{k}\|^{2}-\frac{\mu}{2}\left\|y_{ k+1}-y_{k}\right\|^{2}.\] Then substitute \[\hat{x}_{k+1}-x_{k}= \alpha_{k}\mathcal{G}^{x}(\hat{x}_{k+1},y_{k+1})+\alpha_{k}(y_{k} -y_{k+1})\] \[y_{k+1}-y_{k}= \alpha_{k}\mathcal{G}^{y}(\hat{x}_{k+1},y_{k+1}),\] and use the strong Lyapunov property (48) at \((\hat{x}_{k+1},y_{k+1})\) to get the desired result. The term \(-\alpha_{k}\left\langle\nabla D_{F}(\hat{x}_{k+1};x^{\star}),y_{k+1}-y_{k}\right\rangle\) on the right hand side of (54) accounts for \(-\alpha_{k}\langle\partial_{x}\mathcal{E}(\hat{x}_{k+1},y_{k+1}),y_{k+1}-y_{k}\rangle\) for using explicit \(y_{k}\) in (51a), which is again a mis-match term compare with \(\mathcal{G}(\hat{x}_{k+1},y_{k+1})\) used in the implicit Euler scheme (50a). The correction step (51c) will be used to bound the mis-match term. We restate and generalize the result in [29] in the following lemma. Lemma 6: _Assume \(\nabla F\) is \(L_{F}\)-Lipschitz continuous and \((\hat{x}_{k+1},y_{k+1})\) is generated from \((x_{k},y_{k})\) such that: there exists \(c_{1},c_{2},c_{3}>0\) satisfying_ \[\hat{\mathcal{E}}_{k+1}-\mathcal{E}_{k}\leq\ -\alpha_{k}c_{1}\hat{\mathcal{E}}_{k+1}- \alpha_{k}c_{2}\left\langle\nabla D_{F}(\hat{x}_{k+1},x^{\star}),y_{k+1}-y_{k} \right\rangle-\frac{c_{3}}{2}\left\|y_{k+1}-y_{k}\right\|^{2}. \tag{55}\] _Then set \(x_{k+1}\) by the relation_ \[(1+\alpha_{k}c_{1})(x_{k+1}-\hat{x}_{k+1})=\alpha_{k}c_{2}(y_{k+1}-y_{k}). \tag{56}\] _and choose \(\alpha_{k}>0\) satisfying_ \[\alpha_{k}^{2}L_{F}c_{2}^{2}\leq(1+\alpha_{k}c_{1})c_{3}, \tag{57}\] _we have the linear convergence_ \[\mathcal{E}_{k+1}\leq\frac{1}{1+\alpha_{k}c_{1}}\mathcal{E}_{k}.\] Proof: Using the relation (56), we rewrite (55) into \[(1+\alpha_{k}c_{1})\hat{\mathcal{E}}_{k+1}-\mathcal{E}_{k} \tag{58}\] \[\leq -(1+c_{1}\alpha_{k})\left\langle\nabla D_{F}(\hat{x}_{k+1},x^{ \star}),x_{k+1}-\hat{x}_{k+1}\right\rangle-\frac{(1+\alpha_{k}c_{1})^{2}c_{3}} {2\alpha_{k}^{2}c_{2}^{2}}\left\|x_{k+1}-\hat{x}_{k+1}\right\|^{2}.\] As \(D_{F}(\cdot,x^{\star})\in\mathcal{S}_{\mu,L_{F}}\), we have \[\mathcal{E}_{k+1}-\hat{\mathcal{E}}_{k+1} =D_{F}(x_{k+1},x^{\star})-D_{F}(\hat{x}_{k+1},x^{\star}) \tag{59}\] \[\leq\left\langle\nabla D_{F}(\hat{x}_{k+1},x^{\star}),x_{k+1}- \hat{x}_{k+1}\right\rangle+\frac{L_{F}}{2}\|x_{k+1}-\hat{x}_{k+1}\|^{2}.\] Summing \((1+c_{1}\alpha_{k})\times\)(59) and (58) we get \[(1+c_{1}\alpha_{k})\mathcal{E}_{k+1}-\mathcal{E}_{k}\leq-\left(\frac{(1+ \alpha_{k}c_{1})^{2}c_{3}}{2\alpha_{k}^{2}c_{2}^{2}}-\frac{(1+\alpha_{k}c_{1}) L_{F}}{2}\right)\left\|x_{k+1}-\hat{x}_{k+1}\right\|^{2}\leq 0\] according to our choice of \(\alpha_{k}\). Rearrange the terms to get the desired inequality. Remark 2: The largest step size \(\alpha_{k}\) satisfying (57) is given by \[\alpha_{k}=\frac{c_{1}c_{3}+\sqrt{c_{1}^{2}c_{3}^{2}+4L_{F}c_{2}^{2}c_{3}}}{2L _{F}c_{2}^{2}}\geq\frac{1}{c_{2}}\sqrt{\frac{c_{3}}{L_{F}}},\] where the last one is a simplified formula for the step size satisfying (57). We showed the decay of Lyapunov function in Lemma 5 satisfying the assumption of Lemma 6 with \(c_{1}=c_{2}=1,c_{3}=\mu\) and the correction step (51c) matches the relation (56). As a result, we state the following linear convergence rate of the IMEX scheme (51). Theorem 3.1: _Assume function \(F\in\mathcal{S}_{\mu,L_{F}}\). Let \((x_{k},y_{k})\) be the sequence generated by the accelerated gradient method (51) with arbitrary initial value and step size satisfying_ \[\alpha_{k}^{2}L_{F}\leq(1+\alpha_{k})\mu,\] _then for the Lyapunov function (46),_ \[\mathcal{E}_{k+1}\leq\frac{1}{1+\alpha_{k}}\mathcal{E}_{k}.\] _For \(\alpha_{k}=\sqrt{\mu/L_{F}}=1/\sqrt{\kappa(F)}\), we achieve the accelerated rate_ \[\mathcal{E}_{k}\leq\left(\frac{1}{1+1/\sqrt{\kappa(F)}}\right)^{k}\mathcal{E} _{0},\] _which implies_ \[\|x_{k}-x^{\star}\|^{2}+\|y_{k}-x^{\star}\|^{2}\leq\left(\frac{1}{1+1/\sqrt{ \kappa(F)}}\right)^{k}2\mathcal{E}_{0}/\mu.\] For linear problems, comparing with HSS scheme (6), we achieve the same accelerated rate for linear and nonlinear systems without computing the inverse of the symmetric part \((\beta I+\nabla^{2}F)^{-1}\). ### Inexact Solvers for the Shifted skew-Symmetric System In practice, we can relax the inner solver to be an inexact approximation. That is we solve the equation (52) up to a residual \(\varepsilon_{\rm in}=b-\left[(1+\alpha_{k})I+\frac{\alpha_{k}}{\mu}\mathcal{N }\right]y_{k+1}\). The scheme can be modified to \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha_{k}} =y_{k}-\hat{x}_{k+1}, \tag{60a}\] \[\frac{y_{k+1}-y_{k}}{\alpha_{k}} =\hat{x}_{k+1}-y_{k+1}-\frac{1}{\mu}\left(\nabla F(\hat{x}_{k+1})+ \mathcal{N}y_{k+1}\right)-\frac{\varepsilon_{\rm in}}{\alpha_{k}},\] (60b) \[\frac{x_{k+1}-x_{k}}{\alpha_{k}} =y_{k+1}-\frac{1}{2}(x_{k+1}+\hat{x}_{k+1}). \tag{60c}\] Notice that in the third step (60c), we use \(\frac{1}{2}(x_{k+1}+\hat{x}_{k+1})\) instead of \(x_{k+1}\) for discretization variable \(x\) at \(k+1\). The perturbation \(\varepsilon_{\rm in}\) is the residual of the linear equation (52). Corollary 1: _If we compute \(y_{k+1}\) such that the residual of (60b) satisfies_ \[\|\varepsilon_{\rm in}\|^{2}\leq\frac{\alpha_{k}}{2}\left(\|\hat{x}_{k+1}-x_{ k}\|^{2}+\alpha_{k}\|y_{k+1}-\hat{x}_{k+1}\|^{2}\right), \tag{61}\] _then for \((x_{k},y_{k})\) be the sequence generated by the inexact accelerated gradient method (60) with arbitrary initial value and step size satisfying_ \[\alpha_{k}^{2}L_{F}\leq(1+\alpha_{k}/2)\mu,\] _we have the linear convergence_ \[\mathcal{E}_{k+1}\leq\frac{1}{1+\alpha_{k}/2}\mathcal{E}_{k}.\] _For \(\alpha_{k}=\sqrt{\mu/L_{F}}=1/\sqrt{\kappa(F)}\), we achieve the accelerated rate_ \[\mathcal{E}_{k}\leq\left(\frac{1}{1+1/(2\sqrt{\kappa(F)})}\right)^{k}\mathcal{ E}_{0}.\] Proof: We write (60b) as \[y_{k+1}-y_{k}=\alpha_{k}\mathcal{G}^{y}(\hat{x}_{k+1},y_{k+1})+\varepsilon_{ \rm in}.\] Compared with Lemma 5, the inexactness introduces a mis-match term \(\mu(y_{k+1}-x^{\star},\epsilon_{\rm out})\) in \(\langle\partial_{y}\mathcal{E}(\hat{x}_{k+1},y_{k+1}),y_{k+1}-y_{k}\rangle\) which can be bounded by \[\mu|(y_{k+1}-x^{\star},\epsilon_{\rm out})| \leq\frac{\alpha_{k}\mu}{4}\|y_{k+1}-x^{\star}\|^{2}+\frac{\mu}{ \alpha_{k}}\|\varepsilon_{\rm in}\|^{2}\] \[\leq\frac{\alpha_{k}\mu}{4}\|y_{k+1}-x^{\star}\|^{2}+\frac{\mu}{ 2}\left(\|\hat{x}_{k+1}-x_{k}\|^{2}+\alpha_{k}\|y_{k+1}-\hat{x}_{k+1}\|^{2} \right).\] Use \(-\alpha_{k}\hat{\mathcal{E}}_{k+1}/2\) to cancel the first term and the additional quadratic term in (54) to cancel the second. Then we have \[\hat{\mathcal{E}}_{k+1}-\mathcal{E}_{k}\leq-\frac{\alpha_{k}}{2}\hat{\mathcal{E }}_{k+1}-\alpha_{k}\left\langle\nabla D_{F}(\hat{x}_{k+1},x^{\star}),y_{k+1}-y _{k}\right\rangle-\frac{\mu}{2}\left\|y_{k+1}-y_{k}\right\|^{2}, \tag{62}\] which with the correction step (60c) satisfying assumptions in Lemma 6 with \(c_{1}=1/2,c_{2}=1\) and \(c_{3}=\mu\). Solvers for the shifted skew-symmetric equation (52) with the form \((\beta I+\mathcal{N})y=b(\hat{x}_{k+1},y_{k})\) is discussed in Section 3. In particular, \(\beta=(1+\sqrt{\mu/L_{F}})\sqrt{\mu L_{F}}\) if we choose \(\alpha_{k}=\sqrt{\mu/L_{F}}\). The inner iteration steps are roughly \(C_{\rm in}\sqrt{\kappa(F)}L_{B^{\rm sym}}/L_{F}\). The outer iteration is \(C_{\rm out}\sqrt{\kappa(F)}\). Constants \(C_{\rm in}=\mathcal{O}(|\ln\varepsilon_{\rm in}|)\) and \(C_{\rm out}=\mathcal{O}(|\ln\epsilon_{\rm out}|)\) depend on the tolerance \(\varepsilon_{\rm in}\) for the inner iteration and \(\epsilon_{\rm out}\) for the outer iteration. Therefore * \(\nabla F(x_{k})\) gradient evaluation: \(C_{\rm out}\sqrt{\kappa(F)}\); * \((\beta I+B)^{-1}b\) matrix-vector multiplication: \(C_{\rm in}C_{\rm out}\kappa(B^{\rm sym})\), where we use the relation \(\kappa(F)L_{B^{\rm sym}}/L_{F}=\kappa(B^{\rm sym})\). ### Accelerated Gradient and skew-Symmetric Splitting Methods Combining the MEX scheme in Section 4.3 and accelerated overrelexation technique in Section 3.5, we propose the following explicit discretization of the accelerated gradient flow: \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha} =y_{k}-\hat{x}_{k+1}, \tag{63a}\] \[\frac{y_{k+1}-y_{k}}{\alpha} =\hat{x}_{k+1}-y_{k+1}-\frac{1}{\mu}\left(\nabla F(\hat{x}_{k+1} )+B^{\rm sym}y_{k}-2By_{k+1}\right),\] (63b) \[\frac{x_{k+1}-x_{k}}{\alpha} =y_{k+1}-\frac{1}{2}(x_{k+1}+\hat{x}_{k+1}). \tag{63c}\] The update of \(y_{k+1}\) is equivalent to solve a lower triangular linear algebraic system \[\left((1+\alpha)I+\frac{2\alpha}{\mu}B\right)y_{k+1}=b(\hat{x}_{k+1},y_{k})\] with \(b(\hat{x}_{k+1},y_{k})=y_{k}+\alpha\hat{x}_{k+1}-\frac{\alpha}{\mu}\nabla F( \hat{x}_{k+1})-\frac{\alpha}{\mu}(B^{\intercal}+B)y_{k}\) which can be computed efficiently by a forward substitution and thus no inexact inner solver is needed. Subtracting (63c) from (63a) implies the relation (56) with \(c_{1}=1/2,c_{2}=1\). Consider the modified Lyapunov function: \[\mathcal{E}^{\alpha B}(x,y)=D_{F}(x,x^{\star})+\frac{1}{2}\|y-x^{\star}\|_{ \mu I-\alpha B^{\rm sym}}^{2}. \tag{64}\] For \(0<\alpha<\frac{\mu}{L_{B^{\rm sym}}}\), we have \(\mu I-\alpha B^{\rm sym}\) is positive definite. Then \(\mathcal{E}\geq 0\) and \(\mathcal{E}=0\) if and only if \(x=y=x^{\star}\). We denote \[\mathcal{E}_{k}^{\alpha B}=\mathcal{E}^{\alpha B}(x_{k},y_{k}),\quad\hat{ \mathcal{E}}_{k}^{\alpha B}=\mathcal{E}^{\alpha B}(\hat{x_{k}},y_{k}).\] **Lemma 7**: _Assume function \(F\in\mathcal{S}_{\mu,L_{F}}\). Let \((\hat{x}_{k},y_{k})\) be the sequence generated by the accelerated gradient method (63) with \(0<\alpha\leq\frac{\mu}{2L_{B^{\mathrm{sym}}}}\). Then, for \(k\geq 0\), the modified Lyapunov function (64) satisfies_ \[\hat{\mathcal{E}}_{k+1}^{\alpha B}-\mathcal{E}_{k}^{\alpha B}\leq -\frac{\alpha}{2}\hat{\mathcal{E}}_{k+1}^{\alpha B}-\alpha\left\langle\nabla D _{F}(\hat{x}_{k+1},x^{\star}),y_{k+1}-y_{k}\right\rangle-\frac{\mu}{4}\left\|y _{k+1}-y_{k}\right\|^{2}. \tag{65}\] Proof: We write the difference of the modified Lyapunov function into \[\hat{\mathcal{E}}_{k+1}^{\alpha B}-\mathcal{E}_{k}^{\alpha B}=\hat{\mathcal{E }}_{k+1}-\mathcal{E}_{k}-\frac{1}{2}\|y_{k+1}-x^{\star}\|_{\alpha B^{\mathrm{ sym}}}^{2}+\frac{1}{2}\|y_{k}-x^{\star}\|_{\alpha B^{\mathrm{sym}}}^{2}. \tag{66}\] where \(\hat{\mathcal{E}}_{k+1},\mathcal{E}_{k}\) are defined in (53) and \(\mathcal{E}\) refers to the Lyapunov function (46). Since \(\mathcal{E}\) is \(\mu\)-convex, \[\hat{\mathcal{E}}_{k+1}-\mathcal{E}_{k}\leq \left\langle\partial_{x}\mathcal{E}(\hat{x}_{k+1},y_{k+1}),\hat{x }_{k+1}-x_{k}\right\rangle-\frac{\mu}{2}\|\hat{x}_{k+1}-x_{k}\|^{2}\] \[\left\langle\partial_{y}\mathcal{E}(\hat{x}_{k+1},y_{k+1}),y_{k+1 }-y_{k}\right\rangle-\frac{\mu}{2}\|y_{k+1}-y_{k}\|^{2}.\] Then write the scheme as a correction of the implicit Euler scheme \[\hat{x}_{k+1}-x_{k}= \ \alpha\mathcal{G}^{x}(\hat{x}_{k+1},y_{k+1})+\alpha(y_{k}-y_{k+ 1}),\] \[y_{k+1}-y_{k}= \ \alpha\mathcal{G}^{y}(\hat{x}_{k+1},y_{k+1})+\frac{\alpha}{\mu} B^{\mathrm{sym}}(y_{k+1}-y_{k}).\] According to the proof of Lemma 5, we get \[\hat{\mathcal{E}}_{k+1}-\mathcal{E}_{k}\leq -\alpha\hat{\mathcal{E}}_{k+1}-\alpha\left\langle\nabla D_{F}( \hat{x}_{k+1},x^{\star}),y_{k+1}-y_{k}\right\rangle-\frac{\mu}{2}\left\|y_{k+ 1}-y_{k}\right\|^{2} \tag{67}\] \[+(y_{k+1}-x^{\star},y_{k+1}-y_{k})_{\alpha B^{\mathrm{sym}}}.\] We use the identity (34) to expand the last cross term in (67) as \[(y_{k+1}-x^{\star},y_{k+1}-y_{k})_{\alpha B^{\mathrm{sym}}}\] \[= \ \frac{1}{2}\|y_{k+1}-x^{\star}\|_{\alpha B^{\mathrm{sym}}}^{2}+ \frac{1}{2}\|y_{k+1}-y_{k}\|_{\alpha B^{\mathrm{sym}}}^{2}-\frac{1}{2}\|y_{k} -x^{\star}\|_{\alpha B^{\mathrm{sym}}}^{2}.\] Substitute back to (67) and rearrange terms using (66), \[\hat{\mathcal{E}}_{k+1}^{\alpha B}-\mathcal{E}_{k}^{\alpha B}\leq -\alpha\hat{\mathcal{E}}_{k+1}-\alpha\left\langle\nabla D_{F}( \hat{x}_{k+1},x^{\star}),y_{k+1}-y_{k}\right\rangle-\frac{1}{2}\left\|y_{k+1} -y_{k}\right\|_{\mu I-\alpha B^{\mathrm{sym}}}^{2}\] \[= -\frac{\alpha}{2}\hat{\mathcal{E}}_{k+1}^{\alpha B}-\frac{\alpha }{2}D_{F}(\hat{x}_{k+1},x^{\star})-\frac{\alpha}{4}\|y_{k+1}-x^{\star}\|_{\mu I +\alpha B^{\mathrm{sym}}}\] \[-\alpha\left\langle\nabla D_{F}(\hat{x}_{k+1},x^{\star}),y_{k+1}-y _{k}\right\rangle-\frac{1}{2}\left\|y_{k+1}-y_{k}\right\|_{\mu I-\alpha B^{ \mathrm{sym}}}^{2}\] \[= -\frac{\alpha}{2}\hat{\mathcal{E}}_{k+1}^{\alpha B}-\alpha\left\langle \nabla D_{F}(\hat{x}_{k+1},x^{\star}),y_{k+1}-y_{k}\right\rangle-\frac{\mu}{4} \left\|y_{k+1}-y_{k}\right\|^{2}\] \[-\frac{\alpha}{2}D_{F}(\hat{x}_{k+1},x^{\star})-\frac{\alpha}{4} \|y_{k+1}-x^{\star}\|_{\mu I+\alpha B^{\mathrm{sym}}}-\frac{1}{4}\left\|y_{k+ 1}-y_{k}\right\|_{\mu I-2\alpha B^{\mathrm{sym}}}^{2}.\] According to our choice \(\alpha\leq\frac{\mu}{2L_{B^{\mathrm{sym}}}}\), both \(\mu I-2\alpha B^{\mathrm{sym}}\) and \(\mu I+\alpha B^{\mathrm{sym}}\) are SPD. Dropping the last three non-positive terms we have the desired result. The decay of the modified Lyapunov function (65) and the appropriate relation (56) satisfies assumptions of Lemma 6 with \(c_{1}=1/2,c_{2}=1\) and \(c_{3}=\mu/2\). Although the Lyapunov function is slightly different, (59) still holds for \(\mathcal{E}^{\alpha B}\). We conclude with the following linear convergence rate. Theorem 4.2: _Assume function \(F\in\mathcal{S}_{\mu,L_{F}}\). Let \((x_{k},y_{k})\) be the sequence generated by the accelerated gradient method (63) with arbitrary initial value and step size satisfying_ \[0<\alpha\leq\min\left\{\frac{\mu}{2L_{B^{\mathrm{sym}}}},\sqrt{\frac{\mu}{2L_ {F}}}\right\},\] _then for the modified Lyapunov function (46),_ \[\mathcal{E}^{\alpha B}_{k+1}\leq\frac{1}{1+\alpha/2}\mathcal{E}^{\alpha B}_{k}.\] _In particular, \(\alpha=\min\left\{\frac{\mu}{2L_{B^{\mathrm{sym}}}},\sqrt{\frac{\mu}{2L_{F}}}\right\}\), we achieve the accelerated rate_ \[\|x_{k+1}-x^{\star}\|^{2}\leq\frac{2}{\mu}\mathcal{E}^{\alpha B}_{k}\leq \left(1+1/\max\left\{4\kappa(B^{\mathrm{sym}}),\sqrt{8\kappa(F)}\right\} \right)^{-k}\frac{2\mathcal{E}^{\alpha B}_{0}}{\mu}.\] As expected, we have developed an explicit scheme (63) which achieves the accelerated rate. Therefore the cost of gradient \(\nabla F(x_{k})\) evaluation and matrix-vector \((\beta I+B)^{-1}b\) multiplication are both \(C_{\mathrm{out}}\max\{\kappa(B^{\mathrm{sym}}),\sqrt{\kappa(F)}\}\). Compare with the inexact IMEX scheme (51), we may need more gradient evaluation but less matrix-vector multiplication. If \(\kappa(B^{\mathrm{sym}})\gg\sqrt{\kappa(F)}\) and \(\nabla F(x_{k})\) is computationally expensive to evaluate, then the inexact IMEX scheme (51) or its inexact version (60) is favorable; otherwise if the error tolerance for the inexact inner solve is small, i.e., \(C_{\mathrm{in}}\) is large, and the cost of \((\beta I+B)^{-1}b\) is comparable to the evaluation of \(\nabla F(x_{k})\), then the explicit scheme (63) takes advantage. ## 5 Nonlinear Saddle Point Systems In this section, we investigate an important class of optimization problems as an example of the considered monotone operator equation (1). We derive optimal algorithms for strongly-convex-strongly-concave saddle point systems. Our algorithms can be relaxed to achieve accelerated linear convergence for convex-concave saddle point systems and inexact solvers. ### Problem Setting Consider the nonlinear smooth saddle point system with bilinear coupling: \[\min_{u\in\mathcal{V}}\max_{p\in\mathcal{Q}}\mathcal{L}(u,p)=f(u)-g(p)+(Bu,p) \tag{68}\] where \(\mathcal{V}=\mathbb{R}^{m},\mathcal{Q}=\mathbb{R}^{n},m\geq n\) are finite-dimensional Hilbert spaces with inner product induced by SPD operators \(\mathcal{I}_{\mathcal{V}},\mathcal{I}_{\mathcal{Q}}\), respectively. Functions \(f(u)\in\mathcal{S}_{\mu_{f},L_{f}},\) and \(g(p)\in\mathcal{S}_{\mu_{g},L_{g}}\). The operator \(B\) is an \(n\times m\) matrix of full rank. Convex optimization problems with affine equality constraints can be rewritten into a saddle point system (68): \[\min_{u\in\mathbb{R}^{m}}f(u)\] (69) subject to \[Bu=b.\] Then \(p\) is the Lagrange multiplier to impose the constraint \(Bu=b\) and \(\mathcal{L}(u,p)=f(u)-(b,p)+(Bu,p)\). Notice that \(g(p)=(b,p)\) is linear and not strongly convex, i.e., \(\mu_{g}=0\). The point \((u^{\star},p^{\star})\) solves the min-max problem (68) is said to be a saddle point of \(\mathcal{L}(u,p)\), that is \[\mathcal{L}(u^{\star},p)\leq\mathcal{L}(u^{\star},p^{\star})\leq\mathcal{L}(u, p^{\star})\quad\forall\;(u,p)\in\mathbb{R}^{m}\times\mathbb{R}^{n}.\] The saddle point \((u^{\star},p^{\star})\) satisfies the first order necessary condition for being the critical point of \(\mathcal{L}(u,p)\): \[\nabla f(u^{\star})+B^{\intercal}p^{\star} =0, \tag{70a}\] \[-Bu^{\star}+\nabla g(p^{\star}) =0. \tag{70b}\] The first equation (70a) is \(\partial_{u}\mathcal{L}(u^{\star},p^{\star})=0\) but the second one (70b) is \(-\partial_{p}\mathcal{L}(u^{\star},p^{\star})=0\). The negative sign is introduced so that (70) is in the form \[\mathcal{A}(x^{\star})=0,\] where \(x=(u,p)\in\mathcal{V}\times\mathcal{Q}\), \(\nabla F=\begin{pmatrix}\nabla f&0\\ 0&\nabla g\end{pmatrix}\), and \(\mathcal{N}=\begin{pmatrix}0&B^{\intercal}\\ -B&0\end{pmatrix}\). To avoid confusion, we use the notation \(\mathcal{B}^{\mathrm{sym}}=\begin{pmatrix}0&B^{\intercal}\\ B&0\end{pmatrix}\) in this section. The splitting (29) becomes \[\mathcal{N}=\begin{pmatrix}0&B^{\intercal}\\ B&0\end{pmatrix}-\begin{pmatrix}0&0\\ 2B&0\end{pmatrix},\quad\text{ and }\quad\mathcal{N}=\begin{pmatrix}I&0\\ 0&-I\end{pmatrix}\mathcal{B}^{\mathrm{sym}}.\] Therefore \(\|\mathcal{N}\|=\|\mathcal{B}^{\mathrm{sym}}\|\) for any operator norm. ### Strongly-Convex-Strongly-Concave Saddle Point Problem Given two SPD operators \(\mathcal{I}_{\mathcal{V}}\) and \(\mathcal{I}_{\mathcal{Q}}\), we denote by \(\mathcal{I}_{\mu}=\begin{pmatrix}\mu_{f}\mathcal{I}_{\mathcal{V}}&0\\ 0&\mu_{g}\mathcal{I}_{\mathcal{Q}}\end{pmatrix}\) and \(\mathcal{I}_{\mathcal{X}}=\begin{pmatrix}\mathcal{I}_{\mathcal{V}}&0\\ 0&\mathcal{I}_{\mathcal{Q}}\end{pmatrix}\). Then for any \(x=(u,p),y=(v,q)\in\mathcal{V}\times\mathcal{Q},\) \[(\mathcal{A}(x)-\mathcal{A}(y),x-y)\geq\|x-y\|_{\mathcal{I}_{\mu}}^{2}\geq\mu \|x-y\|_{\mathcal{I}_{\mathcal{X}}}^{2}\] where \(\mu=\min\{\mu_{f},\mu_{g}\}\). The accelerated gradient flow and the discrete schemes follows from discussion in Section 4. The results are slightly sharp by treating \(\mu\) as a block diagonal matrix \(\mathcal{I}_{\mu}\) and including preconditioners \(\mathcal{I}_{\mathcal{V}}^{-1}\) and \(\mathcal{I}_{\mathcal{Q}}^{-1}\). #### 5.2.1 The accelerated gradient flow The component form of the accelerated gradient flow \[\begin{cases}x^{\prime}=y-x,\\ y^{\prime}=x-y-\mathcal{I}_{\mu}^{-1}(\nabla F(x)+\mathcal{N}y)\end{cases}\] becomes the preconditioned accelerated gradient flow for the saddle point system: \[u^{\prime} =v-u,\] \[p^{\prime} =q-p,\] \[v^{\prime} =u-v-\frac{1}{\mu_{f}}\mathcal{I}_{\mathcal{V}}^{-1}(\nabla f(u)+ B^{\intercal}q), \tag{71}\] \[q^{\prime} =p-q-\frac{1}{\mu_{g}}\mathcal{I}_{\mathcal{Q}}^{-1}(\nabla g(p) -Bv).\] Consider the Lyapunov function: \[\mathcal{E}(x,y):=D_{F}(x,x^{\star})+\frac{1}{2}\|y-x^{\star}\|_{\mathcal{I}_{ \mu}}^{2}=\mathcal{E}^{u}(u,v)+\mathcal{E}^{p}(p,q), \tag{72}\] with \[\mathcal{E}^{u}(u,v)=D_{f}(u,u^{\star})+\frac{\mu_{f}}{2}\|v-u^{\star}\|_{ \mathcal{I}_{\mathcal{V}}}^{2},\] \[\mathcal{E}^{p}(p,q)=D_{g}(p,p^{\star})+\frac{\mu_{g}}{2}\|q-p^{\star}\|_{ \mathcal{I}_{\mathcal{Q}}}^{2}.\] As \(f,g\) are strongly convex, \(\mathcal{E}(x,y)\geq 0\) and \(\mathcal{E}(x,y)=0\) iff \(x=y=x^{\star}\). Denote the vector field on the right hand side of (71) by \(\mathcal{G}(x,y)\). We have the strong Lyapunov property \[-\nabla\mathcal{E}(x,y)\cdot\mathcal{G}(x,y)\geq\mathcal{E}(x,y)+\frac{1}{2} \|y-x\|_{\mathcal{I}_{\mu}}^{2}. \tag{73}\] #### 5.2.2 Accelerated gradient and skew-symmetric splitting methods Recall that \(x=(u,p),y=(v,q)\). The accelerated gradient and skew-symmetric splitting method is: \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha} =y_{k}-\hat{x}_{k+1}, \tag{74a}\] \[\frac{v_{k+1}-v_{k}}{\alpha} =\hat{u}_{k+1}-v_{k+1}-\frac{1}{\mu_{f}}\mathcal{I}_{\mathcal{V}} ^{-1}\left(\nabla f(\hat{u}_{k+1})+B^{\intercal}q_{k}\right),\] (74b) \[\frac{q_{k+1}-q_{k}}{\alpha} =\hat{p}_{k+1}-q_{k+1}-\frac{1}{\mu_{g}}\mathcal{I}_{\mathcal{Q}} ^{-1}\left(\nabla g(\hat{p}_{k+1})-2Bv_{k+1}+Bv_{k}\right),\] (74c) \[\frac{x_{k+1}-x_{k}}{\alpha} =y_{k+1}-x_{k+1}+\frac{1}{2}(x_{k+1}-\hat{x}_{k+1}). \tag{74d}\] Each iteration requires \(2\) matrix-vector products if we store \(Bv_{k}\), \(2\) gradient evaluations and the computation of \(\mathcal{I}_{\mathcal{V}}^{-1}\) and \(\mathcal{I}_{\mathcal{Q}}^{-1}\). Notice that the scheme is explicit as \(v_{k+1}\) can be first updated by (74b) and then used to generate \(q_{k+1}\) in (74c). Consider the tailored discrete Lyapunov function: \[\mathcal{E}^{\alpha B}(x,y):=D_{F}(x,x^{\star})+\frac{1}{2}\|y-x^{\star}\|_{ \mathcal{I}_{\mu}-\alpha\mathcal{B}^{\mathrm{sym}}}^{2}. \tag{75}\] Using the first order necessary conditions (70), the Bregman divergence part can be related to the duality gap \[\begin{split} D_{F}(x,x^{\star})&=D_{f}(u;u^{\star })+D_{g}(p;p^{\star})\\ &=f(u)-f(u^{\star})-\langle\nabla f(u^{\star}),u-u^{\star}\rangle +g(p)-g(p^{\star})-\langle\nabla g(p^{\star}),p-p^{\star}\rangle\\ &=f(u)-f(u^{\star})+\langle B^{\intercal}p^{\star},u-u^{\star} \rangle+g(p)-g(p^{\star})-\langle Bu^{\star},p-p^{\star}\rangle\\ &=\mathcal{L}(u,p^{\star})-\mathcal{L}(u^{\star},p)\leq\Delta(u, p).\end{split}\] The convergence analysis will depend on the condition number of the Schur complement \(S=B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\) in the \(\mathcal{I}_{\mathcal{Q}}\) inner product. We first show \(\mathcal{E}^{\alpha B}\) is non-negative if \(\alpha\) is sufficiently small. Lemma 8: _Assume \(f\in\mathcal{S}_{\mu_{f}}\) and \(g\in\mathcal{S}_{\mu_{g}}\). When the step size_ \[\alpha\leq\sqrt{\frac{\mu_{f}\mu_{g}}{4L_{S}}}\] _where \(L_{S}=\lambda_{\max}(\mathcal{I}_{\mathcal{Q}}^{-1}B\mathcal{I}_{\mathcal{V}} ^{-1}B^{\intercal})\), the matrix_ \[\mathcal{I}_{\mu}-2\alpha\mathcal{B}^{\mathrm{sym}}=\begin{pmatrix}\mu_{f} \mathcal{I}_{\mathcal{V}}&-2\alpha B^{\intercal}\\ -2\alpha B&\mu_{g}\mathcal{I}_{\mathcal{Q}}\end{pmatrix}\] _is symmetric and positive semidefinite._ Proof: We have the block matrix factorization \[\begin{split}&\begin{pmatrix}\mu_{f}\mathcal{I}_{\mathcal{V}}&-2 \alpha B^{\intercal}\\ -2\alpha B&\mu_{g}\mathcal{I}_{\mathcal{Q}}\end{pmatrix}\\ &=\begin{pmatrix}I_{m}&0\\ -\frac{2\alpha}{\mu_{f}}B\mathcal{I}_{\mathcal{V}}^{-1}&I_{n}\end{pmatrix} \begin{pmatrix}\mu_{f}\mathcal{I}_{\mathcal{V}}&0\\ 0&\mu_{g}\mathcal{I}_{\mathcal{Q}}-\frac{4\alpha^{2}}{\mu_{f}}B\mathcal{I}_{ \mathcal{V}}^{-1}B^{\intercal}\end{pmatrix}\begin{pmatrix}I_{m}&-\frac{2\alpha }{\mu_{f}}\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\\ 0&I_{n}\end{pmatrix}.\end{split} \tag{76}\] Then if \(\alpha\leq\sqrt{\mu_{f}\mu_{g}/(4L_{S})}\), we have \(\mu_{g}\mathcal{I}_{\mathcal{Q}}-\frac{4\alpha^{2}}{\mu_{f}}B\mathcal{I}_{ \mathcal{V}}^{-1}B^{\intercal}\geq 0\) and the results follows. As a result, \(\mathcal{E}^{\alpha B}\geq 0\) if \(\alpha\leq\sqrt{\mu_{f}\mu_{g}/(4L_{S})}\) and \(\mathcal{E}^{\alpha B}(x,y)=0\) only if \(x=x^{\star}\). Lemma 9: _Assume \(f\in\mathcal{S}_{\mu_{f}}\) and \(g\in\mathcal{S}_{\mu_{g}}\). For \(\mathcal{B}^{\mathrm{sym}}=\begin{pmatrix}0&B^{\intercal}\\ B&0\end{pmatrix}\), we have_ \[L_{\mathcal{B}^{\mathrm{sym}}}:=\|\mathcal{B}^{\mathrm{sym}}\|_{\mathcal{I}_{ \mu}}=\sqrt{\frac{L_{S}}{\mu_{f}\mu_{g}}},\quad\text{and}\ \kappa_{\mathcal{I}_{\mu}}(\mathcal{N})=\sqrt{\frac{L_{S}}{\mu_{f}\mu_{g}}}.\] Proof: Since \(\mathcal{B}^{\rm sym}\in\mathbb{R}^{(m+n)^{2}}\) is symmetric, \(\mathcal{B}^{\rm sym}\) has \((m+n)\) real eigenvalues. Let \(\lambda\) be the largest absolute value eigenvalue with respect to \(\mathcal{I}_{\mu}\) and \(x=(u,p)\) be the corresponding eigenvector, that is \(\|\mathcal{B}^{\rm sym}\|_{\mathcal{I}_{\mu}}=\lambda\) and \[\mathcal{B}^{\rm sym}x=\lambda\mathcal{I}_{\mu}x.\] The component form follows as \[Bu=\lambda\mu_{g}\mathcal{I}_{\mathcal{Q}}p,\quad B^{\intercal}p=\lambda\mu_{ f}\mathcal{I}_{\mathcal{V}}u.\] Substitute \(u\) in the first equation side using the other equation, we get \[B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}p=\lambda^{2}\mu_{f}\mu_{g} \mathcal{I}_{\mathcal{Q}}p.\] Since \(B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\) is positive definite, we have \(|\lambda|=\sqrt{\frac{L_{S}}{\mu_{f}\mu_{g}}}\) with \(L_{S}=\lambda_{\max}(\mathcal{I}_{\mathcal{Q}}^{-1}B\mathcal{I}_{\mathcal{V} }^{-1}B^{\intercal})\). Equality on \(\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})\) follows since \(\mu=\mu_{f}=\mu_{g}=1\) with respect to \(\mathcal{I}_{\mu}\) norm. Define \(\mathcal{E}_{k}^{\alpha B}:=\mathcal{E}^{\alpha B}(x_{k},y_{k})\). With \(\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})\) shown above and \(\kappa(F)\) refined to \(\kappa_{\mathcal{I}_{\mathcal{V}}}(f)\) and \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(g)\), we have the following linear convergence as a direct corollary of Theorem 4. Theorem 4.1: _Assume \(f\in\mathcal{S}_{\mu_{f},L_{f}}\) and \(g\in\mathcal{S}_{\mu_{g},L_{g}}\) with \(\mu=\min\{\mu_{f},\mu_{g}\}>0\). Let \((x_{k},y_{k})\) be the sequence generated by the accelerated gradient and skew-symmetric splitting method (74) with arbitrary initial value and step size satisfying_ \[0\leq\alpha\leq\min\left\{\sqrt{\frac{\mu_{f}\mu_{g}}{4L_{S}}},\sqrt{\frac{\mu _{f}}{2L_{f}}},\sqrt{\frac{\mu_{g}}{2L_{g}}}\right\}\] _where \(L_{S}=\lambda_{\max}(\mathcal{I}_{\mathcal{Q}}^{-1}B\mathcal{I}_{\mathcal{V} }^{-1}B^{\intercal})\). Then for the discrete Lyapunov function (75),_ \[\mathcal{E}_{k+1}^{\alpha B}\leq\frac{1}{1+\alpha/2}\mathcal{E}_{k}^{\alpha B}.\] _In particular, for \(\alpha=1/\max\left\{2\kappa_{\mathcal{I}_{\mu}}(\mathcal{N}),\sqrt{2\kappa_{ \mathcal{I}_{\mathcal{V}}}(f)},\sqrt{2\kappa_{\mathcal{I}_{\mathcal{Q}}}(g)}\right\}\), we achieve the accelerated rate_ \[\|u_{k}-u^{\star}\|_{\mathcal{I}_{\mathcal{V}}}^{2}+\|p_{k}-p^{ \star}\|_{\mathcal{I}_{\mathcal{Q}}}^{2}\] \[\leq\left(1+1/\max\left\{4\kappa_{\mathcal{I}_{\mu}}(\mathcal{N} ),2\sqrt{2\kappa_{\mathcal{I}_{\mathcal{V}}}(f)},2\sqrt{2\kappa_{\mathcal{I} _{\mathcal{Q}}}(g)}\right\}\right)^{-k}\frac{2\mathcal{E}_{0}^{\alpha B}}{\mu}.\] For strongly-convex-strongly-concave saddle point systems, set \(\mathcal{I}_{\mathcal{V}}=I_{m}\) and \(\mathcal{I}_{\mathcal{Q}}=I_{n}\), scheme (74) is an explicit scheme achieving the lower complexity bound: \(\Omega\left(\sqrt{\kappa(f)+\kappa^{2}(\mathcal{N})+\kappa(g)}\cdot|\ln\epsilon _{\rm out}|\right)\) established in [37]. Notice that in [37], only the theoretical lower bound is proved and no algorithms are developed to match the lower bound. Ours are among the first few explicit schemes achieving this lower bound. The condition numbers \(\kappa(f),\kappa(g)\), and \(\kappa(\mathcal{N})\) are scaling invariant. They can be improved using appropriate SPD preconditioners \(\mathcal{I}_{\mathcal{V}}\) and \(\mathcal{I}_{\mathcal{Q}}\) with the price of computing \(\mathcal{I}_{\mathcal{V}}^{-1}\) and \(\mathcal{I}_{\mathcal{Q}}^{-1}\). The term \(\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})=\sqrt{\frac{L_{S}}{\mu_{f}\mu_{g}}}\) might be the leading term compare with \(\sqrt{\kappa_{\mathcal{I}_{\mathcal{V}}}(f)}\) and \(\sqrt{\kappa_{\mathcal{I}_{\mathcal{Q}}}(g)}\). The observation is that preconditioner \(\mathcal{I}_{\mathcal{Q}}^{-1}\) can be chosen so that \(L_{S}\) is small. Namely \(\mathcal{I}_{\mathcal{Q}}^{-1}\) is a preconditioner for the Schur complement \(B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\). For example, if \(\mathcal{I}_{\mathcal{V}}=I_{m}\), then the ideal choice is \(\mathcal{I}_{\mathcal{Q}}=(BB^{\intercal})^{-1}\) so that \(L_{S}=1\). Such choice of \(\mathcal{I}_{\mathcal{Q}}\) may increase the condition number \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(g)\) as \((BB^{\intercal})^{-1}\) may not be a good preconditioner of \(g\). Later on we shall show even \(\mu_{g}>0\), it is better to consider the transformed primal dual (TPD) flow proposed in our recent work [14]. #### 5.2.3 Implicit in the skew-symmetric part The leading term \(\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})=\sqrt{\frac{L_{S}}{\mu_{f}\mu_{g}}}\) is due to the bilinear coupling or equivalently from the explicit treatment for the skew-symmetric component \(\mathcal{N}\). We can treat \(\mathcal{N}\) implicitly and obtain the following IMEX scheme: \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha_{k}} = y_{k}-\hat{x}_{k+1}, \tag{77a}\] \[\frac{v_{k+1}-v_{k}}{\alpha_{k}} = \hat{u}_{k+1}-v_{k+1}-\frac{1}{\mu_{f}}\mathcal{I}_{\mathcal{V}}^ {-1}\left(\nabla f(\hat{u}_{k+1})+B^{\intercal}q_{k+1}\right),\] (77b) \[\frac{q_{k+1}-q_{k}}{\alpha_{k}} = \hat{p}_{k+1}-q_{k+1}-\frac{1}{\mu_{g}}\mathcal{I}_{\mathcal{Q}}^ {-1}\left(\nabla g(\hat{p}_{k+1})-Bv_{k+1}\right),\] (77c) \[\frac{x_{k+1}-x_{k}}{\alpha_{k}} = y_{k+1}-x_{k+1}. \tag{77d}\] As the skew-symmetric part is treat implicitly, the restriction \(\alpha\leq\sqrt{\frac{\mu_{f}\mu_{g}}{4L_{S}}}\) can be removed. We state the convergence theorem directly as the proofs are illustrated with the strong Lyapunov property in the continuous level and the discussion in Section 4.3 for IMEX schemes. Theorem 5.3: _Assume \(f\in\mathcal{S}_{\mu_{f},L_{f}}\) and \(g\in\mathcal{S}_{\mu_{g},L_{g}}\). Let \((x_{k},y_{k})\) be the sequence generated by the preconditioned accelerated gradient method (77) with arbitrary initial value and step size \(\alpha_{k}\) satisfying_ \[\alpha_{k}^{2}L_{f}\leq(1+\alpha_{k})\mu_{f},\quad\alpha_{k}^{2}L_{g}\leq(1+ \alpha_{k})\mu_{g},\] _then for the Lyapunov function (72),_ \[\mathcal{E}_{k+1}\leq\frac{1}{1+\alpha_{k}}\mathcal{E}_{k}. \tag{78}\] _In particualr for \(\alpha_{k}=1/\max\{\sqrt{\kappa_{\mathcal{I}_{\mathcal{V}}}(f)},\sqrt{\kappa_ {\mathcal{I}_{\mathcal{Q}}}(g)}\}\), we achieve the accelerated rate_ \[\mathcal{E}_{k}\leq\left(1+1/\max\{\sqrt{\kappa_{\mathcal{I}_{\mathcal{V}}}(f)},\sqrt{\kappa_{\mathcal{I}_{\mathcal{Q}}}(g)}\}\right)^{-k}\mathcal{E}_{0}.\] We discuss the inner solve on (77b)-(77c) which is equivalent to the following linear algebraic equation \[\begin{pmatrix}(1+\alpha_{k})\mu_{f}\mathcal{I}_{\mathcal{V}}&\alpha_{k}B^{ \intercal}\\ -\alpha_{k}B&(1+\alpha_{k})\mu_{g}\mathcal{I}_{\mathcal{Q}}\end{pmatrix} \begin{pmatrix}v_{k+1}\\ q_{k+1}\end{pmatrix}=b(\hat{x}_{k+1},y_{k}), \tag{79}\] with \(b(\hat{x}_{k+1},y_{k})=\mathcal{I}_{\mu}(y_{k}+\alpha_{k}\hat{x}_{k+1})-\alpha _{k}\nabla F(\hat{x}_{k+1})\). When \(\mathcal{I}_{\mathcal{V}},\mathcal{I}_{\mathcal{Q}}\) are identity, solving the equation (79) basically costs the effort of solving \[((1+\alpha_{k})^{2}\mu_{f}\mu_{g}I+\alpha_{k}^{2}BB^{\intercal})x=b,\] which can be solved by conjugate gradient methods with \(\mathcal{O}\left(\frac{\alpha_{k}\|B\|}{(1+\alpha_{k})\sqrt{\mu_{f}\mu_{g}}}\right)\) matrix-vector product. One can also use preconditioned AOR iteration developed in Section 3.4 for solving (79) but in the \(\mathcal{I}_{\mu}\) inner product: \[\frac{v^{\ell+1}-v^{\ell}}{\alpha^{\ell}} =-\frac{1}{\mu_{f}}\mathcal{I}_{\mathcal{V}}^{-1}\left[(1+\alpha _{k})\mu_{f}\mathcal{I}_{\mathcal{V}}v^{\ell+1}+\alpha_{k}B^{\intercal}q^{ \ell}-b^{v}(\hat{x}_{k+1},y_{k})\right],\] \[\frac{q^{\ell+1}-q^{\ell}}{\alpha^{\ell}} =-\frac{1}{\mu_{g}}\mathcal{I}_{\mathcal{Q}}^{-1}\left[(1+\alpha _{k})\mu_{g}\mathcal{I}_{\mathcal{Q}}q^{\ell+1}+\alpha_{k}B(v^{\ell}-2v^{\ell +1})-b^{q}(\hat{x}_{k+1},y_{k})\right].\] The initial value \((v^{0},q^{0})\) can be set as \((v_{k},q_{k})\). The inner solver for (79) can be inexact which is a direct application of Section 4.4. We skip the details here. Noted that \(\hat{x}_{k+1}=(\hat{u}_{k+1},\hat{p}_{k+1}),y_{k}=(v_{k},q_{k})\) are given and not updated in the inner iteration. One AOR iteration is essentially \(2\) matrix-vector products when \(\mathcal{I}_{\mathcal{V}}\) and \(\mathcal{I}_{\mathcal{Q}}\) are scaled identities. The inner iteration steps is again proportional to \(\frac{\alpha_{k}}{1+\alpha_{k}}\sqrt{\frac{L_{\mathcal{S}}}{\mu_{f}\mu_{g}}}\). The outer iteration complexity is \(O(\frac{1}{\alpha_{k}})\). Therefore we conclude that IMEX scheme (77) requires * gradient evaluation: \(C_{\mathrm{out}}\max\{\sqrt{\kappa_{\mathcal{I}_{\mathcal{V}}}(f)},\sqrt{ \kappa_{\mathcal{I}_{\mathcal{Q}}}(g)}\}\), * matrix-vector multiplication: \(C_{\mathrm{out}}C_{\mathrm{in}}\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})\), * preconditioners \(\mathcal{I}_{\mathcal{V}}^{-1}\) and \(\mathcal{I}_{\mathcal{Q}}^{-1}\): \(C_{\mathrm{out}}C_{\mathrm{in}}\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})\), which matches the optimal lower bound in [37]. The preconditioners \(\mathcal{I}_{\mathcal{V}}^{-1}\) or \(\mathcal{I}_{\mathcal{Q}}^{-1}\) are designed to balance the gradient evaluation cost and matrix-vector multiplication and preconditioners cost. #### 5.2.4 Implicit in the gradient part We can use the generalized gradient flow (21) and treat \(\nabla F\) implicitly and \(\mathcal{N}\) explicitly with AOR if given the following generalized proximal operations: \[\mathrm{prox}_{\gamma f}(v) :=\operatorname*{argmin}_{u}f(u)+\frac{1}{2\gamma}\|u-v\|_{ \mathcal{I}_{\mathcal{V}}}^{2},\] \[\mathrm{prox}_{\sigma g}(q) :=\operatorname*{argmin}_{p}g(p)+\frac{1}{2\sigma}\|p-q\|_{ \mathcal{I}_{\mathcal{Q}}}^{2}.\] When \(\mathcal{I}_{\mathcal{V}},\mathcal{I}_{\mathcal{Q}}\) are scaled identity, that matched the typical proximal operators defined in (18). Notice that the proximal operation works for non-smooth functions. The critical point of the saddle point system becomes solving for \((u^{\star},p^{\star})\) such that \[\begin{split} 0&\in\partial f(u^{\star})+B^{\intercal}p^{ \star},\\ 0&\in-Bu^{\star}+\partial g(p^{\star}).\end{split} \tag{80}\] Here we present the algorithm for non-smooth \(f,g\): \[\begin{split} u_{k+1}&=\operatorname{prox}_{\alpha/ \mu_{f}f}(u_{k}-\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}p_{k}),\\ p_{k+1}&=\operatorname{prox}_{\alpha/\mu_{g}g}(p_ {k}-\mathcal{I}_{\mathcal{Q}}^{-1}B(u_{k}-2u_{k+1})),\end{split} \tag{81}\] which is equivalent to the iteration \[\begin{split}\frac{u_{k+1}-u_{k}}{\alpha}&=-\frac{1} {\mu_{f}}\mathcal{I}_{\mathcal{V}}^{-1}\left(\xi_{k+1}+B^{\intercal}p_{k} \right),\quad\xi_{k+1}\in\partial f(u_{k+1}),\\ \frac{p_{k+1}-p_{k}}{\alpha}&=-\frac{1}{\mu_{g}} \mathcal{I}_{\mathcal{Q}}^{-1}\left(\eta_{k+1}+Bu_{k}-2Bu_{k+1}\right),\quad \eta_{k+1}\in\partial g(p_{k+1}).\end{split} \tag{82}\] Consider the Lyapunov function for AOR methods: \[\begin{split}\mathcal{E}^{\alpha B}(u,p)&=\frac{ \mu_{f}}{2}\|u-u^{\star}\|_{\mathcal{I}_{\mathcal{V}}}^{2}+\frac{\mu_{g}}{2}\|p -p^{\star}\|_{\mathcal{I}_{\mathcal{Q}}}^{2}-2\alpha(B(u-u^{\star}),p-p^{ \star})\\ &=\frac{1}{2}\|x-x^{\star}\|_{\mathcal{I}_{\mu}-2\alpha\mathcal{B }^{\text{sym}}}^{2}.\end{split} \tag{83}\] By Lemma 8, \(\mathcal{E}^{\alpha B}(x)\geq 0\) for \(0\leq\alpha<\sqrt{\mu_{f}\mu_{g}/(4L_{S})}\) and \(\mathcal{E}^{\alpha B}(x)=0\) if and only if \(x=x^{\star}\). As \(\nabla F\) is treated implicitly, the following theorem can be proved similar to Theorem 1. Theorem 2.7: _Assume \(f\in\mathcal{S}_{\mu_{f}}\) and \(g\in\mathcal{S}_{\mu_{g}}\). Let \(\{x_{k}\}\) be the sequence generated by (81) with arbitrary initial guess \(x_{0}\) and step size \(0\leq\alpha<1/(2\kappa_{\mathcal{I}_{\mu}}(\mathcal{N}))\) with \(\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})=\sqrt{\frac{L_{S}}{\mu_{f}\mu_{g}}}\) and \(L_{S}=\lambda_{\max}(\mathcal{I}_{\mathcal{Q}}^{-1}B\mathcal{I}_{\mathcal{V}}^{ -1}B^{\intercal})\). Then for the Lyapunov function (83),_ \[\mathcal{E}^{\alpha B}(x_{k+1})\leq\frac{1}{1+\alpha}\mathcal{E}^{\alpha B}(x_{ k}). \tag{84}\] _In particular, for \(\alpha=\frac{1}{4}\sqrt{\frac{\mu_{f}\mu_{g}}{L_{S}}}\), we have_ \[\|x_{k}-x^{\star}\|^{2}\leq\left(1+1/(4\kappa_{\mathcal{I}_{\mu}}(\mathcal{N}) )\right)^{-k}3\|x_{0}-x^{\star}\|^{2}.\] This is indeed the optimal bound shown in [37]. Proximal methods combining over-relaxation parameters are considered and yielding optimal rates; see [10; 11] for variants of schemes. ### Convex-Concave Saddle Point Problems The acceleration cannot be recovered for the constrained optimization problem (69) since the corresponding saddle point system (Lagrangian) is not strongly concave with respect to \(p\) (recall that \(g(p)=(b,p)\) is linear). However, (69) admits a unique solution as long as \(f\) is strongly convex. In general, when \(f\) is strongly convex, its convex conjugate exists, i.e., \(f^{*}(\xi)=\max_{u\in\mathbb{R}^{m}}\left\langle\xi,u\right\rangle-f(u)\) is well defined and convex. Then (68) is equivalent to the composite optimization problem without constraints: \[\min_{p\in\mathbb{R}^{n}}f^{*}(-B^{\intercal}p)+g(p), \tag{85}\] which is a strongly convex optimization problem since \(\nabla f\) is Lipschitz continuous. In this subsection, we adapt the acceleration technique to the transformed primal-dual flow to develop accelerated gradient methods for convex-concave saddle point problems. #### 5.3.1 Transformed primal-dual flow A transformed primal-dual (TPD) flow : \[\begin{split} u^{\prime}&=-\mathcal{I}_{\mathcal{V} }^{-1}(\nabla f(u)+B^{\intercal}p),\\ p^{\prime}&=-\mathcal{I}_{\mathcal{Q}}^{-1}\left( \nabla g(p)+B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}p-B(u-\mathcal{I}_{ \mathcal{V}}^{-1}\nabla f(u))\right),\end{split} \tag{86}\] is proposed in [14], and corresponding numerical discretization achieve linear convergence for convex-concave saddle point systems of this kind. The idea is to show with a transformation, it is equivalent to consider the operator \[\mathcal{A}(x) :=\begin{pmatrix}\nabla f&B^{\intercal}\\ -B+B\mathcal{I}_{\mathcal{V}}^{-1}\nabla f&\nabla g+B\mathcal{I}_{\mathcal{V} }^{-1}B^{\intercal}\end{pmatrix}\begin{pmatrix}u\\ p\end{pmatrix}\] \[=\begin{pmatrix}I&0\\ B\mathcal{I}_{\mathcal{V}}^{-1}&I\end{pmatrix}\begin{pmatrix}\nabla f&B^{ \intercal}\\ -B&\nabla g\end{pmatrix}\begin{pmatrix}u\\ p\end{pmatrix}\] where we extend the matrix-vector product notation to nonlinear version \((\nabla f,u):=\nabla f(u)\) and \((\nabla g,p):=\nabla g(p)\). Then \(\mathcal{A}\) is a monotone operator under some mild assumption on \(\mathcal{I}_{\mathcal{V}}\). The key is the following estimate on the cross term. Lemma 10 (Lemma 3.1 in [14]): _Suppose \(f\in\mathcal{S}_{\mu_{f},\,L_{f}}\). For any \(u_{1},u_{2}\in\mathcal{V}\) and \(p_{1},p_{2}\in\mathcal{Q}\), we have_ \[\begin{split}&\left\langle\nabla f(u_{1})-\nabla f(u_{2}), \mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}(p_{1}-p_{2})\right\rangle\\ &\geq\frac{\mu_{f}}{2}\|v_{1}-v_{2}\|_{\mathcal{I}_{\mathcal{V}}}^ {2}-\frac{L_{f}}{2}\|B^{\intercal}(p_{1}-p_{2})\|_{\mathcal{I}_{\mathcal{V}}^ {-1}}^{2}-\frac{1}{2}\langle\nabla f(u_{1})-\nabla f(u_{2}),u_{1}-u_{2}\rangle,\end{split}\] _where \(v=u+\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}p\) is a transformed variable._ For clear illustration, we consider the linear case \(\nabla f(u)=H_{f}u\) with an SPD matrix \(H_{f}\geq\mu_{f}\mathcal{I}_{\mathcal{V}}\). Lemma 10 implies the matrix \[\begin{pmatrix}H_{f}&H_{f}\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&L_{f}S\end{pmatrix}\geq 0,\quad S=B\mathcal{I}_{ \mathcal{V}}^{-1}B^{\intercal}.\] Then assuming \(\nabla g(p)=H_{g}p,H_{g}\geq 0\), and \(L_{f}<2\), we have \[\mathrm{sym}\mathcal{A} =\mathrm{sym}\begin{pmatrix}H_{f}&B^{\intercal}\\ -B+B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&H_{g}+S\end{pmatrix}=\begin{pmatrix}H_{ f}&\frac{1}{2}H_{f}\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\\ \frac{1}{2}B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&H_{g}+S\end{pmatrix}\] \[\quad=\frac{1}{2}\begin{pmatrix}H_{f}&H_{f}\mathcal{I}_{\mathcal{ V}}^{-1}B^{\intercal}\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&L_{f}S\end{pmatrix}+\frac{1}{2}\begin{pmatrix} H_{f}&0\\ 0&2H_{g}+(2-L_{f})S\end{pmatrix}\] \[\quad\geq\frac{\mu}{2}\begin{pmatrix}\mathcal{I}_{\mathcal{V}}&0 \\ 0&\mathcal{I}_{\mathcal{Q}}\end{pmatrix}\] with \[\mu=\min\{\mu_{f},\mu_{g}^{+}\},\] where the enhanced convexity constant \(\mu_{g}^{+}\) is the largest positive constant s.t. \[2H_{g}+(2-L_{f})S\geq\mu_{g}^{+}\mathcal{I}_{\mathcal{Q}}.\] Switch to the nonlinear case, that is \(2g(\cdot)+(2-L_{f})\frac{1}{2}\|\cdot\|_{S}^{2}\in\mathcal{S}_{\mu_{g}^{+}}\) in the \(\mathcal{I}_{\mathcal{Q}}\) inner product. We have the following lower bounds on \(\mu_{g}^{+}\) \[\mu_{g}^{+}\geq 2\mu_{g}+(2-L_{f})\mu_{S}\geq(2-L_{f})\mu_{g_{S}},\] where \(\mu_{S}=\lambda_{\min}(\mathcal{I}_{\mathcal{Q}}^{-1}S)\) and \(g_{S}(\cdot):=g(\cdot)+\frac{1}{2}\|\cdot\|_{S}^{2}\). Even \(\mu_{g}=0\), the enhanced convexity constant \(\mu_{g}^{+}\geq(2-L_{f})\mu_{S}>0\) if given \(L_{f}<2\). The condition \(L_{f}<2\) can be always satisfied by rescale \(f\) or \(\mathcal{I}_{\mathcal{V}}\). The TPD flow can be simply written as \[x^{\prime}=-\mathcal{I}_{\mathcal{X}}^{-1}\mathcal{A}(x), \tag{87}\] where recall that \(\mathcal{I}_{\mathcal{X}}=\mathrm{diag}(\mathcal{I}_{\mathcal{V}},\mathcal{I }_{\mathcal{Q}})\). Consider the Lyapunov function: \[\mathcal{E}(x)=\mathcal{E}(u,p):=\frac{1}{2}\|u-u^{\star}\|_{\mathcal{I}_{ \mathcal{V}}}^{2}+\frac{1}{2}\|p-p^{\star}\|_{\mathcal{I}_{\mathcal{Q}}}^{2}= \frac{1}{2}\|x-x^{\star}\|_{\mathcal{I}_{\mathcal{X}}}^{2}. \tag{88}\] The strong Lyapunov property has been proved in our recent work [14]. The proof is essentially the way we verify \(\mathrm{sym}\mathcal{A}\geq\mu\mathcal{I}_{\mathcal{X}}/2\). When adapt to the nonlinear case, use the convention \((\nabla f,u_{1}-u_{2})=(\nabla f,u_{1})-(\nabla f,u_{2})=\nabla f(u_{1})- \nabla f(u_{2})\). Lemma 11 (Theorem 3.2 in [14]): _Assume function \(f\in\mathcal{S}_{\mu_{f},L_{f}}\) with \(L_{f}<2\). Then for the Lyapunov function (88) and the transformed primal-dual gradient flow (87), the following strong Lyapunov property holds_ \[\nabla\mathcal{E}(x)\cdot\mathcal{I}_{\mathcal{X}}^{-1}\mathcal{A}(x)\geq\mu \mathcal{E}(x). \tag{89}\] _where \(\mu=\min\{\mu_{f},\mu_{g}^{+}\}>0\)._ Notice \(\mathcal{A}\) cannot be written into the form \(\nabla F+\mathcal{N}\) due to the nonlinear transformation term \(B\mathcal{I}_{\mathcal{V}}^{-1}\nabla f\) and thus it is not straightforward to apply the current framework. #### 5.3.2 Gradient and skew-symmetric splitting methods We have decomposition \(\mathcal{A}=\nabla F+\mathcal{N}+\delta f\) where \(F=f+g_{S}\) and \(\delta f=\begin{pmatrix}0&0\\ B\mathcal{I}_{\mathcal{V}}^{-1}\nabla f&0\end{pmatrix}\). As \(\delta f\) is lower triangular, we can still use the AOR for \(\mathcal{N}\) to obtain an explicit scheme named GSS-TPD: \[\left\{\begin{aligned} \frac{u_{k+1}-u_{k}}{\alpha}& =-\mathcal{I}_{\mathcal{V}}^{-1}(\nabla f(u_{k})+B^{\intercal}p_{k})\\ \frac{p_{k+1}-p_{k}}{\alpha}&=-\mathcal{I}_{\mathcal{Q}}^{-1} \left[B\mathcal{I}_{\mathcal{V}}^{-1}\nabla f(u_{k+1})+\nabla g_{S}(p_{k})-B(2 u_{k+1}-u_{k})\right].\end{aligned}\right. \tag{90}\] Consider the Lyapunov function \[\mathcal{E}(x)=\frac{1}{2}\|x-x^{\star}\|_{\mathcal{X}-\alpha\mathcal{B}^{ \text{sym}}}^{2}-\alpha D_{F}(x^{\star},x). \tag{91}\] Theorem 5.8 (Theorem 4.6 in [14]): _Suppose \(f\in\mathcal{S}_{\mu_{f},L_{f}}\) with \(0<\mu_{f}\leq L_{f}<2\) and \(g_{S}(\cdot):=g(\cdot)+\frac{1}{2}\|\cdot\|_{S}^{2}\in\mathcal{S}_{\mu_{g_{S}}}\). Let \(x_{k}=(u_{k},p_{k})\) be generated by AOR iteration (90) with arbitrary initial value \(x_{0}=(u_{0},p_{0})\) and \(\alpha<1/\max\{2\sqrt{L_{S}},2L_{f},2L_{g_{S}}\}\). Then for the discrete Lyapunov function (91), we have_ \[\mathcal{E}(x_{k+1})\leq\frac{1}{1+\mu\,\alpha/2}\mathcal{E}(x_{k}). \tag{92}\] _where \(\mu=\min\{\mu_{f},\mu_{g}^{+}\}>0\)._ Even for the case \(\mu_{g}=0\), we still achieve the linear convergence rate as \(\mu_{g}^{+}>0\). For constrained optimization problem (69), the strong convexity of \(f\) can be further relaxed to the strong convexity of \[f_{\beta}(u)=f(u)+\frac{\beta}{2}\|Bu-b\|^{2}\] by applying TPD to the augmented Lagrangian. Then even \(\mu_{f}=0\), if \(\mu_{f_{\beta}}>0\), we can apply GSS-TPD scheme (90) to \(f_{\beta}\). However by adding the augmented term, \(\kappa(f)\) is also enlarged to \(\kappa(f_{\beta})\). If we choose relative large \(\beta\), \(L_{f_{\beta}}\) may be large and the step size \(\alpha\) will be small. See (14, Section 6) for more discussion. Remark 3: We could introduce factor \(\mu_{f}^{-1}\) and \((\mu_{g}^{+})^{-1}\) in scheme (90) and refine the rate to \[\left(1+\min\left\{\frac{\mu_{f}}{8L_{f}},\frac{\mu_{g}^{+}}{8L_{g_{S}}}, \sqrt{\frac{\mu_{f}\mu_{g}^{+}}{16L_{S}}}\right\}\right)^{-1} \tag{93}\] for the step size \(\alpha=\min\left\{\frac{\mu_{f}}{4L_{f}},\frac{\mu_{g}^{+}}{4L_{g_{S}}},\sqrt {\frac{\mu_{f}\mu_{g}^{+}}{4L_{S}}}\right\}\). The advantage of using (90) is that only Lipschitz constants are needed to be estimated while (74) requires estimate on \(\mu_{f}\) and \(\mu_{g_{S}}\), which is usually harder to obtain. #### 5.3.3 Accelerated transformed primal-dual gradient flow We propose the accelerated transformed primal-dual gradient flow: \[u^{\prime} =v-u, \tag{94}\] \[v^{\prime} =\frac{1}{2}(u-v)-\frac{1}{\mu_{f}}\mathcal{I}_{\mathcal{V}}^{-1}( \nabla f(u)+B^{\intercal}q),\] \[p^{\prime} =q-p,\] \[q^{\prime} =p-q-\mathcal{I}_{\mathcal{Q}}^{-1}(\nabla g_{S}(p)-Bv+B \mathcal{I}_{\mathcal{V}}^{-1}\nabla f(u)),\] where recall that \(g_{S}(p)=g(p)+\frac{1}{2}\|p\|_{S}^{2}\). Let \(x=(u,p)\) and \(y=(v,q)\). Consider the Lyapunov function: \[\mathcal{E}(x,y):=D_{f}(u,u^{\star})+\frac{\mu_{f}}{2}\|v-u^{\star}\|_{ \mathcal{I}_{\mathcal{V}}}^{2}+D_{g_{S}}(p,p^{\star})+\frac{1}{2}\|q-p^{\star }\|_{\mathcal{I}_{\mathcal{Q}}}^{2}. \tag{95}\] As \(f,g_{S}\) are strongly convex, \(\mathcal{E}(x,y)\geq 0\) and \(\mathcal{E}(x,y)=0\) iff \(x=y=x^{\star}\). Denote the vector field on the right hand side of (94) by \(\mathcal{G}(x,y)\). In order to verify the strong Lyapunov property, we first show the matrix calculation when \(\nabla f(u)=H_{f}u,\nabla g(p)=H_{g}p\) are linear with \(H_{f}=\nabla^{2}f,H_{g}=\nabla^{2}g\) being constant SPD matrices. Then \(H_{g_{S}}=H_{g}+B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal}\). As \(-\nabla\mathcal{E}(x,y)\cdot\mathcal{G}(x,y)\) is a quadratic form of \((x-x^{\star},y-x^{\star})^{\intercal}\), we calculate the corresponding matrix in the order of \((u,v,p,q)\) as \[\begin{pmatrix}H_{f}&0&0&0\\ 0&\mu_{f}\mathcal{I}_{\mathcal{V}}&0&0\\ 0&0&H_{g_{S}}&0\\ 0&0&0&\mathcal{I}_{\mathcal{Q}}\end{pmatrix}\begin{pmatrix}I&-I&0&0\\ -I/2+\mathcal{I}_{\mathcal{V}}^{-1}H_{f}/\mu_{f}&I/2&0&\mathcal{I}_{\mathcal{ V}}^{-1}B^{\intercal}/\mu_{f}\\ 0&0&I&-I\\ \mathcal{I}_{\mathcal{Q}}^{-1}B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&-\mathcal{I }_{\mathcal{Q}}^{-1}B&-I+\mathcal{I}_{\mathcal{Q}}^{-1}H_{g_{S}}&I\end{pmatrix}\] \[=\begin{pmatrix}H_{f}&-H_{f}&0&0\\ -\mu_{f}\mathcal{I}_{\mathcal{V}}/2+H_{f}&\mu_{f}\mathcal{I}_{\mathcal{V}}/2& 0&B^{\intercal}\\ 0&0&H_{g_{S}}&-H_{g_{S}}\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&-B&-\mathcal{I}_{\mathcal{Q}}+H_{g_{S}}& \mathcal{I}_{\mathcal{Q}}\end{pmatrix}.\] For a quadratic form, \(x^{\intercal}Mx=x^{\intercal}\operatorname{sym}(M)x\). So we calculate its symmetric part \[\operatorname{sym}\begin{pmatrix}H_{f}&-H_{f}&0&0\\ -\mu_{f}\mathcal{I}_{\mathcal{V}}/2+H_{f}&\mu_{f}\mathcal{I}_{\mathcal{V}}/2& 0&B\intercal\\ 0&H_{g_{S}}&-H_{g_{S}}\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&-B&-\mathcal{I}_{\mathcal{Q}}+H_{g_{S}}& \mathcal{I}_{\mathcal{Q}}\end{pmatrix}\] \[=\begin{pmatrix}H_{f}&-\mu_{f}\mathcal{I}_{\mathcal{V}}/4&0&B \mathcal{I}_{\mathcal{V}}^{-1}H_{f}/2\\ -\mu_{f}\mathcal{I}_{\mathcal{V}}/4&\mu_{f}\mathcal{I}_{\mathcal{V}}/2&0&0\\ 0&0&H_{g_{S}}&-\mathcal{I}_{\mathcal{Q}}/2\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}/2&0&-\mathcal{I}_{\mathcal{Q}}/2& \mathcal{I}_{\mathcal{Q}}\end{pmatrix}\] \[=\begin{pmatrix}H_{f}/2&-\mu_{f}\mathcal{I}_{\mathcal{V}}/4&0&0\\ -\mu_{f}\mathcal{I}_{\mathcal{V}}/4&\mu_{f}\mathcal{I}_{\mathcal{V}}/2&0&0\\ 0&0&H_{g_{S}}&-\mathcal{I}_{\mathcal{Q}}/2\\ 0&0&-\mathcal{I}_{\mathcal{Q}}/2&3\mathcal{I}_{\mathcal{Q}}/4\end{pmatrix}+ \begin{pmatrix}H_{f}/2&0&0&B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}/2\\ 0&0&0&0\\ 0&0&0&0\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}/2&0&0&\mathcal{I}_{\mathcal{Q}}/4\end{pmatrix}\] \[\geq\frac{1}{4}\operatorname{diag}\{H_{f},\mu_{f}\mathcal{I}_{ \mathcal{V}},H_{g_{S}},\mathcal{I}_{\mathcal{Q}}\}.\] For the last inequality, for \((u,v)\)-block, as \(H_{f}\geq\mu_{f}\mathcal{I}_{\mathcal{V}}\): \[\begin{pmatrix}H_{f}/2&-\mu_{f}\mathcal{I}_{\mathcal{V}}/4\\ -\mu_{f}\mathcal{I}_{\mathcal{V}}/4&\mu_{f}\mathcal{I}_{\mathcal{V}}/2\end{pmatrix} =\frac{1}{4}\begin{pmatrix}H_{f}&-\mu_{f}\mathcal{I}_{\mathcal{V} }\\ -\mu_{f}\mathcal{I}_{\mathcal{V}}&\mu_{f}\mathcal{I}_{\mathcal{V}}\end{pmatrix}+ \frac{1}{4}\begin{pmatrix}H_{f}&0\\ 0&\mu_{f}\mathcal{I}_{\mathcal{V}}\end{pmatrix} \tag{96}\] \[\geq\frac{1}{4}\begin{pmatrix}H_{f}&0\\ 0&\mu_{f}\mathcal{I}_{\mathcal{V}}\end{pmatrix}.\] For \((p,q)\)-block, if \(3H_{g_{S}}/2\geq\mathcal{I}_{\mathcal{Q}}\): \[\begin{pmatrix}H_{g_{S}}&-\mathcal{I}_{\mathcal{Q}}/2\\ -\mathcal{I}_{\mathcal{Q}}/2&3\mathcal{I}_{\mathcal{Q}}/4\end{pmatrix} =\frac{1}{2}\begin{pmatrix}3H_{g_{S}}/2&-\mathcal{I}_{\mathcal{Q }}\\ -\mathcal{I}_{\mathcal{Q}}&\mathcal{I}_{\mathcal{Q}}\end{pmatrix}+\frac{1}{4} \begin{pmatrix}H_{g_{S}}&0\\ 0&\mathcal{I}_{\mathcal{Q}}\end{pmatrix} \tag{97}\] \[\geq\frac{1}{4}\begin{pmatrix}H_{g_{S}}&0\\ 0&\mathcal{I}_{\mathcal{Q}}\end{pmatrix}.\] And the rest term for \((u,q)\)-block, if \(\mathcal{I}_{\mathcal{Q}}\geq 2L_{f}S\), we apply Lemma 10: \[\begin{pmatrix}H_{f}/2&B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}/2\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}/2&\mathcal{I}_{\mathcal{Q}}/4\end{pmatrix} =\frac{1}{2}\begin{pmatrix}H_{f}&B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}\\ B\mathcal{I}_{\mathcal{V}}^{-1}H_{f}&L_{f}S\end{pmatrix}+\frac{1}{2}\begin{pmatrix} 0&0\\ 0&\mathcal{I}_{\mathcal{Q}}/2-L_{f}S\end{pmatrix}\geq 0.\] We give parameter choice that satisfying the required conditions and verify the strong Lyapunov property in the following lemma. Lemma 12: _Assume \(f\in\mathcal{S}_{\mu_{f},L_{f}}\) with \(L_{f}\leq 3/4\) and \(g_{S}\in\mathcal{S}_{\mu_{g_{S}}}\). Suppose we choose \(\mathcal{I}_{\mathcal{Q}}\) such that_ \[2/3-\mu_{g}\leq\lambda_{\min}(\mathcal{I}_{\mathcal{Q}}^{-1}S)\leq\lambda_{ \max}(\mathcal{I}_{\mathcal{Q}}^{-1}S)\leq 1/(2L_{f}).\] _Then for the Lyapunov function (95) and the accelerated transformed primal-dual flow vector field \(\mathcal{G}\) defined as the right side of (94), the following strong Lyapunov property holds_ \[-\nabla\mathcal{E}(x,y)\cdot\mathcal{G}(x,y)\geq\frac{1}{2}\mathcal{E}(x,y). \tag{98}\] Proof: We expand the product in four terms using \(\mathcal{G}=(\mathcal{G}^{u},\mathcal{G}^{v},\mathcal{G}^{p},\mathcal{G}^{q})\): \[-\nabla\mathcal{E}\cdot\mathcal{G}=-\partial_{u}\mathcal{E}\cdot\mathcal{G}^{ u}-\partial_{v}\mathcal{E}\cdot\mathcal{G}^{v}-\partial_{p}\mathcal{E}\cdot \mathcal{G}^{p}-\partial_{q}\mathcal{E}\cdot\mathcal{G}^{q}.\] As \(\mathcal{G}(x^{\star},x^{\star})=0\), we can insert \(\mathcal{G}(x^{\star},x^{\star})\) into these terms. For the \((u,v)\) terms, direct computation gives \[-\partial_{u}\mathcal{E}\cdot\mathcal{G}^{u}-\partial_{v}\mathcal{ E}\cdot\mathcal{G}^{v} =\langle\nabla f(u)-\nabla f(u^{\star}),u-u^{\star}\rangle+\mu_{f} /2\langle v-u^{\star},u-v\rangle_{\mathcal{I}_{\mathcal{V}}}\] \[\quad+\langle v-u^{\star},B^{\intercal}(q-p^{\star})\rangle\] and \[-\partial_{p}\mathcal{E}\cdot\mathcal{G}^{p}-\partial_{q}\mathcal{ E}\cdot\mathcal{G}^{q} =\langle\nabla g_{S}(p)-\nabla g_{S}(p^{\star}),p-p^{\star}\rangle+\langle q -p^{\star},p-q\rangle_{\mathcal{I}_{\mathcal{Q}}}\] \[\quad-\langle q-p^{\star},B(v-u^{\star})\rangle+\langle q-p^{ \star},B\mathcal{I}_{\mathcal{V}}^{-1}(\nabla f(u)-\nabla f(u^{\star}))\rangle.\] By Lemma 10, \[\langle q-p^{\star},B\mathcal{I}_{\mathcal{V}}^{-1}(\nabla f(u)- \nabla f(u^{\star}))\rangle\] \[\geq\frac{\mu_{f}}{2}\|v-v^{\star}\|_{\mathcal{I}_{\mathcal{V}}}^{ 2}-\frac{L_{f}}{2}\|q-p^{\star}\|_{S}^{2}-\frac{1}{2}\langle\nabla f(u)-\nabla f (u^{\star}),u-u^{\star}\rangle.\] Adding them together, we get \[-\nabla\mathcal{E}\cdot\mathcal{G}\geq\frac{1}{2}\langle\nabla f (u)-\nabla f(u^{\star}),u-u^{\star}\rangle-\frac{\mu_{f}}{2}\langle v-u^{ \star},u-v\rangle_{\mathcal{I}_{\mathcal{V}}}\] \[\qquad\qquad\qquad\qquad+\langle\nabla g_{S}(p)-\nabla g_{S}(p^{ \star}),p-p^{\star}\rangle-\frac{L_{f}}{2}\|q-q^{\star}\|_{S}^{2}\] \[\qquad\qquad\qquad\qquad-\langle q-p^{\star},p-q\rangle_{ \mathcal{I}_{\mathcal{Q}}}\] We use the identity for squares (34) to expand \[(q-p^{\star},p-q)_{\mathcal{I}_{\mathcal{Q}}}=\frac{1}{2}(\|p-p^{\star}\|_{ \mathcal{I}_{\mathcal{Q}}}^{2}-\|q-p^{\star}\|_{\mathcal{I}_{\mathcal{Q}}}^{ 2}-\|q-p\|_{\mathcal{I}_{\mathcal{Q}}}^{2}),\] and split \[\langle\nabla g_{S}(p)-\nabla g_{S}(p^{\star}),p-p^{\star}\rangle=D_{g_{S}}(p; p^{\star})+D_{g_{S}}(p^{\star};p).\] Observe that \(\lambda_{\min}(\mathcal{I}_{\mathcal{Q}}^{-1}S)\geq 2/3-\mu_{g}\) implies \(\mu_{g}\mathcal{I}_{\mathcal{Q}}+S\geq 2\mathcal{I}_{\mathcal{Q}}/3\), and consequently \[D_{g_{S}}(p;p^{\star})+\frac{1}{2}D_{g_{S}}(p^{\star};p)\geq\frac{3}{4}\|p-p^ {\star}\|_{\mu_{g}\mathcal{I}_{\mathcal{Q}}+S}^{2}\geq\frac{1}{2}\|p-p^{\star }\|_{\mathcal{I}_{\mathcal{Q}}}^{2}.\] And \(\lambda_{\max}(\mathcal{I}_{\mathcal{Q}}^{-1}S)\leq 1/(2L_{f})\) implies \(2L_{f}S\leq\mathcal{I}_{\mathcal{Q}}\). We have \[\frac{1}{4}\|q-p^{\star}\|_{\mathcal{I}_{\mathcal{Q}}}^{2}\geq\frac{L_{f}}{2} \|q-p^{\star}\|_{S}^{2}.\] The terms involving \((u,v)\) can be bounded by (47) and the identity for squares (34). Therefore, \[-\nabla\mathcal{E}\cdot\mathcal{G}\geq\frac{1}{2}D_{f}(u;u^{\star })+\frac{\mu_{f}}{4}\|v-u^{\star}\|_{\mathcal{I}_{\mathcal{V}}}^{2}+\frac{1}{ 2}D_{g_{S}}(p;p^{\star})+\frac{1}{4}\|q-p^{\star}\|_{\mathcal{I}_{\mathcal{Q}}} ^{2}\] \[\qquad\qquad\qquad+\frac{\mu_{f}}{4}\|v-u\|_{\mathcal{I}_{ \mathcal{V}}}^{2}+\frac{1}{2}\|p-q\|_{\mathcal{I}_{\mathcal{Q}}}^{2}.\] Dropping the last two (nonnegative) quadratic terms we get (98). Again the condition on \(L_{f}\) can be easily fulfilled by rescaling \(f\) or \(\mathcal{I}_{\mathcal{V}}\). In the next subsection, we will see that the condition number of \(\mathcal{I}_{\mathcal{Q}}^{-1}S\) will enter the convergence rates of numerical schemes. #### 5.3.4 Accelerated transformed primal-dual method We propose an accelerated transformed primal-dual (ATPD) method: \[\frac{\hat{x}_{k+1}-x_{k}}{\alpha} =y_{k}-\hat{x}_{k+1}, \tag{99a}\] \[\frac{v_{k+1}-v_{k}}{\alpha} =\frac{1}{2}(\hat{u}_{k+1}-v_{k+1})-\frac{1}{\mu_{f}}\mathcal{I}_ {\mathcal{V}}^{-1}(\nabla f(\hat{u}_{k+1})+B^{\intercal}q_{k}),\] (99b) \[\frac{q_{k+1}-q_{k}}{\alpha} =\hat{p}_{k+1}-q_{k+1}-\mathcal{I}_{\mathcal{Q}}^{-1}\left[\nabla g _{S}(p_{k+1})+Bv_{k}-2Bv_{k+1}+B\mathcal{I}_{\mathcal{V}}^{-1}f(u_{k+1})\right],\] (99c) \[\frac{x_{k+1}-\hat{x}_{k+1}}{\alpha} =(y_{k+1}-y_{k})-\frac{1}{4}(x_{k+1}-\hat{x}_{k+1}). \tag{99d}\] Recall that \(x=(u,p),y=(v,q)\). Approximation \((\hat{u}_{k+1},\hat{p}_{k+1})\) is first updated by (99a) and then used to update \((v_{k+1},q_{k+1})\) by a TPD iteration. The last step is an extrapolation to produce \((u_{k+1},p_{k+1})\). Denote \(\mathcal{I}_{\mu}=\begin{pmatrix}\mu_{f}\mathcal{I}_{\mathcal{V}}&0\\ 0&\mathcal{I}_{\mathcal{Q}}\end{pmatrix}\). Consider the tailored discrete Lyapunov function: \[\mathcal{E}_{k}^{\alpha B}=\mathcal{E}^{\alpha B}(x_{k},y_{k}):=D_{f}(u_{k},u^ {\star})+D_{g_{S}}(p_{k},p^{\star})+\frac{1}{2}\|y_{k}-x^{\star}\|_{\mathcal{ I}_{\mu}-\alpha\mathcal{B}^{\mathrm{sym}}}^{2}. \tag{100}\] According to Lemma 8 with \(\mu_{g}=1\), \(\mathcal{E}^{\alpha B}\geq 0\) for \(0\leq\alpha\leq\sqrt{\mu_{f}/(4L_{S})}\) and \(\mathcal{E}^{\alpha B}(x)=0\) only if \(x=x^{\star}\). Theorem 5.3: _Assume \(f\in\mathcal{S}_{\mu_{f},L_{f}}\) with \(L_{f}\leq 3/4\) and \(g_{S}\in\mathcal{S}_{\mu_{g_{S}},L_{g_{S}}}\). Suppose we can choose \(\mathcal{I}_{\mathcal{Q}}\) such that_ \[2/3-\mu_{g}\leq\lambda_{\min}(\mathcal{I}_{\mathcal{Q}}^{-1}S)\leq\lambda_{ \max}(\mathcal{I}_{\mathcal{Q}}^{-1}S)\leq 1/(2L_{f}). \tag{101}\] _Let \((x_{k},y_{k})\) be the sequence generated by the accelerated transformed primal-dual gradient method (99) with arbitrary initial guess and_ \[0<\alpha\leq\min\left\{\sqrt{\frac{\mu_{f}}{4L_{S}}},\sqrt{\frac{\mu_{f}}{2L_{ f}}},\sqrt{\frac{1}{2L_{g_{S}}}}\right\}.\] _Then for the modified Lyapunov function (100) and \(k\geq 0\),_ \[\mathcal{E}_{k+1}^{\alpha B}\leq\frac{1}{1+\alpha/4}\mathcal{E}_{k}^{\alpha B}.\] Let us discuss the condition (101). Given two SPD operators \(\mathcal{I}_{\mathcal{V}}\) and \(\mathcal{I}_{\mathcal{Q}}\), we shall show that we can always rescale to \(c_{v}\mathcal{I}_{\mathcal{V}}\) and \(c_{q}\mathcal{I}_{\mathcal{Q}}\) such that condition (101) holds. For clarity, we denote the Lipschitz constant of \(\nabla f\) w.r.t. \(c_{v}\mathcal{I}_{\mathcal{V}}\) by \(L_{f,c_{v}}\) and \(L_{f}=L_{f,1}\) for the non-scaled one. Similar notation apply to \(L_{g,c_{q}}\). Then we have the relation \(L_{f,c_{v}}=c_{v}^{-1}L_{f}\) and \(L_{g,c_{q}}=c_{q}^{-1}L_{g}\). Denoted by \(\lambda_{\max}(c_{v},c_{q})=\lambda_{\max}((c_{q}\mathcal{I}_{\mathcal{Q}})^{ -1}B(c_{v}\mathcal{I}_{\mathcal{V}})^{-1}B^{\intercal})\) and abbreviate \(\lambda_{\max}(1,1)=\lambda_{\max}\). Then we have the scaling relation \(\lambda_{\max}(c_{v},c_{q})=(c_{v}\,c_{q})^{-1}\lambda_{\max}\). Similar notation is applied to \(\lambda_{\min}\). In the sequel \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)=\kappa(\mathcal{I}_{\mathcal{Q}}^{-1}B \mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal})\). Those non-scaled quantities are considered as known and fixed. We investigate the scaling effect. First of all, as \(L_{f,c_{v}}\) is inversely proportional to \(c_{v}\), we can choose \[c_{v}=\frac{4}{3}L_{f}\kappa_{\mathcal{I}_{\mathcal{Q}}}(S),\;\text{s.\,t.} \quad L_{f,c_{v}}=\frac{3}{4}\frac{1}{\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)} \leq\frac{3}{4}.\] With \(c_{v}\) determined, we choose \(c_{q}\) s.t. \[(c_{v}\,c_{q})^{-1}\lambda_{\min}=\frac{2}{3}.\] By construction, we have the desired bound in the \(c_{v}\mathcal{I}_{\mathcal{V}}\) and \(c_{q}\mathcal{I}_{\mathcal{Q}}\) inner products \[2/3-\mu_{g,c_{q}}\leq\lambda_{\min}(c_{v},c_{q})\leq\lambda_{\max}(c_{v},c_{q} )\leq 1/(2L_{f,c_{v}}).\] Then we estimate the bound of iteration steps which is proportional to \(1/\alpha\) \[|\ln\epsilon_{\rm out}|\max\left\{\sqrt{\frac{4L_{S}(c_{v},c_{q})}{\mu_{f,c_{ v}}}},\sqrt{\frac{2L_{f,c_{v}}}{\mu_{f,c_{v}}}},\sqrt{2L_{g_{S},c_{q}}}\right\},\] where \(L_{S}(c_{v},c_{q})=\lambda_{\max}(c_{v},c_{q})\). Write \(L_{S}(c_{v},c_{q})/\mu_{f,c_{v}}=L_{S}(c_{v},c_{q})/L_{f,c_{v}}\kappa_{ \mathcal{I}_{\mathcal{V}}}(f)\) and use \(L_{S}(c_{v},c_{q})=\lambda_{\max}(c_{v},c_{q})=(c_{v}c_{q})^{-1}\lambda_{\max }=\frac{2}{3}\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)\) and \(1/L_{f,c_{v}}=\frac{4}{3}\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)\) to bound the term \[\sqrt{\frac{4L_{S}(c_{v},c_{q})}{\mu_{f,c_{v}}}}=\frac{4\sqrt{2}}{3}\sqrt{ \kappa_{\mathcal{I}_{\mathcal{V}}}(f)}\,\kappa_{\mathcal{I}_{\mathcal{Q}}}(S).\] Condition (101) implies \(\mu_{g_{S},c_{q}}\geq 2/3\) and consequently \(\sqrt{L_{g_{S},c_{q}}}=\frac{2}{\sqrt{3}}\sqrt{\kappa_{\mathcal{I}_{\mathcal{ Q}}}(g_{S})}\). So we get the scaling invariant upper bound of iteration complexity \[|\ln\epsilon_{\rm out}|\max\left\{\frac{4\sqrt{2}}{3}\sqrt{\kappa_{\mathcal{I }_{\mathcal{V}}}(f)}\,\kappa_{\mathcal{I}_{\mathcal{Q}}}(S),\frac{2\sqrt{3}}{3 }\sqrt{\kappa_{\mathcal{I}_{\mathcal{Q}}}(g_{S})}\right\}. \tag{102}\] In particular, for affinely constrained optimization problems, \(g_{S}=S\), we have an explicit scheme with complexity \[\mathcal{O}\left(|\ln\epsilon_{\rm out}|\sqrt{\kappa_{\mathcal{I}_{\mathcal{V }}}(f)}\,\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)\right). \tag{103}\] The preconditioner \(\mathcal{I}_{\mathcal{V}}\) is designed s.t. \(\kappa_{\mathcal{I}_{\mathcal{V}}}(f)\) is small. The preconditioner \(\mathcal{I}_{\mathcal{Q}}\) is chosen s.t. \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)\) is small. Again the ideal choice is \(\mathcal{I}_{\mathcal{Q}}=S\) and \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)=1\). For that purpose, sometimes we may choose simple \(\mathcal{I}_{\mathcal{V}}\), so that \(S^{-1}=(B\mathcal{I}_{\mathcal{V}}^{-1}B^{\intercal})^{-1}\) is easy to compute or approximate. For example, \(\mathcal{I}_{\mathcal{V}}=I\) and \(\mathcal{I}_{\mathcal{Q}}\) can be obtained by few multigrid cycles or incomplete LU factorization of the SPD matrix \(BB^{\intercal}\). Iterative methods for computing \(S^{-1}r\) can be thought of as an inner iteration which can be a linear inner solver or a non-linear one. For linear solvers, there is no need to computing \(S^{-1}r\) accurately. For any convergent method, say \(\|I-\mathcal{I}_{\mathcal{Q}}^{-1}S\|\leq 1-\delta<1\), we can bound the condition number \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)\leq 2/\delta-1\). For example, if \(\delta=2/3\), then \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(S)\leq 2\). If \(\delta\) is small, we may use acceleration for the inner linear iterative methods. The inner solver for \(S^{-1}\) can be also a nonlinear one, e.g., the conjugate gradient (CG) method. The bound (103), however, cannot be applied as now the operator associated to CG is non-linear. Instead, the perturbation argument on controlling the residual \(\varepsilon_{\mathrm{in}}\) developed in Section 4.4 can be applied. The inner iteration complexity will be \(\mathcal{O}(|\ln\varepsilon_{\mathrm{in}}|\sqrt{\kappa_{\mathcal{I}_{ \mathcal{Q}}}(S)})\) where a linear operator \(\mathcal{I}_{\mathcal{Q}}\) is used in the inner iteration as a preconditioner of \(S\). Therefore the total iteration complexity for the accelerated transformed primal-dual method is \[\mathcal{O}\left(|\ln\epsilon_{\mathrm{out}}||\ln\varepsilon_{\mathrm{in}}| \sqrt{\kappa_{\mathcal{I}_{\mathcal{V}}}(f)\,\kappa_{\mathcal{I}_{\mathcal{Q} }}(S)}\right),\] which achieves the optimal complexity bound for affinely constrained problems [35] provided \(|\ln\varepsilon_{\mathrm{in}}|\) is not too large. Again the convexity of \(f\) can be relaxed to \(f_{\beta}\) if we consider the augmented Lagrangian. For general strongly-convex-concave saddle point problems, as \(\lambda_{\mathrm{min}}=2/3\) and \(\lambda_{\mathrm{max}}\leq L_{g_{S}}\), the bound (102) can be bounded by \[\mathcal{O}\left(|\ln\epsilon_{\mathrm{out}}|\sqrt{\kappa_{\mathcal{I}_{ \mathcal{V}}}(f)}\,\kappa_{\mathcal{I}_{\mathcal{Q}}}(g_{S})\right). \tag{104}\] which relaxes the leading term \(\kappa_{\mathcal{I}_{\mu}}(\mathcal{N})\) in Theorem 4.1. The preconditioner \(\mathcal{I}_{\mathcal{V}}\) is designed s.t. \(\kappa_{\mathcal{I}_{\mathcal{V}}}(f)\) is small and \(\mathcal{I}_{\mathcal{Q}}\) is for \(\kappa_{\mathcal{I}_{\mathcal{Q}}}(g_{S})\). Similar discussion on linear and non-linear solvers still holds. ## 6 Conclusion In this paper, we propose GSS methods and AGSS methods for solving a class of strongly monotone operator equation achieving accelerated linear convergence rates. The proof of strong Lyapunov property bridges the design of dynamical system on the continuous level, the choice of Lyapunov function and the linear convergence of the numerical schemes (as discretization of the continuous flow). As direct applications, we derive optimal algorithms for strongly-convex-strongly-concave saddle point systems with bilinear coupling. Combining the transformed primal-dual methods in our recent work [14] and augmented Lagrangian, accelerated linear convergence rates can be retained for general convex-concave saddle point problems. As it is well-known in convex minimization, the optimal mixed type convergence rates is \(\mathcal{O}(\min\{1/k^{2},(1-1/\sqrt{\kappa(f)})^{-k})\}\)[13], which enjoys a sublinear rate as long as \(f\) is convex. With more careful design of parameters, our framework may achieve sublinear convergence rates for monotone operator equations. Then the iterative methods with mixed type convergence rate can be smoother for deriving nonlinear multigrid methods for solving saddle point problems, yielding iteration complexity free of problem size and condition number. ###### Acknowledgements. The authors would like to thank Dr. Hao Luo for fruitful discussion. ## Funding L. Chen and J. Wei are supported by National Science Fundation DMS-2012465. ## Conflict of Interest The authors have no conflicts of interest to declare that are relevant to the content of this article.

2310.06202

GPT-who: An Information Density-based Machine-Generated Text Detector

The Uniform Information Density (UID) principle posits that humans prefer to spread information evenly during language production. We examine if this UID principle can help capture differences between Large Language Models (LLMs)-generated and human-generated texts. We propose GPT-who, the first psycholinguistically-inspired domain-agnostic statistical detector. This detector employs UID-based features to model the unique statistical signature of each LLM and human author for accurate detection. We evaluate our method using 4 large-scale benchmark datasets and find that GPT-who outperforms state-of-the-art detectors (both statistical- & non-statistical) such as GLTR, GPTZero, DetectGPT, OpenAI detector, and ZeroGPT by over $20$% across domains. In addition to better performance, it is computationally inexpensive and utilizes an interpretable representation of text articles. We find that GPT-who can distinguish texts generated by very sophisticated LLMs, even when the overlying text is indiscernible. UID-based measures for all datasets and code are available at https://github.com/saranya-venkatraman/gpt-who.

Saranya Venkatraman, Adaku Uchendu, Dongwon Lee

2023-10-09T23:06:05Z

http://arxiv.org/abs/2310.06202v3

# GPT-who: ###### Abstract The Uniform Information Density principle posits that humans prefer to spread information evenly during language production. In this work, we examine if the UID principle can help capture differences between Large Language Models (LLMs) and human-generated text. We propose GPT-who, the first psycholinguistically-aware multi-class domain-agnostic statistical-based detector. This detector employs UID-based features to model the unique statistical signature of each LLM and human author for accurate authorship attribution. We evaluate our method using 4 large-scale benchmark datasets and find that GPT-who outperforms state-of-the-art detectors (both statistical- & non-statistical-based) such as GLTR, GPTZero, OpenAI detector, and ZeroGPT by over \(20\)% across domains. In addition to superior performance, it is computationally inexpensive and utilizes an interpretable representation of text articles. We present the largest analysis of the UID-based representations of human and machine-generated texts (over 400k articles) to demonstrate how authors distribute information differently, and in ways that enable their detection using an off-the-shelf LM without any fine-tuning. We find that GPT-who can distinguish texts generated by very sophisticated LLMs, even when the overlying text is indiscernible. ## 1 Introduction The recent ubiquity of Large Language Models (LLMs) has led to more assessments of their potential risks. These risks include its capability to generate misinformation Zellers et al. (2019); Uchendu et al. (2020), memorized content Carlini et al. (2021), plagiarized content Lee et al. (2023), toxic speech Narayanan Venkit et al. (2023); Deshpande et al. (2023), and hallucinated content Ji et al. (2023); Shevlane et al. (2023). To mitigate these issues, researchers have proposed automatic and human-based approaches to distinguish LLM-generated texts (i.e., machine-generated) from human-written texts Uchendu et al. (2022). Such automatic detectors leverage supervised and unsupervised learning approaches to achieve accurate detection of machine-generated texts. These techniques study 2 problems for automatically detecting machine-generated texts - _Turing Test_ (TT) which is the binary detection of human vs. machine Uchendu et al. (2021); and _Authorship Attribution_ (AA) which is the multi-class detection of human vs. several machines (e.g., GPT-3.5 vs. LLaMA vs. Falcon) Uchendu et al. (2020). The TT task is the most rigorously studied, with the majority of the detectors built only for binary classification Zellers et al. (2019); Mitchell et al. (2023); Pu et al. (2022). However, due to the non-trivial nature of attributing the authorship of more than 2 authors, the AA task has not been as rigorously studied. Currently, in this niche field of detecting machine-generated texts, statistical-based techniques are one of the promising approaches in that unlike supervised models, they are not data greedy and tend to be more robust to adversarial perturbations Uchendu et al. (2022). Additionally, the wide usage of LLMs suggests Figure 1: GPT-who leverages psycholinguistically motivated representations that capture authors’ information signatures distinctly, even when the corresponding text is indiscernible. that malicious users can use several LLMs to generate harmful content, confusing detectors trained on specific LLMs. Therefore, in the future, it will be imperative to build models for the AA tasks to determine which LLMs are more likely to be misused. This knowledge will be needed by policymakers when they inevitably institute laws to guard the usage of LLMs. To that end, we propose GPT-who, the first psycholinguistically-aware supervised domain-agnostic task-independent multi-class statistical-based detector, which calculates interpretable Uniform Information Density (UID) features from the statistical distribution of a piece of text and automatically learns the threshold (using Logistic Regression) between different authors. To showcase the detection capabilities of GPT-who, we use 4 large LLM benchmark datasets: TuringBench (Uchendu et al., 2021), GPABenchmark (Liu et al., 2023), ArguGPT (Liu et al., 2023), and Deepfake Text in-the-wild (Li et al., 2023). We find that GPT-who remarkably outperforms state-of-the-art statistical detectors and is at par with task and domain-specific fine-tuned LLMs for authorship attribution. This performative gain is consistent across benchmark datasets, types of LLMs, writing tasks, and domains. It is even more remarkable that this performative gain is accompanied by two essential factors: First, GPT-who is computationally inexpensive as it eliminates the need for any LLM fine-tuning. It utilizes a freely available off-the-shelf LM to compute token probabilities, followed by logistic regression using a small set of carefully crafted and theoretically motivated UID features. Second, GPT-who provides a means to interpret and understand its prediction behaviors due to the rich feature space it learns from. UID-based features enable observable distinctions in the surprisal patterns of texts, which help in understanding GPT-who's decision-making on authorship (Figure 1). We also analyze the UID distributions of different LLMs and human-generated texts across all datasets and find that humans distribute information more unevenly and diversely than models. In addition, UID features are reflective of differences in LLM architectures or families such that models that share architectures have similar UID distributions within but not outside their category. We find that UID-based features are a consistent predictor of authorship. Even when there aren't glaring differences between uniform and non-uniform text, the differences in UID distributions are easily detectable and a powerful predictor of authorship, since they successfully capture patterns that go beyond the lexical, semantic, or syntactic properties of text. Our work indicates that psycholinguistically-inspired tools can hold their ground in the age of LLMs and a simpler theoretically-motivated approach can outperform complex and expensive uninterpretable black-box approaches for machine text detection. ## 2 Background: Uniform Information Density Shannon's Information Theory states that information exchange is optimized when information travels across the (noisy) channel at a uniform rate i.e. the amount of information transmitted should remain uniform per unit close to the channel's information capacity (Shannon, 1948). For language Figure 2: GPT-who uses token probabilities of articles to extract UID-based features. A classifier then learns to map UID features to different authors, and identify the author of a new unseen article. production, this uniform rate of information content is the basis of the Uniform Information Density (UID) hypothesis that posits that humans prefer to spread information evenly, avoiding sharp and sudden peaks and troughs in the amount of information conveyed per linguistic unit. Formally, Shannon defines the information content of a word as being directly related to its probability in a given context. Less predictable words have more information and more predictable words have less information. For example, in the following sentence: _"I really enjoy listening to vinyl records"_, the last word _"records"_ is highly predictable from a semantic standpoint given the prior words such as "listening" and "vinyl". Thus, given its context, _"records"_ has high predictability, and thus less information content according to Information Theory. Information content or Surprisal is interpreted as a measure of surprise a word elicits in a given context. Going back to the aforementioned example, the word "records" has very little surprisal. Thus, it can be said that high probability is associated with low surprisal and vice-versa. Formally, Shannon's definition of information content or **Surprisal** of a component or unit (n) is given by the inverse logarithm of its probability (p(n)) i.e. \[Surprisal(n)=-log\:p(n) \tag{1}\] UID has been computationally studied by measuring the amount of information content per linguistic unit (sentence length/number of words) or by studying any sudden changes in surprisal at the onset of a word or sentential element. Frank and Jaeger's corpus-based study demonstrated that humans tend to use shorter elements for lower amounts of information and longer elements/sub-sequences for expressing higher amounts of information (Frank and Jaeger, 2008). Thus, in a way keeping the information rate close to uniform. Xu and Reitter (2018) extended upon this work and reported that UID is consistent at the inter and intra-sentential levels (Xu and Reitter, 2016, 2018). In another study of UID in language production, Jaeger and Levy (2007) found that speakers chose not to omit an optional function word at the onset of a less predictable phrase, but that they were more likely to omit the same word at the beginning of a more predictable phrase. Jaeger (2010) and Mahowald et al. (2013) consolidated previous findings that humans regulate their choices as per UID, actively distributing the information that needs to be conveyed evenly across the linguistic signal. Finally, (Tily and Piantadosi, 2009) studied the usage of 'less informative' expressions as a means of conveying meanings with higher predictability in a large scale web-experiment that directly assessed comprehenders' ease of predicting the referent in an unfolding utterance (Tily and Piantadosi, 2009) and did find that speakers tend to refer to highly predictable referents with short words. Thus, in language, humans try to spread information content or surprisal evenly and maintain UID through their lexical, syntactic, phonological, and semantic choices. ## 3 Related Work ### Large Language Models (LLMs) Since the advent of the Transformer Neural architecture (Vaswani et al., 2017), the field of Natural Language Generation (NLG) has experienced massive improvements (Zhao et al., 2023). In the NLG field, this Transformer network has led to the production of models, currently known as Large Language Models (LLMs) (Zhao et al., 2023). These LLMs - GPT-3.5, GPT-4 (OpenAI, 2023), LLaMA (Touvron et al., 2023), Falcon (Penedo et al., 2023), have the capacity to generate human-like-quality texts, which can be easily construed as human-written (Sadasivan et al., 2023; Chakraborty et al., 2023). However, before LLMs, we had Language Models (LMs), such as GPT-1 (Radford et al., 2018), GPT-2 (Radford et al., 2019), GPT-3 (Brown et al., 2020), GROVER (Zellers et al., 2019), PPLM (Dathathri et al., 2019), and FAIR-WMT (Ng et al., 2019; Chen et al., 2020), which do not have the same capabilities but are still able to generate high-quality texts (Uchendu et al., 2021). The capabilities of LLMs, the new-age LM include solving non-trivial NLP tasks, such as text classification, text labeling, and misinformation detection (Shevlane et al., 2023). However, while these LLMs abilities are remarkable, it, therefore, makes them susceptible to malicious use. These include the generation of toxic and harmful content, like misinformation and terrorism recruitment (Shevlane et al., 2023; Zellers et al., 2019; Uchendu et al., 2021). Due to such potential for misuse, we must develop techniques to distinguish human-written texts from LLM-generated ones to mitigate these risks. ### Machine-Generated Text Detection To mitigate this potential for misuse of LLMs, researchers have developed several types of automatic detectors (Uchendu et al., 2022; Jawahar et al., 2020; Guerrero and Alsmadi, 2022; Crothers et al., 2022). These techniques include supervised (Uchendu et al., 2021; Zellers et al., 2019; Uchendu et al., 2020; Zhong et al., 2020; Kushnareva et al., 2021; Liu et al., 2022) and unsupervised approaches (Gehrmann et al., 2019; Mitchell et al., 2023; Galle et al., 2021; He et al., 2023; Su et al., 2023). These supervised approaches tend to be stylometric-, deep learning- and ensemble-based models while most unsupervised approaches are statistical-based detectors (Uchendu et al., 2022). More recently, due to the increased ubiquity of LLMs, we need more interpretable, and less deep learning-based models. Deep learning models have been shown to be the most susceptible to adversarial perturbations than others (Pu et al., 2022). To that end, we propose the first supervised statistical-based technique, that calculates the UID of a given text and uses a classical machine learning model to automatically decide thresholds. ## 4 Our Proposal: GPT-who We propose a psycholinguistically-motivated statistical-based machine-generated text detector GPT-who that uses a **GPT**-based language model to predict **who** the author of an article is. GPT-who works by exploiting a densely information-rich feature space motivated by the UID principle. UID-based representations are sensitive to intricate "fluctuations" as well as "smoothness" in the text. Specifically, operationalizations of UID are aimed at capturing the evenness or smoothness of the distribution of surprisal per linguistic unit (tokens, words), as stated by the UID principle. For example, in Figure 4, we show sequences of tokens that correspond to the highest and lowest UID score spans within an article. Here, the differences between the two segments of texts might not be obvious at the linguistic level to a reader, but when mapped to their surprisal distributions, the two segments have noticeably distinct surprisal spreads as can be seen by the peaks and troughs i.e. variance of token surprisals along the y-axis about the mean (dotted line). Most approximations of this notion of "smoothness" of information spread and UID, thus, formulate it as the variance of surprisal or as a measure of the difference of surprisals between consecutive linguistic units (Jain et al., 2018; Meister et al., 2020; Wei et al., 2021; Venkatraman et al., 2023). In measuring the distribution of surprisal of tokens, UID-based features are able to capture and amplify subtle information distribution patterns that constitute distinct information profiles of authors. Using just an off-the-shelf language model to calculate UID-based features, GPT-who learns to predict authorship by means of a simple classifier using UID representations. In addition, as these features can be directly mapped to their linguistic token equivalents, GPT-who offers a more interpretable representation of its detection behavior, unlike current black-box statistical detectors, as illustrated in Figure 4. The use of a psycholinguistically motivated representation also enables us to better interpret the resulting representation space so as to understand what surprisal distributions are in Figure 3: Distribution of UID Scores of 20 authors from the TuringBench dataset grouped (dotted line) by architecture type. LMs that share architectures tend to distribute UID scores similarly. dicative of and commonly occur in human-written or machine-generated text and vice versa. GPTwho is one of the first text detectors that focus on informing a simple classifier with theoretically motivated and intuitive features, as it only requires a fixed-length UID-based representation of length 44 and learns to predict authorship based on just these features, without the need for the full text or any LM fine-tuning in the process (See GPT-who's complete pipeline in Figure 2). ### UID-based features We use the 3 most widely used measures of UID scores as defined in previous works (Jain et al., 2018; Meister et al., 2020; Wei et al., 2021; Venkatraman et al., 2023) as follows: We first obtain the conditional probability \(p\) of each token (\(y_{t}\)) in an article using a pre-trained LM (GPT2-XL). The surprisal (\(u\)) of a token \(y_{t}\) is, \[u(y_{t})=-\log(p(y|y<t)), \tag{2}\] for \(t\geq 1\) where \(y_{0}=<BOS>\), and \(t\) = time step. The lower the probability of a token, the higher its surprisal and vice-versa. Thus, surprisal indicates how unexpected a token is in a given context. 1. **Mean Surprisal (\(\mu\))** of an article (\(y\)) defined as follow: \[\mu(y)=\frac{1}{|y|}\sum_{t}(u(y_{t}))\] (3) 2. **UID (\(Variance\))** score or **global** UID score of an article (\(y\)) is calculated as the normalized variance of the surprisal: \[\mathrm{UID}(y)=\frac{1}{|y|}\sum_{t}(u(y_{t})-\mu)^{2}\] (4) From this formulation, a perfectly uniform article would have the same surprisal at every token and hence \(0\) UID (variance) score. 3. **UID (\(Difference\))** score or **local** UID score of an article (\(y\)) is calculated as the average of the difference in surprisals of every two consecutive tokens \(\mu(y_{t-1})\) and \(\mu(y_{t})\) : \[\mathrm{UID}(y)=\frac{1}{N-1}\sum_{n=2}^{N}\lvert\mu\left(y_{t} \right)-\mu\left(y_{t-1}\right)\rvert\] (5) 4. **UID (\(Difference^{2}\))** score is defined as the average of the squared difference in surprisals of every two consecutive tokens \(\mu(y_{t-1})\) and \(\mu(y_{t})\) : \[\mathrm{UID}(y)=\frac{1}{N-1}\sum_{n=2}^{N}(\mu\left(y_{t}\right)- \mu\left(y_{t-1}\right))^{2}\] (6) From this formulation, both local measures of UID capture any sudden bursts of unevenness in how information is dispersed in consecutive tokens of the articles. 5. **Maximum and minimum UID spans** In addition to previously used approximations of UID, we also craft a new set of features using the most and least uniform segments of an article. Our intuition for this feature is to focus on the extremities of the UID distribution in an article, as the most and least uniform spans would be the most expressive and distinct sequences from a UID perspective. All other spans or segments in an article necessarily lie in between these two extremities. Thus taking account of these two spans would ensure coverage of the whole range of Figure 4: An example of UID span feature extraction that selects the most uniform and non-uniform segments from the token surprisal sequence. As can be seen in this example, two texts that read well can have very different underlying information density distributions in a given context. UID features capture these hidden statistical distinctions that are not apparent in their textual form. surprisal fluctuations within an article. Thus, for each article, we calculate UID (variance) scores for all spans of consecutive tokens of a fixed length using a sliding window approach. We tuned this window size and found that a window size of \(20\) tokens per span sufficiently represented an article's UID range. We also experimented with randomly drawn and re-ordered spans and found that random features did not contribute to task performance. We use the surprisal values corresponding to the highest and lowest UID scoring span as additional features and obtain fixed length UID features of length 44 for each article (see Figure 2). ## 5 Empirical Validation We use Meister et al. (2021)'s implementation of UID-based scores1 and use the publicly available off-the-shelf pre-trained GPT-XL language model2 to obtain conditional probabilities. For all our experiments, we calculate the UID features for the publically released train and test splits of all datasets. We train a logistic regression model 3 using these features on the train splits and report performance on the test splits. We replicate all the original evaluation settings and metrics for each of the datasets (except one setting from the ArguGPT Liu et al. (2023) dataset that required access to unreleased human evaluation data). We do this to be able to directly compare the performance of GPT-who with current state-of-the-art detection methods reported so far. Footnote 1: [https://github.com/rycolab/revisiting-uid/tree/main](https://github.com/rycolab/revisiting-uid/tree/main) Footnote 2: [https://huggingface.com/gpt2-xl](https://huggingface.com/gpt2-xl) Footnote 3: [https://scikit-learn.org/stable/](https://scikit-learn.org/stable/) ### Datasets To test the applicability of GPT-who across text detection tasks, we run all experiments across 4 large-scale and very recent datasets that span over 15 domains and 35 recent LMs. **TuringBench Benchmark Uchendu et al. (2021)** dataset is the largest multi-class authorship attribution dataset that contains over 168k news articles generated by 19 neural text generators using 10K prompts from CNN and the Washington Post. **GPABenchmark Liu et al. (2023)** or GPT Corpus for Academia is a multi-domain (Computer Science (CS), Humanities and Social Sciences (HSS) and Physics (PHX)) academic articles dataset aimed at helping detection of LLM use or misuse in academic writing. It contains 150k human and 450k ChatGPT-generated articles for 3 task settings (completion, writing, and polishing). **ArguGPT Liu et al. (2023)** is a prompt-balanced dataset of argumentative essays containing over 4k human-written essays and 4k articles generated by 7 recent LLMs (including many variants of ChatGPT) using prompts from English Figure 5: UID score distributions of human (h) and model (m) generated texts across 10 domains (indicated by word following either (m_) or (h_) along the x-axis) from Li et al. (2023). Across tasks, humans have a higher mean and wider spread of UID scores than machine-generated text. datasets such as TOEFL11 (Blanchard et al., 2013) and WECCL (Wen et al., 2005) datasets. Deepfake Text Detection in the Wild (Li et al., 2023)dataset is, to our knowledge, the largest text detection dataset consisting of over 447k human-written and machine-generated texts from 10 tasks such as story generation, news article writing, and academic writing. They use 27 recent LLMs such as GPT-3.5, FLAN-T5, and LLaMA. ### UID Signatures of Authors Our UID-based features are formulated to capture how surprisal is distributed in an article as they measure the local, and global variance, mean, and most uniform and non-uniform segments of a text. Given that humans tend to optimize UID, we study if different models spread surprisal in ways that are distinguishable from each other and human-written text and if we can observe unique UID signatures of different LM families. To this end, we plot the UID score distributions of different text generators across tasks, domains, and datasets (see Figures 3, 5, 7, 9, and 6). We observe that, generally, the UID scores of human-written text have a higher mean and larger standard deviation than most machine-written text across writing task types, domains, and datasets. This implies that human-written text tends to be more non-uniform and diverse in comparison to machine-generated text. In other words, we see that human-generated articles tend to have higher variance in surprisals (since all plots are generated using the UID (variance) score). Hence, machines seem to be spreading information more evenly or smoothly than humans who are more likely to have fluctuations in their surprisal distributions. Going a step further, if we compare models to other models, we see that models that belong to the same LM family by architecture tend to follow similar UID distributions. For example, in Figure 5, the dotted lines separate LMs by their architecture type and it can be seen, for example, that all GPT-2 based models have similar UID distributions, all Grover-based models have similarities, but these groups are distinct from each other. This indicates that UID-based features are able to capture differences in text generated by not only humans and models but also one step further to capture differences between individual and multiple models and LLM families. To our knowledge, this is the first and the largest UID-based analysis of recent machine and human-generated text across writing tasks and domains. Our analysis indicates that UID-based measures are a strong indicator of authors' UID signatures. ## 6 Results and Discussion Overall, across datasets and tasks, we see that GPT-who performs better than other statistical-based detectors and at par with transformers-based fine-tuned methods. In Table 2, for the **Turing-Bench** dataset, GPT-who significantly outperforms GLTR by **0.32 F1** points, and performs better than BERT fine-tuned for the task. **Deepfake Text Detection in the Wild** dataset contains 6 testbeds with varying levels of detection difficulties, such as out-of-domain, out-of-distribution, and unseen-task test sets. We used all 6 testbeds to analyze the performance of GPT-who in detecting machine-generated texts across increasing levels of 'wildness' and find that GPT-who outperforms both GLTR and DetectGPT for 5 out of the 6 testbeds. More importantly, GPT-who performs tremendously even for the most challenging \begin{table} \begin{tabular}{l l c c c c c c c c} \hline \hline \multirow{3}{*}{Task Type} & \multicolumn{3}{c}{**GPTZero***} & \multicolumn{2}{c}{**ZeroGPT***} & \multicolumn{2}{c}{**OpenAI’s Detector***} & \multicolumn{2}{c}{**GPT-who**} \\ \cline{3-10} & Domain & GPT & Human & GPT & Human & GPT & Human & GPT & Human \\ \hline \multirow{3}{*}{Task 1} & CS & 30.3 & 99.3 & 67.4 & **100** & 80.7 & 51 & **99** & 99 \\ & PHX & 25.3 & **99.7** & 68.4 & 98.4 & 70 & 69.7 & **90** & 98 \\ & HSS & 72 & **100** & 92.3 & 95 & 63 & 84 & **98** & 97 \\ \hline \multirow{3}{*}{Task 2} & CS & 17 & **99.7** & 25.3 & **99.7** & 63.7 & 35.3 & **84** & 82 \\ & PHX & 6 & **99.7** & 10 & **99.7** & 23.7 & 59.7 & **90** & 90 \\ & HSS & 43.7 & 94.3 & 62.4 & **94.7** & 27.3 & 79.6 & **80** & 80 \\ \hline \multirow{3}{*}{Task 3} & CS & 1.7 & **99.7** & 3.3 & 98.3 & 6.3 & 50.7 & **63** & 62 \\ & PHX & 2.3 & 95.7 & 2.7 & **98.6** & 4.3 & 69 & **75** & 74 \\ \cline{1-1} & HSS & 20.3 & **95.7** & 24.7 & 92.7 & 6 & 88 & **62** & 60 \\ \hline AVG & & 24.28 & **98.2** & 39.61 & 97.45 & 38.33 & 65.22 & **83.22** & 82.44 \\ \hline \hline \end{tabular} \end{table} Table 1: Test Set Performance (% Accuracy) on the GPA Benchmark.* denote results reported in Liu et al. (2023). GPT-who outperforms all other detectors in identifying machine-generated texts across task types and domains. or 'wildest' testbed settings of unseen model and unseen domain distributions (see Table 3). For the **ArguGPT** dataset (Table 4), we find that GPT-who outperforms human experts in predicting authorship by **0.31 F1** points, but is outperformed by fine-tuned RoBERTa. We were unable to replicate other evaluation settings for this dataset as the human-generated texts from this dataset were not publicly released. Finally, for the **GPABenchmark** dataset, we see that across all 3 task types and the 3 domains, GPT-who outperforms GPTZero, ZeroGPT, and OpenAI's detector by over **40%** accuracy (Table 1). For human-generated texts, ZeroGPT and OpenAI's detector has **16%** greater accuracy than GPT-who. However, it should be noted that the machine-generated texts for this task are from 7 very recent and highly sophisticated LLMs, making the detection of machine-generated text a much more challenging task on which GPT-who outperforms other detectors exceedingly. ## 7 Conclusion We propose GPT-who, a psycholinguistically-aware domain-agnostic multi-class statistical-based machine-generated text detector. GPT-who outperforms state-of-the-art statistical approaches across 3 large-scale benchmark datasets that include texts from over 35 LLMs across more than 10 domains. In addition to its performative advantage, our method is computationally inexpensive, without the need for any LLM fine-tuning. Our feature space also enables the observation and interpretation of our model's decision-making. We turn to the UID principle, which states that humans prefer to spread information evenly in language, to automatically extract features that measure the spread and flow of information content or surprisal in texts. The resulting UID-based features drive the predictive capability of GPT-who and the interpretability of its representations. Our findings indicate that approaches rooted in psycholinguistic theories that delineate indicators of "human-like" language use hold enormous and untapped potential in tackling the fast catapulting and ever-changing LLM landscape. Our work has implications for cognitively plausible and explainable solutions to complex challenges arising from ever-growing automated text generators. \begin{table} \begin{tabular}{l c c c} \hline \hline **Author** & **Experts*** & **RoBERTa*** & **GPT-who** \\ \hline text-babbage-001 & 0.46 & **0.99** & 0.84 \\ text-curie-001 & 0.46 & **0.99** & 0.83 \\ text-davinci-003 & 0.66 & **0.99** & 0.77 \\ gpt-3.5-turbo & 0.62 & **1.0** & 0.84 \\ gpt2-xl & 0.37 & **0.99** & 0.90 \\ \hline **AVG** & 0.51 & **0.99** & 0.84 \\ \hline \hline \end{tabular} \end{table} Table 4: Test Set Performance (F1 score) for ArguGPT dataset. * denote results reported in Liu et al. (2023). Although unable to perform as well as fine-tuned RoBERTa, GPT-who outperforms human experts in identifying authorship of argumentative essays. \begin{table} \begin{tabular}{l c c c} \hline \hline **Human vs.** & **GLTR*** & **BERT*** & **GPT-who** \\ \hline GPT-1 & 0.47 & 0.95 & **0.99** \\ GPT-2\_small & 0.50 & 0.75 & **0.88** \\ GPT-2\_medium & 0.48 & 0.64 & **0.87** \\ GPT-2\_large & 0.45 & 0.72 & **0.87** \\ GPT-2\_xl & 0.45 & 0.78 & **0.88** \\ GPT-2\_PyTorch & 0.71 & **0.98** & 0.85 \\ GPT-3 & 0.34 & 0.79 & **0.83** \\ GROVER\_base & 0.38 & **0.98** & 0.80 \\ GROVER\_large & 0.40 & **0.98** & 0.75 \\ GROVER\_mega & 0.42 & **0.96** & 0.72 \\ CTRL & 0.87 & **0.99** & **0.99** \\ XLM & 0.89 & **0.99** & **0.99** \\ XLNET\_base & 0.75 & **0.99** & 0.97 \\ XLNET\_large & 0.87 & **0.99** & **0.99** \\ FAIR\_wmt19 & 0.56 & **0.93** & 0.73 \\ Fair\_wmt20 & 0.49 & 0.47 & **0.99** \\ TRANSF\_XL & 0.35 & **0.97** & 0.78 \\ PPLM\_distil & 0.64 & 0.88 & **0.94** \\ PPLM\_gpt2 & 0.68 & 0.88 & **0.89** \\ \hline AVG & 0.56 & 0.87 & **0.88** \\ \hline \hline \end{tabular} \end{table} Table 2: Test Set Performance (F1 score) for TuringBench dataset. * denote results reported in Uchendu et al. (2021). Overall, GPT-who outperforms both statistical and supervised detectors. \begin{table} \begin{tabular}{l c c c} \hline \hline **Author** & **Experts*** & **RoBERTa*** & **GPT-who** \\ \hline text-babbage-001 & 0.46 & **0.99** & 0.84 \\ text-curie-001 & 0.46 & **0.99** & 0.83 \\ text-davinci-003 & 0.66 & **0.99** & 0.77 \\ gpt-3.5-turbo & 0.62 & **1.0** & 0.84 \\ gpt2-xl & 0.37 & **0.99** & 0.90 \\ \hline **AVG** & 0.51 & **0.99** & 0.84 \\ \hline \hline \end{tabular} \end{table} Table 4: Test Set Performance (F1 score) for ArguGPT dataset. * denote results reported in Liu et al. (2023). Although unable to perform as well as fine-tuned RoBERTa, GPT-who outperforms human experts in identifying authorship of argumentative essays. ## Limitations Despite our attempt at a comprehensive analysis of texts generated by recent large language models, we were limited by resources and the limitations of publicly available datasets to include a more diverse set of models and tasks such as summarization, question answering, and so on. We also do not study if UID-based methods go beyond machine-generated text detection to identify harmful phenomena such as misinformation and plagiarism. We acknowledge the same as part of future efforts.

2310.19322

Progressive Neural Network for Multi-Horizon Time Series Forecasting

In this paper, we introduce ProNet, an novel deep learning approach designed for multi-horizon time series forecasting, adaptively blending autoregressive (AR) and non-autoregressive (NAR) strategies. Our method involves dividing the forecasting horizon into segments, predicting the most crucial steps in each segment non-autoregressively, and the remaining steps autoregressively. The segmentation process relies on latent variables, which effectively capture the significance of individual time steps through variational inference. In comparison to AR models, ProNet showcases remarkable advantages, requiring fewer AR iterations, resulting in faster prediction speed, and mitigating error accumulation. On the other hand, when compared to NAR models, ProNet takes into account the interdependency of predictions in the output space, leading to improved forecasting accuracy. Our comprehensive evaluation, encompassing four large datasets, and an ablation study, demonstrate the effectiveness of ProNet, highlighting its superior performance in terms of accuracy and prediction speed, outperforming state-of-the-art AR and NAR forecasting models.

Yang Lin

2023-10-30T07:46:40Z

http://arxiv.org/abs/2310.19322v2

# ProNet: Progressive Neural Network for Multi-Horizon Time Series Forecasting ###### Abstract In this paper, we introduce ProNet, an novel deep learning approach designed for multi-horizon time series forecasting, adaptively blending autoregressive (AR) and non-autoregressive (NAR) strategies. Our method involves dividing the forecasting horizon into segments, predicting the most crucial steps in each segment non-autoregressively, and the remaining steps autoregressively. The segmentation process relies on latent variables, which effectively capture the significance of individual time steps through variational inference. In comparison to AR models, ProNet showcases remarkable advantages, requiring fewer AR iterations, resulting in faster prediction speed, and mitigating error accumulation. On the other hand, when compared to NAR models, ProNet takes into account the interdependency of predictions in the output space, leading to improved forecasting accuracy. Our comprehensive evaluation, encompassing four large datasets, and an ablation study, demonstrate the effectiveness of ProNet, highlighting its superior performance in terms of accuracy and prediction speed, outperforming state-of-the-art AR and NAR forecasting models. time series forecasting; deep learning; Transformer; variational inference ## Introduction Time series forecasting has a wide range of applications in industrial domain for decades, including predicting electricity load, renewable energy generation, stock prices and traffic flow, air quality [1] etc. Many methods have been developed for this task that can be classified into two broad categories. In the early years, statistical models such as Auto-regressive Integrated Moving Average (ARIMA) and State Space Models (SSM) [2] were widely used by industry forecasters. However, they fit each time series independently and are not able to infer shared patterns from related time series [3]. On the other hand, machine learning methods have been developed for modelling the non-linearity from time series data. Preliminary methods are random forest [4], Support Vector Machine (SVM) [5] and Bayesian methods [6]. Moreover, recent research has widely acknowledged the effectiveness of time series decomposition and ensemble learning methods in refining forecasting models [7, 8, 6, 9]. Ensemble learning methods have gained recognition for their ability to combine individual models and enhance overall predictive performance while minimizing overfitting. Du et al. [6] develop the ensemble strategy that takes advantage of high diversification statistical, machine learning and deep learning methods, and assigns time-varying weights for model candidates with bayesian optimization, to avoid the shortage of model choice and alleviates the risk of overfitting. Similarly, Gao et al. [10] introduced an online dynamic ensemble of deep random vector functional link with three stages for improved performance. Decomposition-based methods have also shown promise in time series forecasting by breaking down the data into underlying components, leading to more accurate and manageable predictions. Different decomposition approaches, such as classical decomposition, moving averages, and state space model have been explored. For instance, Li et al. [11] proposed a convolutional neural network ensemble method that leverages decomposed time series and batch normalization layers to reduce subject variability. Wang et al. [12] proposed a fuzzy cognitive map to produce interpretable results by forecasting the decompositional components: trend, fluctuation range, and trend persistence. Lin et al. [13] developed SSDNet, employing Transformer architecture to estimate state space model parameters and provide time series decomposition components: trend and seasonality. Tong et al. [14, 15] introduced Probabilistic Decomposition Transformer with hierarchical mechanisms to mitigate cumulative errors and a conditional generative approach for time series decomposition. Furthermore, Wang et al. [9] introduced the ternary interval decomposition ensemble learning method, addressing limitations of point and interval forecasting models. The amalgamation of machine learning models, time series decomposition, and ensemble learning has demonstrated great promise as a potent solution for advancing forecasting performance. Notably, the philosophy of decomposition and ensemble can seamlessly integrate with major machine learning models, further enhancing their effectiveness in various applications. Recently, a sub-class of machine learning methods - deep learning, has been widely studied for forecasting tasks due to their strong ability of modelling complex and related dependencies from large-scaled time series. Existing deep learning methods can be divided into AutoRegressive (AR) and Non-AutoRegressive (NAR) models on the perspective of how they make the multi-step forecasts. Notable examples of AR models include DeepAR [16], DeepSSM [17], DeepFactor [18], DAt-tAE [19], LogSparse Transformer [3], visibility graph model [20], RDNM-ANN [21] and TimeGrad [22]. NAR - MQ-RNN [23], N-BEATS [24], AST [25] and Informer [26] are the prominent NAR methods. AR forecasting models have the problem of slow inference speed and error accumulation due to the use of a recursive method that use previously predicted values to make future forecasts. AR models are usually trained with the teacher-forcing mechanism and consider ground truth as previous predictions to feed into the model during training. This causes a discrepancy between training and prediction, and could cause unsatisfied accuracy for long forecasting horizons [27, 25]. In contrast, NAR forecasting models overcome the aforementioned problems since they generate all predictions within forecasting horizon simultaneously. However, NAR model ignores interdependencies in output space and such assumption violates real data distribution for sequence generation tasks [28, 29]. This may result in unrelated forecasts over the prediction horizon and accuracy degradation [30, 25]. Empirically, AR methods were found to be better for shorter horizons but outperformed by NAR for longer horizons due to error accumulation [30]. Thus, both AR and NAR models have their own complementary strengths and limitations for multi-horizon forecasting which stem from their prediction strategy. Recently NAR models have been proposed specific for translation tasks that can alleviate the accuracy degradation by performing dependency reduction in output space and reduce the difficulty of training [28, 31, 32, 29]. However, such studies are scarce for time series forecasting tasks. A balance must be struck between AR and NAR forecasting models to tackle the challenges of error accumulation and low latency in AR models, alongside the NAR models' inability to adequately capture interdependencies within the output space. Recent strides in this domain have illuminated the advantages of incorporating dependency and positional information within the prediction horizon. These breakthroughs have exhibited their efficacy across a spectrum of sequence modeling tasks. For instance, Ran et al. [33] have ingeniously integrated future predictions to overcome the multi-modality predicament in neural machine translation. In a parallel vein, Fei [34] and Zhou et al. [35] have skillfully amalgamated information from future time steps to generate past predictions, exemplified in the context of caption generation. Furthermore, Han et al. [36] have introduced a diffusion-based language model with bidirectional context updates, adding a notable dimension to the evolving landscape of research in this field. To address these challenges and capitalize on the strengths of both AR and NAR modeling, we introduce Progressive Neural Network (ProNet), a novel deep learning approach designed for time series forecasting. ProNet strategically navigates the AR-NAR trade-off, leveraging their respective strengths to mitigate error accumulation and slow prediction while effectively modeling dependencies within the target sequence. Specifically, ProNet adopts a partially AR prediction strategy by segmenting the forecasting horizon. It predicts a subset of steps within each segment using a non-autoregressive approach, while maintaining an autoregressive decoding process for the remaining steps. Fig. 1 illustrates the different prediction mechanism of AR, ProNet's partially AR, and NAR decoding mechanisms. For example, when the AR decoder considers step \(t+4\) dependent on steps from \(t\) to \(t+3\), the NAR decoder assumes no dependency. In contrast, ProNet's partially AR decoder takes into account dependencies from past steps \(t\), \(t+1\), \(t+3\), as well as future step \(t+5\). The initiation of horizon segments is determined by latent variables, optimizing their training through variational inference to capture the significance of each step. Consequently, in comparison to AR models, ProNet's predictions require fewer iterations, enabling it to overcome error accumulation while achieving faster testing speeds. Moreover, compared to NAR models, ProNet excels in capturing dependencies within the target space. The main contributions of our work are as follows: 1. We propose ProNet, a partially AR time series forecasting approach that generates predictions of multiple steps in parallel to leverage the strength of AR and NAR models. Our ProNet assumes an alternative dependency in target space and incorporates information of further future to generate forecasts. 2. We evaluate the performance of ProNet on four time series forecasting tasks and show the advantages of our model against most state-of-the-art AR and NAR methods with fast and accurate forecasts. An ablation study confirmed the effectiveness of the proposed horizon dividing strategy. ## Related Work Recent advancements in forecasting methodologies have led to the emergence of NAR forecasting models [23, 24, 25, 26]. These models seek to address the limitations of AR models by eschewing the use of previously generated predictions and instead making all forecasts in a single step. Fig. 1: Illustration of AR, ProNet partially AR and NAR decoding process: 1) AR decoder forecasts with covariates and all previous predictions; 2) NAR decoder forecasts all steps with covariates only in parallel; 3) our partially AR decoder divides horizon into segments (indicated by red dash lines), individual each segment is predicted autoregressively with covariates and previous predictions of all segments, while each prediction of segments can be made simultaneously. However, the effectiveness of NAR forecasting models is hindered by their assumption of non-interdependency within the target space. This assumption arises from the removal of AR connections from the decoder side, leading to the estimation of separate conditional distributions for each prediction independently [28, 31, 32, 29]. While both AR and NAR models have proven successful in forecasting applications, AR methods tend to excel for shorter horizons, while NAR methods outperform AR for longer horizons due to error accumulation [30]. Unlike AR models, NAR models offer the advantage of parallelizable training and inference processes. However, their output may present challenges due to the potential generation of unrelated forecasts across the forecast horizon. This phenomenon could lead to discontinuous and unrealistic forecasts [30], as the incorrect assumption of independence prevents NAR models from effectively capturing interdependencies between each prediction. Serval research [28, 31, 32, 29] have been made to enhance NAR models, although most of these efforts have been focused on Neural Machine Translation (NMT) tasks. Gu et al. [28] introduced the NAR Transformer model, which reduces output dependencies by incorporating fertilities and leveraging sequence-level knowledge distillation techniques [37, 38]. Recent developments have seen the adaptation of NAR models for translation tasks, mitigating accuracy degradation by tackling output space dependencies. This approach aims to capture and manage dependencies, thereby alleviating training challenges [28, 31, 32]. Notably, knowledge distillation [37, 38] emerges as a highly effective technique to enhance NAR model performance. The trade-off between AR and NAR [39, 33, 34, 35] has been a subject of exploration, particularly in the context of NMT and other sentence generation tasks. Notable instances include the works of [39, 35], which retain AR properties while enabling parallel prediction of multiple successive words. Similarly, [33, 34] employ a strategy that generates translation segments concurrently, each being generated autoregressively. However, prior approaches have relied on dividing the target sequence into evenly distributed segments, assuming fixed dependencies among time steps. This assumption, while applicable in some contexts, proves unsuitable for time series forecasting due to the dynamic and evolving nature of real-world time series data. For instance, in Fig. 2, we visualize the partial correlation of two distinct days (comprising 20 steps each) from the Sanyo dataset. Evidently, the two plots exhibit varying dependency patterns, signifying that the most influential time steps differ between the two cases. Additionally, it becomes apparent that future steps can exert substantial influence on preceding steps. Take Fig. 2 (a) as an example, where step 5 exhibits strong partial correlation with steps 17 and 18. This correlation suggests that incorporating information from steps 17 and 18 while predicting step 5 could be highly beneficial. In this work, we present ProNet that navigates the intricate balance between AR and NAR models. We extend previous work with several key enhancements: 1) assuming a non-fixed dependency pattern and identifying the time steps that need to be predicted first via latent factors and then predict further groups of steps autoregressively; 2) assuming the alternative time-varying dependency and incorporating future information into forecasting; 3) introducing the sophisticated-designed masking mechanism to train the model non-autoregressively. ## Problem Formulation Given is: 1) a set of \(N\) univariate time series (solar or electricity series) \(\left\{\mathbf{Y}_{i,1:T_{l}}\right\}_{i=1}^{N}\), where \(\mathbf{Y}_{i,1:T_{l}}:=[y_{i,1},y_{i,2},...,y_{i,T_{l}}]\), \(T_{l}\) is input sequence length, and \(y_{i,t}\in\Re\) is value of the \(i\)th time series at time \(t\); 2) a set of associated time-based multi-dimensional covariate vectors \(\left\{\mathbf{X}_{i,1:T_{l}+T_{l}}\right\}_{i=1}^{N}\), where \(T_{h}\) is forecasting horizon length and \(T_{l}+T_{h}=T\). Our goal is to predict the future values of the time series \(\left\{\mathbf{Y}_{i,T_{l}+1:T_{l}+T_{h}}\right\}_{i=1}^{N}\), i.e. the PV power or electricity usage for the next \(T_{h}\) time steps after \(T_{l}\). AR forecasting models produce the conditional probability of the future values: \[p\left(\mathbf{Y}_{i,T_{l}+1:T_{l}+T_{h}}\mid\mathbf{Y}_{i,1:T_{l}}, \mathbf{X}_{i,1:T_{l}+T_{h}};\theta\right) \tag{1}\] \[= \prod_{t=T_{l}+1}^{T_{l}+T_{h}}p\left(y_{i,t}\mid\mathbf{Y}_{i,1 :t-1},\mathbf{X}_{i,1:t};\theta\right),\] where the input of model at step \(t\) is the concatenation of \(y_{i,t-1}\) and \(x_{i,t}\) and \(\theta\) denotes the model parameters. For NAR forecasting models, the conditional probability can be modelled as: \[p\left(\mathbf{Y}_{i,T_{l}+1:T}\mid\mathbf{Y}_{i,1:T_{l}}, \mathbf{X}_{i,1:T};\theta\right) \tag{2}\] \[= \prod_{t=T_{l}+1}^{T}p\left(y_{i,t}\mid\mathbf{Y}_{i,1:T_{l}}, \mathbf{X}_{i,1:T};\theta\right)\] Table I presents a comparison of available information for predicting step \(t+1\) using AR and NAR forecasting methods. Both AR and NAR methods have access to covariates and ground truth from the past. However, there is a distinction in the scope of information they can utilize. The AR method can only make use of covariates and ground truth up to time step Fig. 2: Partial correlation of Sanyo set for two different days (20 time steps for each day). \(t\), whereas NAR methods can utilize all covariates within the forecasting horizon but do not have access to ground truth. Specifically, ProNet produces the conditional probability distribution of the future values, given the past history: \(p\left(\mathbf{Y}_{i,T_{t}+1:T}\mid\mathbf{Y}_{i,1:T_{1}},\mathbf{X}_{i,1:T}; \theta\right)\), where the input of model at step \(t\) is the concatenation of \(y_{i,t-1}\) and \(x_{i,t}\) and \(\theta\) denotes the model parameters. The models are applicable to all time series, so the subscript \(i\) will be omitted in the rest of the paper for simplicity. ## Progressive Neural Network In this section, we first present the architecture of ProNet and then explain its details in four sections: 1) _partially AR forecasting mechanism_ to overcome the limitations of AR and NAR decoders, 2) _progressive forecasting_ to correct inaccurate predictions made at early stages, 3) _progressive mask_ that implements the previous two mechanisms for Transformer model and 4) _variational inference_ to generate the latent variables with dependency information to serve the partially AR forecasting mechanism. ### Architecture Figure. 3 illustrates the architecture of ProNet, a partially AR time series forecasting model by using latent variables to model the uncertainty in target space. ProNet comprises four core components: an encoder, a forecasting decoder, a prior model denoted as \(p_{\theta}(z\mid x)\), and a posterior model denoted as \(q_{\phi}(z\mid y,x)\). During each training iteration, the feedforward process unfolds through four stages: 1. Encoder for Pattern Extraction: The encoder analyzes patterns from preceding time steps, contributing valuable insights to all decoders. 2. Significance Assessment by Posterior Model: The posterior model \(q_{\phi}(z\mid y,x)\) integrates both ground truth and covariates, effectively discerning the significance of time steps within the forecasting horizon. This assessment identifies pivotal steps, subsequently used to segment the forecasting horizon. 3. Significance Assessment by Prior Model: A separate prior model \(p_{\theta}(z\mid x)\) employs covariates to predict the importance of time steps within the horizon. The outputs of this prior model are meticulously calibrated to closely approximate the posterior model's outcomes. 4. Decoding and Forecast Generation: The decoder \(p(y\mid x,z)\) employs the ground truth, covariates, and the output of the posterior model \(q_{\phi}(z\mid y,x)\) to segment the forecasting horizon into distinct segments for accurate forecast generation. During the inference phase, the posterior model is omitted, and the prior model seamlessly takes on its role, facilitating accurate predictions. Notably, in the absence of ground truth during prediction, the decoder employs past predictions to generate forecasts. As the architectural backbone of ProNet, we adopt the Informer architecture [26]; however, it is pertinent to highlight that alternative Transformer-based architectures can be seamlessly integrated into the ProNet framework. Impressively, ProNet's efficacy remains pronounced when employing a vanilla Transformer as its architectural backbone. In summary, the prior and posterior models are trained employing a _variational inference_ approach, facilitating the identification of pivotal steps for the decoder's operation. This decoder employs _progressive masks_, thereby engendering the realization of _partially and progressive forecasting_ strategies. The intricate implementation intricacies of these components are elaborated upon in the subsequent sections. ### Partial Autoregressive Forecasting Our ProNet makes predictions by combining AR and NAR decoding mechanisms together. To facilitate efficient predictions, we introduce a multi-step prediction strategy organized into segments. Specifically, we divide the forecasting horizon into \(n_{g}\) segments and make predictions for the starting positions of each segment, denoted by \(S_{1}=[s_{1},s_{2},...,s_{n_{g}}]\). Subsequently, we employ an autoregressive approach to forecast the subsequent steps of each segment, specifically \(S_{2}=[s_{1}+1,s_{2}+1,...,s_{n_{g}}+1]\), in parallel. This process continues iteratively until all forecasted steps within the horizon are generated. Notably, the initial position of the first segment is set to the first step (\(s_{1}=1\)). The length of each segment is determined as the difference between the starting positions of two consecutive segments, denoted as \(T_{i}=s_{i+1}-s_{i}\) where \(s_{n_{g}+1}=T_{h}\). In line with NAR forecasting models, we set the initial input of the decoder (\(y\)) for the first predictions as 0, since prior predictions have not yet been established. In order to predict all steps within the horizon, ProNet employs AR predictions a maximum of \(n_{step}=\max(T_{i:n_{g}})\) times, where \(n_{step}\) represents the maximum segment length. This approach ensures accurate forecasts by iteratively refining predictions while considering relevant historical context. Unlike traditional AR and NAR models, our method introduces a unique probability distribution formulation: Fig. 3: Structure of the four components in ProNet: encoder, decoder, prior model \(p_{\theta}\) and posterior model \(q_{\phi}\). \[p\left(\mathbf{Y}_{i,T+1:T}\mid\mathbf{Y}_{i,1:T_{l}},\mathbf{X}_{i,1:T}\right)\] \[= \prod_{t=1}^{T_{g_{t}}}\prod_{j=1}^{n_{g}}p\left(y_{i,t}^{j}\mid \mathbf{Y}_{i,1:T_{l}},\mathbf{X}_{i,1:T_{l}},\right.\] \[\left.\mathbf{Y}_{i,T+1:T+1}^{1},\mathbf{X}_{i,T+1:T_{l}+t}^{1},...\ \mathbf{Y}_{i,T+1:T_{l}+t}^{n_{g}},\mathbf{X}_{i,T+1:T_{l}+t}^{n_{g}}\right), \tag{3}\] where \(y_{i,t}^{j}\) is prediction at \(t\)th step of the \(j\)th segment and \(\mathbf{Y}_{i,T+1:T_{l}+t}^{j}\) denotes the prediction history up to step \(t\) of the \(j\)th segment. ### Progressive Prediction In ProNet, the forecasting horizon is divided into segments of varying lengths. However, the number of AR steps is determined by the maximum segment length, leading to situations where certain segments complete their predictions before the AR iteration concludes. To capitalize on the additional dependency information available, completed segments are tasked with re-forecasting steps within their subsequent segments that have already been predicted. This progressive prediction strategy acknowledges that early steps in each segment may involve limited or no dependency information and therefore benefit from iterative refinement as more context becomes available. ### Progressive Mask The architecture of the AR Transformer decoder [40] employs a lower triangular attention mask to prevent future information leakage. Conversely, NAR Transformer decoders (e.g., Informer [26]) use unmasked attention. However, these standard masking mechanisms are inadequate for ProNet, as it operates with a partially autoregressive framework that integrates future information for predictions. In response, we introduce a progressive masking mechanism to facilitate access to the first \(t\) steps of all segments during the \(t\)-th step prediction. Given the sample size \(N\), forecasting horizon length \(T_{h}\) and segment size \(n_{g}\), the progressive mask \(M\) is created by Algorithm 1. Initially, we take the top \(n_{g}\) indexes of latent variable \(z\) that encodes the importance of steps for forecasting and stores them as \(ind\), which is also the starting position \(S_{1}\). Then we set the elements of zero vector \(row\) located at \(ind\) as one. We iterate from 1 to the maximum AR step \(n_{s}tep\) to create the mask \(M\): firstly, we set the rows of mask \(M\) that is located at \(ind\) as the variable \(row\); secondly, we increment all elements of \(ind\) by one and limit their value by the upper bound of forecasting horizon \(T_{h}\) as shown in line 5 and 6 respectively; thirdly, we update the elements of \(row\) located at \(ind\) as one. For instance, Fig. 4 illustrates how the elements change in Algorithm 1 from initialization to the final settings. We firstly initialize the mask \(M\) as a \(7\times 7\) zero matrix. For the first iteration, the starting position or the index is \(ind=S_{1}=[1,3,5]\), which means ProNet predicts the 1st, 3rd and 5th steps simultaneously. Then, we update the temporary variable \(row\rightarrow[1\ 0\ 1\ 0\ 1\ 0\ 0]\) (line 2 of Algorithm 1) and use it to fill the 1st, 3rd and 5th row of \(M\) (line 4 of Algorithm 1) as shown in the upper right of Fig. 2. Afterwards, we increment elements of \(ind\rightarrow[2,4,6]\) by one and update temporary variable \(row\rightarrow[1\ 1\ 1\ 1\ 1\ 0]\). The second iteration is as the first one, while final iteration implements progressive prediction: we now have the variable \(row\rightarrow[1\ 1\ 1\ 1\ 1\ 1]\) and index \(ind=[3,6,7]\). We fill the 3th, 6th and 7th row of \(M\) with \(row\), which means we use all previous predictions to forecast the 7th step and re-forecast the 3th and 6th steps. ### Variational Inference The ProNet algorithm addresses the challenge of segmenting sequences and prioritizing forecasted steps to achieve optimal performance. It is crucial to initiate forecasting with steps that carry the most significance and intricate dependencies on subsequent time points. However, obtaining this \begin{table} \begin{tabular}{c c c c c} \hline Prediction at \(t\) & \multicolumn{3}{c}{Input at \(t\)} \\ \hline & past covariates & future covariates & past ground truth & future ground truth \\ \hline AR (\(\mathbf{Y}_{i,t+1}\)) & \(\mathbf{X}_{i,1:T_{l}}\) & \(\mathbf{X}_{i,T_{l}:t}\) & \(\mathbf{Y}_{i,1:T_{l}}\) & \(\mathbf{Y}_{i,T_{l}:t}\) \\ NAR (\(\mathbf{Y}_{i,t+1}\)) & \(\mathbf{X}_{i,1:T_{l}}\) & \(\mathbf{X}_{i,T_{l}:T_{l}+T_{h}}\) & \(\mathbf{Y}_{i,1:T_{l}}\) & None \\ \hline \end{tabular} \end{table} TABLE I: Available information for predicting step \(t+1\) by AR and NAR forecasting methods. Fig. 4: Creation process of progressive mask \(M\): initial \(M\) (upper left), \(M\) after the 1st (upper right) and 2nd (lower left) iteration, and the final \(M\) (lower right) when the forecasting horizon \(T_{h}=7\), the segment size \(n_{g}=3\) and starting positions of each segments \(S_{1}=[1,3,5]\). We mark their changes in bold. vital information is not straightforward. Drawing inspiration from the methodology introduced in [41], we tackle this issue by employing parallel forecasting of step importance, representing them as latent variables denoted as \(z\). These latent variables are derived through conditional variational inference, an approach rooted in conditional Variational Autoencoders (cVAEs) [42]. These cVAEs bridge the gap between observed and latent variables, facilitating a deeper understanding of data patterns. The concept of cVAEs extends the classical Variational Autoencoder (VAE) framework [43], enhancing it by integrating conditioning variables into the data generation process. This augmentation empowers cVAEs to learn a more nuanced and contextually aware latent space representation of data. In a standard VAE, data is mapped to a lower-dimensional latent space using an encoder, and subsequently, a decoder reconstructs this data from points in the latent space. cVAEs introduce conditional variables that encode additional context or prior knowledge into the generative model. This enables cVAEs not only to learn conditional latent representations but also to incorporate provided contextual cues effectively. Particularly, cVAEs are advantageous in scenarios where supplementary information is available, mirroring the case of ProNet, which requires generating initial time steps for predictions based on past ground truth and covariates. In the context of ProNet, the latent variables, denoted as \(z\), correspond to individual output steps and rely on the entire temporal sequence for their determination. Consequently, the conditional probability is articulated as: \[P_{\theta}(y\mid x)=\int_{z}P_{\theta}(y\mid z,x)P_{\theta}(z\mid x)dz \tag{4}\] The \(y\) denotes the ground truth in the forecasting horizon, and conditioning variable \(x\) plays the role of historical data and covariates, allowing the model to capture the relevance of different time steps as latent variable \(z\) for accurate predictions. However, the direct optimization of this objective is unfeasible. To address it, the Evidence Lower Bound (ELBO) [42] is employed as the optimization target, resulting in the following formulation: \[\begin{split}\log P_{\theta}(y\mid x)&\geq\text{Eq} \phi(z\mid y,x)\left[\log P_{\theta}(y\mid z,x)\right]\\ &\quad-\text{KL}\left(q_{\phi}(z\mid y,x)|p_{\theta}(z\mid x) \right)\end{split} \tag{5}\] Here, the Kullback-Leibler (KL) divergence is denoted by \(\text{KL}\). The term \(p_{\theta}(z\mid x)\) represents the prior distribution, \(q_{\phi}(z\mid y,x)\) denotes an approximated posterior, and \(P_{\theta}(y\mid z,x)\) characterizes the decoder. With the ground truth encompassed within the horizon denoted by \(y\) and the condition \(x\), \(q_{\phi}(z\mid y,x)\) effectively models the significance of diverse time steps represented by \(z\). Notably, during prediction, \(y\) is not available, prompting the need to train \(p_{\theta}(z\mid x)\) to approximate \(q_{\phi}(z\mid y,x)\), achieved through the minimization of the KL divergence. Both the prior and the approximated posterior are modelled as Gaussian distributions characterized by their mean and variance. The mean \(\mu\) is obtained via a linear layer, while the variance \(\sigma\) is derived through another linear layer, followed by a SoftPlus activation function. To enable smooth gradient flow through random nodes, the reparameterization trick [42] is invoked. This involves sampling the latent variable \(z\) using the equation \(z=g(\epsilon,\mu,\sigma)=\mu+\sigma\epsilon\), where \(\epsilon\) follows a standard normal distribution \(\mathcal{N}(0,1)\), effectively serving as white noise. The value of \(z\) encapsulates the significance of each time step within the forecasting horizon, guiding the selection of which steps to initiate predictions from. The top \(k\) indices featuring the highest \(z\) values are chosen to initiate forecasting. During the training process, \(z\) is sampled from \(q_{\phi}(z\mid y,x)\), and the approximation of \(q_{\phi}(z\mid y,x)\) to the true posterior \(p_{\theta}(z\mid x)\) is enforced. This entire framework enables ProNet to identify and leverage the most crucial time steps for accurate and effective forecasting. Empirically, we find both the prior and posterior models often assign elevated importance to a sequence of steps, leading to a substantial reduction in decoding speed during testing. Striking a balance between accuracy and speed, we introduce a novel approach to realign the latent factor \(z\) by incorporating a scaling factor with the assistance of weight vectors denoted as \(W\in\Re^{T_{h}-1}\): \[\begin{split} z&=softmax(z)\times W\\ W&=|cos([0,1,...,T_{h}-1]\times\frac{n_{g}\pi}{T_{ h}})|\end{split} \tag{6}\] This re-weighting operation modifies the latent factor \(z\) to achieve a more optimized equilibrium between the forecasting accuracy and the computational speed. Subsequently, we determine the initial position, denoted as \(S_{1}\), and identify the indices of the largest \(n_{g}-1\) elements from \(z[2\ :]\) as potential starting positions. For example, Fig. 5 provides a visual representation of the latent variable \(z\) before and after the re-weighting process. By selecting \(n_{g}=3\), the original \(z\) yields the starting position \(S_{1}=[1,5,6]\), necessitating 4 autoregressive (AR) iterations to complete the forecasting process. Conversely, the re-weighted \(z\) results in a starting position \(S_{1}=[1,3,6]\), reducing the AR iterations required to 3. Remarkably, this re-weighting design elevates decoding speed by 25% in this scenario. Illustrating the tangible benefits of our approach, this strategic re-weighting of the latent variable \(z\) not only preserves forecast accuracy but also significantly enhances the computational efficiency of the process. ## Experiments ### Data Sets We conducted experiments using publicly available time series datasets, namely Sanyo [44], Hanergy [45], Solar [46], and Electricity [47]. These datasets encompass diverse sources of information and provide valuable insights. Specifically, the datasets consist of: **Sanyo** and **Hanergy**: These datasets encompass solar power generation data obtained from two distinct Australian PV plants, covering periods of 6 and 7 years, respectively. We focused our analysis on the time range between 7 am and 5 pm, aggregating the data at half-hourly intervals. In addition to the power generation information, we incorporated covariate time series data related to weather conditions and weather forecasts. Detailed descriptions of the data collection process can be found in [48]. For these datasets, we incorporated calendar features, specifically _month, hour-of-the-day, and minute-of-the-hour_. **Solar**: This dataset comprises solar power data originating from 137 PV plants across the United States. It covers an 8-month span, and the power data is aggregated at hourly intervals. Similarly to the previous datasets, calendar features are integrated, including _month, hour-of-the-day, and age_. **Electricity**: This dataset involves electricity consumption data gathered from 370 households over a duration of approximately 4 years. The electricity consumption data is aggregated into 1-hour intervals. For this dataset, we incorporated calendar features, including _month, day-of-the-week, hour-of-the-day, and age_. Following prior research [3, 48], all datasets were preprocessed by normalizing the data to have zero mean and unit variance. In Table II, we provide an overview of the statistics associated with each dataset. ### Experimental Details We compare the performance of ProNet with seven methods: five state-of-the-art deep learning (DeepAR, DeepSSM, LogSparse Transformer, N-BEATS and Informer), a statistical (SARIMAX) and a persistence model: * Persistence is a typical baseline in forecasting and considers the time series of the previous day as the prediction for the next day. * SARIMAX [49] is an extension of the ARIMA and can handle seasonality with exogenous factors. * DeepAR [16] is a widely used sequence-to-sequence probabilistic forecasting model. * DeepSSM [17] fuses SSM with RNNs to incorporate structural assumptions and learn complex patterns from the time series. It is the state-of-the-art deep forecasting model that employs SSM. * N-BEATS [24] consists of blocks of fully-connected neural networks, organised into stacks using residual links. We introduced covariates at the input of each block to facilitate multivariate series forecasting. * LogSparse Transformer [3] is a recently proposed variation of the Transformer architecture for time series forecasting with convolutional attention and sparse attention; it is denoted as "LogTrans" in Table IV. * Informer [26] is a Transformer-based forecasting model based on the ProbSparse self-attention and self-attention distilling. We modified it for probabilistic forecasts to generate the mean value and variance. Note that Persistence, N-BEATS and Informer are NAR models while the others are AR models. All models were implemented using PyTorch 1.6 and evaluated on Tesla V100 16GB GPU. The deep learning models were optimised by mini-batch gradient descent with the Adam optimiser and a maximum number of epochs 200. In line with the experimental setup from [48] and [3], we carefully partitioned the data to prevent future leakage during our evaluations. Specifically, for Sanyo and Hanergy datasets, we designated the data from the last year as the test set, the second last year as the validation set for early stopping, and the remaining data (5 years for Sanyo and 4 years for Hanergy) as the training set. For the Solar and Electricity datasets, we utilized the data from the last week (starting from 25/08/2006 for Solar and 01/09/2014 for Electricity) as the test set, and the week preceding it as the validation set. To ensure consistency, the data preceding the validation set was further divided into three subsets, and the corresponding validation set was employed to select the best hyperparameters. Throughout the process, our hyperparameter selection was based on achieving the minimum loss on the validation set, enabling us to fine-tune the model for optimal performance. We used Bayesian optimization for hyperparameter search for all deep learning models with a maximum number of iterations 20. The models used for comparison were tuned based on the recommendations in the original papers. We selected the hyperparameters with a minimum loss on the validation set. Probabilistic forecasting models use NLL loss while the point forecasting model(N-BEATS) uses mean squared loss. For the Transformer-based models, we used learnable position and ID (for Solar and Electricity sets) embedding. For Fig. 5: Visualization of latent variable \(z\): (a) original \(z\), (b) re-weighted \(z\). Higher brightness indicates the higher value of \(z\) element. ProNet, the constant sampling factor for Informer backbone was set to 2, and the length of start token \(T_{d}e\) is fixed as half of the forecasting horizon. The learning rate \(\lambda\) was fixed; the number of segments \(n_{g}\) was fixed as 10 for Sanyo and Hanergy data sets, and 12 for Solar and Electricity sets; the dropout rate \(\delta\) was chosen from {0, 0.1, 0.2}. The hidden layer dimension size \(d_{hid}\) was chosen from {8, 12, 16, 24, 32, 48, 96}; the Informer backbone Pos-wise FFN dimension size \(d_{f}\) and number of heads \(n_{h}\) were chosen from {8, 12, 16, 24, 32, 48, 96} and {4, 8, 16, 24, 32}; the number of hidden layers of encoder \(n_{e}\) and decoder \(n_{d}\) were chosen from {2, 3, 4}. Following [26, 50], we restrict the decoder layers to be less than encoder layers for a fast decoding speed. The selected best hyperparameters for ProNet are listed in Table III and used for the evaluation of the test set. As in [16], we report the standard \(\rho\)0.5 and \(\rho\)0.9-quantile losses. Note that \(\rho\)0.5 is equivalent to MAPE. Given the ground truth \(y\) and \(\rho\)-quantile of the predicted distribution \(\hat{y}\), the \(\rho\)-quantile loss is defined by: \[\begin{split}\mathrm{QL}_{\rho}(y,\hat{y})&=\frac{2 \times\sum_{t}P_{\rho}\left(y_{t},\hat{y}_{t}\right)}{\sum_{t}|y_{t}|},\\ P_{\rho}(y,\hat{y})&=\left\{\begin{array}{ll} \rho(y-\hat{y})&\text{if }y>\hat{y}\\ (1-\rho)(\hat{y}-y)&\text{otherwise}\end{array}\right.\end{split} \tag{7}\] ## Results ### Accuracy Analysis The performance of our proposed ProNet model, along with several benchmark methods, is summarized in Table IV. This table presents the \(\rho\)0.5 and \(\rho\)0.9 loss metrics for all models. Notably, since N-BEATS and Persistence generate point forecasts, we report only the \(\rho\)0.5 loss for these models. We can see ProNet is the most accurate method - it outperforms other methods on all data sets except for \(\rho\)0.9 on Solar and \(\rho\)0.5 on Electricity where Logsparse Transformer shows better performance. A possible explanation is that the ProNet backbone - Informer has subpar performance for the two cases. As a NAR forecasting model, Informer ignores dependency in target space, while our ProNet assumes the alternative dependency and therefore achieves better accuracy than Informer. Comparing the performance of AR and NAR models, we can see our ProNet is the most successful overall - ProNet achieves a trade-off between AR and NAR forecasting models by assuming an alternative dependency and accessing both past and future information for forecasting with latent variables. ### Visualization Analysis We provide visual representations of example forecasts produced by our ProNet model on three distinct datasets: Sanyo, Hanergy, and Solar. As shown in Fig. 6, these illustrations demonstrate the remarkable forecasting accuracy achieved by ProNet, highlighting its ability to effectively capture intricate and diverse patterns within the forecasting horizon. The visualizations underscore the model's capacity to handle complex temporal dependencies and produce reliable predictions. Moreover, Fig. 7 showcases the predictive prowest of ProNet on the Electricity dataset. This particular visualization presents the results for a consecutive 8-day period from the test set. Notably, ProNet employs a 7-day history to generate a 1-day forecasting output. The graph reveals ProNet's remarkable capability to leverage the interconnected nature of related time series and exploit extensive historical context to generate accurate and informative predictions. ### Error Accumulation To investigate the ability of ProNet to handle error accumulation and model the output distribution, we compare ProNet with an AR model (DeepAR) and a NAR model (Informer) on the Sanyo and Hanergy as a case study. Fig. 8 shows the \(\rho\)0.5-loss of the models for the forecasting horizons range from 1 (20 steps) to 10 days (200 steps). We can see the \(\rho\)0.5-loss of all models increases with the forecasting horizon but the performance of DeepAR drops more significantly due to its AR decoding mechanism and error accumulation. ProNet consistently outperforms Informer for short horizon and has competitive performance with Informer for long horizon, indicating the effectiveness of seeking the trade-off between AR and NAR models. ProNet assumes the dependency in target space without fully discarding AR decoding and can improve the forecasting accuracy over all horizons. \begin{table} \begin{tabular}{c c c c c c c c c c} \hline & Start date & End date & Granularity & \(L_{d}\) & \(N\) & \(n_{T}\) & \(n_{C}\) & \(T_{l}\) & \(T_{h}\) \\ \hline Sanyo & 01/01/2011 & 31/12/2016 & 30 minutes & 20 & 1 & 4 & 3 & 20 & 20 \\ Hanergy & 01/01/2011 & 31/12/2017 & 30 minutes & 20 & 1 & 4 & 3 & 20 & 20 \\ Solar & 01/01/2006 & 31/08/2006 & 1 hour & 24 & 137 & 0 & 3 & 24 & 24 \\ Electricity & 01/01/2011 & 07/09/2014 & 1 hour & 24 & 370 & 0 & 4 & 168 & 24 \\ \hline \end{tabular} \end{table} TABLE II: Dataset statistics. \(L_{d}\) - number of steps per day, \(N\) - number of series, \(n_{T}\) - number of time-based features, \(n_{C}\) - number of calendar features, \(T_{l}\) - length of input series, \(T_{h}\) - length of forecasting horizon. \begin{table} \begin{tabular}{c c c c c c c c} \hline & \(\lambda\) & \(\delta\) & \(d_{hid}\) & \(n_{e}\) & \(n_{d}\) & \(d_{f}\) & \(n_{h}\) \\ \hline Sanyo & 0.005 & 0.1 & 24 & 3 & 3 & 32 & 4 \\ Hanergy & 0.005 & 0.1 & 24 & 2 & 2 & 32 & 12 \\ Solar & 0.005 & 0.1 & 48 & 4 & 3 & 24 & 12 \\ Electricity & 0.001 & 0.1 & 48 & 3 & 3 & 32 & 12 \\ \hline \end{tabular} \end{table} TABLE III: Hyperparameters for ProNet The results show that error accumulation degrades the performance of AR models but ProNet can successfully overcome this by assuming the alternative dependency and fusing future information into predictions with a shorter AR decoding path. ### Inference Speed We evaluate the prediction time of ProNet with varying number of segments \(n_{g}\) and compare it with the AR and NAR model: LogTrans and Informer. Table V shows the average elapsed time and the standard deviation over 10 runs; all models were run on the same computer configuration. As expected, ProNet has a faster inference speed than the AR LogTrans for their shorter AR decoding path. The \begin{table} \begin{tabular}{c c c c} & Sanyo & Hinery & Solar & Electricity \\ \hline Persistence & 0.154/- & 0.242/- & 0.256/- & 0.091/- \\ SARIMAX & 0.124/0.096 & 0.145/0.098 & 0.256/0.192 & 0.196/0.079 \\ DeepAR & 0.070/0.031 & 0.092/0.045 & 0.222/0.093\({}^{\circ}\) & 0.075\({}^{\circ}\)0.040\({}^{\circ}\) \\ DeepSSM & **0.042**/0.023 & **0.070**/0.053 & 0.223/0.181 & 0.083/0.056\({}^{\circ}\) \\ LogTrans & 0.067/0.036 & 0.124/0.066 & 0.210\({}^{\circ}\)0.082\({}^{\circ}\) & **0.059**/0.034\({}^{\circ}\) \\ N-BEATS & 0.077/- & 0.132/- & 0.212/- & 0.071/- \\ Informer & 0.046/0.022 & 0.084/0.046 & 0.215/0.115 & 0.068/0.033 \\ ProNet & **0.042**/**0.021** & **0.070**/**0.035** & **0.205**/0.091 & 0.071/**0.32** \\ \hline \end{tabular} \end{table} TABLE IV: \(\rho\)0.5/\(\rho\)0.9-loss of data sets with various granularities. \(\diamond\) denotes results from [3]. Fig. 8: \(\rho\)0.5-loss for various forecasting horizons on (a) Sanyo and (b) Hanergy datasets. Fig. 6: Actual vs ProNet predicted data with trend and seasonality components and 95\(\%\) confidence intervals: (a) and (b) - Sanyo; (c) and (d) - Hanergy; (e) and (f) - Solar data sets. Fig. 7: ProNet case study on Electricity data set: actual vs predicted data. inference speed of ProNet increases with the number of segments \(n_{g}\) up to 10. This is because the number of AR steps decreases with \(n_{g}\). ProNet with \(n_{g}=10\) and \(n_{g}=15\) have similar speed as both are expected to have same number of steps 2. As the number of segments \(n_{g}\) increases, ProNet has competitive inference speed with Informer when \(n_{g}=10\) and \(n_{g}=15\). The results confirm that ProNet remains the fast decoding advantage of NAR models, in addition to being the most accurate. ### Ablation and Hyperparameter Sensitivity Analysis To evaluate the effectiveness of proposed methods, we conducted an ablation study on Sanyo and Hanergy sets. Table VI shows the performance of: 1) Trans (AR Transformer); 2) PAR-Trans is the partially AR Transformer implemented by simply dividing the horizon evenly [34]; 3) ProNet-Trans is the ProNet that uses Transformer as backbone instead of Informer; 4) Informer; 5) PAR-Informer is the partially AR Informer [34]; 6) our ProNet. We can see PAR-Trans outperforms Trans and PAR-Informer performs worse than Informer that indicate the partially AR decoding mechanism can improve Trans but degrades the performance of Informer. A possible explanation is that simply dividing forecasting horizon into even segments and the fixed dependency assumption violates the real data distribution, which has time-varying dependency relationships (see Fig. 2). Both ProNet-Trans and ProNet outperform Trans and Informer as well as their partially AR version consistently, showing the effectiveness of our progressive decoding mechanism and confirming the advantage of it over partially AR decoding mechanism. We perform the sensitivity analysis of the proposed ProNet on Sanyo and Hanergy sets. Table VII shows the \(\rho\)0.5/\(\rho\)0.9-loss of ProNet with the number of segments \(n_{g}\) ranges from 2 to 15. ProNet achieves the optimal trade-off with 5 and 10 segments \(n_{g}\), in which cases the performance is the best. It can be explained that when \(n_{g}\) is low, more AR decoding steps are required and error accumulates; when \(n_{g}\) is high, most steps of ProNet are predicted non-autoregressively without the dependency in target space. In summary, considering the ProNet inference speed as provided in Table V, dividing the forecasting horizon by half is the best choice that allows ProNet to achieve the best accuracy and speed. Table VIII and IX present the evaluation of ProNet's \(\rho\)0.5/\(\rho\)0.9-loss performance and prediction speed without the re-weighting mechanism, across varying segment numbers (\(n_{s}\)). Comparing these results with the performance metrics of ProNet showcased in Table VII and V, it becomes evident that ProNet exhibits significantly higher prediction speeds when the re-weighting mechanism is absent. Furthermore, ProNet outperforms its re-weighting mechanism-less counterpart in 10 out of the 16 cases examined. This highlights the important role played by the re-weighting mechanism in enhancing ProNet's prediction speed while preserving its prediction accuracy. The incorporation of this mechanism effectively prevents the assignment of undue importance to specific sequences of steps, thus contributing to the optimization of prediction speed without compromising the overall accuracy of ProNet's forecasting. ## Conclusions We introduced ProNet, a novel deep learning model tailored for multi-horizon time series forecasting. ProNet effectively strikes a balance between autoregressive (AR) and non-autoregressive (NAR) models, avoiding error accumulation and slow prediction while maintaining the ability to model target step dependencies. The key innovation of ProNet lies in its partially AR decoding mechanism, achieved through segmenting the forecasting horizon. It predicts a group of steps non-autoregressively within each segment while locally employing AR decoding, resulting in enhanced forecasting accuracy. The segmentation process relies on latent variables, effectively capturing the significance of steps in the horizon, optimized through variational inference. By embracing alternative dependency assumptions and fusing both past and future information, ProNet demonstrates its versatility and effectiveness in forecasting. Extensive experiments validate the superiority of our partially AR method, showcasing ProNet's remarkable performance and prediction speed compared to state-of-the-art AR and NAR forecasting models.

2308.03130

The Einstein-de Haas Effect in an $\textrm{Fe}_{15}$ Cluster

Classical models of spin-lattice coupling are at present unable to accurately reproduce results for numerous properties of ferromagnetic materials, such as heat transport coefficients or the sudden collapse of the magnetic moment in hcp-Fe under pressure. This inability has been attributed to the absence of a proper treatment of effects that are inherently quantum mechanical in nature, notably spin-orbit coupling. This paper introduces a time-dependent, non-collinear tight binding model, complete with spin-orbit coupling and vector Stoner exchange terms, that is capable of simulating the Einstein-de Haas effect in a ferromagnetic $\textrm{Fe}_{15}$ cluster. The tight binding model is used to investigate the adiabaticity timescales that determine the response of the orbital and spin angular momenta to a rotating, externally applied $B$ field, and we show that the qualitative behaviours of our simulations can be extrapolated to realistic timescales by use of the adiabatic theorem. An analysis of the trends in the torque contributions with respect to the field strength demonstrates that SOC is necessary to observe a transfer of angular momentum from the electrons to the nuclei at experimentally realistic $B$ fields. The simulations presented in this paper demonstrate the Einstein-de Haas effect from first principles using a Fe cluster.

T. Wells, W. M. C. Foulkes, S. L. Dudarev, A. P. Horsfield

2023-08-06T14:44:31Z

http://arxiv.org/abs/2308.03130v2

# The Einstein-de Haas Effect in an Fe\({}_{15}\) Cluster ###### Abstract Classical models of spin-lattice coupling are at present unable to accurately reproduce results for numerous properties of ferromagnetic materials, such as heat transport coefficients or the sudden collapse of the magnetic moment in hcp-Fe under pressure. This inability has been attributed to the absence of a proper treatment of effects that are inherently quantum mechanical in nature, notably spin-orbit coupling. This paper introduces a time-dependent, non-collinear tight binding model, complete with spin-orbit coupling and vector Stoner exchange terms, that is capable of simulating the Einstein-de Haas effect in a ferromagnetic Fe\({}_{15}\) cluster. The tight binding model is used to investigate the adiabaticity timescales that determine the response of the orbital and spin angular momenta to a rotating, externally applied \(B\) field, and we show that the qualitative behaviours of our simulations can be extrapolated to realistic timescales by use of the adiabatic theorem. An analysis of the trends in the torque contributions with respect to the field strength demonstrates that SOC is necessary to observe a transfer of angular momentum from the electrons to the nuclei at experimentally realistic \(B\) fields. The simulations presented in this paper demonstrate the Einstein-de Haas effect from first principles using a Fe cluster. * 10 August 2023 ## 1 Introduction Developing materials for use close to the plasma in a tokamak, where the heat and neutron fluxes are high, is a challenge as few solids survive undamaged for long [1]. Iron-based steels are proposed as structural materials for blanket modules and structural components due to their ability to withstand intense neutron irradiation. At the same time, there are no reliable data about the performance of steels under irradiation in the presence of magnetic fields approaching 10 T. Despite the durability of steels, however, the service lifetimes of reactor components are limited. This has led to a resurgence of research into the properties of steels and other materials under reactor conditions. Properties of interest include thermal conductivity coefficients, and other physical and mechanical properties, intimately related to the question about how the heat and radiation fluxes affect the microstructure of reactor materials [2]. Another focus is on optimizing the structural design to improve the tritium breeding ratio, the heat flow, and structural stability of reactor components [3, 4, 5]. An example of an improvement based on research into the properties of ferromagnetic materials is as follows. Austentitic Fe-Cr-Ni steels are used in the ITER tokamak [6], and are non-magnetic on the macroscopic scale while being microscopically antiferromagnetic. In the next generation demonstration fusion reactor (DEMO), however, the blanket modules are expected to be manufactured from ferromagnetic ferritic-martensitic steels, because these have been found to exhibit superior resistance to radiation damage [1, 7]. Given the importance of ferritic steels in reactor design, it would be helpful to understand heat flow in iron in the presence of strong magnetic fields at high temperature. This is a difficult task. A good heat-flow model must reproduce the dynamics of a many-atom system with complicated inter-atomic forces, whilst also describing the electronic thermal conductivity and the influence of spin-lattice interactions. The spins are not all aligned above the Curie temperature, but they are still present and still scatter electrons. The exchange interactions between spins also affect the forces on the nuclei. Our aim in this paper is to begin the development of such a model, starting from the quantum mechanical principles required to understand electrons and spins. Although a full treatment of the behaviour of the spins and electrons requires quantum theory, various classical atomistic models have been established to investigate spin-lattice interactions. In 1996, Beaurepaire et al. developed the three temperature model (3TM) [8], a nonequilibrium thermodynamics-based approach to describe the interactions between the lattice, spin, and electronic subsystems. A microscopic 3TM proposed by Koopmans et al. in 2010 was able to explain the demagnetization timescales in pulsed-laser-induced quenching of ferromagnetic ordering across three orders of magnitude [9]. Langevin spin dynamics (SD), developed in [10, 11, 12, 13, 14, 15, 16, 17, 18], builds on classical molecular dynamics by adding fluctuation and dissipation terms to the equations of motion for the particles and their spins. Its most well known application is simulating relaxation and equilibration processes in magnetic materials at finite temperatures [11, 16, 19]. In 2008, Ma et al. [20] used a model in which atoms interact via scalar many-body forces as well as via spin orientation dependent forces of the Heisenberg form to predict isothermal magnetization curves, obtaining good agreement with experiment over a broad range of temperatures. Further, they showed that short-ranged spin fluctuations contribute to the thermal expansion of the material. In 2012, Ma et al. [21] proposed a generalized Langevin spin dynamics (GLSD) algorithm that builds on Langevin SD by treating both the transverse (rotational) and longitudinal degrees of freedom of the atomic magnetic moments as dynamical variables. This allows the magnitudes of the magnetic moments to vary along with their directions. The GLSD approach was used to evaluate the equilibrium value of the energy, the specific heat, and the distribution of the magnitudes of the magnetic moments, and to explore the dynamics of spin thermalization. In 2022, Dednam et al. [22] used the spin-lattice dynamics code, SPILADY, to carry out simulations of Einstein-de Haas effect for a Fe nanocluster with more than 500 atoms. Using the code, the authors were able to show that the rate of angular momentum transfer between spin and lattice is proportional to the strength of the magnetic anisotropy interaction, and that full spin-lattice relaxation was achievable on 100 ps timescales. Despite the efforts invested in classical models of spin-lattice interactions, they exhibit numerous shortcomings, such as the inability to accurately reproduce the measured heat transport coefficients in ferromagnetic materials [21, 23, 24], or the sudden collapse of the magnetic moment in hcp-Fe under pressure, which is thought to be a consequence of spin-orbit coupling (SOC) [25]. These limitations can only be overcome by switching to a quantum mechanical description. Experimental work on isolated clusters has improved the understanding of the differences in magnetic properties between atomic and bulk values. Stern-Gerlach experiments have been used to study the magnetic moment per atom of isolated clusters, as a function of the external magnetic field and temperature. These experiments found that the average magnetization as a function of field strength and temperature, resembles the Langevin function, which was initially attributed to thermodynamic relaxation of the spin while in the magnetic field [26, 27, 28]. Using a model based on avoided crossings between coupled rotational and spin degrees of freedom, Xu et al. subsequently explained why the average magnetization resembles the Langevin function for all cluster sizes, including for low temperatures, without reference to the spin-relaxation model [29]. Addressing the physics of iron out of equilibrium -- a complicated time-evolving system of interacting nuclei, electrons and spins -- in a quantum mechanical framework is such a challenge that we seek first to understand one of the simplest phenomena involving spin-lattice coupling: the Einstein-de Haas (EdH) effect. The EdH effect is, of course, the canonical example of how electronic spins apply forces and torques to a crystal lattice, and has been well studied experimentally. It is perhaps surprising, therefore, that we were unable to find any published quantum mechanical simulations of the EdH effect for bulk materials. This paper builds on previous work, in which we reported simulations of the EdH effect for a single O\({}_{2}\) dimer [30]. In 1908, O. W. Richardson was the first to consider the transfer of angular momentum from the internal "rotation" of electrons (i.e., the magnetic moments within the material) to the mechanical rotation of macroscopic objects [31]. Inspired by Richardson's paper, S. J. Barnett theorized the converse effect, in which the mechanical rotation of a solid changes the magnetic moments [32]. Many experiments sought to measure the ratio \(\lambda=\frac{\Delta\mathbf{J}}{\Delta\mathbf{M}}\), where \(\Delta\mathbf{J}\) is the change in electronic angular momentum and \(\Delta\mathbf{M}\) is the change in magnetization of the material. Due to the lack of understanding of electron spin at the time, Richardson and Barnett predicted that \(\lambda\) should equal \(\frac{e}{2m}\); the true value is closer to \(\frac{e}{m}\). The EdH effect was named after the authors of the 1915 paper [33] that reported the first experimental observations, finding \(\lambda=\frac{e}{2m}\) to within the measurement uncertainty. In the same year, Barnett published the first observations of the Barnett effect [34], with a more accurate measurement closer to \(\lambda=\frac{e}{m}\). Subsequent measurements of the Einstein-de Haas effect by Stewart [35] supported the result \(\lambda=\frac{e}{m}\). The discrepancy between the predicted and measured values of \(\lambda\) came to be known as the gyromagnetic anomaly, and was finally resolved only after it was understood that most of the magnetization can be attributed to the polarization of the electrons' spins [36]. The ferromagnetic resonance of Larmor precession observed in 1946 by Griffiths [37] provided a more accurate technique for measuring gyromagnetic ratios, superseding measurement of the EdH and Barnett effects. Using ferromagnetic resonance, Scott accurately measured the gyroscopic ratios of a range of ferromagnetic elements and alloys [38]. After this point, interest in the EdH effect reduced as it was widely considered to be understood. In this paper, we describe the implementation of a non-collinear tight-binding (TB) model complete with all features required to capture spin-lattice coupling in iron in the presence of a time-dependent applied magnetic field. The required features are: coupling of the electrons to the lattice, coupling of the electron magnetic dipole moment to an externally applied time-dependent magnetic field, coupling between orbital and spin angular momentum through SOC, and electron exchange. Using this model, we simulate the response of an Fe\({}_{15}\) cluster to a time-varying magnetic field, and analyse the torque on the nuclei due to the electrons. We find that, in a slowly rotating \(B\) field, the orbital and spin angular momenta rotate with the field, leading to a measurable torque on the cluster. We also describe the qualitative features of the evolution of the spin and angular momentum, and demonstrate the enhancement of the torque exerted on the nuclei by the electrons as a result of SOC. Thus, this work documents a quantum mechanical model capable of simulating the Einstein-de Haas effect, and reveals the physical mechanisms that set the timescales over which the spins evolve. This paper is structured as follows. Section 2 describes the method used for the calculations. The results of the simulations are discussed in Sec. 3. Conclusions are drawn in Sec. 4. ## 2 Theory ### The System The Fe cluster studied in this work is Fe\({}_{15}\), in the configuration shown in figure 1. This cluster has been studied numerically in many previous works [39, 40, 41, 42, 43, 44]. The 15 atoms are positioned exactly as in a subset of the body-centered cubic (BCC) lattice, with the nearest-neighbor distance set to 2.49 A to match that of bulk iron [39]. The atoms in the cluster are held in position and are not allowed to move during the simulation. The TB basis functions are atomic-like \(d\) orbitals (using real cubic harmonics) with separate orbitals for up and down spins to form a non-collinear TB model. The ten basis functions on each atom are denoted, \[\left|d_{z^{2},\uparrow}\right\rangle,\ \left|d_{xz,\uparrow} \right\rangle,\ \left|d_{yz,\uparrow}\right\rangle,\ \left|d_{xy,\uparrow}\right\rangle,\ \left|d_{x^{2}-y^{2}, \uparrow}\right\rangle,\] \[\left|d_{z^{2},\downarrow}\right\rangle,\ \left|d_{xz,\downarrow} \right\rangle,\ \left|d_{yz,\downarrow}\right\rangle,\ \left|d_{xy,\downarrow}\right\rangle,\ \left|d_{x^{2}-y^{2}, \downarrow}\right\rangle. \tag{1}\] The basis set does not include any \(s\) or \(p\) orbitals below the \(3d\) shell or any orbitals above it. We use the TB model of Liu _et al._[45], hereafter called the Oxford TB model. This model for Fe has 6.8 electrons in the \(3d\) shell. With 15 Fe atoms, the full Hamiltonian is a \(150\times 150\) Hermitian matrix and the 150 molecular orbitals (MOs) are occupied by 102 electrons. The non-magnetic terms in our Hamiltonian matrix are exactly as described in [45], and do not introduce any terms that couple spin to the lattice degrees of freedom; the magnetic, spin-orbit and exchange terms are discussed in Sec. 2.4. The MOs \(\left|\phi_{n}\right\rangle\) are the eigenfunctions of the Hamiltonian and can be expressed as linear combinations of the basis states \(\left|\chi_{\alpha\sigma}\right\rangle\), assumed to be orthonormal, with expansion coefficients \(d_{n\alpha\sigma}\), \[\left|\phi_{n}\right\rangle=\sum_{\alpha\sigma}d_{n\alpha\sigma}\left|\chi_{ \alpha\sigma}\right\rangle, \tag{2}\] where \(\alpha\) runs over the spatial atomic orbitals (AOs) on all atoms and \(\sigma\) is a spin index taking the values up (\(\uparrow\)) or down (\(\downarrow\)). Figure 1: The Fe\({}_{15}\) cluster chosen for analysis in this work. The eight type-2 atoms are the nearest neighbours of atom 1 and the six type-3 atoms are the next-to-nearest neighbours. The nearest-neighbour distance is 2.49 Å. ### The simulations The \(B\) field produced by a fixed solenoid reverses its direction when the current reverses, remaining parallel or anti-parallel to the solenoidal axis but changing in magnitude. In our simulations, however, we chose to study a rotating \(B\) field of constant magnitude: the \(B\) vector traces out a semicircle, from the south pole \((-\hat{\bi z})\) to the north pole \((+\hat{\bi z})\) of a sphere. There are three reasons we believe that this rotational path better mimics the field experienced by a single magnetic domain in a measurement of the EdH effect. (i) The magnetic field felt by a single magnetic domain within a solid is not in general exactly aligned with its magnetization axis due to the configuration of the other surrounding domains. This symmetry-breaking mechanism is absent when a field with fixed direction is applied to a single domain, the magnetization of which is initially aligned with the applied field. (ii) It is unlikely that the crystal lattice of any single magnetic domain is aligned such that the initial and final fields are exactly parallel to the easy axes of the domain. (iii) The total exchange energy is large even for a small cluster and scales with system size. For the magnetization of an isolated single-domain cluster to reverse its direction in response to a \(B\) field that is initially aligned with the magnetization and reverses along its axis, the Stoner moment would have to pass through zero, overcoming a large exchange energy barrier. We deem this scenario unlikely. In a real multi-domain magnet, the spin stays large and rotates rather than passing through \(\langle\bi{S}\rangle={\bf 0}\). To perform the rotation from the south pole to the north pole of a sphere, the \(\bi{B}\) field is parametrized in spherical coordinates as \[\bi{B}=(-B\sin\theta,\ 0,\ -B\cos\theta), \tag{3}\] where \(\theta=\omega t\), \(t\) is the elapsed time, \(\omega=\pi/T_{f}\), and \(T_{f}\) is the time at which the simulation finishes. The magnitude \(B=|\bi{B}|\) of the applied magnetic field differs in different simulations. The \(\bi{B}\) field is initially in the \(-\hat{\bi z}\) direction and gradually rotates by \(180^{\circ}\) in the \(xz\) plane. The simulation is complete when \(\bi{B}\) points in the \(+\hat{\bi z}\) direction. ### The Time Evolution Algorithm At the beginning of the simulation (\(t=0\)), the molecular orbitals \(|\phi_{n}\rangle\) are obtained by diagonalizing the self-consistent ground state Hamiltonian. At later times, the state is calculated from the time-evolved molecular orbitals \(|\psi_{n}(t)\rangle\), which are found by solving the time-dependent Schrodinger equation, \[i\hbar\partial_{t}\left|\psi_{n}(t)\right\rangle=H(t)\left|\psi_{n}(t)\right\rangle, \tag{4}\] subject to the initial condition \(\left|\psi_{n}(t=0)\right\rangle=|\phi_{n}\rangle\). For times later than \(t=0\), the time-evolved molecular orbitals are not exact eigenfunctions of the Hamiltonian, since the Hamiltonian \(H(t)\) depends on time if \(\bi{B}(t)\) depends on time. The time-dependent expansion coefficients \(d_{n\alpha\sigma}(t)\) are defined by \[\ket{\psi_{n}(t)}=\sum_{\alpha\sigma}d_{n\alpha\sigma}(t)\ket{\chi_{\alpha\sigma}}, \tag{5}\] and satisfy the discrete equivalent of the time-dependent Schrodinger equation, \[i\hbar\frac{\partial}{\partial t}d_{n\alpha\sigma}(t)=\sum_{\alpha^{\prime} \sigma^{\prime}}H_{\alpha\sigma,\alpha^{\prime}\sigma^{\prime}}(t)d_{n\alpha^ {\prime}\sigma^{\prime}}(t). \tag{6}\] Rewriting this equation of motion in matrix-vector form with \((\mathbf{d})_{n\alpha\sigma}=d_{n\alpha\sigma}\) and \((\mathbf{H})_{\alpha\sigma,\alpha^{\prime}\sigma^{\prime}}=H_{\alpha\sigma,\alpha ^{\prime}\sigma^{\prime}}\), gives \[i\hbar\frac{\partial\mathbf{d}(t)}{\partial t}=\mathbf{H}(t)\mathbf{d}(t). \tag{7}\] To solve Eq. (7) numerically, we introduce a small but finite positive time step \(\delta t\) and use the finite-difference approximation [46] \[\mathbf{d}(t+\delta t)=\exp\biggl{(}\frac{\mathbf{H}(t+\frac{1}{2}\delta t)}{i\hbar} \delta t\biggr{)}\mathbf{d}(t), \tag{8}\] which is both time-reversible and unitary. In index notation, one step of the time evolution takes the form \[d_{n\alpha\sigma}(t+\delta t)=\sum_{\alpha^{\prime}\sigma^{\prime}}\left(e^{H (t+\frac{1}{2}\delta t)\delta t/i\hbar}\right)_{\alpha\sigma,\alpha^{\prime} \sigma^{\prime}}d_{n\alpha^{\prime}\sigma^{\prime}}(t). \tag{9}\] The calculation of \(H(t+\frac{1}{2}\delta t)\delta t/i\hbar\) from Eq. (9) is not trivial since the Stoner term must be extrapolated to \(t+\frac{1}{2}\delta t\) based on its previous values. The method employed for this task is described in [30]. The initial condition, \(\ket{\psi_{n}(0)}=\ket{\phi_{n}}\), implies that the coefficients \(d_{n\alpha\sigma}\) at \(t=0\) are given by \[d_{n\alpha\sigma}(0)=\bra{\chi_{\alpha\sigma}}{\phi_{n}}. \tag{10}\] The time-dependent one-particle density operator, \(\rho(t)\), is defined by \[\rho(t)=\sum_{n\;\mathrm{occ}}\ket{\psi_{n}(t)}\bra{\psi_{n}(t)}. \tag{11}\] Using Eq. (5), the matrix elements of \(\rho(t)\) may be expressed in terms of the expansion coefficients as \[\rho_{\alpha^{\prime}\sigma^{\prime},\alpha\sigma}(t)=\sum_{n\;\mathrm{occ}}d _{n\alpha^{\prime}\sigma^{\prime}}(t)d_{n\alpha\sigma}^{*}(t). \tag{12}\] ### The Hamiltonian To describe the EdH effect, the Hamiltonian must include: (i) coupling of electrons to an external time-dependent magnetic field; (ii) spin-orbit coupling; and (iii) Stoner exchange. In electronic structure methods, Stoner exchange is often used in its collinear form, but this is inappropriate for describing spin dynamics as it breaks rotational symmetry in spin space [47]. We therefore use a non-collinear exchange Hamiltonian. The full Hamiltonian may be partitioned as \[H=H_{0}+H_{B}+H_{\mathrm{SOC}}+H_{\mathrm{ex}}, \tag{13}\] where \(H_{0}\) is the basic tight-binding Hamiltonian given by the Oxford model, \(H_{B}\) is the interaction with the external field, \(H_{\mathrm{SOC}}\) describes SOC, and \(H_{\mathrm{ex}}\) is the vector Stoner exchange term. The Hamiltonian term that describes the interaction of a single atom with an external magnetic field is \[H_{B,a} =-\mathbf{\mu}_{a}\cdot\mathbf{B}(t)\] \[=\frac{\mu_{B}}{\hbar}\sum_{a}P_{a}(\mathbf{L}+2\mathbf{S})P_{a}\cdot\mathbf{ B}(t), \tag{14}\] where \(\mathbf{\mu}_{a}\) is the magnetic moment of atom \(a\), \(P_{a}=\sum_{m\sigma}|\chi_{am\sigma}\rangle\langle\chi_{am\sigma}|\) is the projection operator on to the basis of atomic-like \(d\) orbitals on atom \(a\), and \(m\) runs over the 5 \(d\) orbitals on atom \(a\), \(\mu_{B}\) is the Bohr magneton, \(\mathbf{S}\) is the spin angular momentum operator, and \(\mathbf{L}\) is the orbital angular momentum operator about the nucleus in the Coulomb gauge. This form may be justified by reference to the Pauli equation [48]. The magnetic Hamiltonian for the cluster is obtained by summing atomic contributions: \[H_{B}=-\sum_{a}\mathbf{\mu}_{a}\cdot\mathbf{B}(t). \tag{15}\] The spin-orbit coupling term is of relativistic origin and can be derived by application of the Foldy-Wouthuysen transformation to the Dirac equation [49]. In the spherical potential of a single atom, this gives \[H_{\mathrm{SOC}}=\frac{1}{2m_{e}^{2}c^{2}}\frac{1}{r}\frac{dV(r)}{dr}\mathbf{L} \cdot\mathbf{S}, \tag{16}\] where \(m_{e}\) is the mass of an electron, \(c\) is the speed of light, and \(V(r)\) is the potential experienced by an electron due to the atomic nucleus and the other electrons belonging to that atom within the central field approximation. The radial part of the SOC matrix element between two AOs in the same shell is a constant, \(\xi\), and our TB model includes only one shell of AOs per iron atom, so [50] \[H_{\mathrm{SOC}}\approx\frac{\xi}{\hbar^{2}}\mathbf{L}\cdot\mathbf{S}. \tag{17}\] Since the gradient of the nuclear potential is largest very near to the nucleus, the spin-orbit term can be assumed to couple atomic orbitals on the same atom only. Adding similar terms for every atom in the cluster yields the SOC Hamiltonian used in this work: \[H_{\mathrm{SOC}}\approx\frac{\xi}{\hbar^{2}}\sum_{a}(P_{a}\mathbf{L}P_{a})\cdot(P_{ a}\mathbf{S}P_{a}). \tag{18}\] The Stoner exchange term, which is a mean-field approximation to the many-body effect of exchange, is given by \[H_{\mathrm{ex}}=-I\sum_{a}\mathbf{m}_{a}\cdot(P_{a}\mathbf{\sigma}P_{a}), \tag{19}\] where \(I\) is the Stoner parameter (which has units of energy), \[\mathbf{m}_{a}(t)=\langle P_{a}\mathbf{\sigma}P_{a}\rangle \tag{20}\] is the expectation value of the operator \(P_{a}\mathbf{\sigma}P_{a}\), and \(\mathbf{\sigma}\) is the vector of Pauli matrices. The origin of the Stoner exchange term is described in more detail in [30]. ### Numerical Parameters The TB model utilizes computationally and experimentally derived parameters. The SOC parameter is calculated to have the value \(\xi=0.06\,\mathrm{eV}\), which is approximately \(2.2\times 10^{-3}\,\mathrm{a.u.}\), in [51]. The time-dependent simulations begin at \(t=0\), end at \(t=T_{f}=10,\!000\,\mathrm{a.u.}\), and use a timestep of \(\delta t=1\,\mathrm{a.u.}\), which is approximately \(24\,\mathrm{as}\). All other TB parameters are taken from the Oxford model [45]. The chosen TB model was parameterised in a bulk environment for the purpose of reproducing magnetic moments near point defects in solids. The cluster geometry considered in this work uses the same inter-atomic spacing as for bulk Fe. Since the crystal structure of the cluster is not relaxed, the simulations are not expected to be quantitatively accurate. The goal of this work is to investigate the qualitative physics of metallic magnetic clusters in time-varying magnetic fields, and the TB model used is expected to describe this correctly. ### Computing Observables The nuclei in our simulations are treated as classical particles subject to classical forces, but the forces exerted on them by the electrons are evaluated quantum mechanically using the time-dependent equivalent of the Hellman-Feynman theorem [52, 53]. Let \(\mathbf{R}_{a}\) denote the position of the nucleus of atom \(a\). The Hellman-Feynman theorem states that the force exerted on the nucleus of atom \(a\) by the electrons is given by \[\mathbf{F}_{a}=-\mathrm{tr}(\rho\mathbf{\nabla}_{a}H), \tag{21}\] where the density matrix is evaluated according to Eq. (12) and \(\mathbf{\nabla}_{a}=\partial/\partial\mathbf{R}_{a}\). The nuclei also experience a classical Lorentz force, \[\mathbf{F}_{a}^{EM}=q_{a}(\mathbf{v}_{a}\times\mathbf{B}_{a})+q_{a}\mathbf{E}_{a}, \tag{22}\] where \(q_{a}\) is the charge of nucleus \(a\), \(\mathbf{B}_{a}\) and \(\mathbf{E}_{a}\) are the applied magnetic and electric fields at the position of nucleus \(a\), and \(\mathbf{v}_{a}\) is the velocity of nucleus \(a\). The classical nuclei experience both an interaction torque, \(\mathbf{\Gamma}_{\rm int}\), due to the quantum mechanical electrons, and a direct torque, \(\mathbf{\Gamma}^{N,EM}\), exerted by the applied electromagnetic field. The total torque acting on the nuclei is the sum of these two contributions: \[\mathbf{\Gamma}^{N}=\mathbf{\Gamma}^{N,EM}+\mathbf{\Gamma}_{\rm int}. \tag{23}\] The internal torque is calculated from the Hellman-Feynman forces as \[\mathbf{\Gamma}_{\rm int}(t)= \sum_{a}\mathbf{R}_{a}\times\mathbf{F}_{a}(t), \tag{24}\] and the direct torque is given by \[\mathbf{\Gamma}^{N,EM}=\sum_{a\in N}\mathbf{R}_{a}\times\mathbf{F}_{a}^{EM}. \tag{25}\] The angular momentum of the electrons changes as the external field changes, so \(\mathbf{\Gamma}_{\rm int}\) is non-zero. All other expectation values computed in this work are found by taking the trace of the operator multiplied by the density matrix, for example, \[\left\langle\mathbf{L}\right\rangle=\tr(\rho\mathbf{L}),\ \left\langle\mathbf{S}\right\rangle =\tr(\rho\mathbf{S}),\ \left\langle\mathbf{\mu}\right\rangle=\tr(\rho\mathbf{\mu}). \tag{26}\] ### Ehrenfest Equations The Ehrenfest equations of motion come in useful when interpreting the simulation results. The algebra required to derive the Ehrenfest equation of motion for the total angular momentum operator, \(\mathbf{J}=\mathbf{L}+\mathbf{S}\), is outlined in the appendix of [30]. The equations of motion for \(\mathbf{L}\) and \(\mathbf{S}\) separately are derived similarly, although the equation of motion for \(\mathbf{S}\) only receives contributions from the dipole coupling and SOC Hamiltonian terms. The resulting equations are: \[\frac{d\left\langle\mathbf{J}\right\rangle}{dt}= -\mathbf{\Gamma}_{\rm int}+\left\langle\mathbf{\mu}\right\rangle\mathbf{ \times}\mathbf{B}, \tag{27}\] \[\frac{d\left\langle\mathbf{L}\right\rangle}{dt}= -\mathbf{\Gamma}_{\rm int}-\frac{\mu_{B}}{\hbar}\left\langle\mathbf{L} \right\rangle\mathbf{\times}\mathbf{B}+\frac{\xi}{i\hbar^{3}}\left\langle\left[\mathbf{L}, \mathbf{L}\cdot\mathbf{S}\right]\right\rangle,\] (28) \[\frac{d\left\langle\mathbf{S}\right\rangle}{dt}= -2\frac{\mu_{B}}{\hbar}\left\langle\mathbf{S}\right\rangle\mathbf{ \times}\mathbf{B}+\frac{\xi}{i\hbar^{3}}\left\langle\left[\mathbf{S},\mathbf{L}\cdot\mathbf{S} \right]\right\rangle. \tag{29}\] ### Investigative Approach A typical period of oscillation in an Einstein-de Haas experiment is of order \(1\,\)s, but well-converged quantum mechanical simulations require a time step of order \(1\,\)a.u. (\(2.4\times 10^{-17}\,\)s). Since simulations of only \(100,000\) timesteps (\(2.4\times 10^{-11}\) s) are achievable on consumer hardware in a few hours, the necessary computations might initially seem intractable. Fortunately, however, it is possible to simulate long enough to reach the quasi-adiabatic limit, beyond which further increases in the duration of the simulation do not produce qualitative differences in the results. For example, the total change in angular momentum, calculated by integrating the torque through a \(180^{\circ}\) rotation of the applied magnetic field, becomes independent of the simulation time, which is also the time taken to rotate the field. The instantaneous torque tends to zero as the duration increases, so we cannot work in the fully adiabatic limit and assume that the wave function is the instantaneous ground state at all times, but the simulation results can nevertheless be extrapolated to experimental timescales. To prove that quasi-adiabatic timescales are attainable for the Fe\({}_{15}\) system, we first characterize the relevant physical timescales. It is shown in the A.1 that the timescale associated with precession of the magnetic moment in the applied magnetic field is \[T_{p}\sim\frac{2\pi\hbar}{\Delta E_{-\mathbf{\mu}\cdot\mathbf{B}}}, \tag{30}\] where \(\Delta E_{-\mathbf{\mu}\cdot\mathbf{B}}\) is a typical spacing between energy levels of the magnetic dipole Hamiltonian. For states with the same orbital angular momentum quantum number (\(m_{l}\)) but different spin quantum numbers (\(m_{s}\)), the difference in \(m_{s}\) will always be \(\hbar\). In this case, \(\Delta E_{-\mathbf{\mu}\cdot\mathbf{B}}=2\mu_{B}B\), where we have assumed that the spins lie parallel or antiparallel to \(\mathbf{B}\). For an experimentally realistic magnetic field strength of \(0.5\) T, \[T_{p}\sim 3.0\times 10^{6}\,\text{a.u.} \tag{31}\] In SI units, this is approximately \(7.1\times 10^{-11}\,\)s. We note that the adiabatic wave function for the system makes zero contribution to the final angular momentum of the iron, as the start and end points (\(B\) aligned along \(z\)) are equivalent. Thus, the leading term contributing to the net angular momentum transfer will be the first order non-adiabatic correction. The torque applied by the magnetic field on the system must rotate the electron magnetic moments (spin and orbit) with the magnetic field for the beginning and end points to both be adiabatic (Born-Oppenheimer) solutions. No moment is transferred to the lattice by conservation of energy, since there is zero change in adiabatic energy between the beginning and the end, with no kinetic energy being acquired by the nuclei. Thus any gain in kinetic energy of the nuclei must be a result of non-adiabatic processes. The adiabaticity timescale associated with the electronic structure of the cluster is \[T_{s}\sim\frac{2\pi\hbar}{\Delta E_{H_{0}}}, \tag{32}\] where \(\Delta E_{H_{0}}\), the difference in energy of eigenstates split by \(H_{0}\), takes on energy values in the range \(0.1\,\)a.u. to \(0.01\,\)a.u. Assuming \(\Delta E_{H_{0}}=0.1\,\)a.u. gives \[T_{s}\sim 62.8\,\text{a.u.} \tag{33}\] In SI units, this is approximately \(1.5\times 10^{-15}\,\)s. States of different orbital angular momenta are split by \(H_{0}\) while states with the same spatial form but different spin are not, so this timescale affects states with different values of \(\langle\phi_{i}|\mathbf{L}|\phi_{i}\rangle\), where \(|\phi_{i}\rangle\) is the \(i\)'th instantaneous eigenstate. The value of \(\langle\mathbf{L}\rangle\) is able to follow the changes in the applied field quasi-adiabatically, provided the simulation duration is greater than \(T_{s}\). This timescale is much shorter than the timescale associated with Larmor precession. It is also instructive to calculate the spin-orbit adiabaticity timescale. The eigenvalues of the SOC term are given by \((\xi/2)(j(j+1)-l(l+1)-s(s+1))\). In our simulations \(l=2\), since we consider only \(d\) orbitals, \(s=\frac{1}{2}\), and \(j\) may take the values of \(5/2\) or \(3/2\). These two values of \(j\) give the SOC eigenvalues \(\xi\) and \(-1.5\xi\) respectively. Taking the difference between these gives the energy level separation, \(|\Delta E_{SOC}|=2.5\xi=0.15\,\)eV, which is the only possible energy level transition coupled by SOC. Using, \[T_{SOC}\sim\frac{2\pi\hbar}{\Delta E_{SOC}}, \tag{34}\] we find that \(T_{SOC}=419.3\,\)a.u., which is an order of magnitude larger than the lattice splitting timescale in Eq. (33), but several orders of magnitude smaller than the precession timescale. Thus all simulations that are quasi-adiabatic with respect to the Larmor precession timescale, will also be quasi-adiabatic with respect to the SOC timescale. Although the precession timescale for a \(B\) field of \(0.5\) T, \(7.1\times 10^{-11}\,\)s, is too long to simulate, it is possible to achieve quasi-adiabaticity in a shorter time by applying an artificially large magnetic field. The largest field strength considered in this work is \(500\) T, for which the magnetic dipole coupling adiabaticity timescale is \(T_{p}\sim 3\times 10^{3}\,\)a.u. This timescale remains greater than the adiabaticity timescales arising from the electronic structure of the crystal (\(T_{s}=62.8\,\)a.u.), and from the SOC term (\(T_{SOC}=419.3\,\)a.u.). Since the simulations used to draw any conclusions remain quasi-adiabatic, and the field strengths considered are not sufficiently strong to reorder the adiabaticity timescales, the results of our simulations are qualitatively similar to the results that would be found had an experimentally realistic field strength been used. Our approach will consider a range of \(B\) field strengths to confirm the adiabatic timescales calculated above, and deduce trends in the contributions to the torque as the limit of small \(B\) and large \(T_{f}\) is approached. ## 3 Results To facilitate a gradual build up in the complexity of the effects observed, the results section is split into two parts: Sec. 3.1 presents results obtained in the absence of spin orbit coupling; and Sec. 3.2 presents results with spin-orbit coupling. Sec. 3.3 examines how the simulations are relevant to experiments. Sec. 3.4 ends the results section with an analysis of the trends of the various contributions to the torque as the experimental limit is approached. The simulations without SOC used three different field strengths: \(B=500\) T, \(B=50\) T, and \(B=0.5\) T. The results show the gradual breakdown of the quasi-adiabatic rotation of the spin as the applied field is reduced. The simulations with SOC used \(B=500\) T only, as these were unambiguously in the quasi-adiabatic limit and thus the most relevant to experiment. Unless stated otherwise, the results below are expressed in Hartree atomic units (a.u.). ### Without spin-orbit coupling The results shown in this section were all obtained in the absence of SOC, i.e., with \(\xi=0\) a.u. The effects of exchange and the interaction with the magnetic field were included. The three simulations considered have (i) \(B=500\) T, (ii) \(B=50\) T, and (iii) \(B=0.5\) T. Figure 2(a) shows the evolution of the spin and orbital angular momentum expectation values in response to a time-varying \(B\) field with a field strength of \(B=500\) T. Although \(\langle\mathbf{S}\rangle\) remains approximately antiparallel to the field, it also oscillates slightly with a period of approximately 3,000 a.u. This is the timescale associated with the Larmor precession of the spins: the Larmor frequency, \(\omega_{S}=2\mu_{B}B/\hbar\), implies a period of oscillation of \(\frac{2\pi\hbar}{2\mu_{B}B}=2\),\(954\) a.u. \(\approx 7.1\times 10^{-14}\) s From Eqs. (28) and (29), setting the spin orbit term to zero, one can see that Figure 2: The time evolution of the expectation values of (a) the orbital and spin angular momenta and (b) the torque as the applied magnetic field rotates in the \(xz\) plane at constant angular velocity. The field strength is 500 T and there is no SOC. The orbital angular momentum remains almost perfectly anti-aligned with \(\mathbf{B}\). The spin is approximately anti-aligned but exhibits additional oscillations due to Larmor precession about the \(\mathbf{B}\) field. The simulation averages of the \(x\) and \(y\) components of the torque exerted on the nuclei by the electrons are approximately 0; the average of the \(z\) component is non-zero. \(\left\langle\mathbf{S}\right\rangle\) can only undergo Larmor precession, whereas \(d\left\langle\mathbf{L}\right\rangle/dt\) has contributions from a Larmor term plus the interaction torque. The interaction torque is much larger than the magnetic torque, explaining why \(\left\langle\mathbf{L}\right\rangle\) does not precess at the Larmor frequency. The torque exerted on the nuclei by the electrons, \(\mathbf{\Gamma}_{\rm int}\), is shown in figure 2. The \(y\) component remains small throughout the simulation; the \(x\) component changes from negative to positive as the field rotates; and the time dependence of the \(z\) component is shaped (approximately) like the first half of a sinusoidal cycle. If we were not holding the atoms in place, and if the velocities of the nuclei remained small enough to justify neglect of the direct Lorentz torque, the "torque impulse" \(\Delta\mathbf{L}_{\rm nuclei}=\int_{0}^{T_{\rm f}}\mathbf{\Gamma}_{\rm int}(t)dt\) would equal the change in the angular momentum of the cluster of classical nuclei during the simulation. The contributions from \(\Gamma_{\rm int,\it x}\) and \(\Gamma_{\rm int,\it y}\) are much smaller than the contribution from \(\Gamma_{\rm int,\it z}\) and integrate to zero in the quasi-adiabatic limit, so the cluster would begin to spin about the \(z\) axis. In addition to the torque on the nuclei due to the electrons, the nuclei also experience a direct torque contribution from the EM field via the Lorenz force. The effect of the direct electromagnetic torque can be estimated from Eqs. (22) and (25). Since the nuclei are clamped, then \(\mathbf{v}_{a}=\mathbf{0}\) for all atoms and thus the classical Lorentz force is given by \(\mathbf{F}_{a}^{EM}=q_{a}\mathbf{E}_{a}\). Faraday's law of induction informs us that \(\mathbf{\nabla}\mathbf{\times}\mathbf{E}=-\frac{\partial\mathbf{B}}{\partial t}\). Since the \(B\) field is spatially uniform, it follows that \(\frac{\partial\mathbf{B}}{\partial t}\) is spatially uniform, thus the curl operator can be inverted to give \(\mathbf{E}=-\frac{1}{2}(\frac{\partial\mathbf{B}}{\partial t})\times\mathbf{r}+\mathbf{\nabla }\chi(\mathbf{r},t)\), where \(\chi(\mathbf{r},t)\) is an arbitrary smooth function of \(\mathbf{r}\) and \(t\). Since there are no charges contributing to the external field in the vicinity of the cluster, we require the solution with \(\mathbf{\nabla}\cdot\mathbf{E}=0\), which sets \(\chi(\mathbf{r},t)=0\) if the boundary condition that the electric field should tend to zero as \(r\) becomes large is also applied. These relations can be used to estimate the direct torque on the nuclei due to the EM field. Using Eq. (25) for the torque on the nuclei, we find \[\mathbf{\Gamma}^{N,EM}= -\frac{1}{2}\sum_{a\in N}q_{a}\mathbf{R}_{a}\mathbf{\times}\left(\frac{ \partial\mathbf{B}_{a}}{\partial t}\times\mathbf{R}_{a}\right)\!, \tag{35}\] which has a magnitude of order \[\Gamma^{N,EM}\sim eNR_{c}^{2}\bigg{|}\frac{\partial\mathbf{B}}{\partial t}\bigg{|}, \tag{36}\] where \(N\) is the number of nuclei and \(R_{c}\) is the mean cluster radius. A field of 0.5 T that reverses its direction over a duration of 10,000 a.u., has \(\frac{\partial\mathbf{B}}{\partial t}\sim 4.3\times 10^{-11}\) a.u. An approximate mean cluster radius of 2.49 A, gives \(\Gamma^{N,EM}\sim 1.8\times 10^{-9}\) a.u. In figure 4, which has a field strength of \(B=0.5\) T, the interaction torque is approximately \(0.5\times 10^{-6}\) a.u. on average, thus the contribution of the direct EM torque is negligible in comparison to the interaction torque due to the electrons. Provided that simulations remain quasi-adiabatic, both the interaction torque and Faraday torque scale as \(1/T_{f}\), so this result also holds for experimental timescales. Since \(\left\langle\mathbf{L}\right\rangle\) is mostly antiparallel to \(\mathbf{B}\), the \(-\frac{\mu_{B}}{h}\left\langle\mathbf{L}\right\rangle\mathbf{\times}\mathbf{B}\) precession term in Eq. (28) is small and \(\mathbf{\Gamma}_{\rm int}\) is approximately equal to \(-\frac{d\left\langle\mathbf{L}\right\rangle}{dt}\). This can be seen by comparing the graphs of \(\left\langle L_{x}\right\rangle(t)\) and \(\Gamma_{\mathrm{int},x}(t)\): since \(\left\langle L_{x}\right\rangle(t)\) is shaped like the first half of a sine curve, \(\Gamma_{\mathrm{int},x}(t)\) is shaped like minus the first half of a cosine curve. Similarly, \(\left\langle L_{z}\right\rangle(t)\) is shaped like the first half of a cosine curve and \(\Gamma_{\mathrm{int},z}(t)\) like the first half of a sine curve. These observations show that the internal torque on the nuclei is a result of the transfer of orbital angular momentum from the electrons to the nuclei. The transfer could be seen as a manifestation of the Einstein-de Haas effect, but for orbital angular momentum rather than spin. It arises from the rotation of the orbital magnetic moment created by the application of the field itself, and is transmitted to the nuclei via the Coulomb interactions between electrons and nuclei. In the absence of spin-orbit interactions, although the spins rotate, they are decoupled from the lattice and do not exert torques on the nuclei. The torque exerted by the rotating applied field changes the spin angular momentum directly, with no involvement of the lattice. The rapid oscillations appearing in the torque do not arise from the \(-d\left\langle\mathbf{L}\right\rangle/dt\) term of Eq. (28), which does not vary on this timescale, but from the small precession term, \(\frac{1}{2}\mathbf{B}\times\left\langle\mathbf{L}\right\rangle\). Their existence indicates that as \(\mathbf{B}(t)\) evolves, \(\left\langle\mathbf{L}\right\rangle(t)\) is not perfectly anti-parallel to \(\mathbf{B}(t)\), but remains approximately anti-parallel by continuously correcting itself on the crystal Hamiltonian timescale (\(1.5\times 10^{-15}\,\)s, or about 62.8 a.u.), which was calculated in Eq. (32). The results of the \(B=50\,\)T simulation are shown in figure 3. The spin precession timescale of \(\frac{2\pi\hbar}{2\mu_{B}B}=29\),\(537\,\)a.u. (\(7.1\times 10^{-13}\,\)s) is 10 times greater than it is when \(B=500\,\)T, and is almost half the duration of the simulation. The spin is unable to keep up with the rotating magnetic field, and the simulation ends without the \(z\) component of the spin reversing its sign. Since the spin fails to stay in its ground Figure 3: The time evolution of the expectation values of (a) the orbital and spin angular momenta and (b) the torque as the applied magnetic field rotates in the \(xz\) plane at constant angular velocity. The field strength is B = 50 T and there is no SOC. The orbital angular momentum again remains approximately anti-aligned with \(\mathbf{B}\). The spin fails to stay anti-aligned with \(\mathbf{B}\) as the Larmor precession is too slow for this field strength and the simulation is not quasi-adiabatic. The simulation averages of the \(x\) and \(y\) components of the torque are approximately 0; the average of the \(z\) component is non-zero. state, the behaviour of the spin is not quasi-adiabatic at this magnetic field strength and rate of change. The initial magnitude of the spin is determined mostly by the exchange interaction and remains similar to the \(B=500\,\)T case, but the orbital angular momentum \(\langle\mathbf{L}\rangle\) is reduced by a factor of 10. This explains the reduction by about a factor of 10 in the torque applied to the nuclei. The difference in the evolution of the spin has little qualitative effect on the evolution of \(\langle\mathbf{L}\rangle\) and thus little qualitative effect on the form of the torque. Figure 4 shows the results for a realistic field strength of \(B=0.5\,\)T, although still an unrealistically fast field rotation rate. In this case the precession timescale is \(\frac{2\pi h}{2\mu_{B}B}=295,375\,\)a.u. (\(7.1\times 10^{-11}\,\)s), which is greater than the duration of the simulation. As a result, the evolution of \(\langle\mathbf{S}\rangle\) is far from adiabatic and the direction of the spin is unable to follow the rotation of \(\mathbf{B}\). The electronic structure timescale (of approximately 62.8 a.u.) is still much smaller than the timescale on which the \(B\) field rotates, so the orbital angular momentum \(\langle\mathbf{L}\rangle\) is able to stay anti-parallel to \(\mathbf{B}\). In most real solids, the orbital angular momentum is quenched and \(\langle\mathbf{L}\rangle\) is approximately zero in the absence of an applied magnetic field. Applying a \(B\) field induces an \(L\), which is proportional to \(B\) in the linear regime. The proportionality of \(L\) and \(B\) can be seen in our Fe\({}_{15}\) cluster results when \(B\gtrapprox 50\,\)T, although \(L\) becomes larger than expected when \(B\) is small, presumably because the outermost shell of degenerate states is partially filled and can be occupied by electrons in a manner that produces a finite but small orbital angular momentum at very little cost in energy. For the relatively low magnetic field strengths accessible experimentally, the induced orbital angular momentum is small and the orbital EdH effect discussed in this section Figure 4: The time evolution of the expectation values of (a) the orbital and spin angular momenta and (b) the torque as the applied magnetic field rotates in the \(xz\) plane at constant angular velocity. The field strength is \(B=0.5\) T and there is no SOC. The orbital angular momentum remains approximately anti-aligned with \(\mathbf{B}\). The spin is almost completely unable to respond to the rotation of \(\mathbf{B}\) as the Larmor precession period is greater than the simulation duration. The simulation averages of the \(x\) and \(y\) components of the torque are approximately 0; the average of the \(z\) component is non-zero. is weak. The spin angular momentum, by contrast, is non-zero even in the absence of an applied magnetic field because of the exchange interaction. In the presence of SOC, the rotation of the spin moment also applies a torque to the lattice and produces the spin EdH effect discussed below. ### With spin-orbit coupling The results in this section include the effects of SOC, with the SOC parameter \(\xi=0.06\,\mathrm{eV}\) (approximately \(2.2\times 10^{-3}\,\mathrm{a.u.}\)) as is appropriate for iron. Figure 5 shows the results of a simulation with a \(B\) field of 500 T. The spin evolves similarly to the corresponding simulation without SOC (figure 2(a)). The coupling of \(\mathbf{L}\) and \(\mathbf{S}\) has two main effects. The first is that the initial magnitude of \(\langle\mathbf{L}\rangle\) is over twice as large as in the equivalent simulation without SOC. This is because the \(\mathbf{L}\) operator not only has the \(\mathbf{B}\) field acting on it, but is also coupled to the \(\mathbf{S}\) operator, the expectation value of which is large because the exchange interaction is large. We note that a classical spin-orbit term, of the form \(\frac{\xi}{\hbar^{2}}\mathbf{L}\cdot\mathbf{S}\), would encourage \(\mathbf{L}\) and \(\mathbf{S}\) to anti-align (for \(\xi>0\)). However, in our results, the addition of spin-orbit causes the angular momenta \(\mathbf{L}\) and \(\mathbf{S}\) to couple more strongly in alignment with each other. This can be understood as being due to Hund's third rule, which states that the value of \(J\) is found using \(J=|L-S|\) if the shell is less than half full and \(J=|L+S|\) if the shell is more than half full [54]. The Fe\({}_{15}\) cluster considered has 102 electrons occupying the 150 available MOs, thus the shell is over half full, and thus the energy is minimized with \(\langle\mathbf{L}\rangle\) and \(\langle\mathbf{S}\rangle\) in alignment. We were able to verify that Hund's third rule is obeyed by our model in the case in which the shell is less than half full by additional calculations Figure 5: The time evolution of the expectation values of (a) the orbital and spin angular momenta and (b) the torque as the applied magnetic field rotates in the \(xz\) plane at constant angular velocity. The field strength is \(B=500\) T and the simulation includes the effects of SOC. The orbital angular momentum is larger than in the absence of SOC and experiences additional oscillations due to its coupling to \(\mathbf{S}\). The effect of Larmor precession about the \(B\) field is visible in the evolution of the torque. The simulation averages of the \(x\) and \(y\) components of the torque exerted on the nuclei by the electrons are approximately 0; the average of the \(z\) component is non-zero. involving fewer than 75 electrons. In these simulations, the addition of SOC caused \(\mathbf{L}\) and \(\mathbf{S}\) to become anti-aligned, in agreement with Hund's third rule and as would be expected from the classical interpretation of the SOC term. The second effect caused by the addition of SOC is that the oscillations due to the Larmor precession about the \(B\) field, are also visible in the evolution of \(\left\langle\mathbf{L}\right\rangle\). In figure 2(a), the effect of Larmor precession was apparent in the evolution of the spin, yet, the same oscillations did not appear in the evolution of the orbital angular momentum, since the interaction torque is much larger than the magnetic torque in Eq. (28). When SOC is included, the SOC term in Eq. (28) becomes significant, and it is energetically favourable for the orbital angular momentum to remain aligned with the spin, which causes the Larmor precession oscillations to also show in the evolution of \(\left\langle\mathbf{L}\right\rangle\). In the presence of spin-orbit coupling, Eq. (28) gives \[\mathbf{\Gamma}_{\mathrm{int}}=-\frac{d\left\langle\mathbf{L}\right\rangle}{dt}-\frac {\mu_{B}}{\hbar}\left\langle\mathbf{L}\right\rangle\mathbf{\times}\mathbf{B}+\frac{\xi}{i \hbar^{3}}\left\langle\left[\mathbf{L},\mathbf{L}\cdot\mathbf{S}\right]\right\rangle. \tag{37}\] As a result, the Larmor oscillations in \(\left\langle\mathbf{L}\right\rangle\) also influence the torque. When averaged over the duration of the simulation, the introduction of SOC more than doubles the magnitude of the interaction torque, as may be seen by comparing figures 2(b) and 5(b). The precession and SOC terms act in opposite directions and mostly cancel each other out, so the interaction torque remains approximately equal to the \(-\frac{d\left\langle\mathbf{L}\right\rangle}{dt}\) term in Eq. (37). As explained in Sec. 3.1, \(\left\langle\mathbf{L}\right\rangle\) is approximately proportional to \(\mathbf{B}\) when SOC is omitted and \(B\) is small. The spin expectation value, by contrast, is determined primarily by exchange interactions and remains substantial even at \(B=0\). Adding SOC links the spin and orbital angular momenta, allowing the spin to mimic an applied field that polarizes the orbital angular momentum and makes the magnitude of the orbital angular momentum independent of \(B\) at low \(B\). ### Relevance to experiments Although adiabatic simulations at realistic field strengths are impractical, our quasi-adiabatic results allow us to deduce the main qualitative features of the Einstein-de Haas effect on experimental timescales and for experimental field strengths. An experiment with a field strength of \(B=0.5\,\mathrm{T}\) would have a precession timescale of 47,014 a.u., much less than the period of the oscillatory fields used in experiments, which are typically of order \(1\,\mathrm{s}=4.1\times 10^{16}\,\mathrm{a.u.}\) It follows that the experimental time evolution is also quasi-adiabatic and that our quasi-adiabatic simulations access the same physics as the experiment. The spin and orbital angular momentum are both able to follow the rotation of the field and reverse their orientations as the field reverses. This generates a measurable torque on the Fe\({}_{15}\) nuclei. If the Fe\({}_{15}\) cluster were not held in place, this torque would cause it to start rotating. ### Extrapolating the results to low \(B\) field Having established that we are able to carry out simulations in the physically relevant quasi-adiabatic regime, we investigate the trends as the magnitude of \(B\) reduces towards \(1\,\mathrm{T}\) or lower, as used in most experiments. For a sufficiently small \(B\) field, the simulations fail to remain quasi-adiabatic and the results are no longer relevant to experiment. If we suppose that the quasi-adiabatic breakdown occurs when the simulation duration is smaller than the precession timescale, Eq. (30) tells us that breakdown should occur when \(B\lessapprox\frac{2\pi\hbar}{2\mu_{B}T_{f}}=$9.8\,\mathrm{T}$\). For safety's sake, it is best to ignore results calculated with values of \(B\) less than around \(20\) T. In figures 6 and 7, we plot the results of simulations for a wide range of magnetic field strengths from \(B=$250\,\mathrm{T}$\) to \(B=$0\,\mathrm{T}$\), at a fixed simulation duration of \(T_{f}=$150,\!000\,\mathrm{a.u.}$\) For every field strength considered and every simulation, we calculate the simulation averages of all terms appearing on the right-hand sides of the Ehrenfest equations of motion for \(d\left\langle\mathbf{J}\right\rangle/dt\), \(d\left\langle\mathbf{L}\right\rangle/dt\), and \(d\left\langle\mathbf{S}\right\rangle/dt\), Eqs. (27)-(29). Every such term may be interpreted as a torque. Only the \(z\) components are required, as the time-averaged \(x\) and \(y\) components are approximately zero. For an initial time of \(t=$0\,\mathrm{a.u.}$\), and a final simulation time of \(T_{f}\), the simulation average is defined by \[\overline{\Gamma}_{z}=\frac{1}{T_{f}}\int_{0}^{T_{f}}\Gamma_{z}(t^{\prime})dt ^{\prime}, \tag{38}\] where \(\Gamma_{z}(t^{\prime})\) is a time-dependent torque contribution. For simplicity, just as in Secs. 3.1 and 3.2, the results obtained without SOC will be described before the results with SOC. #### 3.4.1 Without spin-orbit coupling Figure 6(a) shows how the simulation-averaged contributions to \(d\left\langle\mathbf{L}\right\rangle/dt\) given in Eq. (28) depend on the magnitude of \(B\) in the absence of SOC. The \(z\) component of the term that arises from the coupling of the orbital dipole to the applied magnetic field is given by \((-\mu_{B}/\hbar)(\left\langle\mathbf{L}\right\rangle\times\mathbf{B})_{z}=(-\mu_{B}/ \hbar)(\left\langle L_{x}\right\rangle B_{y}-B_{x}\left\langle L_{y}\right\rangle)\). Since \(B_{y}=0\) and \(B_{x}<0\) throughout the motion, and since \(\left\langle L_{y}\right\rangle<0\) (see figure 2(a)), the resulting torque points in the \(+\mathbf{\hat{z}}\) direction. The dipole torque is small in magnitude because, in a quasi-adiabatic simulation, \(\left\langle\mathbf{L}\right\rangle\) and \(\mathbf{B}\) remain almost anti-parallel and their cross product is small. The averaged interaction torque applied to the electrons by the nuclei, \(-\overline{\Gamma}_{\text{int},z}\), acts in the opposite direction to the magnetic dipole torque, \(-\frac{\mu_{B}}{\hbar}(\overline{\left\langle\mathbf{L}\right\rangle\times\mathbf{B} })_{z}\). In the absence of SOC, all the torques in figure 6(a) scale linearly with \(B\). \(\left\langle\mathbf{L}\right\rangle\) is small for low \(B\) fields, so very little torque is generated by the electrons on the nuclei for experimentally realistic magnetic field strengths. Figure 6(b) shows the torque contributions affecting the spin in Eq. (29). Since the SOC parameter \(\xi\) is zero, the other two terms, \(\frac{\overline{d\left\langle S_{z}\right\rangle}}{dt}\) and \(-2\frac{\mu_{B}}{\hbar}(\overline{\left\langle\mathbf{S}\right\rangle\times\mathbf{B} })_{z}\) are equal. Thus, the rotation of \(\left\langle\mathbf{S}\right\rangle\) is caused solely by the magnetic dipole coupling of the spin to the field. The averaged torque due to the dipole moment coupling to the magnetic field acts in the \(-\mathbf{\hat{z}}\) direction. This is the opposite sign to the dipole coupling torque of \(\langle\mathbf{L}\rangle\). Figure 6 shows that, without SOC, the relative directions of the dipole coupling torques of \(\langle\mathbf{L}\rangle\) and \(\langle\mathbf{S}\rangle\) are different. The spin magnetic torque contribution, \((-2\mu_{B}/\hbar)(\langle\mathbf{S}\rangle\times\mathbf{B})_{z}=(-2\mu_{B}/\hbar)( \langle S_{x}\rangle\,B_{y}-B_{x}\,\langle S_{y}\rangle)\) has the same direction as \(d\,\langle S_{z}\rangle\,/dt\), and the spin since \(B_{y}=0\), and \(B_{x}<0\) and \(\langle S_{y}\rangle>0\) throughout the motion (which can be seen in figure 2(a)). This causes the net direction of the spin magnetic torque contribution to be in the \(-\mathbf{\hat{z}}\) direction. This difference is caused by the interaction of the electrons with the lattice, which prevents \(\langle\mathbf{L}\rangle\) from precessing as it would if the lattice were absent. Figure 7: The time-averaged torques entering the equations of motions for (a) \(\langle\mathbf{L}\rangle\), (b) \(\langle\mathbf{S}\rangle\), (c) \(\langle\mathbf{J}\rangle\), for a range of \(B\) field strengths and with a fixed simulation duration of \(T_{f}=150{,}000\,\)a.u. The results in this figure are with SOC. Torque values for \(B<100\,\)T are shown with dashed lines to indicate that the data in this region should not be analysed. The third panel in figure 6(c) shows the relative contributions of the torques shown in the previous two panels to the total electronic angular momentum, according to the terms in Eq. (27). Since \(\frac{\overline{d\left\langle S_{z}\right\rangle}}{dt}\) is much greater than any of the averaged torques related to the orbital angular momentum, the spin dominates the change in the total electronic angular momentum. As the large spin contribution to \(\left\langle J_{z}\right\rangle\) is decoupled from the nuclei in the absence of SOC, the average torque experienced by the nuclei, \(\overline{\Gamma}_{\text{int},z}\), is much smaller than \(d\left\langle J_{z}\right\rangle/dt\). At low \(B\), the quasi-adiabatic limit is reached, and the torques reduce rapidly as the spin becomes unable to respond to the rate of rotation of the \(B\) field (as was demonstrated in figures 2-4). #### 3.4.2 With spin-orbit coupling The simulation results with SOC included are shown in figure 7. Figure 7(a) shows the contributions to the torque that affect \(\left\langle L_{z}\right\rangle\), along with the value of \(\overline{d\left\langle L_{z}\right\rangle/dt}\) obtained by summing them. For values of \(B\) large enough to produce quasi-adiabatic results (\(B\gtrapprox 100\,\text{T}\)), the averaged dipole coupling torque and the averaged SOC torque are approximately independent of \(B\). This is because the magnitude of \(\left\langle\mathbf{L}\right\rangle\), which is proportional to \(B\) in the absence of SOC, is now determined primarily by the \(\frac{\xi}{\hbar^{2}}\left\langle\mathbf{L}\cdot\mathbf{S}\right\rangle\) term in the Hamiltonian and no longer rises significantly as \(B\) rises. As far as the orbital angular momentum is concerned, the mean spin \(\left\langle\mathbf{S}\right\rangle\), which is finite even when the applied magnetic field is zero, acts like a large magnetic field. The averaged interaction torque increases with increasing \(B\), which leads to an increase in the overall orbital torque on the electrons, \(\frac{\overline{d\left\langle L_{z}\right\rangle}}{dt}\). For values of \(B<100\) T, the breakdown of quasi-adiabaticity is apparent, leading to a gradual increase in the magnitudes of the torques due to the SOC and orbital moment terms, and then a rapid decrease in all torques as \(B\) becomes so small that the angular momenta are no longer able to follow as it changes direction. Several qualitative differences are apparent when comparing figure 7(a) to its equivalent without SOC, figure 6(a). The SOC torque contribution, shown in red, is of course non-zero only when the SOC parameter \(\xi\) is non-zero. In addition, the orbital-magnetic torque term \((-\mu_{B}/\hbar)(\left\langle\mathbf{L}\right\rangle\times\mathbf{B})_{z}\) is reversed in direction in figure 7(a) in comparison to figure 6(a), and points in the same direction as the spin-magnetic torque term, \((-2\mu_{B}/\hbar)(\left\langle\mathbf{S}\right\rangle\times\mathbf{B})_{z}\), when SOC is included. This can be understood as being due to SOC ensuring that \(\left\langle\mathbf{L}\right\rangle\) and \(\left\langle\mathbf{S}\right\rangle\) are more closely aligned, which changes the sign of \(\left\langle L_{y}\right\rangle\) (which can be seen by comparing figures 2(a) and 5(a)). In the presence of SOC, the torque on the nuclei due to the electrons, \(-\overline{\Gamma}_{\text{int},z}\), is many times larger than in its absence. For example, at \(B=100\,\text{T}\), the difference is a factor of approximately 15. In the presence of SOC, the magnitude of \(\left\langle\mathbf{L}\right\rangle\) is much larger due to its coupling to \(\left\langle\mathbf{S}\right\rangle\), which is large due to Stoner exchange. As a result, the terms in figure 7(a) can be large for small \(B\), which causes a large \(-\Gamma_{\text{int},z}\) even for small \(B\). This allows for a torque on the nuclei due to the electrons to be observable for experimentally realistic \(B\) field strengths. Now, since \(\left\langle\mathbf{L}\right\rangle\) is locked to \(\left\langle\mathbf{S}\right\rangle\) by the SOC and has a non-zero value even when \(B=0\), both \(\left\langle\mathbf{L}\right\rangle\) and \(\left\langle\mathbf{S}\right\rangle\) behave paramagnetically. Figure 7(b) shows the averaged torque contributions in the spin equation of motion. With SOC included, the average magnitude of \(\frac{d\langle S_{z}\rangle}{dt}\) is approximately the same as it is in the absence of SOC. The SOC term is non-zero and takes the same sign as the magnetic dipole contribution to the change in spin angular momentum. Figure 7(c) shows the averaged torques from Eq. (27). Comparing figures 6(c) and 7(c), we see that the averaged torque on the electrons due to the externally applied field, \((\overline{\langle\mathbf{\mu}\rangle\times\mathbf{B}})_{z}\), is approximately the same with and without SOC. By contrast the torque on the electrons due to the nuclei, \(-\overline{\Gamma}_{\text{int},z}\) is greatly enhanced in the presence of SOC, in particular at low magnetic field strengths. Since the interaction torque, \(-\overline{\Gamma}_{\text{int},z}\), is the torque acting on the nuclei due to the spin-lattice interaction, it can be thought of as the torque that enacts the Einstein-de Haas effect. As a result, figures 6(c) and 7(c) show that the Einstein-de Haas effect would not be observed for low magnetic field strengths if SOC was not present, and that the spin-lattice torque is significant at low field strength when SOC is included. Since \(\frac{d\langle J_{z}\rangle}{dt}\) is the sum of the averaged torque on the electrons due to the external magnetic field and due to the nuclei, it is also increased in the presence of SOC. This makes sense when comparing the magnitudes of \(\langle\mathbf{L}\rangle\) and \(\langle\mathbf{S}\rangle\) at \(t=0\) a.u. in figures 2(a) and 5(a), in which we see \(\langle\mathbf{S}\rangle\left(t=0\right)\) is approximately the same in both cases, while \(\langle\mathbf{L}\rangle\left(t=0\right)\) is enhanced in the presence of SOC, implying that a greater net change in total electronic angular momentum is required to reverse the sign of \(\langle\mathbf{J}\rangle\) since the average torque over the duration of the simulation is given by \(-2\,\langle\mathbf{J}\rangle\left(t=0\right)/T_{f}\). Figure 7(c) shows that when the orbital and spin contributions to the torque are summed, it is clear that the torque on the Fe\({}_{15}\) cluster, \(\Gamma_{\text{int},z}\), is a fraction of the torque exerted on the system by the externally applied \(B\) field. ## 4 Conclusions This work set out to investigate the quantum mechanical origins of the Einstein-de Haas effect in a Fe\({}_{15}\) cluster from first principles, by means of simulation using a non-collinear TB model. It was shown that in a slowly rotating \(B\) field, orbital and spin angular momenta can reverse their orientations, leading to a measurable torque on the cluster. Despite the computational challenge of reaching physically realistic timescales for the simulation, the qualitative features of the evolution can be extrapolated by use of the adiabatic theorem. However, the net transfer of angular momentum to the iron is a non-adiabatic process. By analysing the trends of the torque contributions as \(B\) becomes small, it has been verified that SOC greatly enhances the interaction torque on the Fe\({}_{15}\) cluster due to coupling to the Stoner exchange-induced spin moment. The enhancement due to SOC is especially pronounced for low magnetic field strengths. This work demonstrated a quantum mechanical model capable of simulating the Einstein-de Haas effect in a ferromagnetic cluster and revealed the physical mechanisms which drive the timescales causing this effect. The tight-binding model employed in this work is not gauge invariant, thus a significant improvement would be to use London Orbitals [55] to remove any arbitrariness arising from the choice of gauge. Experimentally, it would be valuable to visualize the rotation of the spin of a single ferromagnetic domain in order to confirm or deny whether the spin passes through \(\langle\mathbf{S}\rangle=\mathbf{0}\), or whether it follows a path closer to a rotation through an arc of a circle. One speculative application of this work is that the tight binding model may be used to derive a macroscopic description of spin-lattice coupling effects using the formalism of molecular dynamics, which would make the spin-lattice dynamics of much larger systems tractable and relevant to engineering and industrial applications. This work was supported through a studentship in the Centre for Doctoral Training on Theory and Simulation of Materials at Imperial College London, funded by EPSRC grant EP/L015579/1. This work has been carried out within the framework of the EUROfusion Consortium, funded by the European Union via the Euratom Research and Training Programme (Grant Agreement No 101052200 -- EUROfusion) and was partially supported by the Broader Approach Phase II agreement under the PA of IFERC2-T2PA02. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Commission. Neither the European Union nor the European Commission can be held responsible for them. We acknowledge support from the Thomas Young Centre under grant TYC-101 and the RCUK Energy Programme Grant No. EP/W006839/1. ## Appendix A The Adiabatic Theorem specialized to the Einstein-de Haas Effect This appendix shows how the adiabatic theorem may be manipulated into a form which enables the timescales for transitions between diabatic and adiabatic behaviour to be calculated. A variety of proofs of the adiabatic theorem exist in the literature [56, 57, 58], here we follow the approach of Griffiths [59]. Instantaneous eigenstates of the time-evolving Hamiltonian are defined by, \[H(t,\mathbf{m}_{a}(t))\ket{\psi_{n}(t)}=E_{n}(t)\ket{\psi_{n}(t)}\;\;n=1,2,\ldots \tag{12}\] These eigenstates are not solutions of the time-dependent Schrodinger equation in general. For a solution of the Schrodinger equation, \(\ket{\Psi(t)}\), consider a wavefunction which begins its evolution at \(t=0\) in an energy eigenstate, \[\ket{\Psi(0)}=\ket{\psi_{m}(0)}. \tag{13}\] Expanding the wavefunction as a linear superposition of instantaneous energy eigenstates gives, \[\left|\Psi(t)\right\rangle=\sum_{n}c_{n}(t)\left|\psi_{n}(t)\right\rangle. \tag{10}\] Substituting this into the Schrodinger equation, and left-multiplying by \(\left\langle\psi_{m}(t)\right|\) yields \[i\hbar\dot{c}_{m}=\bigg{(}E_{m}(t)-i\hbar\left\langle\psi_{m}|\dot{\psi}_{m} \right\rangle\bigg{)}c_{m}-i\hbar\sum_{n\neq m}\left\langle\psi_{m}|\dot{\psi} _{n}\right\rangle c_{n}. \tag{11}\] Taking the time derivative of the instantaneous eigenstates as defined in Eq. (10) informs us that for \(m\neq n\) \[\left\langle\psi_{m}|\dot{\psi}_{n}(t)\right\rangle=\frac{(\dot{H})_{mn}}{E_{n }-E_{m}}, \tag{12}\] where \((\dot{H})_{mn}=\left\langle\psi_{m}|\dot{H}|\psi_{n}\right\rangle\). Thus, Eq. (11) can be rewritten as \[i\hbar\dot{c}_{m}=\bigg{(}E_{m}(t)-i\hbar\left\langle\psi_{m}|\dot{\psi}_{m} \right\rangle\bigg{)}c_{m}-i\hbar\sum_{n\neq m}\frac{(\dot{H})_{mn}}{E_{n}-E_ {m}}c_{n}. \tag{13}\] For the system to remain in the ground state throughout the evolution, the coupling term must be small in order for the expansion coefficients of higher instantaneous energy eigenstates not to become significant. Thus the criterion for the quantum adiabatic approximation which must be satisfied for the system to remain adiabatic is: \[\left|\frac{(\dot{H})_{mn}}{E_{n}-E_{m}}\right|\ll 1\qquad\forall\ n\neq m. \tag{14}\] The couplings can be grouped depending on the magnitude of the splitting \(|E_{n}-E_{m}|\). The smallest differences in energy come from states which are split by \(-\mathbf{\mu}\cdot\mathbf{B}\), which yields the condition \[T_{f}>\frac{2\pi\hbar}{\Delta E_{-\mathbf{\mu}\cdot\mathbf{B}}}, \tag{15}\] where \(T_{f}\) is the duration of the simulation. SOC causes larger energy level splittings, with an associated timescale given by \[T_{f}>\frac{2\pi\hbar}{\Delta E_{SOC}}. \tag{16}\] The largest energy splittings in the Hamiltonian are due to \(H_{0}\), which lead to a separate timescale, \[T_{f}>\frac{2\pi\hbar}{\Delta E_{H_{0}}}. \tag{17}\]

2303.16129

Unleashing the Power of Edge-Cloud Generative AI in Mobile Networks: A Survey of AIGC Services

Artificial Intelligence-Generated Content (AIGC) is an automated method for generating, manipulating, and modifying valuable and diverse data using AI algorithms creatively. This survey paper focuses on the deployment of AIGC applications, e.g., ChatGPT and Dall-E, at mobile edge networks, namely mobile AIGC networks, that provide personalized and customized AIGC services in real time while maintaining user privacy. We begin by introducing the background and fundamentals of generative models and the lifecycle of AIGC services at mobile AIGC networks, which includes data collection, training, finetuning, inference, and product management. We then discuss the collaborative cloud-edge-mobile infrastructure and technologies required to support AIGC services and enable users to access AIGC at mobile edge networks. Furthermore, we explore AIGCdriven creative applications and use cases for mobile AIGC networks. Additionally, we discuss the implementation, security, and privacy challenges of deploying mobile AIGC networks. Finally, we highlight some future research directions and open issues for the full realization of mobile AIGC networks.

Minrui Xu, Hongyang Du, Dusit Niyato, Jiawen Kang, Zehui Xiong, Shiwen Mao, Zhu Han, Abbas Jamalipour, Dong In Kim, Xuemin Shen, Victor C. M. Leung, H. Vincent Poor

2023-03-28T16:52:05Z

http://arxiv.org/abs/2303.16129v4

# Unleashing the Power of Edge-Cloud Generative AI in Mobile Networks: A Survey of AIGC Services ###### Abstract Artificial Intelligence-Generated Content (AIGC) is an automated method for generating, manipulating, and modifying valuable and diverse data using AI algorithms creatively. This survey paper focuses on the deployment of AIGC applications, e.g., ChatGFPT and Dall-E, at mobile edge networks, namely mobile AIGC networks, that provide personalized and customized AIGC services in real time while maintaining user privacy. We begin by introducing the background and fundamentals of generative models and the lifecycle of AIGC services at mobile AIGC networks, which includes data collection, training, fine-tuning, inference, and product management. We then discuss the collaborative cloud-edge-mobile infrastructure and technologies required to support AIGC services and enable users to access AIGC at mobile edge networks. Furthermore, we explore AIGC-driven creative applications and use cases for mobile AIGC networks. Additionally, we discuss the implementation, security, and privacy challenges of deploying mobile AIGC networks. Finally, we highlight some future research directions and open issues for the full realization of mobile AIGC networks. AIGC, Generative AI, Mobile edge networks, Communication and Networking, AI training and inference, Internet technology ## I Introduction ### _Background_ In recent years, artificial intelligence-generated content (AIGC) has emerged as a novel approach to the production, manipulation, and modification of data. By utilizing AI technologies, AIGC automates content generation alongside traditionally professionally-generated content (PGC) and user-generated content (UGC) [1, 2, 3]. With the marginal cost of data creation reduced to nearly zero, AIGC, e.g., ChatGPT, promises to supply a vast amount of synthetic data for AI development and the digital economy, offering significant productivity and economic value to society. The rapid growth of AIGC capabilities is driven by the continuous advancements in AI technology, particularly in the areas of large-scale and multimodal models [4, 5]. A prime example of this progress is the development of DALL-E [6], an AI system based Fig. 1: The overview of mobile AIGC networks, including the cloud layer, the edge layer, and the D2D mobile layer. The lifecycle of AIGC services, including data collection, pre-training, fine-tuning, inference, and product management, is circulated among the core networks and edge networks. on OpenAI's state-of-the-art GPT-3 language model, which consists of 175 billion parameters and is designed to generate images by predicting successive pixels. In its latest iteration, DALL-E2 [7], a diffusion model is employed to reduce noise generated during the training process, leading to more refined and novel image generation. In the context of text-to-image generation using AIGC models, the language model serves as a guide, enhancing semantic coherence between the input prompt and the resulting image. Simultaneously, the AIGC model processes existing image attributes and components, generating limitless synthesis images from existing datasets. Based on large-scale pre-trained models with billions of parameters, AIGC services are designed to enhance knowledge and creative work fields that employ billions of people. By leveraging generative AI, these fields can achieve at least a 10% increase in efficiency for content creation, potentially generating trillions of dollars in economic value [8]. AIGC can be applied to various forms of text generation, ranging from practical applications, such as customer service inquiries and messages, to creative tasks like activity tracking and marketing copywriting [9]. For example, OpenAI's ChatGPT [10] can automate the generation of socially valuable content based on user-provided prompts. Through extended and coherent conversations with ChatGPT, individuals from diverse professions from all walks of life, can seek assistance in debugging code, discovering healthy recipes, writing scripts, and devising marketing campaigns. In the realm of image generation, AIGC models can process existing images according to their attributes and components, enabling end-to-end image synthesis, such as generating complete images directly from existing ones [7]. Moreover, AIGC models hold immense potential for cross-modal generation, as they can spatially process existing video attributes and simultaneously process multiple video clips automatically [11]. The benefits of AIGC in content creation, when compared to PGC and UGC, are already apparent to the public. Specifically, generative AI models can produce high-quality content within seconds and deliver personalized content tailored to users' needs [2]. Over time, the performance of AIGC has significantly improved, driven by enhanced models, increased data availability, and greater computational power [12]. On one hand, superior models [4], such as diffusion models, have been developed to provide more robust tools for cross-modal AIGC generation. These advancements are attributed to the foundational research in generative AI models and the continuous refinement of learning paradigms and network structures within generative deep neural networks (DNNs). On the other hand, data and computing power for generative AI training and inference have become more accessible as networks grow increasingly interconnected [9, 13]. For instance, AIGC models that require thousands of GPUs can be trained and executed in cloud data centers, enabling users to submit frequent data generation requests over core networks. ### _Motivation_ Although AIGC is acknowledged for its potential to revolutionize existing production processes, users accessing AIGC services on mobile devices currently lack support for interactive and resource-intensive data generation services [14, 25]. Initially, the robust computing capabilities of cloud data centers can be utilized to train AIGC pre-training models, such as GPT-3 for ChatGPT and GPT-4 for ChatGPT Plus. Subsequently, users can access cloud-based AIGC services via the core network by executing AIGC models on cloud servers. However, due to their remote nature, cloud services exhibit high latency. Consequently, deploying interaction-intensive AIGC services on mobile edge networks, i.e., mobile AIGC networks, as shown in Fig. 1, should be considered a more practical option [26, 27, 28]. In detail, the motivations for developing mobile AIGC networks include * _Low-latency:_ Instead of directing requests for AIGC services to cloud servers within the core network, users can access low-latency services in mobile AIGC networks [29]. For example, users can obtain AIGC services directly in radio access networks (RANs) by downloading pre-trained models to edge servers and mobile devices for fine-tuning and inference, thereby supporting real-time, interactive AIGC. * _Localization and Mobility:_ In mobile AIGC networks, base stations with computing servers at the network's edge can fine-tune pre-trained models by localizing service requests [30, 31]. Furthermore, users' locations can serve as input for AIGC fine-tuning and inference, addressing specific geographical demands. Additionally, user mobility can be integrated into the AIGC service provisioning process, enabling dynamic and reliable AIGC service provisioning. * _Customization and Personalization:_ Local edge servers can adapt to local user requirements and allow users to request personalized services based on their preferences while providing customized services according to local service environments. On one hand, edge servers can tailor AIGC services to the needs of the local user community by fine-tuning them accordingly [2]. On the other hand, users can request personalized services from edge servers by specifying their preferences. * _Privacy and Security:_ AIGC users only need to submit service requests to edge servers, rather than sending preferences to cloud servers within the core network. Therefore, the privacy and security of AIGC users can be preserved during the provisioning, including fine-tuning and inference, of AIGC services. As illustrated in Fig. 1, when users access AIGC services on mobile edge networks through edge servers and mobile devices, limited computing, communication, and storage resources pose challenges for delivering interactive and resource-intensive AIGC services. First, resource allocation on edge servers must balance the tradeoff among accuracy, latency, and energy consumption of AIGC services at edge servers. In addition, computationally intensive AIGC tasks can be offloaded from mobile devices to edge servers, improving inference latency and service reliability. Moreover, AI models that generate content can be cached in edge networks, similar to content delivery networks (CDNs) [32, 33], to minimize delays in accessing the model. Finally, mobility management and incentive mechanisms should be explored to encourage user participation in both space and time. Compared to traditional AI, AIGC technology requires overall technical maturity, transparency, robustness, impartiality, and insightfulness of the algorithm for effective application implementation. From a sustainability perspective, AIGC can use both existing and synthetic datasets as raw materials for generating new data. However, when biased data are used as raw data, these biases persist in the knowledge of the model, which inevitably leads to unfair results of the algorithm. Finally, static AIGC models rely primarily on templates to generate machine-generated content that may have similar text and output structures. ### _Related Works and Contributions_ In this survey, we provide an overview of research activities related to AIGC and mobile edge intelligence, as illustrated in Fig. 2. Given the increasing interest in AIGC, several surveys on related topics have recently been published. Table I presents a comparison of these surveys with this paper. The study in [34] provides a comprehensive overview of the current AIGC models published by researchers and the industry. The authors identify nine categories summarizing the evolution of generative AI models, including text-to-text, text-to-image, text-to-audio, text-to-video, text-to-3D, text-to-code, text-to-science, image-to-text, and other models. In addition, they reveal that only six organizations with enormous computing power and highly skilled and experienced teams can deploy these state-of-the-art models, which is even fewer than the number of categories. Following the taxonomy of generative AI models developed in [34], other surveys discuss generative AI models in detail subsequently. The study in [9] examines existing methods for generating text and detecting models. The study in [18] provides a comprehensive overview of the major approaches, datasets, and evaluation metrics \begin{table} \begin{tabular}{|c|c|l|c|c|} \hline Year & Ref. & Contributions & AIGC & AIGC & Edge \\ \hline 2019 & [14] & Introduce mobile edge intelligence, and discuss the infrastructure, implementation methodologies, and use cases & ✗ & ✗ & ✓ \\ \hline \multirow{2}{*}{2020} & [15] & Present the implementation challenges of federated learning at mobile edge networks & ✓ & ✗ & ✓ \\ \cline{2-5} & [12] & Discuss the visions, implementation details, and applications of the convergence of edge computing and DL & ✓ & ✗ & ✓ \\ \hline \multirow{4}{*}{2021} & [16] & Investigate the copyright laws regarding AI-generated music & ✓ & ✓ & ✗ \\ \cline{2-5} & [1] & Illustrate the interaction of art and AI from two perspectives, i.e., AI for art analysis and AI for art creation & ✗ & ✓ & ✗ \\ \cline{2-5} & [2] & Discuss the application of computational arts in Metaverse to create surrealistic cyberspace & ✓ & ✓ & ✗ \\ \cline{2-5} & [17] & Investigate the deployment of distributed learning in wireless networks & ✗ & ✗ & ✓ \\ \cline{2-5} & [18] & Provide a comprehensive overview of the major approaches, datasets, and metrics used to synthesize and process multimodal images & ✓ & ✓ & ✗ \\ \hline \multirow{4}{*}{2022} & [19] & Propose a novel conceptual architecture for 6G networks, which consists of holistic network virtualization and pervasive network intelligence & ✗ & ✗ & ✓ \\ \hline \multirow{4}{*}{2022} & [20] & Discusses the visions and potentials of low-power, low-latency, reliable, and trustworthy edge intelligence for 6G wireless networks & ✗ & ✗ & ✓ \\ \cline{2-5} & [4] & Provide comprehensive guidance and comparison among advanced generative models, including GAN, energy-based models, VAE, autoregressive models, flow-based models, and diffusion models & ✓ & ✗ & ✗ \\ \cline{2-5} & [21] & Present fundamental algorithms, classification and applications of diffusion models & ✓ & ✗ & ✗ \\ \cline{2-5} & [9] & Provide a comprehensive overview of generation and detection methods for machine-generated text & ✓ & ✓ & ✗ \\ \cline{2-5} & [22] & Provide a comprehensive examination of what, why, and how edge intelligence and blockchain can be integrated & ✗ & ✗ & ✓ \\ \cline{2-5} & [23] & Introduce the architecture of edge-enabled Metaverse and discuss enabling technologies in communication, computing, and blockchain & ✗ & ✓ & ✓ \\ \hline \multirow{2}{*}{2023} & [24] & Summarize existing works on the generation of gestures with simultaneous speeches based on deep generative models & ✓ & ✓ & ✗ \\ \cline{2-5} & \multirow{4}{*}{Ours} & Investigate the deployment of mobile AIGC networks via collaborative cloud-edge-mobile infrastructure, discuss creative mobile applications and exemplary use cases, and identify existing implementation challenges & ✓ & ✓ & ✓ \\ \cline{1-1} \cline{3-5} & & & & & \\ \hline \end{tabular} \end{table} TABLE I: Summary of related works versus our survey. for multimodal image synthesis and processing. Based on techniques of speech and image synthesis, the study in [24] summarizes existing works on the generation of gestures with simultaneous speeches based on deep generative models. The study in [16] investigates the copyright laws regarding AI-generated music, which includes the complicated interactions among AI tools, developers, users, and the public domain. The study in [4] provides comprehensive guidance and comparison among advanced generative models, including GANs, energy-based models, variational autoencoder (VAE), autoregressive models, flow-based models, and diffusion models. As diffusion models draw tremendous attention in generating creative data, the study in [21] presents fundamental algorithms and comprehensive classification for diffusion models. Based on these algorithms, the authors [1] illustrate the interaction of art and AI from two perspectives, i.e., AI for art analysis and AI for art creation. In addition, the authors in [2] discuss the application of computational arts in the Metaverse to create unrealistic cyberspace. In 6G [19], mobile edge intelligence based on edge computing systems, including edge caching, edge computing, and edge intelligence, for intelligent mobile networks, is introduced in [14]. The study in [17] investigates the deployment of distributed learning in wireless networks. The study [15] provides a guide to federated learning and a comprehensive overview of implementing Federated Learning (FL) at mobile Fig. 2: The development roadmap of AIGC and mobile edge networks from 2013 to Jan 2023. From the perspective of AIGC technology development, AIGC has evolved from generating text and audio to generating 3D content. From the perspective of mobile edge computing, computing has gradually shifted from cloud data centers to D2D mobile computing. edge networks. The authors offer a detailed analysis of the challenges of implementing FL, including communication costs, resource allocation, privacy, and security. In [12], various application scenarios and technologies for edge intelligence and intelligent edges are presented and discussed in detail. In addition, the study [20] discusses the visions and potentials of low-power, low-latency, reliable, and trustworthy edge intelligence for 6G wireless networks. The study [22] explores how blockchain technologies can be used to enable edge intelligence and how edge intelligence can support the deployment of blockchain at mobile edge networks. The authors provide a comprehensive review of blockchain-driven edge intelligence, edge intelligence-amicable blockchain, and their implementation at mobile edge networks. We also [23] provide a vision of realizing the Metaverse at mobile edge networks. In detail, enabling technologies and challenges are discussed, including communication and networking, computing, and blockchain. Distinct from existing surveys and tutorials, our survey concentrates on the deployment of mobile AIGC networks for real-time and privacy-preserving AIGC service provisioning. We introduce the current development of AIGC and collaborative infrastructure in mobile edge networks. Subsequently, we present the technologies of deep generative models and the workflow of provisioning AIGC services within mobile AIGC networks. Additionally, we showcase creative applications and several exemplary use cases. Furthermore, we identify implementation challenges, ranging from resource allocation to security and privacy, for the deployment of mobile AIGC networks. The _contributions of our survey_ are as follows. Fig. 3: The outline of this survey, where we introduce the provisioning of AIGC services at mobile edge networks and highlight some essential implementation challenges about mobile edge networks for provisioning AIGC services. * We initially offer a tutorial that establishes the definition, lifecycle, models, and metrics of AIGC services. Then, we propose the mobile AIGC networks, i.e., provisioning AIGC services at mobile edge networks with collaborative mobile-edge-cloud communication, computing, and storage infrastructure. * We present several use cases in mobile AIGC networks, encompassing creative AIGC applications for text, images, video, and 3D content generation. We summarize the advantages of constructing mobile AIGC networks based on these use cases. * We identify crucial implementation challenges in the path to realizing mobile AIGC networks. The implementation challenges of mobile AIGC networks stem not only from dynamic channel conditions but also from the presence of meaningless content, insecure content precepts, and privacy leaks in AIGC services. * Lastly, we discuss future research directions and open issues from the perspectives of networking and computing, machine learning (ML), and practical implementation considerations, respectively. As the outline illustrated in Fig. 3, the survey is organized as follows. Section II examines the background and fundamentals of AIGC. Section III presents the technologies and collaborative infrastructure of mobile AIGC networks. The applications and advantages of mobile AIGC networks are discussed in Section IV, and potential use cases are shown in Section V. Section VI addresses the implementation challenges. Section VII explores future research directions. Section VIII provides the conclusions. ## II Background and Fundamentals of AIGC In this section, the background and fundamentals of AIGC technology are presented in this section. Specifically, we examine the definition of AIGC, its classification, and the technological lifecycle of AIGC in mobile networks. Finally, we introduce ChatGPT as a use case, which is the most famous and revolutionary application of AIGC. ### _Definitions of PGC, UGC, and AIGC_ In the next generation of the Internet, i.e. Web 3.0 and Metaverse [35], there are three primary forms of content [1], including PGC, UGC, and AIGC. #### Ii-A1 Professionally-generated Content PGC refers to professional-generated digital content [36]. Here, the generators are individuals or organizations with professional skills, knowledge, and experience in a particular field, e.g., journalists, editors, and designers. As these experts who create PGC are typically efficient and use specialized tools, PGC has the advantages in terms of _automation_ and _multimodality_. However, because PGC is purposeful, the _diversity_ and _creativity_ of PGC can be limited. #### Ii-A2 User-generated Content UGC refers to digital material generated by users, rather than by experts or organizations [37]. The users include website visitors and social media users. UGC can be presented in any format, including text, photos, video, and audio. The barrier for users to creating UGC is being lowered. For example, some websites1 allow users to create images with a high degree of freedom on a pixel-by-pixel basis. As a result, UGC is more _creative_ and _diverse_, thanks to a wide user base. However, UGC is less _automated_ and less _multimodal_ than the PGC that is generated by experts. Footnote 1: Example of a website that allows users to create their own UGC: [https://ugc-nf.io/Home](https://ugc-nf.io/Home) #### Ii-A3 AIGc AIGC is generated by using generative AI models according to input from users. Because AI models can learn the features and patterns of input data from the human artistic mind, they can develop a wide range of content. The recent success of text-to-image applications based on the diffusion model [38] and the ChatGPT based on transformer [10] has led to AIGC gaining a lot of attention. We have defined the AIGC according to its characteristics as follows * Automatic: AIGC is generated by AI models automatically. After the AI model has been trained, users only need to provide input, such as the task description, to efficiently obtain the generated content. The process, from input to output, does not require user involvement and is done automatically by the AI models. * Creativity: AIGC refers to an idea or item that is innovative. For example, AIGC is believed to be leading to the development of a new profession, called Prompt Engineer [39], which aims to improve human interaction with AI. In this context, the prompt serves as the starting point for the AI model, and it significantly impacts the originality and quality of the generated content. A well-crafted prompt that is precise and specific results in more relevant and creative content than a vague or general prompt. * Multimodal: The AI models to generate AIGC can handle multimodal input and output. For example, ChatGPT [10] allows conversational services that employ text as input and output, DALL-E 2 [40] can create original, realistic images from a text description, and AIGC services with voice and 3D models as input or output are progressing [41]. * Diverse: AIGC is diverse in service personalization and customization. On the one hand, users can adjust the input to the AI model to suit their preferences and needs, resulting in a personalized output. On the other hand, AI models are trained to provide diverse outputs. For example, consider the DALL-E 2 as an example, the model can generate images of individuals that more correctly represent the diversity of the global population, even with the same text input. * Extendedly valuable: AIGC should be extendedly valuable to society, economics, and humanity [42]. For example, AI models can be trained to write medical reports and interpret medical images, enabling healthcare personnel to make accurate diagnoses. AIGC provides various advantages over PGC and UGC, including better efficiency, originality, diversity, and flexibility. The reason is that AI models can produce vast amounts of material quickly and develop original content based on established patterns and principles. These advantages have led to the growing creative applications of the AIGC models, which are discussed in Section IV-A1. ### _Serving ChatGPT at Mobile Edge Networks_ ChatGPT, developed by OpenAI, excels at generating human-like text and engaging in conversations [10]. Based on the GPT-3 [43], this transformer-based neural network model can produce remarkably coherent and contextually appropriate text. Among its primary advantages, ChatGPT is capable of answering questions, providing explanations, and assisting with various tasks in a manner nearly indistinguishable from human responses. As illustrated in Fig. 4, the development of ChatGPT involves four main stages, including pre-training, fine-tuning, inference, and product management. #### Iv-B1 Pre-training In the initial stage, known as pre-training, the foundation model of ChatGPT, GPT-3, is trained on a large corpus of text, which includes books, articles, and other information sources. This process enables the model to acquire knowledge of language patterns and structures, as well as the relationships between words and phrases. The base model, GPT-3, is an autoregressive language model with a Transformer architecture that has 175 billion parameters, making it one of the largest language models available. During pre-training, GPT-3 is fed with a large corpus of text from diverse sources, such as books, articles, and websites for self-supervised learning, where the model learns to predict the next word in a sentence given the context. To train the foundation model, the technique used is called maximum likelihood estimation, where the model aims to maximize the probability of predicting the next word correctly. Training GPT-3 demands significant computational resources and time, typically involving specialized hardware like graphics processing units (GPUs) or tensor processing units (TPUs). The exact resources and time required to depend on factors such as model size, dataset size, and optimization techniques. #### Iv-B2 Fine-tuning The fine-tuning stage of ChatGPT involves adapting the model to a specific task or domain, such as customer service or technical support, in order to enhance its accuracy and relevance for that task. To transform ChatGPT into a conversational AI, a supervised learning process is employed using a dataset containing dialogues between humans and AI models [44]. To optimize ChatGPT's parameters, a reward model for reinforcement learning is built by ranking multiple model responses by quality. Alternative completions are ranked by AI trainers, and the model uses these rankings to improve its performance through several iterations of Proximal Policy Optimization [45]. This technique allows ChatGPT to learn from its mistakes and improve its responses over time. #### Iv-B3 Inference In the inference stage, ChatGPT generates text based on a given input or prompt, testing the model's ability to produce coherent and contextually appropriate responses relevant to the input. ChatGPT generates responses by leveraging the knowledge it acquired during pre-training and fine-tuning, analyzing the context of the input to generate relevant and coherent responses. In-context learning involves analyzing the entire context of the input [46], including the dialogue history and user profile, to generate responses that are personalized and tailored to the user's needs. ChatGPT employs chain-of-thought to generate responses that are coherent and logical, ensuring that the generated text is not only contextually appropriate but also follows a logical flow. The resources consumed during inference are typically much lower than those required for training, making real-time applications and services based on ChatGPT computationally feasible. #### Iv-B4 Product Management The final product management phase involves deploying the model in a production environment and ensuring its smooth and efficient operation. In the context of mobile edge networks, the applications of AI-powered tools such as the new Bing [47] and Office 365 Copilot [48] could be particularly useful due to their ability to provide personalized and contextually appropriate responses while conserving resources. The new Bing offers a new type of search experience with AI-powered features such as detailed replies to complex questions, summarized answers, and personalized responses to follow-up questions, while Office 365 Copilot, powered by GPT-4 from OpenAI, provides assistance with generating documents, emails, presentations, and other tasks in Microsoft 365 apps and services. These tools can be integrated into mobile edge networks with specialized techniques that balance performance and accuracy while preserving data integrity. * New bing: The new Bing offers a set of AI-powered features that provide a new type of search experience, including detailed replies to complex questions, summarized answers, and personalized responses to follow-up questions. Bing also offers creative tools such as assistance with writing poems and stories. In the context of mobile edge networks, Bing's ability to consolidate reliable sources across the web and provide a single, summarized answer could be particularly useful for users with limited resources. Additionally, Bing's ability to generate personalized responses based on user behavior and preferences could improve the experience of users in mobile edge networks. * Office 365 copilot: Microsoft has recently launched an AI-powered assistant named Office 365 Copilot, which can be summoned from the sidebar of Microsoft 365 apps Fig. 4: The four development stages of ChatGPT, including pre-training, fine-tuning, inference, and product management. and services. Copilot can help users generate documents, emails, and presentations, as well as provide assistance with features such as PivotTables in Excel. It can also transcribe meetings, remind users of missed items, and provide summaries of action items. However, when deploying Copilot in mobile edge networks, it is important to keep in mind the limited resources of these devices and to develop specialized techniques that can balance performance and accuracy while preserving data integrity. In addition to the previously mentioned commercial applications, ChatGPT holds substantial commercial potential owing to its capacity for producing human-like text, which is characteristically coherent, pertinent, and contextually fitting. This language model can be fine-tuned to accommodate a diverse array of tasks and domains, rendering it highly adaptable for numerous applications. ChatGPT exhibits remarkable proficiency in comprehending and generating text across multiple languages. Consequently, it can facilitate various undertakings, such as composing emails, developing code, generating the content, and offering explanations, ultimately leading to enhanced productivity. By automating an assortment of tasks and augmenting human capabilities, ChatGPT contributes to a paradigm shift in the nature of human work, fostering new opportunities and revolutionizing industries. In addition to ChatGPT, more use cases developed by various generative AI models are discussed in Section V. ### _Life-cycle of AIGC at Mobile Edge Networks_ AIGC has gained tremendous attention as a technology superior to PGC and UGC. However, the lifecycle of the AIGC is also more elaborate. In the following, we discuss the AIGC lifecycle with mobile edge network enablement: #### Iv-C1 Data Collection Data collection is an integral component of AIGC and plays a significant role in defining the quality and diversity of the material created by AI systems [49]. The data used to train AI models influences the patterns and relationships that the AI models learn and, consequently, the output. There are several data collection techniques for AIGC: * Crowdsourcing: Crowdsourcing is the process of acquiring information from a large number of individuals, generally via the use of online platforms [50]. Crowdsourced data may be used to train ML models for text and image generation, among other applications. One common example is the use of Amazon Mechanical Turk2, where individuals are paid to perform tasks such as annotating text or images, which can then be used to train AIGC models. Footnote 2: The website of Amazon Mechanical Turk as a crowdsourcing marketplace: [https://www.mturk.com/](https://www.mturk.com/) 3 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 4 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 5 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 6 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 7 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 8 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 9 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 10 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 11 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 12 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 13 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 14 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 15 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 16 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 17 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 18 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 19 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 19 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 21 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 22 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 23 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 24 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 25 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 26 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 27 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 28 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 29 The website of Dattang: [https://www.datatang.ai/](https://www.datatang.ai/) 20 The website of D to prevent request congestion and optimize service latency. Edge devices have the sufficient computational capacity for AIGC inference and are closer to consumers than central servers. Therefore, users can interact with devices with a reduced transmission delay. In addition, as AIGC services are dispersed to several edge devices, the latency can be significantly reduced. #### Ii-B5 Product Management The preceding stages cover the AIGC generation. However, as an irreplaceable online property comparable to NFT, AIGC possesses unique ownership, copyright, and worth for each content. Consequently, the preservation and management of AIGC products should be incorporated into the AIGC life cycle. Specifically, we refer to the party requesting the production of the AIGC as producers, e.g., mobile users or companies, who hire AIGC generators, e.g., network servers, to perform the AIGC tasks. Then, the main process in AIGC product management includes: * _Distribution:_ After the content is generated in network edge servers, the producers acquire ownership of the AIGC products. Consequently, they have the right to distribute these products to social media or AIGC platforms through edge networks * _Trading:_ Since AIGC products are regarded as a novel kind of non-fungible digital properties, they can be traded. The trading process can be modeled as a fund ownership exchange between two parties. To implement the aforementioned AIGC lifecycle in mobile networks, we further investigate the technical implementation of AIGC in the following section. ## III Technologies and Collaborative Infrastructure of Mobile AIGC Networks In this section, we delve into the technologies and collaborative infrastructure of mobile AIGC networks. This section aims to provide a comprehensive understanding of the rationale and objectives of edge computing systems designed to support AIGC. Before we explore the design of these systems, it is crucial to establish the performance metrics that measure whether the system can maximize user satisfaction and utility. ### _Evaluation Metrics of Generative AI Models and Services_ We first discuss several metrics for assessing the quality of AIGC models, which can be used by AIGC service providers and users in mobile networks. #### Iii-A1 Inception Score The Inception Score (IS) can be used to measure the accuracy of images generated by AIGC models in the mobile network [55]. The IS is based on the premise that high-fidelity generated images should have high-class probabilities, which suggest a reliable classification model, and a low Kullback-Leibler (KL) divergence between the projected class probability and a reference class distribution. To compute the IS, an exponential function is applied to the KL divergence between the anticipated class probabilities and the reference class distribution. The resulting value is then averaged over all created photos to obtain the IS. A higher IS indicates better overall image quality. #### Iii-A2 Frechet Inception Distance The Frechet Inception Distance (FID) has emerged as a well-established metric for evaluating the effectiveness of generative models, particularly GANs, in terms of image quality and diversity [56]. FID leverages a pre-trained Inception network to calculate the distance between actual and synthetic image embeddings. This metric can be used by AIGC model providers to evaluate the quality of their generative models in mobile networks. Additionally, users can assess the capabilities of AIGC service providers through multiple requests for services based on FID measurements. However, when evaluating conditional text-to-image synthesis, FID only measures the visual quality of the output images, ignoring the adequacy of their conditioning on the input text [57]. Thus, while FID is an excellent evaluation metric for assessing image quality and diversity, it is limited when applied to conditional text-to-image synthesis. #### Iii-A3 R-Precision R-Precision is a standard metric to evaluate how AI-generated images align with text inputs [58]. In mobile networks, the AIGC model producers can retrieve matching text from 100 text candidates using the AI-generated image as a query. The R-Precision measures the proportion of relevant items retrieved among the top-R retrieved items, where R is typically set to 1. Specifically, the Deep Attentional Multimodal Similarity Model (DAMSM) is commonly used to compute the text-image retrieval similarity score [59]. DAMSM maps each subregion of an image and its corresponding word in the sentence to a joint embedding space, allowing for the measurement of fine-grained image-text similarity for retrieval. However, it should be noted that text-to-image AIGC models can directly optimize the DAMSM module used to calculate R-Precision. This results in the metric being model-specific and less objective, limiting the evaluation of AIGC models in mobile networks. #### Iii-A4 CLIP-R-Precision CLIP-R-Precision is an assessment metric to address the model-specific character of the R-Precision metric [60]. Instead of the conventional DAMSM, the suggested measure uses the latest multimodal CLIP model [5] to obtain R-Precision scores. Here, CLIP is trained on a massive corpus of web-based image-caption pairings and is capable, via a contrastive aim, of bringing together the two embeddings (visual and linguistic). Thus, the CLIP-R-Precision can provide a more objective evaluation of text-to-image AIGC model performance in mobile networks. #### Iii-A5 Quality of Experience The Quality of Experience (QoE) metric plays a critical role in evaluating the performance of AIGC in mobile network applications. QoE measures user satisfaction with the generated content, considering factors such as visual quality, relevancy, and utility. Gathering and analyzing user surveys, interaction, and behavioral data are standard methods used to determine QoE. In addition, the definition of QoE can vary depending on the objectives of the mobile network system designer and the user group being considered. With the aid of QoE, AIGC performance can be improved, and new models can be created to meet user expectations. It is essential to account for QoE when analyzing the performance of AIGC in mobile network applications to ensure that the generated content meets user expectations and provides a great user experience. Based on the aforementioned evaluation metrics, diverse and valuable synthetic data can be generated from deep generative models. Therefore, in the next section, we introduce several generative AI models for mobile AIGC networks. ### _Generative AI Models_ The objective of a generative AI model is to fit the true data distribution of input data by iterative training. Users can generate novel data using this approximate model as the model can fit into the distribution. As shown in Fig. 5, this section mainly introduces five basic generative models, including GANs, energy-based models, VAE, flow-based models, and diffusion models. #### Iv-B1 Generative Adversarial Networks The GAN [61] is a fundamental framework for AIGC, comprising a generative model and a discriminative model. The generative network aims to generate data that is as realistic and similar to the original data as possible to deceive the discriminative model, based on the data in the original dataset. Conversely, the discriminant model's task is to differentiate between real and fake instances. During the GAN training process, the two networks continually enhance their performance by competing against each other until they reach a stable equilibrium. By the end of the training process, the discriminator network is no longer able to differentiate between real and fake data. However, GANs have limited control over the output and can produce meaningless images. Moreover, they generate low-resolution images, only augment the existing dataset rather than creating new content on the original dataset, and cannot generate new content across modalities. #### Iv-B2 Energy-based Generative Models Energy-based generative models [62] are probabilistic generative models that represent input data using energy values and model the data by minimizing these values. The energy-based models function by defining an energy function and then minimizing the energy value of the input data through optimization and training. This approach has the advantage of being easily comprehensible, and the models exhibit excellent flexibility and generalization ability in providing AIGC services. #### Iv-B3 Variational Autoencoder The VAE [63] consists of two main components: an encoder and a decoder network. The encoder converts the input data into the mean and variance of the latent measures and uses these parameters to sample the latent space and generate the latent measures. The decoder takes the latent variables as input and generates new data. The data reconstruction and data generation tasks can be accomplished by training the encoder and decoder together. Unlike GANs, which are trained using a supervised learning approach, VAE uses an unsupervised learning approach. Thus, the VAE generates data by sampling from the learned distribution, while the GAN generates data by approximating the data distribution using the generator network. #### Iv-B4 Flow-based Generative Models Flow-based generative models [64] facilitate the data generation process by employing probabilistic flow formulations. Additionally, these models compute gradients during generation using backpropagation algorithms, enhancing training and learning efficiency. Consequently, flow-based models in mobile edge networks present several benefits. One such advantage is computational efficiency. Flow-based models can directly compute the probability density function during generation, circumventing resource-intensive calculations. This promotes more efficient computation within mobile edge networks. #### Iv-B5 Generative Diffusion Models Diffusion models are likelihood-based models trained with Maximum Likelihood Estimation (MLE) [21], as opposed to GANs trained with a minimax game between the generator and the discriminator. Therefore, the pattern collapses and thus the training instabilities can be avoided. Specifically, diffusion models are inspired by non-equilibrium thermodynamics theory. They learn the inverse diffusion process to construct the desired data sample from noise by defining a Markov chain of diffusion steps that gradually add random noise to the data. In addition, diffusion can mathematically transform the computational space of the model from pixel space to a low-dimensional space called latent space. This reduces the computational cost and time required and improves the training efficiency of the model. Unlike VAE or flow-based models, diffusion models are learned using a fixed procedure, and the hidden variables have high dimensions that are the same as the original data. ### _Collaborative Infrastructure for Mobile AIGC Networks_ By asking ChatGPT the question "Integrating AI-generated content and mobile edge networks, please define mobile AIGC networks in one sentence," we can get the answer "_Mobile AIGC networks are a fusion of AI-generated content and mobile edge networks, enabling rapid content creation, delivery, and processing at the network's edge for enhanced user experiences and reduced latency_." (from Mar. 14 Version based on GPT-4) To support the pre-training, fine-tuning, and inference of the aforementioned models, substantial computation, communication, and storage resources are necessary. Consequently, to provide low-latency and personalized AIGC Fig. 5: The model architecture of generative AI models, including generative adversarial networks, energy-based models, variational autoencoder, flow-based models, and diffusion models. services, a collaborative cloud-edge-mobile AIGC framework shown in Fig. 6 is essential, requiring extensive cooperation among heterogeneous resource shareholders. #### Iv-C1 Cloud Computing In mobile AIGC networks, cloud computing [65] represents a centralized infrastructure supplying remote server, storage, and database resources to support AIGC service lifecycle processes, including data collection, model training, fine-tuning, and inference. Cloud computing allows users to access AIGC services through the core network where these services are deployed, rather than building and maintaining physical infrastructure. Specifically, there are three primary delivery models in cloud computing: Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). In mobile AIGC networks, IaaS providers offer access to virtualized AIGC computing resources such as servers, storage, and databases [19]. Additionally, PaaS provides a platform for developing and deploying AIGC applications and services. Lastly, SaaS delivers applications and services over the internet, enabling users to access AIGC models directly through a web browser or mobile application. In summary, cloud computing in mobile AIGC networks allows developers and users to harness the benefits of AI while reducing costs and mitigating challenges associated with constructing and maintaining physical infrastructure, playing a critical role in the development, deployment, and management of AIGC services. #### Iv-C2 Edge Computing By providing computing and storage infrastructure at the edge of the core network [25], users can access AIGC services through radio access networks (RAN). Unlike the large-scale infrastructure of cloud computing, edge servers' limited resources often cannot support AIGC model training. However, edge servers can offer real-time fine-tuning and inference services that are less computationally and storage-intensive. By deploying edge computing at the network's periphery, users need not upload data through the core network to cloud servers to request AIGC services. Consequently, reduced service latency, improved data protection, increased reliability and decreased bandwidth consumption are benefits of AIGC services delivered via edge servers. Compared to exclusively delivering AIGC services through centralized cloud computing, location-aware AIGC services at the edge can significantly enhance user experience [66]. Furthermore, edge servers for local AIGC service delivery can be customized and personalized to meet user needs. Overall, edge computing enables users to access high-quality AIGC services with lower latency. #### Iv-C3 Device-to-device Mobile Computing Device-to-device (D2D) mobile computing involves using mobile devices for the direct execution of AIGC services by users [14]. On one hand, mobile devices can directly execute AIGC models and perform local AIGC inference tasks. While running AIGC models on devices demands significant computational resources and consumes mobile device energy, it reduces AIGC service latency and protects user privacy. On the other hand, mobile devices can offload AIGC services to edge or cloud servers operating over wireless connections, providing a flexible scheme for delivering AIGC services. However, offloading AIGC services to edge or cloud servers for execution necessitates stable network connectivity and increases service latency. Lastly, model compression and quantization must be considered to minimize the resources required for execution on mobile devices, as AIGC models are often large-scale. ### _Lessons Learned_ #### Iv-D1 Cloud-Edge Collaborative Training and Fine-tuning for AIGC models To support AIGC services with required performance evaluated based on metrics discussed in Section III-A, cloud-edge collaborative pre-training, and fine-tuning are envisioned to be promising approaches. On the one hand, the servers in cloud computing can train AIGC models by using powerful computing and data resources. On the other hand, based on the large amount of user data in the edge network, the AIGC model can be fine-tuned to be more customized and personalized. #### Iv-D2 Edge-Mobile Collaborative Inference for AIGC Services In a mobile AIGC network, the user's location and mobility change over time. Therefore, a large number of edge and mobile collaborations are required to complete the provision of AIGC inference services. Due to the different mobility of users, the AIGC services forwarded to the edge servers for processing are also dynamic. Therefore, dynamic resource Fig. 6: The collaborative cloud-edge-mobile infrastructure for mobile AIGC networks. The advantages and limitations of provisioning AIGC services in each layer are elaborated. allocation and task offloading decisions in mobile AIGC networks are one of the challenges in deploying mobile AIGC networks, which we discuss in Section VI. ## IV How to Deploy AIGC at Mobile Edge Networks: Applications and Advantages of AIGC This section introduces creative applications and advantages of AIGC services in the mobile edge network. Then, we provide four use cases of AIGC applications at mobile AIGC networks. Some examples of AIGC models are shown in Fig. 7. The applications elaborated in this section are summarized in Table II. ### _Applications of Mobile AIGC Networks_ #### Iv-A1 AI-generated Texts Recent advancements in Natural Language Generation (NLG) technology have led to AI-generated text that is nearly indistinguishable from human-written text [9]. The availability of powerful open-source AI-generated text models, along with their reduced computing power requirements, has facilitated widespread adoption, particularly in mobile networks. The development of lightweight NLG models that can operate on resource-constrained devices, such as smartphones and IoT devices, while maintaining high-performance levels, has made AI-generated text an essential service in mobile AIGC networks [34]. One example of such a model is ALBERT (A Lite BERT), designed to enhance the efficiency of BERT (Bidirectional Encoder Representations from Transformers) while reducing its computational and memory requirements [101]. ALBERT is pre-trained on a vast corpus of text data and uses factorized embedding parameterization, cross-layer parameter sharing, and sentence-order prediction tasks to optimize BERT's performance while minimizing computational and memory demands. ALBERT has achieved performance levels comparable to BERT on various natural language processing tasks, such as question answering and sentiment analysis [10]. Its lighter model design makes it more suitable for deployment on edge devices with limited resources. MobileBERT is another model designed for deployment on mobile and edge devices with minimal resources [102]. This more compact variant of the BERT model is pre-trained on the same amount of data as BERT but features a more computationally efficient design with fewer parameters. Quantization is employed to reduce the model's weight accuracy, further decreasing its processing requirements. MobileBERT is a highly efficient model compatible with various devices, including smartphones and IoT devices, and can be used in multiple mobile applications, such as personal assistants, chatbots, and text-to-speech systems [34]. Additionally, it can be employed in small-footprint cross-modal applications, such as image captioning, video captioning, and voice recognition. These AI-generated text models offer significant advantages to mobile edge networks, enabling new applications and personalized user experiences in real time while preserving user privacy. #### Iv-A2 AI-generated Audio AI-generated audio has gained prominence in mobile networks due to its potential to enhance user experience, and increase efficiency, security, personalization, cost-effectiveness, and accessibility [16]. For instance, AIGC-based speech synthesis and enhancement can improve call quality in mobile networks, while AIGC-based speech recognition and compression can optimize mobile networks by reducing the data required to transmit audio and automating tasks such as speech-to-text transcription. Voice biometrics powered by AI can bolster mobile network security by utilizing the user's voiceprint as a unique identifier for authentication [93]. AIGC-driven audio services, such as personalized music generation, can automate tasks and reduce network load, thereby cutting costs. Audio Albert [41], a streamlined version of the BERT model adapted for self-supervised learning of audio representations, demonstrates competitive performance levels compared to other popular AI-generated audio models in various natural language processing tasks such as speech recognition, speaker identification, and music genre classification. In terms of latency, Audio Albert shows faster inference times than previous models, with a 20% reduction in average inference time on average, which can significantly improve response times in mobile edge networks. Additionally, Audio Albert's accuracy is comparable to BERT and achieves state-of-the-art results on several benchmarks. Furthermore, Audio Albert's model design is lighter than other models, making it suitable for Fig. 7: Generated images of different AIGC models, including Stable Diffusion ([https://huggingface.co/spaces/stabilityai/stable-diffusion](https://huggingface.co/spaces/stabilityai/stable-diffusion)), DALLE-2 ([https://labs.openai.com/](https://labs.openai.com/)), Visual ChatGPT ([https://huggingface.co/spaces/microsoft/visual_chatgpt](https://huggingface.co/spaces/microsoft/visual_chatgpt)), Point-E ([https://huggingface.co/spaces/openai/point-e](https://huggingface.co/spaces/openai/point-e)), using the prompt “A photo of a green pumpkin”. deployment on edge devices with limited resources, improving computational efficiency while maintaining high-performance levels. Utilizing Audio Albert in mobile edge networks can provide several benefits, such as faster response times, reduced latency, and lower power consumption, making it a promising solution for AI-generated audio in mobile edge networks. #### Iv-B3 AI-generated Images AI-generated images offer numerous applications in mobile networks, such as image enhancement, image compression, image recognition, and text-to-image generation [103]. Image enhancement can improve picture quality in low-light or noisy environments, while image compression decreases the data required to transmit images, enhancing overall efficiency. Various image recognition applications include object detection, facial recognition, and image search. Text-to-image generation enables the creation of images from textual descriptions for visual storytelling, advertising, and virtual reality/augmented reality (VR/AR) experiences [104, 105, 106]. Make-a-Scene, a novel text-to-image generation model proposed in [107], leverages human priors to generate realistic images based on textual descriptions. The model consists of a text encoder, an image generator, and a prior human module trained on human-annotated data to incorporate common sense knowledge. In mobile networks, this model can be trained on a large dataset of images and textual descriptions to swiftly generate images in response to user requests, such as creating visual representations of road maps. This approach complements the techniques employed in [108] for generating images with specific attributes. Furthermore, the Semi-Parametric Neural Image Synthesis (SPADE) method introduced in [108] generates new images from existing images and their associated attributes using a neural network architecture. This method produces highly realistic images conditioned on input attributes and can be employed for image-to-image translation, inpainting, and style transfer in mobile networks. The SPADE method shares similarities with the text-to-image generation approach in [107], where both techniques focus on generating high-quality, realistic images based on input data. However, the development of AI-generated image technology also raises concerns around deep fake technology, which uses AI-based techniques to generate realistic photos, movies, or audio depicting nonexistent events or individuals, as discussed in [13]. Deep fakes can interfere with system performance and affect mobile user tasks, leading to ethical and legal concerns that require more study and legislation. #### Iv-B4 AI-generated Videos AI-generated videos, like AI-generated images, can be utilized in mobile networks for various applications, such as video compression, enhancement, summarization, and synthesis [77]. AI-generated videos offer several advantages over AI-generated images in mobile networks. They provide a more immersive and engaging user experience by dynamically conveying more information [109]. Moreover, AI-generated videos can be tailored to specific characteristics, such as style, resolution, or frame rate, to improve user experience or create videos for specific purposes, such as advertising, entertainment, or educational content [97]. Furthermore, AI-generated videos can generate new content from existing videos or other types of data, such as images, text, or audio, offering new storytelling methods [97]. Various models can be employed to achieve AI-generated videos in mobile networks. One such model is Imagen Video, presented in [11], which is a text-conditioned video generation system based on a cascade of video diffusion models. Imagen Video generates high-definition videos from text input using a base video generation model and an interleaved sequence \begin{table} \begin{tabular}{|p{113.8pt}|p{113.8pt}|p{113.8pt}|p{113.8pt}|} \hline **Application** & **Models** & **Network Architectures** & **Datasets** & **Evaluation Metrics** \\ \hline \multirow{4}{*}{Text Generation} & GPT-3 [67], GPT-4, BERT [68], LaMDA [69], ChatGPT [10] & Transformer [70] & WebText, BookCorpus [71], Common Crawl & BLEU [72], ROUGE [73], Perplexity \\ \hline \multirow{4}{*}{Image Generation} & StyleGAN [74], BigGANs [75], StyleGANXL [76], DVD-GAN [77], DALLE [6], DALLE2 [7], CLIP [5], VisualGPT [78], VAE [79], Energy-based GAN [62], Flow-based models [64], Imagen [80], DMPM [82], DDPM [83] & GAN [84], VVAE [85], Transformer [70] & ImageNet [86], CelebA [87], COCO [88] & FID [89], IS [90], LPIPS [91] \\ \hline \multirow{2}{*}{Music Generation} & MuseNet [92], Jukedeck, WaveNet [93], AudioLM [94] & Transformer, RNN, CNN & MIDI Dataset, MAESTRO [95] & ABC-notation, Music IS \\ \hline \multirow{4}{*}{Video Generation} & Diffusion models beat GANs [96], Video Diffusion Models [97], Dreamfusion [98] & DDPM, DDIM & Kinetics [99] & PSNR, SSIM \\ \hline \multirow{2}{*}{3D Generation} & NeRF [100] & MLP & Synthetic and real-world scenes & PSNR, SSIM, LPIPS \\ \hline \end{tabular} \end{table} TABLE II: Summary of State-of-the-art AIGC models. of spatial and temporal video super-resolution models. The authors describe the process of scaling up the system as a high-definition text-to-video model, including design choices such as selecting fully-convolutional temporal and spatial super-resolution models at specific resolutions and opting for v-parameterization for diffusion models. They also apply progressive distillation with classifier-free guidance to video models for rapid, high-quality sampling [11, 97]. Imagen Video not only produces high-quality videos but also boasts a high level of controllability and world knowledge, enabling the generation of diverse videos and text animations in various artistic styles and with 3D object comprehension. #### Iv-A5 AI-generated 3D AI-generated 3D content is becoming increasingly promising for various wireless mobile network applications, including AR and VR [110]. It also enhances network efficiency and reduces latency through optimal base station placement [111, 112]. Researchers have proposed several techniques for generating high-quality and diverse 3D content using deep learning (DL) models, some of which complement one another in terms of their applications and capabilities. One such technique is the Latent-NeRF model, proposed in [113], which generates 3D shapes and textures from 2D images using the NeRF architecture. This model is highly versatile and can be used for various applications, such as 3D object reconstruction, 3D scene understanding, and 3D shape editing for wireless VR services. Another technique, the Latent Point Diffusion (LPD) model presented in [114], generates 3D shapes with fine-grained details while controlling the overall structure. LPD has been shown to create more diverse shapes than other state-of-the-art models, making it suitable for 3D shape synthesis, 3D shape completion, and 3D shape interpolation. The LPD model complements the Latent-NeRF approach by offering more diverse shapes and finer details. Moreover, researchers in [115] proposed the Diffusion-SDF model, which generates 3D shapes from natural language descriptions. This model utilizes a combination of voxelized signed distance functions and diffusion-based generative models, producing high-quality 3D shapes with fine-grained details while controlling the overall structure. This technique accurately generates 3D shapes from natural language descriptions, making it useful for applications such as 3D shape synthesis, completion, and interpolation. It shares similarities with the Latent-NeRF and LPD models in terms of generating high-quality 3D content [116]. ### _Advantages of Mobile AIGC_ We then discuss several advantages of generative AI in mobile networks. #### Iv-B1 Efficiency Generative AI models offer several efficiency benefits in mobile networks. One of the primary advantages is automation. Generative AI models can automate the process of creating text, images, and other types of media, reducing the need for human labor and significantly boosting productivity [117]. The outputs of generative models can be generated quickly and with minimal human intervention. This is particularly beneficial for tasks such as data augmentation in mobile networks, where a substantial amount of synthetic data is required to train ML models for applications like object recognition or network optimization. Moreover, generative AI models can be implemented at the edge of mobile networks [118, 119], allowing them to produce data locally on devices like smartphones and IoT sensors. This is especially advantageous for tasks that demand generating a large volume of data, such as image and video synthesis for AR applications. Local data production can reduce the amount of data transmitted over the mobile network, alleviating network congestion, and enhancing the system's responsiveness and efficiency [39]. This results in improved user experiences and reduced latency in mobile applications that rely on real-time data generation and processing. #### Iv-B2 Reconfigurability The reconfigurability of AIGC in mobile networks is a significant advantage. By deploying AI models in mobile networks, AIGC can produce a vast array of content, including text, images, and audio, which can be seamlessly adjusted to suit evolving network demands and user preferences [120]. For instance, the ChatGPT model exemplifies AIGC's reconfigurability in providing multilingual support. It can be trained to understand and address user queries in numerous languages, facilitating seamless system adaptation for handling various linguistic contexts. This approach showcases how AIGC can cater to diverse user bases and adapt to global communication needs in mobile networks. However, implementing multilingual support in AIGC models can pose several challenges and limitations, such as the need for large amounts of training data and the difficulty of maintaining consistency across different languages. AIGC models require large amounts of training data to learn multiple languages, which can be difficult to obtain for less commonly spoken languages. Additionally, maintaining consistency across different languages can be challenging, as each language has its own unique grammar and syntax. This can lead to errors or inaccuracies in translation, especially for more complex language structures. Finally, AIGC models may struggle with cultural nuances, metaphors, and idiomatic expressions that are specific to certain languages, which can result in misunderstandings or misinterpretations of user queries. To overcome the challenges of implementing multilingual support in AIGC models, future research could focus on developing more efficient and effective training methods that require less data while still producing accurate results. Additionally, ongoing efforts to improve natural language processing and machine translation algorithms could help improve consistency across different languages and reduce errors in translation. Another potential solution is to incorporate cultural and linguistic experts into the training process to help AIGC models better understand cultural nuances and expressions specific to different languages. Finally, exploring the use of transfer learning, where a model trained on one language is adapted to another language with less training data, could also be a promising direction for future research. Additionally, AIGC can contribute to reconfigurability in mobile networks through the utilization of image and audio generative models. These models can be trained to generate new visuals and auditory content based on specific parameters, such as user preferences or contextual information. As a result, the mobile system can be rapidly altered to produce novel materials on demand, eliminating the need for manual labor or supplementary resources. Another potential application of AIGC is the development of dynamic network architectures in mobile networks. These AI-enhanced designs can be effortlessly reconfigured to address shifting network demands, such as fluctuations in traffic patterns or the introduction of innovative services. For example, generative AI models, such as diffusion models, can be used to create optimal system incentive mechanisms according to the network environment, thereby improving the utility of participating users and enhancing overall network performance [121]. #### Iv-B3 Accuracy Employing generative AI models in mobile networks provides significant benefits in terms of accuracy, leading to more precise predictions and well-informed decision-making [96]. Enhanced accuracy in AI-generated content can substantially improve the overall user experience across various applications within the mobile network ecosystem. For example, AI-generated text can automate responses to mobile user inquiries, augmenting the efficiency and precision of mobile user support. This application not only reduces response times but also ensures accurate and contextually relevant information is provided to users, leading to better customer satisfaction and streamlined support services [39]. Similarly, AI-generated visuals and audio can be employed to elevate the quality and accuracy of network-provided content, encompassing domains such as advertising, entertainment, and accessibility services. By using generative AI models, tailored and engaging content can be produced, resulting in a more impactful and personalized user experience. In the context of mobile networks, this can mean generating high-quality images or videos adapted to various devices and network conditions, improving the user's perception of the provided services. By harnessing the power of generative AI models, mobile networks can offer more accurate and efficient services, ultimately fostering a superior user experience and enabling innovative solutions tailored to the diverse needs of mobile users. #### Iv-B4 Scalability and Sustainability Utilizing AIGC in mobile networks offers significant scalability and sustainability benefits [96]. AIGC can produce a wide range of content, including text, images, and audio, enhancing mobile networks' overall scalability and sustainability in numerous ways. Specifically, AIGC facilitates scalability in mobile networks by reducing the reliance on human labor and resources. For instance, AIGC can generate automated responses to customer inquiries, alleviating the need for human customer support staff. This approach decreases the energy consumption associated with operating human-staffed contact centers and reduces the carbon footprint linked to human labor [21]. Furthermore, AIGC can promote sustainability in mobile networks by diminishing the demand for physical content storage. By generating new content on demand, AIGC minimizes the necessity to store and manage vast quantities of physical materials. This reduction leads to decreased energy usage and a smaller carbon footprint tied to maintaining physical storage infrastructure. Despite the challenges associated with AIGC models, such as large model sizes and complex training processes, leveraging edge servers in mobile networks can help mitigate these issues by adopting an "AIGC-as-a-Service" approach [118]. Users can interact with the system by submitting requests through their mobile devices and subsequently receiving computational results from edge servers. This strategy eliminates the necessity to deploy AIGC models on devices with constrained computing resources, optimizing overall efficiency and further improving scalability and sustainability within the mobile network infrastructure. #### Iv-B5 Security and Privacy AIGC can offer potential security and privacy advantages by embedding sensitive information within AI-generated content. This approach can serve as a form of steganography, a technique that conceals data within other types of data, making it difficult for unauthorized parties to detect the hidden information. For instance, AI-generated images or audio can be used to encode confidential information in imperceptible ways. This technique can improve privacy in mobile networks, as sensitive data can be transmitted without being explicitly discernible. In addition, AI-generated content can be employed as a security measure, such as AI-generated audio for voice biometrics or AI-generated facial images for authentication purposes, adding an extra layer of security to mobile network services [21]. However, it is essential to be aware of potential security and privacy risks associated with AIGC, such as adversarial attacks on AI models or the misuse of AI-generated content for malicious purposes, like deepfakes [13]. To ensure the secure and privacy-preserving use of AIGC in mobile networks, robust security measures and encryption techniques must be in place, along with ongoing research to counter potential threats [122]. ## V Case Studies of AIGC in Mobile Network In this section, we present several case studies for mobile AIGC networks. Specifically, we discuss the AIGC service provider (ASP) selection, generative AI-empowered traffic and driving simulation, AI-generated incentive mechanism, and blockchain-powered lifecycle management for AIGC. ### _AIGC Service Provider Selection_ The integration of AIGC models within wireless networks offers significant potential, as these state-of-the-art technologies have exhibited exceptional capabilities in generating a wide range of high-quality content. By harnessing the power of artificial intelligence, AIGC models can astutely analyze user inputs and produce tailored, contextually relevant content in real-time [96]. This stands to considerably enhance user experience and foster the creation of innovative applications across various domains, such as entertainment, education, and communication. Nonetheless, the deployment and application of these advanced models give rise to challenges, including extensive model sizes, complex training processes, and resource constraints. Consequently, deploying large-scale AI models on every network edge device poses considerable difficulties. To address this challenge, the authors in [118] introduce the "AIGC-as-a-service" architecture. This approach entails ASPs deploying AI models on edge servers, which facilitates the provision of instantaneous services to users via wireless networks, thereby ensuring a more convenient and adaptable experience. By enabling users to effortlessly access and engage with AIGC, the proposed solution minimizes latency and resource consumption. Consequently, edge-based AIGC-as-a-service holds the potential to transform the creation and delivery of AIGC across wireless networks. However, one problem is that the effectiveness of ASP in meeting user needs displays significant variability due to a variety of factors. Certain ASPs may concentrate on generating specific content types, while others boast more extensive content generation capabilities. For instance, some providers may specialize in producing particular content categories, whereas others offer a wider range of content generation options. Moreover, several ASPs may have access to advanced computing and communication resources, empowering them to develop and deploy more sophisticated AIGC models within the mobile network. As depicted in Fig. 8, users uploading images and requirement texts to different ASPs encounter diverse results owing to the discrepancies in models employed. For example, a user attempting to add snow to grass in an image may experience varying outcomes depending on the ASP chosen. With a large number of mobile users and increasing demand for accessing requests, it is crucial to analyze and select ASPs with the necessary capability, skill, and resources to offer high-quality AIGC services. This requires a rigorous selection process considering the provider's AIGC model capabilities and computation resources. By selecting a provider with the appropriate abilities and resources, organizations can ensure that they have effective AIGC services to increase the QoE for mobile users. Motivated by the aforementioned reasons, the authors in [118] examine the viability of large-scale deployment of AIGC-as-a-Service in wireless edge networks. Specifically, in the ASP selection problem, which can be framed as a resource-constrained task assignment problem, the system consists of a series of sequential user tasks, a set of available ASPs, and the unique utility function for each ASP. The objective is to find an assignment of tasks to ASPs, such that the overall utility is maximized. Note that the utility of the task assigned to the ASP is a function of the required resource. Without loss of generality, the authors in [118] consider that is in the form of the diffusion step of the diffusion model, which is positively correlated to the energy cost. The reason is that each step of the diffusion model has energy consumption as it involves running a neural network to remove Gaussian noise. Finally, the total availability of resources for each ASP is taken into account to ensure that the resource constraints are satisfied. In this formulation of AIGC service provisioning, the resource constraints are incorporated through the resource constraint, which specifies the limitations on the available resources. Note that failing to satisfy the resource constraint can result in the crash of ASP, causing the termination and restart of its running tasks. Several baseline policies are used for comparison: * _Random Allocation Policy._ This strategy distributes tasks to ASPs in a haphazard manner, without accounting for available resources, task duration, or any restrictions. The random allocation serves as a minimum benchmark for evaluating scheduling efficiency. * _Round-Robin Policy._ The round-robin policy allocates tasks to ASPs sequentially in a repeated pattern. This approach can generate effective schedules when tasks are evenly distributed. However, its performance may be suboptimal when there are significant disparities among them. * _Crash-Avoid Policy._ The crash-avoid policy prioritizes ASPs with greater available resources when assigning tasks. The goal is to prevent overburdening and maintain system stability. * _Upper Bound Policy._ In this hypothetical scenario, the scheduler has complete knowledge of the utility each ASP offers to every user before task distribution. The omniscient allocation strategy sets an upper limit on the performance of user-centric services by allocating tasks to ASPs with the highest utility and avoiding system failures. However, this approach relies on prior information about the unknown utility function, which is unrealistic in practice. The authors in [118] employed a Deep Reinforcement Learning (DRL) technique to optimize Application Service Provider (ASP) selection. In particular, they implemented the Soft Actor-Critic (SAC) method, which alternates between evaluating and improving the policy. Unlike traditional actor-critic frameworks, the SAC approach maximizes a balance between expected returns and entropy, allowing it to optimize both exploitation and exploration for efficient decision-making in dynamic ASP selection scenarios. To conduct the simulation, the authors consider 20 ASPs and 1000 edge users. Each ASP Fig. 8: The system model of AIGC service provider selection. Different ASPs performing user tasks can bring different results and different user utilities. Considering that different mobile users have different task requirements and different ASP’s AI models have different capabilities and computation capacities, a proper ASP selection algorithm is needed to maximize the total utilities of network users. offered AaaS with a maximum resource capacity, measured by total diffusion timesteps in a given time frame, varying randomly between 600 and 1,500. Each user submits multiple AIGC task requests to ASPs at varying times. These requests detailed the necessary AIGC resources in terms of diffusion timesteps, randomly set between 100 and 250. Task arrivals from users adhered to a Poisson distribution, with a rate of 0.288 requests per hour over a 288-hour duration, amounting to 1,000 tasks in total. As shown in Fig. 9, simulation results indicate that the proposed DRL-based algorithm outperforms three benchmark policies, i.e., overloading-avoidance, random, and round-robin, by producing higher-quality content for users and achieving fewer crashed tasks. _Lesson Learned:_ The lesson learned from this study is that the proper selection of ASPs is crucial for maximizing the total utilities of network users and enhancing their experience. The authors in [118] introduced a DRL-based algorithm for ASP selection, which outperforms other baseline policies, such as overloading-avoidance, random, and round-robin. By leveraging the SAC approach, the algorithm strikes a balance between exploitation and exploration in decision-making for dynamic ASP selection scenarios. Consequently, this method can provide higher-quality content for users and lead to fewer crashed tasks, ultimately improving the quality of service in wireless edge networks. To further enhance research in the area of AIGC service provider selection, future studies could have: * Investigate the integration of federated learning and distributed training methods to improve the efficiency of AIGC model updates and reduce the communication overhead among ASPs. * Explore advanced DRL algorithms and meta-learning techniques to adaptively adjust the ASP selection strategy in response to changing network conditions and user requirements. * Assess the impact of real-world constraints, such as network latency, data privacy, and security concerns, on the ASP selection process and devise strategies to address these challenges. * Develop multi-objective optimization techniques for ASP selection that consider additional factors, such as energy consumption, cost, and the trade-off between content quality and computational resources. ### _Generative AI-empowered Traffic and Driving Simulation_ In autonomous driving systems, traffic and driving simulation can affect the performance of connected autonomous vehicles (AVs). Existing simulation platforms are established based on historical road data and real-time traffic information. However, these data collection processes are difficult and costly, which hinders the development of fully automated transportation systems. Fortunately, generative AI-empowered simulations can largely reduce the cost of data collection and labeling by synthesizing traffic and driving data via generative AI models. Therefore, as illustrated in Fig. 10, the authors in [123] design a specialized generative AI model, namely TSDreambooth, for conditional traffic sign generation in the proposed vehicular mixed reality Metaverse architecture. In detail, TSDreambooth is a variation of stable diffusion [124] fine-tuned based on the Belgium traffic sign (BelgiumTS) dataset [125]. The performance of TSDreambooth is validated via the pre-trained traffic sign classification model as generative scores. In addition, the newly generated datasets are leveraged to improve the performance of original traffic sign classification models. In the vehicular Metaverse, connected AVs, roadside units, and virtual simulators can develop simulation platforms in the virtual space collaboratively. Specifically, AVs maintain their representations in the virtual space via digital twin (DT) technologies. Therefore, AVs need to continuously generate multiple DT tasks and execute them to update the representations. To offload these DT tasks to roadside units for remote execution in real-time, AVs need to pay for the communication and computing resources of roadside units. Therefore, to provide fine-grained incentives for RSUs in executing DT tasks with heterogeneous resource demands and Fig. 10: Generative AI-empowered simulations for autonomous driving in vehicular Metaverse, which consists of AVs, virtual simulators, and roadside units. Fig. 9: The cumulative rewards under different ASP selection algorithms [118]. DRL-based algorithms can outperform multiple baseline policies, i.e., overloading-avoidance, random, and round-robin, and approximate the optimal policy. various required deadlines, the authors in [123] propose a multi-task enhanced physical-virtual synchronization auction-based mechanism, namely MTEPViSA, to determine and price the resources of RSUs. There are two-stage of this mechanism the online submarket for provisioning DT services and the offline submarket for provisioning traffic and driving simulation services. In the online simulation submarket, the multi-task DT scoring rule is proposed to resolve the externalities from the offline submarket. In the meanwhile, the price scaling factor is leveraged to reduce the effect of asymmetric information among driving simulators and traffic simulators in the offline submarket. The simulation experiments are performed in a vehicular Metaverse system with 30 AVs, 30 virtual traffic simulators, 1 virtual driving simulator, and 1 RSU. The experimental results demonstrate that the proposed mechanism can improve 150% social surplus compared with other baseline mechanisms. Finally, they develop a simulation testbed of generative AI-empowered simulation systems in the vehicular Metaverse. The vehicular mixed-reality (MR) Metaverse simulation environment was constructed employing a 3D model representing several city blocks within New York City. Geopipe, Inc. developed this model by leveraging artificial intelligence to generate a digital replica based on photographs taken throughout the city. The simulation encompasses an autonomous vehicle navigating a road, accompanied by strategically positioned highway advertisements. Eye-tracking data were gathered from human participants immersed in the simulation, utilizing the HMD Eyes addon provided by Pupil Labs. Subsequent to the simulation, participants completed a survey aimed at evaluating their subjective level of interest in each simulated scenario. As the experimental results shown in Fig. 11, According to the study, as the number of AVs continues to increase, the supply and demand mechanisms in the market are changing. Therefore, in order to improve market efficiency and total surplus, some mechanisms need to be adopted to coordinate supply and demand. We investigate the market mechanism and propose a mechanism based on AIGC technology to enhance market efficiency. Compared with the existing Physical-virtual Synchronization auction (PViSA) and Enhanced Physical-virtual Synchronization auction (EPViSA) mechanisms [126, 127], the AIGC-empowered mechanism can double the total surplus under different numbers of AVs. _Lesson Learned:_ This case study on generative AI-empowered autonomous driving opens a new paradigm for the vehicular Metaverse, where data and resources can be utilized more efficiently. The authors demonstrate the potential of generative AI models in synthesizing traffic and driving data to reduce the cost of data collection and labeling. The proposed MTEPViSA mechanism also provides a solution to determine and price the resources of roadside units for remote execution of digital twin tasks, improving market efficiency and total surplus. However, there are still several open issues that need to be addressed in this field. Firstly, it is necessary to investigate the potential negative impacts of generative AI models in synthesizing traffic and driving data, such as biases and inaccuracies. Secondly, more research is needed to develop robust and trustworthy mechanisms for determining and pricing the resources of RSUs to ensure fair and efficient allocation of resources. Thirdly, the proposed mechanism needs to be tested and evaluated in more complex and varied scenarios to ensure its scalability and applicability in real-world situations. ### _AI-Generated Incentive Mechanism_ In this case study, we present the idea of using AI-generated optimization solutions with a focus on the use of diffusion models and their ability to optimize the utility function. In today's world of advanced internet services, including the Metaverse, MR technology is essential for delivering captivating and immersive user experiences [128, 129]. Nevertheless, the restricted processing power of head-mounted displays (HMDs) used in MR environments poses a significant challenge to the implementation of these services. To tackle this problem, the researchers in [121] introduce an innovative information-sharing strategy that employs full-duplex device-to-device semantic communication [130]. This method enables users to circumvent computationally demanding and redundant processes, such as producing AIGC in-view images for all MR participants. By allowing a user to transmit generated content and semantic data derived from their view image to nearby users, these individuals can subsequently utilize the shared information to achieve spatial matching of computational outcomes within their own view images. In their work, the authors of [121] primarily concentrate on developing a contract theoretic incentive mechanism to promote semantic information exchange among users. Their goal is to create an optimal contract that, while adhering to the utility threshold constraints of the semantic information provider, simultaneously maximizes the utility of the semantic information recipient. Consequently, they devised a diffusion model-based AI-generated contract algorithm, as illustrated in Fig. 12. Specifically, the researchers developed a cutting-edge algorithm for creating AI-generated incentive mechanisms, which tackle the challenge of utility maximization by devising optimal contract designs [121]. This approach is distinct from Fig. 11: Performance evaluation of the MTEPViSA under different sizes of the market. traditional neural network backpropagation algorithms or DRL methods, as it primarily focuses on enhancing contract design through iterative denoising of the initial distribution instead of optimizing model parameters. The policy for contract design is defined by the reverse process of a conditional diffusion model, linking environmental states to contract arrangements. The primary goal of this policy is to produce a deterministic contract design that maximizes the expected total reward over a series of time steps. To optimize system utility through contract design, the researchers in [121] create a contract quality network that associates an environment-contract pair with a value representing the expected total reward when an agent implements a particular contract design policy from the current state and adheres to it in the future. The optimal contract design policy is one that maximizes the system's predicted cumulative utility. The researchers then carry out an extensive comparison between their suggested AI-powered contract algorithm and two DRL algorithms, specifically SAC and PPO. As illustrated in the training process in [121] (see Fig. 13), PPO requires more iteration steps to achieve convergence, while SAC converges more quickly but with a lower final reward value in comparison to the AI-driven contract algorithm. The enhanced performance of the suggested AI-driven contract algorithm can be ascribed to two main aspects: * Improved sampling quality: By configuring the diffusion step to 10 and applying multiple refinement steps, the diffusion models generate higher quality samples, mitigating the influence of uncertainty and augmenting sampling precision [96]. * Enhanced long-term dependence processing capability: Unlike conventional neural network generation models that take into account only the current time step input, the diffusion model creates samples with additional time steps through numerous refinement iterations, thereby bolstering its long-term dependence processing capability [103]. As demonstrated in Fig. 13, the authors in [121] examine the optimal contract design capacities of the trained models. For a specific environmental state, the AI-driven contract algorithm provides a contract design that attains a utility value of 189.1, markedly outperforming SAC's 185.9 and PPO's 184.3. These results highlight the practical advantages of the proposed AI-based contract algorithm in contrast to traditional DRL techniques. _Lesson Learned:_ The case study in this research highlights the potential of AI-generated optimization solutions, particularly diffusion models, for addressing complex utility maximization problems within incentive mechanism design. The authors in [121] present an innovative approach that employs full-duplex device-to-device semantic communication for information-sharing in mixed reality environments, overcoming the limitations of HMDs. The diffusion model-based AI-generated contract algorithm proposed in this study demon Fig. 12: System model of contract design in semantic information sharing network, and the AI-generated contract algorithm. The diffusion models generate different optimal contract designs under different environmental variables. Fig. 13: The effect of different incentive design schemes, e.g., PPO, SAC, and AI-generated contract [121]. strates superior performance compared to traditional DRL algorithms, such as SAC and PPO. The superior performance of the AI-generated contract algorithm can be attributed to improved sampling quality and enhanced long-term dependence processing capability. This study underscores the effectiveness of employing AI-generated optimization solutions in complex, high-dimensional environments, particularly in the context of incentive mechanism design. Some promising directions for future research include: * Expanding the application of diffusion models: Investigate the application of diffusion models in other domains, such as finance, healthcare, transportation, and logistics, where complex utility maximization problems often arise. * Developing novel incentive mechanisms: Explore the development of new incentive mechanisms that combine AI-generated optimization solutions with other approaches, such as game theory or multi-agent reinforcement learning, to create even more effective incentive designs. * Exploring the role of human-AI collaboration: Investigate how AI-generated optimization solutions can be combined with human decision-making to create hybrid incentive mechanisms that capitalize on the strengths of both human intuition and AI-driven optimization. ### _Blockchain-Powered Lifecycle Management for AI-Generated Content Products_ This case study delves into the application of a blockchain-based framework for managing the lifecycle of AIGC products within edge networks. The framework, proposed by the authors in [131], addresses concerns related to stakeholders, the blockchain platform, and on-chain mechanisms. We explore the roles and interactions of the stakeholders, discuss the blockchain platform's functions, and elaborate on the framework's on-chain mechanisms. Within edge networks, the AIGC product lifecycle encompasses four main stakeholders: content creators, Edge Service Providers (ESPs), end-users, and adversaries. The following describes their roles and interplay within the system: * **Producers:** Initiate the AIGC product lifecycle by proposing prompts for ESPs to generate content. They retain ownership rights and can publish and sell the generated products. * **ESPs:** Possess the resources to generate content for producers, charging fees based on the time and computing power used for the tasks. * **Consumers:** View and potentially purchase AIGC products, participating in multiple trading transactions throughout the product lifecycle. * **Attackers:** Seek to disrupt normal operations of AIGC products for profit through ownership tampering and plagiarism. Considering the roles of these stakeholders, the blockchain platform fulfills two primary functions: providing a traceable and immutable ledger and supporting on-chain mechanisms. Transactions are recorded in the ledger and validated by full nodes using a consensus mechanism, ensuring security and traceability. ESPs act as full nodes, while producers and consumers serve as clients. To address the concerns arising from stakeholder interactions, the framework employs three on-chain mechanisms [131]: * **Proof-of-AIGC:** A mechanism that defends against plagiarism by registering AIGC products on the blockchain. It comprises two phases: proof generation and challenge. * **Incentive Mechanism:** Safeguards the exchange of funds and AIGC ownership using Hashed Timelock Contracts (HTLCs). * **Reputation-based ESP Selection:** Efficiently schedules AIGC generation tasks among ESPs based on their reputation scores. The Proof-of-AIGC mechanism plays a vital role in maintaining the integrity of AIGC products. It encompasses two stages: proof generation and challenge. The objective of proof generation is to record AIGC products on the blockchain, while the challenge phase allows content creators to raise objections against any on-chain AIGC product they deem infringing upon their creations. If the challenge is successful, the duplicate product can be removed from the registry, thus protecting the original creator's intellectual property rights. To further strengthen the security of the AIGC ecosystem, a pledge deposit is necessary to initiate a challenge, preventing arbitrary challenges that could burden the blockchain. This process comprises four steps: fetching the proofs, verifying the challenger's identity, measuring the similarity between the original product and the duplicate, and checking the results. The AIGC economic system necessitates an incentive mechanism to motivate stakeholders and ensure legitimate exchanges of funds and ownership. The Incentive Mechanism rewards ESPs for maintaining the ledger and providing blockchain services. There are no transaction fees, and block generators follow a first-come-first-serve strategy. A two-way guarantee protocol using Hash Time Lock (HTL) is designed to build mutual trust and facilitate AIGC circulation during both the generation and trading phases. The Proof-of-AIGC mechanism tackles issues like ownership manipulation and AIGC plagiarism, while the incentive mechanism ensures compliance with pre-established contracts. Furthermore, a reputation-based ESP selection accommodates ESP heterogeneity, which is crucial for efficient AIGC lifecycle management. Specifically, within the AIGC lifecycle management architecture, producers can concurrently interact with multiple heterogeneous ESPs, necessitating the identification of a trustworthy ESP for a specific task. Conventional approaches involve selecting the most familiar ESP to minimize potential risks, which may result in unbalanced workload distribution and increased service latency among ESPs. To address this challenge, a reputation-based ESP selection strategy is incorporated into the framework. This strategy ranks all accessible ESPs according to their reputation, which is computed using Multi-weight Subjective Logic (MWSL). The primary objectives are to assist producers in choosing the most reliable ESP, distribute the workload evenly across multiple ESPs, and motivate ESPs to accomplish tasks promptly and honestly, as a negative reputation impacts their earnings. Producers identify suitable ESPs by computing the reputation of all potential ESPs, ranking them based on their current reputation, and allocating the AIGC generation task to the ESP with the highest standing. In MWSL, the concept of "opinion" serves as the fundamental element for reputation calculation. Local opinions represent the assessments of a specific producer who has directly interacted with the ESPs, while recommended opinions are derived from other producers who have also engaged with the ESPs. To mitigate the effect of subjectivity, an overall opinion is generated for each producer by averaging all the acquired recommended opinions. As producers possess varying degrees of familiarity with ESPs, the weight of their recommended opinions differs. Reputation is determined by combining a producer's local opinion with the overall opinion. The reputation scheme accomplishes its design objectives by quantifying the trustworthiness of ESPs, adding producers in selecting the most dependable ESP, reducing service bottlenecks, and incentivizing ESPs to deliver high-quality AIGC services in order to maximize their profits. A demonstration of the AIGC lifecycle management framework is conducted to verify the proposed reputation-based ESP selection approach [131]. The experimental setup comprises three ESPs and three producers, with the AIGC services facilitated by the Draw Things application. Several parameters are configured, and producers can employ the Softmax function to ascertain the probability of choosing each ESP. The reputation trends of the three ESPs are shown in Fig. 14, with ESP1 attaining the highest rank and remaining stable owing to its superior service quality. When ESP1 deliberately postpones AIGC services, its reputation declines sharply, while the reputations of ESP2 and ESP3 continue to rise. The proposed reputation strategy effectively measures the trustworthiness of ESPs, enabling producers to effortlessly discern the most reliable ESP and motivating ESPs to operate with integrity. The workload of ESPs under different ESP selection methods is also demonstrated in Fig. 15. Traditional methods lead to uneven workloads and extended service latencies. Conversely, the suggested reputation-based method efficiently balances the workload among ESPs, as producers can assess the trustworthiness of ESPs quantitatively without relying exclusively on their experiential judgment. _Lesson Learned:_ The case study on blockchain-powered lifecycle management for AI-generated content products highlights the potential of a blockchain-based framework in addressing key concerns like stakeholder interactions, platform functionality, and on-chain mechanisms. The primary lessons learned emphasize the importance of defining clear stakeholder roles, implementing robust mechanisms such as Proof-of-AIGC and Incentive Mechanism to ensure system integrity, and employing a reputation-based ESP selection scheme to balance workload and encourage honest performance. These insights collectively contribute to the effective management of the AIGC product lifecycle within edge networks. Future research in blockchain-powered lifecycle management for AI-generated content products can explore several promising directions: * Enhancing the efficiency and scalability of the blockchain platform to handle an increased number of transactions and support a growing AIGC ecosystem might be critical. * Refining the reputation-based ESP selection scheme to account for more sophisticated factors, such as task complexity, completion time, and user feedback, could lead to more accurate and dynamic trustworthiness evaluations. * Incorporating privacy-preserving techniques to protect sensitive data in AIGC products and user information without compromising the transparency and traceability of blockchain technology would be valuable. ## VI Implementation Challenges in Mobile AIGC Networks When providing AIGC services, a significant amount of computational and storage resources are required to run the AIGC model. These computation and storage-intensive services pose new challenges to existing mobile edge computing infrastructure. As discussed in Section III-C, a cloud-edge-mobile collaborative computing architecture can be implemented to provide AIGC services. However, several critical Fig. 14: The reputation trends of three ESPs (from the perspective of a random producer) [131]. Fig. 15: The total number of assigned tasks of three ESPs [131]. implementation challenges must be addressed to improve resource utilization and the user experience. ### _Edge Resource Allocation_ AIGC service provisioning based on edge intelligence is computationally and communication-intensive for resource-constrained edge servers and mobile devices [132]. Specifically, AIGC users send service allocation requests to edge services. Upon receiving these AIGC requests, edge servers perform the AIGC tasks and deliver the output to users [133]. During this AIGC service provisioning interaction, model accuracy and resource consumption are the most common metrics. Consequently, significant efforts are being made to coordinate mobile devices and edge servers for deploying generative AI at mobile edge networks. As summarized in Table III, several Key Performance Indicators (KPIs) for edge resource allocation in AIGC networks are presented below. Here are several KPIs for edge resource allocation in AIGC networks. * Model accuracy: In a resource-constrained edge computing network, a key issue when allocating edge resources is optimizing the accuracy of AI services while fully utilizing network resources. Besides objective image recognition and classification tasks, AI models are also based on the content's degree of personalization and adaptation. Thus, optimizing AIGC content networks may be more complex than traditional optimization since personalization and customization make evaluating model accuracy more unpredictable. * Bandwidth utilization: While providing AIGC services, the edge server must maximize its channel utilization to ensure reliable service in a high-density edge network. To allocate its bandwidth resources more efficiently, the edge server must control channel access to reduce interference between user requests and maximize the quality of its AIGC service to attract more users. * Edge resource consumption: Deploying AIGC services in edge networks requires computationally intensive AI training and inference tasks that consume substantial resources. Due to the heterogeneous nature of edge devices, edge services consume resources in generating appropriate AIGC while processing users' requests [141]. Deployment of AIGC services necessitates continuous iteration to meet actual user needs, as generation results of AIGC models are typically unstable. This constant AIGC service provisioning at edge servers leads to significant resource consumption. Obtaining a balance between model accuracy and resource consumption can be challenging in resource-constrained edge computing networks. One potential strategy is to adjust the trade-off between model accuracy and resource consumption according to the needs of the users. For example, in some cases, a lower level of model accuracy may be acceptable if it results in faster response times or lower resource consumption. Another approach is to use transfer learning, which involves training an existing model on new data to improve accuracy while requiring fewer computational resources. Model compression techniques can also be used to reduce the size of the AI model without significantly impacting accuracy. However, it is important to note that these techniques may not be applicable in all scenarios, as personalization and customization can make evaluating model accuracy more unpredictable. Deployment of AIGC services necessitates continuous iteration to meet actual user needs, as generation results of AIGC models are typically unstable. Due to the heterogeneous nature of edge devices, edge services consume resources in generating appropriate AIGC while processing users' requests. This constant AIGC service provisioning at edge servers leads to significant resource consumption. To provide intelligent applications at mobile edge networks, considerable effort should focus on the relationship between model accuracy, networking, communication, and computation resources at the edge. Simultaneously, offering AIGC services is challenging due to the dynamic network environment and user requirements at mobile edge networks. The authors in [135] propose a threshold-based approach for reducing traffic at edge networks during collaborative learning. By considering computation resources, the authors in [134] examine the distributed ML problem under communication, computation, storage, and privacy constraints. Based on the theoretical results obtained from the distributed gradient descent convergence rate, they propose an adaptive control algorithm for distributed edge learning to balance the trade-off between local updates and global parameter aggregations. The experimental results demonstrate the effectiveness of their algorithm under various system settings and data distributions. AIGC models often require frequent fine-tuning and retraining for newly generated data and dynamic requests in non-stationary mobile edge networks [142]. Due to limited storage resources at edge servers and the different customization demands of AIGC providers, the AIGC service placement problem is investigated in [136]. To minimize total time and energy consumption in edge AI systems, the AI service placement and resource allocation problem is formulated as an MINLP. In the optimization problem, AI service placement Fig. 16: Dynamic AIGC application configuration and AIGC model compression for serving AIGC services in mobile AIGC networks. and channel allocation are discrete decision variables, while device and edge frequencies are continuous variables. However, solving this problem is not trivial, particularly in large-scale network environments. Thus, the authors propose an alternating direction method of multipliers (ADMM) to reduce the complexity of solving this problem. The experimental results demonstrate that this method achieves near-optimal system performance while the computational complexity grows linearly as the number of users increases. Moreover, when edge intelligence systems jointly consider AI model training and inference [137], the ADMM method can optimize edge resources. Additionally, the authors [138] explore how to serve multiple AI applications and AI models at the edge. They propose EdgeAdapter, as illustrated in Fig. 16, to balance the triple trade-off between inference accuracy, latency, and resource consumption. To provide inference services with long-term profit maximization, they first analyze the problem as an NP-hard problem and then solve it with a regularization-based online algorithm. In mobile AIGC networks, an effective architecture for providing AIGC services is to partition a large AIGC model into multiple smaller models for local execution [28]. In [139], the authors consider a multi-user scenario with massive IoT [143] devices that cooperate to support an intelligent application collaboratively. Although partitioning large ML models and distributing smaller models to mobile devices for collaborative execution is feasible, the model distribution and result aggregation might incur extra latency during model training and inference. Additionally, the formulated optimization problem is complex due to its numerous constraints and vast solution space. To address these issues, the authors propose an alternative iterative optimization to obtain solutions in polynomial time. Furthermore, AIGC services allow users to input their preferences into AIGC models. Therefore, to preserve user privacy among multiple users during collaborative model training and inference, the authors in [140] investigate the communication efficiency issues of decentralized edge intelligence enabled by FL. In the FL network, thousands of mobile devices participate in model training. However, selecting appropriate cluster heads for aggregating intermediate models can be challenging. Decentralized learning approaches can improve reliability while sacrificing some communication performance, unlike centralized learning with a global controller. A two-stage approach can be adopted in decentralized learning scenarios to improve the participation rate. In this approach, evolutionary game-based allocation can be used for cluster head selection, and DL-based auction effectively rewards model owners. ### _Task and Computation Offloading_ In general, executing AIGC models that generate creative and valuable content necessitates substantial computational resources, which is impractical for mobile devices with limited resources [150, 21]. Offering high-quality and low-latency AIGC services is challenging for mobile devices with low processing power and limited battery life. Fortunately, AIGC users can offload the tasks and computations of AIGC models \begin{table} \begin{tabular}{|c|c|c|c|c|} \hline **Ref.** & **Scenarios** & \begin{tabular}{c} **Performance** \\ **Metrics/Decision** \\ **Variables** \\ \end{tabular} & **Benefits/Challenges** & **Mathematical Tools** \\ \hline [134] & \begin{tabular}{c} Adaptive control for \\ distributed edge learning \\ \end{tabular} & \begin{tabular}{c} Model loss/Steps of local \\ updates, the total number \\ of iterations \\ \end{tabular} & \begin{tabular}{c} Provisioning AIGC services \\ in resource-constrained \\ edge environments \\ \end{tabular} & Control theory \\ \hline [135] & Geo-distributed ML & \begin{tabular}{c} Execution time/Selective \\ barrier, mirror clock \\ \end{tabular} & \begin{tabular}{c} Provisioning Localized \\ AIGC services \\ \end{tabular} & Convergence analysis \\ \hline [136] & \begin{tabular}{c} AI service placement in \\ mobile edge intelligence \\ \end{tabular} & \begin{tabular}{c} Total time and energy \\ consumption/Service \\ placement decision, local \\ CPU frequencies, uplink \\ bandwidth, edge CPU \\ frequency \\ \end{tabular} & \begin{tabular}{c} Fully utilize scarce wireless \\ spectrum and edge \\ computing resources in \\ provisioning AIGC services \\ \end{tabular} & ADMM \\ \hline [137] & \begin{tabular}{c} Joint model training and \\ task inference \\ \end{tabular} & \begin{tabular}{c} Energy consumption and \\ execution latency/Model \\ download decision and task \\ splitting ratio \\ \end{tabular} & \begin{tabular}{c} Integrated fine-tuning and \\ inference for AIGC models \\ with heterogeneous \\ computing resources \\ \end{tabular} & ADMM \\ \hline [138] & \begin{tabular}{c} Serving edge DNN \\ inference for multiple \\ applications and multiple \\ models \\ \end{tabular} & \begin{tabular}{c} Inference accuracy, latency, \\ resource cost/Application \\ configuration, DNN model \\ selection, and edge \\ resources \\ \end{tabular} & \begin{tabular}{c} Provision rich AIGC \\ services for long-term \\ utility maximization \\ \end{tabular} & Regularization-based online \\ \hline [139] & \begin{tabular}{c} Multi-user collaborative \\ DNN partitioning \\ \end{tabular} & \begin{tabular}{c} Execution \\ latency/Partitioning, \\ computation resources \\ \end{tabular} & \begin{tabular}{c} Providing insights for \\ partitioning AIGC models \\ under edge-mobile \\ collaboration \\ \end{tabular} & Iterative alternating \\ \hline [140] & \begin{tabular}{c} Hierarchical federated edge \\ learning \\ \end{tabular} & \begin{tabular}{c} Data convergence and \\ revenue/Cluster selection \\ and payment \\ \end{tabular} & \begin{tabular}{c} Provisioning \\ privacy-preserving AIGC \\ services in edge networks \\ \end{tabular} & Evolutionary game and \\ \hline \end{tabular} \end{table} TABLE III: Summary of scenarios, problems, benefits/challenges, and mathematical tools of edge resource allocation. over the RAN to edge servers located in proximity to the users. This alleviates the computational burden on mobile devices. As listed in Table IV, several KPIs are specifically relevant to computation offloading in mobile AIGC networks: * Service latency: Service latency refers to the delay associated with data input and retrieval as well as the model inference computations that users perform to generate AIGC. By offloading AIGC tasks from mobile devices, such as fine-tuning and inference, to edge servers for execution, the total latency in mobile AIGC networks can be reduced. Unlike local execution of the AIGC model, offloading AI tasks to the edge server for execution introduces additional latency when transmitting personalized instructions and downloading AIGC content. * Reliability: Reliability evaluates users' success rate in obtaining personalized data accurately. On the one hand, when connecting to the edge server, users may experience difficulty uploading the requested data to edge servers or downloading the results from servers due to dynamic channel conditions and wireless network instability. On the other hand, the content generated by the AIGC model may not fully meet the needs of AIGC users in terms of personalization and customization features. Unsuccessful content reception and invalid content affect the AIGC network's reliability. When implementing cloud-edge collaborative training and fine-tuning for AIGC models, it is important to consider specific algorithms or techniques that enable effective collaboration between cloud and edge servers [151, 152]. For example, federated learning and distributed training approaches can facilitate the collaboration process by allowing edge servers to train models locally and then send the updated weights to the cloud server for aggregation. The division of responsibilities between cloud and edge servers can also greatly affect the overall efficiency and performance of the AIGC models. Therefore, it is crucial to discuss and implement appropriate schemes for determining which tasks are offloaded to the edge servers and which are performed on the cloud server. To provide AIGC services in edge intelligence-empowered IoT, offloading ML tasks to edge servers for remote execution Fig. 17: Model partitioning in mobile AIGC networks. The AIGC models of mobile devices can be split and full or partial of them can be offloaded to edge servers for remote execution. \begin{table} \begin{tabular}{|c|c|c|c|c|} \hline **Ref.** & **Scenarios** & \begin{tabular}{c} **Performance** \\ **Metrics/Decision variables** \\ \end{tabular} & **Benefits/Challenges** & **Mathematical Tools** \\ \hline [144] & Edge intelligence in IoT & \begin{tabular}{c} Processing delay/Task \\ offloading decisions \\ \end{tabular} & \begin{tabular}{c} Offload AIGC tasks for \\ improving inference \\ accuracy \\ \end{tabular} & Optimization theory \\ \hline [145] & Intelligent IoT applications & \begin{tabular}{c} Processing time/Offloading \\ decisions \\ \end{tabular} & \begin{tabular}{c} Support on-demand \\ changes for AIGC \\ applications \\ \end{tabular} & Random forest regression \\ \hline [28] & Collaborative intelligence between the cloud and mobile edge & \begin{tabular}{c} Latency and energy \\ consumption/DNN \\ computation partitioning \\ \end{tabular} & \begin{tabular}{c} Cloud and mobile edge \\ collaborative intelligence \\ for AIGC models \\ \end{tabular} & Greedy algorithm \\ \hline [27] & Cloud-edge intelligence & \begin{tabular}{c} Service response time/Task \\ processing node \\ \end{tabular} & \begin{tabular}{c} Reduce the average \\ response time for multi-task \\ parallel AIGC services \\ \end{tabular} & Genetic algorithm \\ \hline [146] & Cost-driven offloading for DNN-Based applications & \begin{tabular}{c} System costs/Number of \\ layers \\ \end{tabular} & \begin{tabular}{c} Minimize costs of AIGC \\ services in a \\ cloud-edge-end{tabular} & Genetic algorithm based on particle swarm optimization \\ \hline [147] & Industrial edge intelligence & \begin{tabular}{c} A weighted sum of task \\ execution time and energy \\ consumption/Task \\ assignment \\ \end{tabular} & \begin{tabular}{c} Multi-objective \\ optimization of large-scale \\ AIGC tasks with multiple \\ connected devices \\ \end{tabular} & \begin{tabular}{c} Generative coding \\ evolutionary algorithm \\ \end{tabular} \\ \hline [148] & Computation offloading for ML web apps & \begin{tabular}{c} Inference time/Pre-sending \\ decisions \\ \end{tabular} & \begin{tabular}{c} Reduce execution \\ overheads of AIGC tasks \\ with pre-sending snapshots \\ \end{tabular} & Hill climbing algorithm \\ \hline [149] & Cooperative edge intelligence & \begin{tabular}{c} Quality of \\ experience/Offloading \\ decisions \\ \end{tabular} & \begin{tabular}{c} Enhance vertical-horizontal \\ cooperation in multi-user \\ AIGC co-inference \\ scenarios \\ \end{tabular} & Federated multi-agent reinforcement learning \\ \hline \end{tabular} \end{table} TABLE IV: Summary of scenarios, problems, benefits/challenges, and mathematical tools of task and computation offloading. is a promising approach for computation-intensive AI model inference. For instance, in Fig 17, multiple lightweight ML models can be loaded into IoT devices, while large-scale ML models can be installed and executed on edge servers [25]. Heterogeneous AIGC models can be deployed on mobile devices and edge servers according to their resource demands and service requirements [153]. However, the multiple attributes of ML tasks, such as accuracy, inference latency, and reliability, render the offloading problem of AIGC highly complex. Therefore, the authors in [144] propose an ML task offloading scheme to minimize task execution latency while guaranteeing inference accuracy. Considering error inference leading to extra delays in task processing, they initially model the inference process as M/M/1 queues, which are also applicable to the AIGC service process. Furthermore, the optimization problem of ML task execution is formulated as a Mixed-Integer Nonlinear Programming (MINLP) to minimize provisioning delay, which can be adopted in the inference process of AIGC services. To extend the deterministic environment in [144] into a more general environment, the authors in [145] first propose an adaptive translation mechanism to automatically and dynamically offload intelligent IoT applications. Then, they make predictive offloading decisions using a random forest regression model. Their experiments demonstrate that the proposed framework reduces response times for complex applications by half. Such ML methods can also be used to analyze AIGC network traffic to improve service delivery efficiency and reliability. The success of edge-mobile collaboration for AIGC services is dependent on several factors, including the type of service, user characteristics, computational resources, and network conditions [3]. For instance, a real-time AIGC service may have different latency requirements compared to an offline service. Similarly, the required computational resources may vary depending on the model's complexity [154]. Additionally, the user profile, including location and device type, may affect the selection of edge servers for task offloading. Furthermore, network conditions such as bandwidth and packet loss rate can impact the reliability and latency of the service. Therefore, it is necessary to implement effective resource allocation and task offloading schemes to ensure high-quality and low-latency AIGC services in dynamic and diverse environments. Cloud-edge collaborative intelligence enables local tasks to be offloaded to edge and cloud servers. AIGC can benefit from cloud-edge intelligence, as edge servers can provide low-latency AIGC services while cloud servers can offer high-quality AIGC services. The authors in [28] develop a scheme called Neurosurgeon to select the optimal partitioning point based on model architectures, hardware platforms, network conditions, and load information at the servers to automatically partition the computation of tensors of DNNs between cloud and edge servers. Furthermore, the authors in [155] find that the layered approach can reduce the number of messages transmitted between devices by up to 97% while only decreasing the accuracy of models by a mere 3%. However, multiple AIGC services should be considered in cloud-edge collaborative intelligence that differs in types (e.g., text, images, and videos) and their diverse quality of service (QoS) requirements. In multi-task parallel scheduling [27], the genetic algorithm can also be used to make real-time model partitioning decisions. The authors in [146] propose a cost-driven strategy for AI application offloading through a self-adaptive genetic algorithm based on particle swarm optimization. In industrial edge intelligence, where edge intelligence is embedded in the industrial IoT [147], offloading computation tasks to edge servers is an efficient solution for self-organizing, autonomous decision-making, and rapid response throughout the manufacturing lifecycle, which is similarly required by mobile AIGC networks. Therefore, efficiently solving task assignment problems is crucial for effective AIGC model inference. However, the coexistence of multiple tasks among devices makes system response slow for various tasks. For example, text-based and image-based AIGC may coexist on the same edge device. As one solution, in [147], the authors propose a coding group evolution algorithm to solve large-scale task assignment problems, where tasks span the entire lifecycle of various products, including real-time monitoring, complex control, product structure computation, multidisciplinary cooperation optimization, and production process computation. Likewise, the AIGC lifecycle includes data collection, labeling, model training and optimization, and inference. Furthermore, a simple grouping strategy is introduced to parallel partition the solution space and accelerate the evolutionary optimization process. In contrast to VM-level adaptation to specific edge servers [156], the authors propose application-level adaptation for generic servers. The lighter adaptation framework in [148] further improves transmission time and user data privacy performance, including offloading and data/code recovery to generic edge servers. Ensuring dependable task offloading is crucial in providing superior AIGC services with minimal latency in edge computing. For instance, data transmission redundancy can enhance dependability by transmitting data via multiple pathways to mitigate network congestion or failures. By incorporating these techniques, task offloading dependability in edge computing can be enhanced, thereby leading to more efficient and effective AIGC services. Most intelligent computing offloading solutions converge slowly, consume significant resources, and raise user privacy concerns [157, 158]. The situation is similar when leveraging learning-based approaches to make AIGC service offloading decisions. Consequently, the authors enhance multi-user QoE [159] for cooperative edge intelligence in [149] with federated multi-agent reinforcement learning. They formulate the cooperative offloading problem as a Markov Decision Process (MDP). The state is composed of current tasks, local loads, and edge loads. Learning agents select task processing positions to maximize multi-user QoE, which simultaneously considers service latency, energy consumption, task drop rate, and privacy protection. Similarly, AIGC service provisioning systems can easily adopt the proposed solution for maximizing QoE in AIGC services. ### _Edge Caching_ Edge caching is the delivery of low-latency content and computing services using the storage capacity of edge base stations and mobile devices [165]. As illustrated in Fig. 18, in mobile AIGC networks, users can request AIGC services without accessing cloud data centers by caching AIGC models in edge servers and mobile devices. Unlike the cache in traditional content distribution networks, the AIGC model cache also requires computing resources to support its execution. Additionally, the AIGC model needs to gather user historical requests and profiles in context to provide personalized services during the AIGC service process. As shown in Table V, here are several key performance indicators (KPIs) for edge caching in AIGC networks: * Model access delay: Model access latency is an important indicator of AIGC service quality. The latency is lowest when the AIGC model is cached in the mobile device [166]. The model access latency must also be calculated considering the delay in the wireless communication network when the edge server provides the AIGC model. Finally, the core network latency must be considered when the cloud provides the AIGC service. * Backhaul traffic load: The load on the backhaul traffic is significantly reduced, as the requests and results of AIGC services do not need to go through the core network when the AIGC model is cached in the mobile edge network. * Model hit rate: Similar to content hit rate, the model hit rate is an important metric for AIGC models in the edge cache. It can be used for future model exits and loading during model replacement. As there is sufficient infrastructure and resources in the cloud computing infrastructure, the AIGC model can be fully loaded into the GPU memory for real-time service requests. In contrast, the proposed EdgeServe in [160] keeps models in main memory or GPU memory so that they can be effectively managed or used at the edge. Similar to traditional CDNs, the authors use model execution caches at edge servers to provide immediate AI delivery. In detail, there are mainly three challenges in AIGC model caching: * Constraint-memory edge servers: Compared to the resource-rich cloud, the resources of servers in the edge network, such as GPU memory, are limited [167]. Therefore, caching all AIGC models on one edge server is infeasible. * Model-missing cost: When the mobile device user requests AIGC, the corresponding model is missed if the AIGC model used to generate the AIGC is not cached in the current edge server [161]. In contrast to the instantly available AIGC service, if the AIGC model is missing, \begin{table} \begin{tabular}{|c|c|c|c|c|} \hline **Ref.** & **Scenarios** & \begin{tabular}{c} **Performance** \\ **Metrics/Decision** \\ **Variables** \\ \end{tabular} & **Benefits/Challenges** & **Mathematical Tools** \\ \hline [160] & DL Model caching at the edge & \begin{tabular}{c} Runtime memory \\ consumption and loading \\ time/Model preload policy \\ \end{tabular} & \begin{tabular}{c} Manage and utilize GPU \\ memories of edge servers \\ for caching AIGC models \\ \end{tabular} & \begin{tabular}{c} Cache replacement \\ algorithms \\ \end{tabular} \\ \hline [161] & Caching many models at the edge & \begin{tabular}{c} Model load and execution \\ latency and monetary cost /Caching eviction policy \\ \end{tabular} & \begin{tabular}{c} Improve scalability of \\ mobile AIGC networks via \\ model-level caching \\ deployment and \\ replacement \\ \end{tabular} & Model utility calculation \\ \hline [162] & Cache for mobile deep & \begin{tabular}{c} Latency, accuracy loss, \\ energy saving/Caching \\ policy, user selection, \\ transmit power, bandwidth \\ ratio \\ \end{tabular} & \begin{tabular}{c} Caching for users’ requests \\ for multimodal AIGC \\ services \\ \end{tabular} & Greedy algorithm \\ \hline [163] & Cache for functions in serverless computing & \begin{tabular}{c} Execution time, cold start \\ proportion/Function \\ keep-alive policy \\ \end{tabular} & \begin{tabular}{c} Keep AIGC models alive \\ and warm for in-contextual \\ inference \\ \end{tabular} & Greedy-dual based \\ \hline [164] & Knowledge caching for federated learning & \begin{tabular}{c} Transmission latency and \\ energy \\ consumption/Caching \\ policy, user selection, \\ transmit power, bandwidth \\ ratio \\ \end{tabular} & \begin{tabular}{c} Privacy-preserving model \\ caching via knowledge of \\ AIGC requests \\ \end{tabular} & Optimization theory \\ \hline \end{tabular} \end{table} TABLE V: Summary of scenarios, problems, performance metrics, and mathematical tools for edge caching in AIGC networks. Fig. 18: An overview of edge caching in mobile AIGC networks. By caching the AIGC model on the edge servers, the latency of AIGC services can be reduced and the network congestion in the core network can be reduced. the edge server needs to send a model request to the cloud server and download the model, which causes additional overhead in terms of bandwidth and latency. * Functionally equivalent models: The number of AIGC models is large and increases depending on the number of detailed tasks [168]. Meanwhile, AI models have similar functions in different applications, i.e., functionally equivalent. For example, for image recognition tasks, a large number of models with different architectures are proposed to recognize features in images, which have different model architectures and computation requirements. To address these challenges, the authors in [160] formulate the problem of edge modeling as determining which DL models should be preloaded into memory and which should be discarded when the memory is full while satisfying the requirements of inferential response times. Fortunately, this edge model caching problem can be solved using existing cache replacement policies for edge content caching. The accuracies and computation complexities of DL models make this optimization problem more complicated than conventional edge caching problems. Similarly, for resource-constrained edge servers, the AIGC model can be dynamically deployed and replaced. However, an effective caching algorithm for loading and unloading the AIGC models to maximize the hit rate has not yet been investigated. As the capabilities of AI services continue to grow and diversify, multiple models need to be deployed simultaneously at the edge to achieve various tasks, including classification, recognition, text/image/video generation [169]. Especially in mobile AIGC networks, multiple base models need to work together to generate a large amount of multimodal synthetic data. Many models play a synergistic role in the AIGC services at the edge of the network, while the support of multiple models also poses a challenge to the limited GPU memory of the edge servers. Therefore, the authors in [161] propose a model-level caching system with an eviction policy according to model characteristics and workloads. The model eviction policy is based on model utility calculation from cache miss penalty and the number of requests. This model-aware caching approach introduces a new direction for providing AIGC services at mobile edge networks with heterogeneous requests. Experimental results show that compared to the non-penalty-aware eviction policy, the model load delay can be reduced by 1/3. This eviction policy can also be adopted in the problem of which unpopular AIGC models should be unloaded. At mobile AIGC networks, not only the AIGC model needs to be cached, but also the AIGC requests and results can be cached to reduce the latency of service requests in AIGC networks. To this end, the authors devise a principled cache design to accelerate the execution of CNN models by exploiting the temporal locality of video for continuous vision tasks to support mobile vision applications [170]. The authors in [162] propose a principled cache scheme, named DeepCache, to retrieve reusable results and reuse them within a fine-grained CNN by exploiting the temporal locality of the mobile video stream. In DeepCache, mobile devices do not need to offload any data to the cloud and can support the most popular models. Additionally, without requiring developers to retrain models or tune parameters, DeepCache caches inference results for unmodified CNN models. Overall, DeepCache can reduce energy consumption by caching content to reduce model inference latency while sacrificing a small fraction of model accuracy. In serverless computing for edge intelligence, mobile devices can call functions of AIGC services at edge servers, which is more resource-efficient compared to container and virtual machine (VM)-based AIGC services. Nevertheless, such functions suffer from the cold-start problem of initializing their code and data dependencies at edge servers. Although the execution time of each function is usually short, initialization, i.e., fetching and installing prerequisite libraries and dependencies before execution, is time-consuming [171]. Fortunately, the authors in [163] show that the caching-based keep-alive policy can be used to address the cold-start problem by demonstrating that the keep-alive function is equivalent to caching. Finally, to balance the trade-off between server memory utilization and cold-start overhead, a greedy dual-based caching algorithm is proposed. Frequently, a large-scale AIGC model can be partitioned into multiple computing functions that can be efficiently managed and accessed during training, fine-tuning, and inference. FL models can be cached on edge servers to facilitate user access to instances and updates, thus addressing user privacy concerns [172, 173]. For example, the authors in [164] propose a knowledge cache scheme for FL in which participants can simultaneously minimize training delay and training loss according to their preference. Their insight is that there are two stimulations for caching knowledge for FL [174]: i) training data sufficiency and ii) connectivity stability. Experimental results show that the proposed preference-driven caching policy, based on the preferences (i.e., demands or desires for global models) of participants in FL, can outperform the random policy when user preferences are intense. Therefore, preference-based AIGC model caching should be extensively investigated for providing personalized and customized AIGC services at edge servers. ### _Mobility Management_ Mobile edge intelligence for the Internet of Vehicles and Unmanned Aerial Vehicle (UAV) networks relies on effective mobility management solutions [182, 183, 184, 185] to provide mobile AIGC services. Furthermore, UAV-based AIGC service distribution offers advantages such as ease of deployment, flexibility, and extensive coverage for enhanced edge intelligence [186, 187]. Specifically, UAVs, with their line-of-sight communication links, can extend the reach of edge intelligence [188]. For example, flexible UAVs equipped with AIGC servers enable users to access AIGC services with ultra-low latency and high reliability, especially when fixed-edge servers are often overloaded in hotspot areas or expensive to deploy in remote areas, as illustrated in Fig. 19. In addition, UAV-enabled edge intelligence can be utilized to implement mobile AIGC content and service delivery. As summarized in Table VI, here are several KPIs for mobility management in AIGC networks: * Task accomplishment ratio: The provisioning of AIGC services at mobile edge networks must consider the dynamic nature of users. As a result, services must be completed before users leave the base station. To measure the effectiveness of mobility management in AIGC networks, the task completion rate can be used. * Coverage enhancement: Vehicles and UAVs can serve as reconfigurable base stations to enhance the coverage of mobile AIGC networks [189], providing AIGC models and content to users anywhere and anytime. In vehicular networks, intelligent applications, such as AIGC-empowered navigation systems, are reshaping existing transportation systems. In [175], the authors propose a joint vehicle-edge inference framework to optimize energy consumption while reducing the execution latency of DNNs. In detail, vehicles and edge servers determine an optimal partition point for DNNs and dynamically allocate resources for DNN execution. They propose a chemical reaction optimization-based algorithm to accelerate convergence when solving the resource allocation problem. This framework offers insights for implementing mobile AIGC networks, where vehicles can collaborate with base stations to provide real-time AIGC services based on DNNs during their movement. AIGC applications require sufficient processing and memory resources to perform extensive AIGC services [190, 191, 192, 193]. However, resource-constrained vehicles cannot meet the QoS requirements of the tasks. The authors in [176] propose a distributed scheduling framework that develops a priority-driven transmission scheduling policy to address the dynamic network topologies of vehicle networks and promote vehicle edge intelligence. To meet the various QoS requirements of intelligent tasks, large-volume tasks can be partitioned and sequentially uploaded. Additionally, the impact of vehicle motion on task completion time and edge server load balancing can be independently handled by intelligent task processing requests. The effectiveness of the proposed framework is demonstrated in single-vehicle and multi-vehicle environments through simulation and deployment experiments. To facilitate smart and green vehicle networks [177], the real \begin{table} \begin{tabular}{|c|c|c|c|c|} \hline **Ref.** & **Scenarios** & **Performance Metrics/Problems** & **Benefits/Challenges** & **Mathematical Tools** \\ \hline [175] & Jointing vehicle-edge deep neural network inference & Latency, failure rate/CPU frequency & Robust AIGC service provisioning via layer-level offloading & Chemical reaction optimization \\ \hline [176] & Vehicular edge intelligence & Weighted average completion time and task acceptance ratio/Task dispatching policy & Provisioning AIGC service in multi-vehicle environments with motion prediction & Greedy algorithm \\ \hline [177] & Mobility-enhanced edge intelligence & Task completion ratio and model accuracy/Offloading redundancy, task assignment, beam selection & Sustainable AIGC service provisioning with mobility management & Federated learning \\ \hline [178] & Edge intelligence-assisted IoV & Average delay and energy consumption/Transmission decision, task offloading decision, bandwidth, and computation resource allocation & Flexible network model selection for AIGC services for balancing the tradeoff adaptively & Quantum-inspired reinforcement learning \\ \hline [179] & Cooperative edge intelligence in IoV & Average delay and energy consumption/Trajectory prediction accuracy & Optimize AIGC service with spatial and temporal correlations of users’ requests & Hybrid stacked autoencoder learning \\ \hline [180] & UAVs as an intelligent service & Model accuracy and energy consumption/Number of local iterations & Provision AIGC services via a network of UAVs & Greedy algorithm \\ \hline [181] & Knowledge distillation-empowered edge intelligence & Accuracy and inference delay/Size of model parameters & Visual information-aided AIGC model deployment and inference scheduling & Knowledge distillation \\ \hline \end{tabular} \end{table} TABLE VI: Summary of scenarios, problems, benefits/challenges, and mathematical tools for mobility management. Fig. 19: An overview of mobility management in mobile AIGC networks. The coverage of the mobile AIGC network will be significantly enhanced by UAV processing the user’s server request and providing AIGC services. time accuracy of AI tasks, such as AIGC model inference, can be monitored through on-demand model training using infrastructure vehicles and opportunity vehicles. The heterogeneous communication and computation requirements of AIGC services in highly dynamic, time-varying Internet of Vehicles (IoV) warrant further investigation [194, 195]. To dynamically make transmission and offload decisions, the authors in [178] formulate a Markov decision process for time-varying environments in their joint communication and computation resource allocation strategy. Finally, they develop a quantum-inspired reinforcement learning algorithm, in which quantum mechanisms can enhance learning convergence and performance. The authors in [179] propose a stacked autoencoder to capture spatial and temporal correlations to combine road traffic management and data network traffic management. To reduce vehicle energy consumption and learning delay, the proposed learning model can minimize the required signal traffic and prediction errors. Consequently, the accuracy of AIGC services based on autoencoder techniques can be improved through this management framework. With UAV-enhanced edge intelligence, UAVs can serve as aerial wireless base stations, edge computing servers, and edge caching providers in mobile AIGC networks. To demonstrate the performance of UAV-enhanced edge intelligence while preserving user privacy at mobile edge networks, the authors in [180] use UAV-enabled FL as a use case. Moreover, the authors suggest that flexible switching between compute and cache services using adaptive scheduling UAVs is a topic for future research. Therefore, flexible AIGC service provisioning and UAV-based AIGC delivery are essential for satisfying real-time service requirements and reliable generation. In this regard, the authors in [181] propose a visually assisted positioning solution for UAV-based AIGC delivery services where GPS signals are weak or unstable. Specifically, knowledge distillation is leveraged to accelerate inference speed and reduce resource consumption while ensuring satisfactory model accuracy. ### _Incentive Mechanism_ As suitable incentive mechanisms are designed, more edge nodes participate in and contribute to the AIGC services [131, 200, 201]. This increases the computational capacity of the system. In addition, the nodes are motivated to earn rewards by providing high-quality services. Thus, the overall quality of AIGC services is improved. Finally, nodes are encouraged to engage in secure operations without security concerns by recording resource transactions through the blockchain. As listed in Table VII, here are several KPIs for incentive mechanisms in AIGC networks: * Social welfare: AIGC's social welfare is the sum of the value of AIGC's services to the participants of the current network. Higher social welfare means that more AIGC users and AIGC service providers are participating in the AIGC network and providing high-value AIGC services within the network. * Revenue: Providers of AIGC use a large amount of computing and energy resources to provide AIGC, which may be offset by revenue from AIGC users. The higher the revenue, the more the AIGC service provider can be motivated to improve the AIGC service to a higher quality. * Economic properties: In AIGC networks, AIGC providers and users should be risk-neutral, which indicates the incentive mechanisms should satisfy economic properties, e.g., individually rational, incentive compatible, and budget balance [202]. While edge learning has several promising benefits, the learning time for satisfactory performance and appropriate monetary incentives for resource providers are nontrivial challenges for AIGC. In [196, 203, 204], where mobile devices are connected to the edge server, the authors design the incentive mechanism for efficient edge learning. Specifically, mobile devices collect data and train private models locally with computational resources based on the price of edge servers in each training round. Then, the updated models are uploaded to the edge server and aggregated to minimize the global loss function. Finally, the authors not only analyze the optimal pricing strategy but also use Deep Reinforcement Learning to learn the pricing strategy to obtain the optimal solution in each round in a dynamic environment and with incomplete information. In the absence of prior knowledge, the DRL agent can learn from experience to find the optimal pricing strategy that balances payment and training time. To extend [196] to long-term incentive provisioning, the authors in [197] propose a long-term incentive mechanism for edge learning frameworks. To obtain the optimal short-term and long-term pricing strategies, the hierarchical deep reinforcement learning algorithm is used in the framework to improve the model accuracy with budget constraints. In the process of fine-tuning the AIGC edge, the incentives described above can be used to balance the time and adaptability of the fine-tuned AIGC model. In providing incentives to AIGC service providers, the quality of AIGC services also needs to be considered in the incentive mechanism. The authors in [198] propose a quality-aware FL framework to prevent inferior model updates from degrading the global model quality. Specifically, based on an AI model trained from historical learning results, the authors estimate the learning quality of mobile devices. To motivate participants to contribute high-quality services, the authors propose a reverse auction-based incentive mechanism under the recruitment budget of edge servers, taking into account the model quality. Finally, the authors propose an algorithm for integrating the model quality into the aggregation process and for filtering non-optimal model updates to further optimize the global learning model. Traditionally, resource utilization is inefficient, and trading mechanisms are unfair in cloud-edge computing power trading [205] for AIGC services. To address this issue, the authors in [199] develop a general trading framework for computing power grids. As illustrated in Fig. 21, the authors solve the problem of the under-utilization of computing power with AI consumers in this framework. The computing-power trading problem is first formulated as a Stackelberg game and then solved with a profit-driven multi-agent reinforcement learning algorithm. Finally, a blockchain is designed for transaction security in the trading framework. In mobile AIGC networks with multiple AIGC service providers and multiple AIGC users, the Stackelberg game and its extension can still provide a valid framework for equilibrium analysis. In addition, multi-agent reinforcement learning also learns the equilibrium solution of the game by exploration and exploitation in the presence of incomplete information about the game. ### _Security and Privacy_ Mobile AIGC networks leverage a collaborative computing framework on the cloud side to provide AIGC services, utilizing a large amount of heterogeneous data and computing power [206, 207, 208]. When mobile users are kind, AIGC can greatly enhance their creativity and efficiency. However, malicious users can also utilize AIGC for destructive purposes, posing a threat to users in mobile edge networks. For example, AI-generated text can be used by malicious users to complete phishing emails, thus compromising the security and privacy of normal users [9]. To ensure secure AIGC services, providers must choose trusted AIGC solutions and train AI models in a secure manner while providing secure hints and answers to AIGC service users. #### Vi-F1 Privacy-preserving AIGC Service Provisioning During the lifecycle of providing AIGC services, privacy information in large-scale datasets and user requests needs to be kept secure to prevent privacy breaches. In mobile AIGC networks, the generation and storage of data for AIGC model training occur at edge servers and mobile devices [209]. Unlike resourceful cloud data centers, edge and mobile layers have limited defense capacities against various attacks. Fortunately, several privacy-preserving distributed learning frameworks, such as FL [15], have been proposed to empower privacy-preserving AIGC model fine-tuning and inference at mobile AIGC networks. In preserving user privacy in AIGC networks, FL is a distributed ML approach that allows users to transmit local models instead of data during model training [210, 211, 212]. Specifically, as illustrated in Fig. 20, there are two major approaches to employing FL in AIGC networks * Secure aggregation: While FL is being learned, the mobile devices send local updates to edge servers for global aggregation. During global aggregation, authenticated encryption allows the use of secret sharing mechanisms. * Differential privacy: Differential privacy can prevent FL servers from identifying the owners of a local update. Differential privacy is similar to secure aggregation in that it prevents FL servers from identifying owners of local updates. Therefore, in [213], the authors propose a differential private federated generative model to synthesize representative examples of private data. With guaranteed privacy, the proposed model can solve many common data problems without human intervention. Moreover, in [214], the authors propose an FL-based generative learning scheme to improve the efficiency and robustness of GAN models. The proposed scheme is particularly effective in the presence of varying parallelism and highly skewed data distributions. To find an inherent cluster structure in users' data and unlabeled datasets, the authors Fig. 20: Federated Learning in mobile AIGC networks, including the local model training at mobile devices, global aggregation at edge servers, and cross-server model trading. \begin{table} \begin{tabular}{|c|c|c|c|c|} \hline **Ref.** & **Scenarios** & **Problems** & **Benefits/Challenges** & **Mathematical Tools** \\ \hline [196] & Efficient edge learning & A weighted sum of training time and payment/Total payment and training time & Inceriuze AIGC service providers with heterogeneous resources under the uncertainty of edge network bandwidth & \multirow{4}{*}{Deep reinforcement learning} \\ \cline{3-4} & \multirow{2}{*}{Efficient edge learning} & Model accuracy, number of training rounds, time efficiency/The total price & Long-term incentive mechanism for AIGC services with long-term and short-term pricing strategies & Hierarchical deep reinforcement learning \\ \hline [198] & Quality-aware federated learning & Model accuracy and loss reduction/Learning quality estimation and quality-aware incentive mechanism & Estimate the performance of AIGC services with privacy-preserving methods for distributing proper incentives & Reverse auction \\ \hline [199] & Cloud-Edge computing power trading for ubiquitous AI services & Profits, resource utilization, security/Computing-power unit price & Trustworthy edge-cloud resource trading framework for AIGC services & Stackelberg game and multi-agent reinforcement learning \\ \hline \end{tabular} \end{table} TABLE VII: Summary of scenarios, problems, benefits/challenges, and mathematical tools of incentive mechanism. propose in [215] the unsupervised Iterative Federated Clustering algorithm, which uses generative models to deal with the statistical heterogeneity that may exist among the participants of FL. Since the centralized FL frameworks in [214, 215] might raise security concerns and risk single-point failure, the authors propose in [216] a decentralized FL framework based on a ring topology and deeply generated models. On the one hand, a method for synchronizing the ring topology can improve the communication efficiency and reliability of the system. On the other hand, generative models can solve data-related problems, such as incompleteness, low quality, insufficient quantity, and sensitivity. Finally, an InterPlanetary File System (IPFS)-based data-sharing system is developed to reduce data transmission costs and traffic congestion. #### V-B2 Secure AIGC Service Provisioning Given the numerous benefits of provisioning AIGC services in mobile and edge layers, multi-tier collaboration among cloud servers, edge servers, and mobile devices enables ubiquitous AIGC service provision by heterogeneous stakeholders [217, 218, 219, 220]. A trustworthy collaborative AIGC service provisioning framework must be established to provide reliable and secure AIGC services. Compared to central cloud AIGC providers, mobile and edge AIGC providers can customize AIGC services by collaborating with many user nodes while distributing data to different devices [221]. Therefore, a secure access control mechanism is required for multi-party content streaming to ensure privacy and security. However, the security of AIGC transmission cannot be ensured due to various attacks on mobile AIGC networks [222]. Fortunately, blockchain, based on distributed ledger technologies, can be utilized to explore a secure and reliable AIGC service provisioning framework and record resource and service transactions to encourage data sharing among nodes, forming a trustworthy and active mobile AIGC ecosystem [223]. As illustrated in Fig. 21, there are several benefits that blockchain brings to mobile AIGC networks [22]: * Computing and Communication Management: Blockchain enables heterogeneous computing and communication resources to be managed securely, adaptively, and efficiently in mobile AIGC networks [224]. * Data Administration: By recording AIGC resource and service transactions in blockchain with smart contracts, data administration in mobile AIGC networks is made profitable, collaborative, and credible. * Optimization: During optimization in AIGC services, the blockchain always provides available, complete, and secure historical data for input to optimization algorithms. For instance, the authors in [225] propose an edge intelligence framework based on deep generative models and blockchain. To overcome the accuracy issue of the limited dataset, GAN is leveraged in the framework to synthesize training samples. Then, the output of this framework is confirmed and incentivized by smart contracts based on the proof-of-work consensus algorithm. Furthermore, the multimodal outputs of AIGC can be minted as NFTs and then recorded on the blockchain. The authors in [226] develop a conditional generative model to synthesize new digital asset collections based on the historical transaction results of previous collections. First, the context information of NFT collections is extracted based on unsupervised learning. Based on the historical context, the newly minted collections are generated based on future token transactions. The proposed generative model can synthesize new NFT collections based on the contexts, i.e., the extracted features of previous transactions. ### _Lessons Learned_ #### V-G1 Multi-Objective Quality of AIGC Services In mobile AIGC networks, the quality of AIGC services is determined by several factors, including model accuracy, service latency, energy consumption, and revenue. Consequently, AIGC service providers must optimally allocate edge resources to satisfy users' multidimensional quality requirements for AIGC services [138]. Moreover, the migration of AIGC tasks and computations can enhance the reliability and efficiency of AIGC services. Notably, dynamically changing network conditions in the edge network necessitate users making online decisions to achieve load balancing and efficient use of computing resources. Attaining high-quality AIGC services requires proper considerations and practices to address the challenges discussed above, meet the quality requirements of multiple objectives, and improve user satisfaction and service quality. #### V-G2 Edge Caching for Efficient Delivery of AIGC Services Edge caching plays a pivotal role in the efficient delivery of AIGC services in mobile AIGC networks. Tackling the challenges of constrained-memory edge servers, model-missing costs, and functionally equivalent models is essential for optimizing caching policies. Developing model-aware caching approaches, investigating preference-driven caching policies, and implementing principled cache designs to reduce latency and energy consumption are promising directions for enhancing the performance of mobile AIGC networks. As AI services continue to evolve, further research in caching strategies is Fig. 21: Blockchain in mobile AIGC networks [199], including the AIGC application layer, blockchain layer, and computing-power network layers, for provisioning AIGC services. crucial for providing effective, personalized, and low-latency AIGC services for mobile users. #### Vi-B3 Preference-aware AIGC Service Provisioning Offering AIGC services based on user preferences not only improves user satisfaction but also reduces service latency and resource consumption in mobile edge networks. To implement preference-based AIGC service delivery, AIGC service providers must first collect historical user data and analyze it thoroughly. In providing AIGC services, the service provider makes personalized recommendations and adjusts its strategy according to user feedback. Although user preferences play a significant role in AIGC service provision, it is essential to use and manage this information properly to protect user privacy. #### Vi-B4 Life-cycle Incentive Mechanism throughout AIGC Services In mobile AIGC networks, the entire life cycle of AIGC services necessitates appropriate incentives for participants. A single AIGC service provider cannot provide AIGC services alone. Throughout the data collection, pre-training, fine-tuning, and inference of AIGC services, stakeholders with heterogeneous resources require reasonable incentives and must share the benefits according to their contributions. Conversely, from the users' perspective, evaluation mechanisms must be introduced. For instance, users can assess the reputation of AIGC service providers based on their transaction history to promote service optimization and improvement. Ultimately, the provisioning and transmission logs of AIGC services can also be recorded in a tamper-proof distributed ledger. #### Vi-B5 Blockchain-based System Management of Mobile AIGC Networks Furthermore, mobile AIGC networks connect heterogeneous user devices to edge servers and cloud data centers. This uncontrolled demand for content generation introduces uncertainty and security risks into the system. Therefore, secure management and auditing methods are required to manage devices in edge environments, such as dynamically accessing, departing, and identifying IoT devices. In the traditional centralized management architecture, the risk of central node failure is unavoidable. Thus, a secure and reliable monitoring and equipment auditing system should be developed. ## VII Future Research Directions and Open Issues As listed in Table VIII, in this section, we discuss future research directions and open issues from the perspectives of networking and computing, ML, and practical implementation. ### _Networking and Computing Issues_ #### Vii-A1 Decentralized Mobile AIGC Networks With the advancement of blockchain technologies [227], decentralized mobile AIGC networks can be realized based on distributed data storage, the convergence of computing and networking, and proof-of-ownership of data [223]. Such a decentralized network structure, enabled by digital identities and smart contracts, can protect AIGC users' privacy and data security. Furthermore, based on blockchain technologies, mobile AIGC networks can achieve decentralized management of the entire lifecycle of AIGC services. Therefore, future research should investigate specific consensus mechanisms, off-chain storage frameworks, and token structures for the deployment of decentralized mobile AIGC networks. #### Vii-A2 Sustainability in Mobile AIGC Networks In mobile AIGC networks, the pre-training, fine-tuning, and inference of generative AI models typically consume a substantial amount of computing and networking resources [26]. Hence, future research can focus on the green operations of mobile AIGC networks that provide AIGC services with minimal energy consumption and carbon emissions. To this end, effective algorithms and frameworks should be developed to operate mobile AIGC networks under dynamic service configurations, operating modes of edge nodes, and communication links. Moreover, intelligent resource management and scheduling techniques can also be proposed to balance the tradeoff between service quality and resource consumption. High-quality data resources are also critical for the sustainability of mobile AIGC networks [228]. The performance of generative models depends not only on effective network architectures but also on the quality of training datasets [229]. However, as AIGC becomes pervasive, training datasets are gradually replaced by synthesized data that might be irrelevant to real data. Therefore, improving the quality and reliability of data in mobile AIGC networks, such as through multimodal data fusion and incremental learning technology, can further enhance the accuracy and performance of the models. ### _Machine Learning Issues_ #### Vii-B1 AIGC Model Compression As AIGC models become increasingly complex, model compression techniques are becoming more important to reduce service latency and resource consumption in provisioning AIGC services [230]. Fortunately, several techniques have been developed for AIGC model compressions, such as pruning, quantization, and knowledge distillation. First, pruning involves removing unimportant weights from the model, while quantization reduces the precision of the weights [231]. Then, knowledge distillation involves training a smaller model to mimic the larger model's behavior. Future research on AIGC model compression might continue to focus on developing and refining these techniques to improve their efficiency and effectiveness for deploying AIGC models in edge nodes and mobile devices. It is necessary to consider the limited resources of such devices and develop specialized compression techniques that can balance model size and accuracy. #### Vii-B2 Privacy-preserving AIGC Services To provide privacy-preserving AIGC services, it is necessary to consider privacy computing techniques in both AIGC model training and inference [15]. Techniques such as differential privacy, secure multi-party computation, and homomorphic encryption can be used to protect sensitive data and prevent unauthorized access. Differential privacy involves adding noise to the data to protect individual privacy, while secure multi-party computation allows multiple parties to compute a function without revealing their inputs to one another. Homomorphic encryption enables computations to be performed on encrypted data without decryption. To successfully deploy AIGC models in edge nodes and mobile devices, the limited resources of such devices should be considered and specialized techniques that can balance privacy and performance should be developed. Additionally, concerns such as data ownership and user privacy leakage should be taken into account. ### _Practical Implementation Issues_ #### Vii-C1 Integrating AIGC and Digital Twins Digital twins enable the maintenance of representations to monitor, analyze, and predict the status of physical entities [232]. On one hand, the integration of AIGC and digital twin technologies has the potential to significantly improve the performance of mobile AIGC networks. By creating virtual representations of physical mobile AIGC networks, service latency, and quality can be optimized through the analysis of historical data and online predictions. Furthermore, AIGC can also enhance digital twin applications by reducing the time required for designers to create simulation entities. However, several issues need to be considered during the integration of AIGC and DTs, such as efficient and secure synchronization. #### Vii-C2 Immersive Streaming AIGC can create immersive streaming content, such as AR and VR, that can transport viewers to virtual worlds [233], which can be used in various applications such as education, entertainment, and social media. Immersive streaming can enhance the AIGC delivery process by providing a platform for viewers to interact with the generated content in real-time. However, combining AIGC and immersive streaming raises some concerns. Future research should focus on addressing the potential for biased content generation by the AIGC algorithms and the high bandwidth requirements of immersive streaming, which can cause latency issues, resulting in the degradation of the viewer's experience. ## VIII Conclusions In this paper, we have focused on the deployment of mobile AIGC networks, where AIGC models, services, and applications at mobile edge networks. We have discussed the background and fundamentals of generative models and the lifecycle of AIGC services at mobile AIGC networks. We have also explored AIGC-driven creative applications and use cases for mobile AIGC networks, as well as the implementation, security, and privacy challenges of deploying mobile AIGC networks. Finally, we have highlighted some future research directions and open issues for the full realization of mobile AIGC networks.

2310.15518

Non-Fungible Token Security

Non-fungible tokens (NFTs) are unique digital assets stored on the blockchain and is used to certify ownership and authenticity of the digital asset. NFTs were first created in 2014 while their popularity peaked between 2021 and 2022. In this paper, the authors dive into the world of Non-Fungible Tokens (NFTs), their history, the Future of NFTs, as well as the security concerns.

Ryleigh McKinney, Sundar Krishnan

2023-10-24T04:55:43Z

http://arxiv.org/abs/2310.15518v1

# Non-Fungible Token Security ###### Abstract Non-fungible tokens (NFTs) are unique digital assets stored on the blockchain and is used to certify ownership and authenticity of the digital asset. NFTs were first created in 2014 while their popularity peaked between 2021 and 2022. In this paper, the authors dive into the world of Non-Fungible Tokens (NFTs), their history, the Future of NFTs, as well as the security concerns. NFT, Security, Cryptographic, Graphic Design, Blockchain, Artwork, Real Estate. ## Introduction What is a Non-Fungible Token? Also known as an NFT, Non-fungible tokens are cryptographic assets on a blockchain with unique identification codes and metadata that distinguish them from each other.[1] In more simple terms, an NFT is a graphic design that may have an animation, they can be traded and bought for real money. NFTs are exclusive and the designs are only made once. They can also represent real things such as artwork and even real estate. Some people use NFTs as a form of self-expression. ## History of NFTs The "first" NFT was created in 2012, so, NFTs have been around a lot longer than people have realized. From 2012-2016, NFTs simply began as colored coins. The idea of Colored Coins was to describe a class of methods for representing and managing real-world assets on the blockchain to prove ownership of those assets; like regular Bitcoins, but with an added 'token' element that determines their use, making them segregated and unique.[2] These colored coins laid down the foundation for NFTs. On May 3rd, 2014, digital artist Kevin McCoy minted the first-known NFT 'Quantum' on the Namecoin blockchain. 'Quantum' is a digital image of a pixelated octagon that hypnotically changes colour and pulsates in a manner reminiscent of an octopus.[2] Around the years of 2017-2020, that is when NFTs truly started to take off into the investment and stock world, otherwise known as going mainstream. The big shift for NFTs to Ethereum was backed up with the introduction of a set of token standards, allowing the creation of tokens by developers. The token standard is a subsidiary of the smart contract standard, included to inform developers how to create, issue and deploy new tokens in line with the underlying blockchain technology.[2] After this rise, Vancouver-based venture studio Axiom Zen introduced CryptoKitties. CryptoKitties is a virtual game based on the Ethereum blockchain. The game enables players to adopt, breed and trade virtual cats, storing them in crypto wallets. After its announcement it wasn't long before the game became a viral sensation, becoming so popular that CryptoKitties clogged the Ethereum blockchain and people began making unbelievable profits.[2] After the huge success of CryptoKitties, NFT gaming grew to be more popular as the years went by. 2021 was the year NFTs began booming, causing more supply and demand for these cryptographics. One of the biggest factors in this boom was the huge changes that occurred within the art market and the industry at large, when prestigious auction houses; Christie's and Sotheby's namely, not only took their auctions into the online world but also began selling NFT art.[2] Christie was able to sell their NFT, Beeple's Everydays: the First 5000 Days, for $69 million. Soon after this sale, other platforms began creating and marketing their own versions of NFTs. This included blockchains such as Cardano, Solano, Tezos and Flow. With these newer platforms for NFTs, some new standards were established to ensure the authenticity and uniqueness of the digital assets created. [2]Near the end of 2021, Facebook rebranded as Meta and moved into the metaverse. This changed into a new universe surged the demand for NFTs even more. Figure 1 shows "Everyday" as the First 5000 Days is a digital work of art created by Mike Winkelmann, known professionally as Beeple. The work is a collage of 5000 digital images created by Winkelmann for his Everyday series. Its associated non-fungible token (NFT) was sold for $69.3 million at Christie's in 2021, making it first on the List of most expensive non-fungible tokens.[3] The introduction to NFTs was simply just the beginning, there is much more that can be done to expand and grow this new form of cryptocurrency. NFTs will have a big impact on the world of Gaming, Social Impacts, Real Estate, and The Metaverse. Are NFTs going to have more of an impact than people realize? The creation of CrytoKitties was simply the beginning, people tend to be more attracted to games were collecting items and building collections is the main focus point. They feel a sense of need and want to play, to continue to build their collection and be better than their friend or family member. Gamers find deep intrinsic value in their digital identities; their personal history, achievements, communities, stories, and status. [4]All Home Connections surveyed 1,000 American gamers to find out how much money they spend every month and how old they are. [5]The results are shown in Figure 2. In one lifetime, it is shown that Gen Z and Millennials will spend as much as the average American's salary in one lifetime. This study has further proved the need for identity and individuality in the gaming community. Creators have expanded the NFT community by creating their own applications and websites to encourage identity, as well as even to encourage public good within the NFT Community. An example of this would be Jeremy Dela Rosa, the founder of Leyline, a non-profit organization that is leading the charge with social impact through NFTs. Leyline's mission is to create a sustainable NFT identity and ecosystem that celebrates, rewards, and gamifies social and environmental good. [4]Users on their platform earn NFT Figure 1: The first 5000 Days[7] collectables by doing positive deeds in the world. Their NFTs represent a cause or goal that people worked hard for, a unique moment in time, that made the world a better place.[4] Leyline creates a source of business, which was the original idea of blochain companies creating NFTs. Real estate markets are ripe for disruption. Contracts, certifications, ownership and claim history will all be stored in the blockchain and publicly accessible.[4] Selling NFTs as a form of real estate can eliminate some of the duller points in purchasing real estate, such as piles of long, and boring paperwork. As well as it can mitigate Fraud. Once more real estate contracts get created as NFTs and stored on a secure blockchain, real estate fraud will be a thing of the past, as such Smart Contracts are nearly impossible to alter, easy to verify and permanently stored. Any digital asset created as an NFT enjoys this level of security.[4] Futurist and disrupter, gmoney adds, "Mortgages are also NFT's. Would the 2008 crisis have even happened if all the MBS indexes were fully transparent, on chain? There would have not been any possibility for re-hypothecation, underlying assets and leverage would have been able to be monitored in real-time, and the entire financial system wouldn't have come crumbling down, needing a bailout by taxpayers.[34] Finally, the Metaverse. A large and new world of virtual reality. Metaverses are virtual worlds where essentially the internet is brought to life. There is an abundant possibility within metaverse worlds, where you get to design your life, interact with real people in virtual communities, design your avatar, work, play, and explore new worlds by using virtual reality headsets, augmented reality glasses, smartphone apps or other devices which include incorporating virtual touch.[4] Entire virtual worlds are being created and built every single day. The rise in popularity of virtual reality is inevitable, especially if virtual reality is very similar to the real world. With the creation of NFT virtual worlds, buyers and creators will be able to interact with their purchases and creations, making them feel more real. Attracting people to the idea of NFTs they can interact with, and maybe even speak to through voice chat. One example of this is what is known as a "Sandbox" NFT game, it is an open world where you can do and create anything the users heart desires. ## Security Concerns of NFTs With all things that seem great and perfect, there are always consequences that come with it. NFTs are not the exception, especially in a world where the cyber world is a dangerous place and can cause great damage to someone's device, or even their life. Go Banking Rates[8] identifies five main security concerns for NFTs, and how they can be dangerous. Figure 2: Cost of gaming[5] The first one that is listed is Traditional Phishing Scams. Phishing is the fraudulent practice of sending emails purporting to be from reputable companies to induce individuals to reveal personal information, such as passwords and credit card numbers [6]. In about three hours in February 2022, more than $1.7 million in NFTs were stolen from OpenSea users via a simple phishing attack. Users were asked to sign online contracts allowing them to trade tokens, but vital portions of the authorizations were left blank. This allowed scammers to complete the forms and transfer NFT ownership from the original users [7]. As shown by the example above, scammers can disguise themselves as an NFT artist or trader to get sensitive information from users. To be more specific, a scammer could use spear phishing, which is a form of phishing used to attack a certain group or person. For example, someone could be looking for a specific NFT, a scammer could email that person advertising that they're willing to sell that specific NFT for a price. A spear phisher could get that person's card information, date of birth, and even social security if that person is not paying attention. Someone who doesn't know how to identify potential phishing scams could end up losing more money than they want to and could even have their sensitive personal information leaked. In the world of NFTs, there is no reliable way to see the reliability of Marketplaces. Although NFT markets now trade billions of dollars worth of NFTs, both the asset class and the marketplaces themselves are just in their infancy. While security protocols are in place, hackers are constantly looking for sources of weakness [6]. With these marketplaces, they store a lot of vital information about users. If a user uses the same password on the marketplace as they do on other platforms, the likelihood of information being stolen rises. These marketplaces are very susceptible to an attack. It is important for these marketplaces to store their data safely and ensure the security of a user's personal information but, that doesn't mean these marketplaces will do that. The next concern is the outright theft of tweets. One of the most fascinating aspects of the NFT market is that nearly anything can be turned into something of value [6]. One scam involves a tweet bot that automatically converts tweets into NFTs, which scammers could then immediately claim ownership over. In essence, if someone posts their own original work of art as a tweet, they could lose control over whatever they post if a scammer gets hold of it [6]. Theft of content is unethical, especially if that content does not have a patent or trademarks protecting the originality of the idea. In the world of Twitter and social media, content is constantly stolen. It is re-made in various forms but, the selling of this content can make it more difficult to be original and even create content. The loss of title and ownership records is another concern. NFTs don't have traditional paper trails that you can follow to prove ownership of your asset. When you buy a home, for example, legal title passes to you and is filed as a public record [6]. So, in all reality you could own the NFT one day, and the next day you aren't the owner anymore. This can cause a loss of money spent to get that NFT, especially if it was a more expensive one. As well as fights, which could resort to real-life violence. You never truly "own" an NFT, you simply have a license for it and a right to display it. Finally, legal issues can come into play. People can create illegal copies of the artwork. If you buy an NFT of a work of art, you don't physically take possession of the actual artwork. In fact, you likely don't even "own" the underlying art, just the digital image that you purchased [6]. This can make it hard to know if you even own the original of the artwork. For example, if you were rich enough to buy the original "Starry Night" by Vincent Van Gough, you would know it is the original that was made, yes there are copies of it but, there is truly only one original of the painting. ## Conclusion In conclusion, NFTs are becoming a more popular form of cryptocurrency. They are the future of many things such as the metaverse, real estate and so much more. It is a very interesting and unique world full of more history than we realized, and that even I, as the author realized. There are various factors that play into this creation that make it so unique and interesting to study. While I personally would not invest in this, I found that it was interesting to learn more about it and see how much of an impact it has on the world. New NFTs are being created every single day as well as being purchased every single day. It is a never-ending market that will only continue to grow and franchise. There is no doubt in my mind that this form of cryptocurrency will continue to grow, it is something that may never go away due to the uniqueness of the idea. While there are some security concerns, they are security concerns you are likely to experience in the real world.

2305.09387

Non-Hermitian Stark Many-Body Localization

Utilizing exact diagonalization (ED) techniques, we investigate a one-dimensional, non-reciprocal, interacting hard-core boson model under a Stark potential with tail curvature. By employing the non-zero imaginary eigenenergies ratio, half-chain entanglement entropy, and eigenstate instability, we numerically confirm that the critical points of spectral real-complex (RC) transition and many-body localization (MBL) phase transition are not identical, and an examination of the phase diagrams reveals that the spectral RC transition arises before the MBL phase transition, which suggests the existence of a novel non-MBL-driven spectral RC transition. These findings are quite unexpected, and they are entirely different from observations in disorder-driven interacting non-Hermitian systems. This work provides a useful reference for further research on phase transitions in disorder-free interacting non-Hermitian systems.

Han-Ze Li, Xue-Jia Yu, Jian-Xin Zhong

2023-05-16T12:11:43Z

http://arxiv.org/abs/2305.09387v3

# Non-Hermitian Stark Many-Body Localization ###### Abstract Utilizing exact diagonalization (ED) techniques, we investigate a one-dimensional, non-reciprocal, interacting hard-core boson model under a Stark potential with tail curvature. By employing the non-zero imaginary eigenenergies ratio, half-chain entanglement entropy, and eigenstate instability, we numerically confirm that the critical points of spectral real-complex (RC) transition and many-body localization (MBL) phase transition are not identical, and an examination of the phase diagrams reveals that the spectral RC transition arises before the MBL phase transition, which suggests the existence of a novel non-MBL-driven spectral RC transition. These findings are quite unexpected, and they are entirely different from observations in disorder-driven interacting non-Hermitian systems. This work provides a useful reference for further research on phase transitions in disorder-free interacting non-Hermitian systems. ## I Introduction Non-Hermitian quantum systems have garnered a surge of research interest over the past two decades [1; 2; 32]. This is due to their unique ability to host a range of novel quantum phase transitions (QPTs) without Hermitian counterparts, such as the spectral RC transitions, the topology phase transitions, and non-Hermitian skin effects, among others [33; 34; 35; 36; 37; 38; 39; 40; 41; 42]. The introduction of non-Hermiticity in quantum systems is typically achieved through the modulation of gain and loss in on-site energies or by manipulating non-reciprocal hopping. These two approaches exhibit distinct symmetries: the former maintains \(\mathcal{PT}\)-symmetry (referred to as NH-\(\mathcal{PT}\) systems), while the latter aligns with time-reversal symmetry (NH-TRS systems). In NH-\(\mathcal{PT}\) systems, Ref. [1] reports that where the on-site energies possess gain and loss, the eigenenergies are real if the system exhibits \(\mathcal{PT}\)-symmetry. Notably, the breaking of \(\mathcal{PT}\)-symmetry plays a crucial role in controlling the spectral RC transition observed in the eigenenergies. Conversely, NH-TRS systems exhibit another spectral RC transition induced by MBL. This was initially addressed in Ref. [43; 44]. Further investigations by Ref. [45] unveiled a comparable MBL-driven spectral RC transition in one-dimensional interacting NH-TRS systems subjected to a quasi-periodic potential. Remarkably, the critical points associated with the spectral RC transition and the MBL phase transition coincide in the thermodynamic limit for both random and quasi-periodic potentials [44; 45]. Despite the fact that disorder-induced systems, encompassing both random and quasi-periodic scenarios, do not belong to the same universality class from the perspective of the renormalization group (RG), disorder emerges as the overarching factor inducing MBL in both cases. However, it is important to note that disorder is not the sole mechanism leading to MBL (Anderson Localization [46], AL) in many-body (single-particle) systems. In the context of single-particle scenarios, the application of a gradient external electric field can give rise to states reminiscent of AL, exhibiting an exponential decay of localization in a system initially in an extended state. This phenomenon is known as Wannier-Stark localization [47], with the applied external electric field referred to as the Stark potential. Similarly, in the realm of many-body systems, the behavior of Stark many-body localization (SMBL) [48], akin to MBL, has been observed in both the static and dynamic responses of systems subjected to a Stark potential. Notably, compared to disorder-induced systems, these disorder-free systems exhibit cleaner and simpler characteristics, as evidenced by experimental observations [49; 50] and numerical simulations [51; 52]. Consequently, they provide a fresh platform for the exploration of MBL and offer promising prospects for a range of applications. Recent experimental realizations in ion traps [50] and superconducting circuits [49] have further demonstrated the feasibility of studying SMBL, underscoring the potential and exciting avenues for future exploration in this field. Naturally, several significant questions arise: Can MBL transitions and MBL-driven spectral RC transitions occur in disorder-free non-Hermitian many-body systems? Given the notable advantages offered by SMBL systems, including their suitability for experimental observations and numerical simulations, as well as their capacity to host novel QPTs, addressing this question is of significant interest and not to be underestimated. To address the aforementioned question, in this work, we investigate the spectral RC transition and MBL phase transition in a one-dimensional interacting NH-TRS hard-core bosonic chain model subjected to a Stark potential with a tail curvature. Through large-scale ED simulations, we observe the coexistence of the MBL and spectral RC phase transition in the phase diagram. However, we find that the critical points associated with the spectral RC transition and MBL phase transition are distinct in the thermodynamic limit. Notably, our analysis reveals the presence of a novel spectral RC transition that is not triggered from MBL. These findings present a striking departure from those observed in disorder NH-TRS many-body systems. The rest of the paper is organized as follows: Section II contains an overview of the interacting NH-TRS model under Stark potential and the numerical methods employed. Section III shows the numerical results and identifies the physical quantities necessary for detecting spectral RC transition and MBL phase transition. The resolution is described in Section IV. Additional data supporting our numerical calculations can be found in the Appendixes. ## II Model and Method We consider a one-dimensional interacting NH-TRS hard-core boson model with a Stark potential, consisting of \(L\) sites, which is represented as follows, \[\hat{H}=\sum_{j=1}^{L}\left[-t(e^{-g}\hat{b}_{j+1}^{\dagger}\hat{b}_{j}+e^{g} \hat{b}_{j}^{\dagger}\hat{b}_{j+1})+U\hat{n}_{j}\hat{n}_{j+1}+\Delta_{j}\hat{n }_{j}\right]. \tag{1}\] In the given context, \(L\) denotes the length of the lattice. The terms \(t_{L}\equiv te^{g}\) and \(t_{R}\equiv te^{-g}\) represent the nonreciprocal hopping strengths towards the left and right respectively, where \(g\) is the strength of non-reciprocal hopping. The parameter \(U\) characterizes the strength of the nearest-neighbor interaction. The term \(\Delta_{j}\) embodies the Stark potential, which is given as follows: \[\Delta_{j}\equiv-\gamma j+\alpha(j/L)^{2}. \tag{2}\] Here, \(\gamma\) symbolizes the strength of the Stark potential and \(\alpha\) signifies the curvature of its tail. The operator \(\hat{b}_{j}\) and \(\hat{b}_{j}^{\dagger}\) denote the annihilation and creation operations of hard-core boson at the site \(j\), respectively. They conform to the commutation relation \([\hat{b}_{k},\hat{b}_{l}^{\dagger}]=\delta_{kl}\). The number operator for particles is denoted as \(\hat{n}_{j}\equiv\hat{b}_{j}^{\dagger}\hat{b}_{j}\), signifying the count of particles at site \(j\). In this model, we highlight several key features: (a) In the case where \(U=0\) and \(g=0\), the model reverts to a Hermitian, single-particle scenario. Under these conditions, a Stark potential can induce what is known as Wannier-Stark localization. (b) The non-Hermitian setting of our model is pertinent to the scenario of continuously monitored quantum many-body systems. Our focus lies on single quantum trajectories without quantum jumps, that is, the post-selection of pure states as the outcome of the measurement. This approach provides a contrast to the Gorini-Kossakowski-Sudarshan-Lindblad equation methods for open system dynamics [53; 54], which yield average results. (c) The tail curvature parameter \(\alpha\) confers stability to the MBL properties of systems under Stark potentials. In this paper, we use the ED method, with the aid of the QuSpin package [55], to numerically derive the solutions pertaining to Eq. (1). The parameters of the model are chosen as follows: \(t=1.0\), \(U=1.0\), \(\alpha=0.5\), and \(g=0.1\). A fixed particle-number subspace with \(M=L/2\) particles is considered, which corresponds to a half-filled system. We assert that the RC transitions in Eq. [1] are robust against changes in the boundary conditions. We have placed the numerical results and discussions for open boundary conditions (OBCs) in Appendix B. ## III Numerical Results ### Phase diagram The ground-state phase diagrams for Stark potential strength \(\gamma\) in Eq. [1] are obtained by performing ED simulations with sizes \(L=10,12,14,16\), as shown in FIG. 1. In FIG. 1(b), we fix the interaction strength at \(U=1.0\). The blue dashed line on the left represents the increase of eigenenergies with a nonzero ratio \(f_{\rm Im}\) as the size \(L\) increases. Conversely, on the right, it corresponds to the decrease of \(f_{\rm Im}\) with increasing \(L\). The black dotted line on the left signifies the growth of the eigenstate stability \(\mathcal{G}\) with increasing \(L\), whereas, on the right, it signifies Figure 1: (Color online) Schematic of the three phases under Stark potential (a), phase diagrams of non-reciprocal hopping strength \(g\) and Stark potential strength \(\gamma\) (b), and interaction strength \(U\) and Stark potential \(\gamma\) (c). In (a), we denote by CE phase in which the spectrum is complex and occupies an ergodic phase. The term RE is used for a phase featuring a real spectrum also in an ergodic phase. Meanwhile, the acronym RMBL characterizes a phase with a real spectrum, but in a MBL phase. In (b) and (c), the blue markers stand for the numerical outcomes procured through ED, with the associated error bars calculated based on each respective data point. The blue dotted line, a result of fitting efforts, signifies the spectral transition boundaries. The black markers, on the other hand, are indicative of eigenstate instability outcomes. The black dashed line, another fitting result, serves to demarcate the border between MBL and ergodic phase. the decrease of \(\mathcal{G}\) as \(L\) expands. The Complex-Ergodic (CE, the yellow region), characterized by a complex energy spectrum, depicts an area where both \(\mathcal{G}\) and \(f_{\text{Im}}\) increase with the enlargement of dimension \(L\), signifying that the system resides in an ergodic phase. The Real-Ergodic (RE, the green region), marked by a real energy spectrum, represents an area where \(\mathcal{G}\) decreases and \(f_{\text{Im}}\) increases with the expansion of dimension \(L\), indicating that the system inhabits an ergodic regime. The Real-MBL (RMBL, the purple region), distinguished by a real energy spectrum, corresponds to an area where both \(\mathcal{G}\) and \(f_{\text{Im}}\) decrease as dimension \(L\) expands, denoting that the system is in MBL regime. In FIG. 1(c), with non-reciprocal strength \(g\) set at \(g=0.1\), we identify three regions. CE is characterized by an increase in both \(\mathcal{G}\) and \(f_{\text{Im}}\) as the size \(L\) expands. Conversely, RE depicts a scenario where \(\mathcal{G}\) diminishes with an enlarging \(L\), while \(f_{\text{Im}}\) continues to rise. Lastly, RMBL signifies an area where both \(\mathcal{G}\) and \(f_{\text{Im}}\) decrease in response to the growth of \(L\). The error bars are deduced from the shifts at the transition points across various system sizes. In the non-interacting limit where \(U=0\), the transitions coincide, aligning with the conclusions of Ref. [56]. This alignment implies that the spectral transition behavior demonstrated by the MBL phase transition is consistent with RC transition. Nevertheless, in the presence of interactions, these two transitions diverge as \(U\) increases. This divergence suggests that an intermediate phase arises as \(U\) intensifies, a phase solely observed in non-Hermitian SMBL systems. ### Spectral RC transitions Eigenenergies with a nonzero imaginary part ratio serve as a robust probe for detecting spectral RC transitions throughout the entire energy spectrum [44]. It is defined across the whole spectrum as \[f_{\text{Im}}=D_{\text{Im}}/D. \tag{3}\] Here, \(D_{\text{Im}}\) represents the number of eigenenergies with non-zero imaginary components. To remove potential inaccuracies arising from numerical techniques, we define eigenenergies \(E_{\alpha}\) to have non-zero imaginary parts when \(\text{Im}(E_{\alpha})\gg C\) (\(C=10^{-13}\)). Simultaneously, \(D\) denotes the total number of eigenenergies. If all eigenenergies are purely real, it corresponds to \(f_{\text{Im}}=0\), while in the extreme case where all eigenenergies are complex, this occurs at \(f_{\text{Im}}=1\). It's important to note that the critical point and critical exponent in this case differ substantially from those of disorder-driven systems, suggesting that they are not part of the same universal class of criticality. The spectral RC transition of eigenenergies at size \(L=12\) under \(\gamma=0.2\) and \(\gamma=4.0\) is depicted in FIG. 5(a) and FIG. 5(b) respectively. Owing to the TRS, all eigenenergies with imaginary parts are symmetrically distributed along the real axis. Notably, when \(\gamma=0.2\), there are a greater number of eigenenergies with non-zero imaginary parts. Conversely, in a deeper MBL region, specifically when \(\gamma=4.0\), almost all eigenvalues fall on the real axis. FIG. 2(c) illustrates a critical point, \(\gamma_{c}^{f}\approx 0.42\pm 0.15\), beyond which the value of \(f\)Im decreases as \(\gamma\) increases. The rescale function \((\gamma-\gamma_{c}^{f})L^{1/\nu}\), utilized in FIG. 2(d), reveals a critical exponent of \(\nu\approx 0.78\pm 0.10\). ### MBL phase transitions Level-spacing statistics provide an effective method to probe the energy spectra of quantum systems, revealing characteristics of the Hamiltonian such as integrable-chaotic spectra, QPTs, and symmetry-breaking phenomena. Nevertheless, due to differences in Hermitian properties, the level-spacing statistical analysis applied in Hermitian systems cannot be directly utilized for non-Hermitian systems [57; 58; 59]. As a result of changes in matrix symmetries, the 10-fold symmetry classification in Hermitian systems expands to a 38-fold classification in the non-Hermitian realm [60; 61; 62]. Given that eigenvalues in non-Hermitian systems are points distributed across a two-dimensional (2D) complex plane, the complex level-spacing \(s_{m}\) serves as the statistical data. The geometric distance between the nearest eigenvalues in the complex plane, denoted as \(s_{\alpha}\), is defined with \(s_{m}\equiv\min_{l}|E_{m}-E_{l}|\)[44; 63]. As previously discussed, in the delocalization phase, the non-Hermitian probability distribution \(p(s)\) follows the Ginibre distribution \(P_{\text{Gin}}^{\text{C}}(s)=cp(cs)\). This distribution characterizes an ensemble of non-Hermitian Gaussian random matrices [59]. The specific form of this distribution is given by: \[p(s)=\lim_{N\rightarrow\infty}\left[\prod_{n=1}^{N-1}e_{n}(s^{2})e^{-s^{2}} \sum_{n=1}^{N-1}\frac{2s^{2n+1}}{n!e_{n}(s^{2})}\right] \tag{4}\] where, \[e_{n}(x)=\sum_{m=0}^{n}\frac{x^{m}}{m!} \tag{5}\] and \[c=\int_{0}^{\infty}dssp(s)=1.1429\cdots. \tag{6}\] For the MBL phase, with the eigenenergies being localized on the real axis during this stage, the level-spacing statistics follow a Poisson distribution [59], denoted as \[P_{\text{Po}}^{\text{R}}(s)=e^{-s}. \tag{7}\] In analyzing the level-spacing statistics of non-Hermitian systems, we concentrate on eigenenergies situated at the center of the spectrum. We include both real and imaginary components within a \(\pm 10\%\) range, as specified in Ref. [44]. As depicted in FIG. 3(a), the distribution conforms to the Ginibre distribution when the Stark potential strength is set to \(\gamma=0.2\). Yet, when the Stark potential strength is increased to \(\gamma=4.0\), the distribution transitions to follow the Poisson distribution, as shown in FIG. 3(b). This finding suggests that the system undergoes a MBL phase transition in response to variations in the Stark potential strength. Upon confirming the existence of an MBL phase transition in the system, we turn to get the critical information. Firstly, we consider the half-chain entanglement entropy, restricting our calculations to right eigenstates \(\ket{\varepsilon_{n}^{r}}\) within a central range of the real and imaginary parts, specifically those within \(\pm 4\%\)[64]. The specific form is as follows: \[S_{n}=\text{Tr}_{L/2}[\ket{\varepsilon_{n}^{r}}\bra{\varepsilon_{n}^{r}}]. \tag{8}\] FIG. 3(c) and (d). depicts the relationship between the selected half-chain entanglement entropy of eigenstates and Stark potential strength as a function of size \(L\). In FIG. 3(c), it is clearly visible that there is a transition from volume law to area law for the entanglement entropy around the critical point. We have set the function form for the critical scaling collapse as \((\gamma-\gamma_{c})L^{1/\nu}\). FIG. 3(d) presents the rescaled curve, from which we have identified the range of the critical point as \(\gamma_{c}\approx 1.92\pm 0.24\), and the critical exponent as \(\nu\approx 0.90\pm 0.10\). However, for interacting NH-TRS Hamiltonian, the choice of eigenstates can influence the quantitative results of the critical values [64]. A more effective method to understand MBL phase transitions is through the examination of eigenstate instability. A defining feature of localized eigenstates is their robustness against local disturbances [65; 66]. In the realm of non-Hermitian quantum many-body systems that uphold TRS, localization prompts the clustering of imaginary eigenenergies onto the real axis. Therefore, introducing localized perturbations to examine the stability of eigenstates against such perturbations becomes critical. This approach serves as a way to identify MBL phase transitions in Hermitian systems. Within the non-Hermitian framework, we can define a stability index for the eigenstates as follows: \[\mathcal{G}=\ln\frac{|\bra{\varepsilon_{a+1}^{l}}\hat{V}_{NH}\ket{\varepsilon_ {a}^{r}}\ket{\varepsilon_{a}^{l}}}{|\varepsilon_{a+1}^{r}-\varepsilon_{a}^{r}|} \tag{9}\] Here, \(\ket{\varepsilon_{a}^{l}}\) and \(\ket{\varepsilon_{a}^{r}}\) represent the left and right eigenstates of the non-Hermitian Hamiltonian \(\hat{H}\), respectively. The perturbation term is given by \(\hat{V}_{\text{NH}}=\hat{b}_{j}^{\dagger}\hat{b}_{j+1}\). We obtain \(\varepsilon_{a}^{\prime}=\varepsilon_{a}+\bra{\varepsilon_{a}^{l}}\hat{V}_{ \text{NH}}\ket{\varepsilon_{a}^{r}}\). And the set of \(\{\varepsilon_{a}^{\prime}\}\) is also positive and sorted in ascending order. For the ergodic phase, \(\partial G/\partial L>0\) is valid [67; 68], whereas for the localization phase, \(\partial G/\partial L<0\) is observed [69]. For the choice of the local operator \(\hat{V}_{\text{NH}}\), we follow the same form as described in Ref. [44]. As depicted in FIG. 3(e), the results showcase the dependence of the eigenstate stability, \(\mathcal{G}\), on \(\gamma\). Before the critical point \(\gamma_{c}^{\text{MBL}}\), \(\mathcal{G}\) increases with the increase in size \(L\), indicating an ergodic phase represented by \(\mathcal{G}\sim\zeta L\). However, after the critical point \(\gamma_{c}^{\text{MBL}}\), \(\mathcal{G}\) decreases as the size \(L\) grows, signifying a MBL phase represented by \(\mathcal{G}\sim-\eta L\). As illustrated in FIG. 3(f), we have identified the critical value as \(\gamma_{c}^{\text{MBL}}=2.17\pm 0.10\) and the critical exponent is \(\nu\approx 0.63\pm 0.11\). This numerical result contrasts significantly with the behavior observed in disorder-induced interacting NH-TRS systems, where these two types of transitions typically occur concurrently. But, In interacting NH-TRS under Stark potential with tail curvature, the system initially undergoes an spectral RC transition, followed by an MBL phase transition. This sequence does not contradict the notion that MBL can bring the imaginary energies together. This is completely different from disorder-induced interacting NH-TRS systems. However, the fact that MBL occurs after the spectral RC transition suggests that the Stark potential begins to influence the spectral RC transition even before the onset of the MBL phase transition. This guides the system through a previously unexplored intermediate phase, termed RE, where the spectral RC transition is not primarily driven by MBL. We choose not to delve into an extensive discussion about this observation in the current work, but we anticipate a systematic investigation of this intriguing issue in future studies. Moreover, although the topological phase transition is not closely related to the primary focus of our study, we do observe its presence in the interacting Stark system with non-reciprocal hopping. However, the behavior of topological phase transitions in non-Hermitian interacting systems is complex. Therefore, for the benefit of the readers, we have included the numerically observed results obtained using ED in A. ### Dynamics of transitions We now focus to the dynamical behavior of the system in response to phase transitions. The half-chain entanglement entropy dynamics \(S(t)\), it is given by \[S(t)=-\text{Tr}[\rho(t)\ln\rho(t)], \tag{10}\] where \(\rho(t)\) represents the reduced density matrix, including no quantum jump [70]. Explicitly, \[\rho(t)=\frac{\text{Tr}_{L/2}\left[\ket{\varepsilon^{r}(t)}\bra{\varepsilon^{ r}(t)}\right]}{\ket{\varepsilon^{r}(t)}\bra{\varepsilon^{r}(t)}}. \tag{11}\] As illustrated in FIG. 4(a), we examine the dynamic trajectory of the half-chain entanglement entropy in both the Hermitian boundary case (\(g=0\)) and the non-Hermitian scenario (\(g=0.1\)). We do this for two distinct phases: an ergodic phase with \(\gamma=0.2<\gamma_{c}^{\text{MBL}}\) and a localized phase with \(\gamma=4.0>\gamma_{c}^{\text{MBL}}\). In FIG. 4(a), during the ergodic phase, a notable difference emerges between the Hermitian case \(g=0\) (represented by the blue dashed line) and the non-Hermitian case \(g=0.1\) (represented by the green solid line). For \(g=0\), the entanglement entropy \(S(t)\) initially exhibits linear growth, then stabilizes around \(S(t)\approx 3.4\). In contrast, for \(g=0.1\), \(S(t)\) initially grows linearly until \(t\approx 20\), then decreases and eventually stabilizes at \(S(t)\approx 1.5\). Conversely, in the MBL phase (\(\gamma=4.0\)), both \(g=0\) and \(g=0.1\) exhibit slow logarithmic growth of \(S(t)\). This observation is consistent with the dynamics of entanglement entropy in disorder-driven MBL systems [44; 45]. In the MBL phase, the influence of \(g\) merely results in an overall upward shift of \(S(t)\), as indicated by the gray dotted line. The distinctive behavior between the Hermitian and non-Hermitian cases in the ergodic phase can be attributed to the eigenstates of complex eigenvalues. For non-Hermitian systems in the ergodic phase, we observe an unusual decrease following a certain growth in the half-chain entanglement entropy. As the system enters the ergodic phase, the number of complex eigenenergies increases, leading to a Figure 3: (Color online) The MBL phase transition. (a) Depicts the level-spacing distribution for \(\gamma=0.2\), with the red solid line indicating the Ginibre distribution. (b) Displays the level-spacing distribution for \(\gamma=4.0\), with the red solid line corresponding to the Poisson distribution. (c) Illustrates the relationship between the half-chain entanglement entropy and the Stark gradient potential \(\gamma\) for various sizes \(L\). (d) Offers a fit to the data from (c) using the scaling function \((\gamma-\gamma_{c})L^{1/\nu}\), yielding a critical point \(\gamma_{c}\approx 1.92\pm 0.24\) and critical exponent \(\nu\approx 0.90\pm 0.10\). (e) Portrays the dependence of eigenstate instability on the Stark gradient potential \(\gamma\) for different sizes \(L\). (f) Presents a fit of the data in (e), with the approximated critical point being \(\gamma_{c}^{\text{MBL}}\approx 2.17\pm 0.10\) and the approximated critical exponent being \(\nu\approx 0.63\pm 0.11\). gradual reduction in entanglement over time. Ultimately, the entanglement entropy stabilizes at a specific value, denoting the influence of non-Hermiticity on entanglement dynamics in the ergodic phase. However, in the MBL phase, in the absence of eigenstates with non-zero imaginary parts of their eigenenergies, both the Hermitian and non-Hermitian cases exhibit similar behavior. When exposed to extreme disorder or intense Stark potentials, highly excited eigenenergies transition to purely real values. This transition induces a significant shift in the dynamic properties of the system. A primary measure of this transformative dynamic behavior is reflected in the evolution of the real part of the energy within the system [44], \[E^{R}(t)=\mathrm{Re}[\bra{\Psi(t)}\hat{H}\ket{\Psi(t)}]. \tag{12}\] And, \[\ket{\Psi(t)}=\frac{e^{-i\hat{H}t}\ket{\Psi_{0}}}{||e^{-i\hat{H}t}\ket{\Psi_{0} }||}. \tag{13}\] FIG. 4(b) depicts the response of the real part of the eigenenergy, denoted as \(E^{R}(t)\), to the phase transition. For \(\gamma\leq\gamma_{c}^{f}\), a decrease in \(E^{R}(t)\) around \(t=10\) followed by stabilization is observable. However, this behavior is absent when \(\gamma>\gamma_{c}^{f}\). Additionally, we examined the fluctuation of \(E^{R}(t)\), as presented in FIG. 4(c), defined as \(\Delta E^{R}(t)=\max E^{R}(t)-\min E^{R}(t)\), across different \(\gamma\) parameters. Notably, a sharp drop in \(\Delta E^{R}(t)\) starting around \(\gamma=0.4\) was observed. This feature echoes the vicinity of \(\gamma_{c}^{f}\) in static situations, signaling the onset of the spectral RC transition. ## IV Conclusion and outlook In conclusion, through ED simulations, we have examined the critical behavior of spectral RC transition and MBL phase transition in a one-dimensional interacting NH-TRS hard-core boson chain subjected to Stark potential. By employing the ratio of non-zero imaginary eigenenergies and eigenstate instability as indicators, we've constructed a ground state phase diagram spanning CE, RE, and RMBL phases. As the Stark potential intensifies, we identified the critical point for the MBL phase transition at \(\gamma_{c}^{\mathrm{MBL}}\approx 1.92\pm 0.24\), and for the spectral RC transition at \(\gamma_{c}^{f}\approx 0.42\pm 0.15\). Moreover, we've analyzed the dynamical behavior of both the real part of the eigenenergy and the entanglement entropy. Unexpectedly, our study revealed that in an interacting NH-TRS system with Stark potential, the critical points for spectral RC transition and MBL phase transition at the thermodynamic limit are not identical. Most notably, Upon evaluating the phase diagram, we find that the spectral RC transition occurs before the MBL phase transition. This suggests the existence of a new non-MBL-driven mechanism for spectral RC transitions in interacting NH-TRS systems with Stark potential. Such a discovery sharply contrasts with disordered interacting NH-TRS systems, where spectral RC transition and MBL phase transition occur simultaneously in the thermodynamic limit. The theoretical foundation of this finding could be further elucidated in future work. Our discoveries open up a new avenue for the exploration of novel QPTs in disorder-free interacting non-Hermitian quantum systems. _Note added:_ A follow-up study titled "From Ergodicity to Many-Body Localization in a One-Dimensional Interacting Non-Hermitian Stark System" [_arXiv:2305.13636_] [71] also finds alignment with our results in a similar model utilizing periodic boundary conditions (PBCs). This serves to further validate and underline the robustness of our findings within non-Hermitian many-body systems under the influence of a Stark potential. Figure 4: (Color online) Dynamics of the transition. (a) The dynamics of the half-chain entanglement entropy \(S(t)\) for \(U=1.0,g=0.1,\gamma=0.2\) (green solid line), \(U=1.0,g=0,\gamma=0.2\) (blue dashed line), \(U=1.0,g=0.1,\gamma=4.0\) (red solid line), \(U=1.0,g=0,\gamma=4.0\) (lime dashed line), and \(U=1.0,g=0.8,\gamma=0.2\) (blue dashed line). (b) The evolution of \(E^{R}(t)\) for \(\gamma\) ranging from \(0.1\) to \(1.0\). The color bar shows the values of different \(\gamma\). (c) \(\Delta E^{R}(t)\) as a function of \(\gamma\). ###### Acknowledgements. We gratefully acknowledge the National Natural Science Foundation of China (Grant No. 11874316), the National Basic Research Program of China (Grant No. 2015CB921103) and the Program for Changjiang Scholars and Innovative Research Team in University (Grant No. IRT13093).

2302.12066

Teaching CLIP to Count to Ten

Large vision-language models (VLMs), such as CLIP, learn rich joint image-text representations, facilitating advances in numerous downstream tasks, including zero-shot classification and text-to-image generation. Nevertheless, existing VLMs exhibit a prominent well-documented limitation - they fail to encapsulate compositional concepts such as counting. We introduce a simple yet effective method to improve the quantitative understanding of VLMs, while maintaining their overall performance on common benchmarks. Specifically, we propose a new counting-contrastive loss used to finetune a pre-trained VLM in tandem with its original objective. Our counting loss is deployed over automatically-created counterfactual examples, each consisting of an image and a caption containing an incorrect object count. For example, an image depicting three dogs is paired with the caption "Six dogs playing in the yard". Our loss encourages discrimination between the correct caption and its counterfactual variant which serves as a hard negative example. To the best of our knowledge, this work is the first to extend CLIP's capabilities to object counting. Furthermore, we introduce "CountBench" - a new image-text counting benchmark for evaluating a model's understanding of object counting. We demonstrate a significant improvement over state-of-the-art baseline models on this task. Finally, we leverage our count-aware CLIP model for image retrieval and text-conditioned image generation, demonstrating that our model can produce specific counts of objects more reliably than existing ones.

Roni Paiss, Ariel Ephrat, Omer Tov, Shiran Zada, Inbar Mosseri, Michal Irani, Tali Dekel

2023-02-23T14:43:53Z

http://arxiv.org/abs/2302.12066v1

# Teaching CLIP to Count to Ten ###### Abstract Large vision-language models (VLMs), such as CLIP, learn rich joint image-text representations, facilitating advances in numerous downstream tasks, including zero-shot classification and text-to-image generation. Nevertheless, existing VLMs exhibit a prominent well-documented limitation - they fail to encapsulate compositional concepts such as counting. We introduce a simple yet effective method to improve the quantitative understanding of VLMs, while maintaining their overall performance on common benchmarks. Specifically, we propose a new counting-contrastive loss used to finetune a pre-trained VLM in tandem with its original objective. Our counting loss is deployed over automatically-created counterfactual examples, each consisting of an image and a caption containing an incorrect object count. For example, an image depicting three dogs is paired with the caption "Six dogs playing in the yard". Our loss encourages discrimination between the correct caption and its counterfactual variant which serves as a hard negative example. To the best of our knowledge, this work is the first to extend CLIP's capabilities to object counting. Furthermore, we introduce "CountBench" - a new image-text counting benchmark for evaluating a model's understanding of object counting. We demonstrate a significant improvement over state-of-the-art baseline models on this task. Finally, we leverage our count-aware CLIP model for image retrieval and text-conditioned image generation, demonstrating that our model can produce specific counts of objects more reliably than existing ones. + Footnote †: The first author performed this work as an intern at Google Research. Project page: [https://teaching-clip-to-count.github.io/](https://teaching-clip-to-count.github.io/) + Footnote †: The first author performed this work as an intern at Google Research. Project page: [https://teaching-clip-to-count.github.io/](https://teaching-clip-to-count.github.io/) ## 1 Introduction Since the advent of CLIP [39], training large vision-language models (VLMs) has become a prominent paradigm for representation learning in computer vision. By observing huge corpora of paired images and captions crawled from the Web, these models learn a powerful and rich joint image-text embedding space, which have been employed in numerous visual tasks, including classification [60, 61], segmentation [28, 57], motion generation [49], image captioning [32, 50], text-to-image generation [10, 30, 34, 42, 46] and image or video editing [3, 54, 17, 24, 37, 5]. Recently, VLMs have also been a key component in text-to-image generative models [4, 42, 45, 40], which rely on their textual representations to encapsulate the rich and semantic meaning of the input text prompt. Despite their power, prominent VLMs, such as CLIP [39] and BASIC [38], are known to possess a weak understanding of compositional concepts, such as the relation between objects or their number present in the image [29, 39, 51]. This is demonstrated in Fig. 1, where, when given a caption of the template "a photo of \(\{number\}\)\(\{objects\}\)", CLIP often fails to retrieve images that correctly match the described number. Downstream applications that rely on VLM-based representations inherit these limitations, e.g., image generation models struggle to reliably produce specific counts of objects [55]. In this work, we focus on the counting task and introduce a novel method that enhances the quantitative understanding of large-scale VLMs by encouraging them to produce representations that are sensitive to the number of objects in the image and text. We hypothesize that the reason existing VLMs fail to learn the concept of counting is twofold: (\(i\)) Captions that accurately specify the number of objects become extremely rare in the data as the number of objects increases. For example, we found that for more than six objects, captions would typically contain a general form of quantity, e.g., "a group of..." or "many..", rather than an accurate count. (\(ii\)) Even with such examples in hand, the task of counting, i.e., associating the visible number of objects in an image with the number in the caption, does not sufficiently contribute to the VLM's discriminative training objective. This is because other textual and visual features (e.g., nouns and object categories) are more informative for associating an image with its true caption. We thus suggest to mitigate each of these problems by: (\(i\)) Creating suitable training data in which the captions contain accurate numbers of objects. (\(ii\)) Designing a training objective whereby understanding object counts is critical for discriminating between the correctly associated caption and incorrect ones. More specifically, as illustrated in Fig. 2, we automatically create a clean and diverse _counting training set_ by curating image-text examples where the image depicts multiple objects and its caption expresses their count (e.g., Fig. 4). To do so, we employ off-the-shelf computer vision tools to cross-validate the number of observed objects in the image with the textual number in the caption. We then finetune a pretrained VLM by formulating counting as a discriminative task - for each example, we create a counterfactual caption by swapping the spelled number associated with the object count with a different randomly selected number. The model's objective is then to associate the image correctly with its true count caption, discriminating it from the negative one. To evaluate our method, we introduce _CountBench_ - a carefully curated object counting benchmark, consisting of 540 diverse, high quality image-text examples. We evaluate our method on two prominent contrastive VLMs: CLIP [39] and BASIC [38], and demonstrate a significant improvement in accuracy in the task of zero-shot count classification over baseline models. Importantly, we achieve this while maintaining the original knowledge learned by the VLM, as demonstrated by an extensive evaluation of our model on standard zero-shot downstream tasks. The quantitative understanding of our model is further evident by our text-to-image retrieval results (e.g., Fig. 1(a)), as well as by the relevancy maps of our model, which demonstrate that the model correctly attends to all visible objects whose count is specified in the text (e.g., Fig. 1(b)). Finally, we train a large-scale text-to-image generative model [45] which incorporates our counting training set and finetuned CLIP text encoder. The generated images from this model exhibit higher fidelity to the number of objects specified in the input prompts (Fig. 9). To summarize, our main contributions are: 1. A novel training framework for tackling the task of vision-language counting - an important limitation of current VLMs. 2. A new benchmark, "_CountBench_", carefully filtered and validated for evaluating VLMs on the counting task. 3. We apply our method to the widely-adopted VLMs, CLIP [39] and BASIC [38], demonstrating significant improvement on the counting task, while maintaining zero-shot accuracy on common benchmarks. 4. We utilize our counting-aware VLMs for downstream tasks including image retrieval and text-to-image generation, demonstrating more reliable results when the text prompt contains a specific number of objects. ## 2 Related work Contrastive vision-language modelsVision-language models have demonstrated impressive success in vision and multimodal tasks [39, 38, 2, 48, 39]. These models are trained on huge image-text datasets, and applied for downstream applications in a zero-shot manner or via finetuning. In this work, we focus on contrastive VLMs, such as CLIP [39] and BASIC [38], as they are widely used both for downstream applications and as backbones for generative vision-language models [41, 45]. CLIP [39] is trained on 400 million pairs of images and captions collected from the Web, using a contrastive objective, where matching text-image pairs should have a low cosine distance, and non-matching texts and images should be far apart. The model consists of a transformer [53] text backbone and a ViT [14] or ResNet [18] vision backbone. The representations computed by CLIP have proven to be very effective in vision and multimodal tasks, due to their zero-shot capabilities and semantic nature, and have been widely used as a prominent component in numerous tasks and methods. BASIC [38] scaled up the size of the model, batch size and dataset, improving zero-shot accuracy on common benchmarks, and uses CoAtNet [11] for its vision backbone. Compositionality and counting in vision-language modelsWhile demonstrating impressive recognition capabilities, large VLMs such as CLIP [39] and BASIC [38] are known to only partially capture the meaning of the text. Numerous works [29, 51, 39] have shown that they fail to understand compositional concepts, such as the relation between objects or their number in the image. Paiss et al. [36] demonstrated that CLIP attends to only a small subset of its input, mainly the nouns, and often ignores adjectives, numbers and prepositions. Counting has remained a stand-alone task under the domain of visual question answering (VQA), tackled with specifically designed architectures and techniques. Some approaches used are counting-specific architectures, such as a layer that infers the number of objects from the normalized attention weights [59], relation networks to model the relations between foreground and background regions [1], and others [33]. Our work defers from these prior efforts in several key aspects: (\(i\)) While previous efforts are restricted to VQA architectures and problem formulation, our goal is to improve the quantitative understanding of general-purpose contrastive VLMs (e.g., CLIP and BASIC), used in various vision and multimodal tasks where counting-aware solutions are not currently available. (\(ii\)) Our work can enhance the zero-shot counting capabilities of VLMs to unrestricted objects, unlike prior methods that are trained on specific domains, which can be problematic for new domains where no counting labels are available. Figure 2: **Method overview** (a) We create a text-image counting training set in which each caption expresses the number of objects depicted in the corresponding image. This is done by using an off-the-shelf object detector to automatically identify text-image examples in which the text count matches the number of visible objects in the image (see Sec. 3.1). (b) We finetune a pre-trained CLIP model using our counting subset (a), through a dedicated contrastive objective \(L_{count}\), used in addition to the original (general) text-image contrastive objective (\(L_{clip}\)). Specifically, given a text-image example from our counting subset, we automatically create a counterfactual prompt by replacing the true object count in the original caption with an incorrect count; \(L_{count}\) encourages the model to embed the image close to its original caption embedding (expressing the true object count) and far from its counterfactual count. (see Sec. 3.2). Text-conditioned generationThe field of text-to-image generation has made significant progress in recent years, mainly using CLIP as a representation extractor. Many works use CLIP to optimize a latent vector in the representation space of a pretrained GAN [10, 17, 30, 37], others utilize CLIP to provide classifier guidance for a pretrained diffusion model [3], and [5] employ CLIP to optimize a Deep Image Prior model [52] that correctly edits an image. Recently, the field has shifted from employing CLIP as a loss network for optimization, and into using it as a backbone in huge generative models [41, 45], resulting in impressive photorealistic results. However, these methods inherit the limitations of the VLMs. Text-to-image generation methods that use CLIP fail to reliably produce specific counts of objects [45, 56], and understand syntactic processes [27, 43]. While several attempts have been made to improve the correspondence of text-guided generated images [15, 31], they focus on the generative pipeline, while we attempt to improve the text representations themselves. ## 3 Method Our goal is to teach a pre-trained VLM (e.g., CLIP) to count, i.e., to improve its quantitative textual and visual understanding. Our framework, illustrated in Fig. 2, consists of two main stages. We first automatically create a _counting training set_, comprising clean and diverse images along with corresponding captions that describe the number of visible objects in the scene. We then leverage this dataset to finetune the VLM through a designated count-based contrastive loss that is used in tandem with the original generic image-text objective. More specifically, our key idea is to automatically generate counterfactual examples by swapping the true object count in the caption with a different random number. Our new counting loss encourages the model to embed an image close to its true count, as expressed by the original caption, while pushing it away from the embedding of the counterfactual count prompt. As the only difference between the correct caption and their counterfactual counterparts is a single word--the spelled number of objects--the model has to distinguish between the correct and incorrect count in order to succeed in its training task. Next, we describe our dataset creation and finetuning paradigm in detail. ### Creating an image-text counting train set A naive approach for obtaining an image-text counting dataset is to filter a large-scale dataset by considering only the examples in which the caption contains a number. However, this approach results in a highly noisy dataset, since the number in the caption often refers to other attributes that are unrelated to counting, such as age, time, addresses etc, as seen in Fig. 3. Recall that the crux of our method is a constrastive loss w.r.t. hard negatives which differ from the original caption only by the number of objects described. Thus, it is critical to ensure that a given image-text pair not only contains a number, but also that the number correctly refers to the number of instances of a particular object in the image. To verify these conditions, we employ several stages of automatic filtering in our data pipeline (Fig. 2 (a)): First, we filter out all examples whose caption does not contain a spelled number \(\in\{``two",\dots,``ten"\}\). We do so, as we observed that non-spelled numbers, or numbers higher than ten, mostly appear in conjunction with a measure of time, (e.g. dates) or addresses, rather than numbers of objects present in the image. In the second stage, we verify that the spelled numbers indeed serve as object counters, and that the counted objects are visible and detectable in the image. For example, for the caption "A photo of _three_ dogs", we verify that the image indeed depicts three visible dogs, no more, and no less. Only then can we use this as a _positive caption_, and replace the number to create _negative captions_, e.g., "A photo of _five_ dogs". This count verification is achieved automatically by first applying an off-the-shelf object detector [23], and counting the number of detections per object. We assume that the caption refers to the most prevalent object in the image. Thus, we retain only examples for which the number specified in the caption aligns with the number of instances of the maximally-detected object. We denote by \(C\) our automatically filtered train set. Figure 3: **Examples of image captions where the numbers are NOT related to object counts. These are automatically filtered-out by our method. In all above examples the numbers indicated in the caption do not refer to an actual object count. Numbers often specify measures, versions, dates, time, written numbers in the image, or numbers that refer to things not visible in the image.** Naturally, the filtered data \(C\) is unbalanced. The number of examples that pass our filtering drops significantly as the count increases, e.g., the number of "\(ten\)" image-text pairs is around \(1000\times\) smaller than "\(two\)". Training with such imbalanced data creates a bias--the loss can be reduced by classifying frequent numbers as the correct caption and rare numbers as counterfactual, regardless of the image content. Therefore, balancing the data is of essence. Due to scarcity of examples depicting more than six objects, we choose to balance the numbers "\(two\)" - "\(six\)" separately from the higher numbers "\(seven\)" - "\(ten\)". For each of the numbers "\(two\)" - "\(six\)", we sample around \(37K\) samples, while for "\(seven\)" - "\(ten\)", we use all the samples passed by our filter. There are approximately \(7K\) samples for "\(seven\)" down to around \(1.5K\) samples for "\(ten\)". We found this approach to provide us with a diverse and relatively balanced training dataset, yet more sophisticated methods could be considered in the future. From this point on, \(C\) will denote our filtered and balanced numbered training set. ### Teaching CLIP to count Our goal is to improve the quantitative understanding of a pre-trained VLM (e.g., CLIP), while preserving its real-world knowledge, as reflected by its zero-shot capabilities on commonly-evaluated benchmark tasks. Therefore, we use a combination of two loss functions: \[L=L_{CLIP}+\lambda L_{count} \tag{1}\] where \(L_{CLIP}\) is the regular contrastive loss of CLIP, \(L_{count}\) is our counting-designated loss (described below), and \(\lambda\) is a hyperparameter used to weight the two losses. We finetune the model on two training sets: (\(i\)) A very large dataset collected from the Web that contains general in-the-wild images and captions. (\(ii\)) Our filtered numbered training set \(C\), described in Sec. 3.1, which contains samples where object counts are spelled out in the captions. While \(L_{CLIP}\) is calculated on all samples, the counting loss \(L_{count}\) is calculated only on samples from \(C\). For each image-text pair (\(i_{k}\), \(t_{k}\)) \(\in\)\(C\), a counterfactual caption \(t_{k}^{CF}\) is automatically created by swapping the number in the caption \(t_{k}\) with a different random number (e.g., the caption "five dogs" can be counterfactualized with "eight dogs"). At each training step, the triplets \((i_{k}\), \(t_{k}\), \(t_{k}^{CF})_{k=1}^{N}\) are then fed to CLIP's text and image encoders to obtain their embeddings \((ei_{k}\), \(et_{k}\), \(et_{k}^{CF})_{k=1}^{N}\). Then, a contrastive loss \(L_{count}\) is computed to enforce that the similarity score of the image is high with the original caption and low with the counterfactual caption: \[L_{count}=-\frac{1}{N}\sum_{k=1}^{N}\text{log}\frac{\text{exp}(ei_{k}\cdot et_ {k})}{\text{exp}(ei_{k}\cdot et_{k})+\text{exp}(ei_{k}\cdot et_{k}^{CF})} \tag{2}\] Since the original ground truth caption and counterfactual caption differ only by the number of objects specified in them, this loss encourages the model to learn the relationship between the specified spelled number and the number of the objects it refers to. We use the negative samples only in the counting objective \(L_{count}\), instead of adding them to the batch for the existing contrastive loss \(L_{CLIP}\), in order to better weight their effect. ### Implementation details Models.We test our method with two classes of SOTA VLMs, BASIC [38] and CLIP [39], in order to verify its robustness to different architectures. For CLIP, we experiment with both CLIP-B/32 and CLIP-L/14 configurations, as they are both widely used in recent work. For BASIC, we experiment with BASIC-S. Training.We finetune all models for \(20K\) steps using a cosine schedule with an initial learning rate of \(5e^{-6}\). We use a batch size of 32,768, where a fraction \(p=\frac{1}{32}\) of each batch is dedicated to samples from the counting training set, and the rest are from large image-text datasets collected from the Web. We use \(\lambda=1\) to weight the auxiliary loss, with a linear warm-up in the first 10,000 steps. ## 4 CountBench We introduce a new object counting benchmark called _CountBench_, automatically curated (and manually verified) from the publicly available LAION-400M image-text dataset [47]. CountBench contains a total of 540 images containing between two and ten instances of a particular object, where their corresponding captions reflect this number. This benchmark is used only for testing and is filtered from datasets which have no overlap with our training set \(C\). The images in _CountBench_ were obtained by first running our automatic filtering method described in Sec. 3.1 on the entire LAION-400M dataset. This filtering produced over 158K images for the number "\(two\)", but only around 100 for "\(ten\)", demonstrating again the severe number imbalance we encountered with our training sets. After automatically balancing each number to 100-200 samples each, the entire dataset was manually verified to contain only pairs in which the spelled number in the caption matches the number of clearly visible objects in the image. The dataset was rebalanced after this stage, ending up with 60 image-text pairs per number \(\in\)\(\{``two",...,``ten"\}\), 540 in total. Samples from the dataset can be seen in Fig. 4. It is worth noting that the higher the count is, the higher the proportion of CountBench images which contain relatively simplistic 2D collections of objects, as opposed to objects in a real-world scene. This bias exists in the training set as well, and seems to be a characteristic of web-scraped counting data in general. We use the _CountBench_ benchmark to evaluate the counting abilities of the models trained with our method in Sec. 5. These images are not used for training. ## 5 Experiments We thoroughly evaluate our method, both quantitatively and qualitatively, on object counting-related tasks using our _CountBench_ benchmark. We further validate that the performance of our finetuned counting-aware models on a variety of _general_ zero-shot classification benchmarks is retained [16, 12, 13, 19, 20, 21, 26, 35, 44, 58]. To gain a better understanding of our models, we show visualizations of text-image relevancy maps, along with per-word relevancy scores, demonstrating that our model indeed attends to the number of objects in the image and text. Finally, we apply our model to text-to-image retrieval and generation, producing specific numbers of objects more reliably than baseline models. ### Zero-shot counting accuracy We evaluate our models and baselines on _CountBench_ on the task of classifying the number of objects in an image in a zero-shot manner. For each image in _CountBench_ we augment the existing caption with eight other possible captions by replacing the number in its caption with all the numbers \(\in\{``two",\dots,``ten"\}\), and calculate the similarity score between the image and each of the nine captions. The number in the caption that obtains highest similarity score with the image is considered the predicted number. Table 1 reports the results of this evaluation on two prominent contrastive VLMs: CLIP-B/32 and BASIC-S. We report both the counting accuracy (selection of the correct number) and the mean deviation of the models' predictions from the correct numbers. For each of the architectures, we compare our model (configuration _E_) with two baseline configurations: (_A_) the official baseline model, and (_B_) the baseline model finetuned on our general text-image dataset used in our implementation, with the standard contrastive loss. Comparing the performance of these configurations allows us to quantify the effect of using our own large-scale text-image dataset, which differs from the original unpublished data the models were trained on. As can be seen, our method (_E_) achieves significantly superior counting accuracy compared to the baselines (_A_, _B_). Our counting-aware CLIP and BASIC models achieve Figure 4: **CountBench benchmark.**_Sample images and their corresponding captions from our new CountBench object counting benchmark. This benchmark was automatically curated (and manually verified) from the publicly-available LAION-400M dataset._ Figure 5: **Confusion matrices on CountBench.**_Classification accuracy on our new counting benchmark, CountBench, broken down into confusion matrices for the public CLIP ViT-L/14 (a), and our improved CLIP ViT-L/14 model (b), demonstrating clear quantitative superiority of our model._ \(2\)-\(3\times\) higher counting accuracy than their corresponding baselines and more than \(3\times\) lower mean deviation from the correct number. Tab. 1 also contains an ablation of the two components of our method: filtering a counting training set and finetuning with an additional loss \(L_{count}\). Models with configuration \(C\) are finetuned on the filtered subset with no counting loss. The large gap in accuracy on _CountBench_ between configurations \(C\) and \(E\) shows the importance of our loss for the improvement in counting abilities. Models with configuration \(D\) are finetuned with the counting loss \(L_{count}\) on an alternative counting subset, which consists of all the samples that contain spelled numbers \(\in\) {\(``two",..,``ten"\)} without additional filtering. The significant difference in counting accuracy between configurations \(D\) and \(E\) demonstrates the importance of our restrictive filtering pipeline, as both configurations are finetuned with \(L_{count}\) over the samples from a dedicated counting training set. As can be seen in Tab. 1, while the naively filtered data does improve performance over a baseline trained without a dedicated counting subset, the obtained results are still significantly lower than those produced by our model. We attribute this gap in performance to mislabeled training samples in the naively filtered data, which are absent from our counting training set \(C\) due to our filtering pipeline. Confusion matrices for the counting evaluation described above are shown in Fig. 5. For this experiment, we compare a CLIP-L/14 model finetuned with our method against the public CLIP-L/14 model checkpoint. As can be seen, our improved CLIP model is significantly superior to the baseline across all numbers. Also evident is a dropoff in accuracy for some higher numbers, as a result of their significantly lower representation in the training data (detailed above in Sec. 3.1). Performance on common non-counting classification tasksTo verify that our counting-aware models preserve the powerful image-text representation capabilities of the original models, we evaluate the zero-shot performance of our models on a variety of common classification benchmarks. Table 2 reports the zero-shot accuracy of our counting aware models against the baselines (corresponding to configurations \(A\), \(B\) in Tab. 1). As can be seen, our models maintain similar overall accuracy. Also, comparing the official baseline and the internal baseline indicates that finetuning the models on our general text-image datasets leads to only a slight shift in the accuracy of the models on common benchmarks. Hyperparameters of our methodOur method introduces two additional hyperparameters: the portion \(p\in[0,1]\) of the batch size dedicated to the counting subset, and the weight \(\lambda\) of our counting loss \(L_{count}\). We empirically chose \(p=\frac{1}{32}\) and \(\lambda=1\), since higher values tend to overfit to the counting subset. Tab. 3 contains an ablation our choice of \(p\), and Tab. 4 compares the results of models trained with different weightings \(\lambda\) of \(L_{count}\). ### Count-based image retrieval We consider the task of text-to-image retrieval where the text explicitly describes the desired count of objects. To obtain a diverse dataset that consists of varied numbers of objects, yet facilitates retrieval in reasonable time, we split the public LAION-400M dataset [47] into coarse categorical subsets by filtering samples where the caption contains a \begin{table} \begin{tabular}{l|c c c c|c c c c c} \hline \hline Dataset & \multicolumn{3}{c}{CLIP-B/32} & \multicolumn{3}{c}{BASIC-S} \\ & \(\Delta\) & B & \(\mathbb{C}\) & \(\mathbb{D}\) & \(\mathbb{E}\) & \(\Delta\) & B & \(\mathbb{C}\) & \(\mathbb{D}\) & \(\mathbb{E}\) \\ & **Official** & **Internal** & **Ours** & **Ours** & **Public** & **Internal** & **Ours** & **Ours** \\ & **Baseline** & **Baseline** & (\(\text{w/o}\)\(L_{count}\)) & **(Naive Filtering)** & & **Baseline** & **Baseline** & **(w/o \(L_{count}\))** & **(Naive Filtering)** \\ \hline **Accuracy**\(\uparrow\) & 31.67 & 32.94 & 44.26 & 49.81 & **75.93** & 17.97 & 22.75 & 30.59 & 28.68 & **69.02** \\ **Mean deviation from** & 1.53 & 1.44 & 0.97 & 1.28 & **0.49** & 2.13 & 2.02 & 1.29 & 1.87 & **0.64** \\ **the correct number**\(\downarrow\) & & & & & & & & & \\ \hline \hline \end{tabular} \end{table} Table 1: **Quantitative counting results.**_Top-1 zero-shot accuracy and the mean absolute distance between the predicted numbers and the true numbers on CountBench. We compare several configurations: (A) The official CLIP [39] and BASIC [38] models. (B) The official baselines finetuned on our internal curated data. (C) Models trained with our filtered counting set, without \(L_{count}\) (D) Models finetuned with \(L_{count}\) on a naively filtered counting set (E) Our method, which is significantly superior to all other configurations, both in accuracy and deviation from correct number._ \begin{table} \begin{tabular}{l|c c c c|c c} \hline \hline Dataset & \multicolumn{3}{c}{CLIP-B/32} & \multicolumn{3}{c}{BASIC-S} \\ & **Official** & **Internal** & **Ours** & **Public** & **Internal** & **Ours** \\ & **Baseline** & **Baseline** & **Baseline** & **Baseline** & **Baseline** \\ \hline ImageNet & 62.93 & 64.97 & 64.06 & 59.70 & 61.96 & 61.18 \\ CIFAR10 & 69.31 & 61.00 & 60.65 & 76.22 & 64.98 & 84.05 \\ CIFAR100 & 33.10 & 32.49 & 33.65 & 45.35 & 56.80 & 55.89 \\ Caltech101 & 75.99 & 82.50 & 82.36 & 78.16 & 81.38 & 81.05 \\ EnerSAT & 45.23 & 41.66 & 37.69 & 28.39 & 45.82 & 45.97 \\ Food101 & 83.08 & 80.72 & 80.53 & 77.08 & 77.00 & 77.06 \\ ImageNet & 31.85 & 30.85 & 29.81 & 71.76 & 25.25 & 21.68 \\ ImageNet & 69.38 & 70.17 & 70.30 & 67.11 & 67.86 & 66.95 \\ ImageNetV2 & 55.65 & 56.56 & 56.62 & 52.22 & 54.35 & 53.60 \\ Oxford Pets & 87.35 & 87.74 & 87.41 & 80.62 & 85.15 & 84.87 \\ Oxford Pets & 66.14 & 65.73 & 67.39 & 64.74 & 66.40 & 65.90 \\ \hline \hline \end{tabular} \end{table} Table 2: **Zero-shot accuracy on common benchmarks.**_We compare the zero-shot accuracy of our method and baselines on a variety of popular benchmarks. As can be seen, our method preserves the performance of the original model._ certain word (e.g., "dogs", "animals", "cars"), and perform retrieval on each of these subsets separately. For each category, we use the caption "a photo of \(n\) {objects}" where \(n\in\{\)_"two"\(,...,\)"ten"_ (e.g. "a photo of six dogs"). For each caption, we retrieve the five images in the dataset that are predicted by the model to be most similar to the caption. Note that since there are no ground truth labels for the counts of objects, we present qualitative results. Fig. 8 shows the retrieved images using the original CLIP model and our counting-aware CLIP model. As can be seen, when the requested number is larger than three, the images retrieved by the baseline model often depict arbitrary numbers of objects. Additionally, the baseline often retrieves the same images for several different requested numbers. This further implies that the baseline model mostly focuses on the existence of the described object in the image, and ignores the number in the caption. In contrast, our results depict accurate object counts in most cases. ### Relevancy map visualization To gain a better understanding of what our model learns, we use an explainability method to visualize the reasoning of the model. For each image-caption pair, we refer to the cosine similarity of their CLIP embeddings as their similarity score. This score should be high for a pair that CLIP considers matching and low for non-matching images and texts. We use the method of Chefer et al. [8] to obtain relevancy maps, which consist of relevancy scores for every patch in the image and every token in the text. The relevancy scores indicate the importance of different parts of the text and image in predicting the similarity score of the model. Fig. 6 displays the relevancy maps of several image-text pairs. Note that the relevancy scores of the text are normalized to sum to 1. Examining the relevancy maps of the text, it is apparent that the relevancy score of the spelled number in the caption is significantly higher than the baseline model, which suggests that our model concentrates more on the mentioned number than the original one. Additionally, examining the relevancy maps of the images, it is evident that our model focuses on all pertinent objects in the image, whereas the original model primarily identifies a single instance of the described object. To verify that our model does not simply attend to _all_ objects that appear in the image, we examined the relevancy maps in Fig. 7 using negative text prompts (the text "three" when there are five elements in the image). Our model focuses only on relevant objects when the correct number is used, unlike the baseline CLIP model that highlights all object types in the image. This demonstrates that our model learns to associate the spelled number in the caption with the suitable number of objects, and does not exploit shortcuts or undesired content. ### Text-to-image generation In order to demonstrate the effectiveness of our fine-tuned model on downstream image generation tasks, we train an Imagen [45] model, conditioned on the textual embeddings of a pretrained CLIP-L/14, and another Imagen model conditioned on our counting-aware CLIP-L/14 model. To compare our model and the baseline, we synthesize \(12\) samples for each textual prompt in the counting category of the DrawBench benchmark [45]. For each sample, we check whether or not it contains the requested number of objects, as stated in its prompt. We report the total binary accuracy in Tab. 5. Since the highest number specified in DrawBench for a given object is five, we obtain an additional set of prompts by generating all possible combinations of the form "\(\{number\}\) {\(class\}\).", where \(number\in\{\)"\(two",...,\)"\(ten"\}\) and \(class\) is one of the classes in CIFAR10 (e.g., "dog" and "car"). Since the amount of training samples that contain the numbers \(2-6\) greatly exceeds those of higher values, we additionally report the accuracy for the textual prompts containing numbers within the range of \(2-6\). As shown in Tab. 5, our finetuning approach leads to a \(1.5-2\times\) improvement in the ability to reliably generate specific counts of objects. ### Limitations First and foremost, our method is limited by the insufficient existence of training data with images containing multiple instances of an object, along with a corresponding cap Figure 6: **Relevancy map of both image and text.**_Visualization of the relevancy scores of both image and text, which represent, for each patch in the image and token in the text, how important it is to the prediction. Using our improved CLIP model, the relevancy of the number (e.g., “four”) in the text is increased. In addition, the model focuses on areas in the image that are relevant for counting._ tion that correctly spells out this information. The effect of this data scarcity on our method increases with larger numbers (7, 8, etc.) as people tend to use "a group of" or "many" for large numbers of objects, instead of gruelingly counting them. Furthermore, many of the correct training pairs with higher numbers that do exist, contain relatively simplistic 2D collections of objects, as opposed to objects in a real-world scene (see Fig. 4), and can explain weaker model performance on in-the-wild images containing a larger number of objects. In addition, our method teaches CLIP to count only until ten, while generalization to numbers greater than ten is unclear. We did not evaluate on these numbers due to lack of data. Examplary failure cases can be found in Fig. 10. ## 6 Conclusions and future work This work presents the first method to enhance CLIP with counting abilities, which is an essential step towards enabling more accurate retrieval and generation of detailed texts. Using a carefully designed filtering pipeline, we are able to obtain a clean counting subset from datasets collected from the internet, on which we perform counting-focused hard-negative augmentation. An additional loss is applied that encourages CLIP to understand object counting, in order to successfully separate false captions from images. In addition, we introduce a new counting bench \begin{table} \begin{tabular}{l|c c c} \hline \hline Dataset & \(\lambda=0.1\) & \(\lambda=1\) & \(\lambda=5\) & \(\lambda=10\) \\ \hline **CountBench** & 69.44 & **75.93** & 73.15 & 72.59 \\ \hline ImageNet & 64.50 & 64.06 & 63.84 & 63.53 \\ CIFAR10 & 63.20 & 60.65 & 63.79 & 63.82 \\ CIFAR100 & 34.51 & 33.56 & 35.35 & 34.15 \\ Caltech101 & 84.39 & 82.36 & 81.82 & 81.76 \\ EuroSAT & 39.48 & 37.69 & 39.93 & 42.20 \\ Food101 & 80.73 & 80.53 & 80.33 & 79.98 \\ ImageNetA & 31.67 & 29.81 & 29.55 & 29.45 \\ ImageNetR & 70.92 & 70.30 & 69.87 & 69.77 \\ ImageNetV2 & 56.70 & 56.62 & 56.30 & 56.09 \\ Oxford Pets & 87.65 & 87.41 & 87.79 & 86.97 \\ Oxford Flowers & 67.00 & 67.39 & 65.33 & 65.90 \\ \hline \hline \end{tabular} \end{table} Table 4: **Ablation of the auxiliary loss weight \(\lambda\)**_We ablate different weights for the auxilary loss. We found \(\lambda=1\) to work best, as lower values lead to suboptimal results and higher values cause overfitting._ \begin{table} \begin{tabular}{l|c c c} \hline \hline Dataset & \(p=\frac{1}{32}\) & \(p=\frac{1}{8}\) & \(p=\frac{1}{4}\) \\ \hline **CountBench** & **75.93** & 70.19 & 69.81 \\ \hline ImageNet & 64.06 & 64.11 & 63.96 \\ CIFAR10 & 60.65 & 61.69 & 63.04 \\ CIFAR100 & 33.56 & 33.74 & 34.01 \\ Caltech101 & 82.36 & 83.58 & 83.51 \\ EuroSAT & 37.69 & 39.07 & 41.56 \\ Food101 & 80.53 & 80.59 & 80.80 \\ ImageNetA & 29.81 & 30.84 & 30.60 \\ ImageNetR & 70.30 & 70.15 & 69.98 \\ ImageNetV2 & 56.62 & 56.54 & 56.37 \\ ImageNetV2 & 56.62 & 56.54 & 56.37 \\ Oxford Pets & 87.41 & 87.14 & 86.64 \\ Oxford Plowers & 67.39 & 67.21 & 67.91 \\ \hline \hline \end{tabular} \end{table} Table 3: **Ablation of hyperparameter \(p\).**\(p\) denotes the fraction of the batch size dedicated to samples from the counting subset. As the subset is significantly smaller than the entire curated dataset we found that large values for \(p\) lead to overfitting. Figure 7: **Relevancy maps for similarity between the image and different numbers.**_We compare the CLIP relevancy map of the input image with text prompts of several numbers (i.e. two to six) for both the baseline CLIP model and for our model. Our CLIP model focuses on the five stars when calculating the similarity with the prompt ”five”._ Figure 8: **Top-5 count-based image retrieval Text-to-image retrieval results for different counts of objects (images that match the caption are colored in green, and images that don’t match it are colored in red). The images are ordered according to their similarity scores, such that the images with the highest scores are in the left column and the images with the fifth-highest scores are in the right column. As can be seen, the retrieval results of our model are significantly more accurate than the original CLIP model, which often fails when the requested number is higher than three.** mark, _CountBench_, which we plan to release publicly, that contains in-the-wild images and captions where the number of specific objects in the image is detailed in the caption. We hope this benchmark will encourage more research in this direction in the future. Applying our improved CLIP to the task of image generation is shown to improve reliability of producing specific counts of objects. While the method is not specific to counting, and can also be applied on other compositional concepts that VLMs fail to learn, we focus on counting, as it is the most unambiguous to define and evaluate, and allows us to disentangle the model's understanding of the concept from textual or visual ambiguities. The extension of this method to other compositional concepts such as spatial positioning of objects, active vs. passive verbs, etc, remains for future work. Societal impactOur work aims to improve the discriminative representation of numbers within vision-language models. Those capabilities can be used to improve downstream applications such as text-to-image synthesis and text-based image editing. These could be used by malicious parties for synthesizing fake imagery to mislead viewers. It should be noted, however, that our contribution to the improvement of these models is for the specific application of generating a specific number of objects in an image, and should not be considered a novel image generation method in itself. As with other image generation work, mitigation of malicious use depends on further research on identification of synthetically edited or generated content. AcknowledgementsWe thank Hieu Pham for his technical guidance and insightful feedback.

2308.07356

Age-Stratified Differences in Morphological Connectivity Patterns in ASD: An sMRI and Machine Learning Approach

Purpose: Age biases have been identified as an essential factor in the diagnosis of ASD. The objective of this study was to compare the effect of different age groups in classifying ASD using morphological features (MF) and morphological connectivity features (MCF). Methods: The structural magnetic resonance imaging (sMRI) data for the study was obtained from the two publicly available databases, ABIDE-I and ABIDE-II. We considered three age groups, 6 to 11, 11 to 18, and 6 to 18, for our analysis. The sMRI data was pre-processed using a standard pipeline and was then parcellated into 148 different regions according to the Destrieux atlas. The area, thickness, volume, and mean curvature information was then extracted for each region which was used to create a total of 592 MF and 10,878 MCF for each subject. Significant features were identified using a statistical t-test (p<0.05) which was then used to train a random forest (RF) classifier. Results: The results of our study suggested that the performance of the 6 to 11 age group was the highest, followed by the 6 to 18 and 11 to 18 ages in both MF and MCF. Overall, the MCF with RF in the 6 to 11 age group performed better in the classification than the other groups and produced an accuracy, F1 score, recall, and precision of 75.8%, 83.1%, 86%, and 80.4%, respectively. Conclusion: Our study thus demonstrates that morphological connectivity and age-related diagnostic model could be an effective approach to discriminating ASD.

Gokul Manoj, Sandeep Singh Sengar, Jac Fredo Agastinose Ronickom

2023-08-14T12:11:25Z

http://arxiv.org/abs/2308.07356v1

Age-Stratified Differences in Morphological Connectivity Patterns in ASD: An sMRI and Machine Learning Approach ###### Abstract **Purpose**: Age biases have been identified as an essential factor in the diagnosis of ASD. The objective of this study was to compare the effect of different age groups in classifying ASD using morphological features (MF) and morphological connectivity features (MCF). **Methods:** The structural magnetic resonance imaging (sMRI) data for the study was obtained from the two publicly available databases, ABIDE-I and ABIDE-II. We considered three age groups, 6 to 11, 11 to 18, and 6 to 18, for our analysis. The sMRI data was pre-processed using a standard pipeline and was then parcellated into 148 different regions according to the Destrieux atlas. The area, thickness, volume, and mean curvature information was then extracted for each region which was used to create a total of 592 MF and 10,878 MCF for each subject. Significant features were identified using a statistical t-test (\(p\)\(<\)0.05) which was then used to train a random forest (RF) classifier. **Results:** The results of our study suggested that the performance of the 6 to 11 age group was the highest, followed by the 6 to 18 and 11 to 18 ages in both MF and MCF. Overall, the MCF with RF in the 6 to 11 age group performed better in the classification than the other groups and produced an accuracy, F1 score, recall, and precision of 75.8%, 83.1%, 86%, and 80.4%, respectively. **Conclusion:** Our study thus demonstrates that morphological connectivity and age-related diagnostic model could be an effective approach to discriminating ASD. **Keywords:** Autism Spectrum Disorder, sMRI, Morphological Connectivity, Random Forest ## 1 Introduction Autism spectrum disorder (ASD) is a neurodevelopmental condition characterized by deficits in social communication and interaction, as well as restricted, repetitive patterns of behavior, interests, or activities [1]. It is a heterogeneous abnormality that causes altered cortical anatomy, abnormal white matter integrity, and altered brain function [2]. The underlying neural mechanisms of ASD are poorly understood, and its diagnosis mainly relies upon subjective evaluation and may result in prolonged or misdiagnosis of the condition [3]. Studies have shown that the morphological changes in the brain can be used as an effective biomarker for the diagnosis of ASD [4]. Structural magnetic resonance imaging (sMRI) is a widely used technique to study these anatomical variations of the ASD brain [5]. Numerous investigations have utilized univariate analysis techniques, specifically focusing on voxel-wise or local morphological features (MF) such as surface area, thickness, volume, and mean curvature of distinct brain areas, in order to analyze the brain of individuals with ASD utilizing sMRI images [6]. Nevertheless, these methodologies are inadequate in terms of identifying the inter-regional correlations among distinct brain regions. Morphological connectivity features (MCF) provide a method of obtaining higher-order cortical information related to brain areas by examining interregional morphological correlations between pairs of regions. This analytical approach holds potential as a significant diagnostic tool for ASD [7][8]. It can provide insights into the underlying neural mechanisms behind both brain function and dysfunction, and studies have also demonstrated the importance of MCF in classifying ASD and proved that it outperformed MF [9]. Machine learning algorithms trained on these anatomical features could be useful for studying ASD [10]. Studies have reported random forest (RF) algorithm as an optimal classifier for the smaller sample size [11]. Moreover, our past study has also highlighted the effectiveness of using RF over other classifiers [9]. However, the development of a unified classification model for the diagnosis of ASD is complicated due to the highly heterogeneous nature of ASD. Past studies have shown that an age-stratified approach to identifying the characteristics of ASD could be an effective method to mitigate the heterogeneity present in the condition [12], [13]. In this study, we attempted to compare the performance of RF classifier in different age groups of ASD and typical developing (TD) subjects using various MF and MCF obtained from sMRI. By exploring the performance of the classifier in different age strata, the study sought to gain insights into potential age-related differences in brain connectivity patterns and morphological characteristics associated with ASD. ## 2 Methods ### Database We considered a total of 313 ASD and 397 TD participants obtained from the 7 sites of the two open-access databases, Autism Brain Imaging Data Exchange (ABIDE-I and ABIDE-II) for our study [14], [15] The ABIDE database contains a collection of the sMRI and corresponding resting-state functional MRI and phenotypic information from over 17 different sites with the participant's demographic information and diagnostic status. Detailed demographic information of the 710 subjects is given in Table 1. \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|} \hline & \multicolumn{2}{c|}{**6 to 11 years**} & \multicolumn{2}{c|}{**11 to 18 years**} & \multicolumn{2}{c|}{**6 to 18 years**} \\ \hline & **TD** & **ASD** & **TD** & **ASD** & **TD** & **ASD** \\ \hline Count & 177 & 129 & 220 & 184 & 397 & 313 \\ \hline Gender & 119 M 58 F & 106 M 23 F & 175 M 45 F & 167 M 17 F & 294 M 103 F & 273 M 40 F \\ \hline FIQ/PIQ (Mean \(\pm\) SD) & 117.2 & 105.3 & 111.6 & 104.6 & 114.1 & 104.9 \\ \(\pm\) 12.1 & \(\pm\) 18.0 & \(\pm\) 13.0 & \(\pm\) 15.6 & \(\pm\) 12.9 & \(\pm\) 16.6 \\ \hline \end{tabular} **M: Male; F: Female; SD:** Standard deviation; FIQ: Full-scale intelligence quotient; **PIQ:** Performance intelligence quotient \end{table} Table 1: Demographic information of the subjects ### Process Pipeline Figure 1 represents the process pipeline for the age-stratified analysis of ASD subjects. It involves the following steps: 1) Segregation of the sMRI data into three different age groups, 2) Pre-processing of the sMRI data, 3) Extraction of MF and MCF features, 4) Classification using RF classifier and analysis of brain networks. ### Pre-processing All the subjects were divided into three age groups, 6 to 11, 11 to 18, and 6 to 18, for the analysis. The sMRI images were pre-processed using the FreeSurfer toolbox [16]. The pre-processing pipeline included three stages of recon: autorecon1, autorecon2, and autorecon3. Overall, the process involved motion correction, intensity normalization, skull stripping, labeling based on Gaussian classifier atlas models, white matter segmentation, and cortical and white matter parcellation. We used the Destrieux atlas for the parcellation, and the brain regions were divided into 148 different segments (74 from each hemisphere). ### Feature Extraction From the segmented data, we extracted the surface area, thickness, volume, and mean curvature. The data was then standardized, and the MF was computed by combining the four measures to produce 592 (148x4) features. To calculate the MCF, 1D arrays were created using the four Figure 1: Process pipeline used for the study measures for each region. We estimated the MCF for the different regions using the Euclidean distance measure. It is computed as: \[d(a,b)=\sqrt{[\Sigma(a_{i}-b_{i})^{2}]}\] Where \(a\) and \(b\) are two regions, and \(i\) is the specific measure. For each subject, we obtained 10,878 features (148 x (148-1)/2), and statistical test-based (\(p\)-value) feature reduction was performed to reduce the number of features in both cases. A two-sample t-test was performed on them to calculate the \(p\)-value for different features. Features that had a \(p\)-value less than 0.05 were selected in each case to create the final feature set. ### Classification The feature set corresponding to the different age groups was then used to train the RF classifier with default parameters and a train-test split of 80% and 20%, respectively. We evaluated the performance of the model using the accuracy, recall, precision, and F1 score. RF is one of the popular machine-learning algorithms for ASD diagnosis. As an ensemble learning method, RF constructs a set of decision trees during the training phase, where each tree is trained on a random subset of the data. The final prediction is then made by aggregating the outputs of all individual trees. Notably, the RF classifier employs random feature selection during the decision tree construction, ensuring only a random subset of features is considered at each node for splitting. This feature randomness mitigates the risk of overfitting, enhancing the classifier's robustness and generalizability to new data [17]. ## 3 Results A raw sample of the T1-weighted sMRI obtained from the ABIDE database is shown in Figure 2 (a). Its corresponding skull-stripped image and Destrieux atlas parcellation in three different views- trans axial, sagittal, and coronal, are shown in Figure 2 (b) and (c), respectively. The images were also visually inspected to ensure that the skull-stripping and parcellation were performed with high quality. We computed the surface area, thickness, volume, and mean curvature of each ROI to obtain the MF and MCF. The features were then ranked using a statistical test, and the features that had a Figure 2: (a) 3D sMRI image, (b) Skull-stripped image and (c) Destrieux atlas parcellations value less than 0.05 were selected in both MF and MCF. These features were then used to train an RF classifier, and we compared the age-specific performance of the classifier on the three age groups; 6 to 11, 11 to 18, and 6 to 18. The results of the classification are given in Figure 3. It was observed that within each type of analysis, the accuracy of the 6 to 11 age group was the highest (67.7% for MF and 75.8% for MCF), followed by the 6 to 18 (60.36% for MF and 67.6% for MCF) and 11 to 18 (59.3% for MF and 56.8% for MCF) age group. We observed that out of the 592 MF, the mean curvature contributed the highest number of features to the classification model. These were followed by the thickness, volume, and area features. The fraction of MF and MCF contributed by the different brain regions in the three age groups to the classifier is given in Table 2. We further analyzed the anatomical locations of the top 100 features from the different lobes for the MCF. Figure 4 represents the connectome representation of the MCF in the three different age groups. Overall, we observed that in all cases, the highest number of features were obtained from the frontal lobe. \begin{table} \begin{tabular}{|c|c|c|} \hline **Age group (years)** & **Brain areas from MF** **(Percentage of features contributed)** & **Brain areas from MCF** **(Percentage of features contributed)** \\ \hline & Frontal (48.31\%) & Frontal (28.56\%) \\ & Parietal (14.60\%) & Occipital (15.97\%) \\ & Temporal (12.35\%) & Parietal (13.84\%) \\ 6 to 11 & Occipital (12.35\%) & Occipitaltemporal (12.69\%) \\ & Insula (5.61\%) & Temporal (11.25\%) \\ & Occipitotemporal (3.37\%) & Insula (10.10\%) \\ & Limbic (3.37\%) & Limbic (7.55) \\ \hline & Frontal (28.57\%) & Frontal (29.16\%) \\ 11 to 18 & Limbic (28.57\%) & Occipital (15.32\%) \\ & Occipital (19.04\%) & Temporal (14.58\%) \\ \hline \end{tabular} \end{table} Table 2: Fraction of MF and MCF contributed by the different brain regions to the classifier. Figure 3: Performance metrics of the classifier on different age groups using (a) MF and (b) MCF ## 4 Discussion We used MF and MCF to train an RF classifier to compare the effect of age stratification on ASD diagnosis. We achieved the highest classification accuracy in the 6-11 age group for both MF and Figure 4: Connectome representation of top 100 MCF for the 6-11 age group MCF, followed by the 6-18 and 11-18 age groups. This may be due to the accelerated growth of the brain during early development in ASD subjects in contrast to the refined growth in TD subjects [18]. Studies have proved that children with ASD were well discriminated from the TD compared to the adolescent age group [19], [20]. Although the results of our classifier are low with respect to these studies, a direct comparison is unreliable as they have studies used different modalities [19], [20] and number of samples [20]. On the other hand, studies have reported higher accuracy in adults (\(>18\)) than the adolescents (\(<18\)) [21], [22]. However, the combined accuracy is less than the age-stratified groups, supporting our results. Moreover, our study performed better compared to the other study that used sMRI [22] Additionally, the overall classification performance of the MCF was better than the MF. It reveals that MCF can offer significant insights into the interregional morphological relationships between different brain regions. Similar results were reported in earlier studies for attention-deficit hyperactivity disorder [7][15]. Our results also suggest that features from the frontal contribute significantly to the diagnostic classification of ASD. Past studies have shown that the frontal lobe undergoes a significant morphological change in ASD [18], [23], and the features from the frontal lobe could be an effective marker in classifying ASD. \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|} \hline **Study** & **Database** & \begin{tabular}{c} **Number of** \\ **Subjects** \\ \end{tabular} & \begin{tabular}{c} **Age** \\ **groups** \\ **(years)** \\ \end{tabular} & **Modality** & **Features** & **Classifier** & **Performance** \\ \hline **Our** & ABIDE I & 313 ASD & 6-11, 11-18, 6-18 & sMRI & \begin{tabular}{c} MF and \\ MCF \\ \end{tabular} & RF & \begin{tabular}{c} 75.8\%, \\ 56.8\%, \\ 67.6\% \\ \end{tabular} \\ \hline [19] & ABIDE & 816 & 15-20, 20-30, 20-30 & fMRI & FC & SVM & \begin{tabular}{c} 86\%, \\ 69\% \\ 78\% \\ 80\% \\ 95\% \\ \end{tabular} \\ \hline [20] & ABIDE I & 127 ASD & 11-18, 127 ASD & \begin{tabular}{c} \(<11\), 11-18, 127 ASD, 18, 130 TD \\ \end{tabular} & fMRI & FC & \begin{tabular}{c} CVC, \\ FT, \\ LDA, \\ SGD, \\ Lib Linear \\ \end{tabular} & \begin{tabular}{c} 95.23\%, \\ 78.57\%, \\ 83.33\% \\ 69.04\% \\ \end{tabular} \\ \hline [21] & ABIDE & 505 ASD & \(<18\), \(>18\) & fMRI & SFBDM & SVM & \begin{tabular}{c} MA- 78.6\% \\ MAD- 85.4\% \\ FA- 86.7\% \\ \end{tabular} \\ \hline [22] & ABIDE & 449 ASD & \begin{tabular}{c} \(<18\), \\ and 451 TD \\ \end{tabular} & sMRI & VBM & \begin{tabular}{c} PBL- \\ McRBFN \\ \end{tabular} & \begin{tabular}{c} 61.49\% \\ 70.41 \% \\ 59.73\% \\ \end{tabular} \\ \hline \end{tabular} \end{table} Table 3: Comparison with existing age-specific studies ## 5 Limitations and Future Scope The results of our study suggest that an age-stratified approach using MCF could be an effective method to discriminate ASD. But our study has certain limitations. Our focus was confined to individuals within the 6 to 18 age group, primarily due to the constrained availability of samples from other age ranges. Additionally, we chose not to use longitudinal or gender-based categorizations, largely due to the constraints of the limited availability of relevant data. Our method of employing the Euclidean distance exclusively for MCF computation, along with employing a singular classifier for the classification task, could potentially have introduced certain biases or oversights. It is worth noting that there's ample room for expansion and refinement in this regard. By incorporating data from a wider range of sources and databases, the scope of our study could be broadened significantly. Future studies could use a more comprehensive approach, including subject data from other databases. This could yield richer insights and more accurate results. Furthermore, using a variety of machine learning and deep learning algorithms, along with diverse connectivity metrics, could possibly improve the classification model. Therefore, our study sets the foundation for a deeper and stronger grasp of distinguishing ASD, which could lead to better accuracy and wider use. ## 6 Conclusion In this study, we highlight the effect of age stratification in the classification of ASD subjects using various MF and MCF. We computed the MF and MCF for subjects in three age groups, 6 to 11, 11 to 18, and 6 to 18, and compared their performance using an RF classifier. Our results suggest that the 6 to 11 age group with the MCF performed the best with an accuracy, F1 score, recall, and precision of 75.8%, 83.1%, 86%, and 80.4%, respectively. We also found that out of the MF, the mean curvature was the best-contributing feature, and overall, the frontal lobe contributed the highest number of features for both the MF and MCF. The findings of our study suggest that an age-stratified approach, along with the MCF, could be an effective method to discriminate ASD.

2307.06815

JSJ decompositions of knot exteriors, Dehn surgery and the $L$-space conjecture

In this article, we apply slope detection techniques to study properties of toroidal $3$-manifolds obtained by performing Dehn surgeries on satellite knots in the context of the $L$-space conjecture. We show that if $K$ is an $L$-space knot or admits an irreducible rational surgery with non-left-orderable fundamental group, then the JSJ graph of its exterior is a rooted interval. Consequently, any rational surgery on a composite knot has a left-orderable fundamental group. This is the left-orderable counterpart of Krcatovich's result on the primeness of $L$-space knots, which we reprove using our methods. Analogous results on the existence of co-orientable taut foliations are proved when the knot has a fibred companion. Our results suggest a new approach to establishing the counterpart of Krcatovich's result for surgeries with co-orientable taut foliations, on which partial results have been achieved by Delman and Roberts. Finally, we prove results on left-orderable $p/q$-surgeries on knots with $p$ small.

Steven Boyer, Cameron McA. Gordon, Ying Hu

2023-07-13T15:28:42Z

http://arxiv.org/abs/2307.06815v4

# JSJ Decompositions of Knot Exteriors, Dehn Surgery and the \(L\)-space Conjecture ###### Abstract. In this article, we apply slope detection techniques to study properties of toroidal \(3\)-manifolds obtained by performing Dehn surgeries on satellite knots in the context of the \(L\)-space conjecture. We show that if \(K\) is an \(L\)-space knot or admits an irreducible rational surgery with non-left-orderable fundamental group, then the JSJ graph of its exterior is a rooted interval. Consequently, any rational surgery on a composite knot has a left-orderable fundamental group. This is the left-orderable counterpart of Krcatovich's result on the primeness of \(L\)-space knots, which we reprove using our methods. Analogous results on the existence of co-orientable taut foliations are proved when the knot has a fibred companion. Our results suggest a new approach to establishing the counterpart of Krcatovich's result for surgeries with co-orientable taut foliations, on which partial results have been achieved by Delman and Roberts. Finally, we prove results on left-orderable \(p/q\)-surgeries on knots with \(|p|\) small. Steven Boyer was partially supported by NSERC grant RGPIN 9446-2008. 2020 Mathematics Subject Classification. Primary 57M05, 57M50, 57M99. Key words: JSJ-decomposition, Dehn surgery, satellite knots, \(L\)-space knots, left-orderable, taut foliations, \(L\)-space conjecture. ###### Abstract. We study the \(L\)-space conjecture for \(L\)-space lattices. We show that the \(L\)-space conjecture for \(L\)-space lattices is a \(L\)-space lattice. We show that the \(L\)-space conjecture for \(L\)-space lattices is a \(L\)-space lattice. We also show that the \(L\)-space conjecture for \(L\)-space lattices is a \(L\)-space lattice. it is expected that all rational surgeries on winding number \(1\) satellite knots yield manifolds that are \(LO\). Theorem 3.2 shows that this holds for a set of slopes that is unbounded in both positive and negative directions. We refine this result in Theorem 3.4 and use the refinement to produce examples of knots \(K_{k}\), \(k\in\mathbb{Z}^{+}\), for which \(K_{k}(r)\) is \(LO\) (and NLS) for any \(r\in B_{k}(0)\), where \(B_{k}(0)\) is the radius \(k\) ball neighborhood of the \(0\) slope in the Farey graph. We refer the reader to SS2.1 for the definitions of a slope on \(\partial X(K)\) being \(LO\)-, \(NLS\)- and \(CTF\)-detected. The key result that is used to prove Theorems 3.1 and 3.11 is the fact that the meridional slope of a non-trivial knot \(K\) is both \(LO\)-detected and \(NLS\)-detected [7] (see Theorem 2.3). The proof of Theorem 3.2 uses the more general fact that any slope on \(\partial X(K)\) at distance \(1\) from the longitude, i.e. any slope of the form \(1/n,n\in\mathbb{Z}\), is \(LO\)- and \(NLS\)-detected. We conjectured that the latter also holds for \(CTF\)-detection in [7, Conjcture 1.6]. In particular, **Conjecture 1.1** (cf. Conjecture 1.6 in [7]).: _The meridional slope of a non-trivial knot is \(CTF\)-detected._ If Conjecture 1.1 holds, then analogous conclusions to Theorems 3.1, 3.11 and Corollary 3.14 hold for \(CTF\). This provides a new possible approach to show that any rational Dehn filling on a composite knot is \(CTF\), in comparision to what has been done by Delman and Roberts in [11]. Also see Conjecture 1.6 in their paper [11]. In [7], we showed that Conjecture 1.1 holds for fibered knots. This allows us to partially extend our results on \(LO\) and \(NLS\) surgeries above to \(CTF\) surgeries in the case that the companion knots are fibered. See Proposition 4.1 and Proposition 4.2 for the precise statements. In particular, we recover the following result, which is an immediate consequence of Theorem 6.1 in [11] **Corollary 4.3** (Delman-Roberts).: _All rational Dehn surgeries on a composite fibred knot are \(CTF\)._ In addition to what we have mentioned above, it is also known that if a satellite knot \(K=P(K_{0})\) is an \(L\)-space knot, then both \(K_{0}\) and \(P(U)\) are \(L\)-space knots [23]. In this direction, we prove the following. **Theorem 3.6**.: _Let \(K=P(K_{0})\) be a satellite knot. Suppose that either \(K_{0}(r)\) or \(P(U)(r)\) is \(LO\) for all \(r\in\mathbb{Q}\). Then for any \(r\in\mathbb{Q}\), \(K(r)\) is \(LO\) unless \(r\) is a cabling slope for \(K\)._ Delman and Roberts call a knot \(K\) is _persistently foliar_ if, for each rational slope \(r\), there is a co-oriented taut foliation meeting \(\partial X(K)\) transversely in a foliation by curves of that slope. Note that if a knot is persistently foliar, then \(K(r)\) is \(CTF\) for any \(r\in\mathbb{Q}\), but the converse is unknown. **Theorem 4.5**.: _Suppose that \(K=P(K_{0})\) is a satellite knot with a persistently foliar companion whose associated pattern has winding number \(w\geq 1\). Then \(K(r)\) is \(CTF\) for any \(r\in\mathbb{Q}\) unless \(r\) is a cabling slope for \(K\)._ A special case of Theorem 4.5 also recovers the following result of Delman and Roberts. **Corollary 4.6** (Delman-Roberts [11]).: _Each rational surgery on a composite knot with a persistently foliar summand is \(CTF\)._ In [42, Theorem 4.7], Roberts shows that if \(K\) is a fibered knot whose monodromy has non-negative fractional Dehn twist coefficient, then for any slope \(r\in(-\infty,1)\), \(K(r)\) is \(CTF\). We combine her result with our methods to show that **Corollary 4.9**.: _If \(K\) is a positive satellite \(L\)-space knot with pattern of winding number \(w\) then \(K(r)\) is \(CTF\) for each rational \(r\in(-\infty,w^{2})\)._ For more results and discussion on \(CTF\) Dehn surgeries on satellite knots, see SS4. Also see Question 3.9 and the related discussion in SS3.2, which explains another fundamental difficulty in proving the \(CTF\) analog of Theorem 3.6 in addition to the fact that Conjecture 1.1 is unproved. Finally, we present the following theorem regarding left-orderable \(p/q\)-surgeries when \(|p|\) is small. **Theorem 1.2**.: _If \(K\) is a non-trivial knot in the \(3\)-sphere, \(|p|=1,2\) and \(q\neq 0\), then \(K(p/q)\) is \(LO\) if \(|p/q|\not\in\{1/3,1/2,2/3,1,2\}\)._ See Theorem 5.1 for a more detailed statement. We merely note here that although it is necessary to exclude \(|p/q|=1\) or \(2\), the \(L\)-space Conjecture predicts that the potential exceptional slopes \(1/3,1/2\) and \(2/3\) do not arise. See Remark 5.2. ### Organisation of the paper In Section 2 we review the various notions of slope detection, set our notational conventions for satellite knots, and review some background results of Berge, Gabai and Scharlemann concerning surgery on satellite knots. In Section 3, we use slope detection to prove results on \(LO\) and \(NLS\) surgeries on satellite knots. \(CTF\) surgeries on satellite knots and related results are discussed in Section 4. In the final section 5, we prove results on \(LO\) surgeries on non-trivial knots for surgery coefficients \(p/q\) with \(|p|\) small. For hyperbolic knots (Section 5.2), we use a fact about the Euler class of Fenley's asymptotic circle representation associated to a pseudo-Anosov flow, which is proved in the Appendix. ### Acknowledgements The authors wish to thank Duncan McCoy and Patricia Sorya for helpful remarks related to Theorem 3.11. ## 2. Preliminaries In this section we review various notions needed in the paper. ### Slope detection and gluing results A _slope_ on a torus \(T\) is an isotopy class of essential simple closed curves on \(T\) or equivalently, a \(\pm\)-pair of primitive elements of \(H_{1}(T)\). We will often simplify notation by denoting the slope corresponding to a primitive pair \(\pm\alpha\in H_{1}(T)\) by \(\alpha\). The _distance_\(\Delta(\alpha,\beta)\) between two slopes \(\alpha,\beta\) on \(T\) is the absolute value of the algebraic intersection number \(|\alpha\cdot\beta|\) of primitive representatives. Thus the distance is \(0\) if and only if the slopes coincide and is \(1\) if and only the representatives form a basis of \(H_{1}(T)\). A _knot manifold_ is a compact, connected, orientable, irreducible \(3\)-manifold with incompressible torus boundary. The (rational) _longitude_ of a knot manifold \(M\) is the unique slope on \(\partial M\) represented by a primitive class \(\lambda_{M}\in H_{1}(\partial M)\) which is zero in \(H_{1}(M;\mathbb{Q})\). If \(M\) is the exterior of a knot \(K\) in a \(3\)-manifold \(W\), there is a well-defined _meridional_ slope represented by a primitive class \(\mu\in H_{1}(\partial M)\) which is zero in \(H_{1}(N(K))\). When \(M\) is the exterior of a knot in the \(3\)-sphere, there are representatives \(\mu,\lambda\in H_{1}(\partial M)\) of the meridional and longitudinal slopes which are well-defined up to simultaneous sign change. This yields a canonical identification of the set of slopes on \(\partial M\) and \(\mathbb{Q}\cup\{\frac{1}{0}\}\) via \(\pm(p\mu+q\lambda)\longleftrightarrow p/q\), where \(p\) and \(q\) are coprime integers. We say that a slope \(\alpha\in H_{1}(\partial M)\) on the boundary of a knot manifold \(M\) is * \(CTF\)_-detected_ if there is a co-oriented taut foliation on \(M\) which intersects \(\partial M\) transversely in a foliation without Reeb annuli which contains a closed leaf of slope \(\alpha\). * \(LO\)_-detected_ if there is a left-order \(\mathfrak{o}\) on \(\pi_{1}(M)\) such that thinking of \(\alpha\) as an element of \(\pi_{1}(\partial M)\), then \(g\alpha g^{-1}\) is infinitely small in the restriction of \(\mathfrak{o}\) to \(g\pi_{1}(\partial M)g^{-1}\) for each \(g\in\pi_{1}(M)\) ([7, SS6]). * \(NLS\)_-detected_ if it lies in the closure of the set of slopes whose associated Dehn filling is not an \(L\)-space ([41, SS7.2]). For instance, the longitudinal slope of a knot manifold is detected in each of these three senses. This is obvious for \(NLS\)-detection, since \(L\) spaces have finite first homology. That it is \(CTF\)-detected follows from the main result of [15] and \(LO\)-detected from Example 6.3 of [7]. **Proposition 2.1**.: _The longitudinal slope of a knot manifold is \(*\)-detected, where \(*\) denotes either \(NLS\), \(CTF\), or \(LO\)._ Slope detection is well-adapted to understanding when a union \(W=M_{1}\cup_{\partial}M_{2}\) of two knot manifolds has property \(*\), where "\(*\)" stands for either \(NLS\), \(LO\), or \(CTF\). More precisely, combining work of Hanselman, Rasmussen and Watson [23, Theorem 13], Boyer and Clay [4, Theorem 1.3], and [7, Theorem 5.2] yields the following gluing theorem. **Theorem 2.2** (Theorem 1.1 in [7]).: _Suppose that \(W=M_{1}\cup_{f}M_{2}\) where \(M_{1},M_{2}\) are knot manifolds and \(f:\partial M_{1}\stackrel{{\cong}}{{\longrightarrow}}\partial M_{2}\). If \(f\) identifies a \(*\)-detected slope on the boundary of \(M_{1}\) with a \(*\)-detected slope on the boundary of \(M_{2}\), then \(W\) has property \(*\)._ **Theorem 2.3** (Theorem 1.3 in [7]).: _Let \(M\ncong S^{1}\times D^{2}\) be an irreducible integer homology solid torus. Then each slope of distance \(1\) from \(\lambda_{M}\) is \(LO\)-detected and \(NLS\)-detected. If \(M\) fibres over the circle it is also \(CTF\)-detected._ Similarly, one can define \(*\)-detection for multislopes in the case of manifolds with multiple toral boundary components. See, respectively, SS4.3, SS5.3, SS6.6 of [7] for the definitions of \(NLS\), \(CTF\), and \(LO\) multislope detection. There is an associated gluing theorem ([7, Theorem 7.6]): If \(*\)-detected multislopes coincide along matched boundary components, then the resulting manifold has the property \(*\). In this article we use multislope detection and gluing to prove Theorem 3.11. ### Conventions on satellite knots Throughout this paper we will express a satellite knot \(K\) with pattern \(P\) and companion \(K_{0}\) as \(P(K_{0})\). In this setting we can write \[S^{3}=V\cup X_{0}\] where \(V\) is a solid torus containing \(P\) and \(X_{0}\) is the exterior of \(K_{0}\). Moreover, we require that \(K_{0}\) is a non-trivial knot and that \(P\) is neither isotopic to the core of \(V\) nor contained in a \(3\)-ball in \(V\). Set \[T=\partial V=\partial X_{0}\quad\text{ and }\quad M=X(K)\setminus\text{int}(X_ {0})=V\setminus\text{int}(N(P)),\] where \(X(K)\) is the exterior of \(K\) in \(S^{3}\) and \(N(P)\) denotes a regular neighborhood of \(P\). The _winding number_ of the pattern \(P\) in \(V\) is the non-negative integer \(w=w(P)\) for which \[\text{image}(H_{1}(P)\to H_{1}(V))=wH_{1}(V)\] This coincides with the _winding number_ of \(T\) in \(X(K)\), which is defined to be the non-negative integer \(w=w(T)\) for which \[\text{image}(H_{1}(T)\to H_{1}(X(K)))=wH_{1}(X(K))\] Let \(\mu_{0},\lambda_{0}\in H_{1}(\partial X_{0})\) denote meridional and longitudinal classes of \(K_{0}\) and \(\mu,\lambda\in H_{1}(\partial X(K))\) denote those of \(K\). These slopes can be oriented so that in \(H_{1}(M)\) we have \[\mu_{0}=w\mu\quad\text{and}\quad w\lambda_{0}=\lambda \tag{2.2.1}\] For a coprime pair \(p\) and \(q\geq 0\), define \(M(p/q)\) to be the \(p\mu+q\lambda\) Dehn filling of \(M\) along \(\partial X(K)\). Equivalently, \(M(p/q)\) is the \(p/q\)-Dehn surgery on the knot \(P\) in \(V\), and depending on the context, we will also denote \(M(p/q)\) by \(P(p/q)\). Similarly, we use \(K(p/q)\) to denote the \(p\mu+q\lambda\) Dehn filling of \(X(K)\) along \(\partial X(K)\). Then \[K(p/q)=M(p/q)\cup_{T}X_{0} \tag{2.2.2}\] From (2.2.1), it follows that \(p\mu_{0}+qw^{2}\lambda_{0}=w(p\mu+q\lambda)\) is null-homologous in \(M(p/q)\). Hence the longitudinal slope \(\lambda_{M(p/q)}\) of \(M(p/q)\) is given by \[\lambda_{M(p/q)}=\big{(}\frac{1}{\gcd(p,w^{2})}\big{)}(p\mu_{0}+qw^{2}\lambda_ {0}) \tag{2.2.3}\] It follows that the element of \(\mathbb{Q}_{\infty}\) corresponding to \(\lambda_{M(p/q)}\) as a slope on \(\partial X_{0}\) is \[\left\{\begin{array}{cl}1/0&\text{ if }w=0\\ p/qw^{2}&\text{ if }w\neq 0\end{array}\right. \tag{2.2.4}\] By Theorem 2.3 we have the following lemma. **Lemma 2.4**.: _Suppose \(r\in\mathbb{Q}\). If \(w=0\), then the longitudinal slope \(\lambda_{M(r)}\) of \(M(r)\) is the meridional slope of \(X_{0}\), and therefore is \(LO\)-detected and \(NLS\)-detected in \(X_{0}\)._ Combining Proposition 2.1 and Theorem 2.2 yields: **Lemma 2.5**.: _Let \(K=P(K_{0})\) be a satellite knot with pattern \(P\) and companion \(K_{0}\). Fix \(r\in\mathbb{Q}\). If \(T=\partial X_{0}\) is incompressible in \(K(r)\) and \(\lambda_{M(r)}\) is \(*\)-detected in \(X_{0}\), then \(K(r)\) has property \(*\), where \(*\) is either \(LO,NLS\), or \(CTF\)._ ### Conventions on cable knots Recall that given coprime integers \(m\) and \(n\) with \(|m|\geq 2\) (so \(n\neq 0\)), the \((m,n)\)-cable \(C_{m,n}(K_{0})\) of a non-trivial knot \(K_{0}\) is the satellite knot with companion \(K_{0}\) and pattern \(C_{m,n}\), the \((m,n)\) torus knot \(T(m,n)\) standardly embedded in \(V\) with winding number \(|m|\). Since reversing the orientation of \(C_{m,n}(K_{0})\) changes the signs of \(m\) and \(n\) simultaneously, throughout the text we assume, without loss of generality, that \(m\geq 2\) and \(n\neq 0\). An \((m,n)\)_-cable space_ is a \(3\)-manifold homeomorphic to the exterior of \(C_{m,n}\) in \(V\). If \(P\) and \(P_{0}\) are patterns, we define the pattern \(P(P_{0})\) in the obvious way. In particular, an \((m,n)\)_-cabled pattern_ is a pattern \(P\) such that \(P\) either \(C_{m,n}\) or \(C_{m,n}(P_{0})\) for some pattern \(P_{0}\). Note that if \(K=P(K_{0})\) is a satellite knot where \(P\) is an \((m,n)\)-cabled pattern, then \(K\) is cabled with _cabling slope_\(mn\), the boundary slope of the cabling annulus. We say that \(r\) is a _cabling slope_ for a knot \(K\) if \(K\) is a cable knot and \(r\) is the cabling slope. A knot has at most one cabling slope by Lemma 2.8 below. ### Reducible and toroidal surgery on satellite knots A knot \(P\) in \(V\) which admits a non-trivial solid torus surgery is called a _Berge-Gabai knot_. Gabai has shown that such a \(P\) lies in \(V\) as either a \(0\)-bridge braid (i.e. a torus knot standardly embedded in \(V\)) or a \(1\)-bridge braid ([18]). The latter are parameterised by triples \((w,b,t)\), where \(w\geq 3\) is the winding number of the braid and \(1\leq b,t\leq w-2\). (See [19]) The key to understanding reducible and toroidal surgeries on satellite knots is the following result of Scharlemann [43], which refined previous work of Gabai [18]. **Theorem 2.6**.: (Scharlemann [43]) _Suppose that \(P\) is a knot in a solid torus \(V\) whose exterior is irreducible and has incompressible boundary. If \(r\in\mathbb{Q}\), then exactly one of the following three possibilities arises._ 1. \(P(r)\) _is a solid torus and_ \(P\) _is either a_ \(0\)_-bridge braid or a_ \(1\)_-bridge braid in_ \(V\)_._ 2. \(P(r)\) _is reducible,_ \(P\) _is cabled in_ \(V\)_, and_ \(r\) _is the slope of the cabling annulus._ 3. \(P(r)\) _is irreducible with incompressible boundary._ **Corollary 2.7**.: (Scharlemann [43]) _If \(K\) is a satellite knot and \(K(r)\) is reducible for some rational \(r\), then \(K\) is a cable knot and \(r\) is the cable slope. That is, \(K=C_{m,n}(K_{0})\) for some \(m,n\) and \(r=mn\)._ The next lemma proves that cable knots are cabled in a unique way. **Lemma 2.8**.: _Suppose that \(K=C_{m,n}(K_{0})\). Then any essential torus in \(X(K)\) is isotopic into the exterior \(X_{0}\) of \(K_{0}\). Consequently,_ 1. \(K=C_{m,n}(K_{0})\) _is the unique realisation of K as a cable knot and therefore_ \(mn\) _is the unique slope on_ \(\partial X(K)\) _which is the slope of a cabling of_ \(K\)_;_ 2. _the winding number of any essential torus_ \(T\) _in_ \(X(K)\) _is divisible by_ \(m\)_._ Proof.: Write \(X(K)=M\cup_{T_{0}}X_{0}\), where \(M\) is an \((m,n)\)-cable space and \(\partial M=\partial X(K)\cup T_{0}\). Since the only Seifert pieces of the JSJ decomposition of the exterior of a non-trivial knot are cable spaces, composing spaces, or torus knot exteriors [29, Lemma VI.3.4], \(M\) is a piece of the JSJ decomposition of \(X(K)\). Let \(T\) be an essential torus in \(X(K)\) and set \(w=w(T)\). Isotope \(T\) to intersect \(T_{0}\) minimally. Suppose that \(T\cap T_{0}\) is non-empty. Then \(T\cap M\) consists of a non-empty family of essential annuli, each vertical in \(M\). In addition, the outer piece \(M_{0}\) of the JSJ decomposition of \(X_{0}\) admits an essential annulus \(A_{0}\), so must be Seifert fibred. Note that \(A_{0}\) cannot be horizontal in \(M_{0}\) as otherwise \(M_{0}\) would homeomorphic to \(T_{0}\times I\) or a twisted \(I\)-bundle over the Klein bottle. Thus it is vertical. But then the Seifert structures on \(M\) and \(M_{0}\) coincide on \(T_{0}\), contrary to the fact that \(M\) is a piece of the JSJ decomposition of \(X(K)\). Thus \(T\cap T_{0}=\emptyset\), so \(T\) is contained in \(M\) or \(X_{0}\). But if \(T\subset M\), the fact that cable spaces admit no essential tori implies that \(T\) is isotopic to \(T_{0}\) and therefore into \(X_{0}\). This implies that \(T_{0}\) is the outermost essential torus in \(X(K)\), which implies that (1) holds. Finally, since the homomorphism \(H_{1}(T)\to H_{1}(X(K))\) factors through \(H_{1}(X_{0})\), we see that the winding number of \(T_{0}\), which is \(m\), divides \(w\). **Corollary 2.9**.: (Scharlemann [43]) _If \(K=P(K_{0})\) is a satellite knot where \(P\) is a winding number \(1\) pattern, then \(K\) is not a cable knot and hence all surgeries on \(K\) are irreducible. _ Next we consider the compressibility of essential tori in satellite knot exteriors after surgery. Assume that \(K=P(K_{0})\) is a satellite knot with \(X(K)=M\cup_{T}X_{0}\) as above. Set \[\mathcal{C}(T)=\{\text{slopes $\alpha$ $| $T$ compresses in $K(\alpha)$}\}\] By Theorem 2.6, if \(\alpha\in\mathcal{C}(T)\) and \(K\) is not a cable knot, then \(P(\alpha)\cong S^{1}\times D^{2}\) and \(P\) is a \(1\)-bridge braid \((w,b,t)\) ([18]). Gabai has classified the \(1\)-bridge braid Berge-Gabai knots corresponding to the triples \(P=(w,b,t)\), where \(b=1,2\). When \(b=1\) he showed that they are \((2,n)\)-cables on \(0\)-bridge braids in \(V\) ([19, Example 3.7]) for some odd \(n\), so \(w\geq 4\). The latter inequality also holds when \(b\geq 2\), since \(w\geq b+2\). When \(w=4\) we have \(b\leq 2\), and in the case that \(b=2\), [19, Example 3.8] shows that no non-trivial surgery on \(P\) yields \(S^{1}\times D^{2}\). Thus we deduce, **Lemma 2.10**.: _A \(1\)-bridge braid \(P\) in a solid torus \(V\) has winding number \(w\geq 4\). If \(w=4\) and \(P\) admits a cosmetic surgery, then it is a cable on a \(0\)-bridge braid._ Berge has shown that a knot \(P\) in \(V\) which admits distinct cosmetic surgeries is either a \(0\)-bridge braid or one of the \(1\)-bridge braids corresponding to the triples \((7,2,4+7n)\) and \((7,4,2+7n)\) for some integer \(n\) ([2, Corollary 2.9]). **Theorem 2.11**.: (Berge, Gabai, Scharlemann) _Let \(K=P(K_{0})\) be a satellite knot with pattern \(P\) of winding number \(w\) and companion \(K_{0}\). Set \(T=\partial X_{0}\) and suppose that \(\mathcal{C}(T)\neq\{\mu\}\)._ 1. _If_ \(K\) _is not a cable knot there is an integer_ \(a\) _such that_ \[\mathcal{C}(T)\subseteq\{\mu,a\mu+\lambda,(a+1)\mu+\lambda\}\equiv\{\infty,a,a+1\}\] _Further,_ \(P\) _is a_ \(1\)_-bridge braid with_ \(w\geq 5\) _and for_ \(r\in\mathcal{C}(T)\)_, expressed as an element of_ \(\mathbb{Q}\cup\{\infty\}\)_,_ \(K(r)=K_{0}(r/w^{2})\)_._ 2. _If_ \(K=C_{m,n}(K_{0})\) _for coprime integers_ \(m\geq 2\) _and_ \(n\)_, then_ 1. \(\mathcal{C}(T)\) _is the set of slopes of distance at most_ \(1\) _from the cable slope_ \(mn\mu+\lambda\)_. That is,_ 2. \[\mathcal{C}(T)=\{mn\mu+\lambda\}\cup\{(bmn\pm 1)\mu+b\lambda\mid b\in\mathbb{Z}\} \equiv\{mn,mn\pm\frac{1}{b}\mid b\in\mathbb{Z}\}\] 2. \(K(mn)\cong K_{0}(n/m)\#L(m,n)\)_._ 3. \(K(p/q)\cong K_{0}(p/m^{2}q)\) _when_ \(p=qmn\pm 1\)_._ **Corollary 2.12**.: _Suppose that \(K=P(K_{0})\) is a satellite knot with pattern \(P\) of winding number \(w\leq 4\) and companion knot \(K_{0}\). If \(K\) is not a cable knot, then \(\mathcal{C}(\partial X(K_{0}))=\{\mu\}\)._ ## 3. Left-orderability, non-\(L\)-spaces and surgeries on satellite knots ### \(Lo\) and \(Nls\) surgery on satellite knots and winding numbers Baker and Motegi showed that the pattern of an \(L\)-space satellite knot must be braided [1], so its winding number is at least \(2\). In this section, we use slope detection and gluing to reprove this fact. An identical argument shows that the winding number of satellite knots that admit irreducible non-\(LO\) Dehn fillings must be strictly positive. **Theorem 3.1**.: _Suppose that \(K=P(K_{0})\) is a satellite knot with pattern of winding number zero. Let \(r\in\mathbb{Q}\) and assume that \(r\) is not a cabling slope for \(K\). Then \(K(r)\) is \(LO\) and \(NLS\)._ Proof.: Let \(T=\partial X(K_{0})\). Then \(K(r)=P(r)\cup_{T}X(K_{0})\). Since \(w(P)=0\), \(T\) is essential in \(K(r)\) by Gabai [16, Corollary 2.5]. The result follows from Lemma 2.4 and Lemma 2.5. Next we consider the case that \(X(K)\) contains an essential torus with winding number \(1\). **Theorem 3.2**.: _Let \(K=P(K_{0})\) be a satellite knot with pattern \(P\) of winding number \(1\). Then for any \(p\in\mathbb{Z}\), \(K(p)\) is \(LO\) and \(NLS\). More generally, \(K(p/(np\pm 1))\) is \(LO\) and \(NLS\) for any integers \(p\) and \(n\) such that \(np\pm 1\neq 0\). In particular, this holds for all rational surgeries \(K(p/q)\) with \(|p|=1,2,3,4\), or \(6\)._ Proof.: Since \(w(P)=1\), \(K\) is not a cable knot and \(K(p/q)\) is irreducible for all \(p/q\in\mathbb{Q}\) by Corollary 2.9. Further, \(\partial X(K_{0})\) remains incompressible in \(K(p/q)\) by Corollary 2.12. Write \(X(K)=M\cup_{T}X_{0}\) where \(T=\partial X_{0}\) and \(\partial M=\partial X(K)\cup T\). Then \(K(p/q)\) can be decomposed as \(M(p/q)\cup_{T}X_{0}\), where \(M(p/q)\) is the result of doing Dehn filling of \(M\) with respect to the \(p/q\) slope on \(\partial X(K)\). Another consequence of our assumption that \(w(P)=1\) is that \(M(p/q)\) is an integer homology solid torus for each \(p/q\), so as \(\partial X_{0}\) remains incompressible in \(K(p/q)\), \(K(p/q)\) is \(LO\) and \(NLS\) as long as there is a slope \(\alpha\) on \(T\) such that \(\Delta(\alpha,\lambda_{0})=\Delta(\alpha,\lambda_{M(p/q)})=1\) by Theorem 2.2 and Theorem 2.3. But \(\Delta(\alpha,\lambda_{0})=1\) if and only if \(\alpha\) corresponds to \(\mu_{0}+n\lambda_{0}\) for some \(n\in\mathbb{Z}\). On the other hand, \(\lambda_{M(p/q)}=p\mu_{0}+q\lambda_{0}\), since \(w=1\), so \(1=\Delta(\mu_{0}+n\lambda_{0},\lambda_{M(p/q)})=|np-q|\) if and only if \(q=np\pm 1\). In the case that \(p\in\pm\{1,2,3,4,6\}\), each integer coprime with \(p\) is congruent to \(\pm 1\) (mod \(p\)), which yields the final claim of the theorem. The set of \(L\)-space surgery slopes of an \(L\)-space knot of genus \(g\) is the set of slopes in either \([2g-1,\infty]\) or \([-\infty,-(2g-1)]\)[40, 33] and therefore the fact that the winding numbers of \(L\)-space satellite knots must be strictly bigger than \(1\) follows immediately from Theorems 3.1 and 3.2. **Corollary 3.3**.: _If \(K\) is a satellite \(L\)-space knot then any essential torus in the exterior of \(K\) has winding number \(2\) or more._ The \(L\)-space Conjecture predicts that all rational surgeries on a satellite knot with winding number \(1\) are \(LO\). Theorem 3.2 shows that this holds for a set of slopes that is unbounded in both positive and negative directions, but our present lack of knowledge about the set of \(LO\)-detected slopes on the boundary of an integer homology solid torus prevents us from proving this for all slopes. However, by considering iterated winding number \(1\) satellites we at least get knots \(K\) with successively larger sets of slopes \(r\) for which we can show that \(K(r)\) is \(LO\). To state the precise result, recall that the Farey graph is the graph with vertices \(\mathbb{Q}_{\infty}\) and an edge between \(r,r^{\prime}\in\mathbb{Q}_{\infty}\) if and only if \(\Delta(r,r^{\prime})=1\). We denote by \(d_{FG}(r,s)\) the distance in the Farey graph between \(r,s\in\mathbb{Q}_{\infty}\). **Theorem 3.4**.: _Let \(K\) be an iterated satellite knot \(P_{k-1}(...(P_{1}(K_{0}))...)\), where \(k\geq 2\) and \(w(P_{i})=1\) for all \(i\). Then for \(r\in\mathbb{Q}\), \(K(r)\) is \(LO\) and \(NLS\) if \(d_{FG}(0,r)\leq k\)._ Proof.: We prove the statement for \(LO\). For \(NLS\), the argument is identical; one simply replaces \(LO\) by \(NLS\) in the proof below. For \(k\geq 0\) let \(B_{k}=\{r\in\mathbb{Q}_{\infty}:d_{FG}(0,r)\leq k\}\). Thus \(B_{0}=\{0\}\), \(B_{1}=\{1/n:n\in\mathbb{Z}\}\cup\{0\}\), and \(B_{2}=\{p/(np\pm 1):p,n\in\mathbb{Z}\}\). Let \(K\) be as in the theorem. We must show that \(K(r)\) is \(LO\) for all \(r\in B_{k}\setminus\{1/0\}\). We proceed by induction on \(k\); the statement holds for \(k=2\) by Theorem 3.2. So suppose that \(k\geq 3\), and that the claim holds for \(k-1\). To simplify the notation, write \(P=P_{k-1}\) and \(K^{\prime}=P_{k-2}(...(P_{1}(K_{0}))...)\), so \(K=P(K^{\prime})\). The inductive hypothesis says that \(K^{\prime}(r^{\prime})\) is \(LO\) for all \(r^{\prime}\in B_{k-1}\setminus\{1/0\}\). Also, \(1/0\) is \(LO\)-detected in \(X(K^{\prime})\) by Theorem 2.3. Therefore any \(r^{\prime}\in B_{k-1}\) is \(LO\)-detected in \(X(K^{\prime})\). Let \(r\in B_{k}\setminus\{1/0\}\) represent a slope on \(\partial X(K)\). Then \(K(r)=P(r)\cup_{T}X(K^{\prime})\), where \(P(r)\) is irreducible and \(T=\partial P(r)=\partial X(K^{\prime})\) is incompressible in \(K(r)\) since \(w(P)=1\), by Corollary 2.9 and Corollary 2.12. Moreover, since \(w(P)=1\), \(P(r)\) is an integer homology solid torus whose longitude has slope \(r\) on \(\partial X(K^{\prime})\). Since \(r\in B_{k}\setminus\{1/0\}\), there exists \(r^{\prime}\in B_{k-1}\) such that \(\Delta(r,r^{\prime})\leq 1\). Thus \(r^{\prime}\) is \(LO\)-detected in \(P(r)\) by Theorem 2.3 and Proposition 2.1. Since \(r^{\prime}\) is also \(LO\)-detected in \(X(K^{\prime})\) by our discussion above, it follows that \(K(r)\) is \(LO\) by Theorem 2.2. **Remarks 3.5**.: We make some remarks relating the hypothesis on \(K\) in Theorem 3.4 to the JSJ decomposition of its exterior. Inductively define \(K_{i}=P_{i}(K_{i-1})\), \(1\leq i\leq k-1\), so \(K_{k-1}=K\), and let \(V_{i}\) be a regular neighborhood of \(K_{i}\) in \(S^{3}\), \(0\leq i\leq k-1\). Then \(V_{i}\subset\mathrm{int}V_{i-1}\) is a regular neighborhood of \(P_{i}\subset V_{i-1}\), \(1\leq i\leq k-1\). By hypothesis, \(P_{i}\) has winding number \(1\) in \(V_{i-1}\). Let \(T_{i}=\partial V_{i}\), \(0\leq i\leq k-2\); so \(T_{0}=\partial X(K_{0})\) and \(\{T_{0},T_{1},...,T_{k-2}\}\) is a collection of essential, non-parallel, winding number \(1\) tori in \(X(K)\). We can choose \(k\) to be maximal for \(T_{0}\); then the \(T_{i}\) are JSJ tori for \(X(K)\). For a JSJ torus \(T\) in \(X(K)\), define \(k(T)\) to be the length of the minimal simplicial path in the JSJ graph of \(K\) containing the edge corresponding to \(T\) and the root vertex. Then Theorem 3.4 can be expressed as saying that if \(X(K)\) contains a winding number \(1\) JSJ torus \(T\) then, for \(r\in\mathbb{Q}\), \(K(r)\) is \(LO\) and \(NLS\) if \(d_{FG}(0,r)\leq k(T)+1\). In fact, by Theorem 3.13 we may assume that the JSJ graph of \(K\) is a rooted interval. Then, defining \(M_{i}=V_{i}\backslash\) int \(V_{i+1}\), \(0\leq i\leq k-2\), the \(M_{i}\) are JSJ pieces of the JSJ decomposition of \(X(K)\). Note that since the \(P_{i}\) have winding number \(1\) the \(M_{i}\) will be hyperbolic. ### \(Lo\) and \(Nls\) surgery on satellite knots from patterns and companions It is shown in [23] that if \(K=P(K_{0})\) is a satellite \(L\)-space knot, then both \(K_{0}\) and \(P(U)\) are \(L\)-space knots, where \(U\) is the unknot. Equivalently, if either \(K_{0}\) or \(P(U)\) is not an \(L\)-space knot, then \(K=P(K_{0})\) is not an \(L\)-space knot. In this section, we prove the following analogous result for left-orderability. **Theorem 3.6**.: _Let \(K=P(K_{0})\) be a satellite knot. Suppose that either \(K_{0}(r)\) or \(P(U)(r)\) is \(LO\) for all \(r\in\mathbb{Q}\). Then for any \(r\in\mathbb{Q}\), \(K(r)\) is \(LO\) unless \(r\) is a cabling slope for \(K\)._ Note that if \(K\) admits a pattern with winding number \(w=0\), then \(K(r)\) is LO for any non-cabling slope \(r\in\mathbb{Q}\) by Theorem 3.1. Hence Theorem 3.6 follows from Propositions 3.7 and 3.8 below. **Proposition 3.7**.: _Let \(K=P(K_{0})\) be a satellite knot and fix \(r\in\mathbb{Q}\). Then \(K(r)\) is \(LO\) if \(P(U)(r)\) is._ Proof.: Assume that \(\pi_{1}(P(U)(r))\) is left-orderable. Then \(r\) cannot be the cabling slope if \(K\) is a cable knot. So \(K(r)\) is irreducible by Corollary 2.7. Then \(K(r)\) has a left-orderable fundamental group if and only if there is a non-trivial homomorphism of \(\pi_{1}(K(r))\) to a left-orderable group ([5, Theorem 1.1]). Note that there is a slope-preserving degree one map \((X(K),\partial X(K))\to(X(P(U)),\partial X(P(U)))\), and hence it induces a degree \(1\) map \(K(r)\to P(U)(r)\). The claim then follows. **Proposition 3.8**.: _Let \(K=P(K_{0})\) be a satellite knot with pattern \(P\) of winding number \(w\geq 1\). Fix \(r\in\mathbb{Q}\) and suppose that \(r\) is not a cabling slope for \(K\). Then \(K(r)\) is \(LO\) if \(K_{0}(r/w^{2})\) is._ Proof.: Suppose that \(w\geq 1\) and \(K_{0}(r/w^{2})\) is \(LO\). The fact that \(K_{0}(r/w^{2})\) is \(LO\) implies that \(r/w^{2}\) is \(LO\)-detected in \(X_{0}\) by Corollary 8.3 of [4], so if \(T=\partial X_{0}\) is incompressible in \(K(r)\), then \(K(r)\) is \(LO\) by Lemma 2.5. On the other hand, if \(T\) compresses in \(K(r)\), then by Theorem 2.11(1) and (2)(c) we have \(K(r)\cong K_{0}(r/w^{2})\) and therefore is \(LO\). We remark that if \(T\) is incompressible in \(K(r)\) then we only need \(r/w^{2}\) to be \(LO\)-detected in \(X_{0}\) to deduce that \(K(r)\) is \(LO\) by Lemma 2.5. The method of proof of Proposition 3.7 does not immediately apply to the \(NLS\) and \(CTF\) cases due to the unanswered question below. See Lemma 2.5. **Question 3.9**.: Let \(M\) be a closed, connected, orientable, irreducible \(3\)-manifold. If there exists a degree nonzero map from \(M\) to a closed, connected, orientable, irreducible \(3\)-manifold \(N\) that has property \(*\), does \(M\) have property \(*\), where \(*\in\{NLS\), \(CTF\}\)? Since Question 3.9 is known to have a positive answer when \(*=LO\), the \(L\)-space conjecture predicts positive answers for both \(NLS\) and \(CTF\), though currently there are very few results in this direction. See [35, 26] for partial answers to Question 3.9 for the \(NLS\) case. **Remark 3.10**.: The argument of Proposition 3.8 can be applied to prove the same statement for the \(NLS\) property. For \(CTF\), we need to replace the condition that \(K(r/w^{2})\) is \(CTF\) by a stronger condition. See Proposition 4.4. ### \(Lo\) and \(Nls\) surgery on satellite knots and JSJ-graphs **Theorem 3.11**.: _Suppose that the exterior \(X(K)\) of a knot \(K\) contains disjoint essential tori \(T_{1},T_{2}\) which together with \(\partial X(K)\) cobound a connected submanifold of \(X(K)\). Let \(r\in\mathbb{Q}\) and assume that \(r\) is not a cabling slope for \(K\). Then \(K(r)\) is \(LO\) and \(NLS\)._ Proof.: We can assume that \(X(K)\) contains no winding number \(0\) essential tori by Corollary 3.1. Since \(K(0)\) is irreducible [17], \(K(0)\) is \(LO\) by [5, Theorem 1.1]. And \(K(0)\) is not an \(L\)-space by definition. Hence, we can assume that \(r\neq 0\). Write \(X(K)=Y\cup_{T_{1}}X_{1}\cup_{T_{2}}X_{2}\), where \(Y\) is connected, \(\partial Y=T_{1}\cup T_{2}\cup\partial X(K)\), and \(X_{1},X_{2}\) are non-trivial knot exteriors with \(\partial X_{i}=T_{i}\). By assumption, \(K(r)=X_{1}\cup_{T_{1}}Y(r)\cup_{T_{2}}X_{2}\) is irreducible. We claim that \(Y(r)\) is irreducible. Otherwise, the irreducibility of \(K(r)\) implies that some \(T_{i}\), say \(T_{1}\), compresses in \(Y(r)\). Let \(V_{1}\) be the solid torus in \(S^{3}\) bounded by \(T_{1}\) and apply Theorem 2.6 to \(K\subset V_{1}\). Since \(T_{1}\) compresses in \(K(r)\), Theorem 2.6(c) doesn't hold, and (b) doesn't hold by our hypothesis that \(r\) is not a cabling slope of \(K\). Hence Theorem 2.6(a) holds and so \(K\) is braided in \(V_{1}\). Therefore the torus \(T_{2}\) bounds a solid torus in \(V_{1}\) by [2, Lemma 3.1], contradicting the fact that it bounds \(X_{2}\) there. By a result of Schubert, see [9, Proposition 2.1], we can find meridional disks \(D_{i}\) of the solid tori \(V_{i}=S^{3}\setminus\operatorname{int}(X_{i})\), \(i=1,2\), which are contained in \(S^{3}\setminus(\operatorname{int}(X_{1})\cup\operatorname{int}(X_{2}))\). This implies that the meridional class \(\mu_{1}\) of \(X_{1}\), which is represented by \(\partial D_{1}\), is homologous to \(w_{1}\mu\) in \(Y\), where \(\mu\) is the meridional class of \(K\) and \(w_{1}\) the winding number of \(T_{1}\) in \(X(K)\). By hypothesis, \(w_{1}\neq 0\) and so \(\mu_{1}\neq 0\in H_{1}(Y)\). Similarly the meridional class \(\mu_{2}\) of \(X_{2}\) is homologous to \(w_{2}\mu\) in \(Y\), where \(w_{2}\neq 0\). Thus \[w_{2}\mu_{1}=w_{1}\mu_{2}\in H_{1}(Y),\] so there is a compact, connected, orientable surface \(S\) properly embedded in \(Y\) with boundary \(w_{2}\mu_{1}-w_{1}\mu_{2}\). Since both \(\mu_{1}\) and \(\mu_{2}\) have infinite order in \(H_{1}(Y)\), \(S\) is non-separating and intersects \(T_{i}\) in curves of slope \(\mu_{i}\) for each \(i\). Let \(U_{i}\) be the twisted \(I\)-bundle over the Klein bottle and \(\lambda_{U_{i}}\) be the longitudinal slope of \(U_{i}\). It follows that the manifold \(U_{1}\cup_{T_{1}}Y(r)\cup_{T_{2}}U_{2}\), obtained by gluing \(U_{i}\) to \(Y(r)\) along \(T_{i}\) with \(\lambda_{U_{i}}\) identified with \(\mu_{i}\), is irreducible and has positive first Betti number, and hence is \(LO\) and \(NLS\). Then by [7, Definition 4.6, Proposition 6.13], the multislope \(([\mu_{1}],[\mu_{2}])\) is \(LO\)- and \(NLS\)-detected in \(Y(r)\). On the other hand, each \([\mu_{i}]\) is \(LO\)- and \(NLS\)-detected in \(X_{i}\) by Theorem 2.3. Therefore, using the multislope gluing theorem [7, Theorem 7.6], we have \(K(r)=X_{1}\cup_{T_{1}}Y(r)\cup_{T_{2}}X_{2}\) is \(LO\) and \(NLS\). This completes the proof. Recall the rooted JSJ graph of a knot described in the introduction. Here are two immediate consequences of Theorem 3.11. **Theorem 3.12**.: _Suppose that \(K\) is a satellite \(L\)-space knot. Then the JSJ graph of \(K\) is a rooted interval._ This theorem can also be deduced by combining the Baker-Motegi result that the pattern of an \(L\)-space satellite knot is braided in the pattern solid torus [1] and Lemma 3.1 of [2]. **Theorem 3.13**.: _Suppose that \(K\) is a satellite knot which admits an irreducible rational surgery that is not \(LO\). Then the JSJ graph of \(K\) is a rooted interval._ Since the JSJ graph of a composite knot is never an interval with root vertex corresponding to an endpoint, Theorem 3.12 gives another proof of Krcatovich's result that \(L\)-space knots are prime [32]. Moreover, by Corollary 2.9, any Dehn surgery on a composite knot is irreducible. Hence, we can also deduce the \(LO\) counterpart of Krcatovich's result. **Corollary 3.14**.: _All rational surgeries on a composite knot are \(LO\) and \(NLS\). _ ## 4. Co-oriented taut foliations and surgeries on satellite knots The same arguments we used in the proof of Theorem 3.1 and Theorem 3.11 show that the analogous results hold for the existence of co-orientable taut foliations when the meridians of the companion knots which arise are \(CTF\)-detected, a property that we conjecture to hold for any non-trivial knot (Conjecture 1.1). In [7], we showed that the meridians of fibred knots are \(CTF\)-detected (see Theorem 2.3), from which we deduce the following three results. **Proposition 4.1**.: _Suppose that \(K\) is a satellite knot whose exterior contains a winding number zero essential torus which bounds the exterior of a fibred knot in \(X(K)\). Then \(K(r)\) is \(CTF\) unless \(r\) is a cabling slope for \(K\)._ **Proposition 4.2**.: _Suppose that the exterior \(X(K)\) of a knot \(K\) contains disjoint essential tori \(T_{1},T_{2}\) which together with \(\partial X(K)\) cobound a connected submanifold of \(X(K)\), and each of which bounds the exterior of a fibred knot. Then \(K(r)\) is \(CTF\) unless \(r\) is a cabling slope for \(K\)._ **Corollary 4.3**.: (Delman-Roberts) _All rational Dehn surgeries on a composite fibred knot are \(CTF\)._ Next, we consider the \(CTF\) analogs of Proposition 3.8 proved in SS3.2. As pointed out in Remark 3.10, the argument of Proposition 3.8 currently cannot be applied to the \(CTF\) case owing to the fact that unlike the \(NLS\) and \(LO\) cases, it is unknown whether \(K(r)\) being \(CTF\) implies that \(r\) is \(CTF\)-detected. In [7], we defined a slope \(r\in\mathbb{Q}\) of a knot exterior \(X(K)\) to be _strongly \(CTF\)-detected_ if there exists a co-orientable taut foliation on \(X(K)\) that transversely intersects \(\partial X(K)\) in a linear foliation by simple closed curves of slope \(r\). If \(r\) is strongly \(CTF\)-detected, it is clear that it is \(CTF\)-detected and that \(K(r)\) is \(CTF\). Hence, an identical argument to that of Proposition 3.8 shows the following: **Proposition 4.4**.: _Suppose that \(K=P(K_{0})\) is a satellite knot where \(P\) has winding number \(w\geq 1\). Then \(K(r)\) is \(CTF\) if \(r/w^{2}\) is a strongly \(CTF\)-detected slope of \(X(K_{0})\) and \(r\) is not a cabling slope for \(K\)._ Analogous to Proposition 3.8, in Proposition 4.4 if \(\partial X(K_{0})\) is incompressible in \(K(r)\) we need only assume that \(r/w^{2}\) is \(CTF\)-detected in \(X(K_{0})\), as stated in Lemma 2.5. Delman and Roberts call a knot \(K\)_persistently foliar_ if all rational slopes \(r\) of \(K\) are strongly \(CTF\)-detected. The theorem below is an immediate consequence of Proposition 4.4. **Theorem 4.5**.: _Suppose that \(K=P(K_{0})\) is a satellite knot with a persistently foliar companion whose associated pattern has winding number \(w\geq 1\). Then \(K(r)\) is \(CTF\) for any \(r\in\mathbb{Q}\) which is not a cabling slope for \(K\)._ In [11], Delman and Roberts have shown that if \(K\) is persistently foliar, then the same is true for the connected sum of \(K\) with any other knot ([11]). Consequently, every rational surgery on such a knot admits a co-oriented taut foliation. Since a composite knot cannot be a cable knot (cf. part (2) of Lemma 2.8), this result of Delman and Roberts is a special case of Theorem 4.5. **Corollary 4.6** (Delman-Roberts [11]).: _Each rational surgery on a composite knot with a persistently foliar summand is \(CTF\)._ Lastly, we use Proposition 4.4 to deduce Proposition 4.7 below, which is based on a result of Roberts but also strengthens it. More precisely, in [42, Theorem 4.7], Roberts shows that if \(K\) is a fibered knot whose monodromy has non-negative fractional Dehn twist coefficient, then any slope \(r\in(-\infty,1)\) is strongly \(CTF\)-detected in \(X(K)\)1. This, together with Proposition 4.4, immediately implies the following. Footnote 1: Though the statement of Theorem 4.7 in [42] requires the knot to be hyperbolic, the argument in [42] holds for all non-trivial fibred knots (cf. [11, Theorem 1.4]). **Proposition 4.7**.: _Let \(K\) be a satellite knot with a fibred companion and a pattern of winding number \(w\geq 0\). Suppose that the fractional Dehn twist coefficent of the companion knot is non-negative. Then \(K(r)\) is \(CTF\) for each rational \(r\in(-\infty,w^{2})\) unless \(r\) is a cabling slope for \(K\). In particular this holds for fibred strongly quasipositive satellite knots._ **Remark 4.8**.: Let \(X_{0}\) be the exterior of the companion knot of the satellite knot \(K\) in Proposition 4.7. Then the slope \(1\) is \(CTF\)-detected in \(X_{0}\) by Theorem 2.3. Therefore, by Lemma 2.5, if \(\partial X_{0}\) is incompressible in \(K(w^{2})\) then the conclusion of the proposition holds for slopes \(w^{2}\) and hence for all slopes \(r\in(-\infty,w^{2}]\). This will be used in the proof of Theorem 4.11 below. Since positive \(L\)-space knots (i.e. knots with a positive \(L\)-space surgery) are fibred strongly quasipositive [39, 25], Proposition 4.7 applies to positive satellite \(L\)-space knots. In fact Lemma 4.10 below shows that in that case the possibility that \(r\) is a cabling slope does not arise. Hence we have the following corollary. **Corollary 4.9**.: _If \(K\) is a positive satellite \(L\)-space knot with pattern of winding number \(w\) then \(K(r)\) is \(CTF\) for each rational \(r\in(-\infty,w^{2})\)._ **Lemma 4.10**.: _Let \(K=P(K_{0})\) be a positive satellite \(L\)-space knot where \(P\) is a cabled pattern with winding number \(w\). Then the cabling slope of \(K\) is greater than or equal to \(w^{2}\)._ Proof.: We first consider the case \(P=C_{m,n}\). By [27], \(n/m\geq 2g(K_{0})-1\geq 1\), so \(n\geq m\). Then the cabling slope of \(K=mn\geq m^{2}=w^{2}\). Now suppose \(P=C_{m,n}(P_{0})\) where \(P_{0}\) is a pattern. Let \(K_{1}=P_{0}(K_{0})\); so \(K=C_{m,n}(K_{1})\). Let \(w_{0}=w(P_{0})\) and \(g_{0}=g(K_{0})\). Then \[g(K_{1})=g(P_{0}(U))+w_{0}g_{0}\] Since \(K_{1}\) is also a satellite \(L\)-space knot ([23]), by [1, Theorem 7.5(1)], \(2g(P_{0}(U))-1+w_{0}>w_{0}(w_{0}-1)(2g_{0}-1)\) and therefore \[2g(K_{1})-1 = 2g(P_{0}(U))-1+2w_{0}g_{0}\] \[> w_{0}(w_{0}-1)(2g_{0}-1)-w_{0}+2w_{0}g_{0}\] \[= w_{0}^{2}(2g_{0}-1)\] \[\geq w_{0}^{2}\] Hence as \(n/m\geq 2g(K_{1})-1>w_{0}^{2}\) by [27], \(mn>m^{2}w_{0}^{2}=w^{2}\). We apply Proposition 4.7 and the subsequent discussion to show that surgery on a positive satellite \(L\)-space knot with surgery coefficient at most \(9\) is \(CTF\) if and only if it is \(NLS\) (Corollary 4.12). **Theorem 4.11**.: _Let \(K=P(K_{0})\) be a positive satellite \(L\)-space knot. Then \(K(r)\) is \(CTF\) if \(r\leq 9\) unless \(K(r)\) is an \(L\)-space. The latter happens exactly when \(K=C_{2,n}(T(2,3))\) and either_ 1. \(n=3,r\in[5,9]\) _or_ 2. \(n=5,r\in[7,9]\) _or_ 3. \(n=7,r=9\)_._ Proof.: The result follows from Corollary 4.9 when \(w(P)>3\) so we can assume that \(w(P)\in\{2,3\}\) by Corollary 3.3. In this case Theorem 2.11 implies that if \(T=\partial X(K_{0})\) compresses in \(K(r)\) for some \(r\in\mathbb{Q}\), then \(P=C_{w(P),n}\) for an integer \(n\) coprime with \(w(P)\) such that \(\Delta(nw(P),r)\leq 1\). If \(w(P)=3\), Corollary 4.9 implies that \(K(r)\) is \(CTF\) for \(r<9\). The same conclusion holds when \(r=9\) as long as \(T\) is incompressible in \(K(9)\) by Remark 4.8. But if it compresses, \(P=C_{3,n}\) for some \(n\) coprime with \(3\) such that \(|9-3n|=\Delta(9/1,3n/1)\leq 1\), which is impossible. The final case to consider is when \(w(P)=2\). Since \(P\) is braided in its solid torus ([1]), \(P=C_{2,n}\) for some odd \(n\). We consider three cases: \(g(K_{0})=1\), \(g(K_{0})=2\) and \(g(K_{0})>2\). ### Case 1. \(g(K_{0})=1\) Then \(K_{0}=T(2,3)\) by [21]. Since \(K\) is a positive \(L\)-space knot, [27] implies that \(n/2\geq 2g(K_{0})-1=1\), so as \(n\) is odd, \(n\geq 3\). Also, \(C_{2,n}(U)=T(2,n)\), and therefore \(g(K)=g(C_{2,n}(U))+2g(K_{0})=(n-1)/2+2=(n+3)/2\). If \(r\neq 2n\), then \(K(r)\) is either Seifert fibered or a graph manifold, therefore it is \(CTF\) if and only if it is \(NLS\) ([36, 3, 22]), and the latter happens if and only if \(r<2g(K)-1=n+2\). For \(n+2\leq r\leq 9\), we obtain the exceptions listed in the theorem. Note that when \(n=3\) and \(r=2n=6\), we have that \(K(6)=L(2,3)\#T(2,3)(3/2)\) is an \(L\)-space and is not \(CTF\). ### Case 2. \(g(K_{0})=2\) Then \(K_{0}=T(2,5)\) by [12]. By [27], \(n/2\geq 2g(K_{0})-1=3\), so \(n\geq 7\) and the cabling slope \(2n\geq 14\). Also, \(g(K)=(n-1)/2+2\cdot 2=(n+7)/2\), and hence, as in the case above, \(K(r)\) is \(CTF\) if and only if \(r<2g(K)-1=n+6\). Therefore \(K(r)\) is \(CTF\) for \(r<13\). ### Case 3. \(g(K_{0})>2\) By [27], \(n/2\geq 2\cdot 3-1=5\), so \(n\geq 11\) and the cabling slope is \(2n\geq 22\). We have \(K(r)=C_{2,n}(r)\cup_{T}X(K_{0})\). We first claim that \(T\) must be incompressible in \(C_{2,n}(r)\) when \(r<21\). To see this, set \(r=p/q\) and note that if \(T\) compresses in \(C_{2,n}(r)\), we have \(|p-2nq|=\Delta(p/q,2n/1)\leq 1\) and therefore \(|p/q-2n|\leq 1/q\leq 1\). Since \(2n\geq 22\), \(r=p/q\geq 21\), which proves the claim. Now consider \(K=C_{2,n}(K_{0})\) and \(K(r)=C_{2,n}(r)\cup_{T}X(K_{0})\) with \(T\) incompressible. We will show that there exists a slope \(s\) on \(T\) that is \(CTF\)-detected in both \(C_{2,n}(r)\) and \(X(K_{0})\). First of all, note that the set of \(CTF\)-detected slopes for \(X(K_{0})\) contains \([-\infty,1]\) by [42] and Theorem 2.3. To analyse the set of \(CTF\)-detected slopes in \(C_{2,n}(r)\), consider \(K^{\prime}=C_{2,n}(T(2,3))\). Then \(K^{\prime}(r)=C_{2,n}(r)\cup_{T^{\prime}}X(T(2,3))\). Since \(n/2\geq 11/2>2g(T(2,3))-1=1\), [24] implies that \(K^{\prime}\) is an \(L\)-space knot, and as we argued in Case 1, \(K^{\prime}(r)\) is \(NLS\) if and only if \(r<n+2\), and hence is \(NLS\) for \(r<13\). Therefore, by [23], for \(r<13\), there is a slope \(s\) on \(T^{\prime}\) that is \(NLS\)-detected in both \(C_{2,n}(r)\) and \(X(T(2,3))\). Since \(C_{2,n}(r)\) and \(X(T(2,3))\) are Seifert fiber spaces, \(s\) is \(CTF\)-detected in both \(C_{2,n}(r)\) and \(X(T(2,3))\)[3, Theorem 1.6]. Now the \(CTF\)-detected slopes for \(X(T(2,3))\) are precisely those in the interval \([-\infty,1]\) (with respect to the standard meridional and longitudinal basis). So the slope \(s\) as a slope on \(\partial X(K_{0})=T=\partial C_{2,n}(r)=T^{\prime}\) is also contained in \([-\infty,1]\). Therefore there is a slope \(s\) on \(T\) that is \(CTF\)-detected in both \(C_{2,n}(r)\) and \(X(K_{0})\). Hence \(K(r)\) is \(CTF\) for \(r<13\). **Corollary 4.12**.: _If \(K\) is a positive satellite \(L\)-space knot then for any \(r\leq 9\), \(K(r)\) is \(CTF\) if and only if it is \(NLS\)._ ## 5. Left-orderable \(p/q\)-surgeries on knots with \(|p|\) small Left-orderable surgery on torus knots is completely understood. In fact, given a coprime pair \(m,n\geq 2\), the \((m,n)\) torus knot \(T(m,n)\) is an \(L\)-space knot. As the \(L\)-space conjecture is known for Seifert manifolds, if \(p/q\in\mathbb{Q}\) then \(T(m,n)(p/q)\) is \(LO\) if and only if \(p/q<2g(T(m,n))-1=mn-(m+n)\). In this section, we consider \(p/q\)-surgeries on hyperbolic and satellite knots with \(|p|\) small and prove the theorem below. Note that Theorem 1.2 is a simplified version of Theorem 5.1. **Theorem 5.1**.: _Let \(K\) be a non-trivial knot, \(|p|=1\) or \(2\), and \(q\neq 0\). Then \(K(p/q)\) is \(LO\) unless either_ 1. \(K=T(2,3\epsilon)\) _and_ \(p/q=\epsilon\) _or_ \(2\epsilon\) _for some_ \(\epsilon=\pm 1;\) _or_ 2. \(K\) _is a_ \((2,\epsilon)\)_-cable and_ \(p/q=2\epsilon\) _for some_ \(\epsilon=\pm 1;\) _or_ 3. \(K\) _is hyperbolic and_ \(|p/q|\in\{1/3,1/2,2/3,1,2\}\)_._ **Remark 5.2**.: In cases (1) and (2), \(K(p/q)\) is not \(LO\). On the other hand, since a hyperbolic \(L\)-space knot has genus at least \(3\)[39, 12], the \(L\)-space Conjecture predicts that for any hyperbolic knot \(K\), \(K(r)\) is \(LO\) either for all \(r\in(-\infty,5)\) or for all \(r\in(-5,\infty)\). Thus it is expected that the potential exceptional slopes listed in case (3) do not arise. ### \(Lo\)\(p/q\)-surgeries on satellite knots when \(|p|\) small In [7], we proved the following theorem. **Theorem 5.3** (Theorem 2.1 in [7]).: _Suppose that \(W\) is a closed, connected, orientable, irreducible, toroidal \(3\)-manifold. If \(|H_{1}(W)|\leq 4\), then \(W\) is LO._ It follows that if \(1\leq|p|\leq 4\) and \(K(p/q)\) is irreducible and toroidal, then \(K(p/q)\) is \(LO\). The following result is then a consequence of the discussion of irreducible and toroidal surgery on satellite knots in SS2. **Proposition 5.4**.: _Let \(K\) be a satellite knot with pattern \(P\) and companion \(K_{0}\). Suppose that \(p/q\) is a reduced fraction with \(|p|\leq 4\) and \(q\geq 2\). Then \(K(p/q)\) is \(LO\) unless there is an \(\varepsilon\in\{\pm 1\}\) _such that \(K\) is an \((2,\varepsilon)\)-cable on a hyperbolic knot \(K_{0}\), where \(p/q=3\varepsilon/2\) and \(K_{0}(3\varepsilon/8)\) is not \(LO\)._ Proof.: Since \(1\leq|p|\leq 4\), \(K(p/q)\) will be \(LO\) as long as \(K(p/q)\) is irreducible and toroidal. The former is guaranteed by the condition that \(q\geq 2\) (Corollary 2.7), so we need only analyse when the latter occurs. Theorem 2.11 shows that \(K(p/q)\) is toroidal if \(K\) is not a cable knot, so suppose that it is, say \(K=C_{m,n}(K_{0})\) where \(K_{0}\) is non-trivial and \(m\geq 2,n\neq 0\). Assume that \(q\geq 2\) and that \(K(p/q)\) is not \(LO\), and hence is atoroidal. Let \(T\) be an essential torus in the interior of \(X(K)\) which bounds the exterior of a simple knot \(K_{1}\) (i.e. a torus or hyperbolic knot) contained in \(X(K)\). Since \(K(p/q)\) is not \(LO\), \(T\) must compress in \(K(p/q)\), and therefore as \(q\geq 2\), [10, Theorem 2.0.1] implies that \(K\) is a cable on \(K_{1}\). Thus \(K_{1}=K_{0}\). Now \(T\) compresses in \(K(p/q)\) if and only if \(|qmn-p|\leq 1\). We cannot have \(p=qmn\), as otherwise \(q=1\), so there is some \(\varepsilon\in\{\pm 1\}\) such that \(qmn=p+\varepsilon\). Then \[4|n|\leq qm|n|=|p+\varepsilon|\leq 5\] and therefore \(|n|=1\), \(m=q=2\), \(p=3\varepsilon\). Further, \(n=(p+\varepsilon)/qm=\varepsilon\) and \[K(p/q)=K(3\varepsilon/2)\cong K_{0}(3\varepsilon/8)\] Since \(3\varepsilon/8\) surgery on a torus knot is always \(LO\), \(K_{0}\) must be hyperbolic. **Remarks 5.5**.: 1. Since \(-1<3\varepsilon/8<1\), \(3\varepsilon/8\)-surgery on any non-trivial knot is not an \(L\)-space. Hence in Proposition 5.4, \(K(p/q)=K(3\varepsilon/2)\cong K_{0}(3\varepsilon/8)\) is not an \(L\)-space and therefore the \(L\)-space conjecture predicts that it is \(LO\). Thus the potential exception listed in the proposition is not expected to exist. 2. Similar arguments can be used to show that if \(K(p)\) is not \(LO\) for some \(1\leq|p|\leq 4\), then 1. if \(K\) is not a cable knot, there are at most two values of such \(p\) for which \(K(p)\) is not \(LO\), and if two, they are successive integers; 2. if \(K=C_{m,n}(K_{0})\), then \(K(p)\) is \(LO\) unless \(|n|=1\) and either 1. \(p=mn\) is the cabling slope; 2. \(p=mn\pm 1\) and \(K(p)=K(mn\pm 1)\cong K_{0}((mn\pm 1)/m^{2})\), where \(K_{0}\) is a hyperbolic knot, and \(K_{0}((mn\pm 1)/m^{2})\) is not \(LO\). Since \(\frac{|mn\pm 1|}{m^{2}}\leq\frac{|m|+1}{m^{2}}\leq 3/4\), we do not expect that a hyperbolic knot \(K_{0}\) as in (ii) to exist. ### \(Lo\)\(p/q\)-surgery on hyperbolic knots when \(|p|\leq 2\) Although the question of which surgeries on a hyperbolic knot \(K\) are \(LO\) is wide open in general, we can deal with surgeries with \(|p|\) small using the existence of a pseudo-Anosov flow \(\Phi_{0}\) on \(S^{3}\setminus K\). See [38] and [8] for background information on pseudo-Anosov flows. In the case that \(|p|=1,2\) and \(K\) is hyperbolic, it is known that \(K(p/q)\) is never an \(L\)-space. Thus we expect all such surgeries to yield manifolds that are \(LO\). Gabai and Mosher have independently shown that pseudo-Anosov flows exist on the complement of any hyperbolic link in a closed, orientable \(3\)-manifold. More precisely, they show that given a finite depth taut foliation \(\mathcal{F}\) on a compact, connected, orientable, hyperbolic \(3\)-manifold \(M\) with non-empty boundary consisting of tori, there is a pseudo-Anosov flow on the interior of \(M\) which is almost transverse to \(\mathcal{F}\) (cf. [38, Theorem C(3)]). Unfortunately, no proof has been published, though Landry and Tsang have recently produced the first of several planned articles which will provide a demonstration. See [34]. To describe the proof of Theorem 5.6, let \(K\) be a hyperbolic knot and \(\Phi_{0}\) a pseudo-Anosov flow on its exterior \(X(K)\) almost transverse to a finite depth foliation which contains a minimal genus Seifert surface leaf. Then the degeneracy locus \(\delta(\Phi_{0})\) of \(\Phi_{0}\) is not longitudinal and it is known that \(\Phi_{0}\) will extend to a pseudo-Anosov flow \(\Phi_{0}(p/q)\) on \(K(p/q)\) as long as the absolute value of the algebraic intersection number of \(\delta(\Phi_{0})\) with the \(p/q\) slope of \(K\) is at least \(2\). Since \(K(1/0)\cong S^{3}\) does not admit such a flow, \(\delta(\Phi_{0})\) must be of the form \(b\mu\) or \(b\mu+\lambda\) for some non-zero integer \(b\). Up to replacing \(K\) with its mirror image we can suppose that \(b\geq 1\). Here is a more precise version of Theorem 5.1(3) concerning hyperbolic knots. **Theorem 5.6**.: _Let \(K\) be a hyperbolic knot and \(\Phi_{0}\) a pseudo-Anosov flow on its exterior \(X(K)\) with non-longitudinal degeneracy locus, as described immediately above._ 1. _Suppose that_ \(\delta(\Phi_{0})=b\mu\) _for some integer_ \(b\geq 1\)_. If_ \(K(1/q)\) _or_ \(K(2/q)\) _is not_ \(LO\) _for some integer_ \(q\neq 0\)_, then_ \(b|q|=1\)_._ 2. _Suppose that_ \(\delta(\Phi_{0})=b\mu+\lambda\) _for some integer_ \(b\geq 1\)_. If_ \(K(1/q)\) _is not_ \(LO\) _for some integer_ \(q\neq 0\)_, then_ \(bq\in\{1,2\}\)_, and if_ \(K(2/q)\) _is not_ \(LO\) _for some odd integer_ \(q\)_, then_ \(bq\in\{1,2,3\}\)_._ Proof.: If \(p=1\) or \(2\), \(H_{1}(K(p/q))\) is a \(\mathbb{Z}/2\) vector space, and if \(|\delta(\Phi_{0})\cdot(p\mu+q\lambda)|\geq 2\) then \(K(p/q)\) admits a pseudo-Anosov flow. The reader will verify that if \(p=1\) or \(2\) then the inequality holds unless \(bq\) is as stated in (1) and (2). Corollary A.6 then shows that \(\pi_{1}(K(p/q))\) is left-orderable, which completes the proof. If \(K\) is a fibred hyperbolic knot, then up to replacing \(K\) by its mirror image the degeneracy locus of the suspension flow of its monodromy is either \(b\mu\) for \(b\geq 1\) or \(b\mu+\lambda\) for some integer \(b\geq 2\) ([20, Theorem 8.8]). Consequently, **Corollary 5.7**.: _Let \(K\) be a fibred hyperbolic knot. Then \(K(1/q)\) and \(K(2/q)\) are \(LO\) when \(|q|\geq 2\). _ In [8] it is shown that the degeneracy locus of any pseudo-Anosov flow on the exterior of a hyperbolic alternating knot is meridional. Consequently, **Corollary 5.8**.: _Let \(K\) be a hyperbolic alternating knot. Then \(K(1/q)\) and \(K(2/q)\) are \(LO\) when \(|q|\geq 2\)._ For general \(p/q\in\mathbb{Q}\), we can find a pseudo-Anosov flow \(\Phi(p/q)\) on \(K(p/q)\) as long as \(|\delta(\Phi)\cdot(p\mu+q\lambda)|\geq 2\) and consequently faithful representations \(\rho_{p/q}:\pi_{1}(K(p/q))\to\mathrm{Homeo}_{+}(S^{1})\) (cf. the Appendix). As in the Appendix, \(\pi_{1}(K(p/q))\) is left-orderable if the Euler class \(e(\rho_{p/q})\in H^{2}(K(p/q))\) vanishes. Equivalently, the Euler class of the normal bundle to the flow \(e(\nu_{\Phi(p/q)})\) vanishes (Proposition A.4). But this does not appear to happen very frequently. For instance, though the methods of [28] can be often be used to show that there are infinitely many values of \(p/q\) for which \(e(\rho_{p/q})=0\), that paper also shows that the set of such \(p/q\) is typically bounded and nowhere dense in the reals. ### Proof of Theorem 5.1 Proof of Theorem 5.1.: Case (1) follows from known results on left-orderable Dehn surgeries on torus knots as we stated in the beginning of SS5. Case (3) follows from Theorem 5.6. Suppose \(K\) is a satellite knot \(P(K_{0})\). Then \(K(p/q)=P(p/q)\cup_{T}X(K_{0})\) where \(T=\partial P(p/q)=\partial X(K_{0})\). Since \(|H_{1}(K(p/q))|=|p|\), if \(T\) is incompressible in \(P(p/q)\) then \(K(p/q)\) is \(LO\) by Theorem 5.3. So assume that \(T\) compresses in \(P(p/q)\). Then either (i) \(P=C_{m,n}\) and \(p/q\) is the cabling slope \(mn\), or (ii) \(P(p/q)\) is a solid torus. Possibility (i) gives case (2) of the theorem. So assume (ii) holds. Then either (a) \(P=C_{m,n}\) and \(\Delta(p/q,mn/1)=1\), or (b) \(P\) is a \(1\)-bridge braid and \(q=1\). It is easy to verify that the only solutions to (a) are \(p=\epsilon,q=1,m=2,n=\epsilon\), and \(p=2\epsilon,q=1,m=3,n=\epsilon\), for some \(\epsilon=\pm 1\). Thus in both cases (a) and (b), \(q=1\). Moreover, in case (a) \(w=w(P)=m\), and in case (b) \(w\geq 4\). We have \(K(p/q)=K(p)=K_{0}(p/w^{2})\). If \(K_{0}\) is a torus knot then \(K_{0}(p/w^{2})\) is \(LO\) since \(|p/w^{2}|<1\). The same conclusion holds if \(K_{0}\) is hyperbolic by Case (3). Finally, the same conclusion holds if \(K_{0}\) is a satellite knot by the argument above that any non-integral surgery \(p/q\) on a satellite knot with \(|p|=1\) or \(2\) is \(LO\). ## Appendix A The Euler class of Fenley's asymptotic circle The goal of this appendix is to calculate the Euler class of Fenley's asymptotic circle representation in terms of the topology of the associated pseudo-Anosov flow (Proposition A.4). The result is presumably known to experts, though we do not know a reference. Given a pseudo-Anosov flow \(\Phi\) on a closed, connected, orientable \(3\)-manifold \(W\), let \(\widetilde{\Phi}\) be the pull-back of \(\Phi\) to the universal cover \(\widetilde{W}\) of \(W\). **Theorem A.1**.: ([14, Proposition 4.2]) _The orbit space \(\mathcal{O}\) of \(\widetilde{\Phi}\) is homeomorphic to \(\mathbb{R}^{2}\). Moreover, the projection \(\pi:\widetilde{W}\to\mathcal{O}\) is a locally-trivial fibre bundle whose flow line fibres are homeomorphic to \(\mathbb{R}\)._ The action of \(\pi_{1}(W)\) on \(\widetilde{W}\) descends to one on \(\mathcal{O}\) by homeomorphisms. Since the flow lines in \(\widetilde{W}\) inherit a coherent \(\pi_{1}(W)\)-invariant orientation, the action of \(\pi_{1}(W)\) on \(\mathcal{O}\) is by orientation-preserving homeomorphisms, so we obtain a homomorphism \[\psi:\pi_{1}(W)\to\mathrm{Homeo}_{+}(\mathcal{O})\] Fenley has constructed an ideal boundary for \(\mathcal{O}\) over which this action extends. **Theorem A.2**.: ([13, Theorem A]) _There is a natural compactification \(\mathcal{D}=\mathcal{O}\cup\partial\mathcal{O}\) of \(\mathcal{O}\) where \(\mathcal{D}\) is homeomorphic to a disk with boundary circle \(\partial\mathcal{O}\). The action of \(\pi_{1}(W)\) on \(\mathcal{O}\) extends to one on \(\mathcal{D}\) by homeomorphisms. _ It follows from Fenley's construction that the action of \(\pi_{1}(W)\) on the ideal boundary \(\partial\mathcal{O}\) of \(\mathcal{O}\) is faithful. That is, the associated homomorphism \[\rho_{\Phi}:\pi_{1}(W)\to\mathrm{Homeo}_{+}(\partial\mathcal{O})\] is injective. We think of \(\rho_{\Phi}\) as taking values in \(\mathrm{Homeo}_{+}(S^{1})\). The action of \(\pi_{1}(W)\) on \(\mathcal{O}\) gives rise to a diagonal action on \(\widetilde{W}\times\mathcal{O}\) via \[\gamma\cdot(x,y)=(\gamma\cdot x,\psi(\gamma)(y)),\] which is equivariant with respect to the projection \(\widetilde{W}\times\mathcal{O}\to\widetilde{W}\). Taking quotients determines a locally-trivial \(\mathcal{O}\)-bundle \[W\times_{\psi}\mathcal{O}=\big{(}\widetilde{W}\times\mathcal{O}\big{)}/\pi_{1 }(W)\to W\] **Lemma A.3**.: _The \(\mathbb{R}^{2}\)-bundle \(W\times_{\psi}\mathcal{O}\to W\) is topologically equivalent to the normal bundle \(\nu(\Phi)\) of \(\Phi\)._ Proof.: We use \(E(\nu(\Phi))\) and \(E(\nu(\widetilde{\Phi}))\) to denote the total spaces of \(\nu(\Phi)\) and \(\nu(\widetilde{\Phi})\). Fix a Riemannian metric on \(W\) and pull it back to \(\widetilde{W}\). The associated exponential map \(\exp:T\widetilde{W}\to\widetilde{W}\) is \(\pi_{1}(W)\)-equivariant, as is the composition \[\omega:E(\nu(\widetilde{\Phi}))\xrightarrow{\exp}\widetilde{W}\xrightarrow{ \pi}\mathcal{O}\] Similarly if \(E_{\epsilon}(\nu(\widetilde{\Phi}))\) denotes the set of vectors of length less than \(\epsilon\) in \(E(\nu(\widetilde{\Phi}))\), then \(E_{\epsilon}(\nu(\widetilde{\Phi}))\) is \(\pi_{1}(W)\)-invariant and the restriction \[\omega_{\epsilon}:E_{\epsilon}(\nu(\widetilde{\Phi}))\xrightarrow{\omega|_{E_ {\epsilon}(\nu(\widetilde{\Phi}))}}\mathcal{O}\] is \(\pi_{1}(W)\)-equivariant. Since \(W\) is compact and \(\widetilde{\Phi}\) is invariant under the action of \(\pi_{1}(W)\), there is an \(\epsilon>0\) such that for each \(x\in\widetilde{W}\), \(\omega_{\epsilon}\) determines a homeomorphism between the open disk fibre of \(E_{\epsilon}(\nu(\widetilde{\Phi}))\) over \(x\) and its image in \(\mathcal{O}\). Fix a diffeomorphism \(\varphi:([0,\infty),0)\to([0,\epsilon),0)\) and consider the equivariant embedding \[E(\nu(\widetilde{\Phi}))\xrightarrow{(x,v)\mapsto(x,\varphi(\|v\|)v)}E_{ \epsilon}(\nu(\widetilde{\Phi}))\xrightarrow{(x,v)\mapsto(x,\omega_{\epsilon}( v))}\widetilde{W}\times\mathcal{O}\] which sends fibres into open subsets of fibres. Quotienting out by \(\pi_{1}(W)\) yields an embedding \[E(\nu(\Phi))\to W\times_{\psi}\mathcal{O}\] which also sends fibres into open subsets of fibres. Let \(E_{\nu}\) be the image of this embedding and \(W_{0}\subset E_{\nu}\subset W\times_{\psi}\mathcal{O}\) the image of the zero section of \(E(\nu(\Phi))\). Since \(W_{0}\to E_{\nu}\to W_{0}\) is a sub-\(\mathbb{R}^{2}\)-microbundle of the \(\mathbb{R}^{2}\)-microbundle \(W_{0}\to W\times_{\psi}\mathcal{O}\to W_{0}\), the main result of [31] implies that \(E_{\nu}\to W_{0}\) and \(W\times_{\psi}\mathcal{O}\to W_{0}\) are isomorphic \(\mathbb{R}^{2}\)-bundles, which completes the proof. **Proposition A.4**.: \(e(\rho_{\Phi})=e(\nu(\Phi))\)__ Proof.: The Euler class of \(\rho_{\Phi}\) coincides with that of the oriented circle bundle \[W\times_{\rho_{\Phi}}\partial\mathcal{O}=\big{(}\widetilde{W}\times\partial \mathcal{O}\big{)}/\pi_{1}(W)\to W\] ([37, Lemma 2]), while that of this circle bundle coincides with that of the associated \(2\)-disk bundle \(\big{(}\widetilde{W}\times\mathcal{D}\big{)}/\pi_{1}(W)\to W\) ([44, SS5.7]) and therefore to that of \(W\times_{\psi}\mathcal{O}\to W\). Lemma A.3 then completes the proof. **Corollary A.5**.: _If \(W\) is a closed, connected, orientable \(3\)-manifold which admits a pseudo-Anosov flow \(\Phi\) whose normal bundle has zero Euler class, then \(\pi_{1}(W)\) is left-orderable._ Proof.: Let \(\rho_{\Phi}:\pi_{1}(W)\to\mathrm{Homeo}_{+}(S^{1})\) be Fenley's universal circle representation and note that as \(e(\rho_{\Phi})=e(\nu(\Phi))=0\), \(\rho_{\Phi}\) lifts to a representation \(\widetilde{\rho}:\pi_{1}(W)\to\mathrm{Homeo}_{\mathbb{Z}}(\mathbb{R})\leq \mathrm{Homeo}_{+}(\mathbb{R})\). Since \(\rho_{\Phi}\) is faithful, so is \(\widetilde{\rho}\). Finally, as a closed manifold admitting a pseudo-Anosov flow, \(W\) is irreducible and therefore \(\pi_{1}(W)\) is left-orderable by [5, Theorem 1.1]. **Corollary A.6**.: _Let \(W\) be a rational homology \(3\)-sphere for which \(H_{1}(M)\) is a \(\mathbb{Z}/2\) vector space. If \(W\) admits a pseudo-Anosov flow \(\Phi\), then \(\pi_{1}(W)\) is left-orderable._ Proof.: By Corollary A.5, we know that \(\pi_{1}(W)\) will be left-orderable as long as \(e(\nu(\Phi))=0\). This is obvious if \(H_{2}(M)\cong H_{1}(W)\cong\{0\}\) and holds in general by the proof of Corollary 2.2 of [28].

2301.04354

First 3D reconstruction of a blast furnace using muography

The blast furnace (BF) is the fundamental tool used in the iron manufacture. Due to the difficulty of accessing direct measurements of the inner phenomena, we determined the density distribution of its internal volume in order to improve its productivity using muography. This is an imaging technique based on the differential absorption of a flux of incident particles, muons, by the target under study, similar to clinical X-ray imaging. Muons are elementary particles that have the property of passing through dense materials, up to hundreds of meters away. Their relative absorption and deviation allows the generation of density distribution images of an object by tracking the number of muons received by a detector, before and after passing through a structure. The incident direction of the detected muons is reconstructed by means of a detector composed of 3 scintillator panels that we moved on 3 positions around the BF. With this technique, we obtained the first 3D image of the internal structure of a BF using a Markov Chain Monte Carlo (MCMC) inverse problem solving algorithm on muon flux data. We were also able to perform a density monitoring of the BF and some of its operating parameters. We distinguished the position and shape of the cohesive zone, a key element in the productivity of a furnace, validating this innovative measurement concept in the application to a BF and opening the field to a series of future experiments to gain both spatial and temporal resolution.

Amélie Cohu, Antoine Chevalier, Oleksandr Nechyporuk, Andreas Franzen, Jan Sauerwald, Jean-Christophe Ianigro, Jacques Marteau

2023-01-11T08:32:35Z

http://arxiv.org/abs/2301.04354v2

# First 3D reconstruction of a blast furnace using muography ###### Abstract The blast furnace (BF) is the fundamental tool used in the iron manufacture. Due to the difficulty of accessing direct measurements of the inner phenomena, we determined the density distribution of its internal volume in order to improve its productivity using muography. This is an imaging technique based on the differential absorption of a flux of incident particles, muons, by the target under study, similar to clinical X-ray imaging. Muons are elementary particles that have the property of passing through dense materials, up to hundreds of meters away. Their relative absorption and deviation allows the generation of density distribution images of an object by tracking the number of muons received by a detector, before and after passing through a structure. The incident direction of the detected muons is reconstructed by means of a detector composed of 3 scintillator panels that we moved on 3 positions around the BF. With this technique, we obtained the first 3D image of the internal structure of a BF using a Markov Chain Monte Carlo (MCMC) inverse problem solving algorithm on muon flux data. We were also able to perform a density monitoring of the BF and some of its operating parameters. We distinguished the position and shape of the cohesive zone, a key element in the productivity of a furnace, validating this innovative measurement concept in the application to a BF and opening the field to a series of future experiments to gain both spatial and temporal resolution. Keywords:Particle tracking detectors, Scintillators and scintillating fibres and light guides, Computer Tomography (CT) and Computed Radiography (CR), Image processing. ## 1 Introduction We seek to determine the density distribution of matter inside a blast furnace in order to visualize the cohesive zone and to carry out a dynamic monitoring of the various phases present in the blast furnace. To achieve this, muography is applied to make a dynamic image during the operation of a blast furnace of ArcelorMittal in Bremen, Germany. Muography measures the absorption or deflection of cosmic muons as they pass through dense materials. Muons are elementary particles which have the property to pass, in a straight line at first order, up to several kilometers of standard rocks, and whose relative absorption allows to generate images by contrast densitometry, like a standard clinical radiography. The acquired muon data allows to follow the density as a function of time during the operating cycles of the blast furnace. In a second step, the acquisition of 2D images and then the 3D reconstruction is accomplished by the data inversion from several measurement points. The final objective is to understand the topological characteristics and the formation rate of the cohesive zone and the influence of certain loading parameters. The article is organized in four main parts. The first part explains the theorical points and algorithms used in tomography reconstructions. The second part presents the simulation parameters of a blast furnace and explains how we built the 3D image. We have completed our analysis by monitoring the activity of the blast furnace as function of different environmental parameters such as atmospheric pressure and temperature. The third part presents the results of real muons data inversion to visualize the different density zones in the blast furnace. Finally, we report the conclusions and perspectives of this study. Tomography reconstruction theory ### Generalities and issues Absorption muography measures the cosmic ray flux deficit in the direction of observation and determines the integrated density of a structure. Muons are cosmic rays able to cross several meters of rocks losing energy. The minimum amount of energy that muons must need to penetrate the structure must be of a value higher than the one lost inside the object, so that the detector can follow the outgoing muons. The detector position must then be adjusted to optimize the spatial resolution during field measurements. Muon tomography is limited to the study of a portion of the object only, because of the limited angular aperture of the detector. In order to take these different points into consideration, we use the inverse and direct problems jointly. The **direct problem** consists, in our case, in predicting the expected muon flux at the exit of an object. It is necessary to use materials knowledge and physical properties of the object's constituents and then to use a density distribution as precise as possible. The parameters sought during the inversion use the direct problem to estimate the expected measurements. The measured information is retrieved from a given distribution of \(p\) parameters in the studied structure. Moreover, the flux attenuation is estimated from a known law based on the contrasting distribution of zones (of different density for example). With the trackers the direction of the muons is reconstructed in order to observe the properties of the medium on a precise observation axis (see Lesparre et al.[13]). The flux that arrives on the detector after having crossed the object and the theoretical flux that would reach the detector in the absence of matter are compared. The contrast between thoses two quantities gives directly access to the **opacity** of the matter (in meter equivalent water (mwe)), defined as the integral of the density along the trajectory of the muon from its entry point to its exit point. Moreover, the only observable are the particles directions and energy deposits, since the detectors usually do not give direct information on the particles total energy. In order to solve the data inversion, the measured flux is coupled to a theoretical flux model and to a flux loss model in matter. ### Inverse problem The reconstruction of a muography image is achieved by solving an inverse problem. The goal is to recover the distribution of properties of the medium (**3D density**) from measurements of muon rates and their directions. An inverse problem is a situation in which one tries to determine the parameters of a model \(p\) (here the 3D density of the environnement) from experimental measurements \(m\) (muon rates) such that \(m=f(p)\) where \(f\) contains the open muon flux (calibration) and the law governing the absorption of muons in matter. While a single parameter estimate can be easily obtained by least squares fitting, the use of Monte Carlo methods allows the maintenance of the stochasticity of the model during the estimation of these parameters. In order to improve the reliability of the results, it is good practice to add some informations about the objet to study, other than data, that we call \(a\)_priori_ information [1]. They allow to constrain the solutions space and improve the accuracy of the statistical answer. We use the Metropolis-Hastings algorithm which is a particular class of Monte Carlo methods using Markov chains. It works like a geometrically biased random walk with a data based selection at each throw [8]. Each new proposal/model can be accepted or rejected if the likelihood of the model (regarding the data and the physics of the problem) is greater or smaller than the likelihood of the previous model. Hence, unlike more general Monte Carlo methods where the sampled values are statistically independent, in the Metropolis-Hastings algorithm they are statistically auto-correlated. This auto-correlation is minimized by adding a threshold number of changes that must be accepted between the recording of two consecutive samples. We need models whose density values are continuous over finite element discretized volumes. Here a model stands for any given set of values representing a physical system. The engine that generates the 3D density models, linked by Markov chain, is made to design density sets per class forming spatially contiguous voxel sets which share the same density. The inversion algorithm is a 3D adaptation of Mosegaard et al.[11] work, where details can be found in Chevalier et al.[7]. The method makes selections of the models according to the evolution of the distance \(D\) : \[D=\frac{F_{t}-F_{m}}{\sigma_{m}} \tag{1}\] with \(F_{t}\) the theoretical flux and \(F_{m}\) the measured flux. \(D\) is a metric of the distance between the data and the simulation, expanded or compressed by the degree of uncertainty on the measurement \(\sigma_{m}\). This distance \(D\) is recalculated each time the density changes. A new model is accepted as a solution if the mean difference between the reconstructed signal and the data (evaluated by the mean square deviation) is lower than the mean noise estimated during the measurement. If the model is selected, we save its likelihood. This model is then slightly perturbed again by changing some voxel density values and we recalculate the new likelihood. The total likelihood of a model, \(L(m)\), can be expressed as a product of partial likelihoods, one for each data type. Our inversion algorithm is able to couple information from several detectors at the same time. Indeed, each detector measures a flux and _travel length_ (defined as the thickness of material seen by the detector in its acquisition configuration) per viewing axis. By taking a set of density distributed in the voxels, we have the opacity seen by the viewing axis. Finally, the number of registered models can be modified and it depends on the requirements in terms of accuracy and available computing time. ## 3 Application to a blast furnace ### Acquisition configurations In order to obtain a 3D image of the blast furnace, we carried out three muography acquisitions around the blast furnace, performed between the end of July 2021 and the end of March 2022 with the 3 planes detector (specifications of the runs are described in table 1). In this way we intersect a maximum volume of it, common to the fields of view of the three detectors. On figure 1, the detector virtual lines of sigh at each position are shown. They allow visualization of the field of view of each location and the common areas that are observed. ### External and internal parameters effects on muon flux By counting the muons rate, in a given direction as a function of time for each of the positions shown on figure 1, we observe temporal variations. The rate of high-energy cosmic ray muons as measured underground is shown to be strongly correlated with upper-air temperatures during t short-term atmospheric phenomena [2, 3]and with pressure [5]. We have evaluated the effects of atmospheric parameters and those of the target operation (coke rate estimate at the cohesive zone and the value of the blast pressure, defined above). Our goal is to substract these different effects from the measured rate, before realizing the data inversion, to obtain a density distribution 3D image in the blast furnace. We chose to compute the pressure/flux correlations for each position separately because the detectors are not sensitive to the same opacity from one location to another. By performing a linear fit between the flux and ambient pressure data, we obtain the barometric coefficients \(\beta_{p}\) (hPa\({}^{-1}\)), such as \(\dfrac{(\phi-\phi_{0})}{/}\phi_{0}=\beta_{p}\times(P-P_{0})\) (see Jourde et al.[5]), their error as well as the correlation coefficient of the fit in the table 2. The correlation values between pressure and flux vary with time according to the table 2 and the sensitivity of the muon flux to the pressure variation appears more important in high pressure episodes. Moreover, the muon fluxes do not seem to be sensitive to the temperature variations of the upper atmosphere over the studied periods and they are thus more affected by the pressure variations. This result is consistent with the opacity values encountered, at most 50 mwe (lower than those of Tramontini et al. [2] \(\sim\) 700 mwe and close to Acernese [4] open sky experiment) which do not allow to filter out the low energy muons. Indeed, only the most energetic muons are sensitive to temperature variations. \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|} \hline **Run** & **Ze (\({}^{\circ}\))** & **Az (\({}^{\circ}\))** & **X (m)** & **Y (m)** & **Z (m)** & **Dates** \\ \hline **1** & 45 & 51 & -7.51 & -7.04 & 11.35 & 07/29/21 - 20/09/21 \\ \hline **2** & 60 & 144.33 & -13.49 & 9.52 & 14.55 & 10/08/21- 10/21/21 \\ & & & & & & \& 12/21/21 - 01/24/22 \\ \hline **3** & 60 & 270 & 15.14 & 0.24 & 14.55 & 02/03/22 - 03/31/22 \\ \hline \end{tabular} \end{table} Table 1: Specifications of the 3 runs shown in figure 1(Ze=zenith, Az=azimuth angles). Figure 1: Detector virtual lines of sight at each position with different colors : position/run 1 (_in red_), position 2 (_in blue_), position 3 (_in green_). A blast furnace is considered to be in operation when air is injected into it, measured by the value of the so-called blast pressure. At standstill, the density in the blast furnace is greater and the interior "column" is tighter. In addition, as the blast pressure increases, fine particles of sinter take the place of gas and the density in the BF increases. Furthermore, a high coke fraction in the cohesive zone means that the associated density is lower than usual. Several parameters can therefore affect the muon flux by changing the density inside: the fraction of fine particles, the blast furnace stop and the addition of coke. We performed multivariate linear fits (with external and internal parameters) on the relative muon flux and evaluated the adequacy of our fits with the Pearson linear coefficient of determination. The pressure appears to be the dominant parameter. Moreover, in October 2021, during the high pressure period, the coke rate in the cohesive zone seems to be well correlated with the pressure corrected muon flux. We found \(\gamma_{CR}\)**=-0.013** (\(\pm\)1%) with a correlation coefficient of 0.76. This means that when the coke rate is high, the blast furnace is stopped and the material goes down, as well as the cohesive zone, so the density in the blast furnace increases and the measured muon flux behind it decreases. After solving the direct problem we reconstruct the 3D-average-density model of the blast furnace by using the measured flux (corrected from parameters that affect it). Markov chain Monte Carlo method discribed in subsection 2.2 is used. ## 4 Results The results presented in this section were obtained using real data measured by the detector for three runs. ### 2D fields On the figure 2 the opacities (left panels) and densities (right panels) seen by the detector at each of its 3 positions are represented in 2D, before inversion. We can see a slightly denser area (in yellow) in the middle of the figures. This zone would seem to be a 2D projection of the cohesive zone. The shells of the blast furnace are clearly visible on density representations. The position 2 density figure shows a denser area in the center left. As expected, no muons are recorded below 75-90\({}^{\circ}\) in the data. Finally, the contained informations of these figures are aggregated and inverted to reconstruct the 3D blast furnace and the density distribution inside. \begin{table} \begin{tabular}{|c|c|c|c|} \hline **Run** & \(\beta_{p}\) (\(\mathrm{{\rm hPa}^{-1}}\)) & **Error (RMS)** & **Correlation coefficient** \\ \hline **1** & -0.0011 & 1.3\% & 0.77 \\ \hline **2** & - 0.0015 & 0.9\% & 0.80 \\ \hline **3** & - 0.0018 & 1\% & 0.47 \\ \hline \end{tabular} \end{table} Table 2: Barotnic coefficients of the different acquisitions around the blast furnace. Figure 2: _On the left_, the **opacity** (in mwe) and _on the right_, the **density** (in g cm\({}^{-3}\)) **apparent** for each of the 3 positions are represented. The axes are the azimuth and zenith in \({}^{\circ}\). ### 3D-inversion results The 3 muon runs were performed at different periods. Therefore, the 3D reconstruction of the density distribution of the blast furnace gives us an average of what we can find and not a snapshot of the different zones and their thickness. In figure 3, the distribution of the mean density (at the top) and its standard deviation (at the bottom) are shown. Real data have been inverted by considering the CORSIKA [12] theoretical muon flux model as built in Cohu et al. [6] for the calculation of flux loss. * The shell of the blast furnace is clearly visible. It is very dense : more than 3 g/cm\({}^{3}\). The _travel length_ from the detector in position 2 arrive perpendicular to the shell, so we have directly the value of the density without having to evaluate an integrated density over the whole width of the blast furnace. * A brighter area is noticeable on the shell (bottom left of the average density figures). This is probably an area where the three positions provide different information on the integrated density. Perhaps one of the detectors cannot bring measurements from this area, the value of the associated standard deviations is also high. * We distinguish, at a height of 15-20 m inside the BF, a sparse zone (\(<\)0.5 g/cm\({}^{3}\)) that would contain mainly coke/coal. * From this last zone would leave a slightly denser zone in the shape of a _chimney_. This phenomenon appears when a lot of coal is pulverized in the center and little agglomerate. This is the case in the blast furnace that we have studied. * The cohesive zone is visible at 20-25 m height, with a density higher than 1.5 g/cm\({}^{3}\). It is close to the shell. * The superposition of materials in the dry zone is not visible. In this zone, all materials charged from the top of the furnace are in the solid state. The iron charge and the coke are descending and maintain a layered structure. There is a superposition of coke and sinter sublayers with a density of 0.7 g/cm\({}^{3}\) and 2 g/cm\({}^{3}\) respectively. However one can see some " lines" especially at the top of the image, they are the "_travel length_" due to the acceptance effects of the detector. The results of the 3D inversion obtained here are very satisfactory and the cohesive zone could be highlighted. The algorithm and the inversion method have been successfully tested on the internal structure of the BF. We will test the robustness of the inversion in the next subsection. ### Analysis of various sensitivities We studied, first, the differences observed on our 3D reconstructions as a function of the muon flux model. We compare Tang et al. [10] and CORSIKA to calculate the muon flux loss. Tang is an analytical model commonly used and the CORSIKA flux allows to adapt to the environmental conditions and to the location of an experiment [6]. We analyzed the performances and uncertainties of the reconstruction engine : what are the differences caused by the randomness of the inversion? Then we looked at the consequences of the number of models registered in the MCMC algorithm and the randomness of the algorithm itself. We also tested what is implied by a different density model in the input (different density at the cohesive zone). In all cases, the areas with the largest density differences are located at the bottom of the blast furnace : where a few data is collected which is obviously a source of noise. Figure 3: Results of real data inversion using a theoretical flux modeled with CORSIKA in Bremen for the calculation of flux loss. The axes (\(XYZ\)) are in meters and the density in \(\mathrm{g\,cm^{-3}}\). - _at the top_ : distribution of the **average density** in the blast furnace, - _at the bottom_ : distribution of the **standard deviation of the density** in the blast furnace. Conclusion We performed a muography experiment on a blast furnace of ArcelorMittal and obtained the first 3D image of it. We hoped to be able to clearly distinguish the location of the cohesive zone, which turns out to be the key of the furnace's productivity. The 3D reconstruction of the density distribution was a great success. We used an inversion program on our measured muon data using Markov chain Monte Carlo (MCMC). This algorithm is stable (few variations between 2 identical models) and rather fast even with a large number of recorded models. The results of the 3D inversion with the use of CORSIKA or Tang [10] models of theorical flux show that the opacity estimates are strongly influenced in the regions of zenith angle between 70 and 90\({}^{\circ}\) and especially for the areas of low opacity. As a reminder, the theoretical flux of CORSIKA is also dependent on atmospheric conditions and must be adapted to the season when the acquisitions were made. An uncertainty of 10% on the flux leads to an error of 4% on the opacity. The 3D images obtained are only an average of the density distribution but are quite realistic and validated by the operators of the blast furnaces studied. The density contrasts are obvious, especially for the shell and the cohesive zone which are clearly distinguishable. We could monitor the activity inside the BF. Indeed, we have evaluated the effect of the atmospheric pressure variation on the measured muon flux and we are able to correct it for this impact. The measured and corrected flux seems to be sensitive to the coke rate variations in the cohesive zone too. All these elements related to the composition or the shape of the cohesive zone may allow the blast furnace operators to adapt their material loading according to the state of this zone. Further improvements to the method are under study. This work was the subject of a CIFRE agreement between the ArcelorMittal Maizieres Research SA and IP2I (Lyon).

2302.13378

Puppeteer and Marionette: Learning Anticipatory Quadrupedal Locomotion Based on Interactions of a Central Pattern Generator and Supraspinal Drive

Quadruped animal locomotion emerges from the interactions between the spinal central pattern generator (CPG), sensory feedback, and supraspinal drive signals from the brain. Computational models of CPGs have been widely used for investigating the spinal cord contribution to animal locomotion control in computational neuroscience and in bio-inspired robotics. However, the contribution of supraspinal drive to anticipatory behavior, i.e. motor behavior that involves planning ahead of time (e.g. of footstep placements), is not yet properly understood. In particular, it is not clear whether the brain modulates CPG activity and/or directly modulates muscle activity (hence bypassing the CPG) for accurate foot placements. In this paper, we investigate the interaction of supraspinal drive and a CPG in an anticipatory locomotion scenario that involves stepping over gaps. By employing deep reinforcement learning (DRL), we train a neural network policy that replicates the supraspinal drive behavior. This policy can either modulate the CPG dynamics, or directly change actuation signals to bypass the CPG dynamics. Our results indicate that the direct supraspinal contribution to the actuation signal is a key component for a high gap crossing success rate. However, the CPG dynamics in the spinal cord are beneficial for gait smoothness and energy efficiency. Moreover, our investigation shows that sensing the front feet distances to the gap is the most important and sufficient sensory information for learning gap crossing. Our results support the biological hypothesis that cats and horses mainly control the front legs for obstacle avoidance, and that hind limbs follow an internal memory based on the front limbs' information. Our method enables the quadruped robot to cross gaps of up to 20 cm (50% of body-length) without any explicit dynamics modeling or Model Predictive Control (MPC).

Milad Shafiee, Guillaume Bellegarda, Auke Ijspeert

2023-02-26T18:32:44Z

http://arxiv.org/abs/2302.13378v1

# _Puppeteer and Marionette:_ Learning Anticipatory Quadrupedal Locomotion ###### Abstract Quadruped animal locomotion emerges from the interactions between the spinal central pattern generator (CPG), sensory feedback, and supraspinal drive signals from the brain. Computational models of CPGs have been widely used for investigating the spinal cord contribution to animal locomotion control in computational neuroscience and in bio-inspired robotics. However, the contribution of supraspinal drive to anticipatory behavior, i.e. motor behavior that involves planning ahead of time (e.g. of footstep placements), is not yet properly understood. In particular, it is not clear whether the brain modulates CPG activity and/or directly modulates muscle activity (hence bypassing the CPG) for accurate foot placements. In this paper, we investigate the interaction of supraspinal drive and a CPG in an anticipatory locomotion scenario that involves stepping over gaps. By employing deep reinforcement learning (DRL), we train a neural network policy that replicates the supraspinal drive behavior. This policy can either modulate the CPG dynamics, or directly change actuation signals to bypass the CPG dynamics. Our results indicate that the direct supraspinal contribution to the actuation signal is a key component for a high gap crossing success rate. However, the CPG dynamics in the spinal cord are beneficial for gait smoothness and energy efficiency. Moreover, our investigation shows that sensing the front feet distances to the gap is the most important and sufficient sensory information for learning gap crossing. Our results support the biological hypothesis that cats and horses mainly control the front legs for obstacle avoidance, and that hind limbs follow an internal memory based on the front limbs' information. Our method enables the quadrupped robot to cross gaps of up to 20 cm (50\(\%\) of body-length) without any explicit dynamics modeling or Model Predictive Control (MPC). ## I Introduction and Related Work Quadruped animals can perform highly agile motions including running, jumping over hurdles, and leaping over gaps. Performing such anticipatory motor behaviors at high speeds requires complex interactions between the supraspinal drive, spinal cord dynamics, and sensory feedback [1]. Through recent advances in machine learning and optimal control, animals' legged robot counterparts are becoming increasingly capable of traversing complex terrains [2]. Robots can also be used as scientific tools to investigate biological hypotheses of animal adaptive behavior [3], and conversely we can take inspiration from the underlying mechanisms of animal locomotion to develop robotic systems that approach the agility of animals [4, 5]. In this paper, by leveraging recent robotics tools, we investigate the interaction between the supraspinal drive, the central pattern generator (CPG), and sensory information to generate anticipatory locomotion control for a gap crossing task. We propose a hierarchical biologically-inspired framework, where higher control centers in the brain (represented by an artificial neural network) send supraspinal drive signals to either modulate the CPG dynamics, or directly output actuation signals which bypass the CPG dynamics. ### _Central Pattern Generators_ It is widely accepted that the mammalian spinal cord contains a central pattern generator (CPG) that can produce basic locomotor rhythm in the absence of input from supraspinal drive and peripheral sensory feedback [6]. In robotics, abstract models of CPGs are commonly used for locomotion pattern generation [7, 8, 4, 9], as well as to investigate biological hypotheses [10, 11]. Besides the intrinsic oscillatory behavior of CPGs, several other properties such as robustness and implementation simplicity make CPGs desirable for locomotion control [12]. For legged robots, the Fig. 1: **A**: Crossing a \(15\) cm gap with Unitree Go1. **B**: We represent the motor control system as a Puppeteer and Marionette, where the supraspinal higher control centers work as a Puppeeter to manipulate the movement of the body (Marionette) with limited strings. The supraspinal drive controls movement by either modulating the frequency and amplitude of the CPG oscillators, or directly sending actuation signals to bypass the CPG dynamics. **C**: Testing policy robustness by crossing variable gaps between 14 and 20 cm with an unknown 5 kg load. Videos: [https://miladshafiee.github.io/puppeeter-and-marionette/](https://miladshafiee.github.io/puppeeter-and-marionette/) CPG is usually designed for feedforward rhythm generation, and dynamic balancing is achieved with optimization [4] or hand-tuned feedback [7, 13]. CPGs also provide an intuitive formulation for specifying different gaits [14], and spontaneous gait transitions can arise by increasing descending drive signals and incorporating contact force feedback [15, 16] or vestibular feedback [17]. In addition to proprioceptive feedback, incorporating exteroceptive feedback information allows for CPG-based locomotion over uneven terrains [18, 19] and navigation in complex environments [20, 21]. Most of these studies consider the CPG to be isolated from higher control centers located in the brain. However, the interaction between supraspinal drive and the Central Pattern Generator during learning and planning leads to fascinating anticipatory locomotion in animals (i.e. motor behavior that involves planning ahead of time). In this article, we investigate the roles of supraspinal drive and the CPG in learning such anticipatory behaviors. ### _Learning Legged Locomotion_ Deep Reinforcement Learning (DRL) has emerged as a powerful approach for training robust legged locomotion control policies in simulation, and deploying these sim-to-real on hardware [22, 23, 24, 25, 26, 27, 28, 29, 30, 31]. To facilitate this sim-to-real transfer, a variety of techniques can be employed such as online parameter adaptation [26, 27], learned state estimation modules [28], teacher-student training [22, 24, 27], and careful Markov Decision Process choices [30, 31, 32, 33]. Most of these works view the trained artificial neural network (ANN) as a "brain" which has full access to complete whole-body proprioceptive sensing, which it queries at a high rate to update motor commands. Therefore, different gaits emerge through the combination of reward function tuning (i.e. minimizing energy consumption [34]), incorporating phase biases [35, 36], or imitating animal reference data to replicate bio-inspired movements [26, 37]. However, here and in CPG-RL [31], we represent the ANN as a higher level control center which sends descending drive signals to modulate the central pattern generator in the spinal cord, and map this rhythm generation network to a pattern formation layer. Moreover, here we study the interplay between the ANN modulating the CPG directly, or bypassing the CPG to directly control lower level circuits. Beyond "blind" terrain locomotion, recent works incorporate exteroceptive sensing in the learning loop, for example for obstacle avoidance [38] or walking over rough terrain by employing height maps [2, 39]. Gap crossing has been demonstrated by employing MPC and dynamic models for motion planning during learning [40, 41, 42, 43]. For difficult simulation tasks, curriculum learning is helpful for surmounting increasingly challenging terrain [44], and jumping over large hurdles has been demonstrated by employing a mentor during the learning process [45]. ### _Contribution_ Despite advances in understanding motor control of mammalian locomotion [1], little is known about the emergence of anticipatory locomotion skills through the interaction of supraspinal drive and CPGs. In this work, we investigate two broad neuroscience research questions: * What are the plausible contributions of supraspinal drive and CPG circuits in the spinal cord for producing anticipatory locomotion skills? * What are the necessary sensory feedback features for learning anticipatory locomotion skills? Although these research questions are broad, we view this work as a starting point for leveraging robotics techniques and biological inspiration to investigate the interaction of supraspinal drive (from the brain) with the CPG. We employ CPG models and a neural network (NN) policy trained with deep reinforcement learning to investigate this interaction for a gap-crossing task. For the first question, our results indicate that the direct supraspinal contribution to the actuation signal is a key component for a high success rate. However, the CPG dynamics in the spinal cord are beneficial for gait smoothness and energy efficiency. Regarding the second question, our investigation shows that the front foot distance to the gap is the most important visually-extracted sensory information to successfully cross variable gaps. Our results show that front limb information is sufficient for learning gap-crossing, and that DRL can learn to create and encode an internal kinematic model by combining proprioceptive information with the internal CPG states to modulate the hind leg motion for gap crossing. This supports the biological hypothesis that cats and horses control their front legs for obstacle avoidance, and that hind legs follow an internal memory based on front foot information [46, 47]. Furthermore, in contrast to previous robotics works, to the best of our knowledge, this is the first learning-based framework with gap-crossing abilities which does not have a dynamical model, MPC, curriculum, or mentor in the loop. This illustrates the versatility of the proposed framework, which requires minimum expert knowledge (i.e. no model of the system dynamics or more traditional optimal control). The rest of this paper is organized as follows. Section II describes the CPG topology. Section III details the DRL framework and design of the Markov Decision Process. Section IV presents results and analysis regarding the two mentioned research questions, and a brief conclusion is given in Section V. ## II Central Pattern Generators The locomotor system of vertebrates is organized such that the spinal CPGs are responsible for producing basic rhythmic patterns, while higher-level centers (i.e. the motor cortex, cerebellum, and basal ganglia) are responsible for modulating the resulting patterns according to environmental conditions [1]. Rybak et al. [48] propose that biological CPGs have a two-level functional organization, with a half-center rhythm generator (RG) that determines movement frequency, and pattern formation (PF) circuits that determine the exact shapes of muscle activation signals. Similar organizations have also been used in robotics, for example in our previous work [31], and in [49]. ### _Rhythm Generator (RG) Layer_ We employ amplitude-controlled phase oscillators to model the RG layer of the CPG circuits in the spinal cord. Such oscillators have been successfully used for locomotion control of legged robots [4, 10, 31] with the following dynamics: \[\ddot{r}_{i} = \alpha\bigg{(}\frac{\alpha}{4}(\mu_{i}\!-\!r_{i})-\dot{r}_{i}\bigg{)} \tag{1}\] \[\dot{\theta}_{i} = \omega_{i}\!+\!\sum_{j}\!r_{j}w_{ij}\!\sin(\theta_{j}\!-\!\theta _{i}\!-\!\phi_{ij}) \tag{2}\] where \(r_{i}\) is the amplitude of the oscillator, \(\theta_{i}\) is the phase of the oscillator, \(\mu_{i}\) and \(\omega_{i}\) are the intrinsic amplitude and frequency, \(\alpha\) is a positive constant representing the convergence factor. Couplings between oscillators are defined by the weights \(w_{ij}\) and phase biases \(\phi_{ij}\). In this paper, we use the oscillators without neural coupling (\(w_{ij}\!=\!0\)), and gaits (i.e. phase relationships between limbs) are thus determined by the supraspinal control policy. As in [31], we will investigate the modulation of the intrinsic amplitude and frequency (\(\mu_{i}\) and \(\omega_{i}\)) for each limb as control signals for the CPG. ### _Pattern Formation (PF) Layer_ To map from the RG layer to joint commands, we first compute corresponding desired foot positions, and then calculate the desired joint positions with inverse kinematics. The desired foot position coordinates are formed as follows: \[x_{i,\text{foot}} = x_{off,i}\!-\!L_{step}(r_{i})\!\cos(\theta_{i}) \tag{3}\] \[z_{i,\text{foot}} = \begin{cases}z_{off,i}\!-\!h\!+\!L_{drne}\!\sin(\theta_{i})& \text{if }\sin(\theta_{i})\!>\!0\\ z_{off,i}\!-\!h\!+\!L_{pntr}\!\sin(\theta_{i})&\text{otherwise}\end{cases} \tag{4}\] where \(L_{step}\) is the step length, \(h\) is the nominal leg length, \(L_{clrnc}\) is the max ground clearance during swing, \(L_{pntr}\) is the max ground penetration during stance, and \(x_{off}\) and \(z_{off}\) are set-points that change the equilibrium point of oscillation in the \(x\) and \(z\) directions. Modulating the foot horizontal offset \(x_{off}\) and vertical offset \(z_{off}\) represents direct supraspinal control of the general position of the limb, bypassing the rhythm generation layer. A description and visualization of the foot trajectory is illustrated in Figure 2. ## III Hierarchical Bio-Inspired Learning of Anticipatory Gap Crossing Tasks In this section we describe our hierarchical bio-inspired learning framework for learning anticipatory gap crossing abilities for quadruped robots. We represent the supraspinal controller as an artificial neural network which is trained with DRL to modulate both the feet positions (CPG offsets) and/or the intrinsic frequencies and amplitudes of oscillation for each limb to produce anticipatory behavior. The problem is represented as a Markov Decision Process (MDP), and we describe each of its components below. ### _Action Space_ We consider one RG layer for each limb based on Equations (1) and (2), where the RG output will be used in a PF layer to generate the spatio-temporal foot trajectories in Cartesian space (Equations (3) and (4)). We do not consider any explicit neural coupling (i.e. \(w_{ij}\!=\!0\)), with the intuition that inter-limb coordination will be managed by the supraspinal drive. As in [31], our action space modulates the intrinsic amplitudes and frequencies of the CPG, by continuously updating \(\mu_{i}\) and \(\omega_{i}\) for each leg. However, unlike [31], we also consider modulating the oscillation set-points by directly learning foot Cartesian offsets \(x_{offi},\,z_{offi}\) for each leg. Thus, our action space can be summarized as \(\mathbf{a}=[\boldsymbol{\mu},\boldsymbol{\omega},\boldsymbol{x_{off}},\boldsymbol {z_{off}}]\!\in\!\mathbb{R}^{16}\). We divide the descending drive modulation into two categories: oscillatory components of the CPG dynamics \(\mathbf{a}_{osc}=[\boldsymbol{\mu},\boldsymbol{\omega}]\!\in\!\mathbb{R}^{8}\), and offset components \(\mathbf{a}_{off}\!=\![\boldsymbol{x_{off}},\boldsymbol{x_{off}}]\!\in\!\mathbb{R }^{8}\), shown in Equations (1)-(4). This separation allows us to investigate how gap crossing can best be accomplished, i.e. by modulating CPG activity (by changing \(\mu_{i}\) and \(\omega_{i}\)) and/or by directly updating the limb posture (by changing \(x_{offi}\) or \(z_{offi}\)). Based on this investigation, we use \(\mathbf{a}\!=\![\boldsymbol{\mu},\boldsymbol{\omega},\boldsymbol{x_{off}}]\! \in\!\mathbb{R}^{12}\) for analyzing the roles of sensory feedback features in Section IV-B. The agent selects these parameters at 100 Hz, which will therefore vary during each step according to sensory inputs. We use the following limits for each input during training: \(\mu\!\in\![0.5,\!4]\), \(\omega\!\in\![0,\!5]\) Hz, \(x_{offi}\!\in\![-7,\!7]cm\), \(z_{offi}\!\in\![-7,\!7]cm\). ### _Observation Space_ We consider two different observation space types based on (1) only proprioceptive sensing (enough for locomotion on flat terrain) and (2) also including exteroceptive anticipatory features. Various exteroceptive anticipatory features will be investigated to understand the roles and importance of different sensory quantities. **Flat terrain observation:** We consider body orientation, body linear and angular velocity, joint positions and velocities, foot contact booleans, the previous action chosen by the policy network, and CPG states \(\{\boldsymbol{r},\boldsymbol{\dot{r}},\boldsymbol{\theta},\boldsymbol{\dot{ \theta}}\}\) as the flat terrain (proprioceptive sensing) observation space. **Exteroceptive Feedback Features:** We assume that the visual system and brain can extract important geometrical information such as foot distance to a gap, and we call such information _exteroceptive feedback features_. We are Fig. 2: Visualization of the task space foot trajectories generated by the PF layer. The oscillatory trajectory is built around a central point \(O\). The offsets \(x_{off}\) and \(z_{off}\) are used to change the central point of oscillation. \(x_{off}\) is a horizontal offset between the oscillation set-point and the center of the hip coordinate, and controlled directly by the supraspinal drive, bypassing the CPG dynamics. \(z_{off}+h\) is the vertical distance between the oscillation set-point, \(O\), and the center of the hip coordinate. \(L_{step}r\) is the step length multiplied by the oscillator amplitude, \(h\) is the nominal leg length, \(L_{drne}\) is the max ground clearance during leg swing phase, and \(L_{pntr}\) is the max ground penetration during stance. interested in investigating which exteroceptive feedback features are most useful for the emergence of anticipatory locomotion skills. To reverse engineer this process, we divide the exteroceptive feedback features into two categories: _predictive_ and _instantaneous_ feedback features. _Predictive_ features consist of foot distance and/or base distance to the beginning and end of a gap. _Instantaneous_ feedback features consist of boolean indicators of stepping into a gap (foot contact/penetration into the gap), as well as vertical distance of the foot with the ground (larger values over a gap). These features are instantaneous feedback, so they cannot be used to predict information about upcoming gaps. ### _Reward Function_ Our reward function promotes forward progress, gap crossing ability, maintaining base stability, and energy efficiency with the following terms: \[r = \alpha_{1}\cdot\min(f_{x},d_{max})+(S_{gap}+n_{gap})+\alpha_{3} \cdot|y_{base}|\] \[+\alpha_{4}\cdot\|\mathbf{\omega}_{base}-\mathbf{\omega}_{zero}\|+\alpha_ {5}\cdot|\mathbf{\tau}\cdot(\dot{\mathbf{q}}_{t}-\dot{\mathbf{q}}_{t-1})|\] * _Forward progress_: In the first term, \(f_{x}\) corresponds to forward progress in the world (along the \(x\)-direction). We limit this term to avoid exploiting simulator dynamics and achieving unrealistic speeds, where \(d_{max}\) is the maximum distance the robot will be rewarded for moving forward during each control cycle (\(\alpha_{1}\!=\!2\)). * _Gap reward_: The agent receives a sparse reward (\(S_{gap}\!=\!3\)) if it crosses a gap, and a negative reward of \(n_{gap}\!=\!-0.03\) for each control cycle during which a foot penetrates below ground level into a gap. * _Base \(y\) direction penalty_: The third term penalizes lateral deviation of the body (\(\alpha_{3}\!=\!-0.05\)). * _Base orientation penalty_: The fourth term penalizes non-zero body orientation (\(\alpha_{4}\!=\!-0.02\)). * _Power_: The fifth term penalizes power in order to find energy efficient gaits, where \(\mathbf{\tau}\) and \(\dot{\mathbf{q}}\) are joint torques and velocities (\(\alpha_{5}\!=\!-0.0008\)). ### _Training details_ We use PyBullet [50] as our physics engine for training and simulation purposes, and the Unitree A1 and Go1 quadruped robots [51]. To train the policies, we use Proximal Policy Optimization (PPO) [52], and Table I lists the PPO hyperparameters and neural network architecture. The control frequency of the policy is 100 Hz, and the torques computed from the desired joint positions are updated at 1 kHz. The equations for each of the oscillators (Equations 1 and 2) are thus also integrated at 1 kHz. The joint PD controller gains are \(K_{p}\!=\!100\) and \(K_{d}\!=\!2\). All policies are trained for \(3.5\!\times\!10^{7}\) samples. ## IV Results In this section, we present results of our proposed framework for quadruped gap crossing scenarios. In Section IV-A, we investigate the role of the supraspinal drive and CPG based on three criteria: success rate, energy efficiency, and gait smoothness. Furthermore, we investigate the effects of including varying exteroceptive sensory features on these criteria in Section IV-B. Section IV-C presents results for a more challenging task of crossing successive narrowly-spaced gaps, and Section IV-D discusses sim-to-real hardware results. The reader is encouraged to watch the supplementary video for clear visualizations of all discussed experiments. ### _Contribution of CPG and Supraspinal Drive to Actuation_ In this section we train locomotion policies for the following scenarios and action spaces: 1. Flat terrain. CPG only in \(xz\) directions. 2. Gap terrain. CPG only in \(xz\) directions. \begin{table} \begin{tabular}{c c|c c} Parameter & Value & Parameter & Value \\ \hline Batch size & 4096 & SGD Iterations & 10 \\ SGD Mini-bach size & 128 & Discount factor & 0.99 \\ Desired KL-divergence \(kl^{\star}\) & 0.01 & Learning rate \(\alpha\) & 0.0001 \\ GAE discount factor & 0.95 & Hidden Layers & 2 \\ Clipping Threshold & 0.2 & Nodes & [256,256] \\ Entropy coefficient & 0.01 & Activation & tanh \\ \end{tabular} \end{table} TABLE I: PPO Hyperparameters and neural network architecture. Fig. 3: Quantitative results from testing 16 policies trained with different combinations of exteroceptive feedback features consisting of feet distance to the gap, base distance to the gap, feet vertical distance with the ground, and contact/penetration with the gap. All policies also include the flat terrain (proprioceptive sensing) observation, and the action space consists of both oscillatory and offset terms. We report the average results of testing the polices for 4000 samples each (100 attempts of crossing 7 gaps with randomized lengths between \([14,20]\)\(cm\)). We characterize the viability performance of the system by the success rate, which is the proportion of the gaps in front of the robot that it could successfully cross. Energy efficiency is characterized by the Cost of Transport (CoT), mean velocity is characterized by the Froude number, and gait smoothness is evaluated by the mean angular velocity. 3. Gap terrain. CPG in \(z\) direction and offset in \(x\) direction. 4. Gap terrain. CPG in \(xz\) and offset in \(x\) direction. 5. Gap terrain. Offsets only in \(xz\) directions. 6. Gap terrain. CPG and offsets both in \(xz\) directions. The CPG in these cases means the agent (supraspinal drive) modulates the frequency and amplitude of Equations (1) and (2). The offset terms are considered as a part of the actuation signal applied directly by the supraspinal drive, bypassing the spinal cord dynamics. Cases 5 and 6 are the only cases in which we modulate the offset in the \(z\) direction. We train policies for each case for \(3.5\!\times\!10^{7}\) samples for episodes of \(10\)\(s\) on terrains with 7 consecutive gaps (except for Case 1, which is trained on flat terrain only) with all exteroceptive feedback features in the observation space. Each gap length is randomized in \([14,\!20]\)\(cm\) during both training and test time, with \(1.4\)\(m\) distances between gaps. An episode terminates early because of a fall, i.e. if the body height drops below \(15\)\(cm\). We define the success rate as the number of gaps successfully crossed out of the total number of gaps. In order to test the six policies, we perform 30 policy rollouts on a test environment of locomoting over 7 randomized gaps. Table II summarizes the results from investigating how supraspinal drive can modulate locomotion in these six cases. #### Iv-A1 Gap Crossing Success Rate Case 5 has the highest success rate of \(99\%\), indicating the benefit of direct supraspinal actuation in anticipatory scenarios. Case 4, with both oscillatory and offset terms in the \(x\) direction, has the second highest success rate of \(97\%\). The third highest success rate is for Case 6 with both oscillatory and offset terms in both \(x\) and \(z\) directions. The fourth highest success rate is Case 3 (with only the offset component in the \(x\) direction), and Case 2 (with only the CPG components) has the fifth best success rate of \(17\%\). These results show that direct supraspinal actuation of the foot offset/position is critical for successful gap-crossing, though the CPG can contribute to a high success rate in the absence of \(z\) offset modulation. #### Iv-A2 Gait Smoothness To compare the gait smoothness between policies, we analyze the robot body oscillations during locomotion, and in particular the average angular velocity of the robot body \(\bar{\omega}_{Body}\!=\!(\sum_{t=1}^{N}\!\left|\omega_{x,t}\right|\!+\!\left| \omega_{y,t}\right|\!+\!\left|\omega_{z,t}\right|\!)/(3N)\). Body orientation deviations are penalized in the reward function, as high (absolute) angular velocities tend to correspond to shaky gait patterns. As shown in Table II, the first case has the smoothest gait. This is expected since it corresponds to steady-state locomotion behavior on flat terrain. A comparison of the third and fourth cases indicates a \(45\%\) reduction in body oscillation when the agent can also modulate CPG amplitudes. The gait smoothness of case 5 is drastically reduced by removing the CPG dynamics. This result shows the importance of spinal cord dynamics (limit-cycle oscillatory dynamics) for obtaining smooth locomotion. #### Iv-A3 Cost of Transport (CoT) and Froude number We investigate gait efficiency by comparing the CoT, and mean velocity with the Froude number [4]. We observe that the fourth case (with both oscillatory and offset components), has the best combined CoT, Froude number, and gait smoothness (low \(\bar{\omega}_{Body}\)). This demonstrates the benefit of having both supraspinal drive and CPG dynamics for coordinating locomotion. Case 3, which has the CPG oscillatory component in \(z\) and offset in \(x\), has the lowest CoT, and we observe significant added energy expenditure by removing the CPG dynamics (Case 5). Case 6 shows that having both oscillatory and offset terms leads to the highest Froude number, but also a high CoT and \(\bar{\omega}_{Body}\), suggesting that overparameterizing the action space can make it difficult for the agent to converge to an optimal policy. ### _Roles of Feedback Features for Anticipatory Locomotion_ In this section we investigate which exteroceptive sensory feedback information is necessary and sufficient for learning and planning anticipatory tasks. As shown in Figure 3, we consider 16 different combinations of predictive and instantaneous feedback features as described in Section III-B. We train 16 different policies with the Case 4 action space from Section IV-A (i.e. with CPG and \(x\) offset modulation). For evaluation, we rollout each policy 100 times and present mean results across all tests. Fig. 3-A shows the gap crossing success rate (by bar height) and CoT (by color). Our results show that policy 1, which has the front feet distances to the gap in the observation space, has both one of the best success rates as well as one of the lowest CoTs. These results show that front leg information is sufficient for learning the gap-crossing task. As the agent is explicitly blind about hind leg positions, this forces it to learn an internal kinematic model by combining exteroceptive front feet positions to the gap, internal CPG states, and proprioceptive sensing to modulate the hind leg motions for gap crossing. This result supports the biological hypothesis that cats and horses control the front legs for obstacle avoidance, and that hind legs follow based on an internal kinematic memory [46, 47]. Notably, as could be expected, the 8 policies with the highest success rates contain the feet and/or base distances to the gap in the observation space, which indicates the importance of predictive feedback features in the observation space. Interestingly, policy 7, which observes all discussed exteroceptive sensing in the observation space, has a slightly lower success rate with respect to the first 6 policies with subsets of the full sensing. This suggests that including supererogatory information in the observation space may not necessarily improve the quality of the learned policy, and may even prevent the convergence of the RL algorithm in finding the optimal policy. Figure 3-B shows the CoT as the bar height, with the color indicating the Froude number. The lowest CoT and \begin{table} \begin{tabular}{c c c c c c c c c} Case & \(x_{age}\) & \(x_{off}\) & \(z_{age}\) & \(z_{off}\) & Success[\%] & CoT & Froude & \(\bar{\omega}_{Body}\) \\ \hline 1 & ✓ & \(\times\) & ✓ & \(\times\) & \(\times\) & 0.92 & 0.34 & **0.36** \\ 2 & ✓ & ✓ & ✓ & \(\times\) & 17 & 1.45 & 0.29 & 0.73 \\ 3 & \(\times\) & ✓ & ✓ & \(\times\) & 60 & **0.84** & 0.29 & 0.77 \\ 4 & ✓ & ✓ & ✓ & \(\times\) & 97 & 0.94 & 0.55 & 0.42 \\ 5 & \(\times\) & ✓ & \(\times\) & ✓ & **99** & 1.24 & 0.56 & 0.96 \\ 6 & ✓ & ✓ & ✓ & ✓ & 93 & 1.35 & **0.88** & 0.85 \\ \hline \end{tabular} \end{table} TABLE II: Testing policies trained with different combinations of oscillatory and offset terms in the action space. \(\bar{\omega}_{Body}\) is the average body angular velocity. Case 1 is for walking on flat terrain without gaps. We only show mean values since the standard deviations are small (i.e. less than 10% of the means). highest Froude number are for the first three policies, which include the front feet positions in the observation space. The first 10 policies show that having predictive information in the observation space helps to learn an energy-efficient gait for the gap-crossing task. Figure 3-C shows the average body angular velocity to investigate gait smoothness. We observe that having feet distances to the gap in the observation space leads to lower average body angular velocities, and as a result smoother gaits. ### _Training for a More Challenging Gap-Crossing Scenario_ In this section, we train the robot to cross 8 gaps with the front feet distances to the gap in the observation space (the same as policy 1 from Section IV-B), with 30 \(cm\) platforms between each gap. The gaps have randomized lengths between \([14,20]\)\(cm\), and the first gap position is randomized between \([1.25,2.25]\)\(m\). As shown in Figure 4, the supraspinal drive increases the velocity of the robot by increasing the frequency of the CPG. The desired velocity for the robot is 1 \(m/s\), however, the agent has learned to increase the velocity of the robot to up to 3 \(m/s\) to overcome the gaps. We observe that the policy increases the limb frequency to near its maximum limits for all legs as soon as it reaches the first gap. This indicates that the supraspinal drive modulates the locomotion speed by increasing the CPG frequencies. The oscillation amplitude also changes the step position and reaches maximum values for each foot to cross the gaps. As seen in bottom right of Figure 4, the offset term is an important component for inter-limb coordination and can explicitly modulate the step position. On average it has the highest and lowest values when the foot starts and stops crossing a gap. Figure 4 (middle) interestingly shows the robot places its HL limb approximately where the FL limb was located in the previous stride. ### _Hardware Experiment_ We perform a sim-to-real transfer of policy 1 from Section IV-B to the Go1 hardware for a two gap scenario with widths of \(15\)\(cm\) and \(7\)\(cm\). We simplify the sim-to-real transfer by using a trained neural network to capture the actuator dynamics [23, 53], and we assume knowledge of the relative gap distance to the robot from an equivalent scenario completed in simulation. Figure 1-A shows snapshots of trotting over the gaps with a mean velocity of 0.7 \(m/s\). ## V Conclusion In this work, we have proposed a framework to investigate the interactions between supraspinal drive and the CPG to generate anticipatory quadruped locomotion in gap crossing scenarios. Our results show that supraspinal drive is critical for high success rates for gap crossing, but CPG dynamics are beneficial for energy efficiency and gait smoothness. Moreover, our results show that the front foot distance to the gap is the most important and sufficient visually-extracted sensory information for learning gap crossing scenarios. This supports the biological hypothesis that cats and horses control their front legs for obstacle avoidance, and that hind legs follow an internal memory based on the front feet information [46, 47]. This shows that DRL is able to create and encode an internal kinematic model with proprioceptive sensing to modulate the hind leg motion for gap crossing. Furthermore, in contrast to previous work, to the best of our knowledge, this is the first RL framework with gap-crossing capability without having a dynamical model, MPC, curriculum, or mentor in the loop. ## Acknowledgements We would like to thank Alessandro Crespi for assisting with hardware setup. Fig. 4: Crossing 8 gaps with randomized lengths between \([14,20]\) cm, with only 30 cm contact surfaces. **Top:** simulation snapshots. **Middle:** body velocity and foot positions in the XZ plane. **Bottom:** CPG frequency, amplitude, and offset for the front left limb. The shadow bars indicate when the foot is over a gap.

2310.13169

A posteriori analysis for a mixed formulation of the Stokes spectral problem

In two and three dimensions, we design and analyze a posteriori error estimators for the mixed Stokes eigenvalue problem. The unknowns on this mixed formulation are the pseudotress, velocity and pressure. With a lowest order mixed finite element scheme, together with a postprocressing technique, we prove that the proposed estimator is reliable and efficient. We illustrate the results with several numerical tests in two and three dimensions in order to assess the performance of the estimator.

Felipe Lepe, Jesus Vellojin

2023-10-19T21:39:12Z

http://arxiv.org/abs/2310.13169v1

# A posteriori analysis for a mixed formulation of the Stokes spectral problem ###### Abstract. In two and three dimensions, we design and analyze a posteriori error estimators for the mixed Stokes eigenvalue problem. The unknowns on this mixed formulation are the pseudotress, velocity and pressure. With a lowest order mixed finite element scheme, together with a postprocessing technique, we prove that the proposed estimator is reliable and efficient. We illustrate the results with several numerical tests in two and three dimensions in order to assess the performance of the estimator. Key words and phrases:Mixed problems, eigenvalue problems,a posteriori error estimates, Stokes equations 2000 Mathematics Subject Classification: Primary 34L15, 34L16, 35Q35,35R06, 65N15, 65N50, 76D07, 76M10 The first author was partially supported by ANID-Chile through FONDECYT project 11200529. The second author was partially supported by the National Agency for Research and Development, ANID-Chile through project Anillo of Computational Mathematics for Desalination Processes ACT210087, FONDECYT Postdoctorado project 3230302, and by project Centro de Modelamiento Matematico (CMM), FB210005, BASAL funds for centers of excellence. the a posteriori analysis, we will show that it is possible to develop an a posteriori estimator for the pseudostress-pressure-velocity formulation and focus only on the analysis for this estimator, since in its definition, an a posteriori estimator for the pseudostress-velocity is contained, implying that all the analysis related to efficiency and reliability can be performed for both discrete formulations simultaneously. From the above, and in order to complete the study of the pseudostress-pressure-velocity formulation for the Stokes eigenproblem, we propose a residual-based a posteriori error estimator. The analysis is performed for eigenvalues with simple multiplicity and its associated eigenfunctions. Using a superconvergence result, we are able to control the high order terms that naturally appear when this kind of analysis is developed. The a posteriori estimator is constructed by means of lowest order Raviart-Thomas (RT) elements, suitable defined for tensorial fields, which are considered to approximate the pseudotress tensor, whereas the velocity and pressure are approximated with piecewise linear functions. This is not the only alternative that we can consider as a numerical scheme for this formulation as is stated in [23], where Brezzi-Douglas-Marini (BDM) elements can be considered as an alternative to approximate the pseudostress. However and for simplicity, the analysis is carried only with Raviart-Thomas elements, whereas in the numerical tests we do consider the BDM family in order to observe the performance of the adaptive algorithm with this family of finite elements. In addition, the mathematical and numerical analysis proposed in this study considers homogeneous Dirichlet boundary conditions. However, mixed boundary conditions can be also considered, and the analysis can be performed with minor modifications respect to the present contribution. The paper is organized as follows: In section 2 we present the Stokes eigenvalue problem and the mixed formulation in consideration. Also we summarize some necessary results to perform the analysis. Section 3 is devoted to present the mixed finite element discretization of the Stokes eigenvalue problem. More precisely, we present the the lowest order Raviart-Thomas elements and its approximation properties, correctly adapted for the tensorial framework of the formulation. The core of our paper is section 4, where we introduce the a posteriori error estimators for the full and reduced eigenvalue problems, the technical results needed to perform the analysis, and the results that establish that the error and the estimator are equivalent. Finally, in Section 5 we report numerical tests to assess the performance of the proposed adaptive scheme in two and three dimensions, proving experimentally the efficiency and reliability of the a posteriori estimators. ### Notations and preliminaries The following are some of the notations that will be used in this work. Given \(n\in\{2,3\}\), we denote by \(\mathbb{R}^{n}\) and \(\mathbb{R}^{n\times n}\) the space of vectors and tensors of order \(n\) with entries in \(\mathbb{R}\), respectively. The symbol \(\mathbb{I}\) represents the indentity matrix of \(\mathbb{R}^{n\times n}\). Given any \(\boldsymbol{\tau}:=(\tau_{ij})\) and \(\boldsymbol{\sigma}:=(\sigma_{ij})\in\mathbb{R}^{n\times n}\), we write \[\boldsymbol{\tau}^{\mathsf{t}}:=(\tau_{ji}),\quad\operatorname{tr}( \boldsymbol{\tau}):=\sum_{i=1}^{n}\tau_{ii},\quad\boldsymbol{\tau}: \boldsymbol{\sigma}:=\sum_{i,j=1}^{n}\tau_{ij}\,\sigma_{ij},\quad\text{and} \quad\boldsymbol{\tau}^{\mathsf{d}}:=\boldsymbol{\tau}-\frac{1}{n} \operatorname{tr}(\boldsymbol{\tau})\mathbb{I}\] to refer to the transpose, the trace, the tensorial product between \(\boldsymbol{\tau}\) and \(\boldsymbol{\sigma}\), and the deviatoric tensor of \(\boldsymbol{\tau}\), respectively. For \(s\geq 0\), we denote as \(\|\cdot\|_{s,\Omega}\) the norm of the Sobolev space \(\mathrm{H}^{s}(\Omega)\), \([\mathrm{H}^{s}(\Omega)]^{n}\) or \(\mathbb{H}^{s}(\Omega):=[\mathrm{H}^{s}(\Omega)]^{n\times n}\) with \(n\in\{2,3\}\) for scalar, vector, and tensorial fields, respectively, with the convention \(\mathrm{H}^{0}(\Omega):=\mathrm{L}^{2}(\Omega)\), \([\mathrm{H}^{0}(\Omega)]^{n}:=[\mathrm{L}^{2}(\Omega)]^{n}\), and \(\mathbb{H}^{0}(\Omega):=\mathbb{L}^{2}(\Omega)\). Furthermore, with \(\mathrm{div}\) denoting the usual divergence operator, we define the Hilbert space \[\mathrm{H}(\mathrm{div},\Omega):=\{\boldsymbol{\tau}\in\mathrm{L}^{2}(\Omega) \,:\,\mathrm{div}(\boldsymbol{\tau})\in\mathrm{L}^{2}(\Omega)\},\] whose norm is given by \(\|\boldsymbol{\tau}\|_{\mathrm{div},\Omega}^{2}:=\|\boldsymbol{\tau}\|_{0, \Omega}^{2}+\|\,\mathrm{div}(\boldsymbol{\tau})\|_{0,\Omega}^{2}\). The space of matrix valued functions whose rows belong to \(\mathrm{H}(\mathbf{div},\Omega)\) will be denoted \(\mathbb{H}(\mathbf{div},\Omega)\) where \(\mathbf{div}\) stands for the action of \(\mathrm{div}\) along each row of a tensor. Also, we introduce the space \[\mathbb{H}(\mathbf{curl}\,,\Omega):=\{\boldsymbol{w}\in\mathbb{L}^{2}(\Omega ):\,\mathbf{curl}\,\boldsymbol{w}\in\mathbb{L}^{2}(\Omega)\},\] which is endowed with its natural norm. Finally, the relation \(\mathtt{a}\lesssim\mathtt{b}\) indicates that \(\mathtt{a}\leq C\mathtt{b}\), with a positive constant \(C\) which is independent of \(\mathtt{a}\), \(\mathtt{b}\) and the mesh size \(h\), which will be introduced in Section 3. Similarly, we define \(a\gtrsim b\) to denote \(a\geq Cb\), with \(C\) as above. ## 2. The Stokes spectral problem Introducing the pseudotress tensor \(\boldsymbol{\sigma}:=2\mu\nabla\boldsymbol{u}-p\mathbb{I}\), the Stokes eigenvalue problem of our interest is the following: \[\left\{\begin{array}{rcll}\mathbf{div}\,\boldsymbol{\sigma}&=&-\lambda \boldsymbol{u}&\quad\mathrm{in}\,\Omega\\ \boldsymbol{\sigma}-2\mu\nabla\boldsymbol{u}+p\mathbb{I}&=&\mathbf{0}&\quad \mathrm{in}\,\Omega\\ \mathbf{div}\,\boldsymbol{u}&=&0&\quad\mathrm{in}\,\Omega\\ \boldsymbol{u}&=&\mathbf{0}&\quad\mathrm{on}\,\partial\Omega,\end{array}\right. \tag{2.1}\] where \(\mu\) is the kinematic viscosity and \(\mathbf{div}\) must be understood as the divergence of any tensor applied along on each row. As is commented in [14], the pressure and the pseudostress tensor are related through the following identity \(p=-\operatorname{tr}(\boldsymbol{\sigma})/n\) in \(\Omega.\) This identity holds since \(\operatorname{tr}(\nabla\boldsymbol{u})=\mathrm{div}\,\boldsymbol{u}=0\). Hence, problem (2.1) can be rewritten as the following system: \[\left\{\begin{array}{rcll}\mathbf{div}\,\boldsymbol{\sigma}&=&-\lambda \boldsymbol{u}&\quad\mathrm{in}\,\Omega\\ \boldsymbol{\sigma}-2\mu\nabla\boldsymbol{u}+p\mathbb{I}&=&\mathbf{0}&\quad \mathrm{in}\,\Omega\\ p+\frac{1}{n}\operatorname{tr}(\boldsymbol{\sigma})&=&0&\quad \mathrm{in}\,\Omega\\ \boldsymbol{u}&=&\mathbf{0}&\quad\mathrm{on}\,\partial\Omega.\end{array}\right. \tag{2.2}\] A variational formulation for (2.2) in terms of the deviatoric tensors \(\boldsymbol{\sigma}^{\mathtt{d}}\) and \(\boldsymbol{\tau}^{\mathtt{d}}\) is (see for example [9]): Find \(\lambda\in\mathbb{R}\) and the triplet \(((\boldsymbol{\sigma},p),\boldsymbol{u})\in\mathbb{H}(\mathbf{div},\Omega) \times\mathrm{L}^{2}(\Omega)\times[\mathrm{L}^{2}(\Omega)]^{n}\) such that \[\frac{1}{2\mu}\int_{\Omega}\boldsymbol{\sigma}^{\mathtt{d}}: \boldsymbol{\tau}^{\mathtt{d}}+\frac{n}{2\mu}\int_{\Omega}\left(p+\frac{1}{n} \operatorname{tr}(\boldsymbol{\sigma})\right)\left(q+\frac{1}{n}\operatorname {tr}(\boldsymbol{\tau})\right)+\int_{\Omega}\boldsymbol{u}\cdot\mathbf{div} \,\boldsymbol{\tau}=0, \tag{2.4}\] \[\int_{\Omega}\boldsymbol{v}\cdot\mathbf{div}\,\boldsymbol{\sigma} =-\lambda\int_{\Omega}\boldsymbol{u}\cdot\boldsymbol{v}, \tag{2.3}\] for all \(((\boldsymbol{\tau},q),\boldsymbol{v})\in\mathbb{H}(\mathbf{div},\Omega) \times\mathrm{L}^{2}(\Omega)\times[\mathrm{L}^{2}(\Omega)]^{n}\). However, the solution for this problem is not unique if homogeneous Dirichlet conditions on the whole boundary are considered [14, Lemma 2.1]. This is circumvented by requiring that \(\boldsymbol{\sigma}\in\mathbb{H}_{0}\), where the space \(\mathbb{H}_{0}\) is given in the decomposition \(\mathbb{H}(\mathbf{div},\Omega)=\mathbb{H}_{0}\oplus\mathbb{R}\mathbb{I}\), with \[\mathbb{H}_{0}:=\left\{\boldsymbol{\tau}\in\mathbb{H}(\mathbf{div},\Omega)\,: \,\int_{\Omega}\operatorname{tr}(\boldsymbol{\tau})=0\right\}.\] Here, and in the rest of the paper, we will assume that \(\boldsymbol{\sigma}\in\mathbb{H}_{0}\). For simplicity, we define \(\mathbb{H}:=\mathbb{H}_{0}\times\mathrm{L}^{2}(\Omega)\). Hence, following [14, Lemma 2.2] we have that \(\boldsymbol{\sigma}\in\mathbb{H}_{0}\) is solution of (2.3)-(2.4), which is restated as: Find \(\lambda\in\mathbb{R}\) and the triplet \(((\boldsymbol{0},0),\boldsymbol{0})\neq((\boldsymbol{\sigma},p),\boldsymbol{ u})\in\mathbb{H}\times\mathrm{L}^{2}(\Omega)\times[\mathrm{L}^{2}(\Omega)]^{n}\) such that \[a((\boldsymbol{\sigma},p),(\boldsymbol{\tau},q))+b(\boldsymbol{ \tau},\boldsymbol{u}) =0 \forall(\boldsymbol{\tau},q)\in\mathbb{H}, \tag{2.6}\] \[b(\boldsymbol{\sigma},\boldsymbol{v}) =-\lambda(\boldsymbol{u},\boldsymbol{v}) \quad\forall\boldsymbol{v}\in\mathbf{Q}, \tag{2.5}\] where \(\mathbf{Q}:=[\mathrm{L}^{2}(\Omega)]^{n}\) and the bilinear forms \(a:\mathbb{H}\times\mathbb{H}\to\mathbb{R}\) and \(b:\mathbb{H}\times\mathbf{Q}\to\mathbb{R}\) are defined by \[a((\boldsymbol{\xi},r),(\boldsymbol{\tau},q)):=\frac{1}{2\mu}\int_{\Omega} \boldsymbol{\sigma}^{\mathsf{d}}:\boldsymbol{\tau}^{\mathsf{d}}+\frac{n}{2 \mu}\int_{\Omega}\left(r+\frac{1}{n}\operatorname{tr}(\boldsymbol{\xi}) \right)\left(q+\frac{1}{n}\operatorname{tr}(\boldsymbol{\tau})\right),\] and \[b(\boldsymbol{\xi},\boldsymbol{v}):=\int_{\Omega}\boldsymbol{v}\cdot \operatorname{\mathbf{div}}\boldsymbol{\xi}.\] **Remark 2.1**.: _In [23] is considered a reduced formulation where the pressure \(p\) can be eliminated. For instance, we can consider the problem: Find \(\lambda\in\mathbb{R}\) and \((\boldsymbol{0},\boldsymbol{0})\neq(\boldsymbol{\sigma},\boldsymbol{u})\in \mathbb{H}_{0}\times\mathbf{Q}\) such that_ \[a_{0}(\boldsymbol{\sigma},\boldsymbol{\tau})+b(\boldsymbol{\tau},\boldsymbol{u}) =0 \forall\boldsymbol{\tau}\in\mathbb{H}_{0}, \tag{2.8}\] \[b(\boldsymbol{\sigma},\boldsymbol{v}) =-\lambda(\boldsymbol{u},\boldsymbol{v}) \quad\forall\boldsymbol{v}\in\mathbf{Q}, \tag{2.7}\] _where \(a_{0}:\mathbb{H}_{0}\times\mathbb{H}_{0}\to\mathbb{R}\) is a bounded bilinear form defined by_ \[a_{0}(\boldsymbol{\xi},\boldsymbol{\tau}):=\frac{1}{2\mu}\int_{\Omega} \boldsymbol{\xi}^{\mathsf{d}}:\boldsymbol{\tau}^{\mathsf{d}} \quad\forall(\boldsymbol{\xi},\boldsymbol{\tau})\in\mathbb{H}_{0}\times \mathbb{H}_{0}.\] _The analysis can be performed with this reduced formulation, but for this paper, we are interested on (2.5)-(2.6). Moreover, at discrete level, the a posteriori estimator for the FEM discretization of (2.5)-(2.6) contains terms of the reduced problem. Hence, we are in some way considering both problems at the same time._ We recall that (2.5)-(2.6) and (2.7)-(2.8) are equivalent, however their finite element counterparts are not (see [23] for instance). From [12, 28] we have the following regularity result for the Stokes spectral problem. **Theorem 2.1**.: _There exists \(s>0\) such that \(\boldsymbol{u}\in[\mathrm{H}^{1+s}(\Omega)]^{n}\) and \(p\in\mathrm{H}^{s}(\Omega)\)._ The well posedness of (2.5)-(2.6) implies the existence of an operator \(\mathcal{A}:\mathbb{H}\times\mathbf{Q}\to(\mathbb{H}\times\mathbf{Q})^{\prime}\), induced by the left-hand side of (2.5)-(2.6), which is an isomorphism that satisfies \(\|\mathcal{A}((\boldsymbol{\tau},q),\boldsymbol{v})\|_{(\mathbb{H}\times \mathbf{Q})^{\prime}}\gtrsim\|((\boldsymbol{\tau},q),\boldsymbol{v})\|_{ \mathbb{H}\times\mathbf{Q}}\), for all \(((\boldsymbol{\tau},q),\boldsymbol{v})\in\mathbb{H}\times\mathbf{Q}\), that is equivalent to the following inf-sup condition (2.9) \[\|((\boldsymbol{\tau},q),\boldsymbol{v})\|_{\mathbb{H}\times\mathbf{Q}}\, \lesssim\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\! \(\mathbb{R}^{n}\), we denote by \(\mathbb{P}_{\ell}(D)\) the space of polynomials of degree at most \(\ell\) defined in \(D\). With these ingredients at hand, for \(\ell=0\) we define the local Raviart-Thomas space of the lowest order as follows (see [5]) \[\mathbf{RT}_{0}(T)=[\mathbb{P}_{0}(T)]^{n}\oplus\mathbb{P}_{0}(T)\boldsymbol{x},\] where \(\boldsymbol{x}\in\mathbb{R}^{n}\). With this local space at hand, we define the global Raviart-Thomas space, which we denote by \(\mathbb{RT}_{0}(\mathcal{T}_{h})\), as follows \[\mathbb{RT}_{0}(\mathcal{T}_{h}):=\{\boldsymbol{\tau}\in\mathbb{H}(\mathbf{ div},\Omega)\,:\,(\tau_{i1},\cdots,\tau_{in})^{\mathrm{t}}\in\mathbf{RT}_{0}(T) \ \forall i\in\{1,\ldots,n\},\ \forall T\in\mathcal{T}_{h}\}.\] Also we introduce the global space of piecewise polynomials of degree \(\leq k\) defined by \[\mathbb{P}_{k}(\mathcal{T}_{h}):=\{v\in\mathrm{L}^{2}(\Omega)\,:\,v|_{T}\in \mathbb{P}_{k}(T)\ \forall T\in\mathcal{T}_{h}\}.\] With these discrete spaces at hand, we recall some approximation properties that hold for each of them (see [17] for instance). Let \(\boldsymbol{\Pi}_{h}:\mathbb{H}^{t}(\Omega)\to\mathbb{RT}_{0}(\mathcal{T}_{h})\) be the Raviart-Thomas interpolation operator. For \(t\in(0,1/2]\) and \(\boldsymbol{\tau}\in\mathbb{H}^{t}(\Omega)\cap\mathbb{H}(\mathbf{div};\Omega)\) the following error estimate holds true \[\|\boldsymbol{\tau}-\boldsymbol{\Pi}_{h}\boldsymbol{\tau}\|_{0,\Omega} \lesssim h^{t}\big{(}\|\boldsymbol{\tau}\|_{t,\Omega}+\|\,\mathbf{div}\, \boldsymbol{\tau}\|_{0,\Omega}\big{)}. \tag{3.10}\] Also, for \(\boldsymbol{\tau}\in\mathbb{H}^{t}(\Omega)\) with \(t>1/2\), there holds \[\|\boldsymbol{\tau}-\boldsymbol{\Pi}_{h}\boldsymbol{\tau}\|_{0,\Omega} \lesssim h^{\min\{t,1\}}|\boldsymbol{\tau}|_{t,\Omega}. \tag{3.11}\] Let \(\mathcal{P}_{h}:[\mathrm{L}^{2}(\Omega)]^{n}\to[\mathbb{P}_{0}(\mathcal{T}_{h} )]^{n}\) be the \(\mathrm{L}^{2}(\Omega)\)-orthogonal projector, which satisfies the following commuting diagram: \[\mathbf{div}(\boldsymbol{\Pi}_{h}\boldsymbol{\tau})=\mathcal{P}_{h}(\mathbf{ div}\,\boldsymbol{\tau}), \tag{3.12}\] and, if \(\boldsymbol{v}\in\mathrm{H}^{t}(\Omega)^{n}\) with \(t>0\), \(\mathcal{P}_{h}\) it also satisfies \[\|\boldsymbol{v}-\mathcal{P}_{h}\boldsymbol{v}\|_{0,\Omega}\lesssim h^{\min\{t,1\}}|\boldsymbol{v}|_{t,\Omega}. \tag{3.13}\] Finally, for each \(\boldsymbol{\tau}\in\mathbb{H}^{t}(\Omega)\) such that \(\mathbf{div}\,\boldsymbol{\tau}\,\in[\mathrm{H}^{t}(\Omega)]^{n}\), there holds \[\|\,\mathbf{div}(\boldsymbol{\tau}-\boldsymbol{\Pi}_{h}\boldsymbol{\tau})\|_{0,\Omega}\lesssim h^{\min\{t,1\}}|\,\mathbf{div}\,\boldsymbol{\tau}|_{t,\Omega}. \tag{3.14}\] It is worth noting that all the following analysis is also valid if the Brezzi-Douglas-Marini family, namely \(\mathbb{BDM}\), is used (see [23] for details and Section 5 below). To end this section, we define \[\mathbb{H}_{0,h}:=\left\{\boldsymbol{\tau}_{h}\in\mathbb{RT}_{0}(\mathcal{T}_{ h})\ :\ \int_{\Omega}\mathrm{tr}(\boldsymbol{\tau}_{h})=0\right\},\] and also define \(Q_{h}:=\mathbb{P}_{0}(\mathcal{T}_{h})\), \(\mathbf{Q}_{h}:=[\mathbb{P}_{0}(\mathcal{T}_{h})]^{n}\) and \(\mathbb{H}_{h}:=\mathbb{H}_{0,h}\times Q_{h}\). ### The discrete eigenvalue problems With the discrete spaces defined above, we are in position to introduce the discretization of problem (2.5)-(2.6): Find \(\lambda_{h}\in\mathbb{R}\) and \(((\boldsymbol{0},0),\boldsymbol{0})\neq((\boldsymbol{\sigma}_{h},p_{h}), \boldsymbol{u}_{h})\in\mathbb{H}_{h}\times\mathbf{Q}_{h}\) such that \[a((\boldsymbol{\sigma}_{h},p_{h}),(\boldsymbol{\tau}_{h},q_{h}))+ b(\boldsymbol{\tau}_{h},\boldsymbol{u}_{h}) =0 \forall(\boldsymbol{\tau}_{h},q_{h})\in\mathbb{H}_{h}, \tag{3.16}\] \[b(\boldsymbol{\sigma}_{h},\boldsymbol{v}_{h}) =-\lambda_{h}(\boldsymbol{u}_{h},\boldsymbol{v}_{h})\quad \forall\boldsymbol{v}_{h}\in\mathbf{Q}_{h}. \tag{3.15}\] Similarly as in the continuous case, it is possible to consider a reduced formulation for the discrete eigenvalue problem which reads as follows: Find \(\lambda_{h}\in\mathbb{R}\) and \((\boldsymbol{0},\boldsymbol{0})\neq(\boldsymbol{\sigma}_{h},\boldsymbol{u}_{h}) \in\mathbb{H}_{0,h}\times\mathbf{Q}_{h}\) such that \[a_{0}(\boldsymbol{\sigma}_{h},\boldsymbol{\tau}_{h})+b(\boldsymbol{ \tau}_{h},\boldsymbol{u}_{h}) =0 \forall\boldsymbol{\tau}_{h}\in\mathbb{H}_{0,h}, \tag{3.18}\] \[b(\boldsymbol{\sigma}_{h},\boldsymbol{v}_{h}) =-\lambda(\boldsymbol{u}_{h},\boldsymbol{v}_{h})\quad\forall \boldsymbol{v}_{h}\in\mathbf{Q}_{h}. \tag{3.17}\] A priori error estimates for problems (2.5)-(2.6) and (3.15)-(3.16) are derived from [23, Theorems 4.4 and 4.5]. **Lemma 3.1**.: _Let \((\lambda,((\boldsymbol{\sigma},p),\boldsymbol{u}))\) be a solution of (2.5)-(2.6) with \(\|\boldsymbol{u}\|_{0,\Omega}=1\), and let \((\lambda_{h},((\boldsymbol{\sigma}_{h},p_{h}),\boldsymbol{u}_{h}))\) be its finite element approximation given as the solution to (3.15)-(3.16) with \(\|\boldsymbol{u}_{h}\|_{0,\Omega}=1\). Then_ \[\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{0,\Omega}+\|p-p_{h}\|_{0, \Omega}+\|\boldsymbol{u}-\boldsymbol{u}_{h}\|_{0,\Omega}\lesssim h^{s},\] _and_ \[|\lambda-\lambda_{h}|\lesssim\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_ {0,\Omega}^{2}+\|p-p_{h}\|_{0,\Omega}^{2}+\|\boldsymbol{u}-\boldsymbol{u}_{h} \|_{0,\Omega}^{2},\] _where, the hidden constants are independent of \(h\), and \(s>0\) as in Theorem 2.1._ We end this section with the following technical result, which states that for \(h\) small enough, except for \(\lambda_{h}\), the rest of the eigenvalues of (3.15)-(3.16) are well separated from \(\lambda\) (see [6]). **Proposition 3.1**.: _Let us enumerate the eigenvalues of systems (3.15)-(3.16) and (2.5)-(2.6) in increasing order as follows: \(0<\lambda_{1}\leq\cdots\lambda_{i}\leq\cdots\) and \(0<\lambda_{h,1}\leq\cdots\lambda_{h,i}\leq\cdots\). Let us assume that \(\lambda_{J}\) is a simple eigenvalue of (3.15)-(3.16). Then, there exists \(h_{0}>0\) such that_ \[|\lambda_{J}-\lambda_{h,i}|\geq\frac{1}{2}\min_{j\neq J}|\lambda_{j}-\lambda_ {J}|\quad\forall i\leq\dim\mathbb{H}_{h},\ i\neq J,\quad\forall h<h_{0}.\] ## 4. A posteriori error analysis The aim of the following section is to design and analyze an a posteriori error estimator for our mixed formulation of the Stokes spectral problem in two and three dimensions. This implies not only the analysis of the efficiency and reliability bound, but also the control of the high order terms that naturally appear on this analysis. With this goal in mind, we will adapt the results of [18] in order to obtain a superconvergence result that is needed to precisely handle the high order terms. ### Properties of the mesh Let us set some definitions. For \(T\in\mathcal{T}_{h}\), let \(\mathcal{E}(T)\) be the set of its faces/edges, and let \(\mathcal{E}_{h}\) be the set of all the faces/edges of the mesh \(\mathcal{T}_{h}\). With these definitions at hand, we write \(\mathcal{E}_{h}=\mathcal{E}_{h}(\Omega)\cup\mathcal{E}_{h}(\partial\Omega)\), where \[\mathcal{E}_{h}(\Omega):=\{e\in\mathcal{E}_{h}\,:\,e\subseteq\Omega\}\quad \text{and}\quad\mathcal{E}_{h}(\Omega):=\{e\in\mathcal{E}_{h}\,:\,e\subseteq \partial\Omega\}.\] For each face/edge \(e\in\mathcal{E}_{h}\) we fix a unit normal vector \(\boldsymbol{n}_{e}\) to \(e\). Moreover, given \(\boldsymbol{\tau}\in\mathbb{H}(\mathbf{curl}\,;\Omega)\) and \(e\in\mathcal{E}_{h}(\Omega)\), we let \(\llbracket\boldsymbol{\tau}\times\boldsymbol{n}_{e}\rrbracket\) be the corresponding jump of the tangential traces across \(e\), defined by \[\llbracket\boldsymbol{\tau}\times\boldsymbol{n}_{e}\rrbracket:=(\boldsymbol{ \tau}|_{T}-\boldsymbol{\tau}|_{T^{\prime}})\big{|}_{e}\times\boldsymbol{n}_ {e},\] where \(T\) and \(T^{\prime}\) are two elements of the mesh with common edge \(e\). For two dimensions, the tangential traces across \(e\) is defined by \[\llbracket\boldsymbol{\tau}\times\boldsymbol{n}_{e}\rrbracket:=\big{[}( \boldsymbol{\tau}|_{T}-\boldsymbol{\tau}|_{T^{\prime}})\big{|}_{e}\big{]} \,\boldsymbol{t}_{e},\] where \(\boldsymbol{t}_{e}:=(-n_{2},n_{1})\) is the corresponding tangential vector for the facet normal \(\boldsymbol{n}_{e}=(n_{1},n_{2})\). ### Postprocessing Let us define the following space \[\mathrm{Y}_{h}:=\{\mathbf{v}\in[\mathrm{H}^{1}(\Omega)]^{n}\,:\,\mathbf{v}\in[P_{1}(T)]^{n },\quad\forall T\in\mathcal{T}_{h}\}.\] For each vertex \(z\) of the elements in \(\mathcal{T}_{h}\), we define the patch \[\omega_{z}:=\bigcup_{z\in T\in\mathcal{T}_{h}}T.\] We introduce the postprocessing operator \(\Theta_{h}:\mathbf{Q}\to\mathrm{Y}_{h}\). The motivation of this operator is to fit a piecewise linear function in the average sense, for any \(\mathbf{v}\in\mathbf{Q}\) at the degrees of freedom of element integrations in the following way \[\Theta_{h}\mathbf{v}(z):=\sum_{T\in\omega_{z}}\frac{\int_{T}\mathbf{v}\,dx}{|\omega_{z} |},\] where \(|\omega_{z}|\) denotes the facet measure (area in 2D, volume in 3D) of the patch. Let us precise that \(\Theta_{h}\mathbf{v}(z)\) is defined on a vertex \(z\in\omega_{z}\) that coincides with one of the degrees of freedom needed to define a function of \(\mathrm{Y}_{h}\). Then, \(\Theta_{h}\mathbf{v}(z)\) is computed by averaging the sum of the integrals of \(\mathbf{v}\in\mathbf{Q}\) over all the elements sharing this vertex. Let us recall the properties that \(\Theta_{h}\) satisfy (see [18, Lemma 3.2, Theorem 3.3]). **Lemma 4.1** (Properties of the postprocessing operator).: _The operator \(\Theta_{h}\) defined above satisfies the following:_ 1. _For_ \(\mathbf{u}\in[\mathrm{H}^{1+s}(\Omega)]^{n}\) _with_ \(s>0\) _as in Theorem_ 2.1 _and_ \(T\in\mathcal{T}_{h}\)_, there holds_ \(\|\Theta_{h}\mathbf{u}-\mathbf{u}\|_{0,T}\lesssim h_{T}^{1+s}\|\mathbf{u}\|_{1+s,\omega_{T}}\)_;_ 2. \(\Theta_{h}\mathcal{P}_{h}\mathbf{v}=\Theta_{h}\mathbf{v}\)_;_ 3. \(\|\Theta_{h}\mathbf{v}\|_{\mathbf{Q}}\lesssim\|\mathbf{v}\|_{\mathbf{Q}}\) _for all_ \(\mathbf{v}\in\mathbf{Q}\)_._ Also, we have the following approximation result. **Lemma 4.2**.: _Let \((\lambda,((\mathbf{\sigma},p),\mathbf{u}))\) and \((\lambda_{h},((\mathbf{\sigma}_{h},p_{h}),\mathbf{u}_{h}))\) be solutions of Problems (2.5)-(2.6) and (3.15)-(3.16), respectively, with \(\|\mathbf{u}\|_{0,\Omega}=\|\mathbf{u}_{h}\|_{0,\Omega}=1\). Then, there holds_ \[\|\mathcal{P}_{h}\mathbf{u}-\mathbf{u}_{h}\|_{0,\Omega}\lesssim h^{s}\left(\|\mathbf{ \sigma}-\mathbf{\sigma}_{h}\|_{0,\Omega}+\|p-p_{h}\|_{0,\Omega}+\|\mathbf{u}-\mathbf{u}_{ h}\|_{0,\Omega}\right),\] _where \(s>0\) and the hidden constant is independent of \(h\)._ With Lemmas 4.2 and 4.1 at hand, have the following superconvergence result for \(\Theta_{h}\) (see [18, Theorem 3.3] for the proof). **Lemma 4.3** (superconvergence).: _For \(h\) small enough, there holds_ \[\|\Theta_{h}\mathbf{u}_{h}-\mathbf{u}\|_{0,\Omega}\lesssim h^{s}\left(\|\mathbf{\sigma}- \mathbf{\sigma}_{h}\|_{0,\Omega}+\|p-p_{h}\|_{0,\Omega}+\|\mathbf{u}-\mathbf{u}_{h}\|_{0, \Omega}\right)+\|\Theta_{h}\mathbf{u}-\mathbf{u}\|_{0,\Omega},\] _where the hidden constant is independent of \(h\)._ The following auxiliary results, available in [13], are necessary in our forthcoming analysis. ### Technical tools To perform the analysis, we recall two key properties that are needed. First, let us consider the operator \(I_{h}:\mathrm{H}^{1}(\Omega)\to\mathscr{C}_{I}\), where \(\mathscr{C}_{I}:=\{v\in C(\bar{\Omega}):v|_{T}\in\mathrm{P}_{1}(T)\;\;\forall T \in\mathcal{T}_{h}\}\) is the Clement interpolant of degree \(k=1\) (see [19, Chapter 2.]). Similarly, we define \(\mathbf{I}_{h}:[\mathrm{H}^{1}(\Omega)]^{n}\to[\mathscr{C}_{I}]^{n}=\mathrm{Y}_{h}\) as the vectorial version of \(I_{h}\). We now establish the following lemma, which states the local approximation properties of \(I_{h}\). **Lemma 4.4**.: _For all \(v\in\mathrm{H}^{1}(\Omega)\) there holds_ \[\|v-I_{h}v\|_{0,T}\lesssim h_{T}\|v\|_{1,\omega_{T}}\quad\forall T\in\mathcal{ T}_{h},\] _and_ \[\|v-I_{h}v\|_{0,e}\lesssim h_{e}^{1/2}\|v\|_{1,\omega_{e}}\quad\forall e\in \mathcal{E}_{h},\] _where \(\omega_{T}:=\{T^{\prime}\in\mathcal{T}_{h}:T^{\prime}\text{ and }T\text{ share a facet}\}\), \(\omega_{e}:=\{T^{\prime}\in\mathcal{T}_{h}:e\in\mathcal{E}_{T^{\prime}}\}\), and the hidden constants are independent of \(h\)._ Secondly, the following Helmoltz decomposition holds (see [13, Lemma 4.3]). **Lemma 4.5**.: _For each \(\mathbf{\tau}\in\mathbb{H}(\mathbf{div},\Omega)\) there exist \(\mathbf{z}\in[\mathrm{H}^{2}(\Omega)]^{n}\) and \(\mathbf{\chi}\in\mathbb{H}^{1}(\Omega)\) such that_ \[\mathbf{\tau}=\nabla\mathbf{z}+\mathbf{curl}\mathbf{\chi}\quad\text{ in }\Omega\quad \text{ and }\quad\|\mathbf{z}\|_{2,\Omega}+\|\mathbf{\chi}\|_{1,\Omega}\lesssim\|\mathbf{\tau}\|_{ \mathbf{div},\Omega},\] _where the hidden constant independent of all the foregoing variables._ ### The local and global error indicators Now we present the local indicators for our problem. We need to remark that the reduced and full problems are not equivalent, and hence, each formulation have a particular local indicator. Let us present the indicator for the reduced discrete eigenvalue problem \[\theta_{T}^{2}:=\|\Theta_{h}\mathbf{u}_{h}-\mathbf{u}_{h}\|_{0,T}^{2}+h_ {T}^{2}\left\|\mathbf{curl}\;\left\{\frac{1}{2\mu}\mathbf{\sigma}_{h}^{d}\right\} \right\|_{0,T}^{2}+h_{T}^{2}\left\|\nabla\mathbf{u}_{h}-\frac{1}{2\mu}\mathbf{\sigma} _{h}^{d}\right\|_{0,T}^{2}\\ +\sum_{e\in\mathcal{E}(T)\cap\mathcal{E}_{h}(\Omega)}h_{e}\left\| \left[\frac{1}{2\mu}\mathbf{\sigma}_{h}^{d}\times\mathbf{n}_{e}\right]\right\|_{0,e}^{ 2}+\sum_{e\in\mathcal{E}(T)\cap\mathcal{E}_{h}(\partial\Omega)}h_{e}\left\| \frac{1}{2\mu}\mathbf{\sigma}_{h}^{d}\times\mathbf{n}_{e}\right\|_{0,e}^{2}, \tag{4.19}\] and the global estimator is defined by \[\theta:=\left\{\sum_{T\in\mathcal{T}_{h}}\theta_{T}^{2}\right\}^{1/2}. \tag{4.20}\] Now, the local indicator for the complete formulation incorporates the contributions of the pressure, together with (4.19) as follows \[\eta_{T}^{2}:=\theta_{T}^{2}+\left\|p_{h}+\frac{1}{n}\operatorname{ tr}(\mathbf{\sigma}_{h})\right\|_{0,T}^{2}+h_{T}^{2}\left\|\mathbf{curl}\; \left[\left(p_{h}+\frac{1}{n}\operatorname{tr}(\mathbf{\sigma}_{h})\right) \mathbb{I}\right]\right\|_{0,T}^{2}\\ +\sum_{e\in\mathcal{E}(T)\cap\mathcal{E}_{h}(\Omega)}h_{e}\left\| \left[\left[\left(p_{h}+\frac{1}{n}\operatorname{tr}(\mathbf{\sigma}_{h})\right) \mathbb{I}\right]\times\mathbf{n}_{e}\right]\right\|_{0,e}^{2}\\ +\sum_{e\in\mathcal{E}(T)\cap\mathcal{E}_{h}(\partial\Omega)}h_{ e}\left\|\left[\left(p_{h}+\frac{1}{n}\operatorname{tr}(\mathbf{\sigma}_{h})\right) \mathbb{I}\right]\times\mathbf{n}_{e}\right\|_{0,e}^{2}, \tag{4.21}\] and hence, the global estimator for the complete problem is \[\eta:=\left\{\sum_{T\in\mathcal{T}_{h}}\eta_{T}^{2}\right\}^{1/2}. \tag{4.22}\] It is important to notice that for \(n=2\) the tangential traces are taken as \(\boldsymbol{\sigma}_{h}^{\boldsymbol{\mathrm{d}}}\mathbf{t}_{e}/(2\mu)\) and \((p_{h}+\operatorname{tr}(\boldsymbol{\sigma}_{h})/n)\,\mathbf{t}_{e}\) for the estimators (4.19) and (4.21), respectively, where \(\mathbf{t}\) is the corresponding unit tangential vector along the edge \(e\). Now our task is to analyze the reliability and efficiency of (4.20) and (4.22). Let us claim that our attention will be focused on the complete estimator (4.22), since for (4.20) the computations are straightforward from the complete case. ### Reliability The goal of this section is to derive an upper bound for (4.22). Let us begin with the following result. **Lemma 4.6**.: _Let \((\lambda,((\boldsymbol{\sigma},p),\boldsymbol{u}))\in\mathbb{R}\times\mathbb{ H}\times\mathbf{Q}\) be the solution of (2.5)-(2.6) and let \((\lambda_{h},((\boldsymbol{\sigma}_{h},p_{h}),\boldsymbol{u}_{h}))\in \mathbb{R}\times\mathbb{H}_{h}\times\mathbf{Q}_{h}\) be its finite element approximation, given as the solution of (3.15)-(3.16). Then for all \(\boldsymbol{\tau}\in\mathbb{H}_{0}\), we have_ (4.23) \[\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{\mathbf{div}, \Omega}+\|p-p_{h}\|_{0,\Omega}+\|\boldsymbol{u}-\boldsymbol{u}_{h}\|_{0,\Omega}\] \[\qquad\qquad\qquad\lesssim\sup_{\begin{subarray}{c}( \boldsymbol{\tau},q)\in\mathbb{H}\\ (\boldsymbol{\tau},q)\neq(\boldsymbol{0},0)\end{subarray}}\frac{-a(( \boldsymbol{\sigma}_{h},p_{h}),(\boldsymbol{\tau},q))-b(\boldsymbol{\tau}, \boldsymbol{u}_{h})}{\|(\boldsymbol{\tau},q)\|_{\mathbf{div},\Omega}}\] \[\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad \qquad\ then, the high order term satisfy \[\text{h.o.t}\lesssim h^{s}\left(\|\boldsymbol{\sigma}-\boldsymbol{ \sigma}_{h}\|_{0,\Omega}+\|p-p_{h}\|_{0,\Omega}+\|\boldsymbol{u}-\boldsymbol{u }_{h}\|_{0,\Omega}\right)\\ +\|\boldsymbol{u}-\Theta_{h}\boldsymbol{u}\|_{0,\Omega}\lesssim h^ {2s}, \tag{4.24}\] where the hidden constant is independent of the mesh size and \(s>0\) as in Theorem 2.1. To bound the supremum in (4.23), we proceed analogously as in [14, 24]. Indeed, considering the decomposition \(\boldsymbol{\tau}=\nabla\boldsymbol{z}+\text{{\bf curl}}\,\boldsymbol{\chi}\) given by Lemma 4.5, where \(\boldsymbol{\tau}\in\mathbb{H}_{0}\), we notice that is possible to define \(\boldsymbol{\tau}_{h}\in\mathbb{H}_{0,h}\) through a discrete Helmholtz decomposition by \[\boldsymbol{\tau}_{h}:=\boldsymbol{\Pi}_{h}\left(\nabla\boldsymbol{z}\right)+ \text{{\bf curl}}\left(\boldsymbol{\chi}_{h}\right)-d_{h}\mathbb{I},\] where \(\boldsymbol{\chi}_{h}:=\left(\boldsymbol{\chi}_{1h},\ldots,\boldsymbol{\chi }_{nh}\right)^{\text{t}}\), with \(\boldsymbol{\chi}_{ih}:=\boldsymbol{I}_{h}(\boldsymbol{\chi}_{i})\) for \(i=\{1,...,n\}\), \(\boldsymbol{\Pi}_{h}\) is the Raviart-Thomas interpolation operator, satisfying (3.10)-(3.14) and the constant \(d_{h}\) is chosen as \[d_{h}:=\frac{1}{n|\Omega|}\int_{\Omega}\text{tr}(\boldsymbol{\tau}_{h})=- \frac{1}{n|\Omega|}\int_{\Omega}\text{tr}\left(\nabla\boldsymbol{z}-\boldsymbol {\Pi}_{h}\left(\nabla\boldsymbol{z}\right)+\text{{\bf curl}}\left(\boldsymbol {\chi}-\boldsymbol{\chi}_{h}\right)\right).\] Following the arguments provided by [22, 24] for \(\boldsymbol{\sigma}_{h},\in\mathbb{H}_{0,h}\), setting \(\boldsymbol{\xi}=\boldsymbol{\tau}-\boldsymbol{\tau}_{h}\), and with the aid the Helmholtz decomposition, we obtain the identity \[-\left[a((\boldsymbol{\sigma}_{h},p_{h}),(\boldsymbol{\tau},q))+b (\boldsymbol{\tau},\boldsymbol{u}_{h})\right]=-\left[a((\boldsymbol{\sigma}_{ h},p_{h}),(\boldsymbol{\xi},q))+b(\boldsymbol{\xi},\boldsymbol{u}_{h})\right]\\ =-a((\boldsymbol{\sigma}_{h},p_{h}),(\boldsymbol{\xi},q)),\] Hence, we have \[a((\boldsymbol{\sigma}_{h},p_{h}),(\boldsymbol{\tau},q))+b( \boldsymbol{\tau},\boldsymbol{u}_{h})=\underbrace{a((\boldsymbol{\sigma}_{h}, p_{h}),(\nabla\boldsymbol{z}-\boldsymbol{\Pi}_{h}(\nabla\boldsymbol{z}),q))}_{ \boldsymbol{\Pi}}\\ +\underbrace{a((\boldsymbol{\sigma}_{h},p_{h}),(\text{{\bf curl} }\left(\boldsymbol{\chi}-\boldsymbol{\chi}_{h}\right),q))}_{\boldsymbol{\Pi}}. \tag{4.25}\] Now, each contribution \(\boldsymbol{\Pi}\) and \(\boldsymbol{\Pi}\) is controlled using the arguments provided by [14, Section 4.1] and [24, Lemmas 4.6 and 4.7]. Therefore, we obtain that \[|\boldsymbol{\Pi}|\lesssim\left\{\sum_{T\in\mathcal{T}_{h}}\eta_{T}^{2} \right\}^{1/2}\|((\boldsymbol{\tau},q),\boldsymbol{v})\|_{\mathbb{H}\times \mathbf{Q}}, \tag{4.26}\] and \[|\boldsymbol{\Pi}|\lesssim\left\{\sum_{T\in\mathcal{T}_{h}}\eta_{T}^{2} \right\}^{1/2}\|((\boldsymbol{\tau},q),\boldsymbol{v})\|_{\mathbb{H}\times \mathbf{Q}}. \tag{4.27}\] Since the calculations follow directly from these two references, we skip the details. As a consequence of Lemma 3.1, Lemma 4.6, (4.24), (4.25), estimates (4.26)-(4.27), and the definition of the local estimator \(\eta_{T}\), we have the following result. **Proposition 4.1**.: _Let \((\lambda,(\boldsymbol{\sigma},p),\boldsymbol{u})\in\mathbb{R}\times\mathbb{H} \times\mathbf{Q}\) be the solution of (2.5)-(2.6) and let \((\lambda_{h},(\boldsymbol{\sigma}_{h},p_{h}),\boldsymbol{u}_{h})\in\mathbb{R }\times\mathbb{H}_{h}\times\mathbf{Q}_{h}\) solution of (3.15)-(3.16). Then, there exists \(h_{0}\) for all \(h<h_{0}\), there holds._ \[\|\mathbf{\sigma}-\mathbf{\sigma}_{h}\|_{\mathbf{div},\Omega}+\|p-p_{h}\|_{0,\Omega}+\|\mathbf{u}-\mathbf{u}_{h}\|_{0,\Omega} \lesssim\left\{\sum_{T\in\mathcal{T}_{h}}\eta_{T}^{2}\right\}^{1/ 2}+\|\mathbf{u}-\Theta_{h}\mathbf{u}\|_{0,\Omega},\] \[|\lambda_{h}-\lambda| \lesssim\sum_{T\in\mathcal{T}_{h}}\eta_{T}^{2}+\|\mathbf{u}-\Theta_{ h}\mathbf{u}\|_{0,\Omega}^{2},\] _where the hidden constant is independent of \(h\)._ A similar result for the estimator \(\theta\) is directly established if the pseudostress-velocity problem is considered. Therefore, the reliability of our estimators is guaranteed. ### Efficiency The following task is to obtain a lower bound for the local indicator (4.21), which is obtained with a localization technique based in bubble functions, together with inverse inequalities. We begin by introducing the bubble functions for two and three dimensional elements. Given \(T\in\mathcal{T}_{h}\) and \(e\in\mathcal{E}(T)\), we let \(\psi_{T}\) and \(\psi_{e}\) be the usual element-bubble and facet-bubble functions, respectively (see [30] for more details), satisfying the following properties 1. \(\psi_{T}\in\mathrm{P}_{\ell}(T)\), with \(\ell=3\) for 2D or \(\ell=4\) for 3D, \(\mathrm{supp}(\psi_{T})\subset T\), \(\psi_{T}=0\) on \(\partial T\) and \(0\leq\psi_{T}\leq 1\) in \(T\); 2. \(\psi_{e}|_{T}\in\mathrm{P}_{\ell}(T)\), with \(\ell=2\) for 2D or \(\ell=3\) for 3D, \(\mathrm{supp}(\psi_{e})\subset\omega_{e}:=\cup\{T^{\prime}\in\mathcal{T}_{h}\,: \,e\in\mathcal{E}(T^{\prime})\}\), \(\psi_{e}=0\) on \(\partial T\setminus e\) and \(0\leq\psi_{e}\leq 1\) in \(\omega_{e}\). The following result for bubble functions will be needed (see for instance [29, Lemma 1.3]). **Lemma 4.7** (Bubble function properties).: _Given \(k\in\mathbb{N}\cup\{0\}\), and for each \(T\in\mathcal{T}_{h}\) and \(e\in\mathcal{E}(T)\), the hold_ \[\|\psi_{T}q\|_{0,T}^{2}\leq\|q\|_{0,T}^{2}\lesssim\|\psi_{T}^{1/2}q\|_{0,T}^{ 2}\quad\forall q\in\mathbb{P}_{k}(T),\] \[\|\psi_{e}L(p)\|_{0,e}^{2}\leq\|p\|_{0,e}^{2}\lesssim\|\psi_{e}^{1/2}p\|_{0,e }^{2}\quad\forall p\in\mathbb{P}_{k}(e),\] _and_ \[h_{e}\|p\|_{0,e}^{2}\lesssim\|\psi_{e}^{1/2}L(p)\|_{0,T}^{2}\lesssim h_{e}\|p \|_{0,e}^{2}\quad\forall p\in\mathbb{P}_{k}(e),\] _where \(L\) is the extension operator defined by \(L:C(e)\to C(T)\) where \(C(e)\) and \(C(T)\) are the spaces of continuous functions defined in \(e\) and \(T\), respectively. Also, \(L(p)\in\mathbb{P}_{k}(T)\) and \(L(p)|_{e}=p\) for all \(p\in\mathbb{P}_{k}(e)\) and where hidden constants depend on \(k\) and the shape regularity of the mesh (minimum angle condition)._ We recall the following inverse inequality, proved in [11, Theorem 3.2.6]. **Lemma 4.8** (Inverse inequality).: _Let \(l,m\in\mathbb{N}\cup\{0\}\) such that \(l\leq m\). Then, for each \(T\in\mathcal{T}_{h}\) there holds_ \[|q|_{m,T}\lesssim h_{T}^{l-m}|q|_{l,T}\quad\forall q\in\mathbb{P}_{k}(T),\] _where the hidden constant depends on \(k,l,m\) and the shape regularity of the partition._ We also invoke the following two results. The first was proved in [3, Lemma 4.3] and [13, Lemma 4.9] for the two and three dimensional cases, respectively. The second was proved in [13, Lemma 4.10]. **Lemma 4.9**.: _Let \(\boldsymbol{\tau}_{h}\in\mathbb{L}^{2}(\Omega)\) be a piecewise polynomial of degree \(k\geq 0\) on each \(T\in\mathcal{T}_{h}\) such that approximates \(\boldsymbol{\tau}\in\mathbb{L}^{2}(\Omega)\), where \(\mathbf{curl}(\boldsymbol{\tau})=\mathbf{0}\) on each \(T\in\mathcal{T}_{h}\). Then, there holds_ \[\|\mathbf{curl}(\boldsymbol{\tau}_{h})\|_{0,T}\lesssim h_{T}^{-1}\|\boldsymbol{ \tau}-\boldsymbol{\tau}_{h}\|_{0,T}\quad\forall T\in\mathcal{T}_{h},\] _where the hidden constant is independent of \(h\)._ **Lemma 4.10**.: _Let \(\boldsymbol{\tau}_{h}\in\mathbb{L}^{2}(\Omega)\) be a piecewise polynomial of degree \(k\geq 0\) on each \(T\in\mathcal{T}_{h}\) and let \(\boldsymbol{\tau}\in\mathbb{L}^{2}(\Omega)\) be such that \(\mathbf{curl}(\boldsymbol{\tau})=\mathbf{0})\) in \(\Omega\). Then, there holds_ \[\left\|\left[\boldsymbol{\tau}_{h}\times\boldsymbol{n}_{e}\right]\right\|_{0, e}\lesssim h_{e}^{-1/2}\|\boldsymbol{\tau}-\boldsymbol{\tau}_{h}\|_{0,\omega_{e}} \quad\forall e\in\mathcal{E}(\Omega),\] _where the hidden constant is independent of \(h\)._ Now our task is to bound each of the contributions of \(\eta_{T}\) in (4.21). We begin with the term \[h_{T}^{2}\left\|\mathbf{curl}\,\left\{\frac{1}{2\mu}\boldsymbol{\sigma}_{h}^{d }\right\}\right\|_{0,T}^{2}.\] Let us define \(\boldsymbol{\tau}=\boldsymbol{\sigma}^{\text{d}}/(2\mu)\). Clearly \(\mathbf{curl}\left(\boldsymbol{\tau}\right)=\mathbf{0}\) since \(\nabla\boldsymbol{u}=\boldsymbol{\sigma}^{\text{d}}/(2\mu)\). Define \(\boldsymbol{\tau}_{h}:=\boldsymbol{\sigma}_{h}^{\text{d}}/(2\mu)\). Hence it is easy to obtain \[\|\boldsymbol{\tau}-\boldsymbol{\tau}_{h}\|_{0,T}\leq\frac{\sqrt{n}}{2\mu}\| \boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{0,T}.\] Then, applying Lemma 4.9 for \(\boldsymbol{\tau}\) defined as above, we obtain that \[h_{T}^{2}\left\|\mathbf{curl}\,\left\{\frac{1}{2\mu}\boldsymbol{\sigma}_{h}^{ d}\right\}\right\|_{0,T}^{2}\lesssim\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{0,T}^{2}. \tag{4.28}\] Now, for the term \[h_{T}^{2}\left\|\nabla\boldsymbol{u}_{h}-\frac{1}{2\mu}\boldsymbol{\sigma}_{h} ^{\text{d}}\right\|_{0,T}^{2},\] given an element \(T\in\mathcal{T}_{h}\), let us define \(\Upsilon_{T}:=\nabla\boldsymbol{u}_{h}-\boldsymbol{\chi}_{h}\) where \(\boldsymbol{\chi}_{h}:=\boldsymbol{\sigma}_{h}^{\text{d}}/(2\mu).\) Also we set \(\boldsymbol{\chi}:=\boldsymbol{\sigma}^{\text{d}}/(2\mu).\) Invoking the estimate \(\|\operatorname{tr}(\boldsymbol{\sigma})\|_{0,T}\leq\sqrt{n}\|\boldsymbol{ \sigma}\|_{0,T}\) we obtain \[\|\boldsymbol{\chi}-\boldsymbol{\chi}_{h}\|_{0,T}\leq\frac{1}{2\mu}\left( \frac{n+\sqrt{n}}{n}\right)\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{ 0,T}.\] Since \(\boldsymbol{\sigma}-2\mu\nabla\boldsymbol{u}+p\mathbbm{1}=\mathbf{0}\) (cf. (2.1)), it is clear that \(\nabla\boldsymbol{u}=\boldsymbol{\chi}\). Then, invoking the bubble function \(\psi_{T}\), integrating by parts, Cauchy-Schwarz inequality, Lemmas 4.7 and 4.8, and the properties of \(\psi_{T}\) given by Lemma 4.7, we obtain \[\|\Upsilon_{T}\|_{0,T}^{2} \lesssim\|\psi_{T}^{1/2}\Upsilon_{T}\|_{0,T}^{2}=\int_{T}\psi_{T} \Upsilon_{T}:\left(\nabla(\boldsymbol{u}_{h}-\boldsymbol{u})+(\boldsymbol{ \chi}-\boldsymbol{\chi}_{h})\right)\] \[=\int_{T}\mathbf{div}(\psi_{T}\Upsilon_{T})\cdot(\boldsymbol{u}- \boldsymbol{u}_{h})+\int_{T}\psi_{T}\Upsilon_{T}:\left(\boldsymbol{\chi}- \boldsymbol{\chi}_{h}\right)\] \[\lesssim\left\{h_{T}^{-1}\|\boldsymbol{u}-\boldsymbol{u}_{h}\|_{0,T}+\frac{n+\sqrt{n}}{2\mu n}\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{ 0,T}\right\}\|\Upsilon_{T}\|_{0,T}.\] Hence \[h_{T}^{2}\left\|\nabla\boldsymbol{u}_{h}-\frac{1}{2\mu}\boldsymbol{\sigma}_{h} ^{\text{d}}\right\|_{0,T}^{2}\lesssim\|\boldsymbol{u}-\boldsymbol{u}_{h}\|_{0,T}^{2}+h_{T}^{2}\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{0,T}^{2}, \tag{4.29}\] where the hidden constant is independent of \(h\). Now we study the jump term \[h_{e}\left\|\left\|\left\|\frac{1}{2\mu}\boldsymbol{\sigma}_{h}^{d}\times \boldsymbol{n}_{e}\right\|\right\|_{0,e}^{2}.\] To do this task, set \(\boldsymbol{\tau}_{h}=\boldsymbol{\sigma}_{h}^{\mathsf{d}}/(2\mu)\) and \(\boldsymbol{\tau}=\boldsymbol{\sigma}^{\mathsf{d}}/(2\mu)\) in Lemma 4.10 and from the definition of the deviator tensor, immediately we conclude \[h_{e}\left\|\left\|\left\|\frac{1}{2\mu}\boldsymbol{\sigma}_{h}^{d}\times \boldsymbol{n}_{e}\right\|\right\|_{0,e}^{2}\lesssim\|\boldsymbol{\sigma}- \boldsymbol{\sigma}_{h}\|_{0,\omega_{e}}^{2}. \tag{4.30}\] All the previous terms are related to \(\theta_{T}\), which is a part of \(\eta_{T}\). Now we bound the rest of the terms. We begin with \[h_{T}^{2}\left\|\mathbf{curl}\,\left(p_{h}+\frac{1}{n}\operatorname{tr}( \boldsymbol{\sigma}_{h})\mathbb{I}\right)\right\|_{0,T}^{2}.\] In fact, setting \(\boldsymbol{\tau}_{h}=p_{h}+(1/n)\operatorname{tr}(\boldsymbol{\sigma}_{h}) \mathbb{I}\) and \(\boldsymbol{\tau}=p+(1/n)\operatorname{tr}(\boldsymbol{\sigma})\mathbb{I}\) on Lemma 4.9 and noticing that \[\|\boldsymbol{\tau}-\boldsymbol{\tau}_{h}\|_{0,T}\lesssim\|p-p_{h}\|_{0,T}+\| \boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{0,T},\] we immediately obtain \[h_{T}^{2}\left\|\mathbf{curl}\,\left(p_{h}+\frac{1}{n}\operatorname{tr}( \boldsymbol{\sigma}_{h})\mathbb{I}\right)\right\|_{0,T}^{2}\lesssim\|p-p_{h} \|_{0,T}^{2}+\|\boldsymbol{\sigma}-\boldsymbol{\sigma}_{h}\|_{0,T}^{2}. \tag{4.31}\] Then, gathering (4.28), (4.29), (4.30) and (4.31) we prove the following result. **Theorem 4.1** (Efficiency).: _The following estimate holds_ \[\theta^{2}:=\sum_{T\in\mathcal{T}_{h}}\theta_{T}^{2}\lesssim(\|\boldsymbol{u} -\boldsymbol{u}_{h}\|_{0,\Omega}^{2}+\|\boldsymbol{\sigma}-\boldsymbol{\sigma }_{h}\|_{0,\Omega}^{2}+\text{h.o.t.}),\] _and hence_ \[\eta^{2}:=\sum_{T\in\mathcal{T}_{h}}\eta_{T}^{2}\lesssim\left(\|\boldsymbol{u }-\boldsymbol{u}_{h}\|_{0,\Omega}^{2}+\|\boldsymbol{\sigma}-\boldsymbol{ \sigma}_{h}\|_{0,\Omega}^{2}+\|p-p_{h}\|_{0,\Omega}^{2}+\text{h.o.t}\right),\] _where the hidden constants are independent of \(h\) and the discrete solutions._ ## 5. Numerical experiments The aim of this section is to confirm, computationally, that the proposed method works correctly and delivers an accurate approximation of the spectrum of \(\boldsymbol{T}\). Moreover, we will confirm the theoretical results with the computation of the convergence order by means of a least-square fitting or a sufficiently accurate solution. The reported results have been obtained with a FEniCS code [20], together with the mesh generator Gmsh [16]. Throughout this section, we denote by \(N\) the number of degrees of freedom and \(\lambda\) the eigenvalues. We denote by \(\mathtt{err}_{f}(\lambda_{i})\) and \(\mathtt{err}_{r}(\lambda_{i})\) the errors on the \(i\)-th eigenvalue using the pseudostresss-pressure-velocity and pseudostress-velocity scheme, respectively, whereas the effectivity indexes with respect to \(\eta\) or \(\theta\) and the eigenvalue \(\lambda_{i}\) are defined by \[\mathtt{eff}_{f}(\lambda_{i}):=\frac{\mathtt{err}_{f}(\lambda_{i})}{\eta^{2}}, \quad\mathtt{eff}_{r}(\lambda_{i}):=\frac{\mathtt{err}_{r}(\lambda_{i})}{\theta ^{2}}.\] In order to apply the adaptive finite element method, we use blue-green marking strategy to refine each \(T^{\prime}\in\mathcal{T}_{h}\) whose indicator \(\beta_{T^{\prime}}\) satisfies \[\beta_{T^{\prime}}\geq 0.5\max\{\beta_{T}\,:\,T\in\mathcal{T}_{h}\},\] where \(\beta_{T}\) corresponds to either local estimator \(\theta_{T}\) or \(\eta_{T}\). We divide each numerical tests in two parts: one related to the performance of the estimator (4.20) and the second for (4.22). #### 5.0.1. Test 1 Comparison between finite element familiesThe aim of this tests is to show the performance of the adaptive scheme when the \(\mathbb{RT}_{0}\) and the lowest order \(\mathbb{BDM}\) families are considered to approximate the pseudostress tensor. Note that in [21] it is stated that \(\mathbb{BDM}\) results in more stable uniform approximations, however, the computational cost makes the work with \(\mathbb{RT}_{0}\) the most suitable. The domain for this test is an L-shaped \(\Omega=(-1,1)\times(-1,1)\backslash((-1,0)\times(-1,0))\). In figure 1 we show the initial mesh. Note that for this problem we have a re-entrant corner in \((0,0)\), so the expected order of convergence for the eigenvalues is at least \(\mathcal{O}(h^{r})\), with \(r\geq 1.2\). For this test we have performed \(20\) adaptive iterations in order to observe the convergence rate, as well as the refinement around the singularity. Figure 2 shows the error curves in the adaptive refinements. An optimal convergence rate \(\mathcal{O}(N^{-1})\simeq\mathcal{O}(h^{2})\) is clearly observed. In addition, we note that the adaptive iterations using \(\mathbb{BDM}\) mark much fewer elements than with \(\mathbb{RT}\). This is explained by the additional degrees of freedom that \(\mathbb{BDM}\) has, achieving better approximations in each iteration, thus reducing the contribution of each local estimator. However, the error curves show more pronounced oscillations with respect to the \(\mathbb{RT}_{0}\) approach, probably caused by an under-prediction in the local residual contributions. It is for this reason that in the rest of the experiments we will use \(\mathbb{RT}_{0}\) to approximate \(\boldsymbol{\sigma}_{h}\). We finish the test with Figure 3, where we observe the meshes at iteration \(15\) when both families are used. The difference in the number of refined elements is evident. #### 5.0.2. Test 2 The T-shaped domainThis test aims to confirm that our estimators are able to detect and refine close to the singularity of the domain in order to recover the optimal order of convergence. The domain is defined as \[\Omega:=(-1,1)^{2}\backslash\big{(}(-1,-1/3)\times(-1,1/2)\cup(1/3,1)\times(- 1,1/2)\big{)}.\] Figure 1. Test 1. Initial mesh configuration. Figure 3. Test 1. Adaptive meshes in the fifteenth iteration using \(\mathbb{RT}_{0}\) (left column) and \(\mathbb{BDM}\) (right column) to approximate \(\boldsymbol{\sigma}_{h}\). Top row: meshes using the estimator \(\theta\). Bottom row: meshes using estimator \(\eta\). Figure 2. Test 1. Error curves when using \(\theta\) and \(\eta\) as estimators in the two dimensional L-shaped domain, and using \(\mathbb{RT}_{0}\) and \(\mathbb{BDM}\) to approximate \(\boldsymbol{\sigma}_{h}\). In Figure 4 we show the initial mesh for this domain. Note that for this geometrical configuration we have two re-entrant corners in \((-1/3,1/2)\) and \((1/3,1/2)\), so the expected order of convergence for the lowest order eigenvalue is roughly \(\mathcal{O}(N^{-0.66})\simeq\mathcal{O}(h^{1.32})\) (see, for instance, [21]). Let us remark that on this test we have performed 15 adaptive iterations in order to observe the convergence rate, as well as the refinement around the singularities. Table 1 shows the comparative of the uniform and adaptive refinement when using both numerical schemes. It notes that the computed order of convergence using uniform refinements is approximately \(\mathcal{O}(h^{1.32})\). Also, we observe that with a fraction of \(1/7\) of the degrees of freedom in the uniform refinements, the adaptive numerical schemes approximate the extrapolated eigenvalue with high accuracy. In Figure 5 (top row) we observe several intermediate meshes when we solve the eigenvalue problem using the estimator \(\theta\) and \(\eta\). Note that the estimators refine near the high pressure gradients. Error curves of the two numerical schemes are observed in Figure 6, where we observe that the optimal order of convergence is recovered. In Table 2 a comparison between the errors and effectivity indexes is reported. Here, we note that both schemes gives similar error behavior, whereas the estimators values suggest that the contribution of the residuals in the pseudostress-pressure-velocity will yield to a different marking of the elements near the singularity. This is contrasted with the adaptive meshes in Figure 5, where we observe that the estimator \(\eta\) marks more elements around the singularities than \(\theta\). We finish this test by showing the lowest computed eigenfunctions when using the pseudostress-pressure-velocity scheme. The velocity field and pressure contour lines are depicted in Figure 7. \begin{table} \begin{tabular}{c c c|c c c} \hline \hline \multicolumn{3}{c|}{Pseudostress-velocity} & \multicolumn{3}{c}{Pseudostress-pressure-velocity} \\ \hline err\({}_{r}(\lambda_{h1})\) & \(\theta^{2}\) & eff\({}_{r}(\lambda_{h1})\) & err\({}_{f}(\lambda_{h1})\) & \(\eta^{2}\) & eff\({}_{f}(\lambda_{h1})\) \\ \hline 2.18027e+01 & 1.71691e+02 & 1.26988e-01 & 2.29560e+01 & 2.01020e+02 & 1.14198e-01 \\ 1.01169e+01 & 1.00435e+02 & 1.00730e-01 & 1.21610e+01 & 1.17826e+02 & 1.03212e-01 \\ 5.23219e+00 & 6.76280e+01 & 7.73672e-02 & 6.01486e+00 & 7.64312e+01 & 7.86964e-02 \\ 2.64269e+00 & 3.61802e+01 & 7.30426e-02 & 3.03209e+00 & 4.05116e+01 & 7.48449e-02 \\ 1.34298e+00 & 1.87337e+01 & 7.16879e-02 & 1.89993e+00 & 2.63974e+01 & 7.19739e-02 \\ 8.69150e-01 & 1.31928e+01 & 6.58808e-02 & 1.32213e+00 & 1.99707e+01 & 6.62036e-02 \\ 4.87092e-01 & 8.55359e+00 & 5.69459e-02 & 6.88721e-01 & 1.25131e+01 & 5.50399e-02 \\ 3.41569e-01 & 5.61139e+00 & 6.08708e-02 & 5.17553e-01 & 8.09004e+00 & 6.39740e-02 \\ 2.33812e-01 & 4.08210e+00 & 5.72774e-02 & 3.30857e-01 & 5.65293e+00 & 5.85284e-02 \\ 1.53280e-01 & 2.93354e+00 & 5.22508e-02 & 2.27595e-01 & 4.16076e+00 & 5.47005e-02 \\ 9.84765e-02 & 1.87021e+00 & 5.26554e-02 & 1.42101e-01 & 2.62431e+00 & 5.41479e-02 \\ 6.96847e-02 & 1.31854e+00 & 5.28498e-02 & 9.23345e-02 & 1.73254e+00 & 5.32944e-02 \\ 4.76441e-02 & 9.63975e-01 & 4.94246e-02 & 6.38039e-02 & 1.28003e+00 & 4.98456e-02 \\ 3.00353e-02 & 6.64955e-01 & 4.51688e-02 & 4.41141e-02 & 8.84236e-01 & 4.98895e-02 \\ 1.91353e-02 & 4.40433e-01 & 4.34466e-02 & 2.76378e-02 & 5.70886e-01 & 4.84121e-02 \\ \hline \hline \end{tabular} \end{table} Table 2. Test 2: Computed errors, estimators and effectivity indexes on the adaptively refinement meshes for each numerical scheme. #### 5.0.3. Test 3 _3D L-shaped domain._ The goal of this test is to assess the performance of the numerical scheme when solving the eigenvalue problem in a three dimensional shape with a line singularity. The domain is an L shape given by \[\Omega:=(-1,1)\times(-1,1)\times(-1,0)\backslash\bigg{(}(-1,0)\times(-1,0)\times( -1,0)\bigg{)}.\] The domain presents a singularity on the line \((0,0,z)\), for \(z\in[-1,0]\), whose initial mesh is depicted in Figure 8. Hence, high gradients of the pressure, and consequently of the pseudostress are expected along this line (see Figure 11). In Table 3 we compare the performance of both numerical schemes. Both schemes shows that the adaptive scheme is capable to recover the optimal order of convergence \begin{table} \begin{tabular}{l c c c|l c c c} \hline \hline & \multicolumn{2}{c|}{Pseudostress-velocity} & \multicolumn{4}{c}{Pseudostress-pressure-velocity} \\ \hline & Uniform & \multicolumn{2}{c|}{Adaptive} & \multicolumn{2}{c}{Uniform} & \multicolumn{2}{c}{Adaptive} \\ \hline \(N\) & \(\lambda_{h1}\) & \(N\) & \(\lambda_{h1}\) & \(N\) & \(\lambda_{h1}\) & \(N\) & \(\lambda_{h1}\) \\ \hline 597 & 59.07677 & 597 & 59.07677 & 709 & 57.92345 & 709 & 57.92345 \\ 2313 & 73.04426 & 1113 & 70.76256 & 2761 & 72.62093 & 1291 & 68.71842 \\ 9105 & 77.95812 & 2125 & 75.64725 & 10897 & 77.83306 & 2517 & 74.86457 \\ 36129 & 79.73824 & 3779 & 78.23674 & 43297 & 79.70449 & 4887 & 77.84735 \\ 143937 & 80.40890 & 7477 & 79.53645 & 172609 & 80.40016 & 7145 & 78.97951 \\ 574593 & 80.67726 & 10609 & 80.01029 & 689281 & 80.67504 & 9495 & 79.55730 \\ 2296065 & 80.80075 & 16887 & 80.39234 & 2754817 & 80.80019 & 15637 & 80.19072 \\ & & 25239 & 80.53787 & & & 23815 & 80.36188 \\ & & 35005 & 80.64562 & & & 33865 & 80.54858 \\ & & 50231 & 80.72616 & & & 47179 & 80.65184 \\ & & 78023 & 80.78096 & & & 75235 & 80.73734 \\ & & 108877 & 80.80975 & & & 111191 & 80.78710 \\ & & 150463 & 80.83179 & & & 150976 & 80.81563 \\ & & 224137 & 80.84940 & & & 224587 & 80.83532 \\ & & 332507 & 80.86030 & & & 343874 & 80.85180 \\ \hline Order & \(\mathcal{O}(N^{-0.67})\) & Order & \(\mathcal{O}(N^{-1.10})\) & Order & \(\mathcal{O}(N^{-0.68})\) & Order & \(\mathcal{O}(N^{-1.09})\) \\ \(\lambda_{1}\) & 80.87944 & \(\lambda_{1}\) & 80.87944 & \(\lambda_{1}\) & 80.87944 & \(\lambda_{1}\) & 80.87944 \\ \hline \hline \end{tabular} \end{table} Table 1. Test 2: Comparison between the lowest computed eigenvalue in the pseudostress-velocity scheme using uniform and adaptive refinements. Figure 4. Test 2. Initial mesh configuration. Figure 5. Test 2. Intermediate adaptive meshes. Top row: meshes with 10609 and 50231 degrees of freedom using the estimator \(\theta\). Bottom row: meshes with 9495 and 47179 degrees of freedom using the estimator \(\eta\). Figure 6. Test 2. Error curves for \(\theta\) and \(\eta\) in the two dimensional T-shaped domain, compared with \(\mathcal{O}(N^{-1})\). \(\mathcal{O}(N^{-2/3})\), where \(\mathcal{O}(N^{-0.44})\) is the best order that we can expect when using uniform refinements. We remark that the computed convergence rate in this table has been obtained by excluding the first uniform and adaptive refinement. This is because the eigensolver has been configured with the shift as close as possible to the extrapolated eigenvalue. A different configuration or another eigensolver might yield a more accurate value for this first computation, without altering the trend shown here. For instance, in Figure 10 we show the error curves compared with the optimal convergence slope for each case. In table 4 we report the respective errors, estimators and effectivity indexes for each adaptive numerical scheme. We note that the estimators \(\theta\) and \(\eta\) behave like \(\mathcal{O}(N^{-2/3})\), hence the effectivity indexes remain bounded above and below. This confirms numerically that the proposed estimators are reliable and efficient, as predicted by the theory. On the other hand, we observe in Figure 9 some intermediate meshes obtained in the adaptive iteration using \(\theta\) and \(\eta\) estimators, respectively. We end the test by showing the computed velocity streamlines and pressure isosurfaces computed with the pseudostress-pressure-velocity model. Note the high pressure gradient along the line \((0,0,z)\). ## 6. Compliance with Ethical Standards The authors have no conflicts of interest to declare that are relevant to the content of this article. Figure 8. Test 3. Initial shape for the 3D L-shaped domain. Figure 7. Test 2. Lowest computed velocity field and pressure contour lines using the adaptive refinements and estimator \(\eta\).

2305.08099

Self-supervised Neural Factor Analysis for Disentangling Utterance-level Speech Representations

Self-supervised learning (SSL) speech models such as wav2vec and HuBERT have demonstrated state-of-the-art performance on automatic speech recognition (ASR) and proved to be extremely useful in low label-resource settings. However, the success of SSL models has yet to transfer to utterance-level tasks such as speaker, emotion, and language recognition, which still require supervised fine-tuning of the SSL models to obtain good performance. We argue that the problem is caused by the lack of disentangled representations and an utterance-level learning objective for these tasks. Inspired by how HuBERT uses clustering to discover hidden acoustic units, we formulate a factor analysis (FA) model that uses the discovered hidden acoustic units to align the SSL features. The underlying utterance-level representations are disentangled from the content of speech using probabilistic inference on the aligned features. Furthermore, the variational lower bound derived from the FA model provides an utterance-level objective, allowing error gradients to be backpropagated to the Transformer layers to learn highly discriminative acoustic units. When used in conjunction with HuBERT's masked prediction training, our models outperform the current best model, WavLM, on all utterance-level non-semantic tasks on the SUPERB benchmark with only 20% of labeled data.

Weiwei Lin, Chenhang He, Man-Wai Mak, Youzhi Tu

2023-05-14T08:26:24Z

http://arxiv.org/abs/2305.08099v3

# Self-supervised Neural Factor Analysis for Disentangling Utterance-level Speech Representations ###### Abstract Self-supervised learning (SSL) speech models such as wav2vec and HuBERT have demonstrated state-of-the-art performance on automatic speech recognition (ASR) and proved to be extremely useful in low label-resource settings. However, the success of SSL models has yet to transfer to utterance-level tasks such as speaker, emotion, and language recognition, which still require supervised fine-tuning of the SSL models to obtain good performance. We argue that the problem is caused by the lack of disentangled representations and an utterance-level learning objective for these tasks. Inspired by how HuBERT uses clustering to discover hidden acoustic units, we formulate a factor analysis (FA) model that uses the discovered hidden acoustic units to align the SSL features. The underlying utterance-level representations are disentangled from the content of speech using probabilistic inference on the aligned features. Furthermore, the variational lower bound derived from the FA model provides an utterance-level objective, allowing error gradients to be backpropagated to the Transformer layers to learn highly discriminative acoustic units. When used in conjunction with HuBERT's masked prediction training, our models outperform the current best model, WavLM, on all utterance-level non-semantic tasks on the SUPERB benchmark with only 20% of labeled data. Machine Learning, ICML ## 1 Introduction Supervised learning has driven the development of speech technologies for two decades. However, annotating speech data is considerably more challenging than other modalities. For example, automatic speech recognition (ASR) and language identification require linguistic knowledge. For speaker and emotion recognition, label ambiguity and human error are hard to avoid. Self-supervised learning (SSL) promises a prospect of learning without labeled datasets. SSL speech models such as wav2vec (Schneider et al., 2019; Baevski et al., 2020) and HuBERT (Hsu et al., 2021) have profoundly changed the research landscape of ASR. By training on a large amount of unlabeled speech to learn a general representation and then fine-tuning with a small amount of labeled data, SSL models demonstrated state-of-the-art performance and proved to be very resource efficient in low label-resource settings (Hsu et al., 2021; Baevski et al., 2020). The success of wav2vec and HuBERT attracts researchers to apply SSL to other speech tasks (Wang et al., 2021). For this purpose, Speech processing Universal PERformance Benchmark (SUPERB) for SSL models was proposed in (Yang et al., 2021). The tasks include content-based classifications, such as ASR, phoneme recognition, and intent classification, and utterance-level discriminative tasks, such as speaker recognition, diarization, and emotion recognition. SUPERB focuses on reusability of SSL features. Thus all tasks must share the same SSL model. Only the classification heads are learned using labeled data for a specific task. This encourages learning task-agnostic features for downstream tasks. Recently, a NOn-Semantic Speech benchmark (NOSS) that specifically designed for utterance-level tasks was proposed in (Shor et al., 2020). Using a triplet-loss unsupervised objective, they were able to exceeds the state-of-the-art performance on a number of transfer learning tasks. Although it has been shown that SSL features can outperform hand-crafted features for almost all tasks (Yang et al., 2021) under the SUPERB protocols, the performance of supervised downstream models are still far behind the fully supervised or find-tuned models in utterance-level tasks, suggesting that directly using the SSL features to train the downstream models is not enough. Besides, the labeled datasets in these tasks are considerably large. Using SSL models with little labeled data has yet to be explored for these tasks. This has led us to search for a more appropriate representation and an utterance-level self-supervised learning objective for these tasks. But, can an SSL model trained for frame-wise discrimination benefits utterance-level discrimination? We believe so. As shown in (Lei et al., 2014), a DNN trained for phoneme classification can be used for training a powerful speaker verification system. The key is in frame alignments. Averaging frame-level features cannot produce a good utterance representation because content variations within an utterance is too structural to be treated as Gaussian. To demonstrate this, we randomly selected 200 recordings from 5 speakers in the LibriSpeech (Panayotov et al., 2015) test set and extracted speech features from the sixth Transformer layer of a HuBERT model. The UMAP (McInnes et al., 2018) embeddings of the features are plotted in Figure 1(a). Different colors in the figure represent different speakers. We cannot see any apparent speaker clusters in Figure 1(a). If the content variations within an utterance are Gaussian, we should see blob-like speaker clusters. One way to reduce content variations is to align frames according to phoneme-like units. However, the existing frame aligners either require supervised learning such as phoneme classification DNNs (Lei et al., 2014) or not amenable to stochastic gradient descent training such as Gaussian mixture models (GMM). Inspired by HuBERT's use of K-means to discover hidden acoustic units, we propose aligning the frames using K-means. To this end, we trained a K-means model with 100 clusters on the LibriSpeech training set and used it to label the test set recordings. Then, we randomly selected two K-means clusters and only kept the frames assigned to these two clusters. The results are presented in Figures 1(b) and (c). As we can see, the speaker clusters are clearly revealed with the help of K-means alignments. Specifically, we propose using the offline K-means model in HuBERT training to align the speech features. K-means is conceptually simple and amenable to the mini-batch training (Sculley, 2010). During HuBERT training, the K-means model is updated iteratively, which means the aligners can be gradually improved as well. With the K-means aligned features, we then decompose the utterance-level variations into a set of cluster-dependent loading matrices and a compact utterance-level vector. The utterance-level representation can be extracted using probabilistic inference on the aligned features. Finally, instead of using the EM algorithm to train the FA model as in many traditional FA approaches (Dehak et al., 2010), we derived an utterance-level learning objective using the variational lower bound of the data likelihood. This allows gradients to be back-propagated to the Transformer layers to learn more discriminative acoustic features. Our experiments show that this objective can significantly improve the performance of SSL models on utterance-level tasks. ## 2 Related Work **Self-supervised Learning for Speech** The majority of SSL approaches rely on pretext tasks, tasks that are not necessarily the direct objective but learning them can capture a high-level structure in the data (Devlin et al., 2019; Chen et al., 2020; Doersch et al., 2015). In the speech community, some early attempts used multiple tasks as the learning pretexts (Pascual et al., 2019; Ravanelli et al., 2020). An increasingly popular pretext is to use a context encoder to encode information about past frames to predict or reconstruct future frames, as pioneered by contrastive predictive coding (CPC) (Oord et al., 2018). This line of work includes wav2vec (Schneider et al., 2019), which encodes raw waveform to perform frame differentiation, and autoregressive predictive coding (Chung and Glass, 2020) which uses an autoregressive model to predict future frames. Some researchers found that it is helpful to perform the frame Figure 1: Scatter plots of UMAP embeddings of Transformer features from HuBERT. Different colors represent different speakers. “Aligned” means that the frames were aligned using K-means. discrimination on quantized representations (Baevski et al., 2020; Ling et al., 2020). Later, Transformers were used to encode both future and past contexts to perform frame discrimination, as in wav2vec 2.0 (Baevski et al., 2020) and Mockingjay (Liu et al., 2020). More recently, the Hidden-Unit BERT (HuBERT) was proposed for self-supervised speech representation learning (Hsu et al., 2021). Different from explicit frame-wise discrimination in wav2vec and its variants, HuBERT is trained to perform masked prediction of pseudo labels given by an inferior HuBERT model from the previous optimization step. Later, multi-layer masked prediction losses were added to the intermediate layers of HuBERT to further strengthen the representation (Wang et al., 2022). In ContentVec (Qian et al., 2022), the authors improved HuBERT's performance for content-related tasks by disentangling speaker information from content information using voice conversion units. WavLM (Chen et al., 2022), on the other hand, was proposed to improve both content-related tasks and utterance-level tasks by adding utterance mixing during training and gated relative position bias to the Transformer. **Factor Analysis** Factor analysis (FA) and probabilistic models in general have wide applications in machine learning (Bishop and Nasrabadi, 2006; Murphy, 2012). Before the advent of deep learning, there had been several successes of FA models in speaker verification, face recognition, and ECG signal classification, including joint-factor analysis (Kenny et al., 2007), probabilistic linear discriminative analysis (Prince and Elder, 2007), and most famously i-vector (Dehak et al., 2010). The FA models generally assume that there is a latent variable responsible for generating the observation vectors. Different relationships between the observation vectors and the latent variable result in different FA models, such as one-to-one mapping between the observation and the latent variable in probabilistic PCA and many observations to one latent variable in i-vector and JFA. Noticeably most of these FA models are applied to raw input or hand-craft features such as natural images or mel-frequency cepstral coefficients (MFCCs). One exception is PLDA in speaker verification, which is applied to neural speaker embeddings or i-vectors. **Uterance-level Speech Tasks** Utterance-level speech tasks include speaker recognition (Tu et al., 2022), emotion recognition (Wani et al., 2021), and language identification (Li et al., 2013). They are an important part of intelligent speech systems. Besides their respective applications, they are essential for semantic and generative tasks like ASR and text-to-speech (TTS) synthesis. For example, multilingual ASR and speech translation often require language identification as the first step (Radford et al., 2022). Multi-speaker TTS and voice conversion systems rely on speaker recognition models to extract speaker information (Jia et al., 2018; Qian et al., 2019). Solving these utterance-level tasks often involves different model architectures and domain knowledge. ## 3 Methodology In this section, we will introduce our neural factor analysis (NFA) in the context of HuBERT. NFA aims to disentangle utterance-level information such as speaker identity, emotional state, and language from frame-wise content information such as phonemes. Figure 2 shows the training procedure of the HuBERT variant of our NFA model. The learning objective we are about to derive can be used in any SSL model, such as wav2vec and its variants, as long as frame assignments are provided. NFA can learn various utterance-level representations, such as speaker identities, emotion states, and language categories. We will refer to them as utterance-level identities in the remaining paper. Figure 2: Training of the HuBERT variant of our neural factor analysis model. The dashed arrows represent gradient pathways. For the details of the learning algorithm, the reader may refer to Algorithm 1. ### HuBERT Consider an acoustic sequence \(\mathbf{X}\) of \(T\) frames. We denote \(\mathcal{M}\subset\{1,\dots,T\}\) as the index set indicating the frames in \(\mathbf{X}\) to be masked. Define \(\hat{\mathbf{X}}=\text{mask}(\mathbf{X},\mathcal{M})\) as the masked version of \(\mathbf{X}\), where the masked \(\mathbf{x}_{t}\)\((t\in\mathcal{M})\) is replaced by a mask embedding. The BERT encoder \(\boldsymbol{f_{\theta}}(.)\) takes as input the masked sequence \(\tilde{\mathbf{X}}\) and outputs a feature sequence \(\mathbf{H}=[\mathbf{h}_{1},\dots,\mathbf{h}_{T}]\). Let us introduce a \(K\)-dimensional binary random variable \(\mathbf{y}_{t}\) for frame \(t\) having a 1-of- \(K\) representation, where \(y_{tk}\in{0,1}\) and \(\sum_{k}y_{tk}=1\). Denote the output of the predictor as \(q_{\phi}\left(y_{tk}\mid\mathbf{H}\right)\). Given the target distribution for the masked frames \(p\left(y_{tk}\right)\), the cross-entropy can be computed as: \[L_{m}(\mathbf{H},\mathcal{M})=-\sum_{t\in\mathcal{M}}\sum_{k}p\left(y_{tk} \right)\log q_{\phi}\left(y_{tk}\mid\mathbf{H}\right) \tag{1}\] However, we do not have access to the target distribution \(p\left(y_{tk}\right)\). HuBERT solves this problem by iterative clustering to obtain the frame label \(z_{tk}\) as a surrogate for \(p\left(y_{tk}\right)\), where \(z_{tk}\in{0,1}\) and \(\sum_{k}z_{tk}=1\). With the frame label \(z_{tk}\), the cross-entropy loss can be re-written as: \[L_{m}(\mathbf{H},\mathbf{Z},\mathcal{M})=-\sum_{t\in\mathcal{M}}\sum_{k}z_{tk }\log q_{\phi}\left(y_{tk}\mid\mathbf{H}\right) \tag{2}\] At first, the cluster assignments are obtained by running _K_-means clustering on MFCCs. Then the model is updated by minimizing the masked prediction loss. New cluster assignments are obtained by running _K_-means on the updated features at the Transformer layer. The learning process then proceeds with new cluster assignments \(\{\mathbf{z}_{t}\}\). The masked prediction and cluster refinement are performed iteratively. The blue area in Figure 2 illustrates HuBERT's masked prediction training. ### Utterance-level Representation Learning via Neural Factor Analysis Figure 1 shows that the K-means alignments can reveal meaningful speaker information. One simple way to obtain the utterance-level representation is to average the aligned frames in each cluster and concatenate the results. The probabilistic model for such approach can be written as follows: \[\mathbf{h}_{t}^{i}\sim\sum_{k=1}^{K}z_{tk}^{i}\mathcal{N}\left(\boldsymbol{ \mu}_{k}+\mathbf{w}_{k}^{i},\boldsymbol{\Sigma}_{k}\right), \tag{3}\] where \(\mathbf{h}_{t}^{i}\) is the Transformer layer features from the utterance \(i\), \(z_{tk}^{i}\in\{0,1\}\) is the frame label assigned by K-means, \(\boldsymbol{\mu}_{k}\) is the \(k\)-th cluster center, \(\boldsymbol{\Sigma}_{k}\) is the covariance matrix of the \(k\)-th cluster, and \(\mathbf{w}_{k}^{i}\) is the utterance identity in the \(k\)-th cluster. The concatenation of \(\mathbf{w}_{k}^{i}\), i.e. \([\mathbf{w}_{1}^{i},\dots\mathbf{w}_{K}^{i}]\), can be used as utterance identity representation. However, its dimension scales linearly with \(K\). Instead, we decompose \(\mathbf{w}_{k}^{i}\) into the product of a cluster-dependent loading matrix \(\mathbf{T}_{k}\) and utterance identity vector \(\boldsymbol{\omega}^{i}\) for more compact representation: \[\mathbf{h}_{t}^{i}\sim\sum_{k=1}^{K}z_{tk}^{i}\mathcal{N}\left(\boldsymbol{\mu }_{k}+\mathbf{T}_{k}\boldsymbol{\omega}^{i},\boldsymbol{\Sigma}_{k}\right). \tag{4}\] Specifically, we train a K-means model using the Transformer layer features to produce \(\{\boldsymbol{\mu}_{k}\}\), which can be viewed as _content representations_ of the speech. Then, we run K-means to produce frame labels \(\{z_{tk}^{i}\}\) and calculate \(\{\boldsymbol{\Sigma}_{k}\}\) and cluster weight prior \(\{\pi_{k}\}\) for the \(K\) clusters, which we denoted as \(\boldsymbol{\Phi}=\{\pi_{k},\boldsymbol{\mu}_{k},\boldsymbol{\Sigma}_{k}\mid k =1,\dots,K\}\). With cluster parameters and frame labels \(\{z_{tk}^{i}\}\), we only have one set of parameters \(\{\mathbf{T}_{k}\}\) and one latent variable \(\boldsymbol{\omega}^{i}\) left in the model, which is a problem that can be solved with the expectation-maximization (EM) algorithm. Given a sequence of frame-level features \(\mathbf{H}^{i}=\{\mathbf{h}_{1}^{i},\dots,\mathbf{h}_{T}^{i}\}\), the frames labels (alignments) \(\mathbf{Z}^{i}=\{z_{tk}^{i}|t=1,\dots,T;k=1,\dots,K\}\), and cluster parameters \(\boldsymbol{\Phi}\), we can use the EM algorithm to find \(\mathbf{T}=\{\mathbf{T}_{k}|k=1,\dots,K\}\). In the E-step, we compute the posterior of utterance identity \(\boldsymbol{\omega}^{i}\): \[p_{\mathbf{T}}\left(\boldsymbol{\omega}^{i}|\mathbf{H}^{i};\mathbf{Z}^{i}, \boldsymbol{\Phi}\right)=\frac{\prod_{t=1}^{T}p_{\mathbf{T}}\left(\mathbf{h}_ {t}^{i}|\boldsymbol{\omega}^{i};\mathbf{z}_{t\bullet}^{i}\right)p\left( \boldsymbol{\omega}^{i}\right)}{\int\prod_{t=1}^{T}p_{\mathbf{T}}(\mathbf{h}_ {t}^{i}|\boldsymbol{\omega}^{i};\mathbf{z}_{t\bullet}^{i})\text{d}\boldsymbol{ \omega}^{i}}, \tag{5}\] where \(\mathbf{z}_{t\bullet}^{i}=\{z_{tk}^{i}\}_{k=1}^{K}\) and \(p_{\mathbf{T}}\left(\boldsymbol{\omega}^{i}|\mathbf{H}^{i};\mathbf{Z}^{i}, \boldsymbol{\Phi}\right)\) is the probability distribution of \(\boldsymbol{\omega}^{i}\) conditioned on \(\mathbf{H}^{i}\) given \(\mathbf{Z}^{i}\) and \(\boldsymbol{\Phi}\). Because the alignments \(\mathbf{Z}^{i}\) and the cluster parameters \(\boldsymbol{\Phi}\) are fixed while optimizing the likelihood, we drop the dependency when expressing the posterior for simplicity. In the M-step, we choose the \(\mathbf{T}\) that maximize the expected log-likelihood: \[\operatorname*{arg\,max}_{\mathbf{T}}\sum_{i=1}^{I}\mathbb{E}_{p_{\mathbf{T}^{ \prime}}\left(\boldsymbol{\omega}^{i}|\mathbf{H}^{i}\right)}\left[\log p_{ \mathbf{T}}\left(\mathbf{H}^{i},\boldsymbol{\omega}^{i}\right)\right], \tag{6}\] where \(\mathbf{T}^{{}^{\prime}}\) is the loading matrix from the previous M-step (or randomly initialized). Eq. 6 has a closed-form solution. After the matrix \(\mathbf{T}\) is found, the mean of the posterior \(\mathbb{E}[\boldsymbol{\omega}|\mathbf{H}]\) is used as the utterance identity representation. \[\mathbb{E}[\boldsymbol{\omega}|\mathbf{H}]=(\mathbf{I}+\sum_{k}^{K}\mathbf{T}_ {k}^{\intercal}\mathbf{\Sigma}_{k}^{-1}\mathbf{T}_{k})^{-1}\sum_{k}^{K}\mathbf{T}_ {k}^{\intercal}\mathbf{\Sigma}_{k}^{-1}\sum_{t}(\mathbf{h}_{t}-\boldsymbol{\mu}_{ k}). \tag{7}\] **Learning via gradient on ELBO** There are two limitations to learning matrix \(\mathbf{T}\) using the EM algorithm. First, the EM algorithm limits the possibility of large-scale training. In Eq. 6, the loading matrix \(\mathbf{T}\) is estimated using the whole training set, contrary to the stochastic update in modern DNN training. Another disadvantage is the separation between the Transformer layers and the FA model during training, which prevents the possibility of joint optimization of the matrix \(\mathbf{T}\) and Transformer layers' parameters \(\mathbf{\theta}\). We aim to derive a learning rule that is amenable to stochastic updates and allows joint optimization of the FA model and the Transformer layers. As a latent variable model, the log-likelihood of our FA model can be written as (Bishop and Nasrabadi, 2006; Kingma and Welling, 2013): \[\log p_{\mathbf{T}}\left(\mathbf{H}^{i}\right)=D_{\text{KL}}\left(q(\mathbf{ \omega}^{i})\|p_{\mathbf{T}}(\mathbf{\omega}^{i}|\mathbf{H}^{i})\right)+\mathcal{L }_{\text{ELBO}}\left(\mathbf{H}^{i};\mathbf{T}\right), \tag{8}\] where \(\mathcal{L}_{\text{ELBO}}\left(\mathbf{H}^{i};\mathbf{T}\right)\) is called the evidence lower bound (ELBO). \(D_{\text{KL}}\left(q(\mathbf{\omega}^{i})\|p_{\mathbf{T}}(\mathbf{\omega}^{i}|\mathbf{ H}^{i})\right)\) is the KL-divergence between the approximate posterior \(q(\mathbf{\omega}^{i})\) and true posterior \(p_{\mathbf{T}}(\mathbf{\omega}^{i}|\mathbf{H}^{i})\). Minimizing KL or maximizing the ELBO can both increase the log-likelihood. In the case of our model, minimizing the KL is easy as the posterior of \(\mathbf{\omega}\) is tractable, which gives rise to the E-step in Eq. 5. To optimize the ELBO, we need to re-write Eq. 8 as: \[\mathcal{L}_{\text{ELBO}}\left(\mathbf{H}^{i};\mathbf{T}\right)=\mathbb{E}_{q (\mathbf{\omega}^{i})}\left[-\log q(\mathbf{\omega}^{i})+\log p_{\mathbf{T}}(\mathbf{ H}^{i},\mathbf{\omega}^{i})\right]. \tag{9}\] Because we already know the closest ELBO to likelihood is when \(q(\mathbf{\omega}^{i})\) equals to the posterior \(p_{\mathbf{T}}\left(\mathbf{\omega}^{i}\mid\mathbf{H}^{i}\right)\), Eq. 9 can be written as: \[\mathbb{E}_{p_{\mathbf{T}^{\prime}}(\mathbf{\omega}^{i}|\mathbf{H}^{i})}\left[- \log p_{\mathbf{T}^{\prime}}\left(\mathbf{\omega}^{i}\mid\mathbf{H}^{i}\right)+ \log p_{\mathbf{T}}(\mathbf{H}^{i},\mathbf{\omega}^{i})\right], \tag{10}\] where \(\mathbf{T}^{{}^{\prime}}\) is the loading matrix from the last update. We can see the first term is a constant with respect to \(\mathbf{T}\). Therefore, the gradient of the lower-bound with respect to \(\mathbf{T}\) is: \[\frac{d\mathcal{L}_{\text{ELBO}}}{d\mathbf{T}}=\nabla_{\mathbf{T}}\mathbb{E}_{ p_{\mathbf{T}^{\prime}}(\mathbf{\omega}^{i}|\mathbf{H}^{i})}\left[\log p_{ \mathbf{T}}\left(\mathbf{H}^{i},\mathbf{\omega}^{i}\right)\right]. \tag{11}\] The gradient with respect to the Transformer features \(\frac{d\mathcal{L}_{\text{ELBO}}}{d\mathbf{H}^{i}}\) involves both terms in Eq. 10: \[\nabla_{\mathbf{H}^{i}}\mathbb{E}_{p_{\mathbf{T}^{\prime}}(\mathbf{\omega}^{i}| \mathbf{H}^{i})}\left[-\log p_{\mathbf{T}^{\prime}}\left(\mathbf{\omega}^{i}\mid \mathbf{H}^{i}\right)+\log p_{\mathbf{T}}(\mathbf{H}^{i},\mathbf{\omega}^{i}) \right]. \tag{12}\] By applying the chain rule, we can obtain the gradient with respect to the Transformer parameters \(\mathbf{\theta}\): \[\frac{d\mathcal{L}_{\text{ELBO}}}{d\mathbf{\theta}}=\frac{d\mathcal{L}_{\text{ELBO }}}{d\mathbf{H}^{i}}\frac{d\mathbf{H}^{i}}{d\mathbf{\theta}}. \tag{13}\] Eq. 13 shows that we can backpropagate the gradient of ELBO back to the Transformer layers. The total loss of our NFA model is: \[\sum_{i}\left(L_{m}(\mathbf{H}^{i},\mathbf{Z}^{i},\mathcal{M})-\lambda\mathcal{ L}_{\text{ELBO}}\left(\mathbf{H}^{i};\mathbf{T}\right)\right). \tag{14}\] Therefore, in addition to HuBERT's mask prediction and self-training, in each forward pass, we will compute the posteriors \(p_{\mathbf{T}}\left(\mathbf{\omega}^{i}\mid\mathbf{H}^{i}\right)\) (Eq. 5) given a sequence of BERT features and frame labels produced by K-means. Then, we use the posteriors to evaluate the gradient with respect to \(\mathbf{T}\) to update the loading matrix and the gradient with respect to BERT features \(\mathbf{H}^{i}\) to update the SSL model parameters \(\mathbf{\theta}\). Algorithm 1 summarizes the whole training procedure of our NFA. ## 4 Experiments In this section, we will evaluate the proposed NFA model's performance on three kinds of utterance-level speech tasks, namely speaker, emotion, and language recognition, by comparing it to SSL models such as wav2vec2.0, HuBERT, and WavLM. Note that the NFA can use both HuBERT and wav2vec2.0 architecture as long as frame labels are provided. ### Tasks, Datasets, Baselines, and Implementation **Speech Tasks and Datasets** The speech tasks that we will evaluate include: * Automatic speaker verification (ASV or SV), speaker identification (SID), and speaker diarization (SD). We followed the SUPERB protocol (Yang et al., 2021) using the VoxCeleb1 (Nagrani et al., 2017) training split to train the model and used the test split to evaluate speaker verification performance. Note that the reported ASV downstream model in (Yang et al., 2021) is a deep neural network (Snyder et al., 2018) trained on SSL features (Yang et al., 2021). The evaluation metric is equal error rate (EER) (the lower, the better). For speaker identification, we used the VoxCeleb1 train-test split provided by the SUPERB organizer. The evaluation metric is accuracy. For SID, the SUPERB downstream model is a linear classifier trained on averaged SSL features. Speaker diarization is to segment and label a recording according to speakers. We followed the SUPERB protocol using the LibriSpeech (Panayotov et al., 2015) splits for training and evaluation. The SUPERB downstream model is a recurrent neural network. The evaluation metric is diarization error rate (DER) (the lower, the better) * Emotion recognition (ER). We used IEMOCAP (Busso et al., 2008) dataset. Following the same protocol as SUPERB, we dropped the unbalance emotion classes to leave the neutral, happy, sad, and angry classes. The evaluation metric is accuracy. The SUPERB downstream model is a linear classifier trained on averaged SSL features. * Language identification (LID). Language identification is not included in the SUPERB benchmark. We included it because it is also an important utterance-level task. The dataset we used is the the Common Language dataset prepared by (Sinisetty et al., 2021), which includes 45 languages with 45.1 hours of recordings. On average, each language has one-hour recordings.1 The downstream baseline is a linear classifier trained on averaged SSL features. Footnote 1: [https://huggingface.co/datasets/common_language](https://huggingface.co/datasets/common_language) **Pre-trained models** The pre-trained models we used in this paper include HuBERT (Hsu et al., 2021), WavLM (Chen et al., 2022), and wav2vec2-XLS-R (Babu et al., 2022). HuBERT and WavLM models were used in speaker and emotion evaluation. Because language identification requires models trained on multi-lingual data, wav2vec2-XLS-R was used. **Implementation details.** The HuBERT and Wav2vec2-based NFA models were trained on LibriSpeech using the model checkpoints provided by fairseq. The language identification NFA models were trained on the Common Language dataset using the XLS-R checkpoint. \(\lambda\) in Eq. 14 is set to 0.01 for all models. After the optimization steps in Algorithm 1 were done, we re-trained the loading matrix \(\mathbf{T}\) for each task with EM using unlabeled task-related data. Other than specifically stated, the acoustic features were extracted from layer 6 for the base SSL models (HuBERT, WavLM, and Wav2Vec2-XLS-R) and layer 9 for the large SSL models. The number of clusters in K-means is 100, and the rank of loading matrix dimension is 300 for all NFA models. After utterance-level representations have been extracted using Eq. 7, we used the simple logistic classifier in sklearn (Pedregosa et al., 2011) for SID, ER, and LID. For speaker verification, we used the PLDA backend. For SD, we used linear discriminant analysis (LDA) to reduce the dimension to 200 and then used agglomerative hierarchical clustering to produce speaker assignments. Note that all our downstream methods are linear models. ### SUPERB Experiments In this section, we evaluate the NFA's performance on SUPERB tasks (Yang et al., 2021; Chen et al., 2022). Besides the standard speaker-related and emotion recognition, we also included language identification (LID) on Common Langue (Sinisetty et al., 2021). For LID, we followed the same protocol as other SUPERB tasks, i.e., the SSL models' weights were frozen, and only linear models were trained with labeled data without data augmentation. To give a better idea of the expected performance of each task in unrestricted settings, we also included the results using the fine-tuned SSL models on the ASV and ER tasks and the current best result in the Common Language dataset reported by other researchers. The results are presented in Table 1. As observed in the table, NFA significantly outperforms all SSL models across ASV, SD, SID, and LID. NFA performs only marginally worse than the self-supervised Conformer (Shor et al., 2020), which has been specifically designed for utterance-level tasks. In speaker verification, the relative EER reduction is 40% when compared with the WavLM, the previous best model on utterance-level tasks. It is worth noting that WavLM's ASV baseline used a DNN network trained on the Transformer features, but we only use linear models. Our models even perform better than the fully fine-tuned models in (Wang et al., 2021) in both ASV and ER tasks. For LID, our XLS-R-based NFA performs better than the best-reported result on Common Language by SpeechBrain (Ravanelli et al., 2021). ### Downstream Low Label-resource Experiments One of the most attractive features of wav2Vec and Hubert is their performance on low label-resource ASR. The resource efficiency of these models enables the potential development of many low label-resource languages and speech tasks where labeled data are hard to collect. In this section, we evaluate NFA performance in low label-resource settings. To this end, we divided the labeled dataset in the speaker recognition, emotion recognition, and language identification tasks into 10%, 20%, and 30% subsets as low label-resource settings. For ASV, SD, SID, and ER, we extracted the embeddings from a large Hubert-based NFA model. For LID, we used the embeddings from the XLS-R-based NFA model. WavLM Large and XLS-R were used as performance references. To reduce the performance deviation in the division, we ran each partition five times and reported \begin{table} \begin{tabular}{l|c|c|c|c|c} \hline \hline Tasks & ASV & SD & SID & ER & LID \\ Metrics & EER \(\downarrow\) & DER \(\downarrow\) & Acc \(\uparrow\) & Acc \(\uparrow\) & Acc \(\uparrow\) \\ \hline wav2vec2.0 Large (Yang et al., 2021) & 5.65 & 5.62 & 86.14 & 65.64 & - \\ Supervised Finetuning (Wang et al., 2021) & 4.46 & - & - & 64.2 & \\ NFA (wav2vec2-based) & 4.02 & 2.83 & 96.3 & 73.4 & \\ \hline HuBERT Large (Yang et al., 2021) & 5.98 & 5.75 & 90.33 & 67.62 & - \\ WavLM Large (Chen et al., 2022) & 3.77 & 3.24 & 95.49 & 70.62 & - \\ Supervised Finetuning HuBERT Large(Wang et al., 2021) & 2.36 & - & - & 72.7 & \\ NFA (HuBERT-BASED) & **2.26** & **1.84** & **98.1** & 78.1 & - \\ \hline Conformers (Shor et al.) & - & - & - & **79.2** & - \\ \hline wav2vec2-XLS-R & - & - & - & - & 80.4 \\ ECAPA-TDNN & - & - & - & - & 84.9 \\ NFA (XLS-R-BASED) & - & - & - & - & **86.3** \\ \hline \hline \end{tabular} \end{table} Table 1: Results on SUPERB and language identification tasks. Figure 4: NFA embeddings’ zero-shot performance on speaker verification and language ID. Figure 3: Bar plots of SSL models’ performance in low label-resource settings. the results. The loading matrices in the NFA models were trained using the entire unlabeled dataset. The results are presented in Figure 3. We can see that even with only 10% of labeled data for the downstream models, NFA's performance in ER, SID, and LID is very close to the WavLM and XLS-R. For ASV and SD, our method already outperforms the WavLM models trained on fully labeled data. With 20% labeled data, NFA already outperforms WavLM and XLS-R on all tasks. This shows the high resource efficiency of our NFA models. ### Zero-Shot Speaker Verification In Figure 1, we observe that by clustering and aligning the Transformer features, speaker information can be revealed. This is all done without labeled data. But how discriminative these unsupervised learned embeddings are? We will evaluate NFA embeddings' zero-shot performance quantitatively in this section. Specifically, we evaluated NFA models on zero-shot speaker verification. After we extracted the utterance-level representations using Eq. 7, we directly used cosine similarity to obtain verification scores without any supervised training (the models were never given speaker information). We evaluated the performance on (1) LibriSpeech, which is considered in-domain data as HuBERT and NFA were trained on this dataset (Panayotov et al., 2015; Hsu et al., 2021), (2) Voxceleb1-test, a popular speaker verification dataset (Nagrani et al., 2017), and (3) VOiCES (Nandwana et al., 2019), a dataset used to evaluated speaker verification robustness against noise and room reverberation. As a comparison, we also included i-vector (Dehak et al., 2010) and averaged Transformer features (HuBERT rows in Table 2) as baselines. The results are presented in Table 2. Without supervision, simple averaging the Transformer features cannot produce useful speaker representations. It even performs worse than i-vector, a non-DNN approach. NFA embeddings, however, achieve an EER of 3.98% on LibriSpeech without any supervised training. This suggests that during self-supervised learning, the model has already learned to differentiate speakers, which also empirically demonstrates that the NFA model can disentangle speaker information from the content information. However, when evaluated on VoxCeleb1 and VOiCES, the performance of zero-shot SV dropped significantly. This may be because VoxCeleb1 and VOiCES are real-world speech datasets containing spontaneous speech and environmental noise. NFA and HuBERT were pre-trained on a read speech dataset. The domain discrepancy in SSL models can have a significant impact on the downstream tasks, as mentioned in (Hsu et al., 2021). Another interesting observation is that scaling the model size improves the zero-shot SV performance, as shown when using HuBERT Large and NFA large models. ### Layer-wise Representation Evaluation Because our NFA models show excellent zero-shot performance, we can use them to evaluate the discrimination power from each Transformer layer before supervised learning is applied. We extracted the acoustic features from Layer 1 to Layer 12 of the Transformer in the NFA model to conduct zero-shot speaker verification and language identification. For language identification, we used top-1 accuracy as the metric. Then, we used the labeled data to train an LDA on top of NFA embeddings to compare the results. The results are presented in Figure 4. The blue lines in Figure 4 show that under zero-shot settings, both speaker and language discriminative abilities increase from Layer 1 up to Layer 6. Then, the features from the deeper layers have poorer performance. This is largely consistent with the supervised baselines (orange lines), with Layer 7 obtaining the lowest speaker verification error and Layer 6 having the highest language identification top-1 accuracy in supervised settings. This shows that our NFA models' zero-shot performance can be a reliable predictor of supervised performance. ### Gradient-based Learning Versus EM To assess whether gradient-based learning has an edge over the Expectation-Maximization (EM) method, we extracted HuBERT features and separately trained a factor analysis model using EM. The results are displayed in Table 3. We observe that gradient-based optimization consistently outperforms EM-based I-vector trained on HuBERT features. This suggests that jointly training the NFA model with the SSL model can yield more potent feature representations than training the two modules independently. ### Impact on ASR The ultimate goal of a self-supervised learning (SSL) speech model is to utilize a single backbone model for all downstream tasks. Consequently, it's critical that the NFA model does not compromise performance on content-based tasks \begin{table} \begin{tabular}{l|c|c|c} \hline \hline Dataset & LibriSpeech & VoxCeleb & VOiCES \\ \hline I-vector & 11.2 & 15.8 & 22.3 \\ \hline HuBERT & 28.7 & 32.1 & 34.5 \\ NFA & **3.98** & **9.32** & **12.32** \\ \hline HuBERT Large & 30.21 & 26.88 & 37.45 \\ NFA Large & **2.87** & **7.92** & **12.02** \\ \hline \hline \end{tabular} \end{table} Table 2: Zero-shot speaker verification performance on different domains. The metric is the equal error rate. such as ASR. To ensure this, we compared the performance of the NFA and the large NFA model against HuBERT on the LibriSpeech clean subset. The results, as shown in Table 4, demonstrate that the NFA and large NFA models perform on par with HuBERT. This confirms that our NFA model does not sacrifice performance on content-based tasks. ## 5 Conclusions In this paper, we proposed a novel self-supervised speech model for utterance-level speech tasks. Instead of using frame-wise discrimination loss alone, we introduced an utterance-level learning objective based on factor analysis and feature disentanglement. Through extensive experiments, we demonstrate that our NFA model can significantly improve SSL models' performance on utterance-level discriminative tasks without supervised fine-tuning. The zero-shot and low label-resource experiments also show the data efficiency of our approach, which to the best of our knowledge, has yet been shown for utterance-level tasks. This can significantly benefit the utterance-level speech classification tasks where labeled data is hard to obtain, such as speaker recognition for low label-resource languages (Thanh et al., 2021), depression speech detection (Ma et al., 2016), children speech processing (Shahnawazuddin et al., 2021), speech disorder diagnosis (Alhanai et al., 2017), and classifying intelligibility for disordered speech (Venugopalan et al., 2021). Our findings also shed some insights into speech SSL learning itself. Currently, the frame-wise discriminative SSL models are often thought of as acoustic unit discovery models. Little has been considered for utterance-level identity discovery such as speaker information in self-supervised learning. As we show in Section 4.4, SSL can perform very well on speaker verification with supervision, which suggests speaker-related information is also discovered during the self-supervised learning stage. This is encouraging as it shows that SSL learning can discover multiple hidden information in the speech that can benefit a wide range of speech tasks. A significant limitation of the NFA model lies in its performance with out-of-domain data. As observed in Section 4.4, NFA's performance significantly deteriorates when evaluated on out-of-domain data. This observation underscores the persistent challenge of achieving robust zero-shot performance in SSL models. Another limitation of NFA pertains to the types of signals it can effectively disentangle. While the NFA model showcases impressive feature disentanglement capabilities across several utterance-level tasks, it's worth noting that it does not disentangle different types of utterance-level information from one another. For instance, it does not separate speaker information from emotional states. For such nuanced tasks, we continue to rely on downstream models to achieve this level of disentanglement. In future research, we intend to explore methodologies that could disentangle different types of utterance-level information during the self-supervised learning stage.

2308.01727

Local Large Language Models for Complex Structured Medical Tasks

This paper introduces an approach that combines the language reasoning capabilities of large language models (LLMs) with the benefits of local training to tackle complex, domain-specific tasks. Specifically, the authors demonstrate their approach by extracting structured condition codes from pathology reports. The proposed approach utilizes local LLMs, which can be fine-tuned to respond to specific generative instructions and provide structured outputs. The authors collected a dataset of over 150k uncurated surgical pathology reports, containing gross descriptions, final diagnoses, and condition codes. They trained different model architectures, including LLaMA, BERT and LongFormer and evaluated their performance. The results show that the LLaMA-based models significantly outperform BERT-style models across all evaluated metrics, even with extremely reduced precision. The LLaMA models performed especially well with large datasets, demonstrating their ability to handle complex, multi-label tasks. Overall, this work presents an effective approach for utilizing LLMs to perform domain-specific tasks using accessible hardware, with potential applications in the medical domain, where complex data extraction and classification are required.

V. K. Cody Bumgardner, Aaron Mullen, Sam Armstrong, Caylin Hickey, Jeff Talbert

2023-08-03T12:36:13Z

http://arxiv.org/abs/2308.01727v1

# Local Large Language Models for Complex Structured Tasks ###### Abstract This paper introduces an approach that combines the language reasoning capabilities of large language models (LLMs) with the benefits of local training to tackle complex, domain-specific tasks. Specifically, the authors demonstrate their approach by extracting structured condition codes from pathology reports. The proposed approach utilizes local LLMs, which can be fine-tuned to respond to specific generative instructions and provide structured outputs. The authors collected a dataset of over 150k uncurated surgical pathology reports, containing gross descriptions, final diagnoses, and condition codes. They trained different model architectures, including LLaMA, BERT and LongFormer and evaluated their performance. The results show that the LLaMA-based models significantly outperform BERT-style models across all evaluated metrics, even with extremely reduced precision. The LLaMA models performed especially well with large datasets, demonstrating their ability to handle complex, multi-label tasks. Overall, this work presents an effective approach for utilizing LLMs to perform domain-specific tasks using accessible hardware, with potential applications in the medical domain, where complex data extraction and classification are required. Artificial Intelligence; Large language models; Natural Language Processing. ## 1 Introduction In recent years, artificial intelligence (AI) and natural language processing (NLP) have been applied to medicine from clinical prognosis to diagnostic and companion diagnostic services. One of the most potentially groundbreaking developments in this domain has been the emergence of generative large language models (LLM), such as OpenAI's ChatGPT[1] and its successors. These user-facing AI-driven systems have proven to be attractive resources, revolutionizing the way medical professionals interact with AI for both research and patient care. LLMs possess a great capacity to analyze vast amounts of medical data, ranging from research papers and clinical trial results to electronic health records and patient narratives[2, 3]. By integrating these diverse, potentially multimodal[4] data sources, these models can identify patterns, correlations, and insights that might have otherwise remained hidden. With their ability to understand natural language, these AI-powered systems can process patient symptoms, medical histories, and test results to aid in diagnosing diseases more efficiently. LLMs have demonstrated encouraging capabilities to generate[5] and summarize[6] medical reports, including radiology[7, 8, 9] and pathology[10, 11, 12] diagnostic reports. The large volume of language data used in training LLMs has enabled so-called zero-shot[13] data operations across classes of data not necessarily observed during model training. While LLMs are useful for many transferable language tasks, performance is dependent on distinguishable associations between observed and non-observed classes. Medical terminologies, domain specific-jargon, and institutional reporting practices produce unstructured data that does not necessarily contain transferable associations used by general-purpose LLMs. If the medical context (rules, association mappings, reference materials, etc.) does not exceed the input limits of the model, which at the time of writing is 3k and 25k words for Chat-GPT and GPT4, respectively, associations and context can be included as input. The process of manipulating LLM results through input content and structure is commonly referred to as prompt engineering.[14] However, technical limitations aside, data policy, privacy, bias, and accuracy concerns associated with AI in medicine persist. With limited information on the underlying data or model training process, it is not clear that third-party use of services like ChatGPT is consistent with FDA guidance[15] on the application of AI in clinical care. LLMs possess a great capacity to analyze vast amounts of medical data, ranging from research papers and clinical trial results to electronic health records and patient narratives.[2, 3] By integrating these diverse, potentially multimodal[4] data sources, these models can identify patterns, correlations, and insights that might have otherwise remained hidden. With their ability to understand natural language, these AI-powered systems can process patient symptoms, medical histories, and test results to aid in diagnosing diseases more efficiently. LLMs have demonstrated encouraging capabilities to generate[5] and summarize[6] medical reports, including radiology[7, 8, 9] and pathology[10, 11, 12] diagnostic reports. The theme of bigger is better continues to reign in the world of AI, especially as it pertains to language model data and parameter sizes. Five short years ago, Google's BERT[16] language transformers revolutionized deep learning for NLP tasks. While large compared to vision models of the same generation, BERT-style models were publicly available, provided with permissive licenses, and rapidly incorporated into NLP pipelines. BERT-style models are small enough to be fine-tuned for specific tasks, allowing the incorporation of medical and other data within the model itself. The latest LLMs, such as GPT4, reportedly consist of trillions of parameters, are trained with trillions of input tokens, and reportedly cost hundreds of millions of dollars. If publicly available, few institutions would have the expertise or capacity to infer GPT4-sized models, much less train them. Fortunately, three months after the release of ChatGPT, Meta released LLaMA,[17] and later LLaMA 2,[18] which are foundational LLMs that are small enough to be trained, yet large enough to approach ChatGPT performance for Fig. 1: local LLM High-level View many tasks. Following the release of LLaMA, additional foundational models such as Falcon[19] and MPT[20] were released. Similar to previous community models such as BERT, these new foundational LLM models are provided in a range of sizes from 3 to 70 billion parameters. Table 1 provides the number of parameters, and Table 2 lists vRAM requirements for common language models. There are now tens of thousands[21] of derivative LLMs trained for specific tasks, including the medical domain,[22] which can benefit from both complex language reasoning and domain-specific training. We will refer to LLMs that can be trained and operated without needing services, such as OpenAI and Google BART[23] as local LLMs. Using LLMs to extract machine-readable values is an area of research that has recently attracted significant attention. This research aims to leverage the capabilities of LLMs to extract[24, 25] specific numerical or discrete information from unstructured text in a format that can be used by downstream computational pipelines. Typical approaches to LLM structured data output include prompt engineering and post-processing, which can be applied to both services and local LLMs. Most recently, projects such as Microsoft Guidance,[26] LangChain,[27] and JsonFormer[28] have emerged to manage the input structure, model interaction, and output structure of both online and local LLMs. In addition, local LLMs can be fine-tuned to provide structured data in response to specific generative instructions, which can be combined with LLM data control software. In this paper, we provide an approach to harness the language reasoning power of LLMs with the benefits of locally trained and operated models to perform complex, domain-specific tasks. We will demonstrate our approach by extracting structured condition codes from pathology reports. ChatGPT does not have sufficient medical context to report structured conditions from pathology reports, providing the response _"I don't have the capability to perform specific queries to extract information like ICD codes from medical reports."_ Likewise, while BERT-style models work well for limited-sized text and frequently used condition codes, they lack the language processing capabilities to perform well across complicated unstructured data with high numbers of multi-label codes. We test the efficacy of our local LLMs against BERT-style models that have been trained with pathology language data, and LongFormer,[29] an extended context BERT-like model, both of which we fine-tuned for data extraction. ## 2 Methods This section will describe our process for curating LLM datasets, model training and evaluation, quantization[32] approaches, and operational hosting of local LLM models. \begin{table} \begin{tabular}{l l} \hline \hline Model & \# Parameters \\ \hline GPT 4 & 1.7t (reportedly) \\ GPT 3.5 & 175b[1] \\ LLaMA & 7b,13b,33b,65b[30] \\ Longformer & 149m[31] \\ BERT-base & 110m[31] \\ \hline \hline \end{tabular} \begin{tabular}{l l} \hline \hline Model & vRAM \\ \hline LLaMA 7B & 14GB \\ LLaMA 13B & 27GB \\ LLaMA 33B & 67GB \\ LLaMA 65B & 133GB \\ \hline \hline \end{tabular} \end{table} Table 1: Comparison of model sizes ### LLM Instruction Datasets We derived our dataset from over 150k uncurated surgical pathology reports containing gross descriptions, final written diagnoses, and ICD condition codes[33] obtained from clinical workflows from the University of Kentucky. ICD codes were used over other condition codes as they were available in new and historical reports. Gross reports describe the characteristics of tissue specimens, and final reports describe the diagnosis based on microscopic review of tissues in conjunction with laboratory results and clinical notes. A single case might contain many tissue specimens, which results in individual gross and final reports. It is common practice in pathology reports to identify gross and final diagnosis specimen results within semi-structured templated text reports, with resulting specimen condition codes assigned to the entire case. The result of this practice is that there is no direct association between case-reported condition codes and specimens. It is common for there to be multiple condition codes per specimen, so conflicting codes can occur within a case. For example, if one specimen is malignant and the other benign, the codes assigned to the case would conflict. As a result of reporting practice, extracting condition codes on a specimen level is a complex NLP challenge. Our motivation for this effort, beyond demonstrating the use of LLMs, is to better identify specimens and their related digital slides for multimodal and vision-based clinical AI efforts. We limited our dataset to cases with cancer-related codes, reducing the potential ICD label range from 70k to 3k. We further eliminated cases that did not include condition codes, or a final report, reducing the dataset case count to 117k. In order to test the performance of various model architectures and parameter sizes, we created three datasets: large (all data), small (10% of large), and tiny (1% of large). For each dataset, code combinations that didn't appear at least 10 times were eliminated. Training and test sets were generated with a 10% code-stratified split. The random sampling of cases in the reduced sets combined with the imposed code distribution requirements provides smaller datasets with more common codes. Given that the condition codes are reported on the case level, we concatenated gross and final reports into a single text input and assigned associated ICD codes as the output label. Each model class and training system has its own format, which we will explain in the following sections. BERT and LongFormer models can be trained with the same datasets. These datasets are most often CSV files, where the first column is the text input and the remaining columns are binary hot-encoded labels indicating label class, as shown in Table 3. LLMs are typically trained using an instruction-based format, where instructions, (optional) input, and model response are provided for one or more interactions in JSON format. For each pathology case, we concatenate all text input into a single \begin{table} \begin{tabular}{l l l l} \hline \hline Input Text & code\_0 & code\_1 & code\_N \\ \hline biopsy basal cell carcinoma type tumor... & 0 & 1 & 0 \\ lateral lesion and consists of tan soft tissue... & 1 & 0 & 0 \\ momentum omentectomy metastatic high grade carcinoma... & 0 & 0 & 1 \\ \hline \hline \end{tabular} \end{table} Table 3: Example BERT and LongFormer training data format sociated codes as the model response. Each case is represented as a single conversation. An example of an abbreviated case instruction is shown in Listing 1. ``` { "from":"human", "value":"rightbaseoftongueinvasivesquamouscellcarcinoma" }, { "from":"gpt", "value":"C12\nC77" } ``` Listing 1: LLM Instruction JSON Format ### Model Training As part of this effort, we trained over 100 models across multiple datasets, model architectures, sizes, and training configurations. For each dataset (tiny, small, and large), we increased model size, where applicable, and training epochs, until the performance of the testing dataset diminished, which we discuss in detail in Section 3, _Results_. All training was conducted on a single server with 4XA100 80G GPUs [34]. For LLaMA 7B and 13B parameter models, the average training time was 25 minutes per epoch and two hours per epoch, respectively. In the following sections, we describe the training process for each unique model architecture. **BERT** and its successor transformer models are available in three forms 1) Foundational model, 2) Extended language model, and 3) Fine-tuned model. Foundational models, as the name would suggest, are trained on a wide corpus of language, which provides a foundational model for fine-tuned tasks, such as code extraction. In areas where common language and words do not adequately represent the applied domain, unsupervised language modeling can be used to train a new model on domain-specific language. For example, the popular BioBERT [35] model, which was trained using biomedical text, has been shown to outperform the foundational BERT model for specific biomedical tasks. Using example Hugging Face transformer language modeling code [36], we trained our own BERT-based language model using case notes as inputs. Except for the removal of condition code columns, the training data is identical to the format shown in Table 3. All BERT models were fine-tuned using example Hugging Face transformer training code [37]. **LongFormer** is a BERT-like model that makes use of a sliding window and sparse global attention, which allows for an increased maximum input token size of 4096 compared to 512 for BERT. While the majority of gross or diagnostic reports would not exceed the capacity of BERT models, the concatenation of report types across all specimens in the case could easily exceed the 512-token limit. LongFormer models, which provide twice the input token size of our local LLM (2048), allow us to test the impacts of maximum token size on BERT-style model performance. No language modeling was performed with LongFormer models, and all models were fine-tuned using example Hugging Face LongFormer transformer training code [38]. **LLaMA-Based LLMs** are by far the most popular local LLM variants. Models can vary based on training data, model size, model resolution, extended context size [39], and numerous training techniques such as LoRA [40] and FlashAttention [41]. Research associated with local LLMs is developing at a very rapid pace, with new models and techniques being introduced daily. The result of such rapid development is that not all features are supported by all training and inference systems. Fortunately, support has coalesced around several projects that provide a framework for various models and experimental training techniques. We make use of one such project named FastChat [42], an open platform for training, serving, and evaluating large language models. The FastChat team released the popular LLaMA-based LLM Vicuna. Following the Vicuna training code described by the FastChat team, we trained our LLMs using our pathology case data in instruction format, as shown in Listing 1. We trained both 7B and 13B parameter LLaMA models across our three datasets. In all cases, our LLaMA-based models were trained with half-precision (fp16). ### Local LLM Hosting As previously noted in Table 1, the sizes of foundational language models have grown significantly since the release of BERT. As model sizes increase, model-level parallelism must be used to spread model layers across multiple GPUs and servers. In addition, model checkpoints themselves can be hundreds of gigabytes in size, resulting in transfer and load latency on model inference. The development of inference services that implement the latest models, techniques, and optimize resource utilization is an active area of research. We make use of vLLM [43], an open platform that supports numerous model types, extensions, and resource optimization. vLLM, and other inference platforms, provide API services, allowing users to decouple inference services from applications. In addition, vLLM includes an OpenAI-compatible API allowing users to seamlessly compare ChatGPT/GPT4 with local LLMs results. Unless otherwise noted, all local LLM performance testing was conducted using vLLMs OpenAI-compatible API. **Generative Pre-trained Transformer Quantization** (GPTQ) [44] is a technique that is used to reduce the GPU memory requirements by lowering the precision of model weights and activations. To match the resolution of the foundational LLaMA models and to reduce resource requirements, local LLMs are commonly trained at half- (fp16) or quarter-precision (int8). However, even at half-precision, the GPU memory requirements are significant and can exceed the capacity of the largest single GPUs, as shown in Table 2. **Quantization for CPUs** has become extremely popular as LLM model sizes and associated resource requirements increase. Using CPU-focused libraries, such as GGML [45], models can be further quantized to even lower precision (int4, int3, int2). High levels of quantization can drastically reduce resource requirements and increase inference speed, allowing LLMs to be run directly on CPUs. As with model size, the performance impacts of precision reduction are highly dependent on the workload. Quantization can occur post-training, allowing a single model to be trained and reduced to various quantization levels for evaluation. Similar to vLLM, LLaMA.cpp [46] is an open platform that focuses on the support of GGML quantized models on CPUs. LLaMA.cpp provides tools to quantize pre-trained models and supports bindings for common languages such as Python, Go, Node.js,.Net, and others. The LLaMA.cpp Python[47] project provides an OpenAI-compatible API, which we use to evaluate quantized local LLMs where indicated. ## 3 Results Seven different model architectures were tested on the three dataset sizes (tiny, small, large). This includes four separate BERT models: BERT-base-uncased, BioClinicalBERT, Pathology-BERT,[48] and UKPathBERT. BERT-base-uncased is the original foundational BERT model, BioClinicalBERT is trained on biomedical and clinical text, PathologyBERT is trained on pathology reports that are external to our institution, and UKPathBERT is our own BERT-base-uncased language model trained on our own pathology report dataset. Additionally, the BERT-like Longformer model with an increased input context size was trained. The performance of these BERT-style models serves as benchmarks and evidence for the complexity of our language tasks. Finally, LLaMA 7b and 13b parameter models were trained using the same datasets in an instruction-based format, which we will refer to as Path-LLaMA. Unlike most other generative LLMs, our intended output is a structured set of condition codes. As previously mentioned, we experimented with pre- and post-processing techniques to ensure structured output. We achieved the best results by ordering condition codes into alphabetical lists separated by line breaks. With the exception of single epoch training of the Path-LLaMA 7b model, deviation (hallucination) from the intended format was not experienced. The stability of the structured output allowed us to statistically evaluate model results as we would other non-generative models. In both generative (LLM) and BERT-style transformer model cases multi-label classification results will be evaluated the same. Accuracy (ACC) refers to the frequency of explicitly correct predicted labels. For example, if a particular case has two labels assigned to it and the model correctly guesses one of them, the accuracy is 0% for that case. Because of this strict method, accuracy is somewhat low compared to the other performance metrics. The AUC (Area Under the ROC Curve) is calculated for each possible class, and the macro (unweighted) average is taken. This was performed using the sklearn metrics[49] package. In the context of multilabel classification, the AUC represents how likely each class is to be labeled correctly. Therefore, similarly to binary classification, an AUC below 0.5 represents that the model performs worse than random chance on average. Similarly, precision, recall, and F1 score are calculated for each class and macro averaged together to produce a final result, using the sklearn metrics package's classification report function. With multilabel classification, precision measures the proportion of correct predictions, while recall measures the proportion of instances that received correct classifications, and the F1 score averages these together. The best results of any architecture were achieved with the LLaMA-based LLM, as seen in Table 4, which shows the overall model performance results, averaged across all datasets and parameter settings, such as number of epochs trained. The largest LLaMA model, with 13 billion parameters, performed the best on average. Both Path-LLaMA models performed significantly better than any other model. The BERT transformers performed poorly on average, but the versions that were trained specifically on pathology-related text outperformed the basic model. The Longformer had better recall than the BERT models because it tends to predict many different codes, meaning it has a higher chance of guessing correctly. However, this brings down the precision and accuracy of this model because many of its guesses are wrong. LLaMA-based models outperform BERT-style models across all evaluation metrics. As expected, larger parameter models tend to outperform smaller models, and models trained within a specific domain, outperform those that are not. In the remainder of this section, we go into more detailed evaluations of model size, numbers of epochs, dataset size, and other potential performance factors. ### Model Size Two most commonly used sizes of LLaMA models 7b and 13b were tested to determine the impact of parameter size on performance. In testing, we observed very similar inference performance of 0.3-0.4 seconds per case between 7b and 13b models using fp16. We attribute this to our multi-gpu test system, which is less utilized with the 7b model, and other overhead of the decoupled API interface. We also tested GGML int4 quantized versions of 7b models, which for results were nearly identical to their fp16 counter parts, but with an inference time of 7.5 seconds per case. Despite the lower precision, CPU-based inference resulted in significantly longer inference times. As seen in Table 4, the larger model performed better on average. However, when compared only to the large datasets, their performance was very similar. Both achieved an F1 score of 0.785, while the 13b model obtained a slightly higher accuracy of 0.742 compared to the 7b model's 0.737. This seems to demonstrate that the increase in size had little effect on performance when compared to the largest dataset. ### Number of Epochs Each model architecture was trained on a range of epochs. The number of epochs tested for each was dependent on two things: model training time (dataset and parameter sizes) and how many epochs it took before the results on the training set no longer improved. The average F1 for each model and the number of epochs are given in Table 5. \begin{table} \begin{tabular}{l l l l l l} \hline \hline & Accuracy & AUC & Precision & Recall & F1 \\ \hline Path-LLaMA 13b & 0.748 & 0.816 & 0.779 & 0.777 & 0.775 \\ Path-LLaMA 7b & 0.647 & 0.763 & 0.68 & 0.674 & 0.674 \\ UKPathBert & 0.058 & 0.506 & 0.059 & 0.059 & 0.059 \\ PathologyBERT & 0.057 & 0.502 & 0.059 & 0.059 & 0.059 \\ BioClinicalBERT & 0.053 & 0.507 & 0.055 & 0.054 & 0.055 \\ BERT-base-uncased & 0.036 & 0.498 & 0.04 & 0.042 & 0.04 \\ Longformer 149m & 0.001 & 0.5 & 0.063 & 0.42 & 0.103 \\ \hline \hline \end{tabular} \end{table} Table 4: Average performance of each model on all datasets This table shows that the number of epochs during training can have a significant impact on the results of the model. In each case, at least six epochs were required to train the best model, in some cases significantly more. Optimal epoch count is very much experimental in practice, as it is highly dependent on the dataset, model parameter size, and other training parameters. ### Dataset Size The average number of words per pathology case was approximately 650, so assuming token counts are 1.25X larger than words, our largest dataset contained over 80M tokens from 100k cases. As previously mentioned, larger datasets include a wider range of condition codes, so in this context, a larger dataset does not necessarily guarantee better performance. The performance of each model on each dataset size is shown in Table 6. BERT and Longformer models all performed best on the smallest dataset, while the LLaMA models performed best on the largest. The smaller dataset is an easier classification problem, with fewer possible class labels and examples, but the larger dataset has more complex data to train from. This seems to further reinforce the superiority of LLaMA compared to the other models. When the dataset is large, the other models fail, while LLaMA only improves with more data, demonstrating its improved capability to learn and correctly classify condition codes compared to the other models. ### Other Result Factors In this section, we cover additional model performance factors, such as the length of input text and the frequency of classification codes in our dataset. The length of the input description for each sample was paired and analyzed with how often that sample was predicted correctly for each model. This was done to determine if, for example, longer descriptions allowed the model to understand the text better and classify \begin{table} \begin{tabular}{l c c c} \hline \hline & Tiny & Small & Large \\ \hline Path-LLaMA 13b & 0.778 & 0.761 & **0.785** \\ Path-LLaMA 7b & 0.641 & 0.764 & **0.783** \\ UKPathBERT & **0.114** & 0.014 & 0.018 \\ PathologyBERT & **0.114** & 0.011 & 0.021 \\ BioClinicalBERT & **0.105** & 0.012 & 0.019 \\ BERT-base-uncased & **0.073** & 0.012 & 0.018 \\ Longformer & **0.206** & 0.025 & 0.009 \\ \hline \hline \end{tabular} \end{table} Table 6: F1 of each model on each dataset \begin{table} \begin{tabular}{l c c c c c c c} \hline \hline & 1 & 3 & 6 & 12 & 24 & 48 & 96 \\ \hline Path-LLaMA 13b & 0.749 & 0.767 & **0.80** & & & & \\ Path-LLaMA 7b & 0.486 & 0.586 & 0.761 & **0.825** & 0.759 & & \\ UKPathBERT & 0.002 & 0.008 & 0.032 & 0.041 & 0.148 & **0.2** & **0.2** \\ PathologyBERT & 0.004 & 0.006 & 0.055 & 0.037 & 0.117 & **0.267** & 0.133 \\ BioClinicalBERT & 0.004 & 0.007 & 0.009 & 0.059 & 0.118 & **0.4** & \\ BERT-base-uncased & 0.015 & 0.007 & 0.007 & 0.016 & 0.088 & **0.2** & 0.133 \\ Longformer & 0.081 & 0.075 & 0.072 & **0.229** & 0.219 & & \\ \hline \hline \end{tabular} \end{table} Table 5: F1 of each model for each number of epochs tested the correct code more often. However, it was found that there was no significant correlation between the length of the description and how often that sample was correctly predicted. We speculate that the complexity of language far outweighed the size of the input context window, as indicated by LongFormer performance. Certain classification codes were far more frequent in the dataset than others. This was especially true for the tiny and small datasets, which might have only ten examples of specific code combinations. The frequency of each code in the dataset was analyzed along with what percentage of the time that code was correctly predicted by the models. Unsurprisingly, it was found that the most common codes were predicted correctly more often when compared to the less common classification codes. Likewise, smaller models performed better with a limited range of codes. ## 4 Conclusion In this paper, we described the end-to-end process of training, evaluating, and deploying a local LLM to perform complex NLP tasks and provide structured output. We analyzed model performance across parameters and data size along with data complexity. We compared these results with BERT-style models trained on the same data. The results of this effort provide overwhelming evidence that local LLMs can outperform smaller NLP models that have been trained with domain knowledge. In addition, we demonstrate that while more latent, LLMs can be deployed without GPUs. While we make no claims that local LLMs provide comparable language processing capabilities to ChatGPT and its successors, technical and policy limitations make local LLMs actionable alternatives to commercial model services. We have also shown that accurate models (such as LLaMA 7b) can be made usable on reasonable CPU/GPU hardware with minimally increased overhead. In future efforts, we aim to explore newer and larger models, such as LLaMA 2 and Falcon. We would like to further explore the impact of LLM context size and post-training context extension on model performance. Finally, we aim to explore the structure of instruction and input training data on model results. With the exception of the identified example dataset, code and instructions to recreate this work can be found in the following repository: [https://github.com/innovationcore/LocalLLMStructured](https://github.com/innovationcore/LocalLLMStructured) ## 5 Acknowledgements The project described was supported by the University of Kentucky Institute for Biomedical Informatics; Department of Pathology and Laboratory Medicine; and the Center for Clinical and Translational Sciences through NIH National Center for Advancing Translational Sciences through grant number UL1TR001998. The content is solely the responsibility of the authors and does not necessarily represent the official views of the NIH.

2303.03242

Evaluating the Fairness of Deep Learning Uncertainty Estimates in Medical Image Analysis

Although deep learning (DL) models have shown great success in many medical image analysis tasks, deployment of the resulting models into real clinical contexts requires: (1) that they exhibit robustness and fairness across different sub-populations, and (2) that the confidence in DL model predictions be accurately expressed in the form of uncertainties. Unfortunately, recent studies have indeed shown significant biases in DL models across demographic subgroups (e.g., race, sex, age) in the context of medical image analysis, indicating a lack of fairness in the models. Although several methods have been proposed in the ML literature to mitigate a lack of fairness in DL models, they focus entirely on the absolute performance between groups without considering their effect on uncertainty estimation. In this work, we present the first exploration of the effect of popular fairness models on overcoming biases across subgroups in medical image analysis in terms of bottom-line performance, and their effects on uncertainty quantification. We perform extensive experiments on three different clinically relevant tasks: (i) skin lesion classification, (ii) brain tumour segmentation, and (iii) Alzheimer's disease clinical score regression. Our results indicate that popular ML methods, such as data-balancing and distributionally robust optimization, succeed in mitigating fairness issues in terms of the model performances for some of the tasks. However, this can come at the cost of poor uncertainty estimates associated with the model predictions. This tradeoff must be mitigated if fairness models are to be adopted in medical image analysis.

Raghav Mehta, Changjian Shui, Tal Arbel

2023-03-06T16:01:30Z

http://arxiv.org/abs/2303.03242v1

# Evaluating the Fairness of Deep Learning Uncertainty Estimates in Medical Image Analysis ###### Abstract Although deep learning (DL) models have shown great success in many medical image analysis tasks, deployment of the resulting models into real clinical contexts requires: (1) that they exhibit robustness and fairness across different sub-populations, and (2) that the confidence in DL model predictions be accurately expressed in the form of uncertainties. Unfortunately, recent studies have indeed shown significant biases in DL models across demographic subgroups (e.g., race, sex, age) in the context of medical image analysis, indicating a lack of fairness in the models. Although several methods have been proposed in the ML literature to mitigate a lack of fairness in DL models, they focus entirely on the absolute performance between groups without considering their effect on uncertainty estimation. In this work, we present the first exploration of the effect of popular fairness models on overcoming biases across subgroups in medical image analysis in terms of bottom-line performance, and their effects on uncertainty quantification. We perform extensive experiments on three different clinically relevant tasks: (i) skin lesion classification, (ii) brain tumour segmentation, and (iii) Alzheimer's disease clinical score regression. Our results indicate that popular ML methods, such as data-balancing and distributionally robust optimization, succeed in mitigating fairness issues in terms of the model performances for some of the tasks. However, this can come at the cost of poor uncertainty estimates associated with the model predictions. This tradeoff must be mitigated if fairness models are to be adopted in medical image analysis. Uncertainty, Fairness, Classification, Segmentation, Regression, Brain Tumour, Skin Lesion, Alzheimer's Disease ## 1 Introduction Deep Learning (DL) models have shown great potential in many clinically relevant applications (e.g. diabetic retinopathy (DR) diagnosis (Gulshan et al., 2016)). Deployment of the resulting models into real-world clinical contexts, and in particular maintaining clinicians' trust, requires that robustness and fairness across different sub-populations are maintained1. Unfortunately, several studies have indeed exposed significant biases in DL models across sub-populations (e.g. according to race, sex, age) in the context of medical image analysis (Zong et al., 2022). For example, in Larrazabal et al. (2020), it is shown that a Computer-Assisted Diagnosis system trained on a predominantly male dataset for diagnosing thoracic diseases gives lower performance when tested on female patient images (here, the underrepresented sex). In Burlina et al. (2021), the authors show how data imbalance in the training dataset leads to a disparity in accuracies across sub-populations (dark vs. light skinned individuals) in the diagnosis of DR. Similar issue of racial bias for groups under-represented in the training data is reported for various medical image analysis tasks such as X-ray pathology classification (Seyyed-Kalantari et al., 2021), cardiac MR image segmentation (Puyol-Anton et al., 2021), and brain MR segmentation (Ioannou et al., 2022). Several methods have been proposed in the machine learning literature to mitigate the lack of fairness (Mehrabi et al., 2021) in the models. This includes data balancing (Japkowicz and Stephen, 2002; Idrissi et al., 2022), which was shown to be successful for some medical imaging contexts (Puyol-Anton et al., 2021; Ioannou et al., 2022). In the machine learning and computer vision fairness literature, the objective is to bridge the performance gap across subgroups with different attributes. It is well established in the literature (Du et al., 2020; Zietlow et al., 2022), however, that fairness across different subgroups can come at the cost of poor overall performance. In those fields, they do not consider the effect of the bias mitigation methods on the uncertainties associated with the model output. In medical image analysis, however, it has been shown that real clinical contexts would benefit from knowledge about the confidence in the model predictions, when made explicit in the form of uncertainties (Band et al., 2021). Specifically, trust would be established should uncertainties associated with the predictions be higher when the model is incorrect, and low where model outputs are correct. Various successful frameworks for quantifying models uncertainties in the context of medical image analysis have been presented for tasks such as image segmentation (Nair et al., 2020; Jungo and Reyes, 2019), image synthesis (Tanno et al., 2021; Mehta and Arbel, 2018), and image classification (Molle et al., 2019; Ghesu et al., 2019). However, these methods only analyze the output uncertainties for the entire population, without consideration of the results for population subgroups. In this work, we conjecture that uncertainty quantification can help mitigate some potential risks in clinical deployment related to a lack of robustness and fairness for under-represented populations. However, the uncertainties will only help clinicians make more informed decisions if they are accurate. Specifically, a machine learning model that under-performs for an under-represented subgroup should indicate high uncertainties associated with its output for that subgroup. Conversely, a machine learning model that achieves fairness in terms of performance across different subgroups, but produces low uncertainties for predictions where it makes mistakes, would become less trustworthy to clinicians. In this paper, we present the first analysis of the effect of popular fairness models at overcoming biases of DL models across subgroups for various medical image analysis tasks, and investigate and quantify their effects on the estimated output uncertainties. Specifically, we perform extensive experiments on three different clinically relevant tasks: (i) multi-class skin lesion classification (Codella et al., 2019), (ii) multi-class brain tumour segmentation (Bakas et al., 2018), and (iii) Alzheimer's disease clinical score (Jack Jr et al., 2008) regression. Our results indicate a lack of fairness in model performance for under-represented groups. The uncertainties associated with the outputs behave differently across different groups. We show that popular methods designed to mitigate the lack of fairness, specifically data balancing (Puyol-Anton et al., 2021; Ioannou et al., 2022; Idrissi et al., 2022; Zong et al., 2022) and robust optimization (Sagawa et al., 2019; Zong et al., 2022) do indeed improve fairness for some tasks. However, this comes at the expense of poor performance of the estimated uncertainties in some cases. This tradeoff must be mitigated if fairness models are to be adopted in medical image analysis. ## 2 Methodology: Fairness in Uncertainty Estimation This paper aims to evaluate the effectiveness of various popular machine learning fairness models at mitigating biases across subgroups in various medical image analysis contexts in terms of (a) the absolute performance of the models and (b) the uncertainty estimates across the subgroups. Although general, the framework and associated notations focus on binary sensitive attributes (e.g., sex, binarized ages, disease stages). Consider a dataset \(D=\{X,Y,A\}=\{(x_{i},y_{i},a_{i})\}_{i=1}^{N}\) with N total samples. Here, \(x_{i}\in\mathbb{R}^{P\times Q}\) or \(x_{i}\in\mathbb{R}^{P\times Q\times S}\) represents 2D or 3D input image, \(y_{i}\) represents corresponding ground truth labels, and \(a_{i}=\{0,1\}\) represents the sensitive binary group-attribute. \(y_{i}\) depends on the task at hand: \(y_{i}\in\{0,1,..,C\}\) for image-level classification, \(y_{i}\in\mathbb{R}\) for image-level regression, and \(y_{i}\in\{0,1,..C\}^{P\times Q}\) or \(y_{i}\in\{0,1,..C\}^{P\times Q\times S}\) for 2D/3D voxel-level segmentation. The dataset can be further divided into subgroups, \(A=\{0,1\}\), based on the value of the sensitive attribute: (i) \(D^{0}=\{X^{0},Y^{0},A=0\}=\{(x_{i}^{0},y_{i}^{0},a_{i}=0)\}_{i=1}^{M}\) and (ii) \(D^{1}=\{X^{1},Y^{1},A=1\}=\{(x_{i}^{1},y_{i}^{1},a_{i}=0)\}_{i=1}^{L}\), where \(M+L=N\). Let us consider a deep learning model \(f(.,\theta)\) that produces a set of outputs \(\hat{Y}=f(X,\theta)\) for a set of input images, \(X\). The goal here is to define a global fairness metric that is applicable and consistent across a wide variety of tasks (e.g. classification, segmentation, regression). The majority of the fairness metrics (Hinnefeld et al., 2018) are only defined for the classification task. There has been some recent work related to the fairness of segmentation models (Puyol-Anton et al., 2021; Ioannou et al., 2022), where fairness gap metrics are aligned with the one presented in this work. To our knowledge, fairness in medical imaging regression has not yet been explored. Fairness can be defined as follows: A machine learning model is considered to be fair if the difference in the task-specific performance metric between different subgroups is low. To that end, a general fairness gap (FG) metric calculates the differences in the task-specific evaluation metric (EM) values between \(\hat{Y}\) and \(Y\) conditioned on a binary sensitive attribute \(A\). \[\text{FG}(A=0,A=1)=|\text{EM}(Y^{0},\hat{Y}^{0})-\text{EM}(Y^{1},\hat{Y}^{1})|. \tag{1}\] A machine learning model is fair for the sensitive attribute \(A\) if \(\text{FG}(A=0,A=1)=0\). EM differs depending on the task at hand. Accuracy for image classification, Dice value for segmentation, and mean squared error for image-level regression. EM is calculated for each image separately and then averaged across the dataset for a voxel-level segmentation task. For image classification or regression tasks, EM is calculated directly at a dataset level. In this work, we focus on Bayesian deep learning (BDL) models (Neal, 2012; Gal and Ghahramani, 2016; Lakshminarayanan et al., 2017; Smith and Gal, 2018), which are widely adopted within the medical image analysis community given their ability to produce uncertainty estimates, \(\hat{u_{i}}\), associated with the model output \(\hat{y_{i}}\). Popular uncertainty estimates include sample variance, predicted variance, entropy, and mutual information (Kendall and Gal, 2017; Gal et al., 2017). Uncertainties \(\hat{u}_{i}\) are typically normalized between 0 (low uncertainty) and 100 (high uncertainty) across the dataset. In the medical image analysis literature, the quality of the estimated uncertainties is evaluated based on the objective of being correct when confident and highly uncertain when incorrect (Mehta et al., 2022; Nair et al., 2020; Lakshminarayanan et al., 2017). To this end, all predictions whose output uncertainties (\(\dot{u_{i}}\)) are above a threshold (\(\tau\)) are filtered (labeled as uncertain). The EM is calculated on the remaining certain predictions (\(\hat{Y}_{\tau}\) and \(Y_{\tau}\)) (below the threshold): \[\text{FG}_{\tau}(A=0,A=1)=|\text{EM}_{\tau}(Y_{\tau}^{0},\hat{Y}_{\tau}^{0})- \text{EM}_{\tau}(Y_{\tau}^{1},\hat{Y}_{\tau}^{1})|. \tag{2}\] At \(\tau=100\), equations 1 and 2 become equivalent. A higher degree of fairness in uncertainty estimation is established through a reduced fairness gap (\(\text{FG}_{\tau 1}\leq\text{FG}_{\tau 2}\)) when the number of filtered uncertain predictions increases. In other words, when the uncertainty threshold is reduced (\(\tau 1<\tau 2\)), thereby increasing the number of filtered uncertain predictions, the differences in the performances on the remaining confident predictions across the subgroups should be reduced. However, this decrease should not lead to a reduction in overall performance. In other words, it is desirable that \(EM_{\tau 1}\geq EM_{\tau 2}\). Conversely, an increase in the fairness gap (\(\text{FG}_{\tau 1}>\text{FG}_{\tau 2}\)) indicates the undesirable effect of having a higher degree of confidence in incorrect predictions for one of the subgroups. ## 3 Experiments and Results Extensive experimentation involves comparisons of two established fairness models against a baseline: (i) A **Baseline-Model**: trained on a dataset without consideration of any subgroup information; (ii) A **Balanced-Model**: trained on a dataset where each subgroup contains an equal number of samples during the training, an established baseline fairness model that focuses on mitigating biases due to data imbalance (Puyol-Anton et al., 2021; Ioannou et al., 2022; Idrissi et al., 2022); (iii) A **GroupDRO-Model**: trained with GroupDRO loss (Sagawa et al., 2019) to re-weigh the loss for each subgroup, thereby mitigating lack of fairness through the optimization procedure. The number of images in the test set is the same across all subgroups for fair comparisons. ### Multi-class skin lesion classification Skin cancer is the most prevalent type of cancer in the United States (Guy Jr et al., 2015), which can be diagnosed by classifying skin lesions into different classes. Dataset and Sensitive Attribute Rationale:We use the publicly available International Skin Imaging Collaboration (ISIC) 2019 dataset (Codella et al., 2019) for multi-class skin lesion classification. A dataset of 24947 dermoscopic images is provided, with 8 associated disease scale labels, and with high class imbalance. Demographic patient information (e.g. age, gender) is also provided. We consider age as the sensitive attribute (\(a_{i}\)). Following (Zong et al., 2022), the entire dataset is divided into two subsets: patient images with age \(\geq 60\) in subgroup \(D^{0}\) with a total of 10805 images, and patients with age \(<60\) in subgroup \(D^{1}\) with a total of 14045 images2. The **Baseline-Model** and the **GroupDRO-Model** are trained on a training dataset where subgroup \(D^{0}\) contains 8260 images, while subgroup \(D^{1}\) contains 10892 images. While it appears that subgroup \(D^{1}\) contains approximately 32% more images, it is not strictly the case for all eight classes. A **Balanced-Model** is trained on a training dataset where both subgroup \(D^{0}\) and subgroup \(D^{1}\) contain 7251 images. Both subgroups are balanced for each of the eight classes of the dataset (but not the same across the eight classes). Implementation Details:An ImageNet pre-trained ResNet-18 (He et al., 2016) model is trained on this dataset. The evaluation metrics (EM) are overall accuracy, overall macro-averaged AUC-ROC, and class-level accuracy. The predictions' uncertainty is measured through the entropy of an Ensemble Dropout model (Smith and Gal, 2018). Results:For the **Baseline-Model**, all four plots in Figure-1(a) show a high fairness gap between the two subgroups when fewer predictions are filtered based on uncertainties (left side of the graph). When filtering more predictions (moving towards the right side of the curve), an increase in the accuracy for each subgroup and a reduction in the fairness gap can be observed. This demonstrates that the model might be incorrect for more images in one of the subgroups, but it usually has _higher uncertainty_ in those predictions compared to the other subgroup. Overall Accuracy (Column 1) in Figure-1(b) shows that compared to the **Baseline-Model**, the **Balanced-Model** produces a reduced fairness gap between two subgroups at a low number of filtered predictions (left side of the graph), but at the cost of reduced overall accuracy for each subgroup. The overall accuracy for each subgroup increases with higher uncertainty filtering (towards the right side of the graph). Still, it comes at the expense of a _higher fairness gap_. For classes with a lower number of total images, such as Dermatofibroma in Column 3, filtering out more predictions de Figure 1: Overall and class-level accuracy (for three classes) against (100 - uncertainty threshold) for (a) **Baseline-Model**, (b) **Balanced-Model**, and (c) **GroupDRO-Model** on the ISIC dataset. Results are shown overall and for each subgroup (\(D^{0}\): age \(>=60\), \(D^{1}\): age \(<60\)). For Fairness Gap (FG) refer axis labels on the right. creases overall performance for one of the subgroups. This shows that while data balancing could enable better fair models at absolute prediction performance level, it comes at the cost of poor uncertainty estimates. Figure-1(c) shows that the **GroupDRO-Model** gives better overall accuracy and better class-wise accuracy compared to the **Baseline-Model** for classes with a high number of total samples (e.g., Melanoma - Column 2, Basal cell carcinoma - Column 4). But it also shows a high fairness gap when a low number of predictions are filtered (left side of the graph). The fairness gap reduces by filtering more predictions. However, it is not completely mitigated for all of the classes. Overall accuracy and classwise-accuracy for classes with a lower number of samples (ex. Dermatofibroma in Column 3) see a marginal increase in the fairness gap with uncertainty-based filtering. Results indicate that the **GroupDRO-Model** might give marginally better absolute performance than the **Baseline-Model**, but it does not produce fair uncertainty estimates across subgroups. Similarly, it can be concluded that different models do not behave consistently across different classes, both in terms of fairness gap and uncertainty evaluation. It indicates that a single model cannot reduce fairness gap and also provide good uncertainty estimation. More results for all eight classes and three models are given in the Appendix-A. ### Brain Tumour Segmentation Automatic segmentation of brain tumours can assist in better and faster diagnosis procedures and surgical planning. Dataset and Sensitive Attribute Rationale:We use the 260 High-Grade Glioma images from the publicly available Brain Tumour Segmentation (BraTS) 2019 challenge dataset (Bakas et al., 2018). The choice for how to split the dataset is based on finding a subgroup where a performance gap is clearly present based on the provided metrics. There can be a number of such subgroups. We initially ran experiments whereby the dataset was split based on imaging centers (i.e. binary subgroups: TCIA vs non-TCIA). Our results, included in the Appendix-B.1, indicated that there is no bias across the resulting groups. It is well established that there is a significant bias in the BraTS dataset, whereby the performance of small tumour segmentation is significantly worse than that of large tumour segmentation. This is an important bias to overcome. The image dataset is therefore divided into two subsets based on the volume of the enhancing tumour: 206 images with volumes \(>7000\)ml\({}^{3}\) in subgroup \(D^{0}\) and 54 images with volumes \(\leq 7000\)ml\({}^{3}\) in subgroup \(D^{1}\). **Baseline-Model** and **GroupDRO-Model** are trained on a dataset of 168 samples from \(D^{0}\) and 30 samples from \(D^{1}\). While a **Balanced-Model** is trained on a balanced training set with 30 samples from each subgroup. Implementation Details:A 3D U-Net (Cicek et al., 2016; Nair et al., 2020) is trained for tumour segmentation. Following the BraTS dataset convention, tumour segmentation performance is evaluated by calculating Dice scores for three different tumour sub-types: enhancing tumor, whole tumor, and tumour core. The predictions' uncertainty is measured through the entropy of an Ensemble Dropout model (Smith and Gal, 2018). Results:Figure 2 shows that both the **Baseline-Model** and the **GroupDRO-Model** perform similarly for whole tumour (WT) across both subgroups, as an increase in Dice and decrease in the fairness gap is observed with filtering of more voxels in the images (go ing from left to right in the graph). For the **Balanced-Model** though initially (left most at an uncertainty threshold of 100) the fairness gap is lower compared to the other two models, it increases with the filtering of more voxels in the images. Tumour core (TC) and enhancing tumour (ET) follow a similar trend, where both the **Baseline-Model** and the **GroupDRO-Model** perform similarly. Although for both TC and ET, the **Balanced-Model** doesn't show an increase in the fairness gap between the two subgroups with a decrease in uncertainty threshold (moving from left to right), a decrease in overall performance for both subgroups is observed. This shows that mitigating the fairness gap by filtering out more voxels is insufficient and may lead to a drop in performance in both subgroups. It can be concluded that for a challenging dataset like BraTS, the **Balanced-Model** or the **GroupDRO-Model** do not produce fair uncertainty estimates across different subgroups. Figure 2: Averaged sample Dice as a function of (100 - uncertainty threshold) for (a) **Baseline-Model**, (b) **Balanced-Model**, and (c) **GroupDRO-Model** on the BraTS dataset. Dice results for whole tumour (WT), tumour core (TC), and enhancing tumour (ET), for both the \(D^{0}\) and \(D^{1}\), set are shown in each column. For Fairness Gap (FG) refer axis labels on the right. ### Alzheimer's Disease Clinical Score Regression Alzheimer's disease (AD) is the most common neurodegenerative disorder in elderly people (Goedert and Spillantini, 2006). For AD, clinicians treat symptoms based on structured clinical assessments (e.g., Alzheimer's Disease Assessment Scale - ADAS-13 (Rosen et al., 1984), Mini-Mental State Examination - MMSE (Folstein et al., 1975)). Dataset and and Sensitive Attribute Rationale:Experiments are based on the MRIs of a subset (865 patients) of the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset (Jack Jr et al., 2008) at different stages of diagnosis: Alzheimer's Disease (145), Mild Cognitive Impairment (498), and Cognitive Normal (222). The dataset also provides demographic patient information such as age and gender. Here, we consider age as a sensitive attribute (\(a_{i}\)). The dataset is divided such that patients with age \(<70\) are grouped into \(D^{0}\) (259 patient images), and patients with age \(\geq 70\) are grouped into \(D^{1}\) (606 patient images). The threshold for the sensitive attribute was chosen due to the clear performance gap between these subgroups. A **Baseline-Model** and a **GroupDRO-Model** are trained on a dataset that contains 163 samples from \(D^{0}\) and 440 samples from \(D^{1}\). A **Balanced-Model** is trained with 163 samples from each subgroup. Implementation Details:A multi-task 3D ResNet-18 model (Hara et al., 2018) is trained on this dataset to regress ADAS-13 and MMSE scores. Root Mean Squared Error (RMSE) is used as an evaluation metric (EM), where a lower value of RMSE represents better performance. Bayesian Deep Learning model with Ensemble Dropout (Smith and Gal, 2018) is used. A combination of Sample Variance and Predicted Variance, known as total variance (Kendall and Gal, 2017), is used to measure uncertainty associated with the model output. Figure 3: Root Mean Squared Error (RMSE) of ADAS-13 (Top) and MMSE (Bottom) scores as a function of (100-uncertainty threshold) for (a) **Baseline-Model**, (b) **Balanced-Model**, and (c) **GroupDRO-Model** on the ADNI dataset. Specifically, we plot RMSE for each subgroup (\(D^{0}\) with age \(<70\) and \(D^{1}\) with age \(\geq 70\)). For Fairness Gap (FG) refer axis labels on the right. Results:Figure 3 shows that compared to the **Baseline-Model**, the **Balanced-Model** only marginally decreases the fairness gap in the initial performance between two subgroups, that too at the cost of poor (higher RMSE) absolute performance for each subgroups. The **GroupDRO-Model** shows better absolute performance (lower RMSE) and also a lower fairness gap between each subgroup compared to the other two models. The **Baseline-Model** shows a decrease in the fairness gap between subgroups with a decrease in uncertainty threshold (moving from left to right) for MMSE, but it is not true for ADAS-13. On the contrary, the **Balanced-Model** shows an increase in the fairness gap with a decreased uncertainty threshold for both ADAS-13 and MMSE. The **GroupDRO-Model** gives the best performance as the fairness gap decreases with a decrease in uncertainty threshold. ## 4 Conclusions In medical image analysis, accurate uncertainty estimates associated with deep learning predictions are necessary for their safe clinical deployment. This paper presented the first exploration of fairness models that mitigate biases across subgroups, and their subsequent effects on uncertainty quantification accuracy. Results on a wide range of experiments for three different tasks indicate that popular fairness methods, such as data balancing and robust optimization, do not work well for all tasks. Furthermore, mitigating fairness in terms of performance can come at the cost of poor uncertainty estimates associated with the outputs. Future work is required to overcome these additional fairness issues prior to clinical deployment of these models. Additional experiments are required to generalize the conclusions presented here, including the exploration of different uncertainty measures (e.g. conformal prediction (Angelopoulos and Bates, 2021)), additional sensitive attributes and associated thresholds, and consideration of multi-class (non binary) attributes. ## Acknowledgments This investigation was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada, the Canada Institute for Advanced Research (CIFAR) Artificial Intelligence (AI) Chairs program.

2303.14058

Newton's methods for solving linear inverse problems with neural network coders

Neural networks functions are supposed to be able to encode the desired solution of an inverse problem very efficiently. In this paper, we consider the problem of solving linear inverse problems with neural network coders. First we establish some correspondences of this formulation with existing concepts in regularization theory, in particular with state space regularization, operator decomposition and iterative regularization methods. A Gauss-Newton's method is suitable for solving encoded linear inverse problems, which is supported by a local convergence result. The convergence studies, however, are not complete, and are based on a conjecture on linear independence of activation functions and its derivatives.

Otmar Scherzer, Bernd Hofmann, Zuhair Nashed

2023-03-24T15:08:42Z

http://arxiv.org/abs/2303.14058v1

# Newton's methods for solving linear inverse problems with neural network coders ###### Abstract Neural networks functions are supposed to be able to encode the desired solution of an inverse problem very efficiently. In this paper, we consider the problem of solving linear inverse problems with neural network coders. First we establish some correspondences of this formulation with existing concepts in regularization theory, in particular with state space regularization, operator decomposition and iterative regularization methods. A Gauss-Newton's method is suitable for solving encoded linear inverse problems, which is supported by a local convergence result. The convergence studies, however, are not complete, and are based on a conjecture on linear independence of activation functions and its derivatives. that the solution of Equation 1.2 is a natural image, or in other words that it can be represented as a combination of neural network functions, we get the operator equation \[N(\vec{p}\,)=F\Psi(\vec{p}\,)=\mathbf{y}, \tag{1.3}\] where \(\Psi:\vec{P}\to\mathbf{X}\) is the before mentioned nonlinear operator that maps neural network parameters to image functions. We call * \(\mathbf{X}\) the _image space_ and * \(\mathbf{Y}\) the _data space_, in accordance with a terminology, which we generated in [2, 1]. * \(\vec{P}\) is called the _parameter space_. We make a different notation for \(\vec{P}\), because it represents parametrizations, and is often considered a space of vectors below. The advantage of this ansatz is that the solution of Equation 1.2 is sparsely coded. However, the price to pay is that the reformulated Equation 1.3 is nonlinear. Operator equations of the form of Equation 1.3 are not new: They have been studied in abstract settings for instance in the context of * _state space regularization_[8] and * in the context of the _degree of ill-posedness_[15, 20, 21, 24, 25] as well as of the _degree of nonlinearity_[24] of nonlinear ill-posed operator equations. * Another related approach is _finite dimensional approximation_ of regularization in Banach spaces (see for instance [42]). Particularly, finite dimensional approximations of regularization methods with neural network functions (in the context of frames and _deep synthesis regularization_) have been studied in [38]. In this paper we aim to link the general regularization of the degree of ill-posedness and nonlinearity with coding theory. We investigate generalized Gauss-Newton's methods for solving Equation 1.3; Such methods replace the inverse of standard Newton's method by approximations of outer inverses (see [37]). The outline of the paper is as follows: In Section 2 we review two decomposition cases as stated in [21] first, one of them is Equation 1.3. The study of decomposition cases follows the work on classifying inverse problems and regularization (see [33]). For operators associated to Equation 1.3, Newton's methods seem to be better suited than gradient descent methods, which we support by a convergence analysis (see Section 3). Section 3.4 is devoted to solving Equation 1.3, where \(\Psi\) is a shallow neural network synthesis operator. ## 2. Decomposition cases We start with a definition for nonlinear operator equations possessing forward operators that are compositions of a linear and a nonlinear operator. Precisely, we distinguish between a first decomposition case (i), where the linear operator is the inner operator and the nonlinear is the outer one, and a second decomposition case (ii), where the nonlinear operator is the inner operator and the linear is the outer operator. **Definition 2.1** (Decomposition cases): Let \(\vec{P},\mathbf{X},\mathbf{Y}\) be Hilbert-spaces. 1. An operator \(N\) is said to satisfy the _first decomposition case_ in an open, non-empty neighborhood \(\mathcal{B}(\vec{p}^{\,\dagger};\rho)\subseteq\vec{P}\) of some point \(\vec{p}^{\,\dagger}\) if there exists a linear operator \(F:\vec{P}\to\mathbf{X}\) and a nonlinear operator \(\Psi:\mathbf{X}\to\mathbf{Y}\) such that \[N(\vec{p}\,)=\Psi(F\vec{p}\,)\text{ for }\vec{p}\,\in\mathcal{B}(\vec{p}^{\, \dagger};\rho).\] 2. \(N\) is said to satisfy the _second decomposition case_ in a neighborhood \(\mathcal{B}(\vec{p}^{\,\dagger};\rho)\subseteq\vec{P}\) of some point \(\vec{p}^{\,\dagger}\) if there exists a linear operator \(F:\mathbf{X}\to\mathbf{Y}\) and a nonlinear operator \(\Psi:\vec{P}\to\mathbf{X}\) such that \[N(\vec{p}\,)=F\Psi(\vec{p}\,)\text{ for }\vec{p}\,\in\mathcal{B}(\vec{p}^{\, \dagger};\rho).\] (2.1) Typically it is assumed that the nonlinear operator \(\Psi\) is well-posed. **Remark 2.2** (First decomposition case): In [21], this decomposition case has been studied under structural conditions, relating the second derivative of \(N\) with the first derivative. Under such assumptions convergence rates conditions (see [21, Lemma 4.1]) could be proven. The first decomposition case also arises in inverse option pricing problems in math finance (see [19] and [23, Sect.4]), where the ill-posed compact linear integration operator occurs as inner operator and a well-posed Nemytskii operator as outer operator. **Remark 2.3** (Second decomposition case): Regularization methods for solving operator equations with operators satisfying the second order decomposition case, see Equation 2.1, were probably first analyzed in [8] under the name of _state space regularization_. They considered for instance Tikhonov-type regularization methods, consisting in minimization of \[J_{\lambda}(\vec{p}\,)=\left\|F\Psi(\vec{p}\,)-\mathbf{y}\right\|_{\mathbf{Y}} ^{2}+\lambda\left\|\Psi(\vec{p}\,)-\tilde{\mathbf{x}}\right\|_{\mathbf{X}}^{ 2}, \tag{2.2}\] where \(\tilde{\mathbf{x}}\) is a prior and \(\lambda>0\) is a regularization parameter. In [8] they derived estimates for the second derivative of \(J_{\lambda}(\vec{p}_{\lambda})(\mathbf{h},\mathbf{h})\), where \(\mathbf{h}\in\vec{P}\), that is for the curvature of \(J_{\lambda}\). If the curvature can be bounded from below by some terms \(\left\|\mathbf{h}\right\|_{\vec{p}}^{2}\) then, for instance, a locally unique minimizer of \(J_{\lambda}\) can be guaranteed and also domains can be specified where the functional is convex. Conditions, which guarantee convexity are called _curvature to size conditions_. Subsequently, these decomposition cases have been studied exemplarily in [21]. The theory developed there directly applies to Equation 1.3. Instead of \(J_{\lambda}\) researchers often study direct regularization with respect to \(\vec{p}\,\). For instance in [13] functionals of the form \[J_{\lambda}(\vec{p}\,)=\left\|F\Psi(\vec{p}\,)-\mathbf{y}\right\|_{\mathbf{Y} }^{2}+\lambda\mathcal{L}(\vec{p}\,), \tag{2.3}\] where \(\mathcal{L}\) is some functional directly regularizing the parameter space. Typically \(\mathcal{L}\) is chosen to penalize for sparsity of parameters. The main difference between Equation 2.2 and Equation 2.3 is that in the prior regularization is performed with respect to the image space \(\mathbf{X}\) and in the later with respect to the parameter space \(\vec{P}\). Well-posedness of the functional \(J_{\lambda}\) in Equation 2.2 follows if \(F\circ\Psi\) is lower-semicontinuous, which in turn follows if \(\Psi\) is invertible. In the following we study the solution of decomposable operator equations, such as Equation 1.3, with Gauss-Newton's methods. Decomposition cases have been used in the analysis of iterative regularization methods as well (see [29]): **Definition 2.4** (Strong tangential cone condition): Let \(N:\mathcal{D}(N)\subset\vec{P}\to\mathbf{Y}\) with \(\mathcal{D}(N)\) its domain be a nonlinear operator. * Then \(N\) is said to satisfy the strong tangential cone condition, originally introduced in [17], if \[N^{\prime}(\vec{p_{2}}\,)=R_{\vec{p}_{2},\vec{p}_{1}}N^{\prime}(\vec{p}_{1}) \text{ for all }\vec{p}_{1},\vec{p}_{2}\in\mathcal{D}(N).\] (2.4) where \[\left\|R_{\vec{p}_{2},\vec{p}_{1}}-I\right\|\leq C_{T}\left\|\vec{p}_{2}-\vec {p}_{1}\right\|_{\vec{P}}.\] (2.5) * In [5] the _order reversed_ tangential cone condition, \[N^{\prime}(\vec{p}_{2}\,)=N^{\prime}(\vec{p}_{1})R_{\vec{p}_{2},\vec{p}_{1}} \text{ for all }\vec{p}_{1},\vec{p}_{2}\in\mathcal{D}(N),\] (2.6) together with Equation 2.5, has been introduced. **Remark 2.5**: Equation 2.4 has been used for analyzing _gradient descent methods_ (see for instance [17, 29]). For the analysis of Newton's methods Equation 2.6 has been used (see [5, 29]). The relation to the decomposition cases is as follows: **Lemma 2.6**: _Let \(N:\mathcal{D}(N)\subseteq\vec{P}\to\mathbf{Y}\) with \(\mathcal{D}(N)=\mathcal{B}(\vec{p}^{\uparrow};\rho)\) satisfy the second decomposition case and assume that \(\Psi^{\prime}(\vec{p}\,)\) is invertible for \(\vec{p}\,\in\mathcal{D}(N)\). Then \(N\) satisfies Equation 2.6._ _Proof:_ If \(N\) satisfies the second decomposition case, Equation 2.1, then \(N^{\prime}(\vec{p}\,)=F\Psi^{\prime}(\vec{p}\,)\) for all \(\vec{p}\,\in\mathcal{D}(N)\). Note, that because \(F\) is defined on the whole space \(\mathbf{X}\), \(\mathcal{D}(N)=\mathcal{D}(\Psi)\). By using the invertability assumption on \(\Psi\) we get \[N^{\prime}(\vec{p}_{2}\,)=F\Psi^{\prime}(\vec{p}_{2}\,)=F\Psi^{\prime}(\vec{p} _{1}\,)\underbrace{\Psi^{\prime}(\vec{p}_{1}\,)^{-1}\Psi^{\prime}(\vec{p}_{2}\,) }_{=:R_{\vec{p}_{2},\vec{p}_{1}}}=N^{\prime}(\vec{p}_{1})R_{\vec{p}_{2},\vec{p} _{1}},\] which gives the assertion. As we have shown, decomposition cases have been extensively studied in the regularization literature. One conclusion out of these studies is that the order reversed tangential cone condition Equation 2.6 is suitable for analyzing Newton's methods [5, 29] and thus in turn for the coded linear operator Equation 1.3 because of Lemma 2.6. The standard tool for analyzing Newton's methods is the Newton-Mysovskii condition as discussed below. ## 3 The Newton-Mysovskii Conditions In this section we put abstract convergence conditions for Newton type methods in context with decoding. We consider first Newton's methods for solving the _general_ operator Equation 1.1. Decomposition cases of the operator \(N\) will be considered afterwards. ### Newton's method with invertible linearizations For Newton's methods _local convergence_ is guaranteed under _Newton-Mysovskii_ conditions. For comparison reasons, we first recall a simple Newton's method analysis in finite dimensional spaces if the nonlinear operator has derivatives which are invertible. The proof of more general results, such as Theorem 3.6 below, applies here as well, and thus here the proof is omitted. Several variants of Newton-Mysovskii conditions have been proposed in the literature (see for instance [11, 12, 37]). Analysis of Newton's method was an active research area in the last century, see for instance [39, 46]. **Theorem 3.1** (Finite dimensional Newton's method): _Let \(N:\mathcal{D}(N)\subseteq\mathds{R}^{n}\to\mathds{R}^{n}\) be continuously Frechet-differentiable on a non-empty, open and convex set \(\mathcal{D}(N)\). Let \(\vec{p}^{\,\dagger}\in\mathcal{D}(N)\) be a solution of Equation 1.1. Moreover, we assume that_ 1. \(N^{\prime}(\vec{p}\,)\) _is invertible for all_ \(\vec{p}\,\in\mathcal{D}(N)\) _and that_ 2. _the_ Newton-Mysovskii condition _holds: That is, there exist some_ \(C_{N}>0\) _such that_ \[\begin{split}\big{\|}N^{\prime}(\vec{q}\,)^{-1}(N^{\prime}(\vec{p }+s(\vec{q}\,-\vec{p}\,))-N^{\prime}(\vec{p}\,))(\vec{q}\,-\vec{p}\,)\big{\|}_ {\vec{p}}\leq sC_{N}\,\|\vec{p}\,-\vec{q}\,\|_{\vec{P}}^{2}\\ \text{for all }\vec{p}\,,\vec{q}\,\in\mathcal{D}(N),s\in[0,1]. \end{split}\] (3.1) _Let \(\vec{p}^{\,0}\in\mathcal{D}(N)\) which satisfies_ \[\overline{\mathcal{B}(\vec{p}^{\,0};\rho)}\subseteq\mathcal{D}(N)\text{ with }\rho:=\big{\|}\vec{p}^{\,\dagger}-\vec{p}^{\,0}\big{\|}_{\vec{P}}\text{ and }h:=\frac{\rho C_{I}C_{L}}{2}<1. \tag{3.2}\] _Then the Newton's iteration with starting point \(\vec{p}^{\,0}\),_ \[\vec{p}^{\,k+1}=\vec{p}^{\,k}-N^{\prime}(\vec{p}^{\,k})^{-1}(N(\vec{p}^{\,k} )-\mathbf{y})\quad k\in\mathds{N}_{0}, \tag{3.3}\] _satisfies that the iterates \(\big{\{}\vec{p}^{\,k}:k=0,1,2,\dots\big{\}}\) belong to \(\overline{\mathcal{B}(\vec{p}^{\,0};\rho)}\) and converge quadratically to \(\vec{p}^{\,\dagger}\in\overline{\mathcal{B}(\vec{p}^{\,0},\rho)}\)._ Now, we turn to the case that \(N\) is a decomposition operator. ### Newton-Mysovskii conditions with composed operator Now, we study the case of convergence of Gauss-Newton's methods where \(N:\vec{P}\to\mathbf{Y}\) with \(\vec{P}=\mathds{R}^{n_{*}}\) and \(\mathbf{Y}\) is an infinite dimensional Hilbert space, where \(F:\mathbf{X}\to\mathbf{Y}\) is linear and bounded and \(\Psi:\vec{P}=\mathds{R}^{n_{*}}\to\mathbf{X}\). In this case the Moore-Penrose inverse, or even more general the outer inverse, replaces the inverse in a classical Newton's method (see Equation 3.3), because linearizations of \(N\) will not be invertible anymore as a simple count of dimensions show. We refer now to Gauss-Newton's methods if the linearizations might not be invertible to distinguish between classical Newton's methods also by name. Before we phrase a convergence result for Gauss-Newton's methods we recall and introduce some definitions: **Notation 3.2** (Inner, outer and Moore-Penrose inverse): (see [36, 34]) Let \(L:\vec{P}\to\mathbf{Y}\) be a linear and bounded operator mapping between two vector spaces \(\vec{P}\) and \(\mathbf{Y}\). Then 1. the operator \(B:\mathbf{Y}\to\vec{P}\) is called a _left inverse_ to \(L\) if \[BL=I\;.\] 2. \(B:\mathbf{Y}\to\vec{P}\) is called a _right inverse_ to \(L\) if \[LB=I\;.\] Left and right inverses are used in different context: * For a left inverse the nullspace of \(L\) has to be trivial, in contrast to \(B\). * For a right inverse the nullspace of \(B\) has to be trivial. 3. \(B:\vec{P}\to\vec{P}\) is called a _inverse_ to \(L\) if \(B\) is a right and a left inverse. 4. \(B:\vec{P}\to\mathbf{Y}\) is an _outer inverse_ to \(L\) if \[BLB=B.\] (3.4) 5. Let \(\vec{P}\) and \(\mathbf{Y}\) be Hilbert-spaces, \(L:\vec{P}\to\mathbf{Y}\) be a linear bounded operator. We denote the orthogonal projections \(P\) and \(Q\) onto \(\mathcal{N}(L)\), the nullspace of \(L\) (which is closed), and \(\overline{\mathcal{R}(L)}\), the closure of the range of \(L\): That is for all \(\vec{p}\in\vec{P}\) and \(\mathbf{y}\in\mathbf{Y}\) we have \[P\vec{p}=\operatorname{argmin}\left\{\|\vec{p}_{1}-\vec{p}\|_{\vec{p}}:\vec{ p}_{1}\in\mathcal{N}(L)\right\}\text{ and }Q\mathbf{y}=\operatorname{argmin}\left\{\|\mathbf{y}_{1}-\mathbf{y}\|_{ \mathbf{Y}}:\mathbf{y}_{1}\in\overline{\mathcal{R}(L)}\right\}.\] (3.5) We therefore have \[P:\vec{P} \to\mathcal{N}(L)\dot{+}\mathcal{N}(L)^{\perp}\] and \[Q:\mathbf{Y}\to\overline{\mathcal{R}(L)}\dot{+}\mathcal{R}(L)^{\perp}.\] \[\vec{p} \mapsto P\vec{p}+0 \mathbf{y}\to Q\mathbf{y}+0\] \[B:\mathcal{D}(B)\subseteq\mathbf{Y}\to\vec{P}\text{ with }\mathcal{D}(B):=\mathcal{R}(L)\dot{+} \mathcal{R}(L)^{\perp}\text{ is called the {\it Moore-Penrose inverse} of }L\text{ if the following identities hold }\] \[LBL =L,\] \[BL =B,\] (3.6) \[BL =I-P,\] \[LB =Q|_{\mathcal{D}(B)}.\] In coding theory it is often stated that the range of a neural network operator \(\Psi\) forms a manifold in \(\mathbf{X}\), a space, which contains the natural images. This is the basis of the following definition making use of the Moore-Penrose inverse. **Definition 3.3** (Lipschitz-differentiable immersion): Let \(\Psi:\mathcal{D}(\Psi)\subseteq\vec{P}=\mathds{R}^{n_{*}}\to\mathbf{X}\) where \(\mathcal{D}(\Psi)\) is open, non-empty, convex and \(\mathbf{X}\) is a seperable (potentially infinite dimensional) Hilbert-space. 1. We assume that \(\mathcal{M}:=\Psi(\mathcal{D}(\Psi))\) is a \(n_{*}\)-dimensional _submanifold_ in \(\mathbf{X}\): * Let for all \(\vec{p}=(p_{i})_{i=1}^{n_{*}}\in\mathcal{D}(\Psi)\) denote with \(\Psi^{\prime}(\vec{p}\,)\) the Frechet-derivative of \(\Psi\): \[\Psi^{\prime}(\vec{p}\,):\vec{P} \to\mathbf{X},\] \[\vec{q} =(q_{i})_{i=1}^{n_{*}} \mapsto\left(\partial_{p_{i}}\Psi(\vec{p}\,)\right)_{i=1,\dots,n_{ *}}\vec{q}\;.\] Here \(\left(\partial_{p_{i}}\Psi(\vec{p}\,)\right)_{i=1,\dots,n_{*}}\) denotes the vector of functions consisting of all partial derivatives with respect to \(\vec{p}\,\). In differential geometry notation this coincides with the _tangential mapping_\(T_{\vec{p}}\Psi\). However, the situation is slightly different here because \(\mathbf{X}\) can be infinite dimensional. * The _representation mapping_ of the derivative \[\Psi^{\prime}:\mathcal{D}(\Psi) \to\mathbf{X}^{n_{*}},\] \[\vec{p} \mapsto\left(\partial_{p_{i}}\Psi(\vec{p}\,)\right)_{i=1,\dots,n_{ *}}.\] has always the same rank \(n_{*}\) in \(\mathcal{D}(\Psi)\), meaning that all elements of \(\partial_{\vec{p}}\Psi(\vec{p}\,)\) are linearly independent. This assumption means, in particular, that \(\Psi\) is an _immersion_ and \(\mathcal{M}\) is a submanifold. _._ 2. _We define_ \[\begin{array}{c}P_{\vec{p}}:\mathbf{X}\rightarrow\mathbf{X}_{\vec{p}}:=\mbox{ span}\left\{\partial_{p_{i}}\Psi(\vec{p}\,):i=1,\ldots,n_{*}\right\},\\ \mathbf{x}\mapsto P_{\vec{p}}\,\mathbf{x}:=\mbox{argmin}\left\{\left\|\mathbf{ x}_{1}-\mathbf{x}\right\|_{\mathbf{X}}:\mathbf{x}_{1}\in\mathbf{X}_{\vec{p}} \right\}\end{array}\] (3.7) _as the projection from_ \[\mathbf{X}=\mathbf{X}_{\vec{p}}\,\dot{+}\mathbf{X}_{\vec{p}}^{\bot}\] _onto_ \(\mathbf{X}_{\vec{p}}\)_, which is well-defined by the closedness of the finite dimensional subspace_ \(\mathbf{X}_{\vec{p}}\)_._ _Next we define the inverse of_ \(\Psi^{\prime}(\vec{p}\,)\) _on_ \(\mathbf{X}_{\vec{p}}\)_:_ \[\begin{array}{c}\Psi^{\prime}(\vec{p}\,)^{-1}:\mbox{span}\left\{\partial_{p_ {i}}\Psi(\vec{p}\,):i=1,\ldots,n_{*}\right\}\rightarrow\vec{P},\\ \mathbf{x}=\sum_{i=1}^{n_{*}}x_{i}\partial_{p_{i}}\Psi(\vec{p}\,) \mapsto(x_{i})_{i=1}^{n_{*}}\end{array}\] _and consequently on_ \(\mathbf{X}\)__ \[\begin{array}{c}\Psi^{\prime}(\vec{p}\,)^{\dagger}:\mathbf{X}=\mathbf{X}_{ \vec{p}}\,\dot{+}\mathbf{X}_{\vec{p}}^{\bot}\rightarrow\vec{P},\\ \mathbf{x}=(\mathbf{x}_{1},\mathbf{x}_{2})\mapsto\Psi^{\prime}(\vec{p}\,)^{-1 }\mathbf{x}_{1}\end{array}\] (3.8) _which are both well-defined because we assume that_ \(\Psi\) _is an immersion. Note that_ \(x_{i}\)_,_ \(i=1,\ldots,n_{*}\) _are not necessarily the coordinates with respect to an orthonormal system in_ \(\mbox{span}\left\{\partial_{p_{i}}\Psi(\vec{p}\,):i=1,\ldots,n_{*}\right\}\)_._ 3. _Finally, we assume that the operators_ \(\Psi^{\prime}(\vec{p}\,)\) _are locally bounded and locally Lipschitz-continuous in_ \(\mathcal{D}(\Psi)\)_. That is_ \[\begin{array}{c}\left\|\Psi^{\prime}(\vec{p}\,)-\Psi^{\prime}(\vec{q}\,) \right\|_{\vec{P}\rightarrow\mathbf{X}}\leq C_{L}\left\|\vec{p}-\vec{q}\, \right\|_{\vec{P}}\quad\left\|\Psi^{\prime}(\vec{p}\,)\right\|_{\vec{P} \rightarrow\mathbf{X}}\leq C_{I}\mbox{ for }\vec{p}\,,\vec{q}\in\mathcal{D}(\Psi). \end{array}\] (3.9) _If_ \(\Psi\) _satisfies these three properties we call it a Lipschitz-differentiable immersion._ The following lemma is proved by standard means: **Lemma 3.4**: _For a Lipschitz-differentiable immersion_ * _the function_ \(\Psi^{\prime}(\vec{p}\,)^{\dagger}:\mathbf{X}\rightarrow\vec{P}\) _is in fact the Moore-Penrose inverse of_ \(\Psi^{\prime}(\vec{p}\,)\) _and_ * _for every point_ \(\vec{p}\,\in\mathcal{D}(\Psi)\subseteq\vec{P}\) _there exists a non-empty closed neighborhood where_ \(\Psi^{\prime}(\vec{p}\,)^{\dagger}\) _is uniformly bounded and it is Lipschitz-continuous; That is_ \[\left\|\Psi^{\prime}(\vec{p}\,)^{\dagger}-\Psi^{\prime}(\vec{q}\,)^{\dagger} \right\|_{\mathbf{X}\rightarrow\vec{P}}\leq C_{L}\left\|\vec{p}-\vec{q}\, \right\|_{\vec{P}},\quad\left\|\Psi^{\prime}(\vec{p}\,)^{\dagger}\right\|_{ \mathbf{X}\rightarrow\vec{P}}\leq C_{I}\mbox{ for }\vec{p}\,,\vec{q}\in \mathcal{D}(\Psi).\] (3.10) * _Moreover, the operator_ \(P_{\vec{p}}\,\) _from Equation_ 3.7 _is bounded._ * We verify the four conditions Equation 3.6 with * \(L=\Psi^{\prime}(\vec{p}\,):\vec{P}=\mathds{R}^{n_{*}}\rightarrow\mathbf{X}\), \(B=\Psi^{\prime}(\vec{p}\,)^{\dagger}:\mathbf{X}\rightarrow\vec{P}\), with \(\mathcal{D}(B)=\mathcal{D}(\Psi^{\prime}(\vec{p}\,)^{\dagger})=\mathbf{X}\) and * \(P:\vec{P}\rightarrow\vec{P}\) the zero-operator and \(Q=P_{\vec{p}}:\mathbf{X}\rightarrow\mathbf{X}_{\vec{p}}\,\), the projection operator onto \(\mathbf{X}_{\vec{p}}\,\) (see Equation 3.7). * First we prove the third identity with \(P=0\) in Equation 3.6: This follows from the fact that for all \(\vec{q}\,=(q_{i})_{i=1}^{n_{*}}\in\vec{P}\) we have \[\Psi^{\prime}(\vec{p}\,)^{\dagger}\Psi^{\prime}(\vec{p}\,)\vec{q}=\Psi^{\prime }(\vec{p}\,)^{-1}\left(\sum_{i=1}^{n_{*}}q_{i}\partial_{p_{i}}\Psi(\vec{p}\,) \right)=(q_{i})_{i=1}^{n_{*}}=\vec{q}\,.\] (3.11) * For the forth identity we see that for all \(\mathbf{x}=(\mathbf{x}_{1},\mathbf{x}_{2})\in\mathbf{X}\) there exists \(x_{i}\), \(i=1,\ldots,n_{*}\) (because \(\partial_{p_{i}}\Psi(\vec{p}\,)\), \(i=1,\ldots,n_{*}\) is a basis) such that \[\mathbf{x}=\sum_{i=1}^{n_{*}}x_{i}\partial_{p_{i}}\Psi(\vec{p}\,)+\mathbf{x}_{2 }\mbox{ with }\mathbf{x}_{2}\in\mathbf{X}_{\vec{p}}^{\bot}\] and thus \[P_{\vec{p}}\,\mathbf{x}=\sum_{i=1}^{n_{*}}x_{i}\partial_{p_{i}}\Psi(\vec{p}\,)\] and therefore \[\Psi(\vec{p}\,)^{\dagger}\mathbf{x}=(x_{i})_{i=1}^{n_{*}}=\vec{x}.\] (3.12) Consequently, we have \[\Psi^{\prime}(\vec{p}\,)\Psi^{\prime}(\vec{p}\,)^{\dagger}\mathbf{x}=\Psi^{ \prime}(\vec{p}\,)\vec{x}=P_{\vec{p}}\,\mathbf{x}.\] (3.13) * For the second identity we use that for all \(\mathbf{x}\in\mathbf{X}\) \[\Psi^{\prime}(\vec{p}\,)^{\dagger}\Psi^{\prime}(\vec{p}\,)\Psi^{\prime}(\vec{p} \,)^{\dagger}\mathbf{x}\underset{Equation~{}\ref{eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eqeq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eqeq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eqeq:eq:eq:eqeq:eq:eq:eq:eq:eqeq:eq:eq:eq:eq:eq:eqeq:eq:eqeq:eq:eq:eq:eq:eqeq:eq:eqeq:eq:eq:eq:eqeq:eq:eq:eq:eqeq:eq:eqeq:eqeq:eqeq:eq:eq:eq:eqeq:eqeq:eqeq:eq:eq:eqeq:eq:eqeq:eq:eqeq:eqeq:eq:eqeq:eq:eqeq:eqeq:eq:eqeq:eqeq:eqeq:eqeq:eqeq:eqeq:eqeq:eq:eq:eqeq:eqeq:eqeq:eq:eqeq:eqeqeq:eqeq:eqeq:eqeq:eqeqeq:eqeq:eqeq:eqeq:eqeqeq:eq:eqeq:eqeq:eqeqeq:eqeq:eqeq:eqeqeq:eqeqeq:eqeq:eqeq:eqeqeq:eqeq:eqeq:eqeqeq:eqeq:eqeq:eqeq:eqeqeq:eqeqeq:eqeq:eqeqeq:eqeqeq:eqeq:eqeq:eqeq:eqeqeq:eqeqeq:eqeqeq:eqeq:eqeqeq:eqeqeq:eqeqeq:eqeq:eqeqeq:eqeqeq:eqeqeq:eqeqeq:eqeqeq:eqeqeq:eqeqeqeq:eqeqeq:eqeqeq:eqeqeqeq:eqeqeqeq:eqeqeq:eqeqeqeq:eqeqeqeqeq:eqeqeqeq:eqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeq:eqeqeqeq:eqeqeqeqeq:eqeqeqeq:eqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeq:eqeqeqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeqeqeq:eqeqeqeqeq:eqeqeqeqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeqeqeqeq:eqeqeqeqeqeq:eqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeqeq:eqeqeqeqeqeqeqeqeqeq: * _Decomposition property of the Moore-Penrose inverse:_ \[N^{\prime}(\vec{p}\,)^{\dagger}\mathbf{z}=\Psi^{\prime}(\vec{p}\,)^{\dagger}F^{- 1}\mathbf{z}\text{ for all }\vec{p}\,\in\mathcal{D}(N),\mathbf{z}\in\mathcal{R}(F)\subseteq \mathbf{Y}.\] (3.16) _In particular this means that_ \[N^{\prime}(\vec{p}\,)^{\dagger}N^{\prime}(\vec{p}\,)=I\text{ on }\mathds{R}^{n_{\star}}\text{ and }N^{\prime}(\vec{p}\,)N^{\prime}(\vec{p}\,)^{\dagger}=Q |_{\mathcal{R}(FP_{\vec{p}})},\] (3.17) _where_ \(I\) _denotes the identity operator on_ \(\mathds{R}^{n_{\star}}\) _and_ \(Q:\mathbf{Y}\rightarrow\overline{\mathcal{R}(FP_{\vec{p}})}^{\perp}\hat{+} \mathcal{R}(FP_{\vec{p}})^{\perp}\)_, respectively._ * _Generalized Newton-Mysovskii condition:_ \[\begin{split}\big{\|}N^{\prime}(\vec{p}\,)^{\dagger}(N^{\prime}( \vec{q}+s(\vec{p}-\vec{q}\,)-N^{\prime}(\vec{q}\,))(\vec{p}\,-\vec{q}\,) \big{\|}_{\vec{p}}\leq& sC_{I}C_{L}\,\|\vec{p}-\vec{q}\,\|_{ \vec{p}}^{2}\\ \vec{p}\,,\vec{q}\,\in&\mathcal{D}(N),s\in[0,1]\;. \end{split}\] (3.18) _We recall that the Lipschitz-constants_ \(C_{I}\) _and_ \(C_{L}\) _are defined in Equation_ 3.9_._ _Proof:_ First of all, we note that \[N^{\prime}(\vec{p}\,)=F\Psi^{\prime}(\vec{p}\,)\text{ on }\mathcal{D}(\Psi)= \mathcal{D}(N).\] To prove Equation 3.16 we have to verify Equation 3.6 with \[L:=N^{\prime}(\vec{p}\,)=F\psi^{\prime}(\vec{p}\,):\vec{P}\rightarrow\mathbf{ Y}\text{ and }B:=\Psi^{\prime}(\vec{p}\,)^{\dagger}F^{-1}:\mathcal{R}(F)\subseteq \mathbf{Y}\rightarrow\vec{P}.\] Note that since we assume that \(F\) has dense range we do not need to define and consider \(B\) on \(\mathcal{R}(F)\hat{+}\underbrace{\mathcal{R}(F)^{\perp}}_{=\{0\}}\). Let us first state that with the notation of Equation 3.6 we have for fixed \(\vec{p}\,\): \[\mathcal{D}(B)=\mathcal{D}(\Psi^{\prime}(\vec{p}\,)^{\dagger}F^{-1})= \mathcal{R}(F)\text{ and }\mathcal{R}(L)=\{F\Psi^{\prime}(\vec{p}\,)\vec{q}:\vec{q}\in \mathds{R}^{n_{\star}}\}=\mathcal{R}(FP_{\vec{p}}).\] We use \(P\equiv 0\) in Equation 3.6. In particular the first item shows that for \(\mathbf{z}=F\mathbf{x}=FP_{\vec{p}}\mathbf{x}+F(I-P_{\vec{p}})\mathbf{x}\) we have \[Q\mathbf{z}=Q(FP_{\vec{p}}\mathbf{x}+F(I-P_{\vec{p}}\,)(\mathbf{x}))=FP_{\vec {p}}\mathbf{x}. \tag{3.19}\] Applying Lemma 3.4 and the invertability of \(F\) on the range of \(F\) shows that \[LBL=F\Psi^{\prime}(\vec{p}\,)\Psi^{\prime}(\vec{p}\,)^{\dagger}F^{-1}F\Psi^{ \prime}(\vec{p}\,) =F\Psi^{\prime}(\vec{p}\,)\Psi^{\prime}(\vec{p}\,)^{\dagger}\Psi^{ \prime}(\vec{p}\,)\underbrace{\rule{0.0pt}{12.9pt}}_{\text{Equation \ref{eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq: eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq: eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq: eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq: eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq:eq: eq: We have now all ingredients to prove a local convergence rates result for a Gauss-Newton's method, where the operator \(N\) is the composition of a linear bounded operator and a Lipschitz-differentiable immersions: **Theorem 3.6**: _Let \(F:\mathbf{X}\to\mathbf{Y}\) be linear, bounded, with trivial nullspace and dense range. Moreover, let \(\Psi:\mathcal{D}(\Psi)\subseteq\vec{P}\to\mathbf{X}\) be a Lipschitz-differentiable immersion with \(\mathcal{D}(\Psi)\) open, non-empty, and convex. Moreover, \(N=F\circ\Psi:\mathcal{D}(\Psi)\to\mathbf{Y}\). We assume that there exist \(\vec{p}^{\,\dagger}\in\mathcal{D}(\Psi)\) that satisfies_ \[N(\vec{p}^{\,\dagger})=\mathbf{y}. \tag{3.20}\] _Moreover, we assume that there exists \(\vec{p}^{\,0}\in\mathcal{D}(\Psi)\), which satisfies Equation 3.2. Then, the iterates of the Gauss-Newton's iteration,_ \[\vec{p}^{\,k+1}=\vec{p}^{\,k}-N^{\prime}(\vec{p}^{\,k})^{\dagger}(N(\vec{p}^{\, k})-\mathbf{y})\quad k\in\mathds{N}_{0} \tag{3.21}\] _are well-defined elements in \(\overline{\mathcal{B}(\vec{p}^{\,0},\rho)}\) and converge quadratically to \(\vec{p}^{\,\dagger}\)._ _Proof:_ First of all note, that \(\mathcal{D}(\Psi)=\mathcal{D}(N)\) since \(F\) is defined all over \(\mathbf{X}\). Let \(\rho=\left\|\vec{p}^{\,\dagger}-\vec{p}^{\,0}\right\|_{\vec{P}}\): We prove by induction that \(\vec{p}^{\,k}\in\overline{\mathcal{B}(\vec{p}^{\,\dagger};\rho)}\) for all \(k\in\mathds{N}_{0}\). * For \(k=0\) the assertion is satisfied by assumption Equation 3.2. * Let \(\vec{p}^{\,k}\in\overline{\mathcal{B}(\vec{p}^{\,\dagger};\rho)}\). Using the first condition of Equation 3.6, which a Moore-Penrose inverse satisfies, we see that \[N^{\prime}(\vec{p}^{\,k})N^{\prime}(\vec{p}^{\,k})^{\dagger}N^{\prime}(\vec{p} ^{\,k})(\vec{p}^{\,k+1}-\vec{p}^{\,\dagger})=N^{\prime}(\vec{p}^{\,k})(\vec{p }^{\,k+1}-\vec{p}^{\,\dagger}).\] The definition of Gauss-Newton's method, Equation 3.21, and Equation 3.20 then imply that \[N^{\prime}(\vec{p}^{\,k})(\vec{p}^{\,k+1}-\vec{p}^{\,\dagger})=N^{\prime}(\vec {p}^{\,k})N^{\prime}(\vec{p}^{\,k})^{\dagger}(N(\vec{p}^{\,\dagger})-N(\vec{p }^{\,k})-N^{\prime}(\vec{p}^{\,k})(\vec{p}^{\,\dagger}-\vec{p}^{\,k})),\] and consequently, using the third identity of Equation 3.6 (note that under the assumptions of this theorem \(P=0\), see the proof prior to Equation 3.11), the second identity of Equation 3.6 and that \(F\) is injective, we get \[\vec{p}^{\,k+1}-\vec{p}^{\,\dagger}=N^{\prime}(\vec{p}^{\,k})^{ \dagger}N^{\prime}(\vec{p}^{\,k})(\vec{p}^{\,k+1}-\vec{p}^{\,\dagger}) =N^{\prime}(\vec{p}^{\,k})^{\dagger}(N(\vec{p}^{\,\dagger})-N( \vec{p}^{\,k})-N^{\prime}(\vec{p}^{\,k})(\vec{p}^{\,\dagger}-\vec{p}^{\,k}))\] \[=\Psi^{\prime}(\vec{p}^{\,k})^{\dagger}(\Psi(\vec{p}^{\,\dagger} )-\Psi(\vec{p}^{\,k})-\Psi^{\prime}(\vec{p}^{\,k})(\vec{p}^{\,\dagger}-\vec{p} ^{\,k})).\] From the Newton-Mysovskii condition Equation 3.18 and Equation 3.2 it then follows that \[\begin{split}\left\|\vec{p}^{\,k+1}-\vec{p}^{\,\dagger}\right\|_{ \vec{P}}\leq\frac{C_{I}C_{L}}{2}\left\|\vec{p}^{\,k}-\vec{p}^{\,\dagger}\right\| _{\vec{P}}^{2}&\leq\frac{C_{I}C_{L}\rho}{2}\left\|\vec{p}^{\,k}- \vec{p}^{\,\dagger}\right\|_{\vec{P}}<\left\|\vec{p}^{\,k}-\vec{p}^{\,\dagger} \right\|_{\vec{P}}\\ &\text{ or }\left\|\vec{p}^{\,k+1}-\vec{p}^{\,\dagger}\right\|_{ \vec{P}}=\left\|\vec{p}^{\,k}-\vec{p}^{\,\dagger}\right\|_{\vec{P}}=0.\end{split}\] (3.22) This, in particular shows that \(\vec{p}^{\,k+1}\in\mathcal{B}(\vec{p}^{\,\dagger};\rho)\), thus the well-definedness of the Gauss-Newton's iterations in the closed ball. * Using Equation 3.22 we then get, since \(h=C_{I}C_{L}\rho/2<1\), that \[\left\|\vec{p}^{\,k+1}-\vec{p}^{\,\dagger}\right\|_{\vec{P}}\leq h^{k+1}\left\| \vec{p}^{\,0}-\vec{p}^{\,\dagger}\right\|_{\vec{P}}\leq h^{k+1}\rho,\] which converges to \(0\) for \(k\to\infty\). * Convergence and the first inequality of Equation 3.22 imply quadratic convergence. \(\Box\) **Remark 3.7**: Based on the assumption of an immersion we have shown in Lemma 3.5 that \(\Psi(\vec{p}^{\,\dagger})^{\dagger}F^{-1}\) is the Moore-Penrose inverse of \(N=F\Psi(\vec{p}^{\,\prime})\). In order to prove (quadratic) convergence of Gauss-Newton's methods one only requires an _outer inverse_ (see Notation 3.2). Following [37] (see also [18]) the analysis of Gauss-Newton's method could be based on _outer inverses_, which is more general than for the Moore-Penrose inverse (compare Equation 3.4 and Equation 3.6). However, it is nice to actually see that \(N^{\prime}(\vec{p}^{\,\prime})^{\dagger}\) is a Moore-Penrose inverse, which is the novelty compared to the analysis of [37]. For excellent expositions on Kantorovich and Mysovskii theory see [30, 40, 46] - here we replace the Newton-Mysovskii conditions by properties of an immersion. For aspects related to Newton's methods for singular points see [10, 16]. For applications of generalized inverses in nonlinear analysis see [34, 35]. ### Neural networks We want to apply the decomposition theory to Gauss-Newton's methods for solving Equation 1.3, where \(\Psi\) is a _shallow neural network operator_. **Definition 3.8** (Shallow neural network operator): Let \(N\in\mathds{N}\) be fixed. We consider the operator \[\begin{split}\Psi:\vec{P}:=\mathds{R}^{N}\times\mathds{R}^{n \times N}\times\mathds{R}^{N}&\to C^{1}([0,1]^{n})\subseteq \mathbf{X}:=L^{2}([0,1]^{n}),\\ (\vec{\alpha},\mathbf{w},\vec{\theta})&\mapsto \left(\vec{x}\rightarrow\sum_{j=1}^{N}\alpha_{j}\sigma\left(\mathbf{w}_{j}^{T} \vec{x}+\theta_{j}\right)\right)\\ \text{where }\alpha_{j},\theta_{j}\in\mathds{R}\text{ and }\vec{x}, \mathbf{w}_{j}\in\mathds{R}^{n}.\end{split} \tag{3.23}\] Note, that with our previous notation, for instance in Definition 3.3, we have \(n_{*}=(n+2)*N\). We summarize the notation, because it is quite heavy: 1. [label=()] 2. \(\vec{\ }\) denotes a vector in \(\mathds{R}^{n}\) or \(\mathds{R}^{N}\), 3. \(\mathbf{w}\) denotes a matrix: The only exception is Definition 3.10, where it is a tensor. \(\mathbf{w}_{j}\) denotes a vector, aside from Definition 3.10, where it is again a tensor. **Example 3.9** (Examples of activation functions): \(\sigma\) is called the _activation function_, such as * the _sigmoid function_, defined by \[\sigma(t)=\frac{1}{1+\mathrm{e}^{-\frac{1}{2}t}}\text{ for all }t\in \mathds{R}.\] (3.24) Note, we omit the \(\varepsilon\) dependence for notational convenience. * The _hyperbolic tangent_ \[t\rightarrow\tanh(t)=\frac{\mathrm{e}^{2t}-1}{\mathrm{e}^{2t}+1}.\] (3.25) * The _ReLU_ activation function, \[\sigma(t)=\max\left\{0,t\right\}\text{ for all }t\in\mathds{R}.\] (3.26) * The _step function_, which is the pointwise limit of the sigmoid function, with respect to \(\varepsilon\to 0\), \[\sigma(t)=\left\{\begin{array}{ll}0&\text{for }t<0,\\ \frac{1}{2}&\text{for }t=0,\text{ }t\in\mathds{R}.\\ 1&\text{for }t>0.\end{array}\right.\] (3.27) We only consider shallow neural networks in contrast to _deep neural networks_, which consist of several layers of shallow neural networks (see for instance [26]): Figure 1: Three different activation functions: Sigmoid, tanh and ReLU. O-th derivative green, first derivative pink with circles and with pink \(\times\) is the derivative multiplied by \(x\), 2nd derivative blue. The ReLU function is scaled by a factor \(1/10\) and the derivative is plotted in original form, derivative times \(x\) is again scaled by \(1/10\) for visualization purposes. **Definition 3.10** (Deep neural networks): Let \[\vec{P}_{l}:=\mathds{R}^{N_{l}}\times\mathds{R}^{n\times N_{l}}\times\mathds{R}^{ N_{l}}\text{ for }l=1,\ldots,L\text{ and }\vec{P}:=\prod_{l=1}^{L}\vec{P}_{l}.\] Then a deep neural network consisting of \(L\) layers is written as \[\begin{split}\Psi:\vec{P}&\to L^{2}([0,1]^{n}),\\ (\vec{\alpha}_{l},\mathbf{w}_{l},\vec{\theta}_{l})_{l=1}^{L}& \mapsto\left(\vec{x}\rightarrow\sum_{j_{L}=1}^{N_{L}}\alpha_{j_{L}}^{L} \sigma_{\varepsilon_{L}}^{L}\left(p_{j_{L},L}\left(\sum_{j_{L-1}=1}^{N_{L-1}} \cdots\left(\sum_{j_{1}=1}^{N_{1}}\alpha_{j_{1},1}\sigma_{\varepsilon_{1}}^{1} \left(p_{j_{1}}^{1}(\vec{x})\right)\right)\right)\right)\right),\end{split} \tag{3.28}\] where \[p_{j}^{i}(\vec{x})=\mathbf{w}_{j,i}^{T}\vec{x}+\theta_{j}^{i}\text{ with }\alpha_{j}^{i},\theta_{j}^{i}\in\mathds{R}\text{ and }\vec{x},\mathbf{w}_{j,i}\in\mathds{R}^{n}\text{ for all }i=1,\ldots,L.\] Note that the values \(\varepsilon_{k}\), \(k=1,\ldots,L\) can be chosen differently for activation functions at different levels (cf. Equation 3.24). The success of neural network is due to the universal approximation properties, proven for the first time in [9, 27]. The universal approximation result states that shallow neural networks are universal, that is, that each continuous function can be approximated arbitrarily well by a neural network function. We review this result now. **Theorem 3.11** ([26]): _In dependence of the smoothness of the activation function \(\sigma\) there exist two classes of results._ * _Theorem 2 from_ _[_26_]__: Let_ \(\sigma:\mathds{R}\rightarrow\mathds{R}^{+}\) _be a_ **continuous, bounded and nonconstant** _function_. Then, for every function_ \(g\in C(\mathds{R}^{n})\) _and every_ \(\nu>0\)_, there exists a function_ \[\vec{x}\to G(\vec{x})=\sum_{j=1}^{N}\alpha_{j}\sigma(\mathbf{w}_{j}^{T} \vec{x}+\theta_{j})\qquad\text{ with }N\in\mathds{N},\alpha_{j},\theta_{j}\in \mathds{R},\mathbf{w}_{j}\in\mathds{R}^{n},\] (3.29) _satisfying_ \[|G(\vec{x})-g(\vec{x})|<\nu\text{ uniformly for all compact subsets }K\subseteq\mathds{R}^{n}.\] * _Theorem 1 from_ _[_26_]__: Let_ \(\sigma:\mathds{R}\rightarrow\mathds{R}^{+}\) _be_ **unbounded and nonconstant**_. Then for every measure_ \(\mu\) _on_ \(\mathds{R}^{n}\) _and every constant_ \(\nu>0\) _and_ \(p\geq 1\) _there exists a function_ \(G\) _of the form Equation_ 3.29 _that satisfies_ \[\int_{\mathds{R}^{n}}|G(\vec{x})-g(\vec{x})|^{p}d\vec{x}<\nu.\] The first result applies for instance to the sigmoid and hyperbolic tangent function (see Equation 3.24 and Equation 3.25). The second result applies to the ReLU function (see Equation 3.26). In particular all approximation properties also hold on the compact set \([0,1]^{n}\), which we are considering. ### Newton-Mysovskii condition with neural networks In the following we verify Newton-Mysovskii conditions for \(\Psi\) being the encoder of Equation 3.23. First we calculate the first and second derivatives of \(\Psi\) with respect to \(\vec{\alpha},\mathbf{w}\) and \(\vec{\theta}\). The computations can be performed for deep neural network encoders as defined in Equation 3.28 in principle analogously, but are technically and notationally more complicated. To make the notation consistent we define \[\vec{p}:=(\vec{\alpha},\mathbf{w},\vec{\theta})\in\mathds{R}^{N}\times \mathds{R}^{n\times N}\times\mathds{R}^{N}=\mathds{R}^{n_{*}}.\] **Lemma 3.12**: _Let \(\sigma:\mathds{R}\rightarrow\mathds{R}^{+}\) be a two times differentiable function with uniformly bounded function values and first, second order derivatives, such as the sigmoid, hyperbolic tangent functions (see Figure 1)1. Then, the derivatives of \(\Psi\) with respect to the coefficients \(\vec{p}\) are given by the following formulas:_ Footnote 1: This assumption is actually too restrictive, and only used to see that \(\Psi\in L^{2}([0,1]^{n})\). * _Derivative with respect to_ \(\alpha_{s}\)_,_ \(s=1,\ldots,N\)_:_ \[\frac{\partial\Psi}{\partial\alpha_{s}}[\vec{p}\,](\vec{x})=\sigma\left(\sum_{i= 1}^{n}w_{s}^{i}x_{i}+\theta_{s}\right)\text{ for }s=1,\ldots,N.\] (3.30) * _Derivative with respect to_ \(w_{s}^{t}\) _where_ \(s=1,\ldots,N\)_,_ \(t=1,\ldots,n\)_:_ \[\frac{\partial\Psi}{\partial w_{s}^{t}}[\vec{p}\,](\vec{x})=\sum_{j=1}^{N} \alpha_{j}\sigma^{\prime}\left(\sum_{i=1}^{n}w_{j}^{i}x_{i}+\theta_{j}\right) \delta_{s=j}x_{t}=\alpha_{s}\sigma^{\prime}\left(\sum_{i=1}^{n}w_{s}^{i}x_{i}+ \theta_{s}\right)x_{t}\] (3.31) * _Derivative with respect to_ \(\theta_{s}\) _where_ \(s=1,\ldots,N\)_:_ \[\frac{\partial\Psi}{\partial\theta_{s}}[\vec{p}\,](\vec{x})=\sum_{j=1}^{N} \alpha_{j}\sigma^{\prime}\left(\sum_{i=1}^{n}w_{j}^{i}x_{i}+\theta_{j}\right) \delta_{s=j}=\alpha_{s}\sigma^{\prime}\left(\sum_{i=1}^{n}w_{s}^{i}x_{i}+ \theta_{s}\right).\] (3.32) _Note, that all the derivatives above are functions in \(\mathbf{X}=L^{2}([0,1]^{n})\). In particular, maybe in a more intuitive way, we have_ \[D\Psi[\vec{p}\,](\vec{x})\vec{h}=\left(\tfrac{\partial\Psi}{\partial\vec{a}} [\vec{p}\,](\vec{x})\quad\tfrac{\partial\Psi}{\partial\mathbf{w}}[\vec{p}\,]( \vec{x})\quad\tfrac{\partial\Phi}{\partial\theta}[\vec{p}\,](\vec{x})\right)^ {T}\vec{h}\text{ for all }\vec{h}=\left(\begin{matrix}\vec{h}_{\vec{a}}\\ \mathbf{h}_{\mathbf{w}}\\ \vec{h}_{\vec{b}}\end{matrix}\right)\in\mathds{R}^{n_{*}}\text{ and }\vec{x}\in\mathds{R}^{n}. \tag{3.33}\] _Moreover, let \(s_{1},s_{2}=1,\ldots,N\), \(t_{1},t_{2}=1,\ldots,n\), then we have in a formal way:_ \[\frac{\partial^{2}\Psi}{\partial\alpha_{s_{1}}\partial\alpha_{s_{ 2}}}(\vec{x}) =0, \tag{3.34}\] \[\frac{\partial^{2}\Psi}{\partial\alpha_{s_{1}}\partial w_{s_{2}} ^{t_{1}}}(\vec{x}) =\sigma^{\prime}\left(\sum_{i=1}^{n}w_{s_{1}}^{i}x_{i}+\theta_{s_ {1}}\right)x_{t_{1}}\delta_{s_{1}=s_{2}},\] \[\frac{\partial^{2}\Psi}{\partial\alpha_{s_{1}}\partial\theta_{s_ {2}}}(\vec{x}) =\sigma^{\prime}\left(\sum_{i=1}^{n}w_{s_{1}}^{i}x_{i}+\theta_{s_ {1}}\right)\delta_{s_{1}=s_{2}},\] \[\frac{\partial^{2}\Psi}{\partial w_{s_{1}}^{t_{1}}\partial\theta_{ s_{2}}}(\vec{x}) =\alpha_{s_{1}}\sigma^{\prime\prime}\left(\sum_{i=1}^{n}w_{s_{1}}^{i}x_{i}+ \theta_{s_{1}}\right)x_{t_{1}}\delta_{s_{1}=s_{2}},\] \[\frac{\partial^{2}\Psi}{\partial\theta_{s_{1}}\partial\theta_{s_ {2}}}(\vec{x}) =\alpha_{s_{1}}\sigma^{\prime\prime}\left(\sum_{i=1}^{n}w_{s_{1}}^{i }x_{i}+\theta_{s_{1}}\right)\delta_{s_{1}=s_{2}},\] _where \(\delta_{a=b}=1\) if \(a=b\) and \(0\) else, that is the Kronecker-delta._ The notation of directional derivatives with respect to parameters might be confusing. Note, that for instance \(\tfrac{\partial\Psi}{\partial\theta_{s}}[\vec{p}\,](\vec{x})\) denotes a direction derivative of the functional \(\Psi\) with respect to the variable \(\theta_{s}\) and this derivative is a function, which depends on \(\vec{x}\). The argument, where the derivative is evaluated is a vector. So in such a formula \(\theta_{s}\) has two different meanings. Notationaly differentiating between them would be exact but becomes quite unreadable. **Remark 3.13**: * In particular Equation 3.34 shows that \[\left(\vec{h}_{\vec{a}}\quad\mathbf{h}_{\mathbf{w}}\quad\vec{h}_{\vec{g}} \right)D^{2}\Psi[\vec{p}\,](\vec{x})\begin{pmatrix}\vec{h}_{\vec{a}}\\ \mathbf{h}_{\vec{b}}\\ \end{pmatrix}\text{ is continuous (for fixed }\vec{x})\text{ with respect to }\vec{p}\,.\] (3.35) * We emphasize that under the assumptions of Lemma 3.12 the linear space (for fixed \(\vec{p}\,\)) \[\mathcal{R}(D\Psi[\vec{p}\,])=\left\{D\Psi[\vec{p}\,]\vec{h}:\vec{h}=(\vec{h} _{\vec{a}},\mathbf{h}_{\mathbf{w}},\vec{h}_{\vec{g}})\in\mathds{R}^{N\times(n+ 2)}\right\}\subseteq L^{2}([0,1]^{n}).\] * In order to prove convergence of the Gauss-Newton's method, Equation 3.21, by applying Theorem 3.1, we have to prove that \(\Psi\) is a Lipschitz-continuous immersion. Below we lack proving one important property so far, namely, that \[\partial_{k}\Psi[\vec{p}\,],\quad k=1,\ldots,n_{*}=N(n+2)\] (3.36) are linearly independent functions. In this paper, this will remain open as a conjecture, and the following statements are valid modulo this conjecture. In the following we survey some results on linear independence with respect to the coefficients \(\vec{\alpha},\mathbf{w},\vec{\theta}\) of the functions \(\vec{x}\to\sigma\left(\sum_{i=1}^{n}w_{s}^{i}x_{i}+\theta_{s}\right)\), which match the functions \(\vec{x}\to\frac{\partial\Psi}{\partial\alpha_{s}}[\vec{p}\,](\vec{x})\), that is with respect to the first \(N\) variables. ### Linear independence of activation functions and its derivatives The universal approximation results from for instance [9, 27, 26] do not allow to conclude that neural networks function as in Equation 3.23 are linearly independent. Linear independence is a non-trivial research question: We recall a result from [31] from which linear independence of a shallow neural network operator, as defined in Equation 3.23, can be deduced for a variety of activator functions. Similar results on linear independence of shallow network functions based on sigmoid activation functions have been stated in [47, 28], but the discussion in [31] raises questions on the completeness of the proofs. In [31] it is stated that all activation functions from the _Pytorch library_[41] are linearly independent with respect to almost all parameters \(\mathbf{w}\) and \(\theta\). **Theorem 3.14** ([31]): _For all activation functions_ HardShrink, HardSigmoid, HardTanh, HardSwish, LeakyReLU, PReLU, ReLU, ReLU6, RReLU, SoftShrink, Threshold_,_ LogSigmoid, Sigmoid, SoftPlus, Tanh, and TanShrink _and the_ PyTorch _functions_ CELU, ELU, SELU _the shallow neural network functions Equation 3.23 formed by randomly generated vectors \((\mathbf{w},\vec{\theta})\) are linearly independent._ **Remark 3.15**: * Theorem 3.14 states that the functions \(\frac{\partial\Psi}{\partial\alpha_{s}}\) (taking into account Equation 3.30) are linearly independent for _almost all_ parameters \((\mathbf{w},\vec{\theta})\in\mathds{R}^{n\times N}\times\mathds{R}^{N}\). In other words, the first block of the matrix is \(D\Psi\) in Equation 3.33 consists of functions, which are linearly independent for almost all parameters \((\mathbf{w},\vec{\theta})\). For our results to hold we need on top that the functions \(\frac{\partial\Psi}{\partial w_{s}^{2}}\) and \(\frac{\partial\Psi}{\partial\theta_{s}}\) from the second and third block (see Equation 3.34) are linearly independent within the blocks, respectively, and also across the blocks. So far this has not been proven but can be conjectured already from Figure 1. * For the sigmoid function we have _obvious symmetries_ because \[\sigma^{\prime}\left(\mathbf{w}_{j}^{T}\vec{x}+\theta_{j}\right)=\sigma^{ \prime}\left(-\mathbf{w}_{j}^{T}\vec{x}-\theta_{j}\right)\text{ for every }\mathbf{w}_{j}\in\mathds{R}^{n},\vec{ \theta}\in\mathds{R}^{N},\] (3.37) or in other words for the function \(\Psi\) from Equation 3.23 we have according to Equation 3.32 that \[\frac{\partial\Psi}{\partial\theta_{s}}[\vec{\alpha},\mathbf{w},\vec{\theta} ](\vec{x})=\alpha_{s}\sigma^{\prime}(\mathbf{w}_{j}^{T}\vec{x}+\theta_{j})= \alpha_{s}\sigma^{\prime}(-\mathbf{w}_{j}^{T}\vec{x}-\theta_{j})=\frac{ \partial\Psi}{\partial\theta_{s}}[\vec{\alpha},-\mathbf{w},-\vec{\theta}]( \vec{x})\] (3.38) or in other words \(\frac{\partial\Psi}{\partial\theta_{s}}[\vec{\alpha},\mathbf{w},-\vec{ \theta}]\) and \(\frac{\partial\Psi}{\partial\theta_{s}}[\vec{\alpha},-\mathbf{w},-\vec{ \theta}]\) are linearly dependent. **Conjecture 3.16**: We define by \(\mathcal{D}(\Psi)\) a _maximal set of vectors_\((\vec{\alpha},\mathbf{w},\vec{\theta})\) such that the \(n_{*}=N\times(n+2)\) functions in \(\vec{x}\) \[\vec{x}\to\frac{\partial\Psi}{\partial\alpha_{s}}[\vec{\alpha},\mathbf{w},\vec {\theta}](\vec{x}),\quad\vec{x}\to\frac{\partial\Psi}{\partial w_{s}^{t}}[ \vec{\alpha},\mathbf{w},\vec{\theta}](\vec{x}),\quad\vec{x}\to\frac{\partial \Psi}{\partial\theta_{s}}[\vec{\alpha},\mathbf{w},\vec{\theta}](\vec{x}),\quad s =1,\ldots,N,t=1,\ldots,n,\] are linearly independent. We assume that \(\mathcal{D}(\Psi)\) is open and dense in \(\mathbf{X}\in L^{2}([0,1])^{2}\) The later is guaranteed by Theorem 3.11. Recall the discussion above: The differentiation variables and the arguments coincide notationally, but are different objects. **Remark 3.17**: * It can be conjectured that for every element from \(\mathcal{D}(\Psi)\) only one element in \(\mathds{R}^{n_{*}}\) exists, which satisfies _obvious symmetries_ such as formulated in Equation 3.38. These "mirrored" elements are a set of measure zero in \(\vec{P}\). We conjecture that this corresponds to the set of measure zero as stated in [31], which is derived with Fourier methods. * Equation 3.34 requires that all components of the vector \(\vec{\alpha}\) are non-zero. This means in particular that for "sparse solutions", with less that \(n_{*}=N*(n+2)\) coefficients, convergence is not guaranteed, because of a locally degenerating submanifold. We consider the manifold given by the function \[F:\mathds{R}^{2} \to\mathds{R}^{2}.\] \[\begin{pmatrix}x\\ y\end{pmatrix} \mapsto\begin{pmatrix}xy\\ x^{2}+y^{2}\end{pmatrix}\] (3.39) Then \[\nabla F(x,y)=\begin{pmatrix}y&x\\ 2x&2y\end{pmatrix}.\] We have \(\det\nabla F(x,y)=2(y^{2}-x^{2})\), which vanishes along the diagonals in \((x,y)\)-space. That is of the diagonals the function is locally a submanifold (see Figure 2): ### Local convergence of Gauss-Newton's method with coding networks In the following we prove a local convergence result for a Gauss-Newton's method, for solving operator equations Equation 1.3 where \(F\) is complemented by a shallow neural network coder \(\Psi\). In order to apply Theorem 3.1 we have to verify that the shallow neural network operator (see Equation 3.23) is a Lipschitz-differentiable immersion. **Lemma 3.18**: _Let \(F:\mathbf{X}=L^{2}([0,1]^{n})\to\mathbf{Y}\) be linear, bounded, with trivial nullspace and closed range, and let \(\sigma\) be strictly monotonic (like sigmoid or hyperbolic tangent) and satisfy the assumptions of Lemma 3.12. Moreover, assume that Conjecture 3.16 holds. Then_ * _For every element_ \(\vec{p}\,=(\vec{\alpha},\mathbf{w},\vec{\theta})\in\mathds{R}^{n_{*}}\) _in the maximal set_ \(\mathcal{D}(\Psi)\) _(see Conjecture_ 3.16_),_ \(\mathcal{R}(D\Psi[\vec{p}\,])\) _is a linear subspace of the space_ \(\mathbf{X}\) _of dimension_ \(n_{*}=N\times(n+2)\)_._ * _There exists an open neighborhood_ \(\mathcal{U}\subseteq\mathds{R}^{N\times(n+2)}\) _of vectors_ \((\vec{\alpha},\mathbf{w},\vec{\theta})\) _such that_ \(\Psi\) _is a Lipschitz-differentiable immersion in_ \(\mathcal{U}\)_._ _Proof:_ * It is clear that for each fixed \(\vec{p}\,,\,D\Psi[\vec{p}\,]\in L^{2}([0,1]^{n})\) because of the differentiability assumptions of \(\sigma\), see Equation 3.35. Conjecture 3.16 implies that \(\mathcal{R}(D\Psi[\vec{p}\,])\) is a linear subspaces of \(\mathbf{X}\) of dimension \(N\times(n+2)\) (note the elements are functions). * \(D^{2}\Psi[\vec{p}\,]:\mathds{R}^{N\times(n+2)}\to L^{2}([0,1]^{n})\) is continuous (see Equation 3.35) since we assume that the activation function \(\sigma\) is twice differentiable. Now we consider a non-empty open neighborhood \(\mathcal{U}\) of a vector \(\vec{p}\), with a compact closure. Figure 2: The function \(F\) from Equation 3.39. We have plotted \(F(x,y)\) via its polar coordinates, I.e. \(r=|F(x,y)|\) and \(\theta=\tan^{-1}\left(\frac{xy}{x^{2}+y^{2}}\right)\). The colors correspond to identical angles. Then, from the continuity of \(D^{2}\Psi\) with respect to \(\vec{p}\), it follows that \(D\Psi\) is a Frechet-differentiable with Lipschitz-continuous derivative on \(\mathcal{U}\). In particular this means that item _(i)_ in Definition 3.3 holds. Moreover, Equation 3.9 holds for \(\Psi^{\prime}\). That is, there exists constants \(C_{L}\) and \(C_{I}\) such that \[\|\Psi^{\prime}(\vec{p}\,)-\Psi^{\prime}(\vec{q}\,)\|_{\vec{P}\to\mathbf{Y}} \leq C_{L}\,\|\vec{p}\,-\vec{q}\,\|_{\vec{P}}\,\,\,\text{and}\,\,\,\|\Psi^{ \prime}(\vec{p}\,)\|_{\vec{P}\to\mathbf{Y}}\leq C_{I}\,\,\text{for}\,\,\vec{p} \,,\vec{q}\,\in\mathcal{D}(\Psi). \tag{3.40}\] Note that \(\Psi^{\prime}(p)^{\dagger}\) as defined in Equation 3.8 is also uniformly bounded and Lipschitz-continuous as a consequence of Lemma 3.4. **Theorem 3.19** (Local convergence of Gauss-Newton's method): _Let \(F:\mathbf{X}=L^{2}([0,1]^{n})\to\mathbf{Y}\) be a linear, bounded operator with trivial nullspace and dense range and let \(N=F\circ\Psi\), where \(\Psi:\mathcal{D}(\Psi)\subseteq\mathds{R}^{N\times(n+2)}\to\mathbf{X}\) is a shallow neural network operator generated by an activation function \(\sigma\) which satisfies the assumptions of Lemma 3.18 and Conjecture 3.16. Let \(\vec{p}^{\,0}\in\mathcal{D}(\Psi)\) be the starting point of the Gauss-Newton's iteration Equation 3.21 and let \(\vec{p}^{\,\dagger}\in\mathcal{D}(\Psi)\) be a solution of Equation 3.20, which satisfy Equation 3.2. Then the Gauss-Newton's iterations are locally, that is if \(\vec{p}^{\,0}\) is sufficiently close to \(\vec{p}^{\,\dagger}\), and quadratically converging._ _Proof:_ The proof is an immediate application of Lemma 3.18 to Theorem 3.6. \(\Box\) **Remark 3.20**: We have shown that a nonlinear operator equation, where the operator is a composition of a linear compact operator and a shallow neural network operator, can be solved with a Gauss-Newton's method with guaranteed local convergence in the parameter space. **Conclusion.** We have shown that Gauss-Newton's methods are efficient algorithms for solving linear inverse problems, where the solution can be encoded with a neural network. The convergence studies, however, are not complete, and are based on a conjecture on linear independence of activation functions and its derivatives. **Acknowledgements.** This research was funded in whole, or in part, by the Austrian Science Fund (FWF) P 34981 - New Inverse Problems of Super-Resolved Microscopy (NIPSUM). For the purpose of open access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. Moreover, OS is supported by the Austrian Science Fund (FWF), with SFB F68 "Tomography Across the Scales", project F6807-N36 (Tomography with Uncertainties). The financial support by the Austrian Federal Ministry for Digital and Economic Affairs, the National Foundation for Research, Technology and Development and the Christian Doppler Research Association is gratefully acknowledged. BH is supported by the German Science Foundation (DFG) under the grant HO 1454/13-1 (Project No. 453804957).

2304.09910

Robust trajectory tracking for underactuated mechanical systems without velocity measurements

In this paper, the notion of contraction is used to solve the trajectory-tracking problem for a class of mechanical systems. Additionally, we propose a dynamic extension to remove velocity measurements from the controller while rejecting matched disturbances. In particular, we propose three control designs stemming from the Interconnection and Damping Assignment Passivity-Based Control approach. The first controller is a tracker that does not require velocity measurements. The second control design solves the trajectory-tracking problem while guaranteeing robustness with respect to matched disturbances. Then, the third approach is a combination of both mentioned controllers. It is shown that all proposed design methods guarantee exponential convergence of the mechanical system to the desired (feasible) trajectory due to the contraction property of the closed-loop system. The applicability of this method is illustrated via the design of a controller for an underactuated mechanical system.

N. Javanmardi, P. Borja, M. J. Yazdanpanah, J. M. A. Scherpen

2023-04-19T18:15:59Z

http://arxiv.org/abs/2304.09910v2

# Robust trajectory tracking for ###### Abstract In this paper, the notion of contraction is used to solve the trajectory-tracking problem for a class of mechanical systems. Additionally, we propose a dynamic extension to remove velocity measurements from the controller while rejecting matched disturbances. In particular, we propose three control designs stemming from the Interconnection and Damping Assignment Passivity-Based Control approach. The first controller is a tracker that does not require velocity measurements. The second control design solves the trajectory-tracking problem while guaranteeing robustness with respect to matched disturbances. Then, the third approach is a combination of both mentioned controllers. It is shown that all proposed design methods guarantee exponential convergence of the mechanical system to the desired (feasible) trajectory due to the contraction property of the closed-loop system. The applicability of this method is illustrated via the design of a controller for an underactuated mechanical system. Nonlinear systems, Port-Hamiltonian systems, Trajectory tracking, Contractive system, Disturbance rejection, Underactuated systems, Interconnection and Damping Assignment Passivity-Based Control technique. + Footnote †: journal: Robust trajectory tracking for ## 1 Introduction Passivity Based Control (PBC) is a constructive approach to control nonlinear systems, e.g., Ortega et al. (2001), including, but not limited to, mechanical systems, e.g., Ortega et al. (2017). Among the PBC techniques, we find the so-called Interconnection and Damping Assignment (IDA), which is often formulated to stabilize systems modeled in the port-Hamiltonian (pH) framework. Notably, pH models are suitable to represent a wide range of physical systems, e.g., Dunidam et al. (2009), Van Der Schaft et al. (2014), while IDA is the most general PBC method to stabilize complex nonlinear systems, e.g., Ortega and Garcia-Canseco (2004). In particular, IDA-PBC has proven suitable to stabilize complex underactuated mechanical systems, e.g., Acosta et al. (2005). To solve the trajectory-tracking problem in mechanical systems, it is often useful to find the error dynamics. Then, the controller can be designed such that the error tends to zero, i.e., the trajectory-tracking problem is transformed into a stabilization problem, e.g., Dirksz and Scherpen (2009), Borja et al. (2021). Unfortunately, the traditional definition of the error often yields error dynamics that depend on the original system and the desired trajectories. In Yaghmaei and Yazdanpanah (2017), the authors provide an alternative to overcome this issue by combining the notion of contractive systems and IDA-PBC to solve the trajectory-tracking problem, originating the so-called timed IDA-PBC approach. In contrast to other methodologies, timed IDA-PBC does not rely on finding the error dynamics and hence, does not use the generalized canonical transformation reported in papers like Fujimoto and Sugie (2001) and Fujimoto et al. (2003). An application of the timed IDA-PBC approach has been recently proposed in Javanmardi et al. (2020). Furthermore, in the recent paper Reyes-Baez et al. (2020), the trajectory-tracking problem of flexible-joint robots in the pH framework is addressed by a family of virtual-contraction-based controllers. From an application viewpoint, some practical requirements, such as eliminating velocity sensors to reduce costs or noisy estimations and guaranteeing robustness in the presence of external forces or an input measurement bias, may be necessary for the closed-loop system. Some studies, e.g., Romero et al. (2014) and Yaghmaei and Yazdanpanah (2019), propose controllers without velocity measurements by using observers for a class of mechanical systems and pH systems, respectively. However, applying the observer dynamics may increase the complexity of the stability proof. Therefore, in some other publications, for instance, Dirksz and Scherpen (2009), Dirksz et al. (2008), and Dirksz and Scherpen (2012), dynamic extensions are employed in the pH framework to eliminate the velocity terms from the controller. In Dirksz et al. (2008), the IDA-PBC method for pH systems with a dynamic extension is investigated to asymptotically stabilize a class of mechan ical systems without velocity measurements. In the same line, Dirksz and Scherpen (2012) and Dirksz and Scherpen (2009) investigate the trajectory tracking approach with only position measurements realized by applying canonical transformation theory, which is reported in Fujimoto et al. (2003) for fully actuated mechanical systems. Furthermore, a saturated PBC scheme not requiring velocity measurements is proposed to solve the tracking problem for robotic arms in Borja et al. (2021). These studies do not guarantee exponential convergence for underactuated systems. On the other hand, the robustness of the energy-shaping controllers in the presence of external disturbances has been discussed in several references. For instance, robustification by adding an integral action on the passive outputs in a class of pH systems is investigated in Donaire and Junco (2009). The authors of Romero et al. (2013) follow a similar idea to design a controller for fully actuated systems with constant disturbances (matched and unmatched). The constant disturbance rejection problem for underactuated mechanical systems is addressed by adding an outer-loop controller to the IDA-PBC in Donaire et al. (2017). The mentioned studies focus on the regulation problem and using coordinate transformations to preserve the closed-loop pH form. In comparison with the mentioned studies, the present work represents a non-trivial extension of the method reported in Yaghmaei and Yazdanpanah (2017), where velocities measurements are removed from the controller via a dynamic extension. In contrast to Dirksz et al. (2008) and Donaire et al. (2017), which only investigate the regulation problem, the current work elaborates on trajectory tracking. In Dirksz and Scherpen (2009), Dirksz and Scherpen (2012), Borja et al. (2021) and Romero et al. (2013), the given approach is only for fully actuated systems and derived by a transformation obtained by solving a PDE equation. Besides, compared with all mentioned works, the proposed technique simultaneously covers robustification and no-velocity measurement. In this paper, we focus on addressing the trajectory-tracking problem for a class of mechanical systems, such that the controller rejects constant disturbances and does not need velocity measurements. Accordingly, the main contributions of the paper are summarized as follows: * We develop a control method to solve the trajectory-tracking problem without velocity terms for a class of underactuated mechanical systems. * We propose a robust tracking method that does not require any change of coordinates for a class of underactuated mechanical systems. * We establish some conditions to combine the two methods mentioned above for a class of underactuated mechanical systems. The controllers developed in this work are based on contraction and dynamic extensions. We stress that the convergence property of a contractive system guarantees that all the trajectories of the system converge exponentially as \(t\to\infty\). Therefore, all the tracking methods proposed in this paper ensure exponential convergence to the desired trajectory. The rest of the paper is organized as follows. Section 2.1 briefly recalls a class of contractive pH systems. The class of mechanical pH systems under study is introduced in Section 2.2. We propose a tracking controller depending only on position terms in Section 3. A robust tracking method is developed in Section 4. Section 5 contains a robust technique to track exponentially a reference trajectory without velocity measurements. The performance of the proposed method is simulated in Section 6 for an underactuated mechanical system. Section 7 is devoted to the concluding remarks. **Notation:** In the subsequent sections, \(A\succ 0\) (\(A\succeq 0\)) means that the matrix A is positive definite (positive semi-definite), respectively. \(\nabla H\) is defined as \([\,\frac{\partial H}{\partial x_{1}},\frac{\partial H}{\partial x_{2}},...\frac {\partial H}{\partial x_{n}}\,]^{\top}\) for a continuously differentiable function of \(H(x):\mathbb{R}^{n}\to\mathbb{R}_{+}\), and \(\nabla^{2}H\) is a matrix whose \(ij\)th element is \(\frac{\partial^{2}H}{\partial x_{i}\partial x_{j}}\). For a full-rank matrix \(g\in\mathbb{R}^{n\times m}\), with \(m\leq n\), we define \(g^{\dagger}\triangleq(g^{\top}g)^{-1}g^{\top}\). ## 2 Preliminaries ### Contractive pH systems Consider the input-state-output representation of pH systems, which is given by \[\begin{split}\dot{x}&=(J(x)-R(x))\nabla H(x)+g(x)u, \\ y&=g^{\top}(x)\nabla H(x),\quad u,y\in\mathbb{R}^{m}, \end{split} \tag{1}\] where \(D_{0}\) is the state space of the system, which is an open subset of \(\mathbb{R}^{n}\), \(x(t)\in D_{0}\subset\mathbb{R}^{n}\) is the state, the interconnection matrix \(J:D_{0}\to\mathbb{R}^{n\times n}\) is skew-symmetric, the damping matrix \(R:D_{0}\to\mathbb{R}^{n\times n}\) is positive semi-definite, \(H:D_{0}\to\mathbb{R}_{+}\) is the system's Hamiltonian, the input matrix \(g:D_{0}\to\mathbb{R}^{n\times m}\) satisfies \(\mathrm{rank}(g)=m\leq n\), \(u,\;y\) are the input vector and the output vector, respectively. To simplify the notation in the rest of the paper, we define the matrix \(F:D_{0}\to\mathbb{R}^{n\times n}\), \(F(x)\triangleq J(x)-R(x)\). In this paper, we tackle the trajectory-tracking problem. To this end, we exploit the properties of _contractive_ systems, particularly, the property that all the trajectories of a contractive system converge exponentially to each other as \(t\to\infty\). Therefore, the control problem is reduced to finding a controller such that the closed-loop system is contractive, and the desired trajectory is a feasible trajectory. Before proposing the control approach, it is necessary to introduce the following definition. **Definition 1**: _Consider the system (1) and let \(\mathbb{T}\) be an open subset of \(\mathbb{R}_{+}\). Then, \(x^{\star}(t):\mathbb{T}\to\mathbb{R}^{n}\) is said to be a feasible trajectory if there exists \(u^{\star}(t):\mathbb{T}\to\mathbb{R}^{m}\) such that, for all \(t\in\mathbb{T}\), the following relation holds:_ \[\dot{x}^{\star}=F(x^{\star}(t))\nabla H(x^{\star}(t))+g(x^{\star}(t))u^{\star}(t).\] The following theorem establishes the main results on contractive systems, which are the cornerstone of the results presented in Sections 3, 4, and 5. For further details on timed IDA-PBC and the proof of Theorem 1, we refer the reader to Yaghmaei and Yazdanpanah (2017). **Theorem 1**: _(_Yaghmaei and Yazdanpanah (2017)_)_ _Consider the following system_ \[\dot{x}=F_{d}\nabla H_{d}(x,t), \tag{2}\] _with \(F_{d}\triangleq J_{d}-R_{d}\), where \(J_{d}=-J_{d}^{\top}\) and \(R_{d}=R_{d}^{\top}\succeq 0\) are the (constant) desired interconnection and damping matrices, respectively. The system (2) is contractive on the open subset \(D_{0}\subseteq\mathbb{R}^{n}\) if:_ * _All the eigenvalues of_ \(F_{d}\) _have strictly negative real parts._ 2. The desired Hamiltonian function \(H_{d}(x,t):\mathbb{R}^{n}\times\mathbb{R}_{+}\to\mathbb{R}_{+}\) satisfies \[\alpha I\prec\nabla^{2}H_{d}(x,t)\prec\beta I,\quad\forall x\in D_{0},\] (3) for constants \(\alpha,\beta\), such that \(0<\alpha<\beta\). 3. There exists a positive constant \(\varepsilon\) such that \[N\triangleq\begin{bmatrix}F_{d}&\left(1-\frac{\alpha}{\beta}\right)F_{d}F_{d}^ {\top}\\ -\left(1-\frac{\alpha}{\beta}+\varepsilon\right)I&-F_{d}^{\top}\end{bmatrix},\] (4) has no eigenvalues on the imaginary axis. Remark 1: The proof of Theorem 1 only requires \(F_{d}\) to be Hurwitz (see Yaghmaei and Yazdanpanah (2017)). Hence, the condition \(F_{d}+F_{d}^{\top}\preceq 0\) (or \(Rd\succeq 0\)) is not necessary. However, if such a condition is not satisfied, then system (2) has not a pH structure. Using this fact is precisely the property that admits developing some control methodes without a coordinate transformation in the next sections. ### Mechanical systems in the pH framework We restrict our attention to mechanical systems, without natural dissipation, influenced by matched constant disturbances. Such systems admit a pH representation of the form \[\begin{bmatrix}\dot{q}\\ \dot{p}\end{bmatrix}=\begin{bmatrix}0&I\\ -I&0\end{bmatrix}\begin{bmatrix}\nabla_{q}H(q,p)\\ \nabla_{p}H(q,p)\end{bmatrix}+\begin{bmatrix}0\\ G(q)\end{bmatrix}(u(t)+d), \tag{5}\] \[H(q,p)=\frac{1}{2}p^{\top}M^{-1}(q)p+V(q),\] where \(q,p\in\mathbb{R}^{n}\) denote the generalized positions and momenta, respectively, \(u\in\mathbb{R}^{m}\) is the input vector, \(d\in\mathbb{R}^{m}\) is the constant disturbance, \(M:\mathbb{R}^{n}\to\mathbb{R}^{n\times n}\) is the inertia matrix, which is _positive definite_, \(V:\mathbb{R}^{n}\to\mathbb{R}_{+}\) is the potential energy of the system, and \(G:\mathbb{R}^{n}\to\mathbb{R}^{n\times m}\) is the input matrix, satisfying \(\text{rank}(G)=m\leq n\). ## 3 Tracking Method Without Velocity Measurements This section presents a controller that solves the trajectory-tracking problem without velocity measurements for mechanical systems. To this end, we propose a dynamic extension to inject damping without measuring the velocities of the system. Then, we apply the results of Theorem 1 to propose a contractive closed-loop dynamics, which ensures that the trajectories of the closed-loop system converge to the desired ones. Assumption 1: The inertia matrix \(M\in\mathbb{R}^{n\times n}\) is constant. Consider the following closed-loop dynamics \[\begin{bmatrix}\dot{q}\\ \dot{p}\\ \dot{x}_{e}\end{bmatrix}=\begin{bmatrix}0&J_{t_{2}}&0\\ -J_{t_{2}}^{\top}&0&S_{1}\\ S_{2}&0&F_{e}\end{bmatrix}\begin{bmatrix}\nabla_{q}H_{d_{1}}(q,p,x_{e},t)\\ \nabla_{p}H_{d_{1}}(q,p,x_{e},t)\\ \nabla_{x_{e}}H_{d_{1}}(q,p,x_{e},t)\end{bmatrix}, \tag{6}\] \[H_{d_{1}}(q,p,x_{e},t)\!=\!\frac{1}{2}p^{\top}M_{d}^{-1}p+\frac {1}{2}p_{e}^{\top}M_{e}^{-1}p_{e}+V_{d_{1}}(q,q_{e},t), \tag{7}\] where \(x_{e}(t)=[q_{e}^{\top}(t),p_{e}^{\top}(t)]^{\top}\in\mathbb{R}^{2m}\), with \(m\leq n\), denotes the state of the controller, \(H_{d_{1}}:\mathbb{R}^{2n}\times\mathbb{R}^{2m}\times\mathbb{R}_{+}\to\mathbb{R} _{+}\) is the closed-loop energy function, \(V_{d_{1}}:\mathbb{R}^{n}\times\mathbb{R}^{m}\times\mathbb{R}_{+}\to\mathbb{R} _{+}\) is the desired potential energy function, the desired constant inertia matrix \(M_{d}\in\mathbb{R}^{n\times n}\) and the constant controller inertia matrix \(M_{e}\in\mathbb{R}^{m\times m}\) are positive definite. Moreover, the constant matrix \(F_{e}\in\mathbb{R}^{2m\times 2m}\) is given by \(F_{e}\triangleq J_{e}-R_{e}\), where \(J_{e}=-J_{e}^{\top}\) and \(R_{e}=R_{e}^{\top}\succ 0\) are the constant controller interconnection and damping matrices, respectively. Furthermore, \(S_{1}\in\mathbb{R}^{n\times 2m}\), and \(S_{2}\in\mathbb{R}^{2m\times n}\) are full-rank matrices. In particular, \(S_{1}\) has the following structure \[S_{1}=\left[s_{11},\;s_{12}\right], \tag{8}\] where \(s_{11}\in\mathbb{R}^{n\times m}\) and \(s_{12}\in\mathbb{R}^{n\times m}\). Then, from Theorem 1 and Remark 1, we have the following corollary for the closed-loop system (6). Corollary 1: Consider the closed-loop dynamics (6). Suppose that: 1. The matrix \[P_{1}\triangleq\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}&0&S_{1}\\ S_{2}&0&F_{e}\end{bmatrix}\] (9) is Hurwitz. 2. There exist constants \(0<\alpha_{1}<\beta_{1}\) such that \(H_{d_{1}}(\xi,t)\) in (7), with \(\xi=[q^{\top},p^{\top},x_{e}^{\top}]^{\top}\), satisfies the inequality \[\alpha_{1}I\prec\nabla_{\xi}^{2}H_{d_{1}}(\xi,t)\prec\beta_{1}I,\;\forall\xi \in D_{1}\subseteq\mathbb{R}^{2n+2m},\] (10) The system (6) is contractive on \(D_{1}\) if there exists a positive constant \(\varepsilon_{1}\) such that \[N_{1}=\begin{bmatrix}P_{1}&\left(1-\frac{\alpha_{1}}{\beta_{1}}\right)P_{1}P_{ 1}^{\top}\\ -(1-\frac{\alpha_{1}}{\beta_{1}}+\varepsilon_{1})I&-P_{1}^{\top}\end{bmatrix}, \tag{11}\] has no eigenvalues on the imaginary axis. \(\square\) Remark 2: The first two terms in the energy function (7), correspond to the desired kinetic energy of the plant and the kinetic energy of the controller, respectively. Whereas \(V_{d_{1}}(q,q_{e},t)\) is the potential energy function that couples the plant with the controller. Remark 3: Note that the symmetric part of \(P_{1}\) has no definite sign. However, an appropriate selection of \(J_{d_{12}}\), \(S_{1}\), \(S_{2}\), and \(F_{e}\), may guarantee that \(P_{1}\) is Hurwitz. Moreover, the closed-loop structure can be achieved with a control law that does not include velocity terms or coordinate transformations. The next theorem provides a controller for mechanical systems that achieves trajectory tracking without measuring velocities. Theorem 2: Consider the mechanical system (5) under Assumption 1, with \(d=0\), and the feasible desired trajectory \(x^{\star}(t)=[q^{\star\top},p^{\star\top}]^{\top}\). If there exist \(J_{d_{12}}\), \(M_{d}\), \(M_{e}\), \(V_{d_{1}}\), \(S_{1}\), \(S_{2}\), and \(F_{e}\) such that: 1. The following matching equations hold 1 Footnote 1: We omit the arguments to ease the readability. \[M^{-1}p=J_{d_{12}}M_{d}^{-1}p,\] (12) \[G^{\perp}\bigg{(}\nabla_{q}V-J_{d_{12}}^{\top}\nabla_{q}V_{d_{1} }+s_{11}\nabla_{q_{e}}V_{d_{1}}+s_{12}M_{e}^{-1}p_{e}\bigg{)}=0.\] (13) 2. The conditions given in Corollary 1 are satisfied. 3. The following equation holds \[\dot{\xi}^{\star}=P_{1}\nabla_{\xi}H_{d_{1}}(\xi^{\star},t),\] where \(\xi^{\star}\triangleq[x^{\star\top},x_{e}^{\star\top}]^{\top}\) and \(p^{\star}=M\dot{q}^{\star}\). Then, the input signal \[\begin{split} u&=\,G^{\dagger}(q)\left(-J_{d_{12}}^{\top} \nabla_{q}V_{d_{1}}(q,q_{e},t)+S_{1}\nabla_{x_{e}}H_{d_{1}}(\xi,t)\right.\\ &\quad+\left.\nabla_{q}V(q)\right),\end{split} \tag{14}\] with \[\dot{x}_{e}=S_{2}\nabla_{q}V_{d_{1}}(q,q_{e},t)+F_{e}\nabla_{x_{e}}H_{d_{1}}( \xi,t), \tag{15}\] guarantees that the trajectories of the closed-loop system converge exponentially to \(x^{\star}(t)\). **Proof.** Because of (i), (5) in closed-loop with (14) and (15) yields (6). Moreover, from (ii), the closed-loop system is contractive. Furthermore, (iii) ensures that \(\xi^{\star}(t)\) is a trajectory of (6). Accordingly, due to the convergence property of contractive systems (Lohmiller and Slotine, 1998, Theorem 1), the trajectories of the closed-loop system (6) converge exponentially to \(\xi^{\star}(t)\). \(\blacksquare\) ### Parameter design for solving the matching PDEs. Consider (5) with constant input matrix \(G\), constant inertia matrix \(M\), and without external disturbance, i.e., \(d=0\). Choose \(M_{d}\) according to one of the following cases: 1. \(J_{d_{12}}=M^{-1}M_{d}\) in the case of total energy shaping. 2. \(J_{d_{12}}=I\), \(M_{d}=M\) in the case of potential energy shaping. Consider the following target system: \[\begin{bmatrix}\dot{q}\\ \dot{p}\end{bmatrix}=\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}&0\end{bmatrix}\begin{bmatrix}\nabla_{q}H_{d}(q,p)\\ \nabla_{p}H_{d}(q,p)\end{bmatrix}, \tag{16}\] \[H_{d}(q,p)=\frac{1}{2}p^{\top}M_{d}^{-1}p+\tilde{V}_{d}(q), \tag{17}\] where \(\tilde{V}_{d}(q)\) is the desired potential energy. Hence, to solve the conventional IDA-PBC problem, the following matching equation needs to be solved \[G^{\perp}\Big{(}\nabla_{q}V(q)-J_{d_{12}}^{\top}\nabla_{q}\tilde{V}_{d}(q) \Big{)}=0. \tag{18}\] Now, consider the tracking approach presented in Theorem 2. Set \(S_{1}=G[k_{11},k_{12}]\), where \(k_{11},k_{12}\in\mathbb{R}^{m\times m}\). Accordingly, we have \(s_{11}=Gk_{11}\) and \(s_{12}=Gk_{12}\) in (8). Therefore, the matching equation (13) is reduced to \[G^{\perp}\Big{(}\nabla_{q}V(q)-J_{d_{12}}^{\top}\nabla_{q}V_{d_{1}}(q,q_{e},t )\Big{)}=0. \tag{19}\] The set of solutions to (19) is the same as the set of solutions to (18). Therefore, if the general solution to (18) is available, one can use it to solve (19). ## 4 Robust Tracking Method Subject to Matched Disturbances In this section, the main objective is to design a dynamical controller such that the mechanical system (5) exponentially tracks the desired signal in the presence of constant matched disturbances. To this end, we design a contractive closed-loop system. In particular, we propose a dynamical controller \(u(t)=v(x(t),\zeta(t))\), where \(\zeta(t)\in\mathbb{R}^{m}\), that rejects the unknown disturbance and guarantees the contraction property for the closed-loop system. **Assumption 2**: _The input matrix \(G\) is constant._ Consider the following closed-loop system subject to a matched disturbance \(d\in\mathbb{R}^{m}\): \[\begin{bmatrix}\dot{q}\\ \dot{p}\\ \dot{\zeta}\end{bmatrix}=\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}-R_{d}&W_{1}\\ W_{2}&W_{3}&0\end{bmatrix}\begin{bmatrix}\nabla_{q}H_{d_{2}}(q,p,\zeta,t)\\ \nabla_{p}H_{d_{2}}(q,p,\zeta,t)\\ \nabla_{\zeta}H_{d_{2}}(q,p,\zeta,t)\end{bmatrix}+\begin{bmatrix}0\\ G\\ 0\end{bmatrix}d, \tag{20}\] \(H_{d_{2}}(q,p,\zeta,t)=\frac{1}{2}p^{\top}M_{d}^{-1}(q)p+V_{d_{2}}(q,t)\) \(+\frac{1}{2}(\zeta(t)-\gamma_{1}(t))^{\top}K_{\zeta}(\zeta(t)-\gamma_{1}(t)),\) where \(\zeta(t)\in\mathbb{R}^{m}\), with \(m\leq n\), is the state of the controller; \(H_{d_{2}}:\mathbb{R}^{2n}\times\mathbb{R}^{m}\times\mathbb{R}_{+}\to\mathbb{R}_ {+}\) represents the closed-loop energy function; \(V_{d_{2}}:\mathbb{R}^{n}\times\mathbb{R}_{+}\to\mathbb{R}_{+}\) is the desired potential energy function, \(\gamma_{1}(t)\in\mathbb{R}^{m}\); \(K_{\zeta}\in\mathbb{R}^{m\times m}\) is positive definite. Moreover, the desired inertia matrix \(M_{d}:\mathbb{R}^{n}\to\mathbb{R}^{n\times n}\) and the damping matrix \(R_{d}\in\mathbb{R}^{n\times n}\) are positive definite, \(W_{1}\in\mathbb{R}^{n\times m}\) and \(W_{2},W_{3}\in\mathbb{R}^{m\times n}\) satisfy \(\mathrm{rank}(W_{1})=\mathrm{rank}(W_{2})=\mathrm{rank}(W_{3})=m\leq n\). In order to show that (20) is contractive, we define the following energy function \[\begin{split}\bar{H}_{d_{2}}(q,p,\zeta,t)\triangleq\frac{1}{2}p^ {\top}M_{d}^{-1}(q)p+V_{d_{2}}(q,t)\\ +\frac{1}{2}(\zeta(t)-\gamma_{1}(t)+\mu_{1})^{\top}K_{\zeta}( \zeta(t)-\gamma_{1}(t)+\mu_{1}),\end{split} \tag{21}\] with \(\mu_{1}\triangleq(W_{1}K_{\zeta})^{\dagger}Gd\). Then rewrite the closed-loop system (20) as \[\begin{bmatrix}\dot{q}\\ \dot{p}\end{bmatrix}=\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}&-R_{d}&W_{1}\\ W_{2}&W_{3}&0\end{bmatrix}\begin{bmatrix}\nabla_{q}\bar{H}_{d_{2}}(q,p, \zeta,t)\\ \nabla_{p}\bar{H}_{d_{2}}(q,p,\zeta,t)\\ \nabla_{\zeta}\bar{H}_{d_{2}}(q,p,\zeta,t)\end{bmatrix}. \tag{22}\] The next corollary follows from Theorem 1. **Corollary 2**: _The system (22) is contractive on an open subset \(D_{2}\subseteq\mathbb{R}^{2n+m}\) if:_ **C1.**: _The matrix_ \[P_{2}\triangleq\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}&-R_{d}&W_{1}\\ W_{2}&W_{3}&0\end{bmatrix}, \tag{23}\] _is Hurwitz._ **C2.**: _The following condition is satisfied for the positive constants_ \(\alpha_{2},\beta_{2}\) _(with_ \(\alpha_{2}<\beta_{2}\)_):_ \[\alpha_{2}I\prec\nabla_{q}^{2}\bar{H}_{d_{2}}(\eta,t)\prec\beta_{2}I,\quad \forall\eta\in D_{2}, \tag{24}\] _where_ \(\eta=[q^{\top},p^{\top},\zeta^{\top}]^{\top}\)_._ **C3.**: _The following matrix has no eigenvalues on the imaginary axis for a positive constant_ \(\varepsilon_{2}\)_:_ \[N_{2}=\begin{bmatrix}P_{2}&\big{(}1-\frac{\alpha_{2}}{\beta_{2}}\big{)}P_{2}P _{2}^{\top}\\ -(1-\frac{\alpha_{2}}{\beta_{2}}+\varepsilon_{2})I&-P_{2}^{\top}\end{bmatrix}. \quad\Box \tag{25}\] The next theorem provides a dynamical controller that solves the trajectory-tracking problem under the effect of constant matched disturbances for mechanical systems. To simplify the notation in the rest of the paper, we define \(\Theta(q,p,t)\triangleq\frac{1}{2}\nabla_{q}\big{(}p^{\top}M_{d}^{-1}(q)p\big{)}+ \nabla_{q}V_{d_{2}}(q,t)\). **Theorem 3**: _Consider the mechanical system (5), with a feasible trajectory \(x^{\star}(t)=[q^{\star\top},p^{\star\top}]^{\top}\), and a constant input matrix \(G\). Assume that there exist \(J_{d_{12}}\), \(M_{d}\), \(V_{d_{2}}\), \(R_{d},K_{\zeta}\) and \(W_{i}\), for \(i\)\(\in\)\(\{1,2,3\}\), such that:_ 1. _The following matching equations hold_ \[M^{-1}(q)p=J_{d_{12}}M_{d}^{-1}(q)p, \tag{26}\] \[G^{\perp}\Big{(}\nabla_{q}(p^{\top}M^{-1}(q)p)-J_{d_{12}}^{\top} \nabla_{q}(p^{\top}M_{d}^{-1}(q)p)\] \[-2R_{d}M_{d}^{-1}(q)p\Big{)}=0,\] (27) \[G^{\perp}\Big{(}\nabla_{q}V-J_{d_{12}}^{\top}\nabla_{q}V_{d_{2}}+ W_{1}K_{\zeta}(\zeta-\gamma_{1})\Big{)}\!=\!0. \tag{28}\] 2. The conditions of Corollary 2 are satisfied. 3. The following equation is satisfied: \[W_{2}\Theta(q^{\star},p^{\star},t)+W_{3}M_{d}^{-1}(q^{\star})p^{\star}=0,\] where \(p^{\star}=M(q^{\star})\dot{q}^{\star}\). The controller \[\begin{split} u&=G^{\dagger}\Big{(}-J_{d_{12}}^{\top} \Theta(q,p,t)-R_{d}M_{d}^{-1}(q)p\\ +& W_{1}K_{\zeta}(\zeta(t)-\gamma_{1}(t))+\nabla_{q} H(q,p)\Big{)},\end{split} \tag{29}\] with \[\gamma_{1}(t) =(G^{\top}W_{1}K_{\zeta})^{-1}\big{(}G^{\top}(-J_{d_{12}}^{\top} \Theta(q^{\star},p^{\star},t)\] \[-R_{d}M_{d}^{-1}(q^{\star})p^{\star})-G^{\top}\dot{p}^{\star} \big{)}, \tag{30}\] \[\dot{\zeta}(t) =W_{2}\Theta(q,p,t)+W_{3}M_{d}^{-1}(q)p, \tag{31}\] makes the system (5) a local exponential tracker for \(x^{\star}(t)\), while eliminating the effect of the constant disturbance \(d\). **Proof.** Set the controller of the system (5) as (29). Hence, from (i), the closed-loop is given by (22), and because of (ii), it is contractive. Moreover, the desired signals \((x^{\star}(t),\zeta^{\star})\), where \(\zeta^{\star}\in\mathbb{R}^{m}\) is constant, are evaluated in (22) as follows: \[\dot{p}^{\star}=-J_{d_{12}}^{\top}\nabla_{q}\bar{H}_{d_{2}}(\eta ^{\star},t)-R_{d}M_{d}^{-1}(q^{\star})p^{\star}\] \[+W_{1}K_{\zeta}(\zeta^{\star}-\gamma_{1}(t)+\mu_{1}), \tag{32}\] \[0=W_{2}\nabla_{q}\bar{H}_{d_{2}}(\eta^{\star},t)+W_{3}M_{d}^{-1} (q^{\star})p^{\star}. \tag{33}\] Multiply both sides of (32) by the invertible matrix \([G^{\perp},G^{\top}]^{\top}\) and replace \(\nabla_{q}\bar{H}_{d_{2}}(\eta^{\star},t)\) by \(\Theta(q^{\star},p^{\star},t)\). From (iii) and (30), it follows that (32) and (33) are satisfied with \(\zeta^{\star}=-\mu_{1}\). Hence, due to the convergence property of contractive systems, all the trajectories exponentially converge to the desired ones. Note that there is no disturbance information in the controller. Besides, since \(\zeta^{\star}=-\mu_{1}\), the effect of the disturbance in (5) is eliminated by the controller as the time tends to infinity. \(\blacksquare\) **Remark 4**.: Suppose Assumption 1. Choosing \(W_{1}=GK_{2}\) and \(R_{d}=GK_{v}G^{\top}\), where \(K_{2}\in\mathbb{R}^{m\times m}\) and \(K_{v}\in\mathbb{R}^{m\times m}\), the matching equations (27) and (28) reduce to \[G^{\perp}\Big{(}\nabla_{q}V-J_{d_{12}}^{\top}\nabla_{q}V_{d_{2}}(q,t)\Big{)}=0. \tag{34}\] The solution to (34) can be achieved by solving the matching equation for regulation via IDA-PBC, given in (18). ## 5 Robust Tracking Method Without Velocity Measurements Motivated by the approaches provided in Sections 3 and 4, a robust tracking method depending only on position terms is proposed for mechanical systems in this section. To this end, a contractive closed-loop system is designed. Then, we propose a dynamical controller with no velocity measurements to track the desired trajectory while rejecting the constant disturbance. Consider the following closed-loop system subject to a matched disturbance \(d\): \[\begin{bmatrix}\dot{q}\\ \dot{p}\\ \dot{\mathcal{Z}}\end{bmatrix}=\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}&0&F_{1}\\ F_{2}&0&F_{3}\end{bmatrix}\begin{bmatrix}\nabla_{q}\bar{H}_{d_{3}}(q,p, \mathcal{Z},t)\\ \nabla_{p}\bar{H}_{d_{3}}(q,p,\mathcal{Z},t)\end{bmatrix}+\begin{bmatrix}0\\ 0\\ 0\end{bmatrix}d, \tag{35}\] \[H_{d_{3}}(q,p,\mathcal{Z},t)=\frac{1}{2}p^{\top}M_{d}^{-1}p+V_{d _{3}}(q,z_{1},t)\] \[+\frac{1}{2}(z_{2}(t)-\gamma_{2}(t))^{\top}K_{z}(z_{2}(t)-\gamma_{ 2}(t)),\] where \(\mathcal{Z}(t)\!=\![z_{1}^{\top}(t),z_{2}^{\top}(t)]^{\top}\) with \(z_{1},z_{2}\in\mathbb{R}^{m}\), \(m\!\leq\!n\), indicates the states of the controller, \(M_{d}\in\mathbb{R}^{n\times n}\) is the desired constant inertia matrix, \(H_{d_{3}}\colon\mathbb{R}^{2n}\times\mathbb{R}^{2m}\times\mathbb{R}_{+}\to \mathbb{R}_{+}\) is the closed-loop energy function, \(V_{d_{3}}\colon\mathbb{R}^{n}\times\mathbb{R}^{m}\times\mathbb{R}_{+}\to \mathbb{R}_{+}\) is the desired potential energy function. Moreover, \(K_{z}\!\in\!\mathbb{R}^{m\times m}\!\succ\!0\), \(\gamma_{2}(t)\!\in\mathbb{R}^{m}\), and \(F_{1}\in\mathbb{R}^{n\times 2m}\), \(F_{2}\in\mathbb{R}^{2m\times n}\), and \(F_{3}\in\mathbb{R}^{2m\times 2m}\) are given by \[F_{1}=[\Gamma_{11},\;\Gamma_{12}]\,,F_{2}^{\top}=\begin{bmatrix}\Gamma_{21}^{ \top},\;\Gamma_{22}^{\top}\end{bmatrix},F_{3}=\begin{bmatrix}-\Gamma_{33}&0 \\ 0&0\end{bmatrix}\succeq 0, \tag{36}\] where \(\Gamma_{11},\Gamma_{12}\in\mathbb{R}^{n\times m}\) and \(\Gamma_{21},\Gamma_{22}\in\mathbb{R}^{m\times n}\) are full-rank matrices, and \(\Gamma_{33}\in\mathbb{R}^{m\times m}\) is positive definite. To use the contraction property mentioned in Theorem 1, we recast the closed-loop system (35) with new energy function \(\bar{H}_{d_{3}}(q,p,\mathcal{Z},t)\) as follows2 Footnote 2: We omit the argument \(t\) in \(z_{1}\), \(z_{2}\), and \(\gamma_{2}\). \[\begin{bmatrix}\dot{q}\\ \dot{p}\\ \dot{\mathcal{Z}}\end{bmatrix}=\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}&0&F_{1}\\ F_{2}&0&F_{3}\end{bmatrix}\begin{bmatrix}\nabla_{q}\bar{H}_{d_{3}}(q,p, \mathcal{Z},t)\\ \nabla_{p}\bar{H}_{d_{3}}(q,p,\mathcal{Z},t)\\ \nabla_{\mathcal{Z}}\bar{H}_{d_{3}}(q,p,\mathcal{Z},t)\end{bmatrix}, \tag{37}\] \[\begin{split}\bar{H}_{d_{3}}(q,p,\mathcal{Z},t)&=\frac{1}{2}p^{ \top}M_{d}^{-1}p+V_{d_{3}}(q,z_{1},t)\\ &\quad+\frac{1}{2}(z_{2}-\gamma_{2}+\mu_{2})^{\top}K_{z}(z_{2}-\gamma_{2}+ \mu_{2}),\end{split} \tag{38}\] where \(\mu_{2}\triangleq(\Gamma_{12}K_{z})^{\dagger}Gd\). Derived from Theorem 1, the following corollary establishes conditions to guarantee that (37) is a contractive system using similar arguments as the ones given in Corollaries 1 and 2. **Corollary 3**.: Consider the closed-loop dynamics (37). Suppose that: **C1.**: The matrix \[P_{3}\triangleq\begin{bmatrix}0&J_{d_{12}}&0\\ -J_{d_{12}}^{\top}&0&F_{1}\\ F_{2}&0&F_{3}\end{bmatrix}, \tag{39}\] is Hurwitz. **C2.**: There exist constants \(0\!<\!\alpha_{3}\!<\!\beta_{3}\) such that \(\bar{H}_{d_{3}}(\theta,t)\) in (38), with \(\theta\!=\![q^{\top},p^{\top},\mathcal{Z}^{\dagger}]^{\top}\), satisfies the inequality \[\alpha_{3}I\prec\nabla_{\theta}^{2}\bar{H}_{d_{3}}(\theta,t)\prec\beta_{3}I, \;\forall\theta\in D_ Theorem 4: Consider the mechanical system (5) under Assumptions 1 and 2, with a feasible trajectory \(x^{\star}(t)=[q^{\star\top},p^{\star\top}]^{\top}\). If there exist \(J_{d12}\), \(M_{d}\), \(V_{d_{3}}\), \(K_{z}\) and \(F\,_{i}\), for \(i\)\(\in\)\(\{1,2,3\}\), in (36) such that: 1. The following matching equations hold \[M^{-1}p=J_{d_{12}}M_{d}^{-1}p,\] (42) \[G^{\perp}\Big{(}\nabla_{q}V(q)-J_{d_{12}}^{\top}\nabla_{q}V_{d_{ 3}}(q,z_{1},t)\] \[+\Gamma_{11}\nabla_{z_{1}}V_{d_{3}}(q,z_{1},t)+\Gamma_{12}K_{z}(z _{2}-\gamma_{2})\Big{)}=0\] (43) 2. The conditions mentioned in Corollary 3 are satisfied. 3. The following equations are satisfied \[\dot{z}_{1}^{\star}=\Gamma_{21}\Phi(q^{\star},z_{1}^{\star},t)- \Gamma_{33}\nabla_{z_{1}}V_{d_{3}}(q^{\star},z_{1}^{\star},t)\] \[0=\Gamma_{22}\Phi(q^{\star},z_{1}^{\star},t)\] where \(p^{\star}=M\dot{q}^{\star}\). The controller \[u=G^{\dagger}\Big{(}-J_{d_{12}}^{\top}\Phi(q,z_{1},t)+\Gamma_{11} \nabla_{z_{1}}V_{d_{3}}(q,z_{1},t)\] \[\qquad\qquad+\Gamma_{12}K_{z}(z_{2}-\gamma_{2})+\nabla_{q}H\Big{)},\] with \[\gamma_{2}(t)=(G^{\top}\Gamma_{12}K_{z})^{-1}\big{(}G^{\top}(-J_{d_{12}}^{ \top}\Phi(q^{\star},z^{\star},t)\] (45) \[+G^{\top}\Gamma_{11}\nabla_{z_{1}}V_{d_{3}}(q^{\star},z_{1}^{ \star},t)-G^{\top}\dot{p}^{\star}\big{)},\] and \[\dot{z}_{1}=\Gamma_{21}\Phi(q,z_{1},t)-\Gamma_{33}\nabla_{z_{1}}V_{d_{ 3}}(q,z_{1},t)\] (46) \[\dot{z}_{2}=\Gamma_{22}\Phi(q,z_{1},t)\] realizes exponential tracking of \(x^{\star}(t)\) without velocity measurements while eliminating the disturbance effect. **Proof.** Because of (i), substituting (44) into (5) yields (37). Moreover, (ii) ensures that the closed-loop system (37) is contractive. We next evaluate the desired signals (\(x^{\star},z_{1}^{\star},z_{2}^{\star}\)), where \(z_{2}^{\star}\in\mathbb{R}^{m}\) is constant, in the contractive system (37) as follows \[\dot{p}^{\star}=-J_{d_{12}}^{\top}\nabla_{q}\bar{H}_{d_{3}}( \theta^{\star},t) \tag{47}\] \[+\Gamma_{11}\nabla_{z_{1}}V_{d_{3}}(q^{\star},z_{1}^{\star},t)+ \Gamma_{12}K_{z}(z_{2}^{\star}-\gamma_{2}+\mu_{2}),\] \[\dot{z}_{1}^{\star}=\Gamma_{21}\nabla_{q}\bar{H}_{d_{3}}(\theta^{ \star},t)-\Gamma_{33}\nabla_{z_{1}}V_{d_{3}}(q^{\star},z_{1}^{\star},t)\] (48) \[0=\Gamma_{22}\nabla_{q}\bar{H}_{d_{3}}(\theta^{\star},t) \tag{49}\] Then, we multiply both sides of (47) by the invertible matrix \([G^{\perp},G^{\top}]^{\top}\) and replace \(\nabla_{q}\bar{H}_{d_{3}}(\theta^{\star},t)=\Phi(q^{\star},z_{1}^{\star},t)\) in (47)-(49). Since (iii) and (45), we conclude that (47)-(49) are satisfied with \(z_{2}^{\star}=-\mu_{2}\). Hence, convergence property in the contractive system implies that all the trajectories of (37) exponentially converge to the desired ones. \(\blacksquare\) Subsections 5.1 and 5.2 study how to apply the result of Theorem 4 to two classes of mechanical systems. ### Fully actuated mechanical systems To introduce the result of this subsection, we consider that \(V_{d_{3}}(q,z_{1},t)\) is given by \[V_{d_{3}}(q,z_{1},t) =\frac{1}{2}(q-L(t))^{\top}K_{q}(q-L(t)) \tag{50}\] \[+\frac{1}{2}(q-z_{1})^{\top}K_{c}(q-z_{1}),\] where \(K_{q},K_{c}\in\mathbb{R}^{n\times n}\) are positive definite and \(L:\mathbb{R}_{+}\rightarrow\mathbb{R}^{n}\) is given by \[L(t)=K_{q}^{-1}K_{c}(q^{\star}-z_{1}^{\star})+q^{\star}. \tag{51}\] Hence, \[\nabla_{z_{1}}V_{d_{3}}(q,z_{1},t)=-K_{c}(q-z_{1}), \tag{52}\] \[\Phi(q,z_{1},t)=K_{q}(q-L(t))+K_{c}(q-z_{1}).\] The next proposition establishes a set of criteria, based on Theorem 4, to design a controller for fully actuated mechanical systems. Proposition 1: Consider (5) with \(n=m\), \(G=I\), constant \(M\), and a feasible trajectory \(x^{\star}(t)=[q^{\star\top},p^{\star\top}]^{\top}\). Set \(M_{d}=M\), \(J_{d_{12}}=I\), and \(V_{d_{3}}(q,z_{1},t)\) as in (50). Select the parameters \(K_{q},K_{c},K_{z}\), \(F_{1}\), \(F_{2}\), and \(F_{3}\) such that the conditions in Corollary 3 are satisfied. The input signal \[u= -K_{q}(q-L(t))-(I+\Gamma_{11})K_{c}(q-z_{1})\] \[+\Gamma_{12}K_{z}(z_{2}-\gamma_{2})+\nabla_{q}V(q),\] with \(L(t)\) given by (51) and \[\dot{z}_{1}^{\star} =\Gamma_{33}K_{c}(q^{\star}-z_{1}^{\star}), \tag{53}\] \[\gamma_{2} =(\Gamma_{12}K_{z})^{-1}\big{(}-\Gamma_{11}K_{c}(q^{\star}-z_{1}^{ \star})-\dot{p}^{\star}\big{)}, \tag{54}\] and \[\dot{z}_{1} =\Gamma_{21}K_{q}(q-L)+(\Gamma_{21}+\Gamma_{33})K_{c}(q-z_{1}),\] \[\dot{z}_{2} =\Gamma_{22}\big{(}K_{q}(q-L)+K_{c}(q-z_{1})\big{)},\] realizes exponential robust tracking of \(x^{\star}(t)\) without requiring velocity measurements. **Proof.** We want to prove that the conditions in Theorem 4 are satisfied. To this end, note that \(G^{\perp}=0\). Hence, the matching equations (42)-(43), are (trivially) satisfied. Furthermore, the conditions in Corollary 3 are met by construction. Consequently, (ii) in Theorem 4 holds. From (51), (52) and (53) evaluated at \((q^{\star},p^{\star},t)\), it follows that (iii) in Theorem 4 holds. \(\blacksquare\) ### Underactuated mechanical systems To establish the result of this subsection, we consider \[V_{d_{3}}(q,z_{1},t) =\phi_{1}(q)+\frac{1}{2}k_{1}(\phi_{2}(q)-\ell_{3}(t))^{2} \tag{55}\] \[+\frac{1}{2}k_{2}(\phi_{2}(q)-\phi_{3}(z_{1}))^{2},\] where \(k_{1}>0,k_{2}>0\), \(\phi_{1},\phi_{2}:\mathbb{R}^{n}\rightarrow\mathbb{R}\), \(\phi_{3}:\mathbb{R}^{m}\rightarrow\mathbb{R}\) and \(\ell_{3}:\mathbb{R}_{+}\rightarrow\mathbb{R}\) is given by \[\ell_{3}(t)=\bigg{(}\frac{(\Gamma_{22}\nabla_{q}\phi_{2})^{ \dagger}}{k_{1}}\Gamma_{22}\bigg{)}\big{(}\nabla_{q}\phi_{1}(q^{\star})\] \[+k_{1}\phi_{2}(q^{\star})\nabla_{q}\phi_{2}(q^{\star})+k_{2}\big{(} \phi_{2}(q^{\star})-\phi_{3}(z_{1}^{\star})\big{)}\nabla_{q}\phi_{2}(q^{\star}) \big{)}, \tag{56}\] Thus, \[\nabla_{z_{1}}V_{d_{3}}(q,z_{1},t)=-k_{2}(\phi_{2}(q)-\phi_{3}(z_{1}))\nabla_{z_{1}} \phi_{3}(z_{1}),\] \[\Phi(q,z_{1},t)=\nabla_{q}\phi_{1}(q)+k_{1}(\phi_{2}(q)-l_{3}(t)) \nabla_{q}\phi_{2}(q)\] (57 2. Total energy shaping. Hence, \(J_{d_{12}}\!=\!M^{-1}M_{d}\). If the parameters \(k_{1},k_{2}\!\succ\!0,K_{z}\!\succ\!0,F_{i},\,\phi_{i}\), for \(i\in\{1,2,3\}\), satisfy the conditions in Corollary 3 and (43), then it follows from (57) that the control law (44), with the desired potential energy given in (55), guarantees that the closed-loop system tracks \(x^{\star}(t)\) and is robust with respect to constant matched disturbances. **Proof.** The matching equations (42) are satisfied in scenarios (a) and (b). Besides, the conditions in Corollary 3 and (43) are satisfied by construction. Hence, (i) and (ii) in Theorem 4 hold. Given (56), (57), (58) and the corresponding \(\Phi(q,z_{1},t)\), (iii) in Theorem 4 is satisfied. Remark 5: Following a similar rationale as the one in Section 3.1, suppose \(F_{\,1}=GK_{f}\), where \(K_{f}\in\mathbb{R}^{m\times 2m}\). The matching equation (43) is reduced to \[G^{\perp}\Big{(}\nabla_{q}V(q)-J_{d_{12}}^{\top}\nabla_{q}V_{d_{3}}(q,z_{1},t )\Big{)}=0. \tag{59}\] Note that the set of solutions to (59) is the same as the set of solutions to (18) in the conventional IDA-PBC problem. Remark 6: If the feasible trajectory \(x^{\star}(t)\) is chosen constant in Theorems 2, 3 and 4, then the proposed controllers solve the regulation problem while guaranteeing exponential stability of the desired equilibrium \(x^{\star}\). 6. SIMULATION In this section, we illustrate the effectiveness of the results proposed in Section 5. To this end, we solve the trajectory-tracking problem for an underactuated mechanical system, namely, the ball-on-wheel system (see Fig. 1). The dynamics of the ball on wheel system with constant matched disturbances are given by (5) with input matrix \(G=[0,1]^{\top}\) and the state and input dimensions \(n=2\) and \(m=1\), respectively. The system states \(q_{1}\) and \(q_{2}\) are the angular displacement of the contact point between the ball and the wheel and the angular displacement of the wheel, respectively. The Hamiltonian potential energy and the inertia matrix are given by \[V(q)=m_{4}\cos(q_{1}),\quad m_{4}=m_{b}g_{r}(r_{w}+r_{b}),\] where \(m_{b},r_{w},r_{b},g_{r}\), and \(I_{w}\) are the mass of the ball, the radius of the wheel, the radius of the ball, the gravity acceleration and the moment inertia of the wheel, respectively. The closed-loop mechanical system is of the form (37) and (38). To achieve the total energy shaping objective in Corollary 2, \(M_{d}\) is characterized as follows \[M_{d}=\left[\begin{array}{cc}a_{1}&a_{2}\\ a_{2}&a_{4}\end{array}\right],\quad a_{1},a_{3}>0,\ a_{1}a_{3}>a_{2}^{2},\] \(F_{\,1}\) is chosen according to Remark 5. Therefore, the matching equation (13) is simplified as \[[1,0]\big{(}-m_{4}\sin(q_{1})-M_{d}M^{-1}\nabla_{q}V_{d}(q,z_{1},t)\big{)}=0. \tag{60}\] Then, the solution to (60) is determined as the potential energy function (55) with the following ingredients \[\phi_{1}(q)=\lambda_{1}cos(q_{1}),\quad\phi_{2}(q)=\lambda_{2}q_{1}+q_{2}, \quad\phi_{3}(z_{1})=z_{1},\] where \[\lambda_{1}=\frac{m_{4}(m_{1}m_{3}-m_{2}^{2})}{a_{1}m_{3}-a_{2}m_{2}},\quad \lambda_{2}=\frac{m_{2}a_{1}-m_{1}a_{2}}{a_{1}m_{3}-a_{2}m_{2}}.\] Note that the solution to (60) can be determined based on the general solution to the matching equation in (Yaghmaei and Yazdanpanah, 2019, Chapter 6), where the timed IDA-PBC approach is investigated for this system. Now, by selecting suitable values of the parameters \(k_{1},k_{2}>0\), \(K_{z}\succ 0\), \(F_{\,i}\), for \(i\in\{1,2,3\}\), the conditions in Corollary 3 are satisfied. Thereby, the robust tracking controller without velocity terms (44) using the trajectory gains (45) and (56) is designed to track the reference \(x^{\star}(t)\) with the matched constant disturbance \(d\), which is added to the system at \(t=0.8s\). We use the numerical values stated in Table 1 for simulation purposes. The results are depicted in Fig. 2. Note that the angular displacement of the contact point (i.e, \(q_{1}(t)\)) exponentially tracks the desired signal \(a(t)=2.5\sin(4t)\), while the effect of the disturbance \(d\) is eliminated. Besides, the desired trajectory can be computed based on Definition (1) as follows \[q_{1}^{\star}(t) =a(t),\quad p_{1}^{\star}(t)=\int_{o}^{t}m_{4}\sin(a(\tau))d_{\tau} +b_{0},\] \[p_{2}^{\star}(t) =\frac{m_{3}}{m_{2}}\int_{o}^{t}m_{4}\sin(a(\tau))d_{\tau}+\frac{m _{3}}{m_{2}}b_{0}-\frac{m_{1}m_{3}-m_{2}^{2}}{m_{2}}\tilde{a}(t),\] \[q_{2}^{\star}(t) =\frac{1}{m_{2}}\int_{o}^{t}\int_{o}^{\tau}m_{4}\sin(a(\sigma))d_{ \sigma}d_{\tau}-\frac{m_{1}}{m_{2}}a(t)+b_{1},\] \[u^{\star}(t) =\frac{m_{3}}{m_{2}}m_{4}\sin(a(t))-\frac{m_{3}}{m_{2}}b_{0}-\frac {m_{1}m_{3}-m_{2}^{2}}{m_{2}}\tilde{a}(t).\] ## 7 Conclusion This paper proposes an approach to address the tracking problem without velocity measurements for mechanical systems --fully actuated and underactuated cases--subject to matched constant disturbances. To this aim, we use the contraction property of the desired system Figure 1: Schematic of the ball on wheel system Figure 2: Desired and closed-loop trajectories for the ball-on-wheel system. Note that the angular displacement \(q_{1}\) exponentially tracks the desired signal \(a(t)=2.5\sin(4t)\). interconnected to the dynamic extension. The proposed method utilizes an extended form of the IDA-PBC technique. The suggested controller shows positive results in the simulation of the ball on a wheel system. ## Acknowledgements The authors thank Jose Angel Acosta for his feedback on the previous version of this paper.

2302.12700

Accounting for Differential Rotation in Calculations of the Sun's Angular Momentum-loss Rate

Sun-like stars shed angular momentum due to the presence of magnetised stellar winds. Magnetohydrodynamic models have been successful in exploring the dependence of this "wind-braking torque" on various stellar properties, however the influence of surface differential rotation is largely unexplored. As the wind-braking torque depends on the rotation rate of the escaping wind, the inclusion of differential rotation should effectively modulate the angular momentum-loss rate based on the latitudinal variation of wind source regions. In order to quantify the influence of surface differential rotation on the angular momentum-loss rate of the Sun, we exploit the dependence of the wind-braking torque on the effective rotation rate of the coronal magnetic field. This quantity is evaluated by tracing field lines through a Potential Field Source Surface (PFSS) model, driven by ADAPT-GONG magnetograms. The surface rotation rates of the open magnetic field lines are then used to construct an open-flux weighted rotation rate, from which the influence on the wind-braking torque can be estimated. During solar minima, the rotation rate of the corona decreases with respect to the typical solid-body rate (the Carrington rotation period is 25.4 days), as the sources of the solar wind shift towards the slowly-rotating poles. With increasing activity, more solar wind emerges from the Sun's active latitudes which enforces a Carrington-like rotation. The effect of differential rotation on the Sun's current wind-braking torque is found to be small. The wind-braking torque is ~10-15% lower during solar minimum, than assuming solid body rotation, and a few percent larger during solar maximum. For more rapidly-rotating Sun-like stars, differential rotation may play a more significant role, depending on the configuration of the large-scale magnetic field.

Adam J. Finley, Allan Sacha Brun

2023-02-24T15:58:13Z

http://arxiv.org/abs/2302.12700v1

# Accounting for differential rotation in calculations of the Sun's angular momentum-loss rate ###### Abstract Context:Sun-like stars shed angular momentum due to the presence of magnetised stellar winds. Magnetohydrodynamic models have been successful in exploring the dependence of this "wind-braking torque" on various stellar properties, however the influence of surface differential rotation is largely unexplored. As the wind-braking torque depends on the rotation rate of the escaping wind, the inclusion of differential rotation should effectively modulate the angular momentum-loss rate based on the latitudinal variation of wind source regions. Aims:Here we aim to quantify the influence of surface differential rotation on the angular momentum-loss rate of the Sun, in comparison to the typical assumption of solid-body rotation. Methods:To do this, we exploit the dependence of the wind-braking torque on the effective rotation rate of the coronal magnetic field, which is known to be vitally important in magnetohydrodynamic models. This quantity is evaluated by tracing field lines through a Potential Field Source Surface (PFSS) model, driven by ADAPT-GONG magnetograms. The surface rotation rates of the open magnetic field lines are then used to construct an open-flux weighted rotation rate, from which the influence on the wind-braking torque can be estimated. Results:During solar minima, the rotation rate of the corona decreases with respect to the typical solid-body rate (the Carrington rotation period is 25.4 days), as the sources of the solar wind are confined towards the slowly-rotating poles. With increasing activity, more solar wind emerges from the Sun's active latitudes which enforces a Carrington-like rotation. Coronal rotation often displays a north-south asymmetry driven by differences in active region emergence rates (and consequently latitudinal connectivity) in each hemisphere. Conclusions:The effect of differential rotation on the Sun's current wind-braking torque is limited. The solar wind-braking torque is \(\sim 10-15\%\) lower during solar minimum, (compared with the typical solid body rate), and a few percent larger during solar maximum (as some field lines connect to more rapidly rotating equatorial latitudes). For more rapidly-rotating Sun-like stars, differential rotation may play a more significant role, depending on the configuration of the large-scale magnetic field. ## 1 Introduction The rotation periods of Sun-like stars slow systematically throughout the main-sequence (Skumanich, 1972), which can in some cases be used to determine the age of a star, or a population of stars (a technique known as "Gyrochronology"; see Barnes, 2007). This is a consequence of magnetised stellar wind-braking, which enables the relatively feeble mass-loss rates of Sun-like stars to carry away significant amounts of angular momentum (Schatzman, 1962; Weber and Davis, 1967; Mestel, 1984; Kawaler, 1988). The wind-braking torque is often described as, \[\tau=\dot{M}\Omega_{*}\langle R_{A}\rangle^{2}, \tag{1}\] where \(\dot{M}\) is the mass-loss rate of the wind, \(\Omega_{*}\) is the rotation rate of the star, and \(\langle R_{A}\rangle\) is the effective Alfven radius of the wind, which essentially measures how far the magnetic field can exert a torque on the wind plasma before it becomes super-Alfvenic and effectively 'disconnected' from the star (see studies of Reville et al., 2015; Finley and Matt, 2018). The evolution of magnetism in Sun-like and low-mass stars, is largely constrained by systematic studies (e.g. See et al., 2019, and references therein) using the Zeeman broadening (see review of Reiners, 2012) and Zeeman-Doppler imaging (Semel, 1989; Donati et al., 2007) techniques. As is the evolution of their rotation periods, recovered from their long-term photometric variability (Curtis et al., 2019; Santos et al., 2021; Rampalli et al., 2021). There are also a growing number of measured mass-loss rates derived from astrospheric Lyman-alpha absorption (Wood et al., 2021), slingshot prominences (Jardine and Collier Cameron, 2019), and planetary transits (Vidotto and Bourrier, 2017). Though these observations are currently unable to fully-constrain the evolution of stellar mass-loss rates during the main sequence (O Fionnagain and Vidotto, 2018), and subsequently the effectiveness of stellar wind-braking (Brown, 2014; Matt et al., 2015; Gondoin, 2017; Garraffo et al., 2018; Breimann et al., 2021). Studying the Sun directly bypasses many observational issues, given that the solar wind angular momentum flux can be measured in-situ (Lazarus and Goldstein, 1971; Pizzo et al., 1983; Marsch and Richter, 1984; Finley et al., 2019). However the scale of the solar wind and the locality of the in-situ measurements often leads to issues of interpretation when computing a global wind-braking torque. In addition, all modern observations of the solar wind have been taken during a single epoch of its main sequence lifetime (see the review of Vidotto, 2021), whereas the typical wind-braking timescales for a star like the Sun is 10 - 100 Myrs. Using proxies for solar activity stored in natural archives, the longest reconstructions of solar activity are of the order of 10,000 years (Beer et al., 1998; Usoskin, 2017; Wu et al., 2018). From this, the likely variations of the wind-braking torque can be inferred (Finley et al., 2019), though this is still an order of magnitude away from being sensitive to the braking timescale of the Sun. It has also been suggested that the wind-braking of Sun-like stars begins to decrease significantly around the age of the Sun (van Saders et al., 2016; Metcalfe et al., 2016; Booth et al., 2017). Evidence for this has begun to grow thanks to new asteroseismic observations (Hall et al., 2021), and models of the wind-braking torque for stars crossing the so called transition (Metcalfe and Egeland, 2019; Metcalfe et al., 2022). Despite the difficulties in its interpretation, a reliable assessment of the Sun's wind-braking torque has the potential to provide insight on the Sun's evolution and that of other Sun-like stars. In order to achieve this, there is a need to reconcile the wind-braking torques calculated using magnetohydrodynamic (MHD) models (Reville and Brun, 2017; Finley et al., 2019), and those calculated from in-situ measurements (e.g. Finley et al., 2019), which to-date disagree by a factor of a few. This may relate to the 'open flux problem' (Linker et al., 2017; Riley et al., 2019), in which the interplanetary magnetic field modelled by extrapolation from the observed photospheric magnetic field is systematically weaker than observed in-situ. Models that reproduce the observed value of the open magnetic flux in the solar wind tend to have better agreement with measurements of the in-situ angular momentum flux at 1au. Yet the angular momentum flux of the solar wind in the near-Sun environment, measured by Parker Solar Probe, has been shown to vary significantly from all model predictions, with tangential flows as strong as \(\pm\)50 km/s (Kasper et al., 2019). Interestingly, when these large scale variations in the solar wind angular momentum flux are averaged over a solar rotation, they produce a wind-braking torque similar to that of the MHD models (as shown for the first two encounters of Parker Solar Probe by Finley et al., 2020). This suggests that the structure in the solar wind angular momentum flux develops in the low to middle corona (1 - 20 solar radii), either through the interaction of the magnetic field with rotation, or due to the interaction between neighbouring solar wind streams. An interaction-based mechanism for angular momentum redistribution appears to be supported by the prevalence of the fast solar wind carrying a negative (deflected) angular momentum flux, and the slow wind containing the more dominant net positive angular momentum flux (Finley et al., 2021; Verscharen et al., 2021), i.e. removing angular momentum from the Sun. However the travel time from the solar surface to Parker Solar Probe (during encounters) is seemingly too short for wind-stream interactions to fully develop, perhaps indicating that the development of structure in the near-Sun environment is linked to the rotational state of the corona. Coronal rotation is also integral to the use of ballistic back-mapping for tracking solar wind plasma back to its source (e.g. Macneil et al., 2022). This study makes a simplified assessment of the impact of differential rotation at the base of the solar wind on the resulting wind-braking torque. This is a first step towards future works examining the influence of more complex coronal rotation on the solar wind angular momentum flux. Section 2 sets out the data and methodology of the study, in which the Potential Field Source Surface (PFSS) model is used to rapidly realise the connectivity of the solar corona from a series of ADAPT-GONG magnetograms spanning one solar activity cycle (2007-2022). Section 3 presents the results of the inclusion of differential rotation in the calculation of the Sun's wind-braking torque. Finally, Section 4 puts our findings in context with current Heliospheric missions, and the winds of other Sun-like stars. ## 2 Data and methodology ### Rotation rate at the 'coronal base' The rotation of the solar surface is typically written in the form, \[\Omega_{\star}(\theta)=\Omega_{eq}+\alpha_{2}\cos^{2}\theta+\alpha_{4}\cos^{4 }\theta, \tag{2}\] where \(\Omega_{eq}\) is the equatorial rotation rate, and the values of \(\alpha_{2}\) and \(\alpha_{4}\) describe the north-south symmetric differential rotation profile. Typical values describing the Sun's surface rotation rate are given in Table 1, taken from Snodgrass (1983). Many studies have attempted to constrain the Sun's differential rotation profile (Newton and Nunn, 1951; Wilcox and Howard, 1970; Howard et al., 1984; Beck, 2000; Lamb, 2017; Beljan et al., 2017; Jha et al., 2021), however the profile from Snodgrass (1983) remains representative and is still frequently used in the literature. A schematic of this rotation rate profile versus latitude is shown in Figure 1. Solar-like differential rotation has the equatorial plasma (and \begin{table} \begin{tabular}{c|c c c|c} \hline \hline Profile & \(\Omega_{eq}\) & \(\alpha_{2}\) & \(\alpha_{4}\) & Source \\ & [nHz] & [nHz] & [nHz] & \\ \hline Surface & 472.6 & -73.9 & -52.1 & Snodgrass (1983) \\ Coronal Hole & 463.0 & -26.7 & -33.1 & Appendix A \\ \hline Carrington & 455.7 & - & - & — \\ \hline \end{tabular} \end{table} Table 1: Rotation Rate Parameters. Figure 1: Rotation rate versus heliographic latitude. A typical solar differential rotation pattern is plotted with a solid black line. The rotation rate at \(\theta\approx 26.5^{\circ}\), otherwise referred to as the Carrington rotation rate (of 25.4 days or \(\sim 456\) Hz), is indicated with a blue dashed horizontal line. A less-extreme differential rotation pattern, taken from fitting the apparent motion of coronal holes in AIA-193A synoptic images (see Appendix A), is plotted with a red dotted line. At the top and bottom of the figure, the latitudinal distribution of the source regions of the open magnetic field during the maximum activity and minimum activity periods of solar cycle 24, respectively, are indicated (further explored in Figure 4). During periods of low activity, the sources of the open magnetic field are confined to the slowly rotating poles. In periods of higher activity, the open field emerges more frequently from low-latitude features. During solar cycle 24, a north-south asymmetry is also observed during solar maximum. features embedded there) rotating faster than the polar regions. The equator rotates once around every 24.5 days, whereas the poles rotate once around every 33.4 days. Some strong magnetic features, however, appear to rotate around every 25.4 days (otherwise referred to as the Carrington rotation period). Whether this relates to the anchoring of magnetic field in the interior (Gilman, 1983; Miesch et al., 2008; Brun et al., 2004; Nelson et al., 2013; Dikpati et al., 2021; Kapyla, 2022; Brun et al., 2022), or the role of the near surface shear layer in sculpting the toroidal flux before emergence (as discussed in Brandenburg, 2005), is unclear. Generally, magnetic features at the top of the convection zone are still subject to differential rotation, but this can be less that would be expected from the observed rate at the photosphere (see Gigolashvili et al., 2013), and depends on their field strength and surface area (Imada and Fujiyama, 2018). For some strong active regions, their observed shearing can be entirely independent of the global differential rotation pattern (Yan et al., 2018). Another diagnostic of rotation is the evolution of coronal holes in extreme ultraviolet (EUV) imagery, which appear dark as they are losing energy/mass directly to the (fast) solar wind. Previous authors have derived rotation rates from coronal holes in EUV (see Heinemann et al., 2018, for a study combining remote-sensing and in-situ observations). Again, these regions often appear to be less influenced by the surface differential rotation (Timothy et al., 1975; Insley et al., 1995), with some evidence for nearly rigid rotation in the low corona (Hiremath and Hegde, 2013). Authors performing statistical studies of coronal hole rotation generally find a reduced amplitude of differential rotation (Bagashvili et al., 2017; Oghrapishvili et al., 2018). However it is unclear how these techniques are influenced by the latitudinal distribution of coronal holes, their appearance, evolution, and decay timescales, coupled with our limited ability to track them. In Appendix A, a retrieval of the rotation profile from the apparent deformation of trans-equatorial coronal holes is shown through the comparison of multiple synoptic AIA-193A charts. By maximising the coronal hole overlap from chart to chart, a reduced amplitude of differential rotation is recovered in each case. The average fit values are given in Table 1, and are comparable to those found in Bagashvili et al. (2017) and Oghrapishvili et al. (2018). As the solar wind is accelerated over a large range of heights in the solar atmosphere, it is unclear what rotation rate should apply to the base of the wind (otherwise referred to as the coronal base). Therefore in Section 3, the assessment of the impact of differential rotation on calculations of the wind-torque is performed using both the surface and coronal hole motivated differential rotation profiles. ### Magnetic field extrapolation The use of PFSS models to infer the source locations of the solar wind (otherwise referred to as 'connectivity') has become wide-spread due to the efficiency and simplicity of the model (Altschuler and Newkirk, 1969; Schrijver and DeRosa, 2003). Despite only taking information from the radial magnetic field at the surface, and having a single free parameter (the source surface radius, \(R_{ss}\)), this model has been shown to work well (Badman et al., 2020; Panasceneo et al., 2020), typically in advance of computing the more resource-intensive MHD models (see comparison in Riley et al., 2006). For this study, our aim is to quantify the long-term variation in the field line mapping to different latitudes throughout the solar cycle. In this case, PFSS modelling represents a useful and reliable method to achieve this (see similar work by Stansby et al., 2021). The PFSS magnetic field is constructed based on the following equations, \[B_{r}(r,\theta,\phi)=\sum_{l=1}^{\infty}\sum_{m=-l}^{l}\alpha_{lm}(r)Y_{lm}( \theta,\phi), \tag{3}\] \[B_{\theta}(r,\theta,\phi)=\sum_{l=1}^{\infty}\sum_{m=-l}^{l}\beta_{lm}(r)Z_{lm }(\theta,\phi), \tag{4}\] \[B_{\phi}(r,\theta,\phi)=\sum_{l=1}^{\infty}\sum_{m=-l}^{l}\beta_{lm}(r)X_{lm}( \theta,\phi), \tag{5}\] where \(r\) denotes radial distance from the origin, \(\theta\) the latitude from the rotation pole, \(\phi\) the Carrington longitude, and the typical \(l\)-degree and \(m\)-order spherical harmonic functions, using the legendre polynomial functions \(P_{lm}(\cos\theta)\), are, \[Y_{lm} = c_{lm}P_{lm}(\cos\theta)e^{im\phi}, \tag{6}\] \[Z_{lm} = \frac{c_{lm}}{l+1}\frac{dP_{lm}(\cos\theta)}{d\theta}e^{im\phi},\] (7) \[X_{lm} = \frac{c_{lm}}{l+1}P_{lm}(\cos\theta)\frac{im}{\sin\theta}e^{im\phi}, \tag{8}\] with the normalisation of, \[c_{lm}=\sqrt{\frac{2l+1}{4\pi}\frac{(l-m)!}{(l+m)!}}. \tag{9}\] In the PFSS model, the coefficients \(\alpha_{lm}\) and \(\beta_{lm}\) are given by, \[\alpha_{lm}(r)=\epsilon_{lm}\frac{l(R_{\ast}/R_{ss})^{2l+1}(r/R_{\ast})^{-1}+ (l+1)(r/R_{\ast})^{-(l+2)}}{l(R_{\ast}/R_{ss})^{2l+1}+(l+1)}, \tag{10}\] \[\beta_{lm}(r)=(l+1)\epsilon_{lm}\frac{(R_{\ast}/R_{ss})^{2l+1}(r/R_{\ast})^{-1 }+(r/R_{\ast})^{-(l+2)}}{l(R_{\ast}/R_{ss})^{2l+1}+(l+1)}, \tag{11}\] where \(\epsilon_{lm}\) represent the strength of each spherical harmonic mode. The \(\epsilon_{lm}\) coefficients are extracted from the input magnetogram of the photospheric magnetic field by evaluating1, Footnote 1: To compute these coefficients the pySHTOOLS python package is used, which provides access to the Fortran-95 SHTOOLS library. \[\epsilon_{lm}=\frac{1}{c_{lm}}\int_{\phi}\int_{0}B_{r}(\theta,\phi)P_{lm}(\cos \theta)\sin\theta d\theta d\phi. \tag{12}\] In this study, the PFSS model is driven by spherical harmonic decomposition of the ADAPT-GONG magnetograms2(Arge et al., 2010). These magnetograms are produced using a combination of data assimilation and forward modelling, which accounts for the effects of differential rotation, meridional circulation, and diffusion on older observations (further discussed in Hickmann et al., 2015). In general, the Sun's polar magnetic fields are difficult to capture due to their proximity to the limb and weak line-of-sight strength. The ADAPT-GONG magnetograms leverage the underlying flux transport model to reproduce the time evolution of the polar fields based on data assimilated at lower latitudes. This has been shown to remain consistent with direct observations of the polar field (Arge et al., 2011), and so reduces the potential variation in the reconstructed coronal magnetic field structure caused by the varying visibility of the Sun's poles. Magnetograms are taken at a monthly cadence from Jan 2007 to Feb 2022 (\(\sim 200\) Carrington Rotations), always using the first realisation of the magnetogram. To reduce computational cost, the magnetic field is reconstructed up to a spherical harmonic degree of \(l_{max}\approx 30\) using \(R_{ss}=2.5R_{\odot}\) on an equally-spaced grid of \(r\times\theta\times\phi\) resolution of \(12\times 92\times 184\) points. This set-up is found to reliably recovers structures based on the resolution of the ADAPT-GONG magnetogram inputs. ### Effective rotation rate In ideal MHD models of solar/stellar wind, the footpoints of the magnetic field should remain anchored to the surface (or inner boundary condition). This requires, for a perfectly conducting rigidly rotating boundary with a frozen-in magnetic field, that the electric field at the surface in the rotating frame be zero. In the case of a steady state solution, i.e. axisymmetric or rigid rotation, this condition produces a scalar quantity which is constant along magnetic field lines, the effective rotation rate (Mestel, 1968; Sakurai, 1985). This quantity in CGS units is, \[\Omega_{eff}=\frac{1}{r\sin\theta}\bigg{(}v_{\phi}-\frac{BB_{\phi}}{4\pi\rho v }\bigg{)}, \tag{13}\] where \(r\) is the radius, \(\theta\) is the latitude from the rotation pole, \(v\) is the fluid velocity, \(B\) is the magnetic field vector, \(\rho\) is the fluid density, and quantities with subscript \(\phi\) are taken in the azimuthal direction. This quantity is typically set at the lower boundary to enforce a given surface rotation rate \(\Omega_{eff}=\Omega_{*}\)(e.g. Zanni & Ferreira, 2009). In the recent work of Ireland et al. (2022), the value of \(\Omega_{eff}\) was allowed to vary in latitude in order to model the influence of differential rotation on the wind-braking torques from their 2.5D stellar wind models (see also Pinto et al., 2021). This has the effect of anchoring the field lines at different latitudes to different rotation rates. As this model is axisymmetric, the effective rotation rate remained constant along magnetic field lines (the conservation of this quantity is also used to validate the performance of the numerical methods). The authors tested varying degrees of solar-like differential rotation, whilst also altering the stellar magnetic field strength. The resulting wind-braking torques were shown to be well-behaved, and described by a correction factor that accounted for the implicit change in the rotation rate (\(\Omega_{wind}\)) of the simulation in comparison to solid-body \(\Omega_{*}\). As the stellar magnetic field in this case was dipolar, it was shown that the rotation rate of the wind scaled with the latitude of the last open magnetic field line. In the case of a 3D non-axisymmetric magnetic field with differential rotation, shearing in the corona creates a time-dependant solution which is sensitive to the degree of non-axisymmetry in the magnetic field, and the contrast in rotation rate between the footpoints of closed coronal loops. A steady-state solution is unlikely to be reached in this case. Irrespective of this, the rotation rate of the open magnetic field will likely still be strongly influenced by the anchoring speed of the footpoints. Given the relatively slow rotation of the Sun, in this study these interactions are assumed to be weak, such that the effective rotation rate is conserved along each field line. This allows for the effective rotation rate to be propagated into the corona. In addition to the significance of the field line footpoint rotation, field lines closer to the equator will carry a larger angular momentum-flux (e.g. Keppens & Goedbloed, 1999), due to the geometrical lever arm from the rotation axis. Thus the rotation rate of field lines nearer the equator will have a stronger influence on the mean rotation rate that is needed to describe the wind-braking torque with equation (1). The mean rotation rate of the wind, is therefore calculated via an open-flux weighted average in the magnetically-open corona including a \(\sin\theta\) dependence, \[\langle\Omega_{wind}\rangle=\frac{\oint_{\Omega}\Omega(r,\theta)\sin\theta| \mathbf{B}\cdot d\mathbf{A}|}{\oint_{\Omega}\sin\theta|\mathbf{B}\cdot d\mathbf{A}|}, \tag{14}\] where \(\Omega(r,\theta)=\Omega_{*}(R_{*},\theta_{*})\) is the value of the surface differential rotation rate mapped along the magnetic field from \((R_{*},\theta_{*})\) to \((r,\theta)\), and the closed integral over the area \(A\) of the magnetic field vector \(\mathbf{B}\) returns the unsigned magnetic flux in the wind. The radius \(r\) should therefore be larger than the last closed magnetic field loop. The dependence of the angular momentum flux on latitude from the rotation axis is further discussed in Finley et al. (2019). A schematic depiction of this calculation is shown in Figure 2. The technique described here could also be used to correct the wind-braking torques from MHD wind simulations performed Figure 2: Schematic depiction of the methodology used in this study. The surface rotation rate is extrapolated into the corona via a PFSS model driven by ADAPT-GONG magnetograms. In three dimensions this produces a longitude-latitude grid of rotation rates at the height of the source surface (\(R_{xx}=2.5R_{\odot}\)), the height at which the coronal magnetic field opens into the solar wind. The open flux weighted rotation rate is then calculated from the longitude-latitude grid of rotation rates, however the angular momentum flux in the solar wind is expected to vary with distance from the rotation axis. Therefore a factor of \(\sin\theta\) is introduced into open flux weighted averaging process, giving additional weight to the solar wind close to the equator (represented by the magnitude of the black arrows). Figure 3: Summary of five models from different phases of solar cycle 24. The first column shows 3D renderings of the PFSS models, with open magnetic field lines coloured by surface rotation rate (see Figure 1). Closed magnetic field lines are shown in grey. The solar surface is coloured with red and blue representing the radial magnetic field used in each PFSS model, and the location of the Heliospheric Current Sheet (HCS) is indicated in black at the source surface. The center column displays the same information projected on a latitude-longitude grid. The final column shows the effective rotation rate of field lines at the source surface (\(R_{ss}=2.5R_{\odot}\)). These values are acquired by tracing field lines down to the surface, and returning the value of the surface rotation rate (this is the same as for the colour on the field line renderings). The mean value of the effective rotation rate (\(\Omega_{wind}\)) is listed with each model (the Carrington rate is \(\sim 456\) nHz). with solid-body rotation. The form of \(\langle\Omega_{wind}\rangle\) is motivated by insights from the scaling of the wind-braking torque in Ireland et al. (2022). It is left for future work to truly validate this relation. In addition, throughout this work, the effective rotation rate of the magnetic field lines and that of the solar wind are assumed to be interchangeable, however this is an oversimplification of equation (13). The development of stress in the magnetic field can also modify the rotation rate of the wind. This does not affect the calculation of \(\langle\Omega_{wind}\rangle\), but caution should be used in the interpretation of the extrapolated coronal rotation rates. To self-consistently model coronal rotation, time-dependent simulations which are continuously driven, such as magnetorfictional models (e.g. Yeates, 2013; Hoeksema et al., 2020), may be better suited (though more computationally expensive). ## 3 Results ### Global connectivity and rotation rate Figure 3 displays PFSSS models for five different ADAPT-GONG magnetograms (2009-06-01, 2010-10-01, 2014-01-01, 2017-10-01, and 2020-01-01), each representing a different phase of solar cycle 24. 3D renderings are shown in the first column with magnetic field lines coloured by the surface rotation rate, following equation (2). Closed field line are coloured grey. This information is re-projected onto a latitude-longitude grid in the center column. The final column shows a latitude-longitude map of the effective rotation rate at \(2.5R_{\odot}\) created by tracing field lines down from an equally-spaced grid of \(48\times 96\) points at the source surface (\(r=R_{ss}\)) to sample the corresponding surface rotation rate Figure 4: Histogram of the source latitudes of magnetic field lines traced down from the source surface for each magnetogram in our time-series. The top panel indicates, for each model, the percentage of field lines that connect to a given latitude (bin width \(\sim 2^{\circ}\)) from a homogeneous sampling of the source surface. The bottom panel blends this information with that of the rotation rate at those latitudes, i.e. the more vivid the colours the larger the fraction of field lines connecting to that latitude (as in the panel above). Arrows indicate the major pole-ward surges of magnetic flux during solar cycle 24. The snapshots show in Figure 3 are identified with green vertical dot-dashed lines in both panels. The mean latitude of connectivity (including a factor of \(\sin\theta\) to match \(\langle\Omega_{wind}\rangle\)) is shown with red solid lines. The same calculation is repeated for the northern and southern hemispheres individually, plotted in black dashed and dotted lines respectively; highlighting the degree of asymmetry. (see Figure 2). From this map, equation (14) is evaluated and the value of \(\langle\Omega_{wind}\rangle\) is noted with each model. This calculation is repeated for each magnetogram in our sample. Figure 3 shows some clear trends during the solar cycle. At minima of solar activity (top and bottom rows), the open magnetic field emerges primarily from the slowly rotating polar coronal holes. There are some additional contributions of open magnetic field from small active regions or equator-ward coronal holes which create pockets of fast rotation near to the Heliospheric Current Sheet (HCS). In more active phases (middle rows), the HCS becomes increasingly warped by underlying active regions, and equatorial coronal holes. These low-latitude sources of the solar wind increases the proportion of fast rotation in the corona. At solar maximum, the dipole axis is completely tilted, closing off most of the field at the poles, leading to faster rotation throughout the entire corona. There are subtle differences between the rising and decay phases of the cycle, with surges of magnetic flux towards the poles during the decay phase leading to more extended polar coronal holes in latitude and accordingly coronal rotation rates that are slightly elevated with respect to the rising phase. Throughout the cycle, the degree of warping of the HCS appears an indirect indicator of the rotational state of the corona, with deviation from a perfectly flat HCS in the equator most-likely due to source regions at low-latitude, anchored at more rapidly rotating latitudes. The variation of solar wind source regions during solar cycle 24 is shown more clearly in Figure 4. Histograms of the open magnetic field footpoint latitudes are shown for each model in our time-series of \(\sim 200\) magnetograms. Open field lines are traced down from the source surface with seeds distributed homogeneously over all latitudes and longitudes. Values in the top panel are given as a percentage of field lines from the total seeds that connected to a given latitude bin (width \(\sim 2^{\circ}\)), irrespective of longitude. During solar minimum, the open magnetic field is mostly confined to the rotational poles, which is in contrast to solar maximum where the majority of the open magnetic field emerges from lower-latitudes. The bottom panel of Figure 4 is similar, but with result coloured by the surface rotation rate. The presence of multiple pole-ward rushes in magnetic flux is identifiable in the field line connectivity (highlighted with dashed arrows). The value of \(\langle\Omega_{wind}\rangle\) calculated from equation (14) using the surface rotation rate and the coronal hole rotation rate is shown in Figure 5 versus time, along with the sunspot number. During solar minimum, \(\langle\Omega_{wind}\rangle\) is smaller than the Carrington rate, however does not reach the polar rotation rate due to the volume-filling patches of low-latitude connectivity. These regions are close to the equator and are therefore more heavily-weighted by the additional \(\sin\theta\) dependence in equation (14). With increasing solar activity, the value of \(\langle\Omega_{wind}\rangle\) increases to be close to, but slightly larger than, the Carrington rotation rate, as more open magnetic field is emerging from the active latitudes. Naturally, this leads to a correlation between \(\langle\Omega_{wind}\rangle\) and the amount of open magnetic flux in the wind. As typically an increase in open magnetic flux results from increased flux emergence around the active latitude (which are evidently rotating faster than the poles). The open magnetic flux is also increased by lowering the source surface height. The results presented so far use a fixed value of the source surface radius (\(R_{ss}=2.5R_{\odot}\)), however this value is likely to vary during the solar cycle (Arden et al., 2014; Pinto et al., 2011; Perri et al., 2018; Hazra et al., 2021). Our analysis is repeated in Appendix B with source surface radii of 2 \(R_{\odot}\) and 3 \(R_{\odot}\), to investigate the dependence of \(\langle\Omega_{wind}\rangle\) on the source surface height (see Figure B). As expected, the smaller the source surface the more higher-order magnetic field is opened which increases the open magnetic flux. Once again, this shifts connectivity towards smaller active regions. During solar minimum, this means a smaller source surface can more easily connect to the faster equator-ward latitudes (increasing \(\langle\Omega_{wind}\rangle\) by around 20 nHz), with the opposite effect for larger source surfaces (decreasing by 10 nHz). This is further detailed in Appendix B. ### Solar wind angular momentum-loss rate MHD models have been used to explore the dependence of the wind-braking torque on various configurations of the coronal magnetic field, under different coronal heating scenarios, and rotation rates (Matt et al., 2012; Reville et al., 2015; Pantolmos and Matt, 2017; Finley and Matt, 2018; Hazra et al., 2021; Ireland et al., 2022). In the slowly rotating regime, where centrifugal ef Figure 5: Effective rotation rate versus solar cycle, calculated with equation (14). Solid black line represents the ADAPT-GONG magnetograms using \(R_{ss}=2.5R_{\odot}\), and the observed surface rotation rate. Dashed lines indicate the equatorial, polar and Carrington rotation rate. The solid grey line instead uses the less-extreme coronal hole rotation profile (see Appendix A). PFSS models shown in Figure 3 are highlighted with black circles. The daily, monthly, and monthly-smoothed sunspot number from the Sunspot Index and Long-term Solar Observations (SILSO) are displayed in the background of the figure with a solid green lines of varying opacity. Figure 6: Same as Figure 5, but now showing the expected change in wind-braking torque between solid body (SB) and differentially rotating (DR) models on the vertical axis. fects on the wind acceleration are negligible, the mass-loss rate and Alfven radius are unaffected by the inclusion of differential rotation. This results in a linear dependence between the wind-braking torque and the effective rotation rate, as in equation (1). Provided that equation (14) is a reasonable approximation for the rotation rate of the wind, changes to the wind-braking torque \(\tau_{DR}\) are then given by, \[\tau_{DR}=\frac{\langle\Omega_{wind}\rangle}{\Omega_{*}}\tau_{SB}, \tag{15}\] where \(\tau_{SB}\) is the wind-braking torque calculated using the solid-body rotation value \(\Omega_{*}\) (which is taken to be the Carrington rotation rate). For the Sun, \(\tau_{SB}\) has been calculated by many authors using a variety of models and semi-analytic relations. In general, the wind-braking torque is largest during periods of increased solar activity as the amount of open magnetic flux in the solar wind is increased. Here, the semi-analytic relation for the solar wind-braking torque from Finley et al. (2019) is adopted. This relation is derived from a parameter study of 2.5D MHD simulations in Finley & Matt (2017, 2018). The wind-braking torque is given by, \[\tau_{SB}=(2.3\times 10^{30}[\rm erg])\bigg{(}\frac{\dot{M}}{1. 1\times 10^{12}[\rm g/s]}\bigg{)}^{0.26}\] \[\times\bigg{(}\frac{\phi_{open}}{8.0\times 10^{22}[\rm Mx]} \bigg{)}^{1.48}, \tag{16}\] where \(\dot{M}\) is the solar mass-loss rate, and \(\phi_{open}\) is the open magnetic flux in the solar wind. Both of these variables are estimated from in-situ measurements of the solar wind from the _Wind_ spacecraft, as done in Finley et al. (2019). In-situ measurements from the equatorial solar wind are averaged on the timescale of a Carrington rotation (\(\sim 27\) days as viewed from Earth), in order to remove longitudinal structures. Latitudinal variations in the mean mass flux and magnetic flux are assumed to be small at 1au, such that the averaged equatorial values can be used to create global estimates of \(\dot{M}\), and \(\phi_{open}\). From these values, the solar wind-braking torque computed with equation (16) is plotted in Figure 6. Applying the value of \(\langle\Omega_{wind}\rangle/\Omega_{*}\) to the solar wind-braking torque, produces the corrected torque \(\tau_{DR}\) for the surface and coronal hole profiles (plotted in Figure 6 with red and blue lines respectively). The percentage change in the wind-braking torque (\(\tau_{DR}/\tau_{SB}\times 100\%\)) during the solar cycle varies from 10-15% during solar minima, to a few percent at solar maximum (see inset of Figure 6). In times of increased solar activity, the equatorial solar wind can emerge from sources closer to the equator than \(\theta\approx\pm 26.5^{\circ}\) (e.g. the Carrington rate latitude). This results in a more rapidly rotating corona than the typical solid body value, and hence a slightly larger wind-braking torque. However, as previously discussed, equatorial coronal holes visible in EUV imagery do not always show this rapid rotation, and so in reality, the equatorial rotation rate may be closer to that of the coronal hole motivated profile. Using this rotation profile instead of the typical differential rotation profile reduces the effect at solar minima (to around 5%) and results in a negligible change during solar maximum. In either case, the effect of differential rotation tends to reinforce the pre-existing variation of the Sun's angular momentum-loss rate during the solar cycle. With the strongest influence of differential rotation occurring when the solar wind-braking torque is smallest, the overall impact on the long-term angular momentum-loss rate is minimised. The weak dependence of the wind-braking torque on the Sun's differential rotation profile is easily explained by considering the extreme values that \(\langle\Omega_{wind}\rangle\) could take. These being the polar and equatorial rotation rates, i.e. all the wind rotates either at the slowest or fastest possible rotation rate. In this case, taking the solid-body rotation rate to be that of the poles, around 33.4 days, will produce a solar wind-braking torque that is \(\sim 24\%\) smaller than using the Carrington rotation rate. Similarly, by using the equatorial rotation rate of 24.5 days the wind Figure 7: Azimuthally-averaged rotation rates from the PFSS models shown in Figure 3. Averaging is performed on the open field regions, grey regions indicate closed field at all longitudes (hence no value returned). The limited number of open magnetic field lines over the north pole during the ‘Activity Maximum’ model, lead to some oddity in the north-most latitude bin that should be disregarded. The lower panels show the latitudinal profiles coloured by radial distance from the surface (yellow being the furthest). The rising and declining phases show a clear north-south asymmetry which is also observed in the systematic differences in \(\langle\theta\rangle\) between the two hemispheres in Figure 4. braking torque increases by 4%. Given the small variation in wind-braking torques between these maximum and minimum values of the effective rotation rate, the use of solid-body rotation in steady-state MHD models of the solar wind appears to be justified to first order. ## 4 Discussion ### Asymmetric Rotation of the Corona The mean latitude of connectivity during the solar cycle (weighted by a factor of \(\sin\theta\) to be consistent with the definition of \(\langle\Omega_{wind}\rangle\)) is plotted in Figure 4 with symmetric solid red lines in each hemisphere. Performing this calculation independently for the northern and southern hemispheres produces the black dashed and dotted lines respectively. Deviation from the symmetric solid red lines indicates asymmetry between the two hemispheres. As solar cycle 24 progresses, active regions appear in the north and south following the typical butterfly-pattern (e.g. Hathaway 2015). At first, active latitudes in the north are more frequently sources of the solar wind than in the south, which pulls the mean latitude closer to the equator in the north than in the south. This leads to an asymmetric increase of coronal rotation in the northern hemisphere. After a pole-ward surge in the northern hemisphere (starting in 2013), the connectivity begins to favour the southern active latitudes. This briefly reverses the asymmetry in the coronal rotation, producing a faster southern hemisphere. A pole-ward surge in the southern hemisphere (starting in 2014) then reverses the situation, leaving the northern active latitudes more frequent connected to the solar wind and driving-up the mean rotation rate in the northern hemisphere. Balance is restored at the end of the declining phase of activity with a final pole-ward surge in the northern hemisphere (starting in 2016) returning the source-latitude distribution to a near-dipolar configuration. This sequence shows that changes in the distribution of northern and southern active regions can drive asymmetry in the resulting coronal rotation rate. Examining more closely the PFSS models shown in Figure 3, the azimuthally averaged rotation rate of the open magnetic field is plotted in Figure 7 along with 1D cuts of rotation at various radial distances (yellow being the source surface, and darker colours moving down towards the solar surface). Grey regions indicate completely closed latitudes, i.e when field lines are traced from all longitudes at this latitude, they are all closed therefore there is no value to return. The snapshots from activity minima show rotation profiles that are roughly north-south symmetric, with the exception of the location of the closed field in grey. These cases are dominated by the slowly rotating polar sources, with some faster equatorial connectivity associated with small active regions (visible in Figure 3). The models of rising (2nd panel) and declining (4th panel) activity both have a clear north-south asymmetry in rotation, with the corona rotating systematically slower in the southern hemisphere. As discussed, this is due to the imbalance of source regions between the two hemispheres. This is clear from Figure 4, where the histogram shows a higher density of source regions in the low-latitude north than the south during these snapshots. This imbalance persists throughout most of the active phase of Cycle 24, except for during activity maximum in 2014 (in-between the pole-ward surges). Here the situation is reversed with more sources in the low-latitude south, leading to faster coronal rotation in the south. During this time, the dipole component of the Sun's magnetic field is weak or highly inclined, and so in Figure 7 the closed regions (in grey) appear over the poles. ### Apparent rotation from coronal streamers Given the wealth of coronal observations in scattered white light, recent works have begun to reconstruct the rotation of the corona based on the apparent motion of streamer structures. Most recently, Edwards et al. (2022), following the methodology of Morgan (2011), who measured the rotation rate of long-lived streamer structures in LASCO C2 white light images from 2008 - 2020. While there are many local deviations in the measured rotation rate from the surface rate, which may be of interest in the discussion of angular momentum transport in the low-corona. The mean coronal rotation rate from this method often deviates systematically from the surface rotation rate, with a flatter rotation profile that is closer to the Carrington rate (similar to that motivated in Appendix A, see Figure 1). However, these measurements come with challenges in interpretation, as streamers do not form at all latitudes during the solar cycle (discussed in Morgan 2011). At solar minimum streamers are confined to the equator, whereas during solar maximum streamers can be found at all latitudes (with challenges in accurately reconstructing their motion over the rotational poles). From the PFSS modelling performed in this study, the potential bias of using white light streamers to measure the overall rotation of the corona is assessed based on the available streamer latitudes during the cycle and the evolving rotation rate versus latitude of the corona. Figure 8 displays the azimuthally-averaged rotation rate at the source surface throughout the time-series of magnetograms (panel a), along with the averaged scattered white light emission at three solar radii observed by LASCO C2 onboard the Solar and Heliospheric Observatory (panel b). The latitudinal variation of the mean coronal rotation and the streamer structures have an almost identical morphology. This is not unexpected as both quantities are driven by the underlying reconfiguration of the Sun's magnetic field. At solar minima, coronal rotation is dominated by the slowly rotating flows from the polar coronal holes and the streamers confined to the equator following the dipolar configuration of the large-scale magnetic field. With increasing activity the Sun's large-scale magnetic field becomes more complex, and so the sources of the solar wind move to the active latitudes and consequently faster rotating areas. The evolution of the Sun's large-scale magnetic field then allows for streamer structures that traverse a much broader range of latitudes. The presence of white light streamers is essential for inferring coronal rotation at a given latitude and time in the cycle. From Figure 8 it is clear that streamers typically appear at latitudes with faster rotation rates. It might then be expected that the rotation profiles derived from white light streamers should systematically differ from the surface rotation profile. In our model, the rotation rate of coronal streamers is directly linked with the rotation rates at the source of the streamer structure. In which case, given that streamer structures are often anchored to the active latitudes, white light observations are more likely to produce a mean rotation rate that is flattened towards the Carrington rotation rate. This may explain some of the findings from these previous works (i.e. Morgan 2011; Edwards et al. 2022). ## References * [1] A. A. ### Equatorial connectivity and rotation rate With the exception of the _Ulysses_ spacecraft (an overview of observations is presented in McComas et al. 2008), contemporary in-situ measurements of the solar wind are limited to the ecliptic plane of the solar system (this will change in future as ESA/NASA's Solar Orbiter mission begins higher inclination orbits in 2025). When trying to connect the theoretical results presented here to in-situ measurements, it is important to consider the sources of equatorial solar wind and their associated rotation rates. Figure 9 displays a similar analysis to that of Figure 4, but now with only field lines from \(\pm 15\) degrees of the equator at the source surface being traced down to their sources. The histogram is coloured by the rotation rate at the surface, assuming the rotation profile from Snodgrass (1983). Low-latitude sources of the solar wind are present throughout the entire solar cycle. In-situ measurements may then be expected to find slightly larger tangential speeds (no more than a few km/s). The tangential speeds measured in-situ depend strongly on the magnetic stresses that support the rotation of coronal plasma out to larger distances than the source surface (the tangential speed is equivalent to the rotation rate multiplied by the radial distance). In this regard, most of these low-latitude sources will have strong magnetic fields, and so these features could play a more significant role than indicated by the PFSS modelling in this study, enforcing their rotation higher up in the solar corona. In which case, the tangential speed of the solar wind may be more strongly influenced (rigid-rotation up to \(1.5R_{\odot}\) results in a \(\sim 7\%\) increase in the Sun's wind-braking torque). Measurements of the middle-corona are needed in order to evaluate impact of strong active regions on coronal rotation (investigations into this area have become more frequent West et al. 2022; Chitta et al. 2022). Large tangential solar wind speeds are frequently measured by Parker Solar Probe in the near-Sun environment (up to 50km/s Kasper et al. 2019), which indicates that angular momentum transport in the corona is more complicated than MHD models predicts (the expectation is nearer to 5-10km/s; Reville et al. 2020). Finley et al. (2020) found that these tangential flows could be made consistent with the expected angular momentum-loss rate of the Sun if averaged together with regions of slow and retrograde rotation, also detected in the equatorial solar wind by Parker Solar Probe. The model presented here does not allow for absolute retrograde rotation in the corona, given that the surface rotation profile is always prograde. Stream interactions between fast and slow solar wind sources are frequently employed to explain the existence of strong positive and negative tangential flow deflections in the solar wind at 1au (Yermolaev et al. 2018). However, with Parker Solar Probe observing these flows so close to the Sun, it seems unlikely that wind-interactions will have had enough time to develop. To explain this, a strong contrast in the effective rotation rate between fast and slow solar wind streams (anchored at different latitudes) may be required to increase the frequency of collisions during the wind acceleration process. ### Potential impacts for other Sun-like stars In this study, the Sun's current differential rotation has been shown to have little influence on its wind-braking torque when averaged over a solar cycle. This results from the configuration of the Sun's magnetic field and its relatively weak differential rotation profile. During the lifetime of the Sun, however, differential rotation could have had a larger impact, depending on its initial rotation rate and subsequent degree of differential rotation thereafter. In both observations and numerical simulation, the amplitude of differential rotation \(\Delta\Omega_{*}\) scales roughly with rotation rate \(\Omega_{*}\) to a power \(n\) (e.g. Barnes et al. 2005). Taking \(n=0.46\) (from the global MHD simulations of Brun et al. 2022), and assuming a self-similar solar differential rotation profile, for a young rapidly rotating Sun-like star with \(\Omega_{*}/\Omega_{\odot}=5\ \Omega_{*}=2278\ \rm nHz\)), the differential rotation contrast would be \(5^{0.46}=2.1\) times stronger than that of the current Sun (\(\Delta\Omega_{*}\approx 265nHz\)). With a similar variation in wind source latitudes as the Sun, the value of \(\langle\Omega_{wind}\rangle\) would vary from \(\sim 1842\ \rm nHz\) to \(\sim 2326\ \rm nHz\), meaning the wind-braking torque could decrease from the solid body value by 20% during a solar minimum-like field configuration or increase by 2% during a solar maximum-like configuration. The scaling of stellar magnetic field strengths, and their large-scale magnetic field components continues to be constrained by Zeeman-Doppler imaging (Vidotto et al. 2014; See et al. 2019). Given that very young Sun-like stars tend to possess stronger, and more dipolar field configurations, \(\langle\Omega_{wind}\rangle\) may be systematically lower than \(\Omega_{*}\) during the early main sequence. This can be further investigated by examining the differential rotation self-consistently produced in 3D MHD simulations of stellar interiors (e.g. Brun et al. 2022). More precision than this requires additional information on the heating and structuring of the stellar coronae, which is needed to determine the latitudinal distribution of the stellar wind sources, and thus the true impact of surface differential rotation. For other low-mass stars (0.2 to 1.3 solar masses), it is possible that the source latitudes of their stellar winds could produce effective rotation rates that differ significantly from the rotation period of the star recovered from their spot-modulated light curves. Asteroseismic inversions from Benomar et al. (2018) recover latitudinal differential rotation profiles for Sun-like stars which are much stronger than the solar case. The mean amplitude of the differential rotation in their sample is six times stronger than that of the current Sun, which means that variation of the stellar wind source latitudes would have a much more pronounced effect on the wind-braking torque. Interestingly, the strength of differential rotation has been observed to vary with spectral type (Reiners 2006), and in some cases shown to be significantly enhanced in F-type stars (Marsden et al. 2006). This may lead to a systematic divergence between physics-based rotation-evolution models and the observed rotation period distributions. In old, slowly rotating main sequence stars, differential rotation may have an interesting effect during the (as of yet undetected) transition to anti-solar differential rotation (the search for anti-solar rotators is detailed in Noraz et al. 2022). As the stellar magnetic field weakens and potentially loses its cyclic nature (Brun et al. 2022; Noraz et al. 2022; Kapyla 2022), the footpoints of the resulting axisymmetric dipole would be confined to the more rapidly rotating poles, resisting the decrease in wind-braking torque with age. This would challenge the current hypothesis of weakened magnetic braking (van Saders et al. 2016), with angular momentum being more efficiently lost due to the favourable configuration of the stellar magnetic field and differential rotation pattern. It seems more likely that something prevents Sun-like stars from entering this configuration, or that a decreasing mass-loss rate could counteract this effect, producing the expected weakening of the wind-braking torque (discussed in Metcalfe et al. 2022). The recent study of Tokuno et al. (2022) investigates the influence of differential rotation on the rotation-evolution of Sun-like stars. Their model allows for the amplitude of the differential rotation at the stellar surface to evolve in time, as a function of the Rossby number (rotation period normalised by the convective turnover timescale). The effective rotation rate used in the wind-braking torque of Matt et al. (2015) is then taken from a low-latitude region, with the authors finding a weakening of the wind-braking torque at late-ages as this rotation rate is smaller than the underlying solid-body value. This study shows that the effective rotation rate used in the wind-braking torque depends on the dominant source latitudes of the stellar wind (during the wind-braking timescale), which is largely governed by the stellar magnetic field. ## 5 Conclusion This study provides evidence to suggest that the current Sun's mean angular momentum-loss rate is not strongly influenced by the observed surface differential rotation (with respect to adopting a solid-body rotation rate). The equatorial solar wind, in which the majority of the solar wind angular momentum flux is transported, is supplied by a range of low-latitude sources, along with flows from the equator-ward edges of polar coronal holes. Thus the effective rotation rate of the solar wind remains close to the Carrington rotation rate during most of solar cycle, except during solar minima. At these times, when there are only a few small low-latitude source regions, the mean rotation rate of the corona decreases by 50-60 nHz with respect to the Carrington rate. This coincides with the cyclic minimum of the Sun's angular momentum-loss rate, and so the net impact, when averaged over the solar cycle, is strongly limited. Differential rotation could have a stronger influence on the wind-braking of other Sun-like stars with larger contrasts in rotation between their equator and poles (typically observed in the younger rapidly rotating stars). The degree to which this differential rotation will impact their wind-braking torque is dependent on the long-term latitudinal distribution of their stellar wind sources, which remains uncertain. This may change in future when better observational constraints on the latitudinal distribution of starspots throughout the main-sequence of Sun-like stars become available (e.g. Berdyugina, 2005; Shapiro et al., 2014; Morris et al., 2017; Isik et al., 2018). It is left for future work to ascertain the importance of differential rotation on the wind-braking torque on evolutionary timescales. The PFSS modelling adopted in this work produces a static, force-free model of the corona. This is a rapid and computationally inexpensive method for assessing the likely variation of connectivity throughout the time-series of magnetograms used in this work (see also the work of Badman et al., 2020; Stansby et al., 2021). Our study assumes a direct relation between the observed surface rotation rate and that of the solar wind above, however many open questions still surround the rotation of the corona. It is likely that the act of differential rotation on the overlying coronal magnetic field will generate currents that modify the balance of forces in the corona. This effect can be found in the magnetoritfrictional models of Yeates et al. (2008), who utilise a time-varying photospheric magnetic field boundary condition with a finite magnetic field relaxation timescale (see also van Ballegooijen et al., 2000; Hoeksema et al., 2020). This allows for complexity to develop in the corona, which is otherwise missing in force-free models. Observed coronal features are often better matched by this kind of modelling (Meyer et al., 2020). Magnetoritfrictional modelling has also been applied to other Sun-like stars (see Gibb et al., 2016). Any potential hysteresis of the coronal magnetic field will likely change the source latitudes of the solar wind, and the degree of which the magnetic field enforces the surface rotation rate. Coronal rotation has impacts in many areas of active research, such as the accuracy of ballistic back-mapping of the solar wind when identifying photospheric sources (e.g. Macneil et al., 2022), the production of accurate models of the inner heliosphere, and the overall forecasting of space weather. Thus, in the coming decade, studies of coronal rotation ranging from the distortion of coronal hole boundaries, up to the variation in white light streamers, and in-situ measurements of solar wind deflections, will be required to understand the evolution of angular momentum from the solar surface out into the solar wind. ###### Acknowledgements. This research has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 810218 WHOLESUN), in addition to funding by the Centre National d'Etudes Spatiales (CNES) Solar Orbiter, the Institut National Sciences de l'Univers (INSU) via the Programme National Solei-Terre (PNST). This work utilizes data produced collaboratively between Air Force Research Laboratory (AFRL) and the National Solar Observatory (NOS). The ADAPT model development is supported by AFRL. The input data utilized by ADAPT is obtained by NSO/NISP (NSO Integrated Synoptic Program). NSO is operated by the Association of Universities for Research in Astronomy (AURA), Inc., under a cooperative agreement with the National Science Foundation (NSF). The sunspot number used in this work are from WDC-SILSO. Royal Observatory of Belgium, Brussels. Data supplied courtesy of the SDO/HMI and SDO/IAI costing. SDO is the first mission to be launched for NASA's Living With a Star (LWS) Program. The SOHO/LASCO data used here are produced by a consortium of the Naval Research Laboratory (USA), Max-Planck-Institut fuer Aeroonne (Germany), Laboratoire d'Astronomie (France), and the University of Birmingham (UK). SOHO is a project of international cooperation between ESA and NASA. Data manipulation was performed using the numpy (Harris et al., 2020), scipy (Virtanen et al., 2020), and pySHTOOLS (Wicorek & Meschede, 2018) python packages. Figures in this work are produced using the python packages matplotlib (Hunter, 2007), and Mayavi (Ramachandran & Varoquaux, 2011).

2303.15346

Optimal Message-Passing with Noisy Beeps

Beeping models are models for networks of weak devices, such as sensor networks or biological networks. In these networks, nodes are allowed to communicate only via emitting beeps: unary pulses of energy. Listening nodes only the capability of {\it carrier sensing}: they can only distinguish between the presence or absence of a beep, but receive no other information. The noisy beeping model further assumes listening nodes may be disrupted by random noise. Despite this extremely restrictive communication model, it transpires that complex distributed tasks can still be performed by such networks. In this paper we provide an optimal procedure for simulating general message passing in the beeping and noisy beeping models. We show that a round of \textsf{Broadcast CONGEST} can be simulated in $O(\Delta\log n)$ round of the noisy (or noiseless) beeping model, and a round of \textsf{CONGEST} can be simulated in $O(\Delta^2\log n)$ rounds (where $\Delta$ is the maximum degree of the network). We also prove lower bounds demonstrating that no simulation can use asymptotically fewer rounds. This allows a host of graph algorithms to be efficiently implemented in beeping models. As an example, we present an $O(\log n)$-round \textsf{Broadcast CONGEST} algorithm for maximal matching, which, when simulated using our method, immediately implies a near-optimal $O(\Delta \log^2 n)$-round maximal matching algorithm in the noisy beeping model.

Peter Davies

2023-03-27T15:58:42Z

http://arxiv.org/abs/2303.15346v1

# Optimal Message-Passing with Noisy Beeps ###### Abstract Beeping models are models for networks of weak devices, such as sensor networks or biological networks. In these networks, nodes are allowed to communicate only via emitting beeps: unary pulses of energy. Listening nodes only the capability of _carrier sensing_: they can only distinguish between the presence or absence of a beep, but receive no other information. The noisy beeping model further assumes listening nodes may be disrupted by random noise. Despite this extremely restrictive communication model, it transpires that complex distributed tasks can still be performed by such networks. In this paper we provide an optimal procedure for simulating general message passing in the beeping and noisy beeping models. We show that a round of Broadcast CONGEST can be simulated in \(O(\Delta\log n)\) round of the noisy (or noiseless) beeping model, and a round of CONGEST can be simulated in \(O(\Delta^{2}\log n)\) rounds (where \(\Delta\) is the maximum degree of the network). We also prove lower bounds demonstrating that no simulation can use asymptotically fewer rounds. This allows a host of graph algorithms to be efficiently implemented in beeping models. As an example, we present an \(O(\log n)\)-round Broadcast CONGEST algorithm for maximal matching, which, when simulated using our method, immediately implies a near-optimal \(O(\Delta\log^{2}n)\)-round maximal matching algorithm in the noisy beeping model. ## 1 Introduction Beeping models were first introduced by Cornejo and Kuhn [8] to model wireless networks of weak devices, such as sensor networks and biological networks [2]. These models are characterised by their very weak assumptions of communication capabilities: devices are assumed to communicate only via _carrier sensing_. That is, they have the ability to distinguish between the presence or absence of a signal, but not to gain any more information from the signal. ### Models The models we study all have the same basic structure: a network of devices is modeled as a graph with \(n\) nodes (representing the devices) and maximum degree \(\Delta\), where edges represent direct reachability between pairs of devices. We will assume that all nodes activate simultaneously, and therefore have shared global clock (some prior work on beeping models instead allow nodes to activate asynchronously). Time then proceeds in synchronous rounds, in which nodes can perform some local computation and then can communicate with neighboring devices. The defining characteristic of each model is the communication capability of the nodes. Noiseless Beeping ModelIn each round, each node chooses to either beep or listen. Listening nodes then hear a beep iff at least one of their neighbors beeped, and silence otherwise. Nodes do not receive any other information about the number or identities of their beeping neighbors. Noisy Beeping ModelThe noisy beeping model, introduced by Ashkenazi, Gelles, and Leshem [4], is similar to the noiseless version, except that the signal each listening node hears (beep or silence) is _flipped_, independently uniformly at random, with some probability \(\varepsilon\in(0,\frac{1}{2})\). Within these beeping models, our aim will be to simulate more powerful message-passing models, in which nodes have the ability to send longer messages to each other, and these messages are received without interference: Broadcast CONGEST ModelIn rounds of the Broadcast CONGEST model, nodes may send the same \(O(\log n)\)-bit message to each of their neighboring nodes, and each node hears the messages from all of its neighbors. CONGEST ModelThe CONGEST model is similar to Broadcast CONGEST, but allows nodes to send (potentially) different \(O(\log n)\)-bit messages to each of their neighboring nodes. Again, each node hears the messages from all of its neighbors. The communication capabilities in the Broadcast CONGEST and CONGEST models are clearly much more powerful than that of either beeping model, and CONGEST in particular has a broad literature of efficient algorithms. Our aim in this work is to provide an efficient generic simulation of Broadcast CONGEST and CONGEST in the beeping models, so that these existing algorithms can be applied out-of-the-box to networks of weak devices. ### Prior work Beeping modelsThe (noiseless) beeping model was introduced by Cornejo and Kuhn [8], who also gave results for an interval coloring task used for synchronization. Classical local graph problems have been studied in the model, with Afek et al. [1] giving an \(O(\log^{2}n)\)-round maximal independent set algorithm, and Beauqier et al. [7] giving \(O(\Delta^{2}\log n+\Delta^{3})\)-round deterministic algorithms for maximal independent set and \((\Delta+1)\)-coloring. Global communication problems (those requiring coordination across the entire network, and therefore with running times parameterized by the diameter \(D\) of the network) have also been studied. Single-source broadcast of a \(b\)-bit message can be performed in \(O(D+b)\) rounds using the simple tool of 'beep waves', introduced by Ghaffari and Haeupler [19] and formalized by Czumaj and Davies [9]. Leader election, another fundamental global problem, has seen significant study in the model. Ghaffari and Haeupler [19] gave a randomized algorithm requiring \(O(D+\log n\log\log n)\cdot\min\{\log\log n,\log\frac{n}{D}\}\), while Forster, Seidel and Wattenhofer [16] gave an \(O(D\log n)\)-round _deterministic_ algorithm. Czumaj and Davies [10] gave a simple randomized algorithm with \(O(D\log n)\) worst-case round complexity but \(O(D+\log n)\) expected complexity. Finally Dufoulon, Burman and Beauquier [11] settled the complexity of the problem with a deterministic algorithm with optimal \(O(D+\log n)\) round complexity. On other global problems, Czumaj and Davies [9] and Beauqier et al. [6] gave results for broadcasting from multiple sources, and Dufoulon, Burman and Beauqier [12] study synchronization primitives for the model variant where nodes activate asynchronously. Message passing modelsMessage passing models, and CONGEST in particular, have seen a long history of study and have a rich literature of algorithms for problems including (among many others) local problems such as \(\Delta+1\)-coloring[20], global problems such as minimum spanning tree[24], and approximation problems such as approximate maximum matching[3]. Broadcast CONGEST is less well-studied, though some dedicated algorithms have also been developed for it, e.g. [21]. There is an obvious way to simulate CONGEST algorithms in Broadcast CONGEST at an \(O(\Delta)\)-factor overhead: nodes simply broadcast the messages for each of their neighbors in turn, appending the ID of the intended recipient. In general this is the best that can be done (as can be seen from our bounds on simulating beeping models), but for specific problems this \(\Theta(\Delta)\) complexity gap is often not necessary. Simulating message passing with beepsTwo works have previously addressed the task of simulating messaging passing in beeping models. The first was by Beauquier et al. [7], and gave a generic simulation for CONGEST in the noiseless beeping model. Their algorithm required \(\Delta^{6}\) setup rounds, and then \(\Delta^{4}\log n\) beep-model rounds per round of CONGEST. This result was improved by Ashkenazi, Gelles, and Leshem [4], who introduced the noisy beeping model, and gave an improved simulation of CONGEST which requires \(O(\Delta^{4}\log n)\) rounds of setup, and then simulates each CONGEST round in \(O(\Delta\log n\cdot\min\{n,\Delta^{2}\})\) rounds of noisy beeps. ### Our results We give a randomized simulation of Broadcast CONGEST which requires \(O(\Delta\log n)\) rounds in the noisy beep model per round of Broadcast CONGEST, with no additional setup cost. We will call this per-round cost the _overhead_ of simulation. This implies a simulation of CONGEST with \(O(\Delta^{2}\log n)\) overhead in the noisy beep model. We therefore improve over the previous best result of [4] by reducing the overhead by a \(\Theta(\min\{\frac{n}{\Delta},\Delta\})\) factor, and removing the large setup cost entirely. We prove that these bounds are tight for both Broadcast CONGEST and CONGEST by giving matching lower bounds (even for the noiseless beeping model). This has the potentially surprising implication that introducing noise into the beeping model does not asymptotically increase the complexity of message-passing simulation at all. This simulation result allows many CONGEST and Broadcast CONGEST algorithms to be efficiently implemented with beeps. As an example, we show an \(O(\log n)\)-round Broadcast CONGEST algorithm for the task of maximal matching, which via our simulation implies an \(O(\Delta\log^{2}n)\)-round algorithm in the noisy beeping model. We show that this is almost optimal by demonstrating an \(\Omega(\Delta\log n)\) lower bound (even in the noiseless model). ### Our Approach We summarize our approach to simulating CONGEST in the noiseless beeping model (the noisy case will follow naturally, as we will see later). First, let us mention the general approach of the previous results of [7] and [4]: there, the authors use a coloring of \(G^{2}\) (i.e., a coloring such that no nodes within distance \(2\) in \(G\) receive the same color) to sequence transmissions. They iterate through the color classes, with nodes in each class transmitting their message (over a series of rounds, with a beep or silence representing each bit of the message). Since nodes have at most one neighbor in each color class, they hear that neighbor's message undisrupted. The disadvantage of such an approach is that the coloring of \(G^{2}\) requires a large setup time to compute, and also necessitates at least \(\min\{n,\Delta^{2}\}\) color classes. This is the cause of the larger overhead in the simulation result of [4]. Instead of having nodes transmitting at different times, our solution is to have them all transmit at once, and use superimposed codes to ensure that the messages are decipherable. The definition of a classic superimposed code is as follows: **Definition 1** (Superimposed Codes).: _An \((a,k)\)-superimposed code of length \(b\) is a function \(C:\{0,1\}^{a}\to\{0,1\}^{b}\) such that any superimposition (bitwise OR) of at most \(k\) codewords is unique._ The connection between superimposed codes and beeping networks is that, if some subset of a node \(v\)'s neighbors all transmit a message simultaneously (using beeps to represent \(\mathbf{1}\)s and silence to represent \(\mathbf{0}\)s), then \(v\) (if it were to listen every round) would hear the bitwise OR superimposition of all the messages. If this superimposition is unique, then \(v\) is able to identify the set of messages that were transmitted (and this set contain precisely those messages with no \(\mathbf{1}\) in a position where the superimposition has \(\mathbf{0}\)). Superimposed codes of this form were first introduced by Kautz and Singleton [23], who showed a construction with \(b=O(k^{2}a)\). This definition is equivalent to cover-free families of sets, which is the terminology used in much of the prior work. A lower bound \(b=\Omega(\frac{k^{2}a}{\log k})\) was found by D'yachkov and Rykov [14], with a combinatorial proof later given by Ruszinko [28], and another, simple proof given by Furedi [17]. The \(\log k\) gap between upper and lower bounds remains open. This presents a problem to applying such codes for message passing in the beep model. If all nodes are transmitting their message (of \(O(\log n)\) bits) at once, then we would need to use an \((O(\log n),\Delta)\)-superimposed code for the messages to be decodable. Using Kautz and Singleton's construction [23] results in a length of \(O(\Delta^{2}\log n)\) (and length corresponds directly to rounds in the beeping model). This would result in the same \(O(\Delta^{2})\)-factor overhead as from using a coloring of \(G^{2}\), so would not improve over [4]. Furthermore, even if we were to find improved superimposed codes, the lower bound implies that any such improvement would be only minor. To achieve codes with better length, we weaken the condition we require. Rather than requiring that all superimpositions of at most \(k\) codewords are unique, we only require that _most_ are. Specifically, if the \(k\) codewords are chosen at random, then their superimposition will be unique (and hence decodable) with high probability. We show the existence of short codes with this weakened property. Constructions with similar properties (though not quite suitable for our uses) were also given in [13]. This raises a new problem: using these shorter codes, we can efficiently have all nodes send a _random_ message to their neighbors, but how does this help us send a specific message? Our answer is that if we repeat the transmission (using the same random codewords for each node), then every node \(v\) already knows exactly when its neighbors should be be beeping1, and in particular, \(v\) knows when a neighbor \(u\) should be be beeping _alone_ (i.e., not at the same time as any other neighbor of \(v\)). If \(u\) now beeps only in a _subset_ of the rounds indicated by its codeword, then it can pass information to \(v\) in this way. So, our final algorithm uses a secondary _distance_ code to specify what this subset should be in order to ensure that all neighbors of \(u\) can determine \(u\)'s message. The aim of this distance code is that codewords are sufficiently large Hamming distance apart that \(u\)'s neighbors can determine \(u\)'s message, even though they only hear a subset of the relevant bits, and these bits can be flipped by noise in the noisy model. Footnote 1: Technically, \(v\) does not know which neighbor corresponds to which codeword, but this is not required by our approach. ### Notation Our protocols will be heavily based on particular types of binary codes, which we will communicate in the beeping model via beeps and silence. In a particular round, in the noiseless beeping model, we will say that a node \(v\) receives a \(\mathbf{1}\) if it either listens and hears a beep, or beeps itself. We will say that \(v\) receives a \(\mathbf{0}\) otherwise. In the noisy model, what \(v\) hears will be this bit, flipped with probability \(\varepsilon\). We will use logic operators to denote operations between two strings: for \(s,s^{\prime}\in\{0,1\}^{a}\), \(s\wedge s^{\prime}\in\{0,1\}^{a}\) is the logical And of the two strings, with \(\mathbf{1}\) in each coordinate iff both \(s\) and \(s^{\prime}\) had \(\mathbf{1}\) in that coordinate. Similarly, \(s\lor s^{\prime}\in\{0,1\}^{a}\) is the logical Or of the two strings, with \(\mathbf{1}\) in each coordinate iff \(s\) or \(s^{\prime}\) (or both) had \(\mathbf{1}\) in that coordinate. **Definition 2**.: _We will use \(\mathbf{1}(s)\) to denote the number of \(\mathbf{1}\)s in a string \(s\in\{0,1\}^{a}\). We will say that a string \(s\in\{0,1\}^{a}\)\(d\)-intersects another string \(s^{\prime}\in\{0,1\}^{a}\) if \(\mathbf{1}(s\wedge s^{\prime})\geq d\)._ For a set of strings \(S\in\{0,1\}^{a}\), we will use \(\vee(S)\) as shorthand for the superimposition \(\bigvee_{s\in S}s\). ## 2 Binary Codes The novel type of superimposed code on which our algorithm is mainly based is defined as follows: **Definition 3**.: _An \((a,k,\delta)\)-beep code of length \(b\) is a function \(C:\{0,1\}^{a}\rightarrow\{0,1\}^{b}\) such that:_ * _all_ \(s\in C\) _have_ \(\mathbf{1}(s)=\frac{\delta b}{k}\)_._ * _the number of size-_\(k\) _subsets_ \(S\subseteq C\) _whose superimpositions_ \(\vee(S)\ \frac{5\delta^{2}b}{k}\)_-intersect some_ \(s\in C\setminus S\) _is at most_ \(\binom{2^{a}}{k}2^{-2a}\)__ _(here we slightly abuse notation by using \(C\) to denote the set of codewords, i.e. the image \(C(\{0,1\}^{a})\) of the beep code function)._ In other words, all codewords have exactly \(\frac{\delta b}{k}\)\(\mathbf{1}\)s, and only a \(2^{-2a}\)-fraction of the \(\binom{2^{a}}{k}\) size-\(k\) subsets of codewords have a superimposition that \(\frac{5\delta^{2}b}{k}\)-intersects some other codeword. This first criterion is only a technicality to aid our subsequent application; the important point is the second, which will imply that a superimposition of \(k\)_random_ codewords will, with probability at least \(1-2^{-2a}\), be decodable (even under noise, since avoiding \(\frac{5\delta^{2}b}{k}\)-intersection will provide use with sufficient redundancy to be robust to noise). Note that for such a code to exist, \(\frac{\delta b}{k}\) must be an integer, which we will guarantee in our construction. **Theorem 4**.: _For any any \(a,k,c\in\mathbb{N}\), there exists an \((a,k,1/c)\)-beep code of length \(b=c^{2}ka\)._ Proof.: The proof will be by the probabilistic method: we will randomly generate a candidate code \(C\), and then prove that it has the desired properties with high probability in \(2^{a}\). Then, a code with such properties must exist, and the random generation process we use implies an efficient algorithm to find such a code with high probability (though _checking_ the code is correct would require \(2^{O(ak)}\) computation). To generate our candidate code, we choose each codeword independently, uniformly at random from the set of all \(b\)-bit strings with \(\frac{b}{ck}\)\(\mathbf{1}\)s. This clearly guarantees the first property. For a fixed size-\(k\) set \(S\) of codewords, and a fixed codeword \(x\in C\setminus S\), we now analyze the probability that \(\vee(S)\)\(\frac{5b}{c^{2}k}\)-intersects \(x\). Clearly we have \(\mathbf{1}(\vee(S))\leq k\cdot\frac{b}{ck}=b/c\). Consider the process of randomly choosing the positions of the \(\mathbf{1}\)s of \(x\). Each falls in the same position as a \(\mathbf{1}\) of \(\vee(S)\) with probability at most \(1/c\), even independently of the random choices for the other \(\mathbf{1}\)s. The probability that \(\vee(S)\)\(\frac{5b}{c^{2}k}\)-intersects \(x\) is therefore at most \[\left(\begin{array}{c}\frac{b}{ck}\\ \frac{5b}{c^{2}k}\end{array}\right)\cdot c^{-\frac{5b}{c^{2}k}}\leq\left(\frac {ec}{5}\right)^{\frac{5b}{c^{2}k}}\cdot c^{-\frac{5b}{c^{2}k}}\leq\left(\frac {5}{e}\right)^{-\frac{5b^{2}ka}{c^{2}k}}\leq 2^{-4a}\] Taking a union bound over all codewords \(s\in C\setminus S\), we find that the probability that \(\vee(S)\)\(\frac{5b}{c^{2}k}\)-intersects any such codeword is at most \(2^{-4a}\). Then, the expected number of size-\(k\) sets \(S\) that \(\frac{5b}{c^{2}k}\)-intersect any \(s\in C\setminus S\) is at most \(\binom{2^{a}}{k}2^{-3a}\). By the probabilistic method, there therefore _exists_ a an \((a,k,1/c)\)-beep code in which the number of size-\(k\) sets \(S\) that \(\frac{5b}{c^{2}k}\)-intersect any \(s\in C\setminus S\) is at most \(\binom{2^{a}}{k}2^{-3a}\). However, since we also want an efficient algorithm to _find_ an \((a,k,1/c)\)-beep code, we note that by Markov's inequality the probability that more than \(\binom{2^{a}}{k}2^{-2a}\) size-\(k\) sets \(S\) that \(\frac{5b}{c^{2}k}\)-intersect any \(s\in C\setminus S\) is at most \(2^{-a}\), and therefore the process of choosing codewords uniformly at random from all strings with \(\frac{b}{ck}\)\(\mathbf{1}\)s gives an \((a,k,1/c)\)-beep code with probability at least \(1-2^{-a}\). Notice that, while the theorem holds for any \(c\in\mathbb{N}\), it is trivial for \(c\leq 2\): in this case, codewords cannot \(\frac{5b}{c^{2}k}\)-intersect any string, since they contain only \(\frac{b}{ck}\)\(\mathbf{1}\)s. Our application will set \(c\) to be a sufficiently large constant. Our algorithm will also make use of _distance codes_. These codes have the simple criterion that every pair of codewords is sufficiently far apart by Hamming distance (which we will denote \(d_{H}\)). Distance codes are an example of error-correcting codes, which have a wealth of prior research (see e.g. [22] for an extensive survey); here we just require a very simple object, for which we give a proof in a similar style to that of Theorem 4 for consistency: **Definition 5**.: _An \((a,\delta)\)-distance code of length \(b\) is a function \(D:\{0,1\}^{a}\rightarrow\{0,1\}^{b}\) such that all pairs \(s\neq s^{\prime}\in D\) have \(d_{H}(s,s^{\prime})\geq\delta b\)._ **Lemma 6**.: _For any \(\delta\in(0,\frac{1}{2})\), \(a\in\mathbb{N}\), and \(c_{\delta}\geq 12(1-2\delta)^{-2}\), there exists an \((a,\delta)\)-distance code of length \(b=c_{\delta}a\)._ Proof.: We randomly generate a candidate code by choosing each codeword's entries independently uniformly at random from \(\{0,1\}\). For any pair of codewords \(s,s^{\prime}\in D\), the probability that they differ on any particular entry is \(\frac{1}{2}\). The expected distance is therefore \(\frac{b}{2}\), and by a Chernoff bound, \[\mathbf{Pr}\left[d_{H}(s,s^{\prime})\leq\delta b\right] =\mathbf{Pr}\left[d_{H}(s,s^{\prime})\leq 2\delta\mathbf{E} \left[d_{H}(s,s^{\prime})\right]\right]\] \[\leq e^{\frac{-(1-2\delta)^{2}\mathbf{E}\left[d_{H}(s,s^{\prime}) \right]}{2}}=e^{\frac{-(1-2\delta)^{2}c_{\delta a}}{4}}\enspace.\] Since \(c_{\delta}\geq 12(1-2\delta)^{-2}\), \[\mathbf{Pr}\left[dist(s,s^{\prime})\leq\delta b\right]\leq e^{-3a}\leq 2^{- 4a}\enspace.\] Taking a union bound over all \(\binom{2^{a}}{2}\leq 2^{2a}\) pairs \(s,s^{\prime}\in D\), we find that the probability that any pair has \(dist(s,s^{\prime})\leq\delta b\) is at most \(2^{-2a}\). Therefore, the random generation process generates an \((a,\delta)\)-distance code with probability at least \(1-2^{-2a}\). This construction can also be checked relatively efficiently, since one need only check the distance of \(O(2^{2a})\) codeword pairs, which can be performed in \(2^{O(a)}\) computation. ## 3 Simulation Algorithm We now arrive at our main simulation algorithm. We give an algorithm for simulating a single communication round in Broadcast CONGEST using \(O(\Delta\log n)\) rounds of the noisy beep model. What we mean by this simulation is that each node \(v\) begins with a \(\gamma\log n\)-bit message \(m_{v}\) to transmit to all neighbors (where \(\gamma\) is some constant, a parameter of the Broadcast CONGEST model), and by the end of our beeping procedure, all nodes should be able to output the messages of all their neighbors. Let \(c_{\varepsilon}\) be a constant to be chosen based on \(\varepsilon\), the noise constant. Our algorithm will make use of two codes (instantiations of those defined in the previous section): * a \((\gamma\log n,\frac{1}{3})\)-distance code \(D\) of length \(c_{\varepsilon}^{2}\gamma\log n\), given by Lemma 6 (so long as we choose \(c_{\varepsilon}\geq 108\)); * a \((c_{\varepsilon}\gamma\log n,\Delta+1,1/c_{\varepsilon})\)-beep code \(C\) of length \(c_{\varepsilon}^{3}\gamma(\Delta+1)\log n\) given by Theorem 4. The codewords in the beep code \(C\) contain exactly \(c_{\varepsilon}^{2}\gamma\log n\)**1**s. The purpose of using these two codes is to combine them in the following manner: **Notation 7**.: _For a binary string \(s\), let **1\({}_{i}(s)\)** denote the position of the \(i^{th}\)**1** in \(s\) (and Null if \(s\) contains fewer than \(i\)**1**s)._ Let \(CD:\{0,1\}^{c_{\varepsilon}\gamma\log n}\times\{0,1\}^{\gamma\log n}\to\{0,1 \}^{c_{\varepsilon}^{3}\gamma(\Delta+1)\log n}\) be the combined code defined as follows: \[CD(r,m)_{j}=\begin{cases}\mathbf{1}&\text{if for some $i\in[c_{\varepsilon}^{2} \gamma\log n]$, $\mathbf{1}_{i}(C(r))=j$, and $D(m)_{i}=\mathbf{1}$}\\ \mathbf{0}&\text{otherwise}\end{cases}\] That is, \(CD(r,m)\) is the code given by writing the codeword \(D(m)\) in the positions where \(C(r)\) is \(\mathbf{1}\) (and leaving the other positions as \(\mathbf{0}\)): see Figure 1. The algorithm is then as follows (Algorithm 1): ``` Each node \(v\) picks \(r_{v}\in\{0,1\}^{c_{\varepsilon}\gamma\log n}\) independently uniformly at random for\(i=1\) to \(c_{\varepsilon}^{3}\gamma(\Delta+1)\log n\), in round \(i\), do Node \(v\) beeps iff \(C(r_{v})_{i}=1\) endfor for for\(i=1\) to \(c_{\varepsilon}^{3}\gamma(\Delta+1)\log n\), in round \(i+c_{\varepsilon}^{3}\gamma(\Delta+1)\log n\), do Node \(v\) beeps iff \(CD(r_{v},m_{v})_{i}=1\) endfor ``` **Algorithm 1** Simulation of a Broadcast CONGEST round in the noisy beeping model So, each node picks a random codeword from the beep code, and transmits it bitwise using beeps and silence. By the properties of the beep code, with high probability the superimposition of messages each node receives will be decodable. Then, to actually convey the message \(m_{v}\), \(v\) uses the combined code, which transmits \(m_{v}\), encoded with a distance code, in the positions where the beep codeword \(r_{v}\) used in the first round was \(\mathbf{1}\). Neighbors \(u\) of \(v\) know when these positions are from the first round. Of course, there are some rounds when other neighbors of \(u\) will be be beeping, some rounds when \(u\) must beep itself and cannot listen, and some rounds when the signal from \(v\) is flipped by noise. However, we will show that, by a combination of the properties of our two codes, there is sufficient redundancy to overcome all three of these obstacles, and allow \(u\) to correctly decode \(v\)'s message. ## 4 Decoding the Code In the first phase, each node \(v\) hears2 a string we will denote \(\tilde{x}_{v}\), which is the string \(x_{v}:=\bigvee_{u\in N(v)}C(r_{u})\) with each bit flipped with probability \(\varepsilon\in(0,\frac{1}{2})\), and the aim is for \(v\) to decode this string in order to determine the set \(R_{v}:=\{r_{u}:u\in N(v)\}\). Footnote 2: For simplicity of notation, we will assume that a node counts a round in which it itself beeped as ‘hearing’ a \(\mathbf{1}\), and in the noisy model, flips this \(\mathbf{1}\) with probability \(\varepsilon\) itself. Of course, in practice this is unnecessary, and having full information about its own message can only help a node. We first show that, before considering noise, with high probability the superimposition of random codewords chosen by each node's inclusive neighborhood is decodable. **Lemma 8**.: _With probability at least \(1-n^{3-c_{\varepsilon}\gamma}\), for every node \(v\in V\) and every \(r\in\{0,1\}^{c_{\varepsilon}\gamma\log n}\), \(C(r)\) does not \(5c_{\varepsilon}\gamma\log n\)-intersect \(\bigvee_{r_{u}\in R_{v}\setminus\{r\}}C(r_{u})\)._ Proof.: First, we see that with probability at least \(1-\frac{n^{2}}{2^{c_{\varepsilon}\gamma\log n}}=1-n^{2-c_{\varepsilon}\gamma}\), all nodes choose different random strings. For the rest of the proof we condition on this event. For each \(v\in V\), \(r\in\{0,1\}^{c_{\varepsilon}\gamma\log n}\), let \(R_{v,r}\) be a set of nodes' random strings defined as follows: starting with \(R_{v}\setminus\{r\}\) (which is a set of input messages of size at most \(\Delta+1\)), add arbitrary \(r_{x}\) from nodes \(x\notin(N(v)\cup\{w\})\) until the set is of size exactly \(\Delta+1\). Since we are conditioning on the event that all nodes generate different random strings, \(R_{v,w}\) is a set of \(\Delta+1\) distinct random strings from \(\Delta+1\) distinct nodes, none of which are \(w\). Figure 1: Combined code construction By the properties of a \((c_{\varepsilon}\gamma\log n,\Delta+1,1/c_{\varepsilon})\)-bepe code, therefore, the probability that \(C(r)\)\(5c_{\varepsilon}\gamma\log n\)-intersects \(\bigvee_{r_{u}\in R_{v,u}}C(r_{u})\) is at most \(2^{-2c_{\varepsilon}\gamma\log n}=n^{-2c_{\varepsilon}\gamma}\). If \(C(r)\) does not \(5c_{\varepsilon}\gamma\log n\)-intersect \(\bigvee_{r_{u}\in R_{v,u}}C(r_{u})\), then it also does not \(5c_{\varepsilon}\gamma\log n\)-intersect \(\bigvee_{r_{u}\in R_{v}\setminus\{r\}}C(r_{u})\), since \(R_{v,w}\) is a superset of \(R_{v}\setminus\{r\}\). The number of possible pairs \(v\in V\), \(r\in\{0,1\}^{c_{\varepsilon}\gamma\log n}\) is \(n^{1+c_{\varepsilon}\gamma}\). Taking a union bound over all of these, we find that \(C(r)\) does not \(5c_{\varepsilon}\gamma\log n\)-intersect \(\bigvee_{r_{u}\in R_{v}\setminus\{r\}}C(r_{u})\) for any pair with probability at least \(1-n^{1+c_{\varepsilon}\gamma-2c_{\varepsilon}\gamma}=1-n^{1-c_{\varepsilon} \gamma}\) by a union bound. Finally, removing the conditioning on the event that nodes' random strings are all different, we reach the condition of the lemma with probability at least \(1-n^{1-c_{\varepsilon}\gamma}-n^{2-c_{\varepsilon}\gamma}\geq 1-n^{3-c_{ \varepsilon}\gamma}\). Next we must analyze how noise affects the bitstrings that nodes hear. For any node \(v\), let \(x_{v}\) denote the string \(v\) heard, i.e., \(\bigvee_{u\in N(v)}C(r_{u})\), after each bit is flipped with probability \(\varepsilon\in(0,\frac{1}{2})\). To decode the set \(R_{v}\), \(v\) will take \(\tilde{R}_{v}=\{r\in\{0,1\}^{c_{\varepsilon}\gamma\log n}:C(r)\) does not \(\frac{2\varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n\)-intersect \(\neg\tilde{x}_{v}\}\). That is, it includes all codewords which have fewer than \(\frac{2\varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n\)\(1\)s in positions where \(\tilde{x}_{v}\) does not. Notice that, in the absence of noise, all \(C(r)\) for \(r\in R_{v}\) have zero \(1\)s in positions where \(x_{v}\) did not, and all \(C(r)\) for \(r\notin R_{v}\) have at least \(c_{\varepsilon}(c_{\varepsilon}-5)\gamma\log n\), since \(C(r)\) contains exactly \(c_{\varepsilon}^{2}\gamma\log n\)\(1\)s and, by Lemma 8, fewer than \(5c_{\varepsilon}\gamma\log n\) of them intersect \(x_{v}\). So, the goal of our next lemma is to show that noise does not disrupt this by too much. **Lemma 9**.: _For sufficiently large constant \(c_{\varepsilon}\), with probability at least \(1-n^{4-c_{\varepsilon}\gamma}\), for all nodes \(v\), \(\tilde{R}_{v}=R_{v}\)._ Proof.: Conditioning on the event of Lemma 8, all \(C(r)\) for \(r\notin R_{v}\)\(c_{\varepsilon}(c_{\varepsilon}-5)\gamma\log n\)-intersect \(\neg x_{v}\). Then, for such an \(r\) to be in \(\tilde{R}_{v}\), more than \(\mathbf{1}(C(r)\wedge\neg x_{v})-\frac{2\varepsilon+1}{4}c_{\varepsilon}^{2} \gamma\log n\) of the intersection positions would have to be flipped by noise. The probability of this is clearly minimized when \(\mathbf{1}(C(r)\wedge\neg x_{v})\) is as low as possible, i.e., \(c_{\varepsilon}(c_{\varepsilon}-5)\gamma\log n\). Then, \(c_{\varepsilon}(c_{\varepsilon}-5)\gamma\log n-\frac{2\varepsilon+1}{4}c_{ \varepsilon}^{2}\gamma\log n=(\frac{3-2\varepsilon}{4}c_{\varepsilon}-5)c_{ \varepsilon}\gamma\log n\) positions must be flipped, and the expected number of such flipped positions is \(\mu:=\varepsilon(c_{\varepsilon}-5)c_{\varepsilon}\gamma\log n\). To show a low probability of failure, we need that the number of positions that must be flipped for \(r\) to be incorrectly categorized is more than its expectation. To do so, we bound the ratio of the two quantities: \[\frac{(\frac{3-2\varepsilon}{4}c_{\varepsilon}-5)c_{\varepsilon} \gamma\log n}{\varepsilon(c_{\varepsilon}-5)c_{\varepsilon}\gamma\log n} =\frac{\frac{3-2\varepsilon}{4}c_{\varepsilon}-5}{\varepsilon(c_ {\varepsilon}-5)}\] \[\geq\frac{\frac{3-2\varepsilon}{4}c_{\varepsilon}-5}{\frac{c_{ \varepsilon}}{2}}\] since \[\varepsilon\in(0,\frac{1}{2})\] \[=\frac{3}{2}-\varepsilon-\frac{10}{c_{\varepsilon}}\enspace.\] We will set \(c_{\varepsilon}\geq\frac{60}{1-2\varepsilon}\). Then, \[\frac{(\frac{3-2\varepsilon}{4}c_{\varepsilon}-5)c_{\varepsilon}\gamma\log n} {\varepsilon(c_{\varepsilon}-5)c_{\varepsilon}\gamma\log n}\geq\frac{3}{2}- \varepsilon-\frac{1-2\varepsilon}{6}=\frac{4-2\varepsilon}{3}>1\enspace.\] Now that we have bounded the ratio above \(1\), we can apply a Chernoff bound: \[\mathbf{Pr}\left[\mathbf{1}(C(r)\wedge\neg\tilde{x}_{v})<\frac{2 \varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n\right] \leq\mathbf{Pr}\left[\text{more than }\frac{\frac{3-2\varepsilon}{4}c_{ \varepsilon}-5}{\varepsilon(c_{\varepsilon}-5)}\mu\text{ intersection positions are flipped}\right]\] \[\leq exp(-\left(\frac{\frac{3-2\varepsilon}{4}c_{\varepsilon}-5}{ \varepsilon(c_{\varepsilon}-5)}-1\right)^{2}\mu/3)\] \[\leq exp(-\left(\frac{4-2\varepsilon}{3}-1\right)^{2}\mu/3)\] \[=exp(-\left(1-2\varepsilon\right)^{2}\varepsilon(c_{\varepsilon}-5)c _{\varepsilon}\gamma\log n/27)\enspace.\] We will now further require that \(c_{\varepsilon}\geq\frac{54}{(1-2e)^{2}\varepsilon}+5\), which gives: \[\mathbf{Pr}\left[\mathbf{1}(C(r)\wedge\neg\tilde{x}_{v})<\frac{2\varepsilon+1}{ 4}c_{\varepsilon}^{2}\gamma\log n\right]\leq exp(-2c_{\varepsilon}\gamma\log n) \leq n^{-2c_{\varepsilon}\gamma}\enspace.\] Conversely, for some \(r^{\prime}\in R_{v}\), \(C(r)\) does not \(1\)-intersect \(\neg x_{v}\) (since it is contained in the superimposition that produces \(x_{v}\)). So, for it to \(\frac{2\varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n\)-intersect \(\neg\tilde{x}_{v}\), at least \(\frac{2\varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n\) of the positions in which \(C(r^{\prime})\) has a \(\mathbf{1}\) (of which there are exactly \(c_{\varepsilon}^{2}\gamma\log n\), by definition) would need to be flipped in \(\tilde{x}_{v}\). The expected number of such flipped positions is \(\mu^{\prime}:=\varepsilon c_{\varepsilon}^{2}\gamma\log n\). Since \(\varepsilon\in(0,\frac{1}{2})\), have \(\frac{2\varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n>\frac{4\varepsilon}{ 4}c_{\varepsilon}^{2}\gamma\log n=\mu^{\prime}\), so we can again apply a Chernoff bound: \[\mathbf{Pr}\left[\mathbf{1}(C(r^{\prime})\wedge\neg\tilde{x}_{v}) \geq\frac{2\varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n\right] \leq\mathbf{Pr}\left[\text{at least }\frac{2\varepsilon+1}{4}c_{ \varepsilon}^{2}\gamma\log n\text{ of }C(r^{\prime})\text{'s }\mathbf{1}\text{s are flipped}\right]\] \[\leq exp(-\left(\frac{\frac{2\varepsilon+1}{4}}{\varepsilon}-1 \right)^{2}\mu^{\prime}/3)\] \[=exp(-\left(\frac{1}{4\varepsilon}-\frac{1}{2}\right)^{2} \varepsilon c_{\varepsilon}^{2}\gamma\log n/3)\enspace.\] Requiring that \(c_{\varepsilon}\geq\frac{6}{\varepsilon}\left(\frac{1}{4\varepsilon}-\frac{1} {2}\right)^{-2}\) again gives: \[\mathbf{Pr}\left[\mathbf{1}(C(r^{\prime})\wedge\neg\tilde{x}_{v})\geq\frac{2 \varepsilon+1}{4}c_{\varepsilon}^{2}\gamma\log n\right]\leq exp(-2c_{ \varepsilon}\gamma\log n)\leq n^{-2c_{\varepsilon}\gamma}\enspace.\] So, each codeword is correctly placed in or out of \(\tilde{R}_{v}\) with probability at least \(1-n^{-2c_{\varepsilon}\gamma}\). Taking a union bound over all \(2^{c_{\varepsilon}\gamma\log n}\) codewords, we have \(\tilde{R}_{v}=R_{v}\) with probability at least \(1-n^{-c_{\varepsilon}\gamma}\). Finally, taking another bound over all nodes \(v\in V\) and removing the conditioning on the event of Lemma 8 (which occurs with probability at least \(1-n^{3-c_{\varepsilon}\gamma}\) ) gives correct decoding at all nodes with probability at least \(1-n^{4-c_{\varepsilon}\gamma}\). The lemma requires setting \(c_{\varepsilon}\geq\max\{\frac{6}{\varepsilon}\left(\frac{1}{4\varepsilon}- \frac{1}{2}\right)^{-2},\frac{54}{(1-2e)^{2}\varepsilon}+5,\frac{60}{1-2 \varepsilon}\}\). We now analyze the second stage of the algorithm, in which nodes transmit their messages using the combined code, and show that this code allows the messages to be decoded. **Lemma 10**.: _In the second phase of the algorithm, with probability at least \(1-n^{\gamma+6-c_{\varepsilon}\gamma}\), all nodes \(v\) can successfully decode \(\{m_{w}:w\in N(v)\}\) (so long as \(c_{\varepsilon}\) is at least a sufficiently large constant)._ Proof.: Conditioned on the event of Lemma 9, all nodes \(v\) now know \(R_{v}\). In the second stage of the algorithm, in the absence of noise \(v\) would hear the string \(\bigvee_{w\in N(v)}CD(r_{w},m_{w})\), which we will denote \(y_{v}\). To decode the message \(m_{w}\), for some \(w\in N(v)\), it examines the subsequence \(y_{v,w}\) defined by \((y_{v,w})_{j}=(y_{v})_{i}:\mathbf{1}_{j}(C(w))=i\). We denote the noisy versions of these strings that \(v\) actually hears by \(\tilde{y}_{v}\) and \(\tilde{y}_{v,w}\) respectively. (Note that \(v\) does not know which neighbor \(w\) the strings \(r_{w}\) and \(\tilde{y}_{v,w}\) belong to, but it can link them together, which is all that is required at this stage.) Node \(v\) decodes \(m_{w}\) as the string \(\tilde{m}_{w}\in\{0,1\}^{\gamma\log n}\) minimizing \(d_{H}(D(\tilde{m}_{w}),\tilde{y}_{v,w})\). We must show that, with high probability, \(\tilde{m}_{w}=m_{w}\). Conditioned on the event of Lemma 8, each \(C(r_{w})\) for \(w\in N(v)\) does not \(5c_{\varepsilon}\gamma\log n\)-intersect \(\bigvee_{r_{w}\in R_{v}\setminus\{r_{w}\}}C(r_{u})\). That is, there are at least \((c_{\varepsilon}-5)c_{\varepsilon}\gamma\log n\) positions in \(x_{v}\) in which \(C(r_{w})\) has a \(\mathbf{1}\) and no other \(C(r_{u})\) for \(u\in N(v)\) does. In these positions \(j\), \((y_{v,w})_{j}=D(m_{w})_{j}\). So, in total, \[d_{H}(D(m_{w}),y_{v,w})\leq 5c_{\varepsilon}\gamma\log n\enspace.\] Under noise, each of the positions in which \(y_{v,w}\) matches \(D(m_{w})\) will be flipped with probability \(\varepsilon\) in \(\tilde{y}_{v,w}\). So, denoting \(\mathbf{E}\left[d_{H}(D(m_{w}),\tilde{y}_{v,w})\right]\) by \(\mu\), we have: \[\varepsilon c_{\varepsilon}^{2}\gamma\log n\leq\mu\leq\varepsilon c_{\varepsilon}^{2} \gamma\log n+5c_{\varepsilon}\gamma\log n\enspace.\] Meanwhile,by the property of a \((\gamma\log n,\frac{1}{3})\)-distance code, for any \(m\neq m_{w}\in\{0,1\}^{\gamma\log n}\), \[d_{H}(D(m),y_{v,w})\geq d_{H}(D(m),D(m_{w}))-d_{H}(D(m_{w}),y_{v,w})\geq\frac{ 1}{3}c_{\varepsilon}^{2}\gamma\log n-5c_{\varepsilon}\gamma\log n\enspace.\] To lower-bound \(\mathbf{E}\left[d_{H}(D(m),\tilde{y}_{v,w})\right]\) (which we denote by \(\mu^{\prime}\)), we see that \(\mu^{\prime}=(1-\varepsilon)d_{H}(D(m),y_{v,w})+\varepsilon(c_{\varepsilon}^{ 2}\gamma\log n-d_{H}(D(m),y_{v,w}))\). Since \(\varepsilon>\frac{1}{2}\), this is minimized when \(d_{H}(D(m),y_{v,w})\) is as small as possible, i.e., \(\frac{1}{3}c_{\varepsilon}^{2}\gamma\log n-5c_{\varepsilon}\gamma\log n\). Then, \[\mu^{\prime} \geq(1-\varepsilon)(\frac{1}{3}c_{\varepsilon}^{2}\gamma\log n-5 c_{\varepsilon}\gamma\log n)+\varepsilon(c_{\varepsilon}^{2}\gamma\log n-( \frac{1}{3}c_{\varepsilon}^{2}\gamma\log n-5c_{\varepsilon}\gamma\log n))\] \[=(\frac{1}{3}c_{\varepsilon}-\frac{2}{3}c_{\varepsilon}-5+10 \varepsilon+\varepsilon c_{\varepsilon})c_{\varepsilon}\gamma\log n\] \[\geq\frac{1+\varepsilon}{3}c_{\varepsilon}^{2}\gamma\log n-5c_{ \varepsilon}\gamma\log n\enspace.\] Since \(\varepsilon<\frac{1}{2}\), we have \(\frac{1+\varepsilon}{3}>\varepsilon\), and so we can see that for sufficiently large \(c_{\varepsilon}\), \(\mu\leq\mu^{\prime}\). So, it remains to show that \(d_{H}(D(m_{w}),\tilde{y}_{v,w})\) and \(d_{H}(D(m),\tilde{y}_{v,w})\) are concentrated around their expectations. We first show that, with high probability, \(d_{H}(D(m_{w}),\tilde{y}_{v,w})\leq\frac{1+4\varepsilon}{6}c_{\varepsilon}^{2} \gamma\log n\). Note that if we set \(c_{\varepsilon}\geq\frac{60}{1-2\varepsilon}\), then \[\frac{1+4\varepsilon}{6}c_{\varepsilon}=\varepsilon c_{\varepsilon}+\frac{1-2 \varepsilon}{6}c_{\varepsilon}>\varepsilon c_{\varepsilon}+5\enspace,\] and so \[\frac{1+4\varepsilon}{6}c_{\varepsilon}^{2}\gamma\log n>\varepsilon c_{ \varepsilon}^{2}\gamma\log n+5c_{\varepsilon}\gamma\log n\geq\mu\enspace.\] Then, we can apply a Chernoff bound: \[\mathbf{Pr}\left[d_{H}(D(m_{w}),\tilde{y}_{v,w})\geq\frac{1+4 \varepsilon}{6}c_{\varepsilon}^{2}\gamma\log n\right] \leq\mu\cdot\mathbf{Pr}\left[d_{H}(D(m_{w}),\tilde{y}_{v,w})\geq \frac{(1+4\varepsilon)c_{\varepsilon}}{6}\big{/}\left(\varepsilon c_{ \varepsilon}+5\right)\right]\] \[\leq exp(-\left(\frac{(1+4\varepsilon)c_{\varepsilon}}{6 \varepsilon c_{\varepsilon}+30}-1\right)^{2}\mu/2)\] \[=exp(-\left(\frac{(1-2\varepsilon)c_{\varepsilon}-30}{6 \varepsilon c_{\varepsilon}+30}\right)^{2}\mu/2)\enspace.\] The expression \(\frac{(1-2\varepsilon)c_{\varepsilon}-30}{6\varepsilon c_{\varepsilon}+30}\) is increasing in \(c_{\varepsilon}\). Therefore, if we ensure that \(c_{\varepsilon}\geq\frac{30}{\varepsilon(1-2\varepsilon)}\), we have \[\frac{(1-2\varepsilon)c_{\varepsilon}-30}{6\varepsilon c_{\varepsilon}+30}\geq \frac{\frac{30}{\varepsilon}-30}{\frac{180}{1-2\varepsilon}+30}=\frac{\frac{ 1}{\varepsilon}-1}{\frac{6}{1-2\varepsilon}+1}=\frac{(1-\varepsilon)(1-2 \varepsilon)}{\varepsilon(7-2\varepsilon)}\enspace.\] Then, \[\mathbf{Pr}\left[d_{H}(D(m_{w}),\tilde{y}_{v,w})\geq\frac{1+4 \varepsilon}{6}c_{\varepsilon}^{2}\gamma\log n\right] \leq exp(-\left(\frac{(1-\varepsilon)(1-2\varepsilon)}{\varepsilon(7 -2\varepsilon)}\right)^{2}\mu/2)\] \[\leq exp(-\left(\frac{(1-\varepsilon)(1-2\varepsilon)}{\varepsilon(7 -2\varepsilon)}\right)^{2}c_{\varepsilon}^{2}\gamma\log n/2)\enspace.\] Finally, if we also ensure that \(c_{\varepsilon}\geq 6\left(\frac{(1-\varepsilon)(1-2\varepsilon)}{\varepsilon(7-2 \varepsilon)}\right)^{-2}\), \[\mathbf{Pr}\left[d_{H}(D(m_{w}),\tilde{y}_{v,w})\geq\frac{1+4\varepsilon }{6}c_{\varepsilon}^{2}\gamma\log n\right] \leq exp(-3c_{\varepsilon}\gamma\log n)\] \[\leq n^{-4c_{\varepsilon}\gamma}\enspace.\] We similarly wish to show that with high probability, \(d_{H}(D(m),\tilde{y}_{v,w})>\frac{(1+4\varepsilon)}{6}c_{\varepsilon}^{2} \gamma\log n\) (for \(m\neq m_{w}\)). Again, since we have set \(c_{\varepsilon}\geq\frac{60}{1-2\varepsilon}\), \[\frac{(1+4\varepsilon)}{6}c_{\varepsilon}=\frac{1+\varepsilon}{3}c_{ \varepsilon}-\frac{1-2\varepsilon}{6}c_{\varepsilon}<\frac{1+\varepsilon}{3}c _{\varepsilon}-5\] So, \[\frac{1+4\varepsilon}{6}c_{\varepsilon}^{2}\gamma\log n<\frac{1+\varepsilon}{3 }c_{\varepsilon}^{2}\gamma\log n-5c_{\varepsilon}\gamma\log n\leq\mu^{ \prime}\enspace.\] Then, we can apply a Chernoff bound: \[\mathbf{Pr}\left[d_{H}(D(m),\tilde{y}_{v,w})\leq\frac{(1+4 \varepsilon)}{6}c_{\varepsilon}^{2}\gamma\log n\right] \leq\mathbf{Pr}\left[d_{H}(D(m),\tilde{y}_{v,w})\leq\mu^{\prime} \cdot\frac{(1+4\varepsilon)c_{\varepsilon}}{6}\big{/}\left(\frac{1+ \varepsilon}{3}c_{\varepsilon}-5\right)\right]\] \[\leq exp(-\left(1-\frac{(1+4\varepsilon)c_{\varepsilon}}{2(1+ \varepsilon)c_{\varepsilon}-30}\right)^{2}\mu/3)\] \[\leq exp(-\left(\frac{(1-2\varepsilon)c_{\varepsilon}-30}{6 \varepsilon c_{\varepsilon}+30}\right)^{2}\mu/3)\] \[\leq exp(-\left(\frac{(1-\varepsilon)(1-2\varepsilon)}{\varepsilon (7-2\varepsilon)}\right)^{2}c_{\varepsilon}^{2}\gamma\log n/3)\] \[\leq exp(-2c_{\varepsilon}\gamma\log n)\] \[\leq n^{-2c_{\varepsilon}\gamma}\enspace.\] Taking a union bound over all strings in \(\{0,1\}^{\gamma\log n}\), we find that with probability at least \(1-n^{\gamma-2c_{\varepsilon}\gamma}\), \(d_{H}(D(m_{w}),\tilde{y}_{v,w})<\frac{1+4\varepsilon}{6}c_{\varepsilon}^{2} \gamma\log n\) and \(d_{H}(D(m),\tilde{y}_{v,w})>\frac{(1+4\varepsilon)}{6}c_{\varepsilon}^{2} \gamma\log n\) for all \(m\neq m_{w}\). So, \(v\) successfully decodes \(m_{w}\). Another union bound over all \(w\in N(v)\) gives probability at least \(1-n^{\gamma+1-2c_{\varepsilon}\gamma}\) that \(v\) correctly decodes the entire set \(\{m_{w}:w\in N(v)\}\). Finally, removing the conditioning on the event of Lemma 9 and taking a further union bound over all nodes \(v\), the probability that all nodes correctly decode their neighbors' messages is at least \(1-n^{\gamma+6-c_{\varepsilon}\gamma}\). We required that \[c_{\varepsilon}\geq\max\left\{\frac{30}{\varepsilon(1-2\varepsilon)},6\left( \frac{(1-\varepsilon)(1-2\varepsilon)}{\varepsilon(7-2\varepsilon)}\right)^{ -2}\right\}\enspace.\] Lemma 10 shows that Algorithm 1 successfully simulates a Broadcast CONGEST communication round with high probability. By simulating all communication rounds in sequence, we can simulate any \(n^{O(1)}\) Broadcast CONGEST in its entirety at an \(O(\Delta\log n)\) overhead. Note that essentially all Broadcast CONGEST (and CONGEST) algorithms are \(n^{O(1)}\)-round, since this is sufficient to inform all nodes of the entire input graph. So the only problems with super-polynomial round complexities would be those in which nodes are given extra input of super-polynomial size. We are not aware of any such problems having been studied, and therefore Theorem 11 applies to all problems of interest. **Theorem 11**.: _Any \(T=n^{O(1)}\)-round Broadcast CONGEST algorithm can be simulated in the noisy beeping model in \(O(T\Delta\log n)\) rounds, producing the same output with with probability at least \(1-n^{-2}\)._ Proof.: Each round of the Broadcast CONGEST algorithm, in which each node \(v\) broadcasts a \(\gamma\log n\)-bit message to all of its neighbors, is simulated using Algorithm 1 with sufficiently large constant \(c_{\varepsilon}\). By Lemma 10, each simulated communication round succeeds (has all nodes correctly decode the messages of their neighbors) with probability at least \(1-n^{\gamma+6-c_{\varepsilon}p\gamma}\). Taking a union bound over all \(T\) rounds, and choosing \(c_{\varepsilon}\) sufficiently large, gives a probability of at least \(1-n^{-2}\) that all simulated communication rounds succeed. In this case, the algorithm runs identically as it does in Broadcast CONGEST, and produces the same output. The running time of Algorithm 1 is \(O(\Delta\log n)\), so the overall running time is \(O(T\Delta\log n)\). We then reach an \(O(\Delta^{2}\log n)\)-overhead simulation for CONGEST. **Corollary 12**.: _Any \(T=n^{O(1)}\)-round CONGEST algorithm can be simulated in the noisy beeping model in \(O(T\Delta^{2}\log n)\) rounds, producing the same output with with probability at least \(1-n^{-2}\)._ Proof.: A \(T=n^{O(1)}\)-round CONGEST algorithm can be simulated in \(O(T\Delta)\) rounds in Broadcast CONGEST as follows: nodes first broadcast their IDs to all neighbors, and then each CONGEST communication round is simulated in \(\Delta\) Broadcast CONGEST rounds by having each node \(v\) broadcast \(\langle ID_{u},m_{v\to u}\rangle\) to its neighbors, for every \(u\in N(v)\) in arbitrary order. Then, by Theorem 11, this algorithm can be simulated in \(O(T\Delta^{2}\log n)\) rounds. ## 5 Lower bounds We now show lower bounds on the number of rounds necessary to simulate Broadcast CONGEST and CONGEST, based on the hardness of a simple problem we call \(B\)-bit Local Broadcast. We define the \(B\)-bit Local Broadcast problem as follows: **Definition 13** (\(B\)-Bit Local Broadcast).: _Every node \(v\) is equipped with a unique identifier \(ID_{v}\in[n]\). Every node \(v\) receives as input \(\{\langle ID_{u},m_{v\to u}\rangle:u\in N(v)\}\): that is, a set containing messages \(m_{v\to u}\in\{0,1\}^{B}\) for each of \(v\)'s neighbors \(u\), coupled with the ID of \(u\) to identify the destination node. Each node \(v\) must output the set \(\{\langle ID_{u},m_{u\to v}\rangle:u\in N(v)\}\) (i.e. the set of messages from each of its neighbors, coupled with their IDs)._ **Lemma 14**.: \(B\)_-Bit Local Broadcast requires \(\Omega(\Delta^{2}B)\) rounds in the beeping model (even without noise), for any algorithm succeeding with probability more than \(2^{-\frac{1}{2}\Delta^{2}B}\)._ Proof.: The graph we use as our hard instance is as follows: we take the complete bipartite graph \(K_{\Delta,\Delta}\), and add \(n-2\Delta\) isolated vertices. This graph then has \(n\) vertices and maximum degree \(\Delta\). Arbitrarily fix unique IDs in \([n]\) for each node. We will only consider the nodes of \(K_{\Delta,\Delta}\) to show hardness. Arbitrarily denote one part of the bipartition \(L\) and the other \(R\). For nodes \(v\in L\), we choose each \(m_{v\to u}\) independently uniformly at random from \(\{0,1\}^{B}\). We set all other \(m_{x\to x}\) to \(\mathbf{0}^{\log n}\) (so, in particular, the inputs for all nodes \(u\in R\) are identical). Let \(\mathcal{R}\) denote the concatenated strings of local randomness of all nodes in \(R\) (in any arbitrary fixed order). Then, the output of any node \(u\in R\) must be fully deterministically dependent on the node IDs (which are fixed), \(\mathcal{R}\), \(u\)'s input messages (which are identically fixed to be all \(\mathbf{0}\)s), and the pattern of beeps and silence of nodes in \(L\) (and note that all nodes in \(R\) hear the same pattern: a beep if an node in \(L\) beeps, and silence otherwise). An algorithm running for \(T\) rounds has \(2^{T}\) possible such patterns of beeps and silence. So, the overall output of all nodes in \(R\) must be one of \(2^{T}\) possible distributions, where the distribution is over the randomness of \(\mathcal{R}\). The correct output for these nodes is uniformly distributed over \(2^{\Delta^{2}B}\) possibilities (the choices of input messages for \(L\)). The probability of a correct output is therefore at most \(2^{T-\Delta^{2}B}\). So, any algorithm with \(T\leq\frac{1}{2}\Delta^{2}B\) succeeds with probability at most \(2^{-\frac{1}{2}\Delta^{2}B}\). Having shown a lower bound on the problem in the beeping model, upper bounds in Broadcast CONGEST and CONGEST imply lower bounds on the overhead of simulation. **Lemma 15**.: \(B\)_-Bit Local Broadcast can be solved deterministically in \(O(\Delta\lceil B/\log n\rceil)\) rounds of Broadcast CONGEST and in \(O(\lceil B/\log n\rceil)\) rounds of CONGEST._ Proof.: In Broadcast CONGEST, each node \(v\) simply broadcasts the strings \(\langle ID_{u},m_{v\to u}\rangle\) for each \(u\in N(v)\), taking \(O(\Delta\lceil B/\log n\rceil)\) rounds. In CONGEST, node \(v\) instead sends \(m_{v\to u}\) to node \(u\) for each \(u\in N(v)\), taking \(O(\lceil B/\log n\rceil)\) rounds. **Corollary 16**.: _Any simulation of Broadcast CONGEST in the noiseless beeping model (and therefore also the noisy beeping model) has \(\Omega(\Delta\log n)\) overhead. Any simulation of Broadcast CONGEST in the noiseless (and noisy) beeping model has \(\Omega(\Delta^{2}\log n)\) overhead._ ## 6 Application: Maximal Matching In this section we give an example application of our simulation, to the problem of maximal matching. The problem is as follows: we assume each node has a unique \(O(\log n)\)-bit ID. For a successful maximal matching, each node must either output the ID of another node, or Unmatched. The outputs must satisfy the following: * Symmetry: iff \(v\) outputs \(ID(u)\), then \(u\) outputs \(ID(v)\). Since each node outputs at most one ID, this implies that the output indeed forms a matching. * Maximality: for every edge \(\{u,v\}\) in the graph, \(u\) and \(v\) do not both output Unmatched. To our knowledge, no bespoke maximal matching algorithm has previously been designed for the beeping model (either noisy or noiseless) or for Broadcast CONGEST. So, the fastest existing beeping algorithm is obtained by simulating the best CONGEST algorithms using the simulation of [4]. Since an \(O(\Delta+\log^{*}n)\)-round CONGEST algorithm for maximal matching exists [26], the running time under [4]'s simulation is therefore \(O(\Delta^{4}\log n+\Delta^{3}\log n\log^{*}n)\). We show an \(O(\log n)\)-round Broadcast CONGEST algorithm for maximal matching, which our simulation then converts to an \(O(\Delta\log^{2}n)\)-round algorithm in the noisy beeping model, thereby improving the running time by around a \(\Delta^{3}/\log n\) factor. The base of our algorithm is Luby's algorithm for maximal independent set [25], which can be applied to produce a maximal matching (Algorithm 2). (Often this algorithm is stated with real sampled \(x(e)\) values from \([0,1]\); however, since we must communicate these values using \(O(\log n)\)-bit messages, we instead use integers from \([n^{9}]\). It can be seen that with probability at least \(1-n^{-4}\), no two of the values sampled during the algorithm are the same, so we can condition on this event for the rest of the analysis and avoid considering ties.) ``` for\(O(\log n)\) iterations, do Each edge \(e\) samples \(x(e)\) independently uniformly at random from \([n^{9}]\) Edge \(e\) joins the matching \(M\) if \(x(e)<x(e^{\prime})\) for all \(e^{\prime}\) adjacent to \(e\) Endpoints of edges in \(M\) drop out of the graph endfor ``` **Algorithm 2** Maximal Matching: Luby's Algorithm It is well-known (see [25]) that Luby's algorithm produces a maximal matching in \(O(\log n)\) rounds with high probability. To implement this in Broadcast CONGEST we must make some minor changes to account for the fact that it is nodes, not edges, that communicate (Algorithm 3). The aim of the algorithm is as follows: if, in a particular round \(i\), an edge \(\{u,v\}\) has a lower \(x(\{u,v\})\) value than all neighboring edges, the following process occurs. Its higher-ID endpoint (assume W.L.O.G. that this is \(u\)) first broadcasts \(\textsc{{Propose}}(\langle u,v\rangle,x(\{u,v\})\rangle\). The other endpoint \(v\) then broadcasts \(\textsc{{Reply}}\langle\{u,v\}\rangle\). Node \(u\) broadcasts \(\textsc{{Confirm}}\langle\{u,v\}\rangle\), and finally node \(v\) also broadcasts \(\textsc{{Confirm}}\langle\{u,v\}\rangle\). These Confirm messages cause nodes adjacent to \(u\) and \(v\) to be aware that \(u\) and \(v\) will be ceasing participation (because they have been matched), and so any edges to them can be discarded from the graph. ``` Each node \(v\) broadcasts its ID Let \(E_{v}\) be the set of \(v\)'s adjacent edges Let \(H_{v}\) be the set of \(v\)'s adjacent edges for which \(v\) the higher-ID endpoint for\(i=1\) to \(O(\log n)\), in round \(i\), do \(v\) samples \(x(e)\) independently uniformly at random from \([n^{9}]\) for each \(e\in H_{v}\) \(v\) broadcasts \(\textsc{Propose}\langle e_{v},x(e_{v})\rangle\), where \(x(e_{v})\) is the unique minimum of \(v\)'s sampled values (if it exists) Let \(e^{\prime}_{v}\) be the edge with the minimum \(x(e^{\prime}_{v})\) for which \(v\) received \(\textsc{Propose}\langle e^{\prime}_{v},x(e^{\prime}_{v})\rangle\) if\(x(e^{\prime}_{v})<x(e_{v})\)then \(v\) broadcasts \(\textsc{Reply}\langle e^{\prime}_{v}\rangle\) endif if\(v\) received \(\textsc{Reply}\langle e_{v}\rangle\) and did not broadcast a \(\textsc{Reply}\)then \(v\) broadcasts \(\textsc{Confirm}\langle e_{v}\rangle\) \(v\) outputs \(e_{v}\in MM\) and ceases participation endif if\(v\) received \(\textsc{Confirm}\langle e^{\prime}_{v}\rangle\)then \(v\) broadcasts \(\textsc{Confirm}\langle e^{\prime}_{v}\rangle\) \(v\) outputs \(e^{\prime}_{v}\in MM\) and ceases participation endif if\(v\) received \(\textsc{Confirm}\langle\{w,z\}\rangle\) for any \(w,z\neq v\)then \(v\) removes \(\{w,v\}\) and \(\{z,v\}\) from \(E_{v}\) and \(H_{v}\) (if present). endif if\(E_{v}\) is empty then \(v\) ceases participation endif endfor ``` **Algorithm 3** Maximal Matching in Broadcast CONGEST **Lemma 17**.: _If Algorithm 3 terminates (i.e. causes all nodes to cease participation), it outputs a maximal matching._ Proof.: We first prove maximality. Nodes only cease participation when they are adjacent to an edge in \(MM\), or when they have no remaining adjacent edges. Edges are only removed when they are adjacent to an edge in \(MM\). So, upon termination, there are no edges in the original graph that are neither in \(MM\) nor adjacent to an edge in \(MM\), and therefore \(MM\) is a maximal matching. We now prove independence. Let \(\{u,v\}\) be an edge which is added to \(MM\) in round \(i\), and assume W.L.O.G. that \(u\) is the higher-ID endpoint. It is clear that, since \(\{u,v\}\) is added to \(MM\), we must have the behavior described above (\(u\) broadcasts \(\textsc{Propose}\langle\{u,v\},x(\{u,v\})\rangle\), \(v\) broadcasts \(\textsc{Reply}\langle\{u,v\}\rangle\), \(u\) broadcasts \(\textsc{Confirm}\langle\{u,v\}\rangle\), \(v\) broadcasts \(\textsc{Confirm}\langle\{u,v\}\rangle\)). Then, we can show that this behavior pattern excludes the possibility that any adjacent edge also joins \(MM\) in round \(i\): 1. \(u\) cannot act as the higher-ID endpoint of any other edge joining \(MM\), since it only \(\textsc{Proposes}\ \{u,v\}\). 2. \(u\) cannot act as the lower-ID endpoint of any other edge joining \(MM\), since it \(\textsc{Confirms}\) an edge it \(\textsc{Proposed}\), and therefore cannot have broadcast any \(\textsc{Reply}\). 3. \(v\) cannot act as the higher-ID endpoint of any other edge joining \(MM\), since it broadcasts a \(\textsc{Reply}\) and therefore does not \(\textsc{Confirm}\langle e_{v}\rangle\). 4. \(v\) cannot act as the lower-ID endpoint of any other edge joining \(MM\), since only broadcasts \(\textsc{Reply}\langle\{u,v\}\rangle\), and does not \(\textsc{Reply}\) for any other edge. So, no adjacent edge to \(\{u,v\}\) can join in round \(i\). Furthermore, all nodes adjacent to \(u\) and \(v\) receive a Confirm\(\langle\{u,v\}\rangle\) message and therefore all other edges adjacent to \(u\) and \(v\) are removed from the graph. So, no edge adjacent to \(\{u,v\}\) can be added to \(MM\) in future rounds either. This guarantees that \(MM\) is an independent set of edges. **Notation 18**.: _We will use the notation \(e\sim e^{\prime}\) to mean \(e\cap e^{\prime}\neq\emptyset\), i.e., \(e^{\prime}\) shares at least one endpoint with \(e\) (and can be \(e\) itself). We will denote \(|\{e^{\prime}\in E:e\sim e^{\prime}\}|\) by \(d(e)\), i.e. the number of adjacent edges of \(e\), including \(e\) itself._ **Lemma 19**.: _In any particular round \(i\), the expected number of edges removed from the graph is at least \(\frac{m}{2}\)._ This lemma refers to the _current_ graph at round \(i\), i.e. without all edges and nodes that have been removed in previous rounds, and \(m\) is accordingly the number of edges in the current graph. Proof.: It is easy to see that, as intended, an edge \(\{u,v\}\) is added to \(MM\) if it has a lower \(x(\{u,v\})\) value than all neighboring edges: its higher-ID endpoint (W.L.O.G. \(u\)), which sampled the value \(x(\{u,v\})\), will denote the edge as \(e_{u}\) and Propose it, the \(x(\{u,v\})\) value will be lower than that for which \(v\)Proposed and so \(v\) will Reply\(\langle\{u,v\}\rangle\), and \(u\) will not hear a lower-valued edge to Reply and will therefore Confirm\(\langle\{u,v\}\rangle\). \(v\) will also Confirm\(\langle\{u,v\}\rangle\), and all edges adjacent to \(\{u,v\}\) will be removed from the graph. There are \(d(u)+d(v)-1\) such edges. The probability that \(x(\{u,v\})<x(e)\) for all \(e\sim\{u,v\}\) with \(e\neq\{u,v\}\) is \(\frac{1}{d(u)+d(v)-1}\). So, the expected number of edges removed from the graph is at least \(\frac{1}{2}\sum_{\{u,v\}\in E}(d(u)+d(v)-1)\frac{1}{d(u)+d(v)-1}=\frac{m}{2}\) (where the \(\frac{1}{2}\) factor arises since each end can be removed by either of its endpoints being matched, so is double-counted in the sum). **Lemma 20**.: _Algorithm 3 performs maximal matching in \(O(\log n)\) rounds of Broadcast CONGEST, succeeding with high probability._ Proof.: By Lemma 17, Algorithm 3 produces a maximal matching if it terminates. Conditioning on the event that all sampled values are distinct, the algorithm removes at least half of the edges in the graph in each iteration in expectation. After \(4\log n\) iterations, therefore, the expected number of edges remaining is at most \(n^{2}\cdot n^{-4}=n^{-2}\), and therefore by Markov's inequality, with probability at least \(1-n^{-2}\) the number of edges remaining is \(0\) and the algorithm has terminated. Removing the conditioning on the event that sampled values are distinct, the algorithm terminates with probability at least \(1-n^{-2}-n^{-4}\). **Theorem 21**.: _Maximal matching can be performed in \(O(\Delta\log^{2}n)\) rounds in the noisy beeping model, succeeding with high probability._ Proof.: Follows from applying Theorem 11 to Lemma 20. This is close to optimal, since we show an \(\Omega(\Delta\log n)\) bound even in the noiseless model: **Theorem 22**.: _Maximal matching requires \(\Omega(\Delta\log n)\) rounds in the (noiseless) beeping model, to succeed with any constant probability._ Proof.: Our hard ensemble of instances is as follows: the underlying graph will be \(K_{\Delta,\Delta}\), the complete bipartite graph with \(\Delta\) vertices in each part. Each node's ID will be drawn independently at random from \([n^{4}]\). Arbitrarily naming the two parts of the graph left and right, we consider the outputs of nodes on the right. For a correct output to maximal matching, each node on the right must uniquely output the ID of a node on the left, and so the union of outputs of the right part must be the list of IDs of the right part. The number of possible such lists (even assuming that IDs are all unique and the IDs of the right side are fixed) is \(\binom{n^{4}-\Delta}{\Delta}\geq\binom{\frac{1}{2}n^{4}}{\Delta}\geq\left(\frac {n^{4}}{2\Delta}\right)^{\Delta}\geq n^{3\Delta}\). We note that each right node's output must be dependent only on its ID, its local randomness, and the transcript of communication performed by left nodes during the course of the algorithm. Since the graph is a complete bipartite graph, in each round there are only two discernable possibilities for communication from the perspective of right-part nodes: either at least one left node beeps, or none do. So, the transcript for an \(r\)-round algorithm can be represented as a sequence \(\{B,S\}^{r}\), corresponding to hearing a beep or silence in each round. There are \(2^{r}\) such transcripts. Therefore, the union of output from right nodes depends solely on the randomness of right nodes, the IDs of left nodes, and the transcript. Of these, only the transcript can depend on left nodes' IDs. Each transcript therefore induces a distribution of right-part outputs (over the randomness of right-side IDs and local randomness. There must be some set of left-part IDs such that under any transcript, the probability that the right-side nodes correctly output that set is at most \(2^{r}/n^{3\Delta}\). So, if \(r\leq\Delta\log n\), then the probability that the right part produces a correct output on this instance is at most \(n^{\Delta}/n^{3\Delta}=n^{-2\Delta}=o(1)\). ## 7 Conclusions We have presented an optimal method for simulating Broadcast CONGEST and CONGEST in the noisy (and noiseless) beeping model. We have also presented, as an example, a maximal matching algorithm which requires \(O(\log n)\) rounds in Broadcast CONGEST, and which, using our simulation, can therefore be run in \(O(\Delta\log^{2}n)\) rounds in the noisy beeping model. While our general simulation method is optimal, there is still room for improvement for many specific problems in the beeping model, and the complexity picture has significant differences from the better-understood message passing models. For example, in CONGEST, the problems of maximal matching and maximal independent set have similar \(O(\log\Delta+\log^{O(1)}\log n)\) randomized round complexity upper bounds [5, 15, 18, 27], whereas in the beeping model, maximal independent set can be solved in \(\log^{O(1)}n\) rounds [1] while maximal matching requires \(\Omega(\Delta\log n)\) (Theorem 22). In general, the question of which problems can be solved in \(O(\log^{O(1)}n)\) rounds in the beeping model, and which require \(poly(\Delta)\) factors, remains mostly open.

2306.04495

Limits, approximation and size transferability for GNNs on sparse graphs via graphops

Can graph neural networks generalize to graphs that are different from the graphs they were trained on, e.g., in size? In this work, we study this question from a theoretical perspective. While recent work established such transferability and approximation results via graph limits, e.g., via graphons, these only apply non-trivially to dense graphs. To include frequently encountered sparse graphs such as bounded-degree or power law graphs, we take a perspective of taking limits of operators derived from graphs, such as the aggregation operation that makes up GNNs. This leads to the recently introduced limit notion of graphops (Backhausz and Szegedy, 2022). We demonstrate how the operator perspective allows us to develop quantitative bounds on the distance between a finite GNN and its limit on an infinite graph, as well as the distance between the GNN on graphs of different sizes that share structural properties, under a regularity assumption verified for various graph sequences. Our results hold for dense and sparse graphs, and various notions of graph limits.

Thien Le, Stefanie Jegelka

2023-06-07T15:04:58Z

http://arxiv.org/abs/2306.04495v1

# Limits, approximation and size transferability for GNNs on sparse graphs via graphops ###### Abstract Can graph neural networks generalize to graphs that are different from the graphs they were trained on, e.g., in size? In this work, we study this question from a theoretical perspective. While recent work established such transferability and approximation results via graph limits, e.g., via graphons, these only apply nontrivially to dense graphs. To include frequently encountered sparse graphs such as bounded-degree or power law graphs, we take a perspective of taking limits of operators derived from graphs, such as the aggregation operation that makes up GNNs. This leads to the recently introduced limit notion of graphops (Backhausz and Szegedy, 2022). We demonstrate how the operator perspective allows us to develop quantitative bounds on the distance between a finite GNN and its limit on an infinite graph, as well as the distance between the GNN on graphs of different sizes that share structural properties, under a regularity assumption verified for various graph sequences. Our results hold for dense and sparse graphs, and various notions of graph limits. ## 1 Introduction Since the advent of graph neural networks (GNNs), deep learning has become one of the most promising tools to address graph-based learning tasks (Gilmer et al., 2017; Scarselli et al., 2009; Kipf and Welling, 2017; Bronstein et al., 2017). Following the mounting success of applied GNN research, theoretical analyses have been following. For instance, many works study GNNs' representational power (Azizian and Lelarge, 2021; Morris et al., 2019; Xu et al., 2019, 2020; Garg et al., 2020; Chen et al., 2020; Maron et al., 2019; Loukas, 2020, 2020; Abboud et al., 2021). A hitherto less addressed question of practical importance is the possibility of size generalization, i.e., transferring a learned GNN to graphs of different sizes (Ruiz et al., 2020; Levie et al., 2022; Xu et al., 2021; Yehudai et al., 2021; Chuang and Jegelka, 2022; Roddenberry et al., 2022), especially for sparse graphs. For instance, it would be computationally desirable to train a GNN on small graphs and apply it to large graphs. This question is also important to judge the reliability of the learned model on different test graphs. To answer the size generalization question, we need to understand under which conditions such transferability is possible - since it may not always be possible (Xu et al., 2021; Yehudai et al., 2021; Jegelka, 2022) - and what output perturbations we may expect. For a formal analysis of perturbations and conditions, we need a suitable graph representation that captures inductive biases and allows us to compare models for graphs of different sizes. _Graph limits_ can help to formalize this, as they help understand biases as the graph size tends to infinity. Formally, _approximation theory_ asks for bounds between a GNN on a finite graph and its infinite counterpart, while _transferability_ compares model outputs on graphs of different sizes. The quality of the bounds depends on how the two GNNs (and corresponding graphs) are intrinsically linked, in particular, to what extent the graphs share relevant structure. This yields conditions for size generalization. For example, the graphs could be sampled from the same graph limit (Ruiz et al., 2020) or from the same random graph model (Keriven et al., 2020). In particular, Ruiz et al. (2020) study approximation and transferability via the lens of _graphons_(Lovasz, 2012; Lovasz and Szegedy, 2006), which characterize the limits of _dense_ graphs. Yet, many real-world graphs are not dense, for instance, planar traffic networks, power law graphs, Hamming graphs (including hypercubes for error-correcting code), or grid-like graphs e.g., for images. For _sparse_ graphs, the correct notion of limit suitable for deep learning is still an open problem, as typical bounded-degree graph limits such as the Benjamini-Schramm limit of random rooted graphs (Benjamini and Schramm, 2001), or graphings (Lovasz, 2012) are less well understood and often exhibit pathological behaviors (see Section 2.1). Limits of intermediate graphs, such as the hypercubes, are even more obscure. Hence, understanding limits, inductive biases and transferability of GNNs for sparse graphs remains an open problem in understanding graph representation learning. This question is the focus of this work. To obtain suitable graph limits for sparse graphs and to be able to compare GNNs on graphs of different sizes while circumventing challenges of sparse graph limits, we view a graph as an _operator_ derived from it. This viewpoint is naturally compatible with GNNs, as they are built from convolution/aggregation operations. We show how the operator perspective allows us to define limits of GNNs for infinite graphs. We achieve this by exploiting the recently defined notion of _graphop_, which generalizes graph shift operators, and the _action convergence_ defined in the space of graphops (Backhausz and Szegedy, 2022). Our definition of GNN limits enables us to prove rigorous bounds for approximation and transferability of GNNs for sparse graphs. Since graphops encompass both graphons and graphings, we generalize similar bounds for graphon neural networks (Ruiz et al., 2020) to a much wider set of graphs. Yet, using graphops requires technical work. For instance, we need to introduce an appropriate discretization of a graphop to obtain its corresponding finite graph shift operators. We use these operators to define a generalized graphop neural network that acts as a limit object, with discretizations that become finite GNNs. Then we prove approximation and transferability results for both the operators (graphops and their discretizations) and GNNs. **Contributions.** To the best of our knowledge, this is the first paper to provide approximation and transferability theorems specifically for sparse graph limits. Our main tool, graphops, has not been used to study GNNs before, although viewing graphs as operators is a classic theme in the literature. Our specific contributions are as follows: 1. We define a _graphop convolution_, i.e., an operator that includes both finite graph convolutions and a limit version that allows us to define a limit object for GNNs applied to graphs of size \(n\to\infty\). 2. We rigorously prove an approximation theorem (Theorem 2) that bounds a distance between a graphop \(A\) (acting on infinite-dimensional \(\Omega\)) and its discretization \(A_{n}\) (acting on \(\mathbb{R}^{n}\)), in the \(d_{M}\) metric introduced by Backhausz and Szegedy (2022). To do so, we introduce an appropriate discretization. Our result applies to a more general set of nonlinear operators, and implies a transferability bound between finite graphs (discretizations) of different sizes. 3. For neural networks, we present a quantitative approximation and transferability bound that guarantees outputs of graphop neural networks are close to those of the corresponding GNNs (obtained from discretization). ### Related work The closest related work is (Ruiz et al., 2020), which derives approximation and transferability theorems for _graphon_ neural networks, i.e., _dense_ graphs. For graphons, the convolution kernel has a nice spectral decomposition, which is exploited by Ruiz et al. (2020). In contrast, _sparse_ graph limits are not known to enjoy nice convergence of the spectrum (Backhausz and Szegedy, 2022; Aldous and Lyons, 2007), so we need to use different techniques. Since the notion of graphop generalizes both dense graph limits and certain sparse graph limits, our results apply to dense graphs as well. Our assumptions and settings are slightly different from Ruiz et al. (2020). For instance, they allow the convolution degree \(K\to\infty\) and perform the analysis in the spectral domain, whereas our \(K\) is assumed to be a fixed finite constant. As a result, their bound has better dependence of \(O(1/n)\) on \(n\)-the resolution of discretization, but does not go to \(0\) as \(n\to\infty\). Ours have extra dependence on \(K\) and a slower rate of \(O(n^{-1/2}\) but our bounds go to \(0\) as \(n\to\infty\). Other works use other notions than graph limits to obtain structural coherence. Levie et al. (2022) obtain a transferability result for spectral graph convolution networks via analysis in frequency domains. They sample finite graphs from general topologies as opposed to a graph limit. Their graph signals are _assumed_ to have finite bandwidth while ours is only assumed to be in \(L^{2}\). Their signal discretization scheme is assumed to be close to the continuous signals, while ours is proven to be so. Roddenberry et al. (2022) address sparse graphs and give a transferability bound between the loss functions of two random rooted graphs. However, the metric under which they derive their result is rather simple: if the two graphs are not isomorphic then their distance is constant, otherwise, they use the Euclidean metric between the two graph signals. This metric hence does not capture combinatorial, structural differences of functions on non-isomorphic graphs. To study transferability, Keriven et al. (2020) sample from standard random graph models, as opposed to a graph limit, resulting in a bound of order \(O(n^{-1/2})\), which is similar to ours. They also need an assumption on the closeness of the graph signal. ## 2 Background NotationLet \(\mathbb{N}\) be \(\{1,2,\ldots\}\) and write \([n]=\{1,\ldots,n\}\) for any \(n\in\mathbb{N}\). For a scalar \(\alpha\in\mathbb{R}\) and a set \(S\subset\mathbb{R}\), let \(\alpha S=\{\alpha s:s\in S\}\). The abbreviation a.e. stands for 'almost everywhere'. For a measure space \((\Omega,\mathcal{B},\mu)\) and \(p\in[1,\infty]\), denote by \(L^{p}(\Omega)\) the corresponding \(L^{p}\) function spaces with norm \(\|\cdot\|_{p}:f\mapsto(\int_{\Omega}|f|^{p}d\mu)^{1/p}\). For any \(p,q\in[1,\infty]\), define the operator norms \(\|\cdot\|_{p\to q}:A\mapsto\sup_{v\in L^{\infty}}\|vA\|_{q}/\|v\|_{p}\). For function spaces, we use \(\mathcal{F}=L^{2}([0,1])\) and \(\mathcal{F}_{n}=L^{2}([n]/n)\), for any \(n\in\mathbb{N}\). For any \(L^{p}\) space \(\mathcal{H}\), denote by \(\mathcal{H}_{[-1,1]}\) the restriction to functions with range in \([-1,1]\) a.e. and \(\mathcal{H}_{\text{Lip}(L)}\) the restriction to functions that are \(L\)-Lipschitz a.e. and \(\mathcal{H}_{\text{reg}(L)}=\mathcal{H}_{[-1,1]}\cap\mathcal{H}_{\text{Lip}( L)}\). Graph neural networks (GNNs)GNNs are functions that use graph convolutions to incorporate graph structure into neural network architectures. Given a finite graph \(G=(V,E)\) and a function \(X:V\to\mathbb{R}\) (called _graph signal_ or _node features_), a GNN \(\Phi_{F}\) (\(F\) for 'finite') with \(L\) layers, \(n_{i}\) neurons at the \(i\)-th layer, nonlinearity \(\rho\) and learnable parameters \(h\), is: \[\Phi_{F}(h,G,X) =X_{L}(h,G,X), \tag{1}\] \[\left[X_{l}(h,G,X)\right]_{f} =\rho\bigg{(}\sum_{g=1}^{n_{l-1}}A_{l,f,g}(h,G)[X_{l-1}]_{g}\bigg{)},\qquad l\in[L],f\in[n_{l}]\] (2) \[X_{0}(h,G,X) =X, \tag{3}\] where \([X_{l}]_{f}\) is the output of the \(f\)-th neuron in the \(l\)-th layer, which is another graph signal. The input graph information is captured through order \(K\)_graph convolutions_\(A_{l,f,g}(h,G):=\sum_{k=0}^{K}h_{l,f,g,k}GSO(G)^{k}\), where \(GSO(G)\) is a _graph shift operator_ corresponding to \(G\) -- popular examples include the adjacency matrix or the Laplacian (Kipf and Welling, 2017; Levie et al., 2022). The power notation is the usual matrix power, while the notation \(h_{l,f,g,k}\) highlights that there is a learnable parameter for each convolution order \(k\), between each neuron \(f\) and \(g\) from layer \(l-1\) to layer \(l\) of the neural network. Thus, the number of learnable parameters in a GNN does not depend on the number of vertices of the graph used to form the GSO. ### Graph limits Graph limit theory involves embedding discrete graphs into spaces with rich underlying topological and/or geometric structures and studying the behavior of convergent (e.g. in size) graph sequences. Dense graphsA popular example of graph limits are graphons - symmetric \(L^{1}([0,1]^{2})\) (Lebesgue-measurable) functions whose value at \((x,y)\) can be thought of (intuitively) as the weight of the \(xy\)-edge in a graph with vertices in \([0,1]\). When equipped with the _cut metric_ (see Appendix A for the exact definition), it contains limits of convergent sequences of dense graphs. Convergence in this space is dubbed _dense graph convergence_ because for any \(W\in L^{1}([0,1]^{2}),\|W\|_{\square}=0\) iff \(W=0\) outside a set of Lebesgue measure \(0\). This implies that graphs with a subquadratic number of edges, such as grids or hypercubes, are identified with the empty graph in the cut norm. Dense graph convergence is very well understood theoretically and is the basis for recent work on GNN limits (Ruiz et al., 2020). Sparse graphsThere are two notions of limits that are deemed suitable for bounded-degree graph convergence in the literature. The first, _graphing_(Lovasz, 2012), is a direct counterpart of a graphon. Recall that graphons are not suitable for sparse graphs because the Lebesgue measure on \(L^{2}([0,1]^{2})\) is not fine enough to detect edges of bounded-degree graphs. Therefore, one solution is to consider other measure spaces. Graphings are quadruples \((V,\mathcal{A},\lambda,E)\) where \(V\) and \(E\) are interpreted as the usual vertex and edge sets and \((V,\mathcal{A},\lambda)\) together form a Borel measure such that \(E\) is in \(\mathcal{A}\times\mathcal{A}\) satisfying a symmetry condition. While Lebesgue measures are constructed from a specific topology of open sets on \(\mathbb{R}\), for graphings, we are allowed the freedom to choose a different topological structure (for instance a _local topology_) on \(V\). The definition of graphings is theoretically elegant but harder to work with since the topological structures are stored in the \(\sigma\)-algebra. A second way to embed bounded-degree graphs, Benjamini-Schramm limits (Benjamini and Schramm, 2001), uses distributions over random rooted graphs. Roughly speaking, for each \(k\in\mathbb{N}\), one selects a root uniformly at random from the vertex set in the graph and considers the induced subgraph of vertices that are at distance at most \(k\) from the root. The randomness of the root induces a distribution over the set of rooted graphs of radius \(k\) from the root. Graphings and distributions of random rooted graphs are intimately connected, but their connection to convergent bounded-degree graph sequences is not well-understood. For example, a famous open conjecture by Aldous and Lyons (2007) asks whether all graphings are weak local limits of some sequence of bounded-degree graphs. The unresolved conjecture of Aldous and Lyons means that one cannot simply take an arbitrary graphing and be guaranteed a finite bounded-degree graph sequence converging to said graphing, which is the main approach in Ruiz et al. (2020) for dense graphs. A self-contained summary of graphings within the scope of this paper is provided in Appendix C. Infinite paths and cycles also have nice descriptions in terms of graphings (also in Appendix C), which we will use in our constructions for Lemma 2. ### Graphops and comparing across graph sizes More recently, Backhausz and Szegedy (2022) approach graph limits from the viewpoint of limits of operators, called _graphops_. This viewpoint is straightforward for finite graphs: both the adjacency matrix and Laplacian, each defining a unique graph, are linear operators on \(\mathbb{R}^{\#\text{vertices}}\). Moreover, viewing graphs as operators is exactly what we do with GSOs and graph convolutions. Hence, graphop seems to be an appropriate tool to study GNN approximation and transferability. On the other hand, there are challenges with this approach: being related to graphings, they inherit some of graphings' limitations, such as the conjecture of Aldous and Lyons (2007). Moreover, to understand GNN transferability from size \(m\) to \(n\), one needs to compare an \(m\times m\) matrix with an \(n\times n\) matrix, which is nontrivial. This is done by comparing their actions on \(\mathbb{R}^{m}\) versus \(\mathbb{R}^{n}\). It turns out that these actions, under an appropriate metric, define a special mode of operator convergence called _action convergence_. The resulting limit objects are well-defined and nontrivial for sparse graphs and intermediate graphs, while also generalizing dense graphs limits. We will describe this mode of convergence, the corresponding metric, and our own relaxation of it later in this section. We now describe how graphs of different sizes can be compared through the actions of their corresponding operators on some function spaces. Nonlinear \(P\)-operatorsFor an \(n\)-vertex graph, its adjacency matrix, Laplacian, or Markov kernel of random walks are examples of linear operators on \(L^{p}([n]/n)\). To formally generalize to the infinite-vertex case, Backhausz and Szegedy (2022) use \(P\)_-operators_, which are linear operators from \(L^{\infty}(\Omega)\) to \(L^{1}(\Omega)\) with finite \(\|A\|_{\infty\to 1}\). In this paper, we further assume they have finite \(\|\cdot\|_{2\to 2}\) norm but are not necessarily linear. We address these deviations in Section 4.4. Graphops\(P\)-operators lead to a notion of graph limit that applies to both dense and sparse graphs. _Graphops_(Backhausz and Szegedy, 2022) are positivity-preserving (action on positive functions results in positive functions), self-adjoint \(P\)-operators. Adjacency matrices of finite graphs, graphons (Lovasz and Szegedy, 2006), and graphings (Lovasz, 2012) are all examples of graphops. Changing the positivity-preserving requirement to positiveness allows one to consider Laplacian operators. \((k,L)\)-profile of a \(P\)-operatorActions of graphops are formally captured through their \((k,L)\)-profiles, and these will be useful to compare different graphops. Pick \(k\in\mathbb{N}\), \(L\in[0,\infty]\) and \(A\) a \(P\)-operator on \((\Omega,\mathcal{B},\mu)\). Intuitively, we will take \(k\) samples from the space our operators act on, apply our operator to get \(k\) images, and concatenate samples and images into a joint distribution on \(\mathbb{R}^{2k}\), which gives us one element of the profile. For instance, for \(n\)-vertex graphs, the concatenation results in a matrix \(M\in\mathbb{R}^{n\times 2k}\), so each joint distribution is a sum (over rows of \(M\)) of \(n\) Dirac distributions. In the limit, the number of atoms in each element of the profile increases, and the measure converges (weakly) to one with density. More formally, denote by \(\mathcal{D}(v_{1},\dots,v_{k})\) the pushforward of \(\mu\) via \(x\mapsto(v_{1}(x),\dots,v_{k}(x))\) for any tuple \((v_{i})_{i\in[k]}\in L^{2}(\Omega)\). The \((k,L)\)-_profile_ of \(A\) is: \[\mathcal{S}_{k,L}(A):=\{\mathcal{D}(v_{1},\dots,v_{k},Av_{1},\dots,Av_{k}):v_{ i}\in L^{\infty}_{\text{reg}(L)}(\Omega),i=1\dots k\}. \tag{4}\] Formally, denote by \(\mathcal{P}(\mathbb{R}^{k})\) the set of Borel probability distributions over \(\mathbb{R}^{2k}\). Regardless of the initial graph size, or the space on which the operators act, \((k,L)\)-profiles of \(A\) are always some subsets of \(\mathcal{P}(\mathbb{R}^{2k})\) which allow us to compare operators acting on different spaces. Convergence of \(P\)-operatorsWe compare two profiles (closed subsets \(X,Y\subset\mathcal{P}(\mathbb{R}^{2k})\)) via a Hausdorff metric \(d_{H}(X,Y):=\max(\sup_{x\in X}\inf_{y\in Y}d_{LP}(x,y),\sup_{y\in Y}\inf_{x \in X}d_{LP}(x,y))\). Here, \(d_{LP}\) is the Levy-Prokhorov metric on \(\mathcal{P}(\mathbb{R}^{2k})\) (see exact definition in Appendix A), which metrizes weak convergence of Borel probability measures, and translates action convergence to weak convergence of measures. Finally, given any two \(P\)-operators \(A,B\), we can compare their profiles across all different \(k\) at the same time as \[d_{M}(A,B):=\sum_{k=1}^{\infty}2^{-k}d_{H}(\mathcal{S}_{k,L}(A),\mathcal{S}_{ k,L}(B)). \tag{5}\] Intuitively, we allow \(d_{H}\) to grow subexponentially in \(k\) by the scaling \(2^{-k}\). Our definition of profile slightly differs from that of Backhausz and Szegedy (2022), using \(\mathbb{L}^{\infty}_{\text{reg}(L)}\) instead of their \(L^{\infty}_{[-1,1]}\). However, we will justify this deviation in Section 4.4, Theorem 4: by letting \(L\) grow slowly in \(n\), we recover the original limits in Backhausz and Szegedy (2022). This _action convergence_ turns out to be one of the 'right' notions of convergence that capture both sparse and dense graph limits, as well as some intermediate density graphs: **Theorem 1** (Theorem 1.1 Backhausz and Szegedy (2022)).: _Convergence under \(d_{M}\) is equivalent (results in the same limit) to dense graph convergence when restricted to graphons and equivalent to local-global convergence when restricted to graphings._ ## 3 Graphop neural networks Graph limits allow us to lift finite graphs onto the richer space of graphops to discuss convergent graph sequences \(G_{i}\to G\). For finite GNNs (Eqn (2)), fixing the graph input \(G_{i}\) and learnable parameter \(h\) results in a function \(\Phi_{F}(h,G_{i},\cdot)\) that transforms the input graph signal (node features) into an output graph signal. The transferability question asks how similar \(\Phi_{F}(h,G_{i},\cdot)\) is to \(\Phi_{F}(h,G_{j},\cdot)\) for some \(i\neq j\). In our approach using approximation theory, we will compare both functions to the limiting function on \(G\). This is done by an appropriate lift of the GNN onto a larger space that we call _graphop neural networks_. We then introduce a discretization scheme of graphop neural networks to obtain finite GNNs, similar to graphon sampling (Ruiz et al., 2020) and sampling from topological spaces (Levie et al., 2022). Finally, Lemma 1 asserts that, restricted to self-adjoint \(P\)-operators, discretizations of graphops are indeed graph shift operators (GSOs). ### Convolution and graphop neural networks Similar to how GSOs in a GNN act on graph signals, graphops act on some \(L^{2}\) signals (called _graphop signals_). The generalization is straightforward: replacing GSOs in the construction of the GNN in Eqn. (2) with graphops results in _graphop convolution_ and replacing graph convolution with graphop convolution gives _graphop neural networks_. Formally, fix a maximum order \(K\in\mathbb{N}\). For some measure space \((\Omega,\mathcal{B},\mu)\), select a graphop \(A:L^{2}(\Omega)\to L^{2}(\Omega)\) and a graphop signal \(X\in L^{2}(\Omega)\). We define a _graphop convolution_ operator as a weighted sum of at most \(K-1\) applications of \(A\): \[H(h,A)[X]:=\sum_{k=0}^{K-1}(h_{k}A^{k})[X], \tag{6}\] where \(h\in\mathbb{R}^{K}\) are (learnable) filter parameters and \(A^{k}\) is the composition of \(k\) duplicates of \(A\). The square bracket \([v]_{i}\) indicates the \(i\)-th entry of a tuple \(v\). For some number of layers \(L\in\mathbb{N},\{n_{i}\}_{i\in[L]}\in\mathbb{N},n_{0}:=1\), define a _graphop neural network_\(\Phi\) with \(L\) layers and \(n_{i}\) features in layer \(i\) as: \[\Phi(h,A,X) =X_{L}(h,A,X), \tag{7}\] \[X_{l}(h,A,X) =\left[\rho\bigg{(}\sum_{g=1}^{n_{l-1}}H(h_{f,g}^{l},A)[X_{l-1}]_ {g}\bigg{)}\right]_{f\in[n_{l}]},\qquad l\in[L],\] (8) \[X_{0}(h,A,X) =X \tag{9}\] with filter parameter tuple \(h=(h^{1},\ldots,h^{L})\), \(h^{l}\in(\mathbb{R}^{K})^{n_{l}\times n_{l-1}}\) for any \(l\in[L]\), and graphop signal tuple \(X_{l}\in(L^{2}(\Omega))^{n_{l}}\) for any \(l\in[L]\cup\{0\}\). Eqn (8) and Eqn (2) are almost identical, with the only difference being the input/output space: graphops replacing finite graphs, and graphop signals replacing graph signals. ### From graphop neural networks to finite graph neural networks We are specifically interested in finite GNNs that are discretizations of a graphop (for instance finite grids as discretizations of infinite grids), so as to obtain a quantitative bound that depends on the resolution of discretization. To sample a GNN from a given graphop \(A:\mathcal{F}\to\mathcal{F}\), we first sample a GSO and plug it into Eqn (2). Choose a resolution \(m\in\mathbb{N}\) and define the GSO \(A_{m}\), for any graph signal \(X\in\mathcal{F}_{m}\) as: \[A_{m}X(v) :=m\int_{v-\frac{1}{m}}^{v}(A\widetilde{X})\text{d}\lambda, \qquad v\in[m]/m, \tag{10}\] \[\Phi_{m}(h,A,X) :=\Phi(h,A_{m},X), \tag{11}\] where graphop signal \(\widetilde{X}\in\mathcal{F}\) is an extension of graph signal \(X\in\mathcal{F}_{m}\) defined as \[\widetilde{X}(u):=X\left(\frac{\lceil um\rceil}{m}\right),\qquad u\in[0,1]. \tag{12}\] Intuitively, to find the image of the sampled GSO \(A_{m}\) when applied to a graph signal \(X\), we transform the graph signal into a graphop signal \(\tilde{X}\) by using its piecewise constant extension. We then apply the given \(A\) to \(\tilde{X}\) to get an output graphop signal on \(L^{2}([0,1])\). Discretizing this graphop signal by dividing the domain \([0,1]\) into \(m\) partitions of equal size and integrating over each partition, one gets a graph signal on \(\mathcal{F}_{m}\) - the image of \(A_{m}X\). Note that if \(A\) is linear then \(A_{m}\) is necessarily linear, but our definition of graphop does not require linearity. Therefore, \(A_{m}\) is strictly more general than the matrix representation of graph shift operators. We have the following well-definedness result: **Lemma 1**.: _If a graphop \(A:\mathcal{F}\to\mathcal{F}\) is self-adjoint, then for each resolution \(m\in\mathbb{N}\), the discretization \(A_{m}:\mathcal{F}_{m}\to\mathcal{F}_{m}\) defined above is also self-adjoint._ The proof can be found in Appendix B. Compared to previous works, our discretization scheme in Eqn (10) looks slightly different. In Ruiz et al. (2020), given a graphon \(W:[0,1]^{2}\to\mathbb{R}\), the discretization at resolution \(n\) was defined by forming the matrix \(S\in\mathbb{R}^{n\times n}:S_{i,j}=W(i/n,j/n)\). A related discretization scheme involving picking the interval endpoints at random was also used, but the resulting matrix still takes values at discrete points in \(W\). These two sampling schemes rely cruically on their everywhere continuous assumptions for the graphon \(W\). Indeed, but for continuity requirements, two functions that differ only at finite discrete points \((i/n,j/n),i,j\in[n]\) are in the same \(L^{2}\) class of functions, but will give rise to completely different samples. Furthermore, not every \(L^{2}\) class of functions has a continuous representative. This means that our discretization scheme is strictly more general than that used by Ruiz et al. (2020) even when restricted to graphons. This difference comes from the fact that we are discretizing an operator and not the graph itself. For our purpose, taking values at discrete points for some limiting object of sparse graphs will likely not work, since sparsity ensures that most discrete points are trivial. The integral form of the discretization (as opposed to setting \(A_{m}X(v)=(A\widetilde{X})(v)\) for all \(v\in[m]/m\), for example) is crucial for Lemma 1. ## 4 Main result: Approximation and transferability ### Results for \(P\)-operators Our first set of theorems address approximation and transferability of \(P\)-operators: under certain regularity assumptions to be discussed later, \(P\)-operators are well approximated by their discretizations: **Theorem 2** (Approximation theorem).: _Let \(A:\mathcal{F}\rightarrow\mathcal{F}\) be a \(P\)-operator satisfying Assumption 2 with constant \(C_{A}\); Assumption 3.A or 3.B with resolutions in \(\mathcal{N}\). Fix \(n\in\mathcal{N}\) and consider \((k,C_{v})\)-profiles. Let \(A_{n}:\mathcal{F}_{n}\rightarrow\mathcal{F}_{n}\) be a discretization of \(A\) as defined in Equation (10). Then:_ \[d_{M}\left(A,A_{n}\right)\leq 2\sqrt{\frac{C_{A}C_{v}}{n}}+\frac{C_{v}+1}{n}. \tag{13}\] Compared to theorems in Ruiz et al. (2020), our explicit dependence on \(n\) has an extra \(n^{-1/2}\) term that stems from techniques used to bound the Levy-Prokhorov distance between two entry distributions obtained from functions that differ by at most \(O(n^{-1})\) in \(L^{2}\) norm. As an immediate corollary, invoking the triangle inequality yields a transferability bound. **Corollary 1** (Transferability).: _Let \(A:\mathcal{F}\rightarrow\mathcal{F}\) be a \(P\)-operator satisfying assumptions of Theorem 2 with constant \(C_{A}\) and resolutions \(\mathcal{N}\). For any \(n,m\in\mathcal{N}\), let \(A_{n}:\mathcal{F}_{n}\rightarrow\mathcal{F}_{n}\) and \(A_{m}:\mathcal{F}_{m}\rightarrow\mathcal{F}_{m}\) be discretizations as defined in Equation (10). Then:_ \[d_{M}\left(A_{m},A_{n}\right)\leq\left(m^{-\frac{1}{2}}+n^{-\frac{1}{2}} \right)2\sqrt{C_{A}C_{v}}+(m^{-1}+n^{-1})(C_{v}+1). \tag{14}\] We emphasize that these theorems work for general nonlinear \(P\)-operators and not only the linear graphops defined in (Backhausz and Szegedy, 2022). Proof sketchThe full proof of Theorem 2 is in Appendix D. To bound the distance in \(d_{M}\) between two operators, for each sample size \(k\in\mathbb{N}\), we give a bound on the Hausdorff metric \(d_{H}\) between the two \((k,C_{v})\)-profiles. As long as the dependence on \(k\) of these bounds is polynomial, the infinite sum in the definition of \(d_{M}\) converges. We do this by picking an arbitrary distribution \(\overline{\eta}\) from \(\mathcal{S}_{k,C_{v}}(A)\), which by definition is given by a \(k\)-tuple \(F\) of functions in \(L^{\infty}_{\text{reg}(C_{v})}\). Discretize each element of \(F\) and consider its entry distribution results in \(\overline{\eta}_{n}\in\mathcal{S}_{k,C_{v}}(A_{n})\). We show that we can give an upper bound of \(d_{LP}(\overline{\eta},\overline{\eta}_{n})\) that is independent of the choice of \(\overline{\eta}\) and thus same upper bound holds for \(\sup_{\eta\in\mathcal{S}_{k,C_{v}}(A)}\inf_{\eta_{n}\in\mathcal{S}_{k,C_{v}}(A _{n})}d_{LP}(\eta,\eta_{n})\). By also selecting an arbitrary element of \(\mathcal{S}_{k,C_{v}}(A_{n})\) and extending it to an element of \(\mathcal{S}_{k,C_{v}}(A)\), we obtain another upper bound for \(\sup_{\eta_{n}\in\mathcal{S}_{k,C_{v}}(A_{n})}\inf_{\eta\in\mathcal{S}_{k,C_{ v}}(A)}d_{LP}(\eta,\eta_{n})\) and thus for \(d_{H}\). The different assumptions come in via different techniques used to bound \(d_{LP}\) by a high probability bound on the \(L^{2}\) norm of the functions in \(F\) and their discretization/extension. ### Results for graphop neural networks Not only are graphops and their discretizations close in \(d_{M}\), but, as we show next, neural networks built from a graphop are also close to those built from graphop discretizations in \(d_{M}\). We iterate that here we are comparing nonlinear operators (graphop neural networks) that are acting on different spaces (\(L^{2}([n]/n)\) for some finite \(n\) versus \(L^{2}([0,1])\)). Before stating theoretical guarantees for graphop neural networks, let us introduce some assumptions on the neural network activation function and parameters: **Assumption 1**.: _Let the activation function \(\rho:\mathbb{R}\rightarrow\mathbb{R}\) in the definition of graphop neural networks be \(1\)-Lipschitz. Let the convolution parameters \(h\) be normalized such that \(|h|\leq 1\) element-wise._ **Theorem 3** (Graphop neural network discretization).: _Let \(A:\mathcal{F}\rightarrow\mathcal{F}\). Assume that \(A\) satisfies Assumption 2 with constant \(C_{A}\) and Assumption 3.A or 3.B with resolutions in \(\mathcal{N}\). Fix \(n\in\mathcal{N}\) and consider \((k,C_{v})\)-profiles. Under Assumption 1, we have:_ \[d_{M}(\Phi(h,A,\cdot),\Phi(h,A_{n},\cdot))\leq P_{1}\sqrt{\overline{C}_{A}C_{v}}+\frac{C_{v}+1}{n}, \tag{15}\] _where \(\overline{C}_{A}:=(n_{\max}\sum_{i=1}^{K}C_{A}^{i})^{L},\,n_{\max}=\max_{l\in[ L]}n_{l}\), and \(P_{1}\) is a constant depending on \(K,L\)._ _Furthermore, we can invoke the triangle inequality to compare outputs of graphop neural networks built from two different discretizations of \(A\). For any \(m,n\in\mathcal{N}\),_ \[d_{M}(\Phi(h,A_{m},\cdot),\Phi(h,A_{n},\cdot))\leq P_{1}\sqrt{\overline{C}_{A}C_{v}}\left(m^{-\frac{1}{2}}+n^{-\frac{1}{2} }\right)+(C_{v}+1)\left(n^{-1}+m^{-1}\right). \tag{16}\] Compared to the main theorems of Ruiz et al. (2020), there are two main differences in our results. First, our rate of \(O(n^{-1/2})\) is slower than the rate of \(O(n^{-1})\) in Ruiz et al. (2020) as a function of \(n\). Yet, second, their bounds contain a small term that is independent of \(n\) and does not go to \(0\) as \(n\) goes to infinity. This small term depends on the variability of small eigenvalues in the spectral decomposition of the convolution operator associated with a graphon. The bound in Theorem 3, in contrast, goes to zero. The proof for this theorem is in Appendix E for a more general Theorem 6. Note that it does not suffice to simply use the fact that the assumptions play well with composition with Lipschitz function \(\rho\), which would result in a bound involving \(\Phi(h,A,\cdot)\) and its discretization \((\Phi(h,A,\cdot))_{n}\) as a nonlinear operator, as opposed to a bound between \(\Phi(h,A,\cdot)\) and \(\Phi(h,A_{n},\cdot)\).Our proof shares the same structure as that of Theorem 2 while making sure that the mismatch from discretizing/extending operators does not blow up with composition. ### Assumptions We state and discuss the main assumptions of our \(P\)-operators, which are not necessarily linear. **Assumption 2** (Lipschitz mapping).: _An operator \(A:\mathcal{F}\rightarrow\mathcal{F}\) is \(C_{A}\)-Lipschitz if \(\|Af-Ag\|_{2}\leq C_{A}\|f-g\|_{2}\) for any \(f,g\in\mathcal{F}\)._ We have already had a finite bound on the operator norm in the definition of \(P\)-operators. For linear operators, Assumption 2 is equivalent to a bounded operator norm and is thus automatically satisfied by linear \(P\)-operators. The next few assumptions are alternatives; only one needs be satisfied by our \(P\)-operators. Intuitively, they are regularity assumptions that ensure the images of our operator are not too wild and are specifically designed for our discretizations scheme: **Assumption 3.A** (Maps constant pieces to constant pieces).: _We say that an operator \(A:\mathcal{F}\rightarrow\mathcal{F}\) maps constant pieces to constant pieces at resolutions in \(\mathcal{N}\subset\mathbb{N}\) if for any \(n\in\mathcal{N}\), and for any \(f\in\mathcal{F}_{[-1,1]}\) that is a.e. constant on each interval \((u-1/n,u]\) for \(u\in[n]/n\), \(Af\) is also constant on \((u-1/n,u]\) for each \(u\)._ **Assumption 3.B** (Maps Lipschitz functions to Lipschitz functions).: _We say that an operator \(A:\mathcal{F}\rightarrow\mathcal{F}\) maps Lipschitz functions to Lipschitz functions with high probability at resolutions in \(\mathcal{N}\subset\mathbb{N}\) if for any \(n\in\mathcal{N}\), and for any \(f\in\mathcal{F}_{\text{reg}(C_{v})},\,Af\) is \(C_{v}\)-Lipschitz._ This is so far the most restrictive assumption. However, the next lemma describes some dense, sparse and intermediate graphs that satisfy these assumptions. **Lemma 2** (Well-behaved operators).: _The following examples satisy our assumptions:_ 1. Bounded-degree graphings: _Let_ \(G\) _be a graphing corresponding to the Cayley graph of_ \(\mathbb{Z}\) _(twoway infinite paths) or high-dimensional generalizations (infinite 2D and 3D grids). For each \(N\in\mathbb{N}\), there exists a locally equivalent graphing \(G^{\prime}_{N}\) such that its adjacency operator satisfies Assumption 3.A with resolution set \(\{x\in\mathbb{N}:x\mid N\}\)._ 2. Lipschitz graphons_: Let \(W\) be a \(C_{v}\)-Lipschitz graphon on \(\mathcal{F}_{\text{reg}(C_{v})}\). Then the Hilbert-Schmidt operator \(f\mapsto\int_{0}^{1}W(\cdot,y)g(y)\text{d}y\) satisfies Assumption 3.B with resolution set \(\mathbb{N}\)._ 3. Intermediate graphs_: Let \(G\) be a (potentially infinite) graph with a coloring \(C:V(G)\to[N]\) for some \(N\) such that for each vertex \(u,v\) with the same color, the multisets of their neighbors' colors \(\{C(u^{\prime}):(u^{\prime},u)\in E\}\) are the same. Then its adjacency operator satisfies Assumption 3.A with resolution \(N\). An \(N\)-d hypercube (more generally, Hamming graphs) which is neither bounded-degree nor dense, satisfies the above condition with resolutions in \(\{2^{n}\}_{n\in[N]}\)._ All our results also hold with a less restrictive assumption that allows for a failure of Assumption 3.A and 3.B in a small set (see Assumption 4.A and 4.B in the Appendix). The most general results are proven in Appendix D and hold in even slightly more relaxed conditions which require the operators to map constant pieces to _Lipschitz_ pieces (Assumption 5.A, 5.B in Appendix D). ### Deviations and Justifications All our theorems hold in slightly modified settings than those by Backhausz and Szegedy (2022). Namely, we allowed for nonlinear \(P\)-operators, assumed that they have finite \(\|\cdot\|_{2\to 2}\) norm, and used \((k,L)\)-profiles where we focus on Lipschitz functions (while Backhausz and Szegedy (2022) consider all measurable functions in their profiles). Therefore, we need to ensure that our changes still give us a useful mode of convergence that generalizes dense and sparse graph convergences. First, without the linearity assumption, the convergence proof by Backhausz and Szegedy (2022) does not hold: we do not know if all limits of nonlinear graphops are still graphops. However, our approximation results (Theorem 2) show special convergent sequences of nonlinear operators, which go beyond the settings in (Backhausz and Szegedy, 2022). Studying special nonlinear operator sequences is interesting since graphop NNs themselves can be viewed as nonlinear operators. We also assert that our restriction to operators acting on \(L^{2}\) spaces does not affect convergence guarantees (Theorem 2.14 in (Backhausz and Szegedy, 2022)). Next, we show that our restriction to Lipschitz profiles, which is necessary for our proof technique, does not affect convergence either, if we allow our Lipschitz constant to grow with the sequence: **Theorem 4** (Growing profiles).: _Let \(L:\mathbb{N}\to\mathbb{R}\) be a strictly increasing sequence such that \(L(n)\xrightarrow{n\to\infty}\infty\). Consider a sequence of \(P\)-operators \((A_{n}:\mathcal{F}_{n}\to\mathcal{F}_{n})_{n\in\mathbb{N}}\) that is Cauchy in the sense that \(d_{M}(A_{n},A_{m})=\sum_{k=1}^{\infty}2^{-k}d_{H}(\mathcal{S}_{k,L(n)}(A_{n}),\mathcal{S}_{k,L(m)}(A_{m}))\) becomes arbitrarily small as \(m,n\to\infty\). Then \((A_{n})_{n\in\mathbb{N}}\) converges to the same limit as action convergence._ This theorem allows us to replace the \(C_{v}\) constant in our bound with an extremely slowly growing function in \(n\) and get back action convergence as described in Backhausz and Szegedy (2022) without any realistic slowdown in the bound. Proof sketchFirst, by the completeness of the Hausdorff metric over the closed subsets of \(\mathcal{P}(\mathbb{R}^{2k})\) - set of probability measures supported on \(\mathbb{R}^{2k}\), for any \(k\), the statement is equivalent to showing \(d_{H}(\mathcal{S}_{k}(A),\mathcal{S}_{k,L(n)}(A_{n}))\to 0\) as \(n\to\infty\). The proof uses a Lipschitz mollification argument to smooth out an arbitrary measurable functions \(f_{1},\ldots,f_{k}\) that witness a measure in the \(k\)-profile of \(A\) for some \(k\in\mathbb{N}\). By selecting a Lipschitz mollifier \(\phi\), we ensure that convolving \(f_{j}\) with \(\phi_{\epsilon}:x\mapsto\epsilon^{-1}\phi(x\epsilon^{-1})\) results in a Lipschitz function that converges to \(f\) in \(L^{2}\) as \(\epsilon\) goes to \(0\). ## 5 Discussion and Future directions In this paper, we study size transferability of finite GNNs on graphs that are discretizations of graphop, a recent notion of graph limit introduced by Backhausz and Szegedy (2022). We achieve this by viewing GNNs as operators that transform one graph signal into another. Under regularity assumptions, we proved that two GNNs, using two different-resolution GSOs discretized from the same graphop, are close in an operator metric built from weak convergence of measures. For future direction, a principled study of spectral properties of graphops and graphop neural networks would open doors for techniques from Fourier analysis as used in (Ruiz et al., 2020; Levie et al., 2022). This leads to distinct challenges, e.g., the spectral gap is not continuous with respect to local-global limits and thus action convergence, but many more properties of spectral measures of bounded-degree graphs are recently studied (Virag, 2018).

2301.11981

Unearthing InSights into Mars: Unsupervised Source Separation with Limited Data

Source separation involves the ill-posed problem of retrieving a set of source signals that have been observed through a mixing operator. Solving this problem requires prior knowledge, which is commonly incorporated by imposing regularity conditions on the source signals, or implicitly learned through supervised or unsupervised methods from existing data. While data-driven methods have shown great promise in source separation, they often require large amounts of data, which rarely exists in planetary space missions. To address this challenge, we propose an unsupervised source separation scheme for domains with limited data access that involves solving an optimization problem in the wavelet scattering covariance representation space$\unicode{x2014}$an interpretable, low-dimensional representation of stationary processes. We present a real-data example in which we remove transient, thermally-induced microtilts$\unicode{x2014}$known as glitches$\unicode{x2014}$from data recorded by a seismometer during NASA's InSight mission on Mars. Thanks to the wavelet scattering covariances' ability to capture non-Gaussian properties of stochastic processes, we are able to separate glitches using only a few glitch-free data snippets.

Ali Siahkoohi, Rudy Morel, Maarten V. de Hoop, Erwan Allys, Grégory Sainton, Taichi Kawamura

2023-01-27T20:38:07Z

http://arxiv.org/abs/2301.11981v2

# Unearthing InSights into Mars: ###### Abstract Source separation entails the ill-posed problem of retrieving a set of source signals observed through a mixing operator. Solving this problem requires prior knowledge, which is commonly incorporated by imposing regularity conditions on the source signals or implicitly learned in supervised or unsupervised methods from existing data. While data-driven methods have shown great promise in source separation, they are often dependent on large amounts of data, which rarely exists in planetary space missions. Considering this challenge, we propose an unsupervised source separation scheme for domains with limited data access that involves solving an optimization problem in the wavelet scattering representation space--an interpretable low-dimensional representation of stationary processes. We present a real-data example in which we remove transient thermally induced microtilts, known as glitches, from data recorded by a seismometer during NASA's InSight mission on Mars. Owing to the wavelet scattering covariances' ability to capture non-Gaussian properties of stochastic processes, we are able to separate glitches using only a few glitch-free data snippets. Machine Learning, ICML ## 1 Introduction Source separation is a problem of fundamental importance in the field of signal processing, with a wide range of applications in various domains such as telecommunications (Chevreuil & Loubaton, 2014; Gay & Benesty, 2012; Khosravy et al., 2020), speech processing (Pedersen et al., 2008; Chua et al., 2016; Grais et al., 2014), biomedical signal processing (Adali et al., 2015; Barriga et al., 2003; Hasan et al., 2018) and geophysical data processing (Ibrahim & Sacchi, 2014; Kumar et al., 2015; Scholz et al., 2020). Source separation arises when multiple source signals of interest are combined through a mixing operator. The goal is to estimate the original sources with minimal prior knowledge of the mixing process or the source signals themselves. This makes source separation a challenging problem, as the number of sources is usually unknown, and the sources are often non-Gaussian, nonstationary, and multiscale. Classical signal-processing based blind source separation methods (Cardoso, 1989; Jutten & Herault, 1991; Bingham & Hyvarinen, 2000; Nandi & Zarzoso, 1996; Cardoso, 1998; Jutten et al., 2004) while being extensively studied and well understood, often make simplifying assumptions regarding the sources that might negatively bias the outcome of source separation (Cardoso, 1998; Parra & Sajda, 2003). To partially address the shortcomings of classical approaches, deep learning methods have been proposed as an alternative approach for source separation, which exploit the informa Figure 1: Unsupervised removal of background noise and thermally induced microtilts (glitches) from a marsquake recorded by the InSight landers’s seismometer on February 03, 2022 (InSight Marsquake Service, 2023). Approximately 14 hours of raw data (with no marsquakes) from the U component is used for background noise separation without any prior knowledge on marsquakes or glitches. Horizontal axis is in UTC time zone. tion in existing datasets to learn prior information about the sources. In particular, supervised learning methods (Jang and Lee, 2003; Hershey et al., 2016; Ke et al., 2020; Kameoka et al., 2019; Wang and Chen, 2018) commonly rely on existence of labeled training data and perform source separation using an end-to-end training scheme. However, since they require access to ground truth source signals for training, supervised methods are limited to domains in which labeled training data is available. On the other hand, unsupervised source separation methods (Fevotte et al., 2009; Drude et al., 2019; Wisdom et al., 2020; Liu et al., 2022; Denton et al., 2022; Neri et al., 2021) do not rely on the existence of labeled training data and instead attempt to infer the sources based on the properties of the observed signals. These methods make minimal assumptions about the underlying sources, which make them a suitable choice for realistic source separation problems. Despite their success, unsupervised source separation methods often require tremendous amount of data during training (Wisdom et al., 2020), which is often infeasible in certain applications such as problem arising in planetary space missions, e.g., because of challenges associated with data acquisition. Moreover, generalization concerns preclude the use of data-driven methods trained on synthetic data in real-world applications due to the discrepancies between synthetic and real data. To address these challenges, we propose an unsupervised source separation method applicable to domains with limited access to data. In order to achieve this, we embed inductive biases into our approach through the use of domain knowledge from time series analysis and signal processing via the scattering transform (Bruna and Mallat, 2013). As a means of capturing non-Gaussian and multiscale characteristics of the sources, we extract second-order information of scattering coefficients, known as the wavelet scattering covariance representation (Morel et al., 2022). We perform source separation by solving an optimization problem over the unknown sources that entails minimizing multiple carefully selected and normalized loss functions in the wavelet scattering covariance representations space. These loss function are designed to: (1) ensure data-fidelity, i.e., enforce the recovered sources to explain the observed (mixed) data; (2) incorporate prior knowledge in the form of limited (e.g., \(\approx 50\)) training examples from one of the sources; and (3) impose a notion of statistical independence between the recovered sources. Our proposed method does not require any labeled training data, and can effectively separate sources even in scenarios where access to data is limited. As a motivating example, we apply our approach to data recorded by a seismometer on Mars during NASA's Interior Exploration using Seismic Investigations, Geodesy and Heat Transport (InSight) mission (Giardini et al., 2020; Golombek et al., 2020; Knapmeyer-Endrun and Kawamura, 2020). The InSight lander's seismometer has been detecting marsquakes (Horleston et al., 2022; Ceylan et al., 2022; Panning et al., 2023; InSight Marsquake Service, 2023) and transient atmospheric signals, such as wind and temperature changes, that provide information about the Martian atmosphere (Stott et al., 2022) and enable studying the interior structure and composition of the Red Planet (Beghein et al., 2022). The signal recorded by the InSight seismometer is heavily influenced by atmospheric activity and surface temperature (Lognonne et al., 2020; Lorenz et al., 2021), resulting in a distinct daily pattern and a pronounced nonstochastic character. Among different types of noise, transient thermally induced microtilts, commonly referred to as glitches (Scholz et al., 2020; Barkaoui et al., 2021), are a significant component of the noise and one of the most frequent recorded events. These glitches, hinder the downstream analysis of the data if left uncorrected (Scholz et al., 2020). We show that our method is capable of removing glitches from the recorded data by only using a few snippets of glitch-free data. In the following sections, we first described several related work that similarly address the challenges of unsupervised source separation in limited data regimes. Next, we introduce wavelet scattering covariance as a domain-knowledge rich representation for analyzing time series and provide justification for their usage in the context of source separation. As a means to perform source separation in domains with limited data, we introduce our source separation approach that involves solving an optimization problem with loss functions defined in the wavelet scattering covariance space. We present two numerical experiments: (1) a synthetic setup in which we can quantify the accuracy of our method; and (2) examples regarding separating glitches from data recorded by InSight lander's seismometer. ## 2 Related work Regaldo-Saint Blancard et al. (2021) introduced the notion of components separation through a gradient descent in signal space with indirect constraints with applications to to the separation of an astrophysical emission (polarized dust emission in microwave) and instrumental noise. In an extensive study, Delouis, J.-M. et al. (2022) attempts to separate the full sky observation of the dust emission with instrumental noise using similar techniques via wavelet scattering covariance representations. Authors take the nonstationarity of the signal into account by constraining statistics on several sky masks. Contrarily to a usual denoising approach, both of these works focus primarily on recovering the statistics of the signal of interest. In a related approach, Jeffrey et al. (2022) use a scattering transform generative model to perform source separation in a Bayesian framework. While very efficient, this approach requires training samples from each component, which are often not available. Finally, Xu et al. (2022) similarly aim to remove glitches and they develop a supervised learning based on deglitched data obtained by existing glitch removal tools. As a result, the accuracy of their result is limited to the accuracy of the underlying data processing tool, which our method avoid by being unsupervised. As we show in our examples, we are able to detect and remove glitches that were undetected by the main deglitching software (Scholz et al., 2020) developed closely by the InSight team. ## 3 Wavelet scattering covariance In order to enable unsupervised source separation with limited quantities of data, we propose to design a low-dimensional, domain-knowledge rich representation of data using which we perform source separation. This is partially motivated by recent success of self-supervised learning methods in natural language processing where high-performing representations of data--obtained through pre-trained Transformers (Vaswani et al., 2017; Baevski et al., 2020; Gulati et al., 2020; Zhang et al., 2020)--are used in place of raw data to successfully perform various downstream tasks (Polyak et al., 2021; Gulati et al., 2020; Baevski et al., 2020; Zhang et al., 2020; Chung et al., 2021; Siahkoohi et al., 2022). Since we are operating in a limited-data regime, we cannot afford self-supervised learning with Transformers in order to obtain high-performing features. Instead, we propose to use wavelet scattering covariances (Morel et al., 2022) as means to transfer data to a suitable representation space for source separation. This transform is based on scattering networks (Bruna & Mallat, 2013) that provide interpretable representation of data and are able to characterize a wide range of non-Gaussian properties of multiscale stochastic processes (Morel et al., 2022)--a type of signals that are considered in this paper. The wavelet scattering covariance generally does not require any pretraining and its weights, i.e., wavelets in the scattering network, are often chosen beforehand (see Seydoux et al. (2020) for a data-driven wavelet choice) according to the time-frequency properties of data. In the next section, we introduce the construction of this representation space by first describing scattering networks. ### Wavelet transform and scattering networks The main ingredient of the wavelet scattering covariance representation is a scattering network (Bruna & Mallat, 2013) that consists of a cascade of wavelet transforms followed by a nonlinear activation function (akin to a typical convolutional neural network). In this network architecture, the wavelet transform, denoted by a linear operator \(\mathbf{W}\), is a convolutional operator with predefined kernels, i.e., wavelet filters. These filters include a low-pass filter \(\varphi_{J}(t)\) and \(J\) complex-valued band-pass filters \(\psi_{j}(t)=2^{-j}\psi(2^{-j}t),\ 1\leq j\leq J\), which are obtained by the dilation of a mother wavelet \(\psi(t)\) and have zero-mean and a fast decay away from \(t=0\). The wavelet transform is often followed by the modulus operator in scattering networks. The output of a two-layer scattering network \(S\) can be written as, \[S(\mathbf{x}):=\begin{bmatrix}\mathbf{W}\mathbf{x}\\ \mathbf{W}|\mathbf{W}\mathbf{x}|\end{bmatrix}, \tag{1}\] where \(\mathbf{W}\mathbf{x}:=\mathbf{x}\star\psi_{j}(t)\) denotes the wavelet transform that extracts variations of the input signal \(\mathbf{x}(t)\) around time \(t\) at scale \(2^{j}\), and \(|\cdot|\) is the modulus activation function (Bruna & Mallat, 2013). The second component \(\mathbf{W}|\mathbf{W}\mathbf{x}|\) computes the variations at different time and scales of the wavelet coefficients \(\mathbf{W}\mathbf{x}\). The scattering transform yields features that characterize time evolution of signal envelopes at different scales. Even though such representation has many successful applications, e.g., intermittency analysis (Bruna et al., 2015), clustering (Seydoux et al., 2020), event detection and segmentation (Rodriguez et al., 2021) (with learnable wavelets), it is not sufficient to build accurate models of multiscale processes as it does not capture crucial dependencies across different scales (Morel et al., 2022). ### Capturing non-Gaussian characteristics of random processes The dependencies across different scales in scattering transform coefficients are crucial in characterizing and discriminating non-Gaussian signals (Morel et al., 2022). To capture them, we explore the matrix scattering coefficients outer product \(S(\mathbf{x})S(\mathbf{x})^{\top}\): \[\begin{bmatrix}\mathbf{W}\mathbf{x}\left(\mathbf{W}\mathbf{x}\right)^{\top} &\mathbf{W}\mathbf{x}\left(\mathbf{W}|\mathbf{W}\mathbf{x}|\right)^{\top}\\ \mathbf{W}|\mathbf{W}\mathbf{x}|\left(\mathbf{W}\mathbf{x}\right)^{\top}& \mathbf{W}|\mathbf{W}\mathbf{x}|\left(\mathbf{W}|\mathbf{W}\mathbf{x}| \right)^{\top}\end{bmatrix}. \tag{2}\] This matrix contains three types of coefficients: * The correlation coefficients \(\mathbf{W}\mathbf{x}\left(\mathbf{W}\mathbf{x}\right)^{\top}\) across scales form a quasi-diagonal matrix, because separate scales do not correlate due to phase fluctuation (Morel et al., 2022). We thus only keep its diagonal coefficients, which correspond to the wavelet power spectrum; * The correlation coefficients \(\mathbf{W}\mathbf{x}\left(\mathbf{W}|\mathbf{W}\mathbf{x}|\right)^{\top}\) capture signed interaction between wavelet coefficients. In particular, they detect sign-asymmetry and time-asymmetry in \(\mathbf{x}\)(Morel et al., 2022). We also consider a diagonal approximation to this matrix. For the same reason as \(\mathbf{W}\mathbf{x}\left(\mathbf{W}\mathbf{x}\right)^{\top}\), this matrix is quasi-diagonal, and we only keep coefficients that correlate same scale channels on the second wavelet operator; * Finally coefficients \(\mathbf{W}|\mathbf{W}\mathbf{x}|\left(\mathbf{W}|\mathbf{W}\mathbf{x}\right)|^{\top}\) capture cross-envelope correlation at different scales. They capture intermittency and time-asymmetry (Morel et al., 2022). Again, we only keep coefficients that correlate same scale channels on the second wavelet operator. We denote \(\operatorname{diag}\big{(}S(\mathbf{x})S(\mathbf{x})^{\top}\big{)}\) as such diagonal approximation of the full sparse matrix \(S(\mathbf{x})S(\mathbf{x})^{\top}\). The _wavelet scattering covariance_ representation is obtained by computing the time average (average pool, denoted by \(\operatorname{Ave}\)) of this diagonal approximation: \[\Phi(\mathbf{x}):=\operatorname{Ave}\left(\begin{bmatrix}S(\mathbf{x})\\ \operatorname{diag}\big{(}S(\mathbf{x})S(\mathbf{x})^{\top}\big{)}\end{bmatrix} \right). \tag{3}\] Non-Gaussian properties of \(\mathbf{x}\) can be detected through non-zero coefficients of \(\Phi\). Indeed, let us separate real coefficients and potentially complex coefficients \(\Phi(\mathbf{x})=\big{(}\Phi_{\text{real}}(\mathbf{x}),\Phi_{\text{complex}}( \mathbf{x})\big{)}\), with \(\Phi_{\text{real}}(\mathbf{x})\) being the real coefficients \(\operatorname{Ave}\big{(}|\mathbf{W}\mathbf{x}|,|\mathbf{W}\mathbf{x}|^{2}, |\mathbf{W}|\mathbf{W}\mathbf{x}||^{2}\big{)}\) and \(\Phi_{\text{complex}}(\mathbf{x})\) being the remaining potentially complex coefficients, that is the cross-layer correlations \(\operatorname{Ave}\Big{(}\mathbf{W}\mathbf{x}\big{(}\mathbf{W}|\mathbf{W} \mathbf{x}|\big{)}^{\top}\Big{)}\) or the second layer correlations \(\operatorname{Ave}\Big{(}\mathbf{W}|\mathbf{W}\mathbf{x}|\big{(}\mathbf{W}| \mathbf{W}\mathbf{x}|\big{)}^{\top}\Big{)}\) with different scale correlation on the first wavelet operator. **Proposition 3.1**.: _If \(\mathbf{x}\) is Gaussian then \(\Phi_{\text{complex}}(\mathbf{x})\approx 0\). If \(\mathbf{x}\) is time-symmetric, then \(\operatorname{Im}\Phi_{\text{complex}}(\mathbf{x})\approx 0\)._ More precisely, beyond detecting non-Gaussianity through non-zero coefficients up to estimation error, \(\Phi(\mathbf{x})\) is able to quantify different non-Gaussian behaviors, which will be crucial for source separation. Appendix A.3 presents a dashboard that visualizes \(\Phi(\mathbf{x})\) and can be used to interpret signal non-Gaussian properties such as sparsity, intermittency, and time-asymmetry. The dimensionality of the wavelet scattering covariance representation depends on the number of scales \(J\) considered i.e. the number of wavelet filters of \(\mathbf{W}\). In order for largest scale coefficients to be well estimated, one should choose \(J\ll\log_{2}(d)\) where \(d\) is input data dimension. The maximum number of coefficients in \(\Phi\) is smaller than \(\log_{2}^{3}(d)\) for \(d\geq 3\)(Morel et al., 2022). Contrary to higher dimensional representations or higher order statistics, scattering covariance \(\Phi(\mathbf{x})\) are low-dimensional low-order statistics that can be efficiently estimated on a single realization of a source and does not require tremendous amount of data for estimation to converge. In other word, \(\Phi\) is a low-variance representation. This point is key for our source separation algorithm to be applied on limited data. Wavelet scattering covariance \(\Phi\) extracts average and correlation features from a 2-layer CNN with predefined wavelet filters. It is analogous to the features extracted in Gatys et al. (2015) for generation, that considers however a pretrained convolutional neural network. In the following we will also make use of the scattering cross-covariance representation \(\Phi(\mathbf{x},\mathbf{y})=\operatorname{Ave}\operatorname{diag}\big{(}S( \mathbf{x})S(\mathbf{y})^{\top}\big{)}\) that captures scale dependencies across two signals \(\mathbf{x}\) and \(\mathbf{y}\). In particular, if \(\mathbf{x}\) and \(\mathbf{y}\) are statistically independent then one has, up to estimation error, \(\Phi(\mathbf{x},\mathbf{y})\approx 0\), which will be useful when it comes to separating independent sources. ## 4 Unsupervised source separation To enable high-fidelity source separation in domains in which access to training data--supervised or unsupervised--is limited, we cast source separation as an optimization problem in a suitable feature space. Owing to wavelet scattering covariance representation's ability to capture non-Gaussian properties of multiscale stochastic processes without any training, we perform source separation by solving an optimization problem over the unknown sources using loss functions over wavelet scattering covariance representations. Due to the inductive bias embedded in the design of this representation space, we gain access to interpretable features, which could further inform us regarding the quality of the source separation process. ### Problem setup Consider a linear mixing of unknown sources \(\mathbf{s}_{i}^{*}(t),\ i=1,\ldots,N\) via a mixing operator \(\mathbf{A}\), \[\mathbf{x}(t)=\mathbf{A}\mathbf{s}^{*}(t)+\boldsymbol{\nu}(t)=\mathbf{a}_{1}^ {\top}\mathbf{s}_{1}^{*}(t)+\mathbf{n}(t), \tag{4}\] with \[\begin{split}\mathbf{s}^{*}(t)&=\left[\mathbf{s}_{1}^ {*}(t),\ldots,\mathbf{s}_{N}^{*}(t)\right]^{\top},\ \mathbf{A}=\left[\mathbf{a}_{1}^{\top}\ \cdots\ \mathbf{a}_{N}^{\top}\right],\\ \mathbf{n}(t)&=\boldsymbol{\nu}(t)+\sum_{i=2}^{N} \mathbf{a}_{i}^{\top}\mathbf{s}_{i}^{*}(t).\end{split} \tag{5}\] In the above expressions, \(\mathbf{x}(t)\) represents the observed data, and \(\boldsymbol{\nu}(t)\) is the measurement noise. Here we capture the noise and the mixture of all the sources except for \(\mathbf{s}_{1}^{*}(t)\) through the mixing operator in \(\mathbf{n}(t)\) that does not longer depends on \(\mathbf{s}_{1}^{*}(t)\). Note that \(\mathbf{x}(t)\) and \(\mathbf{s}^{*}(t)\) are in fact matrices and \(\mathbf{a}_{i}^{\top}\mathbf{s}_{i}^{*}(t)\) is of the same size as \(\mathbf{x}(t)\). **Objective.** The aim is to obtain a point estimate \(\mathbf{s}_{1}(t)\) given a single observation \(\mathbf{x}(t)\) with the assumption that \(\mathbf{a}_{1}\) is known and that we have access to a few realizations \(\{\mathbf{n}_{k}(t)\}_{k=1}^{K}\) as a training dataset. For example, in the case of removing glitches from InSight seismometer's recordings, we will consider \(\mathbf{n}_{k}(t)\) to be snippets of glitch-free data and \(\mathbf{a}_{1}\) to encodes information regarding polarization. We will drop the time dependence of the quantities in equations (4) and (5) for convenience. ### Principle of the method The inverse problem of estimating \(\mathbf{s}_{1}\) from the given observed data \(\mathbf{x}\), as presented in equation (4), is ill-posed since the solution is not unique. To constrain the solution space of the problem, we incorporate prior knowledge in the form of realizations \(\{\mathbf{n}_{k}\}_{k=1}^{K}\). We achieve this through a loss function that emphasizes the wavelet scattering covariance representation of \(\mathbf{x}-\mathbf{a}_{1}^{\top}\mathbf{s}_{1}\) to be close to that of \(\mathbf{n}_{k},\ k=1,\ldots,K\): \[\mathcal{L}_{\text{prior}}\left(\mathbf{s}_{1}\right):=\frac{1}{K}\sum_{k=1}^{ K}\left\|\Phi\big{(}\mathbf{x}-\mathbf{a}_{1}^{\top}\mathbf{s}_{1}\big{)}- \Phi\big{(}\mathbf{n}_{k}\big{)}\right\|_{2}^{2}. \tag{6}\] In the above expression, \(\Phi\) is the wavelet scattering covariance mapping. With the prior loss defined, we impose data-consistency via: \[\mathcal{L}_{\text{data}}\left(\mathbf{s}_{1}\right):=\frac{1}{K}\sum_{k=1}^{ K}\left\|\Phi\big{(}\mathbf{a}_{1}^{\top}\mathbf{s}_{1}+\mathbf{n}_{k}\big{)}- \Phi\big{(}\mathbf{x}\big{)}\right\|_{2}^{2}. \tag{7}\] The data consistency loss function \(\mathcal{L}_{\text{data}}\) promotes estimations of \(\mathbf{s}_{1}\) that for any training example from \(\{\mathbf{n}_{k}\}_{k=1}^{K}\) the wavelet scattering covariance representation of \(\mathbf{a}_{1}^{\top}\mathbf{s}_{1}+\mathbf{n}_{k}\) is close to that of the observed data. In order to further constrain this under-determined source separation problem, we penalize cross-scale dependencies across two quantities \(\mathbf{a}_{1}^{\top}\mathbf{s}_{1}\) and \(\mathbf{n}_{k}\). We formulate this by \[\mathcal{L}_{\text{cross}}(\mathbf{s}_{1}):=\frac{1}{K}\sum_{k=1}^{K}\left\| \Phi\big{(}\mathbf{a}_{1}^{\top}\mathbf{s}_{1},\mathbf{n}_{k}\big{)}\right\|_ {2}^{2}, \tag{8}\] where \(\Phi(\cdot,\cdot)\) is the scattering cross-covariance representation (see section 3.2). ### Loss normalization The losses described previously do not contain any weighting term for the different coefficients of the scattering covariance representation. We introduce in this section a generic normalization scheme, based on the estimated variance of certain scattering covariance distributions. This normalization, which has been introduced in Delouis, J.-M. et al. (2022), allows to interpret the different loss terms in a standard form, and to include them additively in the total loss term without overall loss weights. Let us consider first the loss term given by equation (6), which compares the distance between \(\mathbf{x}-\mathbf{a}_{1}^{\top}\mathbf{s}_{1}\) and available training samples \(\{\mathbf{n}_{k}\}_{k=1}^{K}\) in the wavelet scattering representation space. Specifying explicitly the sum on the \(M\) wavelet scattering covariance coefficients \(\Phi_{m},\ m=1,\ldots,M\), it yields \[\mathcal{L}_{\text{prior}}\left(\mathbf{s}_{1}\right)=\frac{1}{MK}\sum_{m=1}^ {M}\sum_{k=1}^{K}\left|\Phi_{m}\big{(}\mathbf{x}-\mathbf{a}_{1}^{\top}\mathbf{ s}_{1}\big{)}-\Phi_{m}\big{(}\mathbf{n}_{k}\big{)}\right|^{2}.\] Let us consider the second sum in this expression. In the limit where \(\Phi_{m}\big{(}\mathbf{x}-\mathbf{a}_{1}^{\top}\mathbf{s}_{1}\big{)}\) is drawn from the same distribution as \(\{\Phi_{m}\big{(}\mathbf{n}_{k}\big{)}\}_{k}^{K}\), the difference \(\Phi_{m}\big{(}\mathbf{x}-\mathbf{a}_{1}^{\top}\mathbf{s}_{1}\big{)}-\Phi_{m} \big{(}\mathbf{n}_{k}\big{)}\), seen as a random variable, should have zero mean, and the same variance as the distribution \(\{\Phi_{m}\big{(}\mathbf{n}_{k}\big{)}\}_{k}^{K}\) up to a factor \(2\). Denoting \(\sigma^{2}\big{(}\Phi_{m}\big{(}\mathbf{n}_{k}\big{)}\big{)}\) as this variance, which can be estimated from \(\{\Phi_{m}\big{(}\mathbf{n}_{k}\big{)}\}_{k}^{K}\), this gives a natural way of normalizing the loss: \[\mathcal{L}_{\text{prior}}\left(\mathbf{s}_{1}\right)=\frac{1}{MK}\sum_{m=1}^{ M}\sum_{k=1}^{K}\frac{\left|\Phi_{m}\big{(}\mathbf{x}-\mathbf{a}_{1}^{\top} \mathbf{s}_{1}\big{)}-\Phi_{m}\big{(}\mathbf{n}_{k}\big{)}\right|^{2}}{\sigma^ {2}\big{(}\Phi_{m}\big{(}\mathbf{n}_{k}\big{)}\big{)}}\] or in a compressed form \[\mathcal{L}_{\text{prior}}\left(\mathbf{s}_{1}\right)=\frac{1}{K}\sum_{k=1}^{ K}\frac{\left\|\Phi\big{(}\mathbf{x}-\mathbf{a}_{1}^{\top}\mathbf{s}_{1} \big{)}-\Phi\big{(}\mathbf{n}_{k}\big{)}\right\|_{2}^{2}}{\sigma^{2}\big{(} \Phi\big{(}\mathbf{n}_{k}\big{)}\big{)}}, \tag{9}\] which takes into account the expected standard deviation of each coefficient of the scattering covariance representation. This normalization allows for two things. First, it removes the normalization inherent to the multiscale structure of \(\Phi\). Indeed, coefficients involving low frequency wavelets tend to have a larger norm. Second, it allows to interpret the loss value, which is expected to be at best of order unity and to sum different loss terms of same magnitude. We can introduce a similar normalization for the other loss terms. Loss term (7) should be normalized by the \(M\)-dimensional vector \(\sigma^{2}\big{(}\Phi\big{(}\mathbf{a}_{1}^{\top}\mathbf{s}_{1}+\mathbf{n}_{k} \big{)}\big{)}\) that we approximate by \(\sigma^{2}\big{(}\Phi\big{(}\mathbf{x}+\mathbf{n}_{k}\big{)}\big{)}\), in order to have a normalization independent on \(\mathbf{s}_{1}\), yielding \[\mathcal{L}_{\text{data}}\left(\mathbf{s}_{1}\right):=\frac{1}{K}\sum_{k=1}^{K} \frac{\left\|\Phi\big{(}\mathbf{a}_{1}^{\top}\mathbf{s}_{1}+\mathbf{n}_{k} \big{)}-\Phi\big{(}\mathbf{x}\big{)}\right\|_{2}^{2}}{\sigma^{2}\big{(}\Phi \big{(}\mathbf{x}+\mathbf{n}_{k}\big{)}\big{)}}. \tag{10}\] Finally, loss term (8) should be normalized by \(\sigma^{2}\big{(}\Phi\big{(}\mathbf{a}_{1}^{\top}\mathbf{s}_{1},\mathbf{n}_{k} \big{)}\big{)}\) that we approximate by \(\sigma^{2}\big{(}\Phi\big{(}\mathbf{x},\mathbf{n}_{k}\big{)}\big{)}\) \[\mathcal{L}_{\text{cross}}(\mathbf{s}_{1})=\frac{1}{K}\sum_{k=1}^{K}\frac{ \left\|\Phi\big{(}\mathbf{a}_{1}^{\top}\mathbf{s}_{1},\mathbf{n}_{k}\big{)} \right\|_{2}^{2}}{\sigma^{2}\big{(}\Phi\big{(}\mathbf{x},\mathbf{n}_{k}\big{)} \big{)}}, \tag{11}\] We can now sum the normalized loss terms (9),(10),(11) to get the final optimization problem to perform source separation \[\widetilde{\mathbf{s}}_{1}:=\operatorname*{arg\,min}_{\mathbf{s}_{1}}\Big{[} \mathcal{L}_{\text{data}}(\mathbf{s}_{1})+\mathcal{L}_{\text{prior}}(\mathbf{s}_{1 })+\mathcal{L}_{\text{cross}}(\mathbf{s}_{1})\Big{]}. \tag{12}\] Due to the delicate normalization of the three terms, we expect that further weighting of the three losses using weighting hyperparameters is not necessary. We propose to initialize the optimization problem in equation (12) with \(\mathbf{s}_{1}:=0\). Such choice means that \(\mathbf{n}=\mathbf{x}-a_{1}^{\top}\mathbf{s}_{1}\) is initialized to \(\mathbf{x}\), which contains crucial information on the sources, as will be explained in the next section. We have observed that as soon as we know the statistics of \(\Phi(\mathbf{n})\) our algorithm retrieves the unknown statistics of the other source \(\Phi(\mathbf{a}_{1}^{\top}\mathbf{s}^{*})\). In other words the algorithm successfully separates the sources in the scattering covariance space. Of course, in many cases as we will see in the next section, our algorithm retrieves point estimates of \(\mathbf{s}_{1}(t)\) which is stronger, but this constitutes a convergence result that can be proven in not so simplified assumptions. Essentially, when the source \(\mathbf{n}\) is statistically characterized by its scattering covariance descriptors the algorithm is able to retrieve the scattering covariance of other sources. This emphasizes the choice of a representation \(\Phi\) that can approximate efficiently the stochastic structure of multiscale processes (Morel et al., 2022). ## 5 Numerical experiments The main goal of this paper is to derive a unsupervised approach to source separation that is applicable in domain with limited access to training data, thanks to the wavelet scattering covariance representation. To provide a quantitative analysis to the performance of our approach, we first consider a stylized synthetic example that resembles challenges of real-world data. To illustrate how our method performs in the wild, we apply our method to data recorded on Mars during the InSight mission. We aim to remove transient thermally induced microtilts, i.e., glitches (Scholz et al., 2020; Barkaoui et al., 2021), from the recorded data by the InSight lander's seismometer. Code to partially reproduce the results is available at GitHub. ### Stylized example We consider the problem of separating glitch-like signals from increments of a multifractal random work process (Bacry et al., 2001). This process is a typical non-Gaussian noise exhibiting long-range dependencies and showing bursts of activity, e.g., see Figure 11 for several realizations of this process. The second source signal is composed of several peaks with exponentially decaying amplitude, with possibly different decay parameters on the left than on the right. To obtain synthetic observed data, we sum increments of a multifractal random walk realization, which plays the role of \(\mathbf{n}\) in equation (4), with a realization of the second source. The top three images in Figure 2 are the signal of interest, secondary added signal, and the observed data, respectively. In order to retrieve the multifractal random walk realization, we solve the optimization problem in equation (12) using the L-BFGS optimization algorithm (Liu and Nocedal, 1989) using \(500\) iterations. We use a training dataset of \(100\) realizations of increments of a multifractal random walk, \(\{\mathbf{n}_{k}\}_{k=1}^{100}\). The architecture we use for wavelet scattering covariance computation is two-layer scattering network with \(J=8\) different octaves with \(Q=1\) wavelet per octave. We use the same scattering network architecture throughout all the numerical experiments in the paper. Given an input signal dimension of \(d=2048\), this choice of parameters yields a \(174\)-dimensional wavelet scattering covariance space. The bottom two images in Figure 2 summarizes the results. We are able to recover the ground-truth multifractal random walk realization up to small, mostly incoherent, and seemingly random error. To see the effect of number of training realizations on the signal recovery, we repeated the above examples and used varying number of training samples. Figure 3 shows that, as expected, the signal-to-noise ratio of the recovered sources increases the more training samples we have. To show our method can also separate sources that are not localized in time, we consider contaminating the multifractal random walk data with a turbulent signal (see second image from the top in Figure 4. Without any prior knowl Figure 3: Signal-to-noise ratio of the predicted multifractal random walk data versus number of unsupervised samples. Shaded area indicates the \(90\%\) interval of this quantity for ten random source separation instances. Figure 2: Unsupervised source separation applied to the multifractal random walk data. The vertical axis is the same for all the plots. edge regarding this turbulent signal and by only using \(100\) realizations of increments of a multifractal random walk as training samples, we are able to recover the signal of interest with arguably low error: juxtapose the ground truth and predicted multifractal random walk realization in Figure 4. The algorithm correctly removes the low frequencies content of the turbulent jet, and makes a small, uncorrelated, random error at high frequencies. In this case the two signals having different power spectra helps disentangling them at high frequencies. In the above synthetic examples, the signal low frequencies are well separated and the algorithm infers correctly the high frequencies. In the earlier example, the presence of time localized sources would facilitate the algorithm to "interpolate" the background noise knowing its scattering covariance representation. This case makes it more evident that the initialization \(\mathbf{s}_{1}=\mathbf{0}\) informs the algorithm of the trajectory of the unknown source. ### Application to data from the InSight mission InSight lander's seismometer, SEIS, is exposed to heavy wind and temperature fluctuations. As a result, it is subject to background noise. Glitches are a widely occurring family of noise caused by a variety of causes (Scholz et al., 2020). These glitches often appear as one-sided pulses in seismic data and significantly affect the analysis of the data (Scholz et al., 2020). In this section we will explore the application of our proposed method in separating glitches and background noise from the recorded seismic data on Mars. #### 5.2.1 Removing glitches We propose to consider glitches as the source of interest \(\mathbf{s}_{1}\) in the context of equation (4). To perform source separation using our technique, we need snippets of data that do not contain glitches. We select these windows of data using an existing catalog and glitches (Scholz et al., 2020) and by further eye examination to ensure no glitch contaminates our dataset. In total, we collect 50 windows of length \(102.4\) s during sol 187 (6 June 2019) for the U component. We show four of these windows of data in Figure 5. We perform optimization for glitch removal using the same underlying scattering network architecture as the previous example using 50 training samples and 1000 L-BFGS iterations. Figure 6 summarizes the results. The top-left image shows the raw data. Top-right image is the baseline (Scholz et al., 2020) prediction for the glitch signal. Finally, the bottom row (from left to right) shows our predicted deglitched data and the glitch signal separated by our approach. As confirmed by experts at the InSight team, indeed our approach has removed a glitch that the baseline has ignored (most likely due the spike right at the beginning of the glitch signal). This is one of the benefits of our unsupervised approach as the method--based on the statistics of the training data--identifies and removes events that do not seem to belong to the training data distribution. See more deglitching examples in Figures 12- 15. Thanks to the interpretability of wavelet scattering covariance representations, we can perform a source separation quality control in domain where there is no access to ground truth source--as in our example. Figure 7 compares the power spectra of the reconstructed background noise (recorded data), a deglitched realization of the background noise and the mixed signal (observed data). It can be seen that the power spectrum of the background noise is correctly retrieved. In fact, the scattering covariance statistics, which extend the power spectrum, are correctly retrieved, which is due to the loss term in equation (6). Figure 4: Unsupervised source separation applied to the multifractal random walk data with a turbulent additive signal. The vertical axis is the same for all the plots. Figure 5: Glitch-free snippets of the seismic data from Mars (U component), #### 5.2.2 Marsquake background noise removal Marsquakes are of significant importance as they provide useful information regarding the Mars subsurface, enabling the study of Mars' interior (Knapmeyer-Endrun et al., 2021; Stahler et al., 2021; Khan et al., 2021). Recordings by the InSight lander's seismometer are susceptible to background noise and transient atmospheric signals, and here we apply our proposed unsupervised source separation approach to separate background noise from a marsquake (InSight Marsquake Service, 2023). To achieve this, we select about 14 hours of raw data (except for a detrending step)--from the U component with a 20Hz sampling rate--to fully characterize various aspects of the background noise through the wavelet scattering covariance representation. Next, we window the data and use the windows as training samples from background noise (\(\mathbf{n}_{k}\) in the context of equation (4)) with the goal of retrieving the marsquake recorded at February 3, 2022 (InSight Marsquake Service, 2023). We use the same network architecture as previous examples to setup the wavelet scattering covariance representation. We use a window size of \(204.8\,\mathrm{s}\) and solve the optimization problem in equation (12) with \(200\) L-BFGS iterations. The results are depicted in Figure 1. There are clearly two glitches that we have successfully separated, along with the background noise. This results is obtained merely by using 14 hours of raw data, allowing us to identify the marsquake as a separate source due to differences in wavelet scattering covariance representation. ## 6 Conclusions For source separation to be effective, prior knowledge concerning unknown sources is necessary. Data-driven methods of source separation extract this information from existing datasets during pretraining. In most cases, these methods require a large amount of data, which means that they are not suitable for planetary science missions. To address the challenge posed by limited data, we proposed an approach based on wavelet scattering covariances. We reaped the benefits of the inductive bias built into the scattering covariances, which enabled us to obtain low-dimensional data representations that characterize a wide range of non-Gaussian properties of multiscale stochastic processes without pretraining. Using a wavelet scattering covariance space optimization problem, we were able to separate thermally induced microtilts (glitches) from data recorded by the InSight lander's seismometer with only a few glitch-free data samples. In addition, we applied the same strategy to clean a marsquake from background and glitches using only a few hours of data that had no recorded marsquake. Our approach did not require any knowledge regarding glitches or marsquakes, and it was more robust in separating glitches from recorded data than existing signal-processing techniques. An important characteristic of our approach is that it can be used as an exploratory approach to unsupervised learning when exploring challenging and real-world datasets. ## 7 Acknowledgments Maarten V. de Hoop acknowledges support from the Simons Foundation under the MATH + X program, the National Science Foundation under grant DMS-2108175, and the corporate members of the Geo-Mathematical Imaging Group at Rice University. Figure 6: Unsupervised source separation for glitch removal. Juxtapose the predicted glitches on the right. Our approach is able to remove a glitch whereas the baseline approach fails to detect it. Figure 7: Power spectrum of the observed signal \(\mathbf{x}\), the background noise \(\mathbf{n}\) and the reconstructed background noise \(\tilde{\mathbf{n}}\). We see that the reconstructed component statistically agrees with a Mars seismic background noise \(\mathbf{n}\). The algorithm efficiently removed the low-pass component of the signal corresponding to a glitch. ## Appendix A Appendices ### Wavelet filters A wavelet \(\psi(t)\) has a fast decay away from \(t=0\), polynomial or exponential for example, and a zero-average \(\int\psi(t)\,\mathrm{d}t=0\). We normalize \(\int|\psi(t)|\,dt=1\). The wavelet transform computes the variations of a signal \(x\) at each dyadic scale \(2^{j}\) with \[\mathbf{W}\mathbf{x}(t,j)=\mathbf{x}\star\psi_{j}(t)\;\;\text{where}\;\;\psi_{ j}(t)=2^{-j}\psi(2^{-j}t).\] We use a complex wavelet \(\psi\) having a Fourier transform \(\widehat{\psi}(\omega)=\int\psi(t)\,e^{-i\omega t}\,\mathrm{d}t\) which is real, and whose energy is mostly concentrated at frequencies \(\omega\in[\pi,2\pi]\). It results that \(\widehat{\psi}_{j}(\omega)=\widehat{\psi}(2^{j}\omega)\) is non-negligible mostly in \(\omega\in[2^{-j}\pi,2^{-j+1}\pi]\). We impose that the wavelet \(\psi\) satisfies the following energy conservation law called Littlewood-Paley equality \[\forall\omega>0\;\;,\;\;\;\sum_{j=-\infty}^{+\infty}|\widehat{\psi}(2^{j} \omega)|^{2}=1. \tag{13}\] A Battle-Lemarie wavelet, see Figure 8, is an example of such wavelet. The wavelet transform is computed up to a largest scale \(2^{J}\) which is smaller than the signal size \(d\). The signal lower frequencies in \([-2^{-J}\pi,2^{-J}\pi]\) are captured by a low-pass filter \(\varphi_{J}(t)\) whose Fourier transform is \[\widehat{\varphi}_{J}(\omega)=\Big{(}\sum_{j=J+1}^{+\infty}|\widehat{\psi}(2 ^{j}\omega)|^{2}\Big{)}^{1/2}. \tag{14}\] One can verify that it has a unit integral \(\int\varphi_{J}(t)\,\mathrm{d}t=1\). To simplify notations, we write this low-pass filter as a last scale wavelet \(\psi_{J+1}=\varphi_{J}\), and \(\mathbf{W}\mathbf{x}(t,J+1)=\mathbf{x}\star\psi_{J+1}(t)\). By applying the Parseval formula, we derive from (13) that for all \(\mathbf{x}\) with \(\|\mathbf{x}\|^{2}=\int|\mathbf{x}(t)|^{2}\,dt<\infty\) \[\|\mathbf{W}\mathbf{x}\|^{2}=\sum_{j=-\infty}^{J+1}\|\mathbf{x}\star\psi_{j} \|^{2}=\|\mathbf{x}\|^{2}.\] The wavelet transform \(\mathbf{W}\) preserves the norm and is therefore invertible, with a stable inverse. ### Scattering network architecture A scattering network is a convolutional neural network with wavelet filters. In this paper we choose a simple 2-layer architecture with modulus non-linearity: \[S\mathbf{x}=\big{(}\mathbf{W}\mathbf{x},\mathbf{W}|\mathbf{W}\mathbf{x}| \big{)}.\] The wavelet operator \(\mathbf{W}\) is the same at the two layers, it uses \(J=8\) predefined Battle-Lemarie complex wavelets that are dilated from the same mother wavelet by powers of \(2\) (yielding one wavelet per octave). The first layer extracts \(J+1\) scale channels \(\mathbf{x}\star\psi_{j}(t)\) (corresponding to \(J\) band-pass and \(1\) low-pass wavelet filters). The second layer is \(\mathbf{W}|\mathbf{W}\mathbf{x}|(t;j_{1},j_{2})=|\mathbf{x}\star\psi_{j_{1}}| \star\psi_{j_{2}}(t)\). It is non-negligible only if \(j_{1}<j_{2}\). Indeed, the Fourier transform of \(|X\star\psi_{j_{1}}|\) is mostly concentrated in \([-2^{-j_{1}}\pi,2^{-j_{1}}\pi]\). If \(j_{2}\leq j_{1}\) then it does not intersect the frequency interval \([2^{-j_{2}}\pi,2^{-j_{2}+1}\pi]\) where the energy of \(\widehat{\psi}_{j_{2}}\) is mostly concentrated, in which case \(SX(t;j_{1},j_{2})\approx 0\). Instead of the modulus \(|\cdot|\) we could use another non-linearity that preserves the complex phase, however it does not improve significantly the results in this paper. ### Scattering Covariance dashboard The wavelet scattering covariance \(\Phi(\mathbf{x})\) (3) contains four types of coefficients \(\Phi(\mathbf{x})=\big{(}\Phi_{1}(\mathbf{x}),\Phi_{2}(\mathbf{x}),\Phi_{3}( \mathbf{x}),\Phi_{4}(\mathbf{x})\big{)}\). The first family provides \(J\) order \(1\) moment estimators, corresponding to wavelet sparsity coefficients \[\Phi_{1}(\mathbf{x})[j]=\mathrm{Ave}\,|\mathbf{x}\star\psi_{j}(t)|. \tag{15}\] The \(J+1\) second order wavelet spectrum associated to \(x\) are computed by \[\Phi_{2}(\mathbf{x})[j]=\mathrm{Ave}\,\big{(}|\mathbf{x}\star\psi_{j}(t)|^{2} \big{)}. \tag{16}\] There are \(J(J+1)/2\) wavelet phase-modulus correlation coefficients for \(a>0\), \[\Phi_{3}(\mathbf{x})[j;a]=\mathrm{Ave}\,\big{(}\mathbf{x}\star\psi_{j}(t)\,| \mathbf{x}\star\psi_{j-a}(t)|\big{)}. \tag{17}\] Finally, in total the scattering covariance includes \(J(J+1)(J+2)/6\) scattering modulus coefficients for \(a\geq 0\) and \(b<0\), \[\Phi_{4}(\mathbf{x})[j;a,b]=\mathrm{Ave}\,\big{(}|\mathbf{x}\star\psi_{j}| \star\psi_{j-b}(t)\,|\mathbf{x}\star\psi_{j-a}|\star\psi_{j-b}^{*}(t)\big{)}. \tag{18}\] These coefficients extend the standard wavelet power spectrum \(\Phi_{2}(\mathbf{x})\). After appropriate normalization and reduction that we describe below, scattering covariances can be visualized, and they provide a dashboard that displays non-Gaussian properties of \(\mathbf{x}\), which is shown for example in Figure 10. Figure 8: Left: complex Battle-Lemarie wavelet \(\psi(t)\) as a function of \(t\). Right: Fourier transform \(\widehat{\psi}(\omega)\) as a function of \(\omega\). The power spectrum \(\Phi_{2}(x)\) is plotted in a standard way, it is the energy of the scale channels of \(\mathbf{x}\star\psi_{j}(t)\). This energy affects the other coefficients \(\Phi_{1}(\mathbf{x}),\Phi_{3}(\mathbf{x}),\Phi_{4}(\mathbf{x})\). To deduct this influence, we normalize these coefficients by the power spectrum, \(\Phi_{1}(\mathbf{x})[j]/\sqrt{\Phi_{2}(\mathbf{x})[j]}\), \(\Phi_{3}(\mathbf{x})[j;a]/\sqrt{\Phi_{2}(\mathbf{x})[j]\Phi_{2}(\mathbf{x})[j-a]}\) and \(\Phi_{4}(\mathbf{x})[j;a,b]/\sqrt{\Phi_{2}(\mathbf{x})[j]\Phi_{2}(\mathbf{x})[j -a]}\). Finally, we average \(\Phi_{3}(x)\) and \(\Phi_{4}(x)\) on \(j\), in order to plot scaling invariant quantities, which reduces the number of coefficient to visualize. The dashboard is shown on Figure 10. ### Multifractal random walk realizations Here we show realizations of the multifractal random walk process used in the stylized example. ### Additional glitch removal results In this section we provide glitch removal results for a more diverse set of glitches.

2302.08980

Model Doctor for Diagnosing and Treating Segmentation Error

Despite the remarkable progress in semantic segmentation tasks with the advancement of deep neural networks, existing U-shaped hierarchical typical segmentation networks still suffer from local misclassification of categories and inaccurate target boundaries. In an effort to alleviate this issue, we propose a Model Doctor for semantic segmentation problems. The Model Doctor is designed to diagnose the aforementioned problems in existing pre-trained models and treat them without introducing additional data, with the goal of refining the parameters to achieve better performance. Extensive experiments on several benchmark datasets demonstrate the effectiveness of our method. Code is available at \url{https://github.com/zhijiejia/SegDoctor}.

Zhijie Jia, Lin Chen, Kaiwen Hu, Lechao Cheng, Zunlei Feng, Mingli Song

2023-02-17T16:35:24Z

http://arxiv.org/abs/2302.08980v2

# Model Doctor for Diagnosing and Treating Segmentation Error ###### Abstract Despite the remarkable progress in semantic segmentation tasks with the advancement of deep neural networks, existing U-shaped hierarchical typical segmentation networks still suffer from local misclassification of categories and inaccurate target boundaries. In an effort to alleviate this issue, we propose a Model Doctor for semantic segmentation problems. The Model Doctor is designed to diagnose the aforementioned problems in existing pre-trained models and treat them without introducing additional data, with the goal of refining the parameters to achieve better performance. Extensive experiments on several benchmark datasets demonstrate the effectiveness of our method. Code is available at [https://github.com/zhijiejia/SegDoctor](https://github.com/zhijiejia/SegDoctor). Zhijie Jia\({}^{\dagger}\), Lin Chen\({}^{\dagger}\), Kaiwen Hu\({}^{\dagger}\), Lechao Cheng\({}^{\dagger\dagger}\)1, Zunlei Feng\({}^{\dagger}\), Mingli Song\({}^{\dagger}\)\({}^{\dagger}\) Zhejiang University \({}^{\dagger\dagger}\) Zhejiang Lab Semantic segmentation, Model treatment. Footnote 1: Corresponding author. ## 1 Introduction Image segmentation [1, 2, 3] is a crucial task in the computer vision field, with a wide range of applications [4, 5], including scene understanding, video surveillance, medical image analysis, robotic perception, and so on. However, the current mainstream semantic segmentation techniques focus on the structural design of deep convolutional neural networks, but ignore the treatment and utilization of existing semantic segmentation models. In addition, the black box [6] structure of deep neural networks also contributes to the lack of ability to analyze problems from segmentation results, making it challenging to target errors and fine-tune the semantic segmentation model. There are currently model-interpretable methods that can assist in better understanding and analyzing models. However, much of the focus has been on visualizing model prediction results through techniques such as Class Activation Mapping (CAM) [7], Grad-CAM [8], and Grad-CAM++ [9]. Through these methods, the patterns that the model prioritizes and the areas of input that the model pays more attention to can be identified. Additionally, some works utilize the interpretable random forests algorithm to dissect deep neural networks [10], and decouple deep neural models, which facilitates rapid identification of the source and location of model errors. Nevertheless, these techniques cannot be applied directly and automatically to model treatment. In the preliminary experiments, we find that errors in semantic segmentation models can generally be divided into two types: semantic category errors and regional boundary errors. Semantic category errors arise from the inclusion of feature errors in deep semantic features, resulting in category classification errors for certain regions. On the other hand, region boundary errors occur due to the lack of fine edge detail features in shallow texture features, resulting in lost boundary information. In this paper, we introduce a Model Doctor to amend semantic category errors and regional boundary errors, respectively. As shown in Fig. 1, we apply semantic category treatment to deep semantic features extracted by deep neural networks to bridge the gap within classes in deep features and force intra-class features to converge to the category center. For regional boundary treatment, we constrain shallow texture features at various levels to enhance internal feature constraints on objects and preserve more edge detail features. Exhaustive experiments demonstrate that incorporating the proposed method with several semantic segmentation models leads to improved performance on commonly used datasets. Our contributions can be summarized as follows: * We present a Model Doctor for diagnostic treatment segmentation models, which can be plugged into existing convolutional segmentation models. Figure 1: Feature analysis of semantic segmentation model. The content of the red box represents the category error, and the content of the yellow box represents the boundary error. * Semantic category treating strategy and region boundary treating strategy are designed to address semantic category errors and region boundary errors, respectively. * Extensive experiments showcase that the proposed semantic segmentation model treating method can effectively boost the performance of existing semantic segmentation models. ## 2 Related Work Due to the complexity and ambiguity of deep neural networks, humans cannot give exact explanations for their behavior. At present, the interpretability methods of deep models are mainly divided into two categories [11]: Post-hoc interpretability analysis method and Ad-hoc interpretable modeling method. Post-hoc interpretability analysis method is an interpretable analysis of deep models that have been trained; Ad-hoc interpretable modeling method mainly builds deep models into interpretable models to ensure that the inferences of the models are interpretable. Post-hoc interpretability analysis method mainly include seven categories of techniques, such as feature analysis [12, 13, 14], model checking [6, 15], salient expression [16, 17], surrogate modeling [18], advanced mathematics analysis [19], case interpretation [20], and text interpretation [21]. Ad-hoc interpretable modeling method mainly includes two types of methods: interpretable representation [22] and model improvement [23]. However, the above methods mainly focus on model interpretation and cannot achieve automatic diagnosis and optimization of model defects. Recently, Feng et al. [24] proposed model doctor for the optimization of classified convolutional neural networks, but due to the difference between the segmentation model and the classification model architecture, this method cannot be applied to the semantic segmentation model. ## 3 Method In this paper, we present a novel model therapeutic approach for semantic segmentation models, designed to address the inadequacies in semantic category classification and boundary refinement of these models. ### Segmentation Error Diagnosis In the preliminary experiments, we find that semantic segmentation models are prone to regional boundary problems and category classification problems, and different model problems are related to different feature errors. #### 3.1.1 Semantic category error The semantic segmentation model is typically composed of an encoder and a decoder, where the encoder is responsible for extracting image features and the decoder is responsible for restoring image edge details. Given an input image \(I\), the output feature map of the last layer of the encoder is \(M^{e}\), computed as \(M^{e}=Encoder(I)\), where the shape of \(M^{e}\) is \((N,C,H,W)\), where \(N\) is back size, \(C\) is the number of channel and \((H,W)\) is the feature map size, and the vectors of each \((1,C,1,1)\) in \(M^{e}\) correspond to a patch in the original image. The deep features extracted by the encoder \(M^{e}\), possess a wealth of deep semantic information and semantic category information. The widening gap between the deep feature vectors signifies that the semantic category information of the corresponding patches is no longer equivalent, leading to subsequent classification errors. #### 3.1.2 Regional boundary error The extracted image features \(\{M_{1}^{e},M_{2}^{e},M_{3}^{e},...,M_{I}^{e},...,M_{L}^{e}\}\) of the encoder exhibit distinct attributes at various depths, where \(L\) is the maximum layer number in the encoder. While shallow image features \(M_{I}^{e}\) are rich in edge detail information, they lack semantic intricacies; Conversely, deep image features \(M_{I}^{e}\) are abundant in semantic information but deficient in edge detail. The extensive semantic features of \(M_{I}^{e}\) enable the model to perform efficient class classification, whereas the edge details present in \(M_{I}^{e}\) aid in partial reconstruction of the object's edge details by the decoder. Hence, during the decoding phase, the shallow and deep feature maps \(\{M_{l}^{e}\}_{l=1}^{L}\) are concatenated and processed by a convolutional function \(\mathcal{F}_{conv}\), to produce the feature map \(M_{i+1}^{d}\) of \(i\)-th layer as follows: \[M_{i}^{d}=\mathbf{Concat}(M_{l}^{e},M_{i-1}^{d}),l\in\{1,2,3,...,L\}, \tag{1}\] where the initial input feature map \(M_{1}^{d}\) of encoder is the output feature map \(M_{L}^{e}\) of the encoder. However, if the shallow feature \(M_{i}^{d}\) of the decoder contains errors in shallow detail information, the model will miss crucial detail information during the upsampling process, rendering it insensitive to the object's edge area and incapable of producing fine-grained edge details of the object. ### Segmentation Error Treatment In light of the aforementioned observations, we have developed a segmentation error diagnosis and treating method that encompasses both semantic category correction and regional boundary rectification, aiming at addressing the classification and boundary errors of the semantic segmentation model. #### 3.2.1 Treating Category error Consequently, in order to mitigate the impact of semantic category errors on deep features, we devise a category constraint technique for treating semantic category error. It constrains the deep features of the model by minimizing inter-class variations and maximizing intra-class similarity. To achieve this, the cluster center \(C_{k}\) for the \(k\)-th class in cluster \(D_{k}\) is computed to represent the central tendency of features within each class and provides a basis for comparison with other feature vectors. The cluster center \(C_{k}\) is calculated as follows: \[\operatorname*{arg\,min}_{C_{k}}\sum_{R_{k}\in D_{k}}||R_{k}-C_{k}||^{2}, \tag{2}\] where \(R_{k}\) is the feature representation in cluster \(D_{k}\). In the context of deep features, the image feature for a given class \(k\) is denoted as \(R_{k}\). To alleviate semantic errors and improve the model's classification accuracy, a feature distance constraint is imposed to force the intra-class image features to gravitate towards the centroid of the class cluster \(C_{k}\), which can mitigate intra-class feature divergence. The feature distance penalty \(\zeta_{sim}\) is calculated as follows: \[\zeta_{sim}=1-\mathcal{D}(C_{k},R_{k}),\mathcal{D}(C_{k},R_{k})=\frac{C_{k} \cdot R_{k}}{||C_{k}||\times||R_{k}||}, \tag{3}\] where '\(\cdot\)' denotes vector multiplication, \(\mathcal{D}(C_{k},R_{k})\) represents the feature distance between the feature representation \(R_{k}\) and the cluster center \(C_{k}\). #### 3.2.2 Treating boundary error In accordance with the information presented in Section 3.1.2, if the shallow image features contain erroneous texture feature information, this can result in inaccuracies in the decoder's fine edge reconstruction. To address this, superpixel technology is incorporated as superpixel branch, which is a coarse segmentation method that helps preserve edge details and enforce consistency within shallow image features. The SpixelFCN algorithm proposed in [25] is a noteworthy implementation of superpixel segmentation that leverages a fully convolutional network to achieve rapid and remarkable results. In this work, we drew inspiration from SpixelFCN to devise the superpixel branch, aiming to preserve the shallow texture features. The superpixel branch is assembled by a block consisting of three conv-bn-relu layers, which performs the upsampling operation and generates the link probability connecting the pixel to the neighboring superpixels. For shallow feature map \(M_{l}^{e}\), the superpixel branch \(\mathcal{F}_{sup}\) predicts the probability of \(p\) being associated with surrounding superpixels as follows: \[p=\sigma(\mathcal{F}_{sup}(M_{l}^{e})), \tag{4}\] where \(\sigma(\cdot)\) represents the sigmoid function. Then the reconstruction of pixel feature \(\mathbf{f}^{\prime}(\cdot)\) and pixel coordinates \(\mathbf{v}^{\prime}\) are calculated as follows: \[\mathbf{v}^{\prime}=\sum_{s\in\mathcal{N}_{\mathbf{v}}}\frac{\sum_{\mathbf{v} \cdot s\in\mathcal{N}_{\mathbf{v}}}\mathbf{v}\cdot p}{\sum_{\mathbf{v}\cdot s \in\mathcal{N}_{\mathbf{v}}}p}\cdot p, \tag{5}\] \[\mathbf{f}^{\prime}(\mathbf{v})=\sum_{s\in\mathcal{N}_{\mathbf{v}}}\frac{\sum _{\mathbf{v}\cdot s\in\mathcal{N}_{\mathbf{v}}}\mathbf{f}(\mathbf{v})\cdot p }{\sum_{\mathbf{v}\cdot s\in\mathcal{N}_{\mathbf{v}}}p}\cdot p, \tag{6}\] where \(\mathbf{v}=[x,y]^{T}\) denotes the original pixel's position, and \(\mathcal{N}_{\mathbf{v}}\) is the set of surrounding superpixels of \(\mathbf{v}\). The penalty function of the superpixel branch is divided into two parts: feature constraint and coordinate constraint, which is specified as follows: \[\zeta_{sp}=\sum_{\mathbf{v}}CE(\mathbf{f}(\mathbf{v}),\mathbf{f}^{\prime}( \mathbf{v}))+\frac{m}{s}||\mathbf{v}-\mathbf{v}^{\prime}||_{2}, \tag{7}\] where \(\mathbf{f}(\cdot)\) represents one-hot encoding vector of semantic label. \(s\) denotes the superpixel sampling interval, and \(m\) is a weight-balancing term, and \(CE(\cdot,\cdot)\) denotes Cross-Entropy. Overall, with the shallow feature map \(M_{l}^{e}\) as input, the first terms of \(\zeta_{sp}\) encourages the trained superpixel branch \(\mathcal{F}_{sup}\) to group pixels with similar category property, and the second term enforces the superpixels to be spatially compact. ### Overview Finally, the total loss function adopted is the original Cross-Entropy loss \(\zeta_{ce}\) combined with the category error loss \(\zeta_{sim}\) Figure 2: The framework of the proposed method, which is comprised of two parts: the semantic category treatment applied to the deep features, and the regional boundary treatment applied to the shallow features. and the boundary error loss \(\zeta_{sp}\) as follows: \[Loss=\zeta_{ce}+\alpha\zeta_{sim}+\beta\zeta_{sp}, \tag{8}\] where \(\alpha\) and \(\beta\) denote the balance parameters. ## 4 Experiment ### Dataset and Experiment setting **Dataset.** Our experimental evaluation is performed on two publicly available datasets, namely the PASCAL VOC 2012 [1] dataset and Cityscapes dataset [2]. The PASCAL VOC 2012 dataset, a semantic segmentation dataset with 20 categories, comprises 10,582 images in its training set and 1,449 images in its validation set. The Cityscapes dataset, a driving dataset for panoramic segmentation with 19 categories, comprises 2,975 images in the training set and 500 images in the validation set. **Experiment Setting.** During the training of models, we randomly crop images to 512 \(\times\) 512 (VOC) and 512 \(\times\) 1024 (Cityscapes) and utilize horizontal and vertical flipping augmentations. The batch size is set to 8 for all datasets, and the optimization is performed using Stochastic Gradient Descent (SGD). The initial learning rate is set at 0.01 and the cosine annealing rate decay policy is employed. The balance parameters are set as follows: \(\alpha=1\) and \(\beta=0.01\). The performance of the semantic segmentation is reported using the mean Intersection over Union (mIoU) metric. ### Compatibility with Existing Segmentation Models In the experiment, we adopt some mainstream segmentation network to verify the effectiveness of the proposed method. Results in Table 1 demonstrate that the proposed approach is able to enhance the performance of different models on the PASCAL VOC 2012 dataset and the Cityscapes dataset. ### Visual Results We demonstrate the efficacy of the proposed method by incorporating it into the UNet network on the VOC 2012 dataset, resulting in improved semantic segmentation performance. As depicted in Fig. 3, our method produces more accurate and nuanced structures, as evidenced by several visualizations from the VOC 2012 validation set. ### Ablation Study In this section, we conduct the ablation study on two treatment strategies. The ablation study experiment is conducted with UNet on the VOC 2012 dataset. As shown in Table 2, the semantic category treatment strategy and regional boundary treatment strategy both effectively enhance the performance of the segmentation model. ## 5 Conclusion In this paper, a new method called Model Docter is introduced to address semantic category errors and regional boundary errors in semantic segmentation. Semantic category treatment is applied to deep semantic features extracted by deep neural networks to reduce gaps within classes and correct misclassifications. Regional boundary treatment is imposed on shallow texture features to enhance internal feature constraints and preserve edge detail features. The proposed approach has been tested on several datasets and models and can be combined with other models for further refinement. \begin{table} \begin{tabular}{c|c|c|c|c} \hline \hline Dataset \(\rightarrow\) & \multicolumn{2}{c|}{VOC 2012} & \multicolumn{2}{c}{Cityscapes} \\ \hline Method \(\downarrow\) & Origin & +Treatment & Origin & **+**Treatment \\ \hline FPN & 61.7 & 62.5**(+0.8)** & 66.5 & 67.9**(+1.4)** \\ UNet & 54.0 & 55.2**(+1.2)** & 69.5 & 70.1**(+0.6)** \\ CCNet & 57.1 & 58.7**(+1.6)** & 70.8 & 72.0**(+1.2)** \\ PSPNet & 68.1 & 69.0**(+0.9)** & 72.8 & 74.1**(+1.3)** \\ Deeplab v3+ & 67.3 & 68.4**(+1.1)** & 74.2 & 74.9**(+0.7)** \\ \hline \hline \end{tabular} \end{table} Table 1: The performance on different models and datasets. \begin{table} \begin{tabular}{l c} \hline \hline **Method** & **mIoU** \\ \hline UNet & 54.0 \\ + Treating category & 54.4 **(+0.4)** \\ + Treating boundary & 54.8 **(+0.7)** \\ + Treating category \& boundary & 55.2 **(+1.2)** \\ \hline \hline \end{tabular} \end{table} Table 2: The ablation study on different treating strategies. Figure 3: Visual results on PASCAL VOC 2012 dataset.

2301.00654

On the existence and uniqueness of solution to a stochastic Chemotaxis-Navier-Stokes model

In this article, we study a mathematical system which models the dynamic of the collective behaviour of oxygen-driven swimming bacteria in an aquatic fluid flowing in a two dimensional bounded domain under stochastic perturbation. This model can be seen as a stochastic version of Chemotaxis-Navier-Stokes model. We prove the existence of a unique (probabilistic) strong solution. In addition, we establish some properties of the strong solution. More precisely, we prove that the unique solution is non-negative and satisfies the mass conservation property and an energy inequality.

Erika Hausenblas, Boris Jidjou Moghomye, Paul André Razafimandimby

2023-01-02T13:14:29Z

http://arxiv.org/abs/2301.00654v1

# On the existence and uniqueness of solution to a stochastic chemotaxis-Navier-Stokes model ###### Abstract. In this article, we study a mathematical system which models the dynamic of the collective behaviour of oxygen-driven swimming bacteria in an aquatic fluid flowing in a two dimensional bounded domain under stochastic perturbation. This model can be seen as a stochastic version of Chemotaxis-Navier-Stokes model. We prove the existence of a unique (probabilistic) strong solution. In addition, we establish some properties of the strong solution. More precisely, we prove that the unique solution is non-negative and satisfies the mass conservation property and an energy inequality. Key words and phrases:Navier-Stokes system; Chemotaxis; Stochastic; Probabilistic weak solution; strong solution 2000 Mathematics Subject Classification: 35R60,35Q35,60H15,76M35,86A05 ## 1. Introduction The migration of bacteria cells to a higher concentration of a chemical has been observed in biological applications concerning aerobic bacteria. This phenomenon, called chemotaxis, is presumed to have a deep impact on the time evolution of a bacteria population. There are different concepts of chemotaxis depending on the kind of bacteria and the chemical. In the present article, we focus on the mathematical model describing an oxygen-driven bacteria suspension swimming in an incompressible fluid like water which was firstly proposed in [39]. Mainly, the system consists of three coupled partial differential equations. The first equation describes the fluid flow with field velocity \(\mathbf{u}\). The second equation describes the dynamic of the oxygen concentration \(c\), and the last equation describes the dynamic of the population density \(n\) of the bacteria. Now, the coupled model can be written as \[\begin{cases}d\mathbf{u}+\left[(\mathbf{u}\cdot\nabla)\mathbf{u}+\nabla P-\eta \Delta\mathbf{u}\right]dt=n\nabla\Phi dt\ \ \text{in}\ \left[0,T\right]\times\mathcal{O},\\ dc+\mathbf{u}\cdot\nabla cdt=\left[\mu\Delta c-nf(c)\right]dt\ \ \text{in}\ \left[0,T\right]\times \mathcal{O},\\ dn+\mathbf{u}\cdot\nabla ndt=\left[\delta\Delta n-\nabla\cdot(n\chi(c)\nabla c )\right]dt\ \ \text{in}\ \left[0,T\right]\times\mathcal{O},\\ \nabla\cdot\mathbf{u}=0\ \text{in}\ \left[0,T\right]\times\mathcal{O},\\ n(0)=n_{0},\quad c(0)=c_{0},\quad\mathbf{u}(0)=\mathbf{u}_{0}\qquad\text{in} \qquad\mathcal{O}.\end{cases} \tag{1.1}\] In addition to the unknows \(\mathbf{u}\), \(c\), \(n\), we have the scalar pressure \(P\). The positive number \(T\) is the final observation time, and \(\mathcal{O}\subset\mathbb{R}^{2}\) is a domain where the cells and the fluid move and interact. The positive constants \(\eta\), \(\mu\) and \(\delta\) are the corresponding diffusion coefficients for the fluid, the oxygen, and the bacteria, respectively. The given functions \(\chi\) and \(f\) denote the chemotactic sensitivity and the oxygen consumption rate, respectively. The symbol \(\Phi\) denotes a given time-independent potential function representing, e.g., the gravitational force or centrifugal force. The mathematical analysis of system (1.1) has been investigated by several authors. The existence of weak solutions and the existence of a unique classical solution have been proven, see for instance [9, 10, 15, 16, 18, 25, 36, 37, 42, 43] and references therein. In the case \(d=2\), the existence of a global weak solutions for (1.1) without the nonlinear convective term \((\mathbf{u}\cdot\nabla)\mathbf{u}\) is obtained in [16, 36, 37] and in [18] with nonlinear diffusion. The existence of weak global solutions under various assumptions on the data can be found in [15, 25]; the global existence of smooth solutions has been proven in [10, 42]. Results on the existence of classical solution are found in [9, 16, 43]. Fix \(T>0\). In this paper, we are interested in the mathematical analysis of a stochastic version of problem (1.1) in the two-dimensional bounded domain. More precisely, for a given family of independent, identically distributed standard real-valued Brownian motions \(\{\beta^{k}\}_{k=1,2}\), and a cylindrical Wiener processes \(W\) evolving on a fixed separable Hilbert space \(\mathcal{U}\) defined on a filtered probability space, \((\Omega,\mathbb{F},(\mathcal{F}_{t})_{t\in[0,T]},\mathbb{P})\), we consider the following system \[\begin{cases}d\mathbf{u}+\left[(\mathbf{u}\cdot\nabla)\mathbf{u}+\nabla P- \eta\Delta\mathbf{u}\right]dt=n\nabla\Phi dt+g(\mathbf{u},c)dW_{t}\ \ \text{in}\ \ [0,T]\times\mathcal{O},\\ dc+\mathbf{u}\cdot\nabla cdt=\left[\mu\Delta c-nf(c)\right]dt+\gamma\sum_{k=1} ^{2}\sigma_{k}\cdot\nabla c\circ d\beta_{t}^{k}\ \ \text{in}\ \ [0,T]\times\mathcal{O},\\ dn+\mathbf{u}\cdot\nabla ndt=\left[\delta\Delta n-\nabla\cdot(n\chi(c)\nabla c )\right]dt\ \ \text{in}\ \ [0,T]\times\mathcal{O},\\ \nabla\cdot\mathbf{u}=0\ \ \text{in}\ \ [0,T]\times\mathcal{O},\\ \frac{\hat{\sigma}n}{\hat{\sigma}\nu}=\frac{\hat{\sigma}c}{\hat{\sigma}\nu}= 0\qquad\text{on}\qquad[0,T]\times\hat{\sigma}\mathcal{O},\\ \mathbf{u}=0\qquad\text{on}\qquad[0,T]\times\hat{\sigma}\mathcal{O},\\ n(0)=n_{0},\quad c(0)=c_{0},\quad\mathbf{u}(0)=\mathbf{u}_{0}\qquad\text{ in}\qquad\mathcal{O},\end{cases} \tag{1.2}\] where \(\mathcal{O}\subset\mathbb{R}^{2}\) is a bounded domain with smooth boundary \(\hat{\sigma}\mathcal{O}\) and the positive constant \(\gamma\) is the intensity of the noise. The symbol \(\circ\) means that the stochastic differential is understood in the Stratonovich sense. The main difference between the deterministic model (1.1) and the stochastic model (1.2) is the presence of the terms \(g(\mathbf{u},c)dW_{t}\) and \(\gamma\sum_{k=1}^{2}\sigma_{k}\cdot\nabla c\circ d\beta_{t}^{k}\) called noise terms. The presence of these noise terms weakened the regularity in time of the velocity field and the concentration of oxygen and so, make the mathematical analysis more involved. Our investigation is motivated by the need for a sound mathematical analysis for the understanding of the effect of small scale perturbations such as random pollution of water or air which are inherently present in nature (see [11, 29]). The presence of these stochastic perturbations can lead to new and important phenomena. In fact, in two-dimensional case, many models such as the Navier-Stokes equation, the Oldroy-B type model, the Landau-Lifshitz-Bloch equation, and magnetohydrodynamics model with sufficiently degenerate noise for example have a unique invariant measure and hence exhibit ergodic behavior in the sense that the time average of a solution is equal to the average over all possible initial data. Despite continuous efforts in the last 30 years, such property has so far not been found for the deterministic counterpart of these equations. This property could lead to profound understanding of the nature of turbulence. To the best of our knowledge, the only papers that consider the mathematical analysis of a stochastic version of chemotaxis-fluid interaction model are [44, 45] where the authors have proved the existence of both mild and weak solutions for the model (1.2) with \(\gamma=0\) and \(g(\mathbf{u},c)=g(\mathbf{u})\) in a two and three dimensional bounded domain under some strong assumptions on the data. The aim of this article is to study the global resolvability of problem (1.2) with positive parameters \(\eta\), \(\mu\)\(\gamma\) and \(\delta\) different from zero. We prove the existence and uniqueness of a probabilistic strong solution in a two dimensional bounded domain. The proof is based on a Galerkin scheme and the Yamada-Watanabe Theorem. Let us recall that the presence of the noise on the \(c\)-equation makes the mathematical analysis of the model more involved. In fact, the noise term in \(c\)-equation makes impossible the application of the deterministic maximum principle method for the proof of the non-negativity of solution as is done in the literature. Moreover, the stochastic version of maximum principle method where we learn from [14] need to be adapted in order to conserve the positivity of solutions. The main difference between our work and that of [44] is that the model considered in [44] does not contain any noise on the \(c\)-equation and the noise term in the \(\mathbf{u}\) equation depend only on the velocity field \(\mathbf{u}\). Therefore, the present paper can be seen as a generalization of [44]. The organisation of this article is as follows. In Section 2, we define various functional spaces, and introduce assumptions which are used throughout in our paper. In Section 3, we state and prove the main result which is the existence of a unique probabilistic strong solution. In Section 4, we give a detailed proof of important ingredients which have been useful for the proof of the main result. In Section 5, we prove the mass conservation property and the non-negativity of the strong solution. Besides that, we prove an energy inequality which may be useful for the study of the invariant measure in future. ## 2. Functional setting of the model and assumptions Throughout the paper, we assume that \(\mathcal{O}\subset\mathbb{R}^{2}\) is a bounded domain with boundary \(\partial\mathcal{O}\) of class \(C^{\infty}\). The symbol \(L^{p}(\mathcal{O})\) denotes the \(L^{p}\) space with respect to the Lebesgue measure while \(W^{m,p}(\mathcal{O})\) denotes the Sobolev space of functions whose distributional derivatives of order up to \(m\) belong to \(L^{p}(\mathcal{O})\). The spaces of functions \(\phi:\mathcal{O}\rightarrow\mathbb{R}^{2}\) such that each component of \(\phi\) belongs to \(L^{p}(\mathcal{O})\) or to \(W^{m,p}(\mathcal{O})\) are denoted by \(\mathbb{L}^{p}(\mathcal{O})\) or by \(\mathbb{W}^{m,p}(\mathcal{O})\). We denote by \(|.|_{L^{p}}\) the norm on \(L^{p}(\mathcal{O})\) or \(\mathbb{L}^{p}(\mathcal{O})\) and by \(\left\|.\right\|_{W^{m,q}}\) the norm on \(W^{m,p}(\mathcal{O})\) or \(\mathbb{W}^{m,p}(\mathcal{O})\). For \(p=2\) the function space \(W^{m,2}(\mathcal{O})\) (resp. \(\mathbb{W}^{m,2}(\mathcal{O})\)) is denoted by \(H^{m}(\mathcal{O})\) (resp. \(\mathbb{H}^{m}(\mathcal{O})\)) and its norm will be denoted by \(|\cdot|_{H^{m}}\). By \(\mathbb{H}^{1}_{0}(\mathcal{O})\) we mean the space of functions in \(\mathbb{H}^{1}\) that vanish on the boundary \(\partial\mathcal{O}\). The inner product on \(L^{2}(\mathcal{O})\) will be denoted by \((\cdot,\cdot)\). Following the notations using in [38] for the Navier-Stokes model, we introduce the following space \(\mathcal{V}=\{\mathbf{v}\in C_{c}^{\infty}(\mathcal{O};\mathbb{R}^{2}):\) such that \(\nabla\cdot\mathbf{v}=0\},\) and define the spaces \(H\) and \(V\) as the closure of \(\mathcal{V}\) in \(\mathbb{L}^{2}(\mathcal{O})\) and \(\mathbb{H}^{1}_{0}(\mathcal{O})\), respectively. We endow \(H\) with the scalar product and norm of \(\mathbb{L}^{2}(\mathcal{O})\). As usual, we equip the space \(V\) with the gradient-scalar product and the gradient-norm \(|\nabla\cdot|_{L^{2}}\), which is equivalent to the \(\mathbb{H}^{1}_{0}(\mathcal{O})\)-norm. As usual, \(\mathcal{P}\) denotes the Helmholtz projection from \(\mathbb{L}^{2}(\mathcal{O})\) onto \(H\). It is also known that \(V\) is dense in \(H\) and that the embedding is continuous and compact. Identifying \(H\) with its dual, we have the Gelfand triple \(V\hookrightarrow H\hookrightarrow V^{*}\). We define the Newmann Laplacian operator on \(L^{2}(\mathcal{O})\) by \(A_{1}\phi=-\Delta\phi\) for all \(\phi\in D(A_{1})\) where \[D(A_{1})=\{\phi\in H^{2}(\mathcal{O}):\frac{\partial\phi}{\partial\nu}=0,\ \ \mbox{on}\ \ \partial\mathcal{O}\}.\] It is known that \(A_{1}\) is a non-negative self-adjoint operator in \(L^{2}(\mathcal{O})\). As we are working on a bounded domain, \(A_{1}\) has compact resolvent, see e.g. [7]. Hence, there exists an orthonormal basis \(\{\varphi_{i}\}_{i=1}^{\infty}\subset C^{\infty}(\mathcal{O})\) of \(L^{2}(\mathcal{O})\) consisting of the eigenfunctions of the Neumann Laplacian \(A_{1}\). Also we have the dense and compact embeddings \(H^{2}(\mathcal{O})\hookrightarrow H^{1}(\mathcal{O})\hookrightarrow L^{2}( \mathcal{O})\). Now we define the Hilbert space \(\mathcal{H}\) by \[\mathcal{H}=H\times H^{1}(\mathcal{O}),\] endowed with the scalar product whose associated norm is given by \[\left|(\mathbf{u},c)\right|_{\mathcal{H}}^{2}=\left|\mathbf{u}\right|_{L^{2}}^ {2}+\left|c\right|_{H^{1}}^{2},\ \ (\mathbf{u},c)\in\mathcal{H}.\] We introduce the bilinear operators \(B_{0}\), \(B_{1}\) and \(R_{2}\) and their associated trilinear forms \(b_{0}\), \(b_{1}\) and \(r_{2}\) respectively as follows: \[(B_{0}(\mathbf{u},\mathbf{v}),\mathbf{w})=\int_{\mathcal{O}} \left[(\mathbf{u}(x)\cdot\nabla)\mathbf{v}(x)\right]\cdot\mathbf{w}(x)dx=b_{0 }(\mathbf{u},\mathbf{v},\mathbf{w}),\ \ \forall\mathbf{u}\in V,\ \ \mathbf{v}\in V,\ \ \mathbf{w}\in V,\] \[(B_{1}(\mathbf{u},c),\psi)=\int_{\mathcal{O}}\mathbf{u}(x)\cdot \nabla c(x)\psi(x)dx=b_{1}(\mathbf{u},c,\psi),\ \ \forall\mathbf{u}\in V,\ \ c\in H^{1}(\mathcal{O}),\ \ \psi\in H^{1}(\mathcal{O}),\] \[(R_{2}(n,c),\psi) =\int_{\mathcal{O}}\nabla\cdot(n(x)\nabla c(x))\psi(x)dx\] \[=-\int_{\mathcal{O}}n(x)\nabla c(x)\cdot\nabla\psi(x)dx=r_{2}(n,c,\psi),\ \ \forall n\in L^{2}(\mathcal{O}),\ \ c\in H^{1}(\mathcal{O}),\ \ \psi\in H^{3}(\mathcal{O}).\] It is well known in [38, Chapter II, Section 1.2] that the operator \(B_{0}\) is well-defined. The operator \(B_{1}\) is well-defined for \(\mathbf{u}\in V\), \(c\in H^{1}(\mathcal{O})\) and \(\psi\in H^{1}(\mathcal{O})\) since by the Holder inequality and the Sobolev embedding of \(H^{1}(\mathcal{O})\) into \(L^{4}(\mathcal{O})\), we have \[(B_{1}(\mathbf{u},c),\psi) \leq\left|\mathbf{u}\right|_{L^{4}}\left|\nabla c\right|_{L^{2}} \left|\psi\right|_{L^{4}}\] \[\leq\mathcal{K}\left|\nabla\mathbf{u}\right|_{L^{2}}\left|c\right| _{H^{1}}\left|\psi\right|_{H^{1}}.\] In a similar way, we can also check that the operator \(R_{2}\) is well-defined for \(n\in L^{2}(\mathcal{O})\), \(c\in H^{1}(\mathcal{O})\) and \(\psi\in H^{1}(\mathcal{O})\). In fact, in addition to the Holder inequality, by using the Sobolev embedding of \(H^{2}(\mathcal{O})\) into \(L^{\infty}(\mathcal{O})\), we see that \[(R_{2}(n,c),\psi) \leq\left|n\right|_{L^{2}}\left|\nabla c\right|_{L^{2}}\left| \nabla\psi\right|_{L^{\infty}}\] \[\leq\left|n\right|_{L^{2}}\left|c\right|_{H^{1}}\left|\psi\right| _{H^{3}}.\] We also introduce the following coupling mappings \(R_{0}\) and \(R_{1}\) \[(R_{0}(n,\varPhi),\mathbf{v})=\int_{\mathcal{O}}n(x)\nabla\varPhi(x)\cdot \mathbf{v}(x)dx,\ \ \forall n\in L^{2}(\mathcal{O}),\ \ \mathbf{v}\in H,\ \ \varPhi\in W^{1,\infty}(\mathcal{O}),\] \[(R_{1}(n,c),\psi)=\int_{\mathcal{O}}n(x)f(c(x))\psi(x)dx,\ \ \forall n\in L^{2}(\mathcal{O}),\ \ c\in L^{\infty}(\mathcal{O}),\ \ \psi\in L^{2}(\mathcal{O}),\ \ f\in L^{ \infty}(\mathbb{R}).\] We note that the operators \(R_{0}\) and \(R_{1}\) are well-defined. Indeed, for \(n\in L^{2}(\mathcal{O})\), \(\mathbf{v}\in H\) and \(\varPhi\in W^{1,\infty}(\mathcal{O})\) we see that \[(R_{0}(n,\varPhi),\mathbf{v})\leq\left|\varPhi\right|_{W^{1,\infty}}\left|n \right|_{L^{2}}\left|\mathbf{v}\right|_{L^{2}}.\] Further, for \(n\in L^{2}(\mathcal{O})\), \(c\in L^{\infty}(\mathcal{O})\), \(\psi\in L^{2}(\mathcal{O})\) and \(f\in L^{\infty}(\mathbb{R})\), we also see that \[(R_{1}(n,c),\psi)\leq\left|f(c)\right|_{L^{\infty}}\left|n\right|_{L^{2}} \left|\psi\right|_{L^{2}}.\] Hereafter, \(\mathfrak{A}:=(\Omega,\mathbb{F},(\mathcal{F}_{t})_{t\in[0,T]},\mathbb{P})\) will be a complete probability space equipped with a filtration \((\mathcal{F}_{t})_{t\in[0,T]}\) satisfying the usual conditions, i.e. the filtration is right-continuous and all null sets of \(\mathcal{F}\) are elements of \(\mathcal{F}_{0}\). Let \(\mathcal{U}\) be a separable Hilbert space with basis \(\{e_{k}\}_{k=1}^{\infty}\) and \(W\) be a cylindrical Wiener process over \(\mathcal{U}\). In particular, according to [12, Proposition 4.3] the Wiener process \(t\mapsto W_{t}\) can be expressed as \[W_{t}=\sum_{k=1}^{\infty}W_{t}^{k}e_{k},\qquad\text{for \ all \ }t\in[0,T],\] where \(\{W^{k}:k\in\mathbb{N}\}\) is a family of mutually independent standard \(\mathbb{R}\)-valued Brownian motion over \(\mathfrak{A}\). For any Hilbert space \(X\), we will denote by \(\mathcal{L}^{2}(\mathcal{U};X)\) the separable Hilbert space of Hilbert-Schmidt operators from \(\mathcal{U}\) into \(X\). For a separable Banach space \(X\), \(p\in[1,\infty)\) and \(T>0\) we denote by \(\mathcal{M}_{\mathfrak{A}}^{p}(0,T;X)\) the space of all processes \(\psi\in L^{p}(\Omega\times(0,T),d\mathbb{P}\otimes dt;X)\) over \(\mathfrak{A}\), being \(\{\mathcal{F}_{t}\}_{t\in[0,T]}\)-progressively measurable. We denote by \(L^{p}(\Omega;C([0,T];X))\), \(1\leq p<\infty\), the space of all continuous and \(\{\mathcal{F}_{t}\}_{t\in[0,T]}\)-progressively measurable \(X\)-valued processes \(\{\psi_{t};\ \ 0\leq t\leq T\}\) over \(\mathfrak{A}\) satisfying \[\mathbb{E}\left[\sup_{t\in[0,T]}\|\psi_{t}\|_{X}^{p}\right]<+\infty.\] If \(Y\) is a Banach space, we will denote by \(\mathcal{L}(X,Y)\) the space of bounded linear operators. From the theory of stochastic integration on infinite dimensional Hilbert space (see [12, Chapter 4]), for any process \(\rho\in\mathcal{M}_{\mathfrak{A}}^{2}(0,T;\mathcal{L}^{2}(U;H))\), the stochastic integral of \(\rho\) with respect to the Wiener process \(t\mapsto W_{t}\) is denoted by \[\int_{0}^{t}\rho(s)dW_{s},\quad 0\leq t\leq T,\] and is defined as the unique continuous \(H\)-valued martingale over \(\mathfrak{A}\), such that for all \(h\in H\), we have \[\left(\int_{0}^{t}\rho(s)dW_{s},h\right)_{H}=\sum_{k=1}^{\infty}\int_{0}^{t}( \rho(s)e_{k},h)_{H}dW_{s}^{k},\quad 0\leq t\leq T,\] where the integral with respect to \(dW_{s}^{k}\) is understood in the sense of Ito. We introduce now the following conditions on the parameters and functions involved in the system (1.2). **Assumption 2.1**.: _For the parameter functions \(\chi\), \(f\) and \(\varPhi\) in (1.2), we assume that \(\chi(c)\) is a non-negative constant, i.e. \(\chi(c)=\chi>0\) and require that \(f\) and \(\varPhi\) satisfy_ \[\begin{array}{l}f\in C^{1}([0,\infty)),\qquad f(0)=0,\qquad\text{and}\qquad f >0,\qquad f^{\prime}>0\qquad\text{in \ }(0,\infty),\\ \varPhi\text{ is time-independent \ and \ }\varPhi\in W^{1,\infty}(\mathcal{O}). \end{array} \tag{2.1}\] Throughout this paper, we set \[\mathcal{K}_{f}:=\frac{\chi^{2}}{2\delta\min_{0\leq c\leq|c_{0}|_{L^{\infty}} }f^{\prime}}+\frac{1}{\min_{0\leq c\leq|c_{0}|_{L^{\infty}}}f^{\prime}}. \tag{2.2}\] Furthermore, we consider a family of vector fields \(\{\sigma_{1},\sigma_{2}\}\) satisfying the following assumptions. **Assumption 2.2**.: 1. _For_ \(k\in\{1,2\}\)_,_ \(\sigma_{k}:=(\sigma_{k}^{1},\sigma_{k}^{2})\in W^{1,\infty}(\mathcal{O})\times W ^{1,\infty}(\mathcal{O})\) _and_ \(\sigma_{k}=0\) _on_ \(\partial\mathcal{O}\)_._ 2. \(\sigma_{k}\) _is a divergence free vector fields, that is_ \(\nabla\cdot\sigma_{k}=0\)_, for_ \(k=1,2\) **(A\({}_{3}\))** _The matrix-valued function_ \(q:\mathcal{O}\times\mathcal{O}\rightarrow\mathbb{R}^{2}\otimes\mathbb{R}^{2}\) _defined by_ \[q^{i,j}(x,y)=\sum_{k=1}^{2}\sigma_{k}^{i}(x)\sigma_{k}^{j}(y),\qquad\forall i,j=1, 2\ \ \text{and}\ \ \forall x,y\in\mathcal{O}, \tag{2.3}\] _satisfies_ \(q(x,x)=Id_{\mathbb{R}^{2}}\) _for any_ \(x\in\mathcal{O}\)_._ Before introducing the other standing assumptions used in this paper, we shall make few important remarks and observations on Assumption 2.2 and the noise \(\sum\limits_{k=1}^{2}\sigma_{k}\cdot\nabla c\circ d\beta_{t}^{k}\). **Remark 2.1**.: Setting for \(k=1,2\), \[\sigma_{k}(x)=\begin{cases}g_{k}&\text{if}\ \ x\in\bar{\mathcal{O}}\backslash \partial\mathcal{O},\\ 0&\text{if}\ \ x\in\partial\mathcal{O},\end{cases}\] where \(\{g_{1},g_{2}\}\) is the canonical basis of \(\mathbb{R}^{2}\), the family of vector fields \(\{\sigma_{1},\sigma_{2}\}\) satisfies (**A\({}_{1}\)**), (**A\({}_{2}\)**) and (**A\({}_{3}\)**). Hereafter we will use the following notation \[\left|\sigma\right|_{L^{\infty}}=\left(\sum_{k=1}^{2}\left|\sigma_{k}\right|_{ L^{\infty}}^{2}\right)^{1/2}\quad\text{and}\quad\left|\sigma\right|_{W^{1, \infty}}=\left(\sum_{k=1}^{2}\left|\sigma_{k}\right|_{W^{1,\infty}}^{2}\right) ^{1/2}. \tag{2.4}\] Owing to [17, p. 65, Section 4.5.1], the Stratonovich integral \(\gamma\int_{0}^{t}\sigma_{k}\cdot\nabla c(s)\circ d\beta_{s}^{k}\) can be expressed as the Ito integral with a correction term as follows: \[\gamma\int_{0}^{t}\sigma_{k}\cdot\nabla c(s)\circ d\beta_{s}^{k}=\frac{1}{2} \int_{0}^{t}D_{c}(\gamma\sigma_{k}\cdot\nabla c(s))(\gamma\sigma_{k}\cdot \nabla c(s))ds+\gamma\int_{0}^{t}\sigma_{k}\cdot\nabla c(s)d\beta_{s}^{k}, \tag{2.5}\] where, \(D_{c}(\gamma\sigma_{k}\cdot\nabla c)\) denotes the Frechet derivative of \(\gamma\sigma_{k}\cdot\nabla c\) with respect to \(c\). **Lemma 2.2**.: _If Assumption 2.2 holds, then for all \(t\in[0,T]\),_ \[\frac{1}{2}\int_{0}^{t}\sum_{k=1}^{2}D_{c}(\gamma\sigma_{k}\cdot\nabla c(s))( \gamma\sigma_{k}\cdot\nabla c(s))ds=\frac{\gamma^{2}}{2}\int_{0}^{t}\Delta c( s)ds,\ \ c\in H^{2}(\mathcal{O}). \tag{2.6}\] Proof.: Let \(c\in H^{2}(\mathcal{O})\) and \(t\in[0,T]\) be arbitrary but fixed. Then for all \(s\in[0,t]\) and \(k=1,2\), \[\sum_{k=1}^{2}D_{c}(\gamma\sigma_{k}\cdot\nabla c)(\gamma\sigma_{k}\cdot \nabla c)=\gamma\sum_{k=1}^{2}\sigma_{k}\cdot\nabla(\gamma\sigma_{k}\cdot \nabla c)=\gamma^{2}\sum_{k=1}^{2}\sigma_{k}\cdot\nabla(\sigma_{k}\cdot\nabla c).\] Since \(\nabla\cdot\sigma_{k}=0\), we remark that \(\sigma_{k}\cdot\nabla c=\nabla\cdot(c\sigma_{k})\) and therefore, \[\gamma^{2}\sum_{k=1}^{2}\sigma_{k}\cdot\nabla(\sigma_{k}\cdot\nabla c)=\gamma ^{2}\sum_{k=1}^{2}\sigma_{k}\cdot\nabla(\nabla\cdot(c\sigma_{k}))=\gamma^{2} \sum_{k=1}^{2}\nabla\cdot\left(\sigma_{k}\nabla\cdot(c\sigma_{k})\right). \tag{2.7}\] For the second equality we have used once more the fact that \(\nabla\cdot\sigma_{k}=0\) for all \(k=1,2\). Since \(\sigma_{k}=(\sigma_{k}^{1},\sigma_{k}^{2})\in W^{1,\infty}(\mathcal{O})\times W ^{1,\infty}(\mathcal{O})\) and \(c\in H^{2}(\mathcal{O})\hookrightarrow L^{\infty}(\mathcal{O})\), we can apply the differentiation of product formula given in [2, Proposition 9.4, P. 269] to obtain, \[\sum_{k=1}^{2}\nabla\cdot\left(\sigma_{k}(\nabla\cdot(c\sigma_{k}))=\sum_{i,j= 1}^{2}\frac{\partial^{2}}{\partial x_{i}\partial x_{j}}(q^{ij}(x,x)c)-\nabla \cdot\left(\left(\sum_{k=1}^{2}\sigma_{k}\cdot\nabla\sigma_{k}\right)c\right), \tag{2.8}\] where \(\sigma_{k}\cdot\nabla\sigma_{k}\) is the vector field with components \[(\sigma_{k}\cdot\nabla\sigma_{k})^{i}=\sum_{j=1}^{2}\sigma_{k}^{j}\frac{\partial }{\partial x_{j}}\sigma_{k}^{i}.\] Applying the differentiation of product formula once more, for \(j=1,2\), we see that \[\sum_{k=1}^{2}\sum_{j=1}^{2}(\nabla\sigma_{k}\cdot\sigma_{k})^{i}=\sum_{j=1}^{ 2}\frac{\partial}{\partial x_{j}}q^{ij}(x,x)-\sum_{k=1}^{2}\sigma_{k}^{i} \nabla\cdot\sigma_{k}=\sum_{j=1}^{2}\frac{\partial}{\partial x_{j}}\delta_{ij} =0. \tag{2.9}\] In (2.9), we have used the fact that \(\nabla\cdot\sigma_{k}=0\) and also the fact that \(q^{ij}=\delta_{ij}\) (see (\(\mathbf{A}_{3}\)) of assumption 2). From (2.8) and (2.9), we infer that \[\sum_{k=1}^{2}\nabla\cdot(\sigma_{k}\nabla\cdot(c\sigma_{k}))=\sum_{i,j=1}^{2 }\frac{\partial^{2}}{\partial x_{i}\partial x_{j}}(q^{ij}(x,x)c)=\sum_{i,j=1} ^{2}\frac{\partial^{2}}{\partial x_{i}\partial x_{j}}(\delta_{ij}c)=\Delta c. \tag{2.10}\] Combining (2.10) and (2.7), we derive (2.6) which completes the proof of Lemma 2.2. Define for \(k\in\{1,2\}\), a map \(\phi_{k}:H^{1}(\mathcal{O})\to L^{2}(\mathcal{O})\) by \(\phi_{k}(c)=\sigma_{k}\cdot\nabla c\). Then, the map \(\phi:H^{1}(\mathcal{O})\to\mathcal{L}^{2}(\mathbb{R}^{2};L^{2}(\mathcal{O}))\) given by \[\phi(c)(h)=\sum_{k=1}^{2}\phi_{k}(c)h_{k},\qquad c\in H^{1}(\mathcal{O}),\ \ h=(h_{1},h_{2})\in\mathbb{R}^{2},\] is well defined under the condition (\(\mathbf{A}_{1}\)). Let \(\{g_{1},g_{2}\}\) be the orthonormal basis of \(\mathbb{R}^{2}\) then \(\phi(c)(g_{k})=\phi_{k}(c)\), for all \(c\in H^{1}(\mathcal{O})\). Let \(\beta=(\beta^{1},\beta^{2})\) be a standard two dimensional Brownian motion over \(\mathfrak{A}\), independent of \(W\). We will repeatedly use the following notation \[\phi(c)d\beta_{s}=\sum_{k=1}^{2}\phi_{k}(c)d\beta_{s}^{k}. \tag{2.11}\] We recall that throughout this paper, the symbols \(\mathcal{K}\), \(\mathcal{K}_{GN}\) and \(\mathcal{K}_{i}\), \(i\in\mathbb{N}\) will denote positive constants which may change from one line to another. **Assumption 2.3**.: _Let \(g:\mathcal{H}\to\mathcal{L}^{2}(\mathcal{U},H)\) be a continuous mapping. In particular, there exists a positive constant \(L_{g}\) such that for any \((\mathbf{u},c)\in\mathcal{H}\),_ \[\left|g(\mathbf{u},c)\right|_{\mathcal{L}^{2}(\mathcal{U},H)}\leqslant L_{g}( 1+\left|(\mathbf{u},c)\right|_{\mathcal{H}}). \tag{2.12}\] **Assumption 2.4**.: _Let \(g:\mathcal{H}\to\mathcal{L}^{2}(\mathcal{U},H)\) be a Lipschitz-continuous mapping. In particular, there exists a positive constant \(L_{Lip}\) such that for all \((\mathbf{u}_{i},c_{i})\in\mathcal{H}\), \(i=1,2\),_ \[\left|g(\mathbf{u}_{1},c_{1})-g(\mathbf{u}_{2},c_{2})\right|_{\mathcal{L}^{2} (\mathcal{U};H)}\leqslant L_{Lip}\left|(\mathbf{u}_{1}-\mathbf{u}_{2},c_{1}-c_ {2})\right|_{\mathcal{H}}. \tag{2.13}\] Using the previous notations, setting \(\xi=\eta+\frac{\gamma^{2}}{2}\), and taking into account Lemma 2.2, the model (1.2) can formally be written in the following abstract form \[\mathbf{u}(t)+\int_{0}^{t}[\eta A_{0}\mathbf{u}(s)+B_{0}(\mathbf{ u}(s),\mathbf{u}(s)]ds=\mathbf{u}_{0}+\int_{0}^{t}R_{0}(n(s),\Phi)ds+\int_{0}^{t}g( \mathbf{u}(s),c(s))dW_{s},\] \[c(t)+\int_{0}^{t}[\xi A_{1}c(s)+B_{1}(\mathbf{u}(s),c(s))]ds=c_{0 }-\int_{0}^{t}R_{1}(n(s),c(s))ds+\gamma\int_{0}^{t}\phi(c(s))d\beta_{s},\] \[n(t)+\int_{0}^{t}[\delta A_{1}n(s)+B_{1}(\mathbf{u}(s),n(s))]ds=n _{0}-\int_{0}^{t}R_{2}(n(s),c(s))ds. \tag{2.14}\] These equations are understood being valid in \(V^{*}\), \(H^{-2}(\mathcal{O})\) and \(H^{-3}(\mathcal{O})\), respectively. We end this section by introduce some notations. Let \(Y\) be a Banach space. By \(\mathcal{C}([0,T]:Y)\) we denote the space of continuous functions \(\mathbf{v:[0,T]\to Y}\) with the topology induced by the norm defined by \[\left|\mathbf{v}\right|_{\mathcal{C}([0,T];Y)}:=\sup_{0\leqslant s\leqslant T} \left\|\mathbf{v}(s)\right\|_{Y}.\] With \(L^{2}(0,T;Y)\) we denote the space of measurable functions \(\mathbf{v:[0,T]\to Y}\) with the topology generated by the norm \[\left|\mathbf{v}\right|_{L^{2}(0,T;Y)}:=\left(\int_{0}^{T}\left\|\mathbf{v}(s) \right\|_{Y}^{2}ds\right)^{1/2},\] while by \(L^{2}_{w}(0,T;Y)\) we denote the space of measurable functions \(\mathbf{v:[0,T]\to Y}\) with weak topology. For a Hilbert space \(X\), we denote by \(X_{w}\) the space \(X\) endowed with the weak topology and by \(C([0,T];X_{w})\) we denote the space of functions \(\mathbf{v:[0,T]\to X_{w}}\) that are weakly continuous. ## 3. The main result: Existence of probabilistic strong solutions This section is devoted to the statement of the main result of this paper. Before proceeding further, let us state the following definition. **Definition 3.1**.: A probabilistic strong solution of the problem (1.2) is a \(H\times H^{1}(\mathcal{O})\times L^{2}(\mathcal{O})\)-valued stochastic process \((\mathbf{u},c,n)\) such that **i):**: We have \(\mathbb{P}\)-a.e. \[\mathbf{u}\in\mathcal{C}([0,T];H)\cap L^{2}(0,T;V),\] \[c\in\mathcal{C}([0,T];H^{1}(\mathcal{O}))\cap L^{2}(0,T;H^{2}( \mathcal{O})),\] \[n\in\mathcal{C}([0,T];L^{2}_{w}(\mathcal{O}))\cap L^{2}(0,T;H^{1 }(\mathcal{O}))\cap\mathcal{C}([0,T];H^{-3}(\mathcal{O})).\] **ii):**: \((\mathbf{u},c,n):[0,T]\times\Omega\to H\times H^{1}(\mathcal{O})\times L^{2}( \mathcal{O})\) is progessively measurable and for all \(p\geqslant 1\) \[\mathbb{E}\sup_{0\leqslant s\leqslant T}\left|\mathbf{u}(s)\right| _{L^{2}}^{p}+\mathbb{E}\left(\int_{0}^{T}\left|\nabla\mathbf{u}(s)\right|_{L^{2 }}^{2}ds\right)^{p}<\infty,\] \[\mathbb{E}\left(\int_{0}^{T}\left|n(s)\right|_{L^{2}}^{2}ds \right)^{p}<\infty,\] \[\text{and}\quad\mathbb{E}\sup_{0\leqslant s\leqslant T}\left|c(s) \right|_{H^{1}}^{p}+\mathbb{E}\left(\int_{0}^{T}\left|c(s)\right|_{H^{2}}^{2} ds\right)^{p}<\infty. \tag{3.1}\] **iii):**: for all \(t\in[0,T]\) the following identity holds \(\mathbb{P}\)-a.s. \[\mathbf{u}(t)+\int_{0}^{t}[\eta A_{0}\mathbf{u}(s)+B_{0}(\mathbf{u}(s), \mathbf{u}(s))]ds=\mathbf{u}_{0}+\int_{0}^{t}R_{0}(n(s),\Phi)ds+\int_{0}^{t}g (\mathbf{u}(s),c(s))dW_{s}, \tag{3.2}\] \[c(t)+\int_{0}^{t}[\xi A_{1}c(s)+B_{1}(\mathbf{u}(s),c(s))]ds=c_{0 }-\int_{0}^{t}R_{1}(n(s),c(s))ds+\gamma\int_{0}^{t}\phi(c(s))d\beta_{s},\] \[n(t)+\int_{0}^{t}[\delta A_{1}n(s)+B_{1}(\mathbf{u}(s),n(s))]ds =n_{0}-\int_{0}^{t}R_{2}(n(s),c(s))ds,\] in \(V^{*}\), \(H^{-2}(\mathcal{O})\) and \(H^{-3}(\mathcal{O})\), respectively. Let us now present the main result of this section. **Theorem 3.2**.: _Let Assumption 2.1, Assumption 2.2, Assumption 2.3, and Assumption 2.4 be valid. Let us assume that the initial data \((\mathbf{u}_{0},c_{0},n_{0})\) belong to_ \[H\times L^{\infty}(\mathcal{O})\cap H^{1}(\mathcal{O})\times L^{2}(\mathcal{O }).\] _In addition, let us assume that \(c_{0}(x)>0\), \(n_{0}(x)>0\) for all \(x\in\mathcal{O}\) and_ \[\int_{\mathcal{O}}n_{0}(x)\ln n_{0}(x)dx<\infty,\] _as well as_ \[\frac{4\mathcal{K}_{f}\max_{0\leqslant c\leqslant\left|c_{0}\right|_{L^{ \infty}}}f^{2}}{\min_{0\leqslant c\leqslant\left|c_{0}\right|_{L^{\infty}}}f^{ \prime}}\leqslant\delta,\ \ \gamma^{2}\leqslant\frac{\min\left(\xi,\frac{\xi}{2\mathcal{K}_{0}}\right)}{6 \left|\sigma\right|_{L^{\infty}}^{2}},\ \text{ and }\ \gamma^{2p}\leqslant\frac{3^{p}\xi^{p}}{2^{2p+1}\left|\sigma\right|_{L^{ \infty}}^{2p}8^{p}}, \tag{3.3}\] _for all \(p\geqslant 2\), where \(\mathcal{K}_{0}\) is positive constant such that \(\left|\psi\right|_{H^{2}}^{2}\leqslant\mathcal{K}_{0}(\left|\Delta\psi\right| _{L^{2}}^{2}+\left|\psi\right|_{H^{1}}^{2})\), for all \(\psi\in H^{2}(\mathcal{O})\) (see [35, Proposition 7.2, P. 404] for the existence of such constant). Then, there exists a unique probabilistic strong solution to the problem (1.2) in the sense of Definition 3.1._ **Remark 3.3**.: We note that in the case where \(f(c)=c\), then we have \(\mathcal{K}_{f}=\frac{\chi^{2}+2\delta}{2\delta}\), and the first inequality of the condition (3.3) is satisfied if \[\left|c_{0}\right|_{L^{\infty}}\leqslant\frac{\delta\sqrt{2}}{2\sqrt{\chi^{2 }+2\delta}}.\] Furthermore, the condition (3.3) have been introduced in order to control the cell term in the inequality (1) and the higher regularity of the noise term on the \(c\)-equation in the inequalities (4.36) and (2). However, it is known in [24, Remark 1.1] that, for the two-dimensional deterministic chemotaxis system, there exists a critical mass phenomenon. When the total initial mass of cells \(\int_{\mathcal{O}}n_{0}(x)dx\) above a critical mass \(m_{\text{crit}}\) (i.e. \(\int_{\mathcal{O}}n_{0}(x)dx>m_{\text{crit}}\)), solutions blow-up in finite time, otherwise, all solutions remain bounded. While, for the two-dimensional stochastic chemotaxis system, it is shown in [26] that, if the chemotaxis sensibility \(\chi\) is sufficiently large, then blow-up occurs with probability \(1\). For the coupled system (1.2), despite the rapid flow of fluid, we also expect some phenomenons to appear. Then, it is important to ask oneself what will happen if the condition (3.3) is violated? The answer to this question will be given by the study of the blow-up criterion of the system (1.2) in future. In order to prove Theorem 3.2, we will first show that problem (1.1) has a probabilistic weak solution, see Definition 3.2, then prove the non-negativity property and the \(L^{\infty}\)-stability property of weak solution, which give us the possibility to prove the pathwise uniqueness, and finally apply the Yamada-Watanabe Theorem. But before proceeding further, we now introduce the concept of a probabilistic weak solution. **Definition 3.4**.: A weak probabilistic solution of the problem (1.2) is a system \[(\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{F}},\bar{\mathbb{P}},(\mathbf{u},c,n),(\bar{W},\bar{\beta})),\] where **i):**: \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{F}},\bar{\mathbb{P}})\) is a filtered probability space, **ii):**: \((\bar{W},\bar{\beta})\) is a cylindrical Wiener processes on \(\mathcal{U}\times\mathbb{R}^{2}\) over \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{F}},\bar{\mathbb{P}})\), **iii):**: and \((\mathbf{u},c,n):[0,T]\times\bar{\Omega}\to\mathcal{H}\times L^{2}(\mathcal{O})\) is a strong solution to (1.1) with driving noise \((\bar{W},\bar{\beta})\) on the filtered probability space \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{F}},\bar{\mathbb{P}})\). The existence of weak solution to our problem is given in the following proposition. **Proposition 3.5**.: _Let us assume that Assumption 2.1, Assumption 2.2 and Assumption 2.3 are satisfied. Let_ \[(\mathbf{u}_{0},c_{0},n_{0})\in H\times L^{\infty}(\mathcal{O})\cap H^{1}( \mathcal{O})\times L^{2}(\mathcal{O}),\] _such that \(c_{0}(x)>0\), \(n_{0}(x)>0\) for all \(x\in\mathcal{O}\) and_ \[\int_{\mathcal{O}}n_{0}(x)\ln n_{0}(x)dx<\infty.\] _We also assume that (3.3) holds. Then, there exists at least one probabilistic weak solution to the problem (1.2) in the sense of Definition 3.4._ The proof of Proposition 3.5, which is very technical is postponed to Section 5. Next, we prove some properties of probabilistic weak solutions to the problem (1.2) such as the non-negativity and the \(L^{\infty}\)-stability which will be useful for the proof of the pathwise uniqueness result. In fact, the main ingredient for the pathwise uniqueness is the \(L^{\infty}\)-stability property but to obtain this property we will need the non-negativity property. **Lemma 3.6**.: _Let Assumption 2.1 and Assumption 2.2 are satisfied. Let \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{F}},\bar{\mathbb{P}},(\mathbf{u},c,n),(\bar{W},\bar{\beta}))\) be a probabilistic weak solution to the problem (1.2). If \(c_{0}>0\) and \(n_{0}>0\), then the following inequality hold \(\bar{\mathbb{P}}\)-a.s_ \[n(t)>0,\ \ \text{and}\ \ c(t)>0,\ \ \text{for}\ \ \text{all}\ \ t\in[0,T]. \tag{3.4}\] Proof.: We will follow the idea developed in [19, Section 3.1] combined with the idea of [14, Lemma 14] and [5, Theorem 3.7]. Let \(t\in[0,T]\) arbitrary but fixed. We then define \(n_{-}(t):=\max(-n(t),0)\) and remark that \(n_{-}(t)\in W^{2,2}(\mathcal{O})\). Hence, we multiply equation \((\ref{eq:L1})_{3}\) by \(n_{-}(t)\), integrate over \(\mathcal{O}\), and use an integration-by-parts to obtain \(\bar{\mathbb{P}}\)-a.s. \[\frac{1}{2}\frac{d}{dt}\left|n_{-}(t)\right|_{L^{2}}^{2} =-\int_{\mathcal{O}}\mathbf{u}(t,x)\cdot\nabla n_{-}(t,x)n_{-}(t, x)dx-\delta\left|\nabla n_{-}(t)\right|_{L^{2}}^{2}\] \[\qquad-\chi\int_{\mathcal{O}}n(t,x)\nabla c(t,x)\nabla n_{-}(t,x)dx\] \[=\frac{1}{2}\int_{\mathcal{O}}n_{-}^{2}(t,x)\nabla\cdot\mathbf{u} (t,x)dx-\delta\left|\nabla n_{-}(t)\right|_{L^{2}}^{2}+\chi\int_{\mathcal{O}} n_{-}(t,x)\nabla c(t,x)\nabla n_{-}(t,x)dx\] \[\leq-\delta\left|\nabla n_{-}(t)\right|_{L^{2}}^{2}+\chi\left|n_ {-}(t)\right|_{L^{4}}\left|\nabla c(t)\right|_{L^{4}}\left|\nabla n_{-}(t) \right|_{L^{2}}. \tag{3.5}\] By the Gagliardo-Nirenberg-Sobolev inequality (3.7) and the Young inequality, we note that \[\chi\left|n_{-}\right|_{L^{4}}\left|\nabla c\right|_{L^{4}}\left| \nabla n_{-}\right|_{L^{2}} \leq\mathcal{K}(\left|n_{-}\right|_{L^{2}}^{1/2}\left|\nabla n_{- }\right|_{L^{2}}^{1/2}+\left|n_{-}\right|_{L^{2}})\left|\nabla c\right|_{L^{4}} \left|\nabla n_{-}\right|_{L^{2}}\] \[\leq\mathcal{K}\left|n_{-}\right|_{L^{2}}^{1/2}\left|\nabla c \right|_{L^{4}}\left|\nabla n_{-}\right|_{L^{2}}^{3/2}+\mathcal{K}\left|n_{-} \right|_{L^{2}}\left|\nabla c\right|_{L^{4}}\left|\nabla n_{-}\right|_{L^{2}}\] \[\leq\frac{\delta}{2}\left|\nabla n_{-}\right|_{L^{2}}^{2}+ \mathcal{K}\left|n_{-}\right|_{L^{2}}^{2}(\left|\nabla c\right|_{L^{4}}^{4}+ \left|\nabla c\right|_{L^{4}}^{2})\] \[\leq\frac{\delta}{2}\left|\nabla n_{-}\right|_{L^{2}}^{2}+ \mathcal{K}\left|n_{-}\right|_{L^{2}}^{2}(\left|\nabla c\right|_{L^{4}}^{4}+1). \tag{3.6}\] Owing to the fact that \(\bar{\mathbb{P}}\)-a.s. \(c\in\mathcal{C}([0,T];H^{1}(\mathcal{O}))\cap L^{2}(0,T;H^{2}(\mathcal{O}))\), by the following Gagliardo-Niremberg inequality \[\left|f\right|_{L^{4}}\leqslant\mathcal{K}_{GN}(\left|f\right|_{L^{2}}^{1/2} \left|\nabla f\right|_{L^{2}}^{1/2}+\left|f\right|_{L^{2}}),\quad\ f\in W^{1,2 }(\mathcal{O}), \tag{3.7}\] we note that for all \(t\in[0,T]\) and \(\bar{\mathbb{P}}\)-a.s. \[\int_{0}^{t}(|\nabla c(s)|_{L^{4}}^{4}+1)ds \leqslant\int_{0}^{t}|\nabla c(s)|_{L^{4}}^{4}\,ds+t\] \[\leqslant\mathcal{K}\int_{0}^{T}|\nabla c(s)|_{L^{2}}^{2}\left|c (s)\right|_{H^{2}}^{2}ds+\int_{0}^{T}|\nabla c(s)|_{L^{2}}^{4}\,ds+T\] \[\leqslant\mathcal{K}\sup_{0\leqslant s\leqslant T}|\nabla c(s)|_{ L^{2}}^{2}\int_{0}^{T}\left|c(s)\right|_{H^{2}}^{2}ds+\sup_{0\leqslant s \leqslant T}|\nabla c(s)|_{L^{2}}^{2}\int_{0}^{T}|\nabla c(s)|_{L^{2}}^{2}\, ds+T\] \[\leqslant\mathcal{K}\sup_{0\leqslant s\leqslant T}|c(s)|_{H^{1}} ^{2}\int_{0}^{T}\left|c(s)\right|_{H^{2}}^{2}ds+T<\infty.\] Hence, integrating (3.5) over \([0,T]\), and using the inequality (3.6), we infer that \(\bar{\mathbb{P}}\)-a.s. \[|n_{-}(t)|_{L^{2}}^{2}\leqslant|n_{-}(0)|_{L^{2}}^{2}+\mathcal{K}\int_{0}^{t }(|\nabla c(s)|_{L^{4}}^{4}+|\nabla c(s)|_{L^{4}}^{2})\left|n_{-}(s)\right|_{L ^{2}}^{2}ds.\] Thanks to Gronwall's inequality, we derive that \[|n_{-}(t)|_{L^{2}}^{2}\leqslant|(n_{0})_{-}|_{L^{2}}^{2}\exp\left(\mathcal{K }\int_{0}^{t}(|\nabla c(s)|_{L^{4}}^{4}+|\nabla c(s)|_{L^{4}}^{2})ds\right),\] which implies that \(\bar{\mathbb{P}}\)-a.s, \(n_{-}(t)=0\) and the non-negativity of \(n(t)\) follows. For the proof of the non-negativity property of \(c(t)\), the main idea is to apply the Ito formula to the function \(\Psi:H^{2}(\mathcal{O})\rightarrow\mathbb{R}\) defined by \(\Psi(z)=\int_{\mathcal{O}}z_{-}^{2}(x)dx\) where \(z_{-}=\max(-z;0)\). Since the function \(\Psi\) is not twice Frechet differentiable, we will follow the idea of [14, Lemma 14] (see also [5, Theorem 3.7]) by introducing the following approximation of \(\Psi\). Let \(\varphi:\mathbb{R}\rightarrow[-1;0]\) be a \(C^{\infty}\) class increasing function such that \[\varphi(s)=\begin{cases}-1\ \ \text{if}\ \ s\in(-\infty,-2]\\ 0\ \ \text{if}\ \ s\in[-1,+\infty).\end{cases} \tag{3.8}\] Let \(\{\psi_{h}\}_{h\in\mathbb{N}}\) be a sequence of smooth functions defined by \(\psi_{h}(y)=y^{2}\varphi(hy)\), for all \(y\in\mathbb{R}\) and \(h\in\mathbb{N}\). For any \(h\in\mathbb{N}\), we consider the following sequence of function \(\Psi_{h}:H^{2}(\mathcal{O})\rightarrow\mathbb{R}\) defined by \[\Psi_{h}(c)=\int_{\mathcal{O}}\psi_{h}(c(x))dx,\ \ \text{for}\ \ c\in H^{2}( \mathcal{O}).\] We note that the mapping \(\Psi_{h}\) is twice Frechet-differentiable and \[\Psi_{h}^{\prime}(c)(k)=2\int_{\mathcal{O}}c(x)\varphi(hc(x))k(x)dx+h\int_{ \mathcal{O}}c^{2}(x)\varphi^{\prime}(hc(x))k(x)dx,\quad\forall c,k\in H^{2}( \mathcal{O}),\] as well as \[\Psi_{h}^{{}^{\prime\prime}}(c)(z,k)=m^{2}\int_{\mathcal{O}}c^{2}( x)\varphi^{{}^{\prime\prime}}(hc(x))z(x)k(x)dx\\ +4h\int_{\mathcal{O}}c(x)\varphi^{\prime}(hc(x))z(x)k(x)dx+2\int_{ \mathcal{O}}\varphi(hc(x))z(x)k(x)dx,\quad\forall c,z,k\in H^{2}(\mathcal{O}).\] By applying the Ito formula to \(t\mapsto\Psi_{h}(c(t))\), we obtain \(\bar{\mathbb{P}}\)-a.s. \[\begin{split}\Psi_{h}(c(t))-\Psi_{h}(c(0))&=\int_{0} ^{t}\Psi_{h}^{\prime}(c(s))\left(\mathbf{u}(s)\cdot\nabla c(s)+\xi\Delta c(s)-n (s)f(c(s))\right)ds\\ &\qquad+\frac{1}{2}\int_{0}^{t}\sum_{k=1}^{2}\Psi_{h}^{\prime \prime}(c(s))\left(\gamma\phi_{k}(c(s)),\gamma\phi_{k}(c(s))\right)ds\\ &\qquad+\gamma\sum_{k=1}^{2}\int_{0}^{t}\Psi_{h}^{\prime}(c(s))( \phi_{k}(c(s)))d\bar{\beta}_{s}^{k}.\end{split} \tag{3.9}\] Now, we will find a simpler representation of the formula (3.9). For a fixed \(k=1,2\), we remark that for all \(h\geq 1\), \[h\varphi^{\prime}(hc)\sigma_{k}\cdot\nabla c=\sigma_{k}\cdot(h\varphi^{\prime }(hc)\nabla c)=\sigma_{k}\cdot\nabla(\varphi(hc)), \tag{3.10}\] and also that \(2c\sigma_{k}\cdot\nabla c=\sigma_{k}\cdot\nabla c^{2}\). Hence, for any \(h\geq 1\) thanks to an integration-by-parts and the fact that \(\sigma_{k}=0\) on \(\partial\mathcal{O}\), we have that for any \(h\in\mathbb{N}\), \[\begin{split}\Psi_{h}^{\prime}(c)(\phi_{k}(c))&=2 \int_{\mathcal{O}}c(x)\varphi(hc(x))\sigma_{k}(x)\cdot\nabla c(x)dx+h\int_{ \mathcal{O}}c^{2}(x)\varphi^{\prime}(hc(x))\sigma_{k}(x)\cdot\nabla c(x)dx\\ &=\int_{\mathcal{O}}\varphi(hc(x))\sigma_{k}(x)\cdot\nabla c^{2} (x)dx+\int_{\mathcal{O}}c^{2}(x)\sigma_{k}(x)\cdot\nabla(\varphi(hc(x)))dx \\ &=-\int_{\mathcal{O}}c^{2}(x)\nabla\cdot(\varphi(hc(x))\sigma_{k}( x))dx+\int_{\partial\mathcal{O}}c^{2}(\sigma)\varphi(hc(\sigma))\sigma_{k}( \sigma)\cdot\nu d\sigma\\ &\qquad+\int_{\mathcal{O}}c^{2}(x)\sigma_{k}(x)\cdot\nabla( \varphi(hc(x)))dx\\ &=-\int_{\mathcal{O}}c^{2}(x)\nabla\cdot(\varphi(hc(x))\sigma_{k} (x))dx+\int_{\mathcal{O}}c^{2}(x)\sigma_{k}(x)\cdot\nabla(\varphi(hc(x)))dx. \end{split} \tag{3.11}\] Owing to the fact that \(\nabla\cdot\sigma_{k}=0\), we derive that \[\begin{split}\Psi_{h}^{\prime}(c)(\phi_{k}(c))&=- \int_{\mathcal{O}}c^{2}(x)\varphi(hc(x))\nabla\cdot\sigma_{k}(x)dx\\ &\qquad-\int_{\mathcal{O}}c^{2}(x)\sigma_{k}(x)\cdot\nabla( \varphi(hc(x)))dx+\int_{\mathcal{O}}c^{2}(x)\sigma_{k}(x)\cdot\nabla(\varphi(hc (x)))dx\\ &=0.\end{split} \tag{3.12}\] We note that \[\begin{split}\sum_{k=1}^{2}\sigma_{k}\cdot\nabla c\sigma_{k} \cdot\nabla c&=\sum_{k=1}^{2}\sum_{i,j=1}^{2}\sigma_{k}^{i} \sigma_{k}^{j}\frac{\partial c}{\partial x_{i}}\frac{\partial c}{\partial x_{j }}\\ &=\sum_{i,j=1}^{2}q^{ij}(x,x)\frac{\partial c}{\partial x_{i}} \frac{\partial c}{\partial x_{j}}\\ &=\sum_{i,j=1}^{2}\delta_{ij}\frac{\partial c}{\partial x_{i}} \frac{\partial c}{\partial x_{j}}=\sum_{i=1}^{2}\frac{\partial c}{\partial x_{ i}}\frac{\partial c}{\partial x_{i}}=\left|\nabla c\right|^{2}.\end{split} \tag{3.13}\] Therefore, \[\sum_{k=1}^{2}\Psi_{h}^{{}^{\prime\prime}}(c)\left(\gamma\phi_{k}(c), \gamma\phi_{k}(c)\right) =\gamma^{2}h^{2}\int_{\mathcal{O}}c^{2}(x)\varphi^{{}^{\prime \prime}}(hc(x))\left|\nabla c(x)\right|^{2}dx\] \[\qquad+4h\gamma^{2}\int_{\mathcal{O}}c(x)\varphi^{\prime}(hc(x)) \left|\nabla c(x)\right|^{2}dx+2\gamma^{2}\int_{\mathcal{O}}\varphi(hc(x)) \left|\nabla c(x)\right|^{2}dx.\] On the other hand, by integration-by-parts, we get \[\gamma^{2}\Psi_{h}^{\prime}(c)(\Delta c)\] \[=2\gamma^{2}\int_{\mathcal{O}}c(x)\varphi(hc(x))\Delta c(x)dx+h \gamma^{2}\int_{\mathcal{O}}c^{2}(x)\varphi^{\prime}(hc(x))\Delta c(x)dx\] \[=-2\gamma^{2}\int_{\mathcal{O}}\nabla c(x)\cdot\nabla(c(x) \varphi(hc(x)))dx-h\gamma^{2}\int_{\mathcal{O}}\nabla c(x)\cdot\nabla(c^{2}( x)\varphi^{\prime}(hc(x)))dx\] \[\quad+2\gamma^{2}\int_{\mathcal{O}}\frac{\partial c(\sigma)}{ \partial\nu}\varphi(hc(\sigma))\Delta c(\sigma)d\sigma+2h\gamma^{2}\int_{ \partial\mathcal{O}}\frac{\partial c(\sigma)}{\partial\nu}c(\sigma)\varphi^{ \prime}(hc(\sigma))\Delta c(\sigma)d\sigma \tag{3.14}\] \[=-2\gamma^{2}\int_{\mathcal{O}}\varphi(hc(x))\left|\nabla c(x) \right|^{2}dx-2h\gamma^{2}\int_{\mathcal{O}}c(x)\varphi^{\prime}(hc(x))\left| \nabla c(x)\right|^{2}dx\] \[\qquad-2h\gamma^{2}\int_{\mathcal{O}}c(x)\varphi^{\prime}(hc(x)) \left|\nabla c(x)\right|^{2}dx-\gamma^{2}h^{2}\int_{\mathcal{O}}c^{2}(x) \varphi^{{}^{\prime\prime}}(hc(x))\left|\nabla c(x)\right|^{2}dx\] \[=-\sum_{k=1}^{2}\Psi_{h}^{{}^{\prime\prime}}(c)\left(\gamma\phi_ {k}(c),\gamma\phi_{k}(c)\right).\] In the equality (3.14), we have used the fact that \(\frac{\partial c}{\partial\nu}\) vanishes on \(\partial\mathcal{O}\). Therefore, recalling that \(\xi=\eta+\frac{\gamma^{2}}{2}\) and using (3.12) and (3.14), the equality (3.9) is equivalent to \[\int_{\mathcal{O}}\psi_{h}(c(t,x))dx-\int_{\mathcal{O}}\psi_{h}(c_{0}(x))dx= \int_{0}^{t}\Psi_{h}^{\prime}(c(s))\left(\mathbf{u}(s)\cdot\nabla c(s)+\eta \Delta c(s)-n(s)f(c(s))\right)ds,\] from which along with the passage to the limit as \(h\to\infty\) we infer that \[-\int_{\mathcal{O}}c_{-}^{2}(t,x)dx+\int_{\mathcal{O}}(c_{0}(x))_ {-}^{2}dx\] \[=-2\int_{0}^{t}\int_{\mathcal{O}}\left(\left(\mathbf{u}(s,x) \cdot\nabla c(s,x)+\eta\Delta c(s,x)-n(s,x)f(c(s,x))\right)\right)c(s,x)1_{ \{c(s,x)<0\}}dxds\] \[=2\int_{0}^{t}\int_{\mathcal{O}}\left(\eta\left|\nabla c(s,x) \right|^{2}+n(s,x)f(c(s,x))c(s,x)\right)1_{\{c(s,x)<0\}}dxds.\] We note that, in the last line, we used an integration-by-parts and the fact that \(\nabla\cdot\mathbf{u}=0\). By the mean value theorem, the fact that \(f(0)=0\), and \(f^{\prime}>0\) as well as \(1_{\{c<0\}}>0\), \(c^{2}>0\), and \(n>0\), we deduce that \(\left|c_{-}(t)\right|_{L^{2}}^{2}\leqslant\left|(c_{0})_{-}\right|_{L^{2}}^{2}\). This implies that \(c_{-}(t)=0\)\(\bar{\mathbb{P}}\)-a.s. and end the proof of Lemma 3.6. With the non-negativity of probabilistic weak solutions in hand, we are able now to state and prove the \(L^{\infty}\)-stability. **Corollary 3.7**.: _Under the same assumptions as in Lemma 3.6, if \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{F}},\bar{\mathbb{P}},(\mathbf{u}, c,n),(\bar{W},\bar{\beta}))\) is a probabilistic weak solution to the problem (1.2), then for all \(t\in[0,T]\)_ \[\left|c(t)\right|_{L^{\infty}}\leqslant\left|c_{0}\right|_{L^{\infty}},\quad \bar{\mathbb{P}}\text{-a.s.} \tag{3.15}\] Proof.: The idea of the proof comes from [19, Section 3.2]. We apply the Ito formula to the process \(t\mapsto\Psi(c(t)):=\int_{\mathcal{O}}c^{p}(t,x)dx\), for any \(p\geq 2\) and evaluate the limit as \(p\) tends to \(\infty\). Let \(\Psi:H^{2}(\mathcal{O})\to\mathbb{R}\) be the functional defined by \(\Psi(c)=\int_{\mathcal{O}}c^{p}(x)dx\). Note that this mapping is twice Frechet-differentiable and \[\Psi^{\prime}(c)(h)=p\int_{\mathcal{M}}c^{p-1}(x)h(x)dx,\quad\forall c,h\in H^{2}(\mathcal{O}),\] \[\Psi^{{}^{\prime\prime}}(c)(h,k)=p(p-1)\int_{\mathcal{M}}c^{p-2}( x)h(x)k(x)dx,\quad\forall c,h,k\in H^{2}(\mathcal{O}).\] Applying the Ito formula to the process \(t\mapsto\Psi(c(t))\), yields \[\Psi(c(t))-\Psi(c(0)) =\int_{0}^{t}\Psi^{\prime}(c(s))\left(\mathbf{u}(s)\cdot\nabla c (s)+\xi\Delta c(s)-n(s)f(c(s))\right)ds \tag{3.16}\] \[\quad+\frac{1}{2}\int_{0}^{t}\sum_{k=1}^{2}\Psi^{{}^{\prime \prime}}(c(s))\left(\gamma\phi_{k}(c(s)),\gamma\phi_{k}(c(s))\right)ds+\gamma \sum_{k=1}^{2}\int_{0}^{t}\Psi^{\prime}(c(s))(\phi_{k}(c(s)))d\bar{\beta}_{s} ^{k}.\] By integration-by-parts, the divergence free property of \(\sigma_{k}\) and the fact that \(\sigma_{k}=0\) on \(\partial\mathcal{O}\), we remark that for all \(k\geq 1\), \[\Psi^{\prime}(c)(\phi_{k}(c)) =p\int_{\mathcal{O}}c^{p-1}(x)\sigma_{k}(x)\cdot\nabla c(x)dx \tag{3.17}\] \[=\int_{\mathcal{O}}\sigma_{k}(x)\cdot\nabla c^{p}(x)dx\] \[=-\int_{\mathcal{O}}c^{p}(x)\nabla\cdot\sigma_{k}(x)dx+\int_{ \partial\mathcal{O}}c^{p}(\sigma)\sigma_{k}(\sigma)\cdot\nu d\sigma=0.\] This implies that the stochastic term in (3.16) vanishes. Note that \[\int_{\mathcal{O}}\Delta c(x)c^{p-1}(x)dx=-(p-1)\int_{\mathcal{O}}\left|\nabla c (x)\right|^{2}c(x)^{p-2}dx. \tag{3.18}\] Since \(\nabla\cdot\mathbf{u}=0\), by integration by part, we infer that \[\int_{\mathcal{O}}\mathbf{u}(x)\cdot\nabla c(x)c^{p-1}(x)dx=\frac{1}{p}\int_{ \mathcal{O}}\mathbf{u}(x)\cdot\nabla c^{p}(x)dx=0. \tag{3.19}\] Using the equalities (3.17), (3.18) and (3.19), we deduce from (3.17) that \[\Psi(c(t))-\Psi(c_{0}) =\int_{0}^{t}\int_{\mathcal{O}}\left(-p(p-2)\xi\left|\nabla c(s,x )\right|^{2}c^{p-2}(s,x)-pn(s,x)f(c(s,x))c^{p-1}(s,x)\right)dxds \tag{3.20}\] \[\qquad+\frac{p(p-1)}{2}\int_{0}^{t}\int_{\mathcal{O}}c^{p-2}(s) \sum_{k=1}^{2}\sigma_{k}(x)\cdot\nabla c(s,x)\sigma_{k}(x)\cdot\nabla c(s,x) dxds.\] From the equality (3.13), we get \(\sum_{k=1}^{2}\sigma_{k}\cdot\nabla c\sigma_{k}\cdot\nabla c=\left|\nabla c \right|^{2}\). Hence, the equality (3.20) becomes \[\Psi(c(t))-\Psi(c_{0})=\int_{0}^{t}\int_{\mathcal{O}}\left(-p(p-2)\left|\nabla c (s,x)\right|^{2}c^{p-2}(s,x)-pn(s,x)f(c(s,x))c^{p-1}(s,x)\right)dxds.\] Using the non-negative property of \(n\) and \(c\) proved in Lemma 3.6 combined with the non-negativity of the function \(f\), we infer from the last equality that for all \(p\geq 2\) and \(t\in[0,T]\), \(\left|c(t)\right|_{L^{p}}\leq\left|c_{0}\right|_{L^{p}}\), which along with the passage to the limit \(p\to+\infty\) completes the proof of Theorem 5.1 (see [1, Theorem 2.14] for a detailed proof). We now proceed with the statement and proof of the pathwise uniqueness of the weak solution. **Proposition 3.8**.: _We assume that the assumptions of Theorem 3.2 hold. If_ \[(\Omega,\mathcal{F},\{\mathcal{F}_{t}\}_{t\in[0,T]},\mathbb{P},(\mathbf{u}_{1},c _{1},n_{1}),(\bar{W},\bar{\beta}))\ \ \text{and}\ \ (\Omega,\mathcal{F},\{\mathcal{F}_{t}\}_{t\in[0,T]},\mathbb{P},(\mathbf{u}_{2}, c_{2},n_{2}),(\bar{W},\bar{\beta}))\] _are two weak probabilistic solutions of system (2.14) with the same initial data \((\mathbf{u}_{0},c_{0},n_{0})\), then_ \[(\mathbf{u}_{1}(t),c_{1}(t),n_{1}(t))=(\mathbf{u}_{2}(t),c_{2}(t),n_{2}(t)) \qquad\mathbb{P}\text{-a.s.}\qquad\text{for}\ \ \text{all}\ \ t\in[0,T]. \tag{3.21}\] Proof.: For \(t\in[0,T]\), let \[(\mathbf{w}(t),\psi(t),\varphi(t))=(\mathbf{u}_{1}(t)-\mathbf{u}_{2}(t),c_{1}( t)-c_{2}(t),n_{1}(t)-n_{2}(t)).\] Then this process satisfies \((\mathbf{w}(0),\psi(0),\varphi(0))=0\) and for all \(t\in[0,T]\), we have \[\begin{split}\mathbf{w}(t)&+\int_{0}^{t}[\eta A_{0 }\mathbf{w}(s)+B_{0}(\mathbf{w}(s),\mathbf{u}_{1}(s))+B_{0}(\mathbf{u}_{2}(s), \mathbf{w}(s))]ds\\ &=\int_{0}^{t}R_{0}(\varphi(s),\Phi)ds+\int_{0}^{t}[g(\mathbf{u} _{1}(s),c_{1}(s))-g(\mathbf{u}_{2}(s),c_{2}(s))]dW_{s},\end{split} \tag{3.22}\] \[\begin{split}\psi(t)&+\int_{0}^{t}[\xi A_{1}\psi(s )+B_{1}(\mathbf{w}(s),c_{1}(s))+B_{1}(\mathbf{u}_{2}(s),\psi(s))]ds\\ &=-\int_{0}^{t}[R_{1}(n_{1}(s),c_{1}(s))-R_{1}(n_{2}(s),c_{2}(s)) ]ds+\gamma\int_{0}^{t}\phi(\psi(s))d\beta_{s},\end{split} \tag{3.23}\] \[\begin{split}\varphi(t)&+\int_{0}^{t}[\delta A_{1} \varphi(s)+B_{1}(\mathbf{w}(s),n_{1}(s))+B_{1}(\mathbf{u}_{2}(s),\phi(s))]ds \\ &=-\int_{0}^{t}[R_{2}(n_{1}(s),c_{1}(s))-R_{2}(n_{2}(s),c_{2}(s)) ]ds.\end{split} \tag{3.24}\] Using the fact that \((B_{0}(\mathbf{u}_{2},\mathbf{w}),\mathbf{w})=0\), we get by applying the Ito formula to \(t\mapsto|\mathbf{w}(t)|_{L^{2}}^{2}\) that \[\begin{split}|\mathbf{w}(t)|_{L^{2}}^{2}+2\eta\int_{0}^{t}| \nabla\mathbf{w}(s)|_{L^{2}}^{2}\,ds&=-2\int_{0}^{t}(B_{0}( \mathbf{w}(s),\mathbf{u}_{1}(s)),\mathbf{w}(s))ds+2\int_{0}^{t}(R_{0}(\varphi (s),\Phi),\mathbf{w}(s))ds\\ &+\int_{0}^{t}|g(\mathbf{u}_{1}(s),c_{1}(s))-g(\mathbf{u}_{2}(s), c_{2}(s))|_{\mathcal{L}^{2}(\mathcal{U},H)}^{2}\,ds\\ &+2\int_{0}^{t}(g(\mathbf{u}_{1}(s),c_{1}(s))-g(\mathbf{u}_{2}(s ),c_{2}(s)),\mathbf{w}(s))dW_{s}.\end{split} \tag{3.25}\] Using the continuous embeddings \(V\hookrightarrow H\) and \(H^{1}(\mathcal{O})\hookrightarrow L^{4}(\mathcal{O})\) as well as the Holder inequality and the Young inequality, we derive that \[\begin{split} 2\left|(B_{0}(\mathbf{w},\mathbf{u}_{1}),\mathbf{w})\right|& \leqslant 2\left|\mathbf{w}\right|_{L^{4}}\left|\mathbf{u}_{1} \right|_{L^{4}}\left|\mathbf{w}\right|_{L^{2}}\\ &\leqslant\frac{\eta}{5}\left|\nabla\mathbf{w}\right|_{L^{2}}^{2}+ \mathcal{K}\left|\nabla\mathbf{u}_{1}\right|_{L^{2}}^{2}\left|\mathbf{w} \right|_{L^{2}}^{2},\end{split} \tag{3.26}\] and \[\begin{split} 2\left|(R_{0}(\varphi,\varPhi),\mathbf{w})\right|& \leqslant 2\left|\nabla\varPhi\right|_{L^{\infty}}\left|\varphi \right|_{L^{2}}\left|\mathbf{w}\right|_{L^{2}}\\ &\leqslant\mathcal{K}\left|\nabla\varPhi\right|_{L^{\infty}} \left|\varphi\right|_{L^{2}}\left|\nabla\mathbf{w}\right|_{L^{2}}\\ &\leqslant\frac{\eta}{5}\left|\nabla\mathbf{w}\right|_{L^{2}}^{2 }+\mathcal{K}\left|\varPhi\right|_{W^{1,\infty}}^{2}\left|\varphi\right|_{L^{ 2}}^{2}.\end{split} \tag{3.27}\] Thanks to (2.13), we have \[\left|g(\mathbf{u}_{1},c_{1})-g(\mathbf{u}_{2},c_{2})\right|_{\mathcal{L}^{2 }(\mathcal{U},H)}^{2}\leqslant L_{Lip}^{2}(\left|\mathbf{w}\right|_{L^{2}}^{ 2}+\left|\psi\right|_{H^{1}}^{2}). \tag{3.28}\] Since \(\nabla\cdot\sigma_{1}=\nabla\cdot\sigma_{2}=0\), we obtain \((\phi(\psi),\psi)=0\). Futhermore, by the fact that \(\nabla\cdot\mathbf{u}_{2}=0\), we derive that \((B_{1}(\mathbf{u}_{2},\psi),\psi)=0\). Next, we recall that (\(\mathbf{A}_{3}\)) implies \[\left|\phi(\psi)\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}=\sum_{k=1} ^{2}\int_{\mathcal{O}}\left|\sigma_{k}(x)\cdot\nabla\psi(x)\right|^{2}dx= \left|\nabla\psi\right|_{L^{2}}^{2}.\] Hence, by applying the Ito formula to \(t\mapsto\left|\psi(t)\right|_{H^{1}}^{2}\), we see that \[\begin{split}&\left|\psi(t)\right|_{H^{1}}^{2}+2\int_{0}^{t} \left(\mu\left|\nabla\psi(s)\right|_{L^{2}}^{2}+\xi\left|A_{1}\psi(s)\right|_{ L^{2}}^{2}\right)ds\\ &=-2\int_{0}^{t}(B_{1}(\mathbf{w}(s),c_{1}(s)),\psi(s))ds-2\int_{ 0}^{t}(R_{1}(n_{1}(s),c_{1}(s))-R_{1}(n_{2}(s),c_{2}(s)),\psi(s))ds\\ &\quad\quad+2\int_{0}^{t}(B_{1}(\mathbf{w}(s),c_{1}(s))+B_{1}( \mathbf{u}_{2}(s),\psi(s)),A_{1}\psi(s))ds\\ &\quad\quad-2\int_{0}^{t}(R_{1}(n_{1}(s),c_{1}(s))-R_{1}(n_{2}(s ),c_{2}(s)),A_{1}\psi(s))ds\\ &\quad\quad+\gamma^{2}\int_{0}^{t}\left|\nabla\phi(\psi(s)) \right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds+2\gamma\int_{0}^{t}( \nabla\phi(\psi(s)),\nabla\psi(s))d\beta_{s}.\end{split} \tag{3.29}\] Taking the \(L^{2}\)-inner product of the equation (3.24) with \(\varphi\) and adding the result to (3.29), yield \[\begin{split}&\left|\varphi(t)\right|_{L^{2}}^{2}+\left|\psi(t) \right|_{H^{1}}^{2}+2\int_{0}^{t}(\mu\left|\nabla\psi(s)\right|_{L^{2}}^{2}+ \xi\left|A_{1}\psi(s)\right|_{L^{2}}^{2}+\delta\left|\nabla\varphi(s)\right| _{L^{2}}^{2})ds\\ &=-2\int_{0}^{t}(B_{1}(\mathbf{w}(s),c_{1}(s)),\psi(s))ds-2\int_{ 0}^{t}(R_{1}(n_{1}(s),c_{1}(s))-R_{1}(n_{2}(s),c_{2}(s)),\psi(s))ds\\ &\quad\quad+2\int_{0}^{t}(B_{1}(\mathbf{w}(s),c_{1}(s))+B_{1}( \mathbf{u}_{2}(s),\psi(s)),A_{1}\psi(s))ds\\ &\quad\quad-2\int_{0}^{t}(R_{1}(n_{1}(s),c_{1}(s))-R_{1}(n_{2}(s ),c_{2}(s)),A_{1}\psi(s))ds\\ &\quad\quad-2\int_{0}^{t}[r_{2}(\varphi(s),c_{1}(s),\varphi(s)) +r_{2}(n_{2}(s),\psi(s),\varphi(s))]ds+\gamma^{2}\int_{0}^{t}\left|\nabla\phi( \psi(s))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds\\ &\quad\quad-2\int_{0}^{t}(B_{1}(\mathbf{w}(s),n_{1}(s)),\varphi( s))ds+2\gamma\int_{0}^{t}(\nabla\phi(\psi(s)),\nabla\psi(s))d\beta_{s}.\end{split} \tag{3.30}\] Now, we give an estimate for the right-hand side of (3.30). Similarly to (3.26), we have \[\begin{split} 2\left|(B_{1}(\mathbf{w},c_{1}),\psi)\right|& \leqslant 2\left|\mathbf{w}\right|_{L^{4}}\left|\nabla c_{1}\right|_{L ^{2}}\left|\psi(s)\right|_{L^{4}}\\ &\leqslant\mathcal{K}\left|\nabla\mathbf{w}\right|_{L^{2}}\left| \nabla c_{1}\right|_{L^{2}}\left|\psi\right|_{H^{1}}\\ &\leqslant\frac{\eta}{5}\left|\nabla\mathbf{w}\right|_{L^{2}}^{2 }+\mathcal{K}\left|\nabla c_{1}\right|_{L^{2}}^{2}\left|\psi\right|_{H^{1}}. \end{split} \tag{3.31}\] Thanks to the continuous embedding \(H^{1}(\mathcal{O})\hookrightarrow L^{4}(\mathcal{O})\) and the \(L^{\infty}\)-stability property proved in Corollary 3.7, we have \[\begin{split} 2(R_{1}(n_{1},c_{1})-R_{1}(n_{2},c_{2}),\psi)& \leqslant 2\left|R_{1}(n_{1},c_{1})-R_{1}(n_{2},c_{2})\right|_{L^{2}} \left|\psi\right|_{L^{2}}\\ &\leqslant 4\left|(f(c_{1})-f(c_{2}))n_{1}\right|_{L^{2}}^{2}+4 \left|f(c_{2})\psi\right|_{L^{2}}^{2}+2\left|\psi\right|_{L^{2}}^{2}\\ &\leqslant 4\sup_{0\leqslant r\leqslant\left|c\right|_{0}\right|_{L^{ \infty}}}(f^{\prime}(r))^{2}\left|n_{1}\psi\right|_{L^{2}}^{2}+4\sup_{0 \leqslant r\leqslant\left|c\right|_{0}\right|_{L^{\infty}}}f(r)\left|\psi \right|_{L^{2}}^{2}+2\left|\psi\right|_{L^{2}}^{2}\\ &\leqslant\mathcal{K}\left|\psi\right|_{L^{4}}^{2}\left|n_{1} \right|_{L^{4}}^{2}+\mathcal{K}_{f}\left|\psi\right|_{L^{2}}^{2}.\end{split}\] Applying the Galiardo-Nirenberg-Sobolev inequality, we arrive at \[\begin{split} 2(R_{1}(n_{1},c_{1})-R_{1}(n_{2},c_{2}),\psi)& \leqslant\mathcal{K}\left|\psi\right|_{H^{1}}^{2}\left(\left| \nabla n_{1}\right|_{L^{2}}\left|n_{1}\right|_{L^{2}}+\left|n_{1}\right|_{L^{2 }}^{2}\right)+\mathcal{K}_{f}\left|\psi\right|_{L^{2}}^{2}\\ &\leqslant\mathcal{K}\left(\left|\nabla n_{1}\right|_{L^{2}} \left|n_{1}\right|_{L^{2}}+\left|n_{1}\right|_{L^{2}}^{2}\right)\left|\psi \right|_{H^{1}}^{2}+\mathcal{K}_{f}\left|\psi\right|_{H^{1}}^{2}.\end{split} \tag{3.32}\] Thanks to the Ladyzhenskaya, Galiardo-Nirenberg-Sobolev, and Young inequalities, we find that \[\begin{split} 2\left|(B_{1}(\mathbf{w},c_{1}),A_{1}\psi)\right|& \leqslant 2\left|\mathbf{w}\right|_{L^{4}}\left|\nabla c_{1} \right|_{L^{4}}\left|A_{1}\psi\right|_{L^{2}}\\ &\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+\mathcal{ K}\left|\mathbf{w}\right|_{L^{2}}\left|\nabla\mathbf{w}\right|_{L^{2}}\left(\left|c_{1} \right|_{H^{2}}\left|\nabla c_{1}\right|_{L^{2}}+\left|\nabla c_{1}\right|_{L^ {2}}^{2}\right)\\ &\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+\frac{ \eta}{5}\left|\nabla\mathbf{w}\right|_{L^{2}}^{2}+\mathcal{K}\left(\left|c_{1} \right|_{H^{2}}^{2}\left|\nabla c_{1}\right|_{L^{2}}^{2}+\left|\nabla c_{1} \right|_{L^{2}}^{4}\right)\left|\mathbf{w}\right|_{L^{2}}^{2}.\end{split} \tag{3.33}\] We recall that there exist a positive constant \(\mathcal{K}_{0}\), such that \(\left|\psi\right|_{H^{2}}^{2}\leqslant\mathcal{K}_{0}(\left|A_{1}\psi\right|^{2 }+\left|\psi\right|_{H^{1}}^{2})\). Hence, using also the continuous embedding \(V\hookrightarrow H\), we obtain \[\begin{split} 2\left|(B_{1}(\mathbf{u}_{2},\psi),A_{1}\psi)\right|& \leqslant 2\left|\mathbf{u}_{2}\right|_{L^{4}}\left|\nabla\psi \right|_{L^{4}}\left|A_{1}\psi\right|_{L^{2}}\\ &\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+\mathcal{ K}\left|\mathbf{u}_{2}\right|_{L^{2}}\left|\nabla\mathbf{u}_{2}\right|_{L^{2}} \left(\left|\psi\right|_{H^{2}}\left|\nabla\psi\right|_{L^{2}}+\left|\nabla \psi\right|_{L^{2}}^{2}\right)\\ &\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+\frac{ \mathcal{K}_{0}^{-1}\xi}{6}\left|\psi\right|_{H^{2}}^{2}+\mathcal{K}\left| \mathbf{u}_{2}\right|_{L^{2}}^{2}\left|\nabla\mathbf{u}_{2}\right|_{L^{2}}^{2} \left|\nabla\psi\right|_{L^{2}}^{2}\\ &\quad+\mathcal{K}\left|\mathbf{u}_{2}\right|_{L^{2}}\left|\nabla \mathbf{u}_{2}\right|_{L^{2}}\left|\nabla\psi\right|_{L^{2}}^{2}\\ &\leqslant\frac{\xi}{3}\left|A_{1}\psi\right|_{L^{2}}^{2}+\frac{ \xi}{6}\left|\psi\right|_{H^{1}}^{2}+\mathcal{K}\left(\left|\mathbf{u}_{2} \right|_{L^{2}}^{2}\left|\nabla\mathbf{u}_{2}\right|_{L^{2}}^{2}+\left|\nabla \mathbf{u}_{2}\right|_{L^{2}}^{2}\right)\left|\psi\right|_{H^{1}}^{2}.\end{split} \tag{3.34}\] Using a similarly argument as in (3.32), we arrive at \[\begin{split} 2\left|(R_{1}(n_{1},c_{1})-R_{1}(n_{2},c_{2}),A_{1} \psi\right|&\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+ \mathcal{K}\left|R_{1}(n_{1},c_{1})-R_{1}(n_{2},c_{2})\right|_{L^{2}}^{2}\\ &\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+\mathcal{ K}\left|\psi\right|_{L^{4}}^{2}\left|n_{1}\right|_{L^{4}}^{2}+\mathcal{K}_{f} \left|\psi\right|_{L^{2}}^{2}\\ &\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+\mathcal{ K}_{f}\left|\psi\right|_{H^{1}}^{2}+\mathcal{K}\left(\left|\nabla n_{1}\right|_{L^{2}} \left|n_{1}\right|_{L^{2}}+\left|n_{1}\right|_{L^{2}}^{2}\right)\left|\psi \right|_{H^{1}}^{2}.\end{split} \tag{3.35}\] By using an integration-by-parts and Holder, and the Galiardo-Nirenberg-Sobolev inequalities, we see that \[\begin{split} 2\left|\left(B_{1}(\mathbf{w},n_{1}),\varphi \right)\right|&\leqslant 2\left|\int_{\mathcal{O}}n_{1}(x) \mathbf{w}(x)\cdot\nabla\varphi(x)dx\right|\\ &\leqslant 2\left|n_{1}\right|_{L^{4}}\left|\mathbf{w}\right|_{L^{4}} \left|\nabla\varphi\right|_{L^{2}}\\ &\leqslant\frac{\delta}{4}\left|\nabla\varphi\right|_{L^{2}}^{2}+ \mathcal{K}\left|\mathbf{w}\right|_{L^{2}}\left|\nabla\mathbf{w}\right|_{L^{ 2}}\left(\left|\nabla n_{1}\right|_{L^{2}}\left|n_{1}\right|_{L^{2}}+\left|n_ {1}\right|_{L^{2}}^{2}\right)\\ &\leqslant\frac{\delta}{4}\left|\nabla\varphi\right|_{L^{2}}^{2}+ \frac{\eta}{5}\left|\nabla\mathbf{w}\right|_{L^{2}}^{2}+\mathcal{K}\left( \left|\nabla n_{1}\right|_{L^{2}}^{2}\left|n_{1}\right|_{L^{2}}^{2}+\left|n_ {1}\right|_{L^{2}}^{4}\right)\left|\mathbf{w}\right|_{L^{2}}^{2}.\end{split} \tag{3.36}\] By applying the Young and Galiardo-Nirenberg-Sobolev inequalities we obtain \[\begin{split} 2\left|r_{2}(\varphi,c_{1},\varphi)\right|& \leqslant 2\left|\varphi\right|_{L^{4}}\left|\nabla c_{1}\right|_{L^{4 }}\left|\nabla\varphi\right|_{L^{2}}\\ &\leqslant\frac{\delta}{4}\left|\nabla\varphi\right|_{L^{2}}^{2}+ \mathcal{K}\left(\left|\nabla\varphi\right|_{L^{2}}\left|\varphi\right|_{L^{2} }+\left|\varphi\right|_{L^{2}}^{2}\right)\left(\left|c_{1}\right|_{H^{2}} \left|\nabla c_{1}\right|_{L^{2}}+\left|\nabla c_{1}\right|_{L^{2}}^{2}\right) \\ &\leqslant\frac{\delta}{2}\left|\nabla\varphi\right|_{L^{2}}^{2}+ \mathcal{K}\left(\left|c_{1}\right|_{H^{2}}^{2}\left|\nabla c_{1}\right|_{L^{ 2}}^{2}+\left|\nabla c_{1}\right|_{L^{2}}^{4}+\left|c_{1}\right|_{H^{2}} \left|\nabla c_{1}\right|_{L^{2}}+\left|\nabla c_{1}\right|_{L^{2}}^{2}\right) \left|\varphi\right|_{L^{2}}^{2}.\end{split} \tag{3.37}\] In a similarly way we have that \[\begin{split} 2\left|r_{2}(n_{2},\psi,\varphi)\right|& \leqslant 2\left|n_{2}\right|_{L^{4}}\left|\nabla\psi\right|_{L^{4}} \left|\nabla\varphi\right|_{L^{2}}\\ &\leqslant\frac{\delta}{4}\left|\nabla\varphi\right|_{L^{2}}^{2}+ \mathcal{K}\left|n_{2}\right|_{L^{4}}^{2}\left(\left|\psi\right|_{H^{2}}\left| \nabla\psi\right|_{L^{2}}+\left|\nabla\psi\right|_{L^{2}}^{2}\right)\\ &\leqslant\frac{\delta}{4}\left|\nabla\varphi\right|_{L^{2}}^{2}+ \frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+\frac{\xi}{6}\left|\psi\right| _{H^{1}}^{2}+\mathcal{K}\left|n_{2}\right|_{L^{2}}^{4}\left|\psi\right|_{H^{1} }^{2}\\ &\quad+\mathcal{K}\left(\left|\nabla n_{2}\right|_{L^{2}}\left|n_ {2}\right|_{L^{2}}+\left|n_{2}\right|_{L^{2}}^{2}\left|\nabla n_{2}\right|_{L^{ 2}}^{2}+\left|n_{2}\right|_{L^{2}}^{2}\right)\left|\psi\right|_{H^{1}}^{2}. \end{split} \tag{3.38}\] By using (3.3) we derive that \[\begin{split}\gamma^{2}\left|\nabla\phi(\psi)\right|_{\mathcal{L }^{2}(\mathbb{R}^{2};L^{2})}^{2}&=\gamma^{2}\sum_{k=1}^{2}\int_{ \mathcal{O}}\left|\nabla(\sigma_{k}(x)\cdot\nabla\psi(x))\right|^{2}dx\\ &\leqslant 2\gamma^{2}\sum_{k=1}^{2}\left|\sigma_{k}\right|_{W^{1, \infty}}^{2}\left|\nabla\psi\right|_{L^{2}}^{2}+2\gamma^{2}\sum_{k=1}^{2} \left|\sigma_{k}\right|_{L^{\infty}}^{2}\left|\psi\right|_{H^{2}}^{2}\\ &\leqslant(1+\mathcal{K}_{0})2\gamma^{2}\left|\sigma\right|_{W^{1, \infty}}^{2}\left|\nabla\psi\right|_{L^{2}}^{2}+2\gamma^{2}\mathcal{K}_{0} \left|\sigma\right|_{L^{\infty}}^{2}\left|A_{1}\psi\right|_{L^{2}}^{2}\\ &\leqslant\frac{\xi}{6}\left|A_{1}\psi\right|_{L^{2}}^{2}+(1+ \mathcal{K}_{0})2\gamma^{2}\left|\sigma\right|_{W^{1,\infty}}^{2}\left|\psi \right|_{H^{1}}^{2}.\end{split} \tag{3.39}\] Now, for \(t\in\left[0,T\right]\) and \(s\in\left[0,t\right]\), let us set \[\mathcal{Y}(t):=\left|\mathbf{u}(t)\right|_{L^{2}}^{2}+\left|c(t)\right|_{H^{1} }^{2}+\left|\varphi(t)\right|_{L^{2}}^{2},\] \[\mathcal{Z}(s):= \mathcal{K}\left|\nabla u_{1}(s)\right|_{L^{2}}^{2}+\mathcal{K}\left| \nabla c_{1}(s)\right|_{L^{2}}^{2}+\mathcal{K}\left(\left|\nabla n_{1}(s) \right|_{L^{2}}\left|n_{1}(s)\right|_{L^{2}}+\left|n_{1}(s)\right|_{L^{2}}^{2}\right) \tag{3.40}\] \[+\mathcal{K}\left(\left|c_{1}(s)\right|_{H^{2}}^{2}\left|\nabla c _{1}(s)\right|_{L^{2}}^{2}+\left|\nabla c_{1}(s)\right|_{L^{2}}^{4}\right)+ \mathcal{K}\left(\left|\mathbf{u}_{2}(s)\right|_{L^{2}}^{2}\left|\nabla\mathbf{ u}_{2}(s)\right|_{L^{2}}^{2}+\left|\nabla\mathbf{u}_{2}(s)\right|_{L^{2}}^{2}\right)\] \[+\mathcal{K}\left(\left|\nabla n_{1}(s)\right|_{L^{2}}\left|n_{1} (s)\right|_{L^{2}}+\left|n_{1}(s)\right|_{L^{2}}^{2}\right)+\mathcal{K}\left( \left|\nabla n_{1}(s)\right|_{L^{2}}^{2}\left|n_{1}(s)\right|_{L^{2}}^{2}+ \left|n_{1}(s)\right|_{L^{2}}^{4}\right)\] \[+\mathcal{K}\left(\left|c_{1}(s)\right|_{H^{2}}^{2}\left|\nabla c _{1}(s)\right|_{L^{2}}^{2}+\left|\nabla c_{1}(s)\right|_{L^{2}}^{4}+\left|c_{1 }(s)\right|_{H^{2}}\left|\nabla c_{1}(s)\right|_{L^{2}}+\left|\nabla c_{1}(s) \right|_{L^{2}}^{2}\right)\] \[+\mathcal{K}\left(\left|\nabla n_{2}(s)\right|_{L^{2}}\left|n_{2} (s)\right|_{L^{2}}+\left|n_{2}(s)\right|_{L^{2}}^{2}\left|\nabla n_{2}(s) \right|_{L^{2}}^{2}+\left|n_{2}(s)\right|_{L^{2}}^{2}+\left|n_{2}(s)\right|_{L ^{2}}^{4}\right),\] and \[\theta(t):=\exp\left(-\int_{0}^{t}\mathcal{Z}(s)ds\right).\] Applying the Ito formula to \(t\mapsto\theta(t)\left|\mathbf{u}(t)\right|_{L^{2}}^{2}\), we derive that \[\theta(t)\left|\mathbf{w}(t)\right|_{L^{2}}^{2}+2\eta\int_{0}^{t }\theta(s)\left|\nabla\mathbf{w}(s)\right|_{L^{2}}^{2}ds \leqslant 2\int_{0}^{t}\theta(s)(B_{0}(\mathbf{w}(s),\mathbf{u}_{1}(s)),\mathbf{w}(s))ds \tag{3.41}\] \[+2\int_{0}^{t}\theta(s)(R_{0}(\varphi(s)),\mathbf{w}(s))ds+\int_{ 0}^{t}\theta^{\prime}(s)\left|\mathbf{w}(s)\right|_{L^{2}}^{2}ds\] \[+\int_{0}^{t}\theta(s)\left|g(\mathbf{u}_{1}(s),c_{1}(s))-g( \mathbf{u}_{2}(s),c_{2}(s))\right|_{\mathcal{L}^{2}(\mathcal{U},H)}^{2}ds\] \[+2\int_{0}^{t}\theta(s)(g(\mathbf{u}_{1}(s),c_{1}(s))-g(\mathbf{u }_{2}(s),c_{2}(s)),\mathbf{w}(s))dW_{s}.\] Applying the Ito formula once more to \(t\mapsto\theta(t)(\left|\varphi(t)\right|_{L^{2}}^{2}+\left|\psi(t)\right|_{ H^{1}}^{2})\) and adding the result with (3.41) after taking into account the estimates (3.26)-(3.28) and (3.31)-(3.39), we arrive at \[\theta(t)\mathcal{Y}(t) +\int_{0}^{t}\theta(s)\left(\eta\left|\nabla\mathbf{w}(s)\right|_{ L^{2}}^{2}+\mu\left|\nabla\psi(s)\right|_{L^{2}}^{2}+\xi\left|A_{1}\psi(s) \right|_{L^{2}}^{2}\right)ds\] \[\leqslant\left(\mathcal{K}\left|\Phi\right|_{W^{1,\infty}}^{2}+L_ {Lip}^{2}+2\mathcal{K}_{f}+\frac{\xi}{3}+(1+\mathcal{K}_{0})2\gamma^{2}\left| \sigma\right|_{W^{1,\infty}}^{2}\right)\int_{0}^{t}\theta(s)\mathcal{Y}(s)ds\] \[\qquad+2\gamma\int_{0}^{t}\theta(s)(\nabla\phi(\psi(s)),\nabla \psi(s))d\beta_{s}\] \[\qquad+2\int_{0}^{t}\theta(s)(g(\mathbf{u}_{1}(s),c_{1}(s))-g( \mathbf{u}_{2}(s),c_{2}(s)),\mathbf{w}(s))dW_{s}. \tag{3.42}\] Next, taking the mathematical expectation yields \[\mathbb{E}\theta(t)\mathcal{Y}(t) +\mathbb{E}\int_{0}^{t}\theta(s)\left(\eta\left|\nabla\mathbf{w}( s)\right|_{L^{2}}^{2}+\mu\left|\nabla\psi(s)\right|_{L^{2}}^{2}+\xi\left|A_{1} \psi(s)\right|_{L^{2}}^{2}\right)ds \tag{3.43}\] \[\leqslant\left(\mathcal{K}\left|\Phi\right|_{W^{1,\infty}}^{2}+L_ {Lip}^{2}+2\mathcal{K}_{f}+\frac{\xi}{3}+(1+\mathcal{K}_{0})2\gamma^{2}\left| \sigma\right|_{W^{1,\infty}}^{2}\right)\mathbb{E}\int_{0}^{t}\theta(s) \mathcal{Y}(s)ds.\] From which along with the Gronwall inequality we infer that for any \(t\in[0,T]\) \[\mathbb{E}\theta(t)\mathcal{Y}(t)=0.\] It follows that for all \(t\in[0,T]\), \(\mathcal{Y}(t)=0\)\(\mathbb{P}\)-a.s. Since the paths of \((\mathbf{u}_{i},c_{i},n_{i})\), \(i=1,2\) are continuous \(\mathbb{P}\)-a.s., then \[(\mathbf{u}_{1}(t),c_{1}(t),n_{1}(t))=(\mathbf{u}_{2}(t),c_{2}(t),n_{2}(t)), \quad\mathbb{P}\text{-a.s., for all }t\in[0,T].\] With the existence and pathwise uniqueness results at hand we now prove the existence of strong solution stated in Theorem 3.2. Proof of Theorem 3.2.: The existence of a probabilistic weak solution to the problem (1.2) is shown in Proposition 3.5. The pathwise uniqueness of probabilistic weak solutions is given by Proposition 3.8. Thus, the existence and uniqueness of a probabilistic strong solution to the problem (1.2) follows from the Yamada-Watanabe Theorem (see [30, Theorem E.1.8]), which states that the existence of weak probabilistic solution and the pathwise uniqueness imply the existence of a unique probabilistic strong solution. ## 4. Proof of Proposition 3.5 In this section, we will show Proposition 3.5. We introduce a Galerkin approximation first. We then discuss the existence of the Galerkin approximation and prove the mass conservation property, the non-negativity property and the \(L^{\infty}\)-norm satibility in finite dimension. Using these properties, we prove priori estimates and by these a priori estimates, we show the tightness of the family of approximations, and pass in a second step, to the limit in the deterministic terms and the construction of the noise terms by exploiting the usual martingale representation theorem proved in [12, Theorem 8.2]. ### Galerkin approximation and a priori uniform estimates In this subsection, we will construct a family of approximations of the solutions and prove some crucial estimates satisfied uniformly by the approximations. For this propose, let us recall that there exists an orthonormal basis \(\{\mathbf{w}_{i}\}_{i=1}^{\infty}\) of \(H\) consisting of the eigenfunctions of the Stokes operator \(A_{0}\) and an orthonormal basis \(\{\varphi_{i}\}_{i=1}^{\infty}\subset\mathcal{C}^{\infty}(\mathcal{O})\) of \(L^{2}(\mathcal{O})\) consisting of the eigenfunctions of the Neumann Laplacian operator \(A_{1}\). For \(m\in\mathbb{N}\), we will consider the following finite-dimensional spaces \[\mathbf{H}_{m}=\text{spam}\{\mathbf{w}_{1},...,\mathbf{w}_{m}\},\qquad H_{m}= \text{spam}\{\varphi_{1},...,\varphi_{m}\},\qquad\mathcal{H}_{m}=\mathbf{H}_{ m}\times H_{m}\times H_{m},\] where we endow \(\mathcal{H}_{m}\) with the following norm \[|(\mathbf{u},c,n)|_{\mathcal{H}_{m}}^{2}=|\mathbf{u}|_{L^{2}}^{2}+|c|_{L^{2}} ^{2}+|n|_{L^{2}}^{2}\,,\quad(\mathbf{u},c,n)\in\mathcal{H}_{m}.\] Owing to the fact that \(\mathcal{H}_{m}\) is a finite dimensional space, the \(L^{2}(\mathcal{O})\), \(H^{1}(\mathcal{O})\) and \(H^{2}(\mathcal{O})\)-norms are equivalent on this space. We choose as in [44, P. 335]\(n_{0}^{m}\), \(c_{0}^{m}\) and \(\mathbf{u}_{0}^{m}\) such that (4.1) \[\begin{split}& n_{0}^{m}>0,\ \ n_{0}^{m}\to n_{0}\ \ \text{in}\ \ L^{2}(\mathcal{O}),\ \ n_{0}^{m}\ln n_{0}^{m}\to n_{0}\ln n_{0}\ \ \text{in}\ \ L^{1}(\mathcal{O}),\\ & c_{0}^{m}>0,\ \ |c_{0}^{m}|_{L^{\infty}}\leq|c_{0}|_{L^{\infty}} \,,\ \ c_{0}^{m}\to c_{0}\ \ \text{in}\ \ H^{1}(\mathcal{O}),\\ &\ We then consider on the filtered probability space \((\Omega,\mathcal{F},\{\mathcal{F}_{t}\}_{t\in[0,T]},\mathbb{P})\) the following finite dimensional problem. For all \(t\in[0,T]\) \[\mathbf{u}_{m}(t)+\int_{0}^{t}\!\!\big{[}\eta A_{0}\mathbf{u}_{m} (s)+\mathcal{P}_{m}^{1}B_{0}(\mathbf{u}_{m}(s),\mathbf{u}_{m}(s))\big{]}ds\] \[=\mathbf{u}_{0}^{m}+\int_{0}^{t}\mathcal{P}_{m}^{1}R_{0}(n_{m}(s),\Phi)ds+\int_{0}^{t}\mathcal{P}_{m}^{1}g(\mathbf{u}_{m}(s),c_{m}(s))dW_{s},\] \[c_{m}(t)+\int_{0}^{t}\!\!\big{[}\xi A_{1}c_{m}(s)+\mathcal{P}_{m }^{2}B_{1}(\mathbf{u}_{m}(s),c_{m}(s))\big{]}ds\] \[=c_{0}^{m}-\int_{0}^{t}\mathcal{P}_{m}^{2}R_{1}(n_{m}(s),c_{m}(s) )ds+\gamma\int_{0}^{t}\mathcal{P}_{m}^{2}\phi(c_{m}(s))d\beta_{s},\] \[n_{m}(t)+\int_{0}^{t}\!\!\big{[}\delta A_{1}n_{m}(s)+\mathcal{P} _{m}^{2}B_{1}(\mathbf{u}_{m}(s),n_{m}(s))\big{]}ds=n_{0}^{m}-\int_{0}^{t} \mathcal{P}_{m}^{2}R_{2}(n_{m}(s),c_{m}(s))ds, \tag{4.2}\] where \(\mathcal{P}_{m}^{1}\) and \(\mathcal{P}_{m}^{2}\) are the projection from \(H\) and \(L^{2}(\mathcal{O})\) onto \(\mathbf{H}_{m}\) and \(H_{m}\), respectively, and their operator norms are equal to \(1\). For each \(m\), we consider the following mapping \(\Psi_{m}:\mathcal{H}_{m}\to\mathcal{H}_{m}\) defined by \[\Psi_{m}(\mathbf{u},c,n)=\begin{pmatrix}\eta A_{0}\mathbf{u}+\mathcal{P}_{m}^{ 1}B_{0}(\mathbf{u},\mathbf{u})-\mathcal{P}_{m}^{1}R_{0}(n,\Phi)\\ \xi A_{1}c+\mathcal{P}_{m}^{2}B_{1}(\mathbf{u},c)+\mathcal{P}_{m}^{2}R_{1}(n,c )\\ \delta A_{1}n+\mathcal{P}_{m}^{2}B_{1}(\mathbf{u},n)+\mathcal{P}_{m}^{2}R_{2}( n,c)\end{pmatrix}.\] In the following lemma, we are going to state an important property of the mappings \(\Psi_{m}\), \(m\in\mathbb{N}\). **Lemma 4.1**.: _Let Assumption 2.1 and Assumption 2.3 be satisfied. For each \(m\in\mathbb{N}\), the mapping \(\Psi_{m}\) is locally Lipschitz continuous. To be more precise, for each \(m\in\mathbb{N}\) and every \(r>0\), there exists a constant \(\mathcal{K}_{r}\) such that_ \[\left|\Psi_{m}(\mathbf{v}_{1})-\Psi_{m}(\mathbf{v}_{2})\right|_{\mathcal{H}_{m }}\leqslant\mathcal{K}_{r}\left|\mathbf{v}_{1}-\mathbf{v}_{2}\right|_{ \mathcal{H}_{m}}, \tag{4.3}\] _for \(\mathbf{v}_{1}=(\mathbf{u}_{1},c_{1},n_{1})\), \(\mathbf{v}_{2}=(\mathbf{u}_{2},c_{2},n_{2})\in\mathcal{H}_{m}\) with \(\left|\mathbf{v}_{i}\right|_{\mathcal{H}_{m}}\leqslant r\), \(i=1,2\)._ Proof.: Let \(\mathbf{v}_{1}=(\mathbf{u}_{1},c_{1},n_{1})\), \(\mathbf{v}_{2}=(\mathbf{u}_{2},c_{2},n_{2})\in\mathcal{H}_{m}\) and \(\mathbf{v}=(\mathbf{u},c,n)\in\mathcal{H}_{m}\). We assume that \(\left|\mathbf{v}_{i}\right|_{\mathcal{H}_{m}}\leqslant r\), \(i=1,2\). We have \[(\Psi_{m}(\mathbf{v}_{1})-\Psi_{m}(\mathbf{v}_{2}),\mathbf{v})_{ \mathcal{H}_{m}} =(\eta A_{0}(\mathbf{u}_{1}-\mathbf{u}_{2})+B_{0}(\mathbf{u}_{1}, \mathbf{u}_{1})-B_{0}(\mathbf{u}_{2},\mathbf{u}_{2})-R_{0}(n_{1},\Phi)+R_{0}(n _{2},\Phi),\mathbf{u})\] \[+(\xi A_{1}(c_{1}-c_{2})+B_{1}(\mathbf{u}_{1},c_{1})-B_{1}( \mathbf{u}_{2},c_{2})+R_{1}(n_{1},c_{1})-R_{1}(n_{2},c_{2}),c) \tag{4.4}\] \[+(\delta A_{1}(n_{1}-n_{2})+B_{1}(\mathbf{u}_{1},n_{1})-B_{1}( \mathbf{u}_{2},n_{2})+R_{2}(n_{1},c_{1})-R_{2}(n_{2},c_{2}),n).\] Using the bilinearity of the operator \(B_{0}\), we see that \[\left|(B_{0}(\mathbf{u}_{1},\mathbf{u}_{1})-B_{0}(\mathbf{u}_{2},\mathbf{u}_{2}),\mathbf{u})\right| \leqslant\left|(B_{0}(\mathbf{u}_{1}-\mathbf{u}_{2},\mathbf{u}_{1 }),\mathbf{u})\right|+\left|(B_{0}(\mathbf{u}_{2},\mathbf{u}_{1}-\mathbf{u}_{2 }),\mathbf{u})\right|\] \[\leqslant 2\mathcal{K}_{r}\left|\mathbf{u}_{1}-\mathbf{u}_{2} \right|_{L^{2}}\left|\mathbf{u}\right|_{L^{2}}.\] By the Holder inequality we also note that \[(R_{0}(n_{1},\Phi)-R_{0}(n_{2},\Phi),\mathbf{u}) \leqslant\int_{\mathcal{O}}\left|n_{1}-n_{2}\right|\left|\nabla \Phi\right|\left|\mathbf{u}\right|dx\] \[\leqslant\left|\nabla\Phi\right|_{L^{\infty}}\left|n_{1}-n_{2} \right|_{L^{2}}\left|\mathbf{u}\right|_{L^{2}}.\] Since the space \(H^{1}(\mathcal{O})\) is continuously embedded in the space \(L^{q}(\mathcal{O})\) for any \(q\geqslant 2\), we have \[\left|(B_{1}(\mathbf{u}_{1},c_{1})-B_{1}(\mathbf{u}_{2},c_{2}),c)\right| \leqslant\left|(B_{1}(\mathbf{u}_{1}-\mathbf{u}_{2},c_{1}),c) \right|+\left|(B_{1}(\mathbf{u}_{2},c_{1}-c_{2}),c)\right|\] \[\leqslant\left|\left|\mathbf{u}_{1}-\mathbf{u}_{2}\right|_{L^{4}} \left|\nabla c_{1}\right|_{L^{2}}\left|c\right|_{L^{4}}+\left|\mathbf{u}_{2} \right|_{L^{4}}\left|\nabla(c_{1}-c_{2})\right|_{L^{2}}\left|c\right|_{L^{4}}\] \[\leqslant\left(\left|\nabla(\mathbf{u}_{1}-\mathbf{u}_{2})\right| _{L^{2}}\left|\nabla c_{1}\right|+\left|\nabla\mathbf{u}_{2}\right|_{L^{2}} \left|\nabla(c_{1}-c_{2})\right|_{L^{2}}\right)\left|c\right|_{H^{1}}\] \[\leqslant\mathcal{K}_{r}(\left|\nabla(\mathbf{u}_{1}-\mathbf{u}_{ 2})\right|_{L^{2}}+\left|\nabla(c_{1}-c_{2})\right|_{L^{2}})\left|c\right|_{H ^{1}}.\] In a similar way we show that \[\left|(B_{1}(\mathbf{u}_{1},n_{1})-B_{1}(\mathbf{u}_{2},n_{2}),n)\right| \leqslant\mathcal{K}_{r}(\left|\nabla(\mathbf{u}_{1}-\mathbf{u}_{2})\right|_{ L^{2}}+\left|\nabla(n_{1}-n_{2})\right|_{L^{2}})\left|n\right|_{H^{1}}.\] Owing to the fact that \(H_{m}\subset\mathcal{C}^{\infty}(\mathcal{O})\) and \(f(0)=0\) as well as \(f\in C^{1}([0,\infty))\), we derive that \[\left|(R_{1}(n_{1},c_{1})-R_{1}(n_{2},c_{2}),c)\right| \leqslant\int_{\mathcal{O}}\left|n_{1}-n_{2}\right|f(c_{1})\left| c\right|dx+\int_{\mathcal{O}}\left|n_{2}\right|\left|f(c_{1})-f(c_{2}) \right|\left|c\right|dx\] \[\leqslant\max_{0\leqslant c\leqslant\left|c_{1}\right|_{L^{2}} }f(c)\int_{\mathcal{O}}\left|n_{1}-n_{2}\right|\left|c\right|dx\] \[\qquad+\max_{0\leqslant c\leqslant\max(\left|c_{1}\right|_{L^{ \infty}},\left|c_{2}\right|_{L^{2}})}f^{\prime}(c)\int_{\mathcal{O}}\left|n_{ 2}\right|\left|c_{1}-c_{2}\right|\left|c\right|dx\] \[\leqslant\max_{0\leqslant c\leqslant r}f(c)\left|n_{1}-n_{2}\right| _{L^{2}}\left|c\right|_{L^{2}}+\max_{0\leqslant c\leqslant r}f^{\prime}\left|n _{2}\right|_{L^{4}}\left|c_{1}-c_{2}\right|_{L^{4}}\left|c\right|_{L^{2}}\] \[\leqslant\mathcal{K}_{r}(\left|n_{1}-n_{2}\right|_{L^{2}}+\left|c_ {1}-c_{2}\right|_{H^{1}})\left|c\right|_{L^{2}}.\] Also, we note that \[\left|(R_{2}(n_{1},c_{1})-R_{2}(n_{2},c_{2}),n)\right| \leqslant\int_{\mathcal{O}}\left|n_{1}-n_{2}\right|\left|\nabla c _{1}\right|\left|\nabla n\right|dx+\int_{\mathcal{O}}\left|n_{2}\right|\left| \nabla(c_{1}-c_{2})\right|\left|\nabla n\right|dx\] \[\leqslant\left|n_{1}-n_{2}\right|_{L^{2}}\left|\nabla c_{1}\right| _{L^{4}}\left|\nabla n\right|_{L^{2}}+\left|n_{2}\right|_{L^{4}}\left|\nabla(c _{1}-c_{2})\right|_{L^{4}}\left|\nabla n\right|_{L2}\] \[\leqslant\mathcal{K}_{r}(\left|n_{1}-n_{2}\right|_{L^{2}}+\left|c_ {1}-c_{2}\right|_{H^{2}})\left|n\right|_{H^{1}}.\] Taking into account the fact that all norms are equivalent in finite dimensional space, and the fact that the operators \(A_{0}\) and \(A_{1}\) are linear, we infer these previous inequalities and equality (4.4). The existence of solutions to the finite dimensional problem (4.2) is classical. In fact, due to Lemma 4.1, the mapping \(\Psi_{m}\) is locally Lipschitz. Also by the inequality (2.12), \(\mathcal{P}_{m}^{1}g(\cdot,\cdot)\) is locally Lipschitz. From the linearity of \(\phi(.)\), we can easily see that \(\mathcal{P}_{m}^{2}\phi(\cdot)\) is Lipschitz. Hence, by well known theory for finite dimensional stochastic differential equations with locally Lipschitz coefficients (see [31, Theorem 38, P. 303] for full details) there exists a local solution of system (4.2) with continuous paths in \(\mathcal{H}_{m}\). That is, there exists a stopping time \(\tau_{m}\), a process \(t\mapsto(\mathbf{u}_{m}(t),c_{m}(t),n_{m}(t))\) such that \(\tau_{m}>0\)\(\mathbb{P}\)-a.s., and the stopped process \[t\mapsto(\mathbf{u}_{m}(t\wedge\tau_{m}),c_{m}(t\wedge\tau_{m}),n_{m}(t\wedge \tau_{m}))\] satisfies the system of Ito equation (4.2) and has continuous paths in \(\mathcal{H}_{m}\). Moreover, if a process \[t\mapsto(\bar{\mathbf{u}}_{m}(t),\bar{c}_{m}(t),\bar{n}_{m}(t)),\] and a stopping time \(\sigma_{m}\) constitute another local solution, then \[(\mathbf{u}_{m}(\cdot),c_{m}(\cdot),n_{m}(\cdot))=(\bar{\mathbf{u}}_{m}(\cdot),\bar{c}_{m}(\cdot),\bar{n}_{m}(\cdot)),\quad\mathbb{P}\text{-a.s. on }\ [0,\tau_{m}\wedge\sigma_{m}].\] We will show in what follows that the solutions \((\mathbf{u}_{m},c_{m},n_{m})\) exist almost surely for every \(t\in[0,T]\). For this goal, it will be enough to show that \[\tau_{m}(\omega)>T,\ \ \text{for\ \ almost\ \ all\ \ }\omega\in\Omega,\text{and\ \ all\ \ }m\in\mathbb{N}. \tag{4.5}\] To this aim, we will use some idea from [33, P. 132, Proof of Theorem 12.1]. Since for all \(m\in\mathbb{N}\), the deterministic integrand \(\Psi_{m}\) and the stochastic integrand \(\mathcal{P}_{m}^{1}g\) are locally Lipschitz, for each \(N\in\mathbb{N}\), we can define the integrands \(\Psi_{m}^{N}\) and \(\mathcal{P}_{m}^{1}g^{N}\), agreeing respectively with \(\Psi_{m}\) and \(\mathcal{P}_{m}^{1}g\) on the ball \[\mathbb{B}_{\mathcal{H}_{m}}^{N}:=\left\{(\mathbf{v},\varphi,\psi)\in \mathcal{H}_{m}:\left|(\mathbf{v},\varphi,\psi)\right|_{\mathcal{H}_{m}}<N \right\},\] such that \(\Psi_{m}^{N}\) and \(\mathcal{P}_{m}^{1}g^{N}\) are globally Lipschitz. As consequence, since \(\mathcal{P}_{m}^{2}\phi\) is already globally Lipschitz, [33, P. 128, Theorem 11.2] guarantees that there is a unique solution \((\mathbf{u}_{m}^{N},c_{m}^{N},n_{m}^{N})\) to a system associated to the system (4.2) with \(\Psi_{m}^{N}\) and \(\mathcal{P}_{m}^{1}g^{N}\) (instead of \(\Psi_{m}\) and \(\mathcal{P}_{m}^{1}g\)) and defined on \([0,+\infty)\) almost surely. We then define a sequence of stopping times as follows for all \(m,N\in\mathbb{N}\) \[\tau_{N}^{m}:=\inf\{t>0:\sqrt{\left|n_{m}^{N}(t)\right|_{L^{2}}^{2}+\left| \mathbf{u}_{m}^{N}(t)\right|_{L^{2}}^{2}+\left|c_{m}^{N}(t)\right|_{H^{1}}^{2 }}\geq N\}\wedge N, \tag{4.6}\] where \(a\wedge b:=\min\{a,b\}\) for any real numbers \(a\) and \(b\). For any fixed \(m\in\mathbb{N}\), the sequence \(\{\tau_{N}^{m}\}_{N\in\mathbb{N}}\) is obviously increasing. Moreover [33, P. 131, Corollary 11.10] implies that for all \(N\in\mathbb{N}\), \[(\mathbf{u}_{m},c_{m},n_{m})=(\mathbf{u}_{m}^{N},c_{m}^{N},n_{m}^{N})\ \ \text{on}\ \ [0,\tau_{N}^{m}].\] From this last equality, we infer that the solution \((\mathbf{u}_{m},c_{m},n_{m})\) of system (4.2) is defined on \([0,\tau_{N}^{m}]\) for all \(N\in\mathbb{N}\) and hence, \(\tau_{m}>\tau_{N}^{m}\) almost surely for all \(N\in\mathbb{N}\). Therefore, \[\tau_{m}\geq\sup_{N\in\mathbb{N}}\tau_{N}^{m},\ \ \text{$\mathbb{P}$-a.s.}\] In order to prove the inequality (4.5), it is sufficient to prove that \[\sup_{N\in\mathbb{N}}\tau_{N}^{m}>T,\ \ \text{$\mathbb{P}$-a.s.} \tag{4.7}\] Before proving this, in the following lemma, we prove some properties of the local solution \((\mathbf{u}_{m},c_{m},n_{m})\) of system (4.2). **Lemma 4.2**.: _Assumption 2.1 and Assumption 2.2. Then for all \(m,N\in\mathbb{N}\), the following equality and inequalities hold \(\mathbb{P}\)-a.s._ \[\int_{\mathcal{O}}n_{m}(t\wedge\tau_{N}^{m},x)dx=\int_{\mathcal{O}}n_{0}^{m}(x )dx,\ \ \text{for\ \ all\ \ }t\in[0,T], \tag{4.8}\] \[n_{m}(t\wedge\tau_{N}^{m})>0,\ \ \text{and}\ \ c_{m}(t\wedge\tau_{N}^{m})>0,\ \ \text{for\ \ all\ \ }t\in[0,T], \tag{4.9}\] _and_ \[\left|c_{m}(t\wedge\tau_{N}^{m})\right|_{L^{\infty}}\leq\left|c_{0}\right|_{L ^{\infty}},\ \ \text{for\ \ all\ \ }t\in[0,T]. \tag{4.10}\] Proof.: In order to prove the non-negativity of \(n_{m}(t\wedge\tau_{N}^{m})\) and \(c_{m}(t\wedge\tau_{N}^{m})\), we will follow the idea of the proof of Lemma 3.6. But, instead of the Gagliardo-Niremberg-Sobolev inequality, we will use the equivalence of the norms on finite dimensional space. Let \(N,m\in\mathbb{N}\) and \(t\in[0,T]\) be arbitrary but fixed. For all \(s\in[0,t]\) define \[n_{m_{-}(s\wedge\tau_{N}^{m})}:=\max(-n_{m}(s\wedge\tau_{N}^{m}),0).\] We remark that \(n_{m_{-}}(s\wedge\tau_{N}^{m})\in W^{2,2}(\mathcal{O})\) and \[n_{m_{-}}(s\wedge\tau_{N}^{m})=0\cdot 1_{\{n_{m}(s\wedge\tau_{N}^{m}) \geqslant 0\}}-n_{m}(s\wedge\tau_{N}^{m})\cdot 1_{\{n_{m}(s\wedge\tau_{N}^{m})<0\}},\] \[\nabla n_{m_{-}}(s\wedge\tau_{N}^{m})=0\cdot 1_{\{n_{m}(s\wedge\tau_{N}^ {m})\geqslant 0\}}-\nabla n_{m}(s\wedge\tau_{N}^{m})\cdot 1_{\{n_{m}(s\wedge\tau_{N}^ {m})<0\}},\] \[\Delta n_{m_{-}}(s\wedge\tau_{N}^{m})=0\cdot 1_{\{n_{m}(s\wedge \tau_{N}^{m})\geqslant 0\}}-\Delta n_{m}(s\wedge\tau_{N}^{m})\cdot 1_{\{n_{m}(s \wedge\tau_{N}^{m})<0\}}.\] We can easily see also that for all \(s\in[0,t]\), \[\frac{dn_{m}(s\wedge\tau_{N}^{m})}{dt}n_{m_{-}}(s\wedge\tau_{N}^ {m}) =-\frac{dn_{m_{-}}(s\wedge\tau_{N}^{m})}{dt}n_{m_{-}}(s\wedge\tau_{N}^{m}),\] \[n_{m_{-}}(s\wedge\tau_{N}^{m})\nabla n_{m}(s\wedge\tau_{N}^{m}) =-n_{m_{-}}(s\wedge\tau_{N}^{m})\nabla n_{m_{-}}(s\wedge\tau_{N}^ {m}),\] \[\Delta n_{m}(s\wedge\tau_{N}^{m})n_{m_{-}}(s\wedge\tau_{N}^{m}) =-\Delta n_{m_{-}}(s\wedge\tau_{N}^{m})n_{m_{-}}(s\wedge\tau_{N}^ {m}).\] Hence, we multiply equation \((\ref{eq:n_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_mm_mm_m_m_m_m_m_mm_m_m_m_mm_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_m_mm_m_m_m_m_m_m_m_m_m_m_m_m_m_mm_m_m_m_m_m_mm_m_m_m_m_mm_m_m_m_m_mm_m_m_mm_m_mm_m_m_mm_m_m_mm_m_m_mm_m_m_mm_mm_mm_mm_m_mm_m_mm_mm_mm_mm_mm_mm_mm_mm_mm_mm_mm_mm_mmm_mm The non-negativity property of \(c_{m}(t\wedge\tau_{N}^{m})\) is quite similar to the proof of Lemma 3.6. We consider the function \(\Psi:H_{m}\to\mathbb{R}\) defined by \(\Psi(c)=\int_{\mathcal{O}}c_{-}^{2}(x)dx\) where \(c_{-}=\max(-c;0)\). Let \(\{\psi_{h}\}_{h\in\mathbb{N}}\) be a sequence of smooth functions defined by \(\psi_{h}(y)=y^{2}\varphi(hy)\), for all \(y\in\mathbb{R}\) and \(h\in\mathbb{N}\), where the function \(\varphi\) is defined by (3.8). We consider for any \(h\geq 1\), the following sequence of function \(\Psi_{h}:H_{m}\to\mathbb{R}\) defined by \(\Psi_{h}=\int_{\mathcal{O}}\psi_{h}(c(x))dx\), for \(c\in H_{m}\). The mapping \(\Psi_{h}\) is twice (Frechet) differentiable and its first and second derivatives are given by \[\Psi_{h}^{\prime}(c)(z)=2\int_{\mathcal{O}}c(x)\varphi(hc(x))z(x)dx+h\int_{ \mathcal{O}}c^{2}(x)\varphi^{\prime}(hc(x))z(x)dx,\quad\forall c,z\in H_{m},\] and \[\Psi_{h}^{{}^{\prime\prime}}(c)(z,k) =h^{2}\int_{\mathcal{O}}c^{2}(x)\varphi^{{}^{\prime\prime}}(hc(x ))z(x)k(x)dx\] \[\qquad+4h\int_{\mathcal{O}}c(x)\varphi^{\prime}(hc(x))z(x)k(x)dx +2\int_{\mathcal{O}}\varphi(hc(x))z(x)k(x)dx,\quad\forall c,z,k\in H_{m}.\] Applying the Ito formula to \(t\mapsto\Psi_{h}(c_{m}(t\wedge\tau_{N}^{m}))\), we obtain for all \(t\in[0,T]\), \[\Psi_{h}(c_{m}(t\wedge\tau_{N}^{m}))-\Psi_{h}(c_{m}(0)) =\int_{0}^{t\wedge\tau_{N}^{m}}\Psi_{h}^{\prime}(c_{m}(s))\left( \mathbf{u}_{m}(s)\cdot\nabla c_{m}(s)+\xi\Delta c_{m}(s)-n_{m}(s)f(c_{m}(s)) \right)ds\] \[\qquad+\frac{1}{2}\int_{0}^{t\wedge\tau_{N}^{m}}\sum_{k=1}^{2} \Psi_{h}^{{}^{\prime\prime}}(c_{m}(s))\left(\gamma\phi_{k}(c_{m}(s)),\gamma \phi_{k}(c_{m}(s))\right)ds\] \[\qquad+\gamma\sum_{k=1}^{2}\int_{0}^{t\wedge\tau_{N}^{m}}\Psi_{h }^{\prime}(c_{m}(s))(\phi_{k}(c_{m}(s)))d\beta_{s}^{k}.\] Similarly to (3.10), (3.11), (3.12), (3.13) and (3.14), we can infer from this last equality that \[\int_{\mathcal{O}}\psi_{h}(c_{m}(t\wedge\tau_{N}^{m},x))dx -\int_{\mathcal{O}}\psi_{h}(c_{0}^{m}(x))dx \tag{4.13}\] \[=\int_{0}^{t\wedge\tau_{N}^{m}}\Psi_{h}^{\prime}(c_{m}(s))\left( \mathbf{u}_{m}(s)\cdot\nabla c_{m}(s)+\eta\Delta c_{m}(s)-n_{m}(s)f(c_{m}(s)) \right)ds.\] Now, observe that from the assumptions on the function \(\varphi\), we infer that for all \(y\in\mathbb{R}\) we have \[\lim_{h\longrightarrow\infty}\psi_{h}(y)=-y^{2}\cdot 1_{\{y<0\}}=-y_{-}^{2} \quad\text{and}\quad\lim_{h\longrightarrow\infty}2y\varphi(hy)=-2y\cdot 1_{\{y<0\}}. \tag{4.14}\] We note that for any \(y\in\mathbb{R}\), we have \[\lim_{h\longrightarrow\infty}h\varphi^{\prime}(hy)=0, \tag{4.15}\] and also that \[\left|\psi_{h}(y)\right|\leq\mathcal{K}y^{2}\quad\text{and}\quad\left|h \varphi^{\prime}(hy)\right|\leq\mathcal{K}\left|y\right|, \tag{4.16}\] for any \(y\in\mathbb{R}\) and for all \(h\geq 1\), where \(\mathcal{K}>0\) is a constant. Using (4.14)-(4.16) and applying the Lebesgue Dominated Convergence Theorem, we can pass to the limit as \(h\) tends to infinity in (4.13). In this way, we derive that \[-\int_{\mathcal{O}}c_{m_{-}}^{2}(t\wedge\tau_{N}^{m},x)dx+\int_{ \mathcal{O}}(c_{0}^{m}(x))_{-}^{2}dx\] \[=-2\int_{0}^{t\wedge\tau_{N}^{m}}\int_{\mathcal{O}}\left(\left( \mathbf{u}_{m}(s,x)\cdot\nabla c_{m}(s,x)+\eta\Delta c_{m}(s,x)\right)\right)c_ {m}(s,x)1_{\{c_{m}(s,x)<0\}}dxds\] \[\qquad+2\int_{0}^{t\wedge\tau_{N}^{m}}\int_{\mathcal{O}}n_{m}(s,x )f(c_{m}(s,x))c_{m}(s,x)1_{\{c_{m}(s,x)<0\}}dxds\] \[=2\int_{0}^{t\wedge\tau_{N}^{m}}\int_{\mathcal{O}}\left(\eta\left| \nabla c_{m}(s,x)\right|^{2}+n_{m}(s,x)f(c_{m}(s,x))c_{m}(s,x)\right)1_{\{c_{ m}(s,x)<0\}}dxds, \tag{4.17}\] where we have used integration-by-parts and the fact that \(\nabla\!\cdot\!\mathbf{u}_{m}\!=\!0\). By the mean value theorem we know that, for all \(x\!\in\!\mathcal{O}\), there exists a number \(\lambda_{m}(x)\!\in\!\left(\min(0,c_{m}(x)),\max(0,c_{m}(x))\right)\) such that \[f(c_{m}(x))-f(0)=c_{m}(x)f^{\prime}(\lambda_{m}(x)).\] By the fact that \(f(0)\!=\!0\), we infer from (4.17) that \[\left|c_{m_{-}}(t\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}-|(c_{0}^{m})_{-}|_{L^{ 2}}^{2}=-2\int_{0}^{t\wedge\tau_{N}^{m}}\int_{\mathcal{O}}n_{m}(s,x)f^{\prime }(\lambda_{m}(s,x))c_{m}^{2}(s,x)1_{\{c_{m}(s,x)<0\}}dxds.\] Since \(f^{\prime}\!>\!0\) and \(1_{\{c_{m}<0\}}\!>\!0\) as well as on \([0,t\wedge\tau_{N}^{m}]\), \(c_{m}^{2}\!>\!0\) and \(n_{m}\!>\!0\), we deduce that \(\left|c_{m_{-}}(t\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}\leq\left|(c_{0}^{m})_{- }\right|_{L^{2}}^{2}\). Owing to the fact that by the relation (4.1) we have \(c_{0}^{m}\!>\!0\), we derive that \((c_{0}^{m})_{-}\!=\!0\) and therefore \(\left|c_{m_{-}}(t\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}\!=\!0\). This gives \(c_{m_{-}}(t\wedge\tau_{N}^{m})\!=\!0\) and implies that for all \(t\!\in\![0,T]\), \(\mathbb{P}\)-a.s, \(c_{m}(t\wedge\tau_{N}^{m})\!>\!0\). It remains to prove the inequality (4.10). The proof is similar to the proof of Corollary 3.7. Let \(p\!\geqslant\!2\) be an integer. Let \(\Psi\!:\!H_{m}\!\to\!\mathbb{R}\) be the functional defined by \(\Psi(c)\!=\!\int_{\mathcal{O}}c^{p}(x)dx\). Note that the mapping \(\Psi\) is twice (Frechet) differentiable and its first and second derivatives are given by \[\Psi^{\prime}(c)(z)=p\int_{\mathcal{O}}c^{p-1}(x)z(x)dx,\quad \forall c,z\in H_{m},\] \[\Psi^{{}^{\prime\prime}}(c)(z,k)=p(p-1)\int_{\mathcal{O}}c^{p-2}( x)z(x)k(x)dx,\quad\forall c,z,k\in H_{m}.\] By applying the Ito formula to the process \(t\mapsto\Psi(c_{m}(t\wedge\tau_{N}^{m}))\), we derive that for all \(t\in[0,T]\), \[\Psi(c_{m}(t\wedge\tau_{N}^{m}))-\Psi(c_{m}(0)) =\int_{0}^{t\wedge\tau_{N}^{m}}\Psi^{\prime}(c_{m}(s))\left( \mathbf{u}(s)\cdot\nabla c_{m}(s)+\xi\Delta c_{m}(s)-n_{m}(s)G(c_{m}(s))\right)ds\] \[\quad+\frac{1}{2}\int_{0}^{t\wedge\tau_{N}^{m}}\sum_{k=1}^{2} \Psi^{{}^{\prime\prime}}(c_{m}(s))\left(\gamma\phi_{k}(c_{m}(s)),\gamma\phi_{ k}(c_{m}(s))\right)ds\] \[\quad+\gamma\sum_{k=1}^{2}\int_{0}^{t\wedge\tau_{N}^{m}}\Psi^{ \prime}(c_{m}(s))(\phi_{k}(c_{m}(s)))d\beta_{s}^{k},\] from which and calculations similar to (3.13), (3.18), (3.19) and (3.20) we derive from the last equality that \[\Psi(c_{m}(t\wedge\tau_{N}^{m}))-\Psi(c_{0}^{m})\] \[=\int_{0}^{t\wedge\tau_{N}^{m}}\int_{\mathcal{O}}\left(-p(p-2)\,| \nabla c_{m}(s,x)|^{2}\,c_{m}^{p-2}(s,x)-pn_{m}(s,x)f(c_{m}(s,x))c_{m}^{p-1}(s,x)\right)dxds.\] Since for all \(s\in[0,t]\) the quantities \(n_{m}(s\wedge\tau_{N}^{m})\), \(f(c_{m}(s\wedge\tau_{N}^{m}))\) and \(c_{m}(s\wedge\tau_{N}^{m})\) are positive \(\mathbb{P}\)-a.s, we infer from the last equality that for all \(t\in[0,T]\), \(\Psi(c_{m}(t\wedge\tau_{N}^{m}))\leq\Psi(c_{0}^{m})\). This implies that \(|c_{m}(t\wedge\tau_{N}^{m})|_{L^{p}}\leq|c_{0}^{m}|_{L^{p}}\) for all \(p\geq 2\). Using the fact that \(|.|_{L^{p}}\to|.|_{L^{\infty}}\) as \(p\to+\infty\) and the inequality (4.1), we obtain the result. Next, we introduce for any \(t\in[0,T]\) and \(m,N\in\mathbb{N}\), the following Lyapunov functional \[\mathcal{E}(n_{m},c_{m},\mathbf{u}_{m})(t\wedge\tau_{N}^{m}) =\int_{\mathcal{O}}n_{m}(t\wedge\tau_{N}^{m})\ln n_{m}(t\wedge\tau _{N}^{m})dx+\mathcal{K}_{f}\,|\nabla c_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2}\] \[\qquad+\frac{\mathcal{K}_{4}}{\eta}\,|\mathbf{u}_{m}(t\wedge\tau _{N}^{m})|_{L^{2}}^{2}+e^{-1}\,|\mathcal{O}|\,,\] where \(\mathcal{K}_{4}\) is some positive constant to be given later and \(\mathcal{K}_{f}\) is defined in (2.2). Since \(x\ln x\geq-e^{-1}\) for any \(x>0\), we can easily see that for all \(t\in[0,T]\), \(\mathcal{E}(n_{m},c_{m},\mathbf{u}_{m})(t\wedge\tau_{N}^{m})\geq 0\). As in [44] the property (4.1) implies that \[\mathcal{E}(n_{0}^{m},c_{0}^{m},\mathbf{u}_{0}^{m})\leq\mathcal{E}(n_{0},c_{0 },\mathbf{u}_{0}),\qquad\text{for \ all \ }m\geq 1. \tag{4.18}\] In addition, taking into account the inequality (4.10) and setting \(\mathcal{K}=\min(\mathcal{K}_{f},\frac{\mathcal{K}_{4}}{\eta})\) the following holds for all \(t\in[0,T]\), \[|(\mathbf{u}_{m}(t),c_{m}(t\wedge\tau_{N}^{m})|_{\mathcal{H}}^{2} \leq\mathcal{K}^{-1}\mathcal{E}(n_{m},c_{m},\mathbf{u}_{m})(t\wedge \tau_{N}^{m})+\mathcal{K}^{-1}\,|c_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2} \tag{4.19}\] \[\leq\mathcal{K}^{-1}\mathcal{E}(n_{m},c_{m},\mathbf{u}_{m})(t \wedge\tau_{N}^{m})+\mathcal{K}^{-1}\,|\mathcal{O}|\,|c_{0}|_{L^{\infty}}^{2}\,, \quad\mathbb{P}\text{-a.s.}\] We now proceed to establish some uniform bounds for \(\mathbf{u}_{m}\), \(c_{m}\), and \(n_{m}\) in some suitable spaces. For this purpose, we recall that hereafter, \(\mathcal{K}\) will denote a positive constant independent of \(m\) and \(N\), which may change from one term to the next. **Lemma 4.3**.: _Under the same assumptions as in Proposition 3.5, there exists a positive constant \(\mathcal{K}\) such that for all \(m\in\mathbb{N}\) and \(N\in\mathbb{N}\),_ \[\sup_{0\leq s\leq T}|c_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2}+2\eta\int_{0}^{T \wedge\tau_{N}^{m}}|\nabla c_{m}(s)|_{L^{2}}^{2}\,ds\leq|\mathcal{O}|\,|c_{0}| _{L^{\infty}}^{2}\,,\qquad\mathbb{P}\text{-a.s.} \tag{4.20}\] \[\mathbb{E}\sup_{0\leq s\leq T}\mathcal{E}(n_{m},c_{m},\mathbf{u }_{m})(s\wedge\tau_{N}^{m})\leq\mathcal{K},\] \[\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left(\Big{|}\nabla\sqrt{n _{m}(s)}\Big{|}_{L^{2}}^{2}+|\Delta c_{m}(s)|_{L^{2}}^{2}+|\nabla\mathbf{u}_{ m}(s)|_{L^{2}}^{2}\right)ds\leq\mathcal{K}. \tag{4.21}\] Proof.: Let \(t\in[0,T]\) be arbitrary but fixed. We start by proving the estimate (4.20). To do this, we take \((m,N)\in\mathbb{N}^{2}\) arbitrary and apply the Ito formula to \(t\mapsto|c_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2}\) to get \[|c_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2}+2\xi\int_{0}^{t\wedge \tau_{N}^{m}}|\nabla c_{m}(s)|_{L^{2}}^{2}\,ds \tag{4.22}\] \[=|c_{0}^{m}|_{L^{2}}^{2}-2\int_{0}^{t\wedge\tau_{N}^{m}}(B_{1}( \mathbf{u}_{m}(s),c_{m}(s)),c_{m}(s))ds-2\int_{0}^{t\wedge\tau_{N}^{m}}(R_{1}( n_{m}(s),c_{m}(s)),c_{m}(s))ds\] \[\qquad+\gamma^{2}\int_{0}^{t\wedge\tau_{N}^{m}}|\phi(c_{m}(s))|_{ \mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}+2\gamma\int_{0}^{t\wedge\tau_{N}^{ m}}(\phi(c_{m}(s)),c_{m}(s))d\beta_{s}.\] By integration by part, we derive that \[(B_{1}(\mathbf{u}_{m},c_{m}),c_{m})=\frac{1}{2}\int_{\mathcal{O}}\mathbf{u}_{ m}(x)\cdot\nabla c_{m}^{2}(x)dx=-\frac{1}{2}\int_{\mathcal{O}}c_{m}^{2}(x) \nabla\cdot\mathbf{u}_{m}(x)dx=0.\] By the free divergence property of \(\sigma_{k}\) and the fact that \(\sigma_{k}=0\) on \(\partial\mathcal{O}\), \(k=1,2\), we get \[(\phi(c_{m}),c_{m}) =\sum_{k=1}^{2}\int_{\mathcal{O}}\sigma_{k}(x)\cdot\nabla c_{m}(x )c_{m}(x)dx\] \[=\frac{1}{2}\sum_{k=1}^{2}\int_{\mathcal{O}}\sigma_{k}(x)\cdot \nabla c_{m}^{2}(x)dx\] \[=-\frac{1}{2}\sum_{k=1}^{2}\int_{\mathcal{O}}c_{m}^{2}(x)\nabla \cdot\sigma_{k}(x)dx+\frac{1}{2}\sum_{k=1}^{2}\int_{\partial\mathcal{O}}c_{m} ^{2}(\sigma)\sigma_{k}(\sigma)\cdot\nu d\sigma\] \[=0.\] Taking into account the equality (3.13), we infer that \[|\phi(c_{m})|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}=\sum_{k=1}^{2}\int _{\mathcal{O}}|\sigma_{k}(x)\cdot\nabla c_{m}(x)|_{L^{2}}^{2}\,dx=|\nabla c_{ m}|_{L^{2}}^{2}\,.\] Using these three last equalities and the fact that \(|c_{0}^{m}|_{L^{2}}^{2}\leq|\mathcal{O}|\,|c_{0}|_{L^{\infty}}^{2}\) (since by the relation (4.1), \(|c_{0}^{m}|_{L^{\infty}}^{2}\leq|c_{0}|_{L^{\infty}}^{2}\)), we infer from the equality (4.22) that for all \(t\in[0,T]\), \[|c_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2}+2\eta\int_{0}^{t\wedge\tau_{N}^{m}} |\nabla c_{m}(s)|_{L^{2}}^{2}\,ds+2\int_{0}^{t\wedge\tau_{N}^{m}}\int_{ \mathcal{O}}n_{m}(s,x)f(c_{m}(s,x))c_{m}(s,x)dxds\leq|\mathcal{O}|\,|c_{0}|_{L ^{\infty}}^{2}\,. \tag{4.23}\] Thanks to the non-negativity of \(n_{m}(s\wedge\tau_{N}^{m})\), \(c_{m}(s\wedge\tau_{N}^{m})\) and \(f\) over the interval \([0,t]\) given in Lemma 4.2 and Assumption 2.1, we can deduce from the inequality (4.23) that \[\sup_{0\leq t\leq T}|c_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2}+2\eta\int_{0}^{T \wedge\tau_{N}^{m}}|\nabla c_{m}(s)|_{L^{2}}^{2}\,ds\leq|\mathcal{O}|\,|c_{0 }|_{L^{\infty}}^{2}\,,\qquad\mathbb{P}\text{-a.s.} \tag{4.24}\] Let us now move to the proof of the estimate (4.21). Multiplying equation (2.14)\({}_{3}\) by \(1+\ln n_{m}(s\wedge\tau_{N}^{m})\) for \(s\in[0,t]\) and integrate the resulting equation in \(\mathcal{O}\) and using an integration-by-parts as well as the divergence free property of \(\mathbf{u}_{m}\), we have \[\frac{d}{dt}\int_{\mathcal{O}}n_{m}(s\wedge\tau_{N}^{m},x)\ln n(s \wedge\tau_{N}^{m},x)dx+\delta\int_{\mathcal{O}}\frac{|\nabla n_{m}(s\wedge \tau_{N}^{m},x)|^{2}}{n_{m}(s\wedge\tau_{N}^{m},x)}dx \tag{4.25}\] \[=\chi\int_{\mathcal{O}}\nabla n_{m}(s\wedge\tau_{N}^{m},x)\cdot \nabla c_{m}(s\wedge\tau_{N}^{m},x)dx.\] In the equality (4.25), we have used the fact that \(\mathbf{u}_{m}=\frac{\partial n_{m}}{\partial\nu}=0\) on \(\partial\mathcal{O}\) and the fact that \[-\int_{\mathcal{O}}\Delta n_{m}(x)\ln(n_{m}(x))dx =\int_{\mathcal{O}}\nabla n_{m}(x)\cdot\nabla\ln(n_{m}(x))dx-\int _{\partial\mathcal{O}}\frac{\partial n_{m}(\sigma)}{\partial\nu}\ln(n_{m}( \sigma))d\sigma\] \[=\int_{\mathcal{O}}\frac{\nabla n_{m}(x)\cdot\nabla n_{m}(x)}{n_ {m}(x)}dx,\] as well as \[\int_{\mathcal{O}}\mathbf{u}_{m}(x)\cdot\nabla n_{m}(x)\ln(n_{m} (x))dx =-\int_{\mathcal{O}}n_{m}(x)\nabla\cdot(\mathbf{u}_{m}(x)\ln(n_{m} (x)))dx\] \[\qquad+\int_{\partial\mathcal{O}}n_{m}(\sigma)\ln(n_{m}(\sigma)) \mathbf{u}_{m}(\sigma)\cdot\nu d\sigma\] \[=-\int_{\mathcal{O}}n_{m}(x)\mathbf{u}_{m}(x)\cdot\nabla\ln(n_{m }(x))dx\] \[\qquad-\int_{\mathcal{O}}n_{m}(x)\ln(n_{m}(x))\nabla\cdot \mathbf{u}_{m}(x)dx\] \[=-\int_{\mathcal{O}}\mathbf{u}_{m}(x)\cdot\nabla n_{m}(x)dx.\] It follows from the Young inequality and the Cauchy-Schwarz inequality that \[\chi\int_{\mathcal{O}}\nabla n_{m}(x)\cdot\nabla c_{m}(x)dx\leqslant\frac{ \delta}{2}\int_{\mathcal{O}}\frac{\left|\nabla n_{m}(x)\right|^{2}}{n_{m}(x)} dx+\frac{\chi^{2}}{2\delta}\int_{\mathcal{O}}n_{m}(x)\left|\nabla c_{m}(x) \right|^{2}dx.\] Since \[\int_{\mathcal{O}}\frac{\left|\nabla n_{m}(x)\right|^{2}}{n_{m}(x)}dx=4\int_{ \mathcal{O}}\left|\nabla\sqrt{n_{m}(x)}\right|^{2}dx,\] we may combine the last inequality with equality (4.25) to obtain \[\int_{\mathcal{O}}n_{m}(t\wedge\tau_{N}^{m},x)\ln n_{m}(t\wedge \tau_{N}^{m},x)dx+2\delta\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\sqrt{n_{m }(s)}\right|_{L^{2}}^{2}ds \tag{4.26}\] \[\leqslant\int_{\mathcal{O}}n_{0}^{m}(x)\ln n_{0}^{m}(x)dx+\frac{ \chi^{2}}{2\delta}\int_{0}^{t\wedge\tau_{N}^{m}}\left|\sqrt{n_{m}(s)}\nabla c _{m}(s)\right|_{L^{2}}^{2}ds.\] Applying the Ito formula once more to \(t\mapsto\left|\nabla c_{m}(t\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}\), yields \[\left|\nabla c_{m}(t\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}+2\xi \int_{0}^{t\wedge\tau_{N}^{m}}\left|\Delta c_{m}(s)\right|_{L^{2}}^{2}ds\] \[=\left|\nabla c_{0}^{m}\right|_{L^{2}}^{2}-2\int_{0}^{t\wedge \tau_{N}^{m}}(\nabla B_{1}(\mathbf{u}_{m}(s),c_{m}(s)),\nabla c_{m}(s))ds\] \[\qquad-2\int_{0}^{t\wedge\tau_{N}^{m}}(\nabla R_{1}(n_{m}(s),c_{ m}(s)),\nabla c_{m}(s))ds\] \[\qquad+\gamma^{2}\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\phi(c _{m}(s))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}+2\gamma\int_{0}^{t \wedge\tau_{N}^{m}}(\nabla\phi(c_{m}(s)),\nabla c_{m}(s))d\beta_{s}. \tag{4.27}\] Since \(\mathbf{u}_{m}\) is solenoidal and vanishes on \(\partial\mathcal{O}\), we derive that \[\left(\nabla B_{1}(\mathbf{u}_{m},c_{m}),\nabla c_{m}\right) =\int_{\mathcal{O}}\nabla(\mathbf{u}_{m}(x)\cdot\nabla c_{m}(x)) \cdot\nabla c_{m}(x)dx\] \[=\int_{\mathcal{O}}\nabla\mathbf{u}_{m}(x)\nabla c_{m}(x)\cdot \nabla c_{m}(x)dx\] \[\qquad+\int_{\mathcal{O}}\nabla c_{m}(x)\cdot D^{2}c_{m}(x) \mathbf{u}_{m}(x)dx \tag{4.28}\] \[\leqslant\int_{\mathcal{O}}\left|\nabla\mathbf{u}_{m}(x)\right| \left|\nabla c_{m}(x)\right|^{2}dx+\frac{1}{2}\int_{\mathcal{O}}u_{m}(x)\cdot \nabla\left|\nabla c_{m}(x)\right|^{2}dx\] \[\leqslant\left|\nabla\mathbf{u}_{m}\right|_{L^{2}}\left|\nabla c _{m}\right|_{L^{4}}^{2}.\] We use the Gagliardo-Niremberg inequality to obtain \[\left|\nabla c_{m}\right|_{L^{4}}^{4}\leqslant\mathcal{K}_{GN}\left|c_{m} \right|_{L^{\infty}}^{2}\left|D^{2}c_{m}\right|_{L^{2}}^{2}+\mathcal{K}_{GN} \left|c_{m}\right|_{L^{\infty}}^{4},\] To cancel \(\left|D^{2}c_{m}\right|_{L^{2}}\), we invoke the pointwise identity \[\left|\Delta c_{m}\right|^{2}=\nabla\cdot\left(\Delta c_{m}\nabla c_{m}\right) -\nabla c_{m}\cdot\nabla\Delta c_{m},\] and \(\Delta\left|\nabla c_{m}\right|^{2}=2\nabla c_{m}\cdot\nabla\Delta c_{m}+2 \left|D^{2}c_{m}\right|^{2}\), as well as the integration-by-parts to rewrite \(\left|\Delta c_{m}\right|_{L^{2}}^{2}\) as \[\left|\Delta c_{m}\right|_{L^{2}}^{2} =-\int_{\mathcal{O}}\nabla c_{m}(x)\cdot\nabla\Delta c_{m}(x)dx\] \[=\left|D^{2}c_{m}\right|_{L^{2}}^{2}-\frac{1}{2}\int_{\mathcal{O }}\Delta\left|\nabla c_{m}(x)\right|^{2}dx\] \[=\left|D^{2}c_{m}\right|_{L^{2}}^{2}-\frac{1}{2}\int_{\partial \mathcal{O}}\frac{\partial\left|\nabla c_{m}(\sigma)\right|^{2}}{\partial \nu}d\sigma. \tag{4.29}\] Invoking [27, Lemma 4.2] we obtain \[\frac{1}{2}\int_{\partial\mathcal{O}}\frac{\partial\left|\nabla c_{m}(\sigma )\right|^{2}}{\partial\nu}d\sigma\leqslant\kappa(\mathcal{O})\int_{\partial \mathcal{O}}\left|\nabla c_{m}(\sigma)\right|^{2}d\sigma, \tag{4.30}\] where \(\kappa(\mathcal{O})\) is an upper bound for the curvatures of \(\partial\mathcal{O}\). Thanks to the trace theorem (see [21, (ii) of Proposition 4.22 with (i) of Theorem 4.24]), it holds that \[\int_{\partial\mathcal{O}}\left|\nabla c_{m}(\sigma)\right|^{2}d\sigma \leqslant\mathcal{K}(\mathcal{O},\varsigma)\left|c_{m}\right|_{H^{\frac{3+ \varsigma}{2}}}^{2}\qquad\text{for \ any \ }\varsigma\in(0,1),\] where \(\mathcal{K}(\mathcal{O},\varsigma)>0\) depends only on \(\mathcal{O}\) and \(\varsigma\), which can be fixed for instance \(\varsigma=1/2\). On the other hand, the interpolation inequality, the Young inequality and the inequality (4.10) of Lemma 4.2 imply the existence of \(\mathcal{K}_{1}\) and \(\mathcal{K}_{2}\) depending on \(\mathcal{O}\) such that \[\kappa(\mathcal{O})\mathcal{K}(\mathcal{O},\varsigma)\left|c_{m} \right|_{H^{\frac{7}{2}}}^{2} \leqslant\mathcal{K}_{1}(\left|D^{2}c_{m}\right|_{L^{2}}^{7/4} \left|c_{m}\right|_{L^{2}}^{1/4}+\left|c_{m}\right|_{L^{2}}^{2})\] \[\leqslant\frac{1}{4}\left|D^{2}c_{m}\right|_{L^{2}}^{2}+\mathcal{K} _{2}\left|c_{0}\right|_{L^{\infty}}^{2}.\] Using this previous inequality and (4.30), we infer from the equality (4.29) that \[\left|D^{2}c_{m}\right|_{L^{2}}^{2}\leqslant\frac{4}{3}\left|\Delta c_{m} \right|_{L^{2}}^{2}+\frac{4\mathcal{K}_{2}}{3}\left|c_{0}\right|_{L^{\infty}}^{ 2}, \tag{4.31}\] and therefore \[\left|\nabla c_{m}\right|_{L^{4}}^{4}\leq\frac{4\mathcal{K}_{GN}\left|c_{0} \right|_{L^{\infty}}^{2}}{3}\left|\Delta c_{m}\right|_{L^{2}}^{2}+\left(\frac{4 \mathcal{K}_{2}}{3}+1\right)\mathcal{K}_{GN}\left|c_{0}\right|_{L^{\infty}}^{4 }.\] By the inequality (4.28) and the Young inequality, we infer that \[(\nabla B_{1}(\mathbf{u}_{m},c_{m}),\nabla c_{m}) \leq\left|\nabla\mathbf{u}_{m}\right|_{L^{2}}\left|\nabla c_{m} \right|_{L^{4}}^{2}\] \[\leq\frac{3\xi}{16\mathcal{K}_{GN}\left|c_{0}\right|_{L^{\infty} }^{2}}\left|\nabla c_{m}\right|_{L^{4}}^{4}+\frac{4\mathcal{K}_{GN}\left|c_{0} \right|_{L^{\infty}}^{2}}{3\xi}\left|\nabla\mathbf{u}_{m}\right|_{L^{2}}^{2}\] \[\leq\frac{\xi}{4}\left|\Delta c_{m}\right|_{L^{2}}^{2}+\frac{4 \mathcal{K}_{GN}\left|c_{0}\right|_{L^{\infty}}^{2}}{3\xi}\left|\nabla \mathbf{u}_{m}\right|_{L^{2}}^{2}+\frac{\xi(4\mathcal{K}_{2}+3)}{16}\left|c_{0 }\right|_{L^{\infty}}^{2}.\] Due to the Assumption \(1\) and the inequality (4.10) of Lemma 4.2, we note that \[-(\nabla R_{1}(n_{m},c_{m}),\nabla c_{m}) =-\int_{\mathcal{O}}\nabla(n_{m}(x)f(c_{m}(x)))\cdot\nabla c_{m}( x)dx\] \[=-\int_{\mathcal{O}}f^{\prime}(c_{m}(x))\left|\nabla c_{m}(x) \right|^{2}n_{m}(x)dx-\int_{\mathcal{O}}f(c_{m}(x))\nabla c_{m}(x)\cdot\nabla n _{m}(x)dx\] \[\leq-\frac{\min_{0\leq c\leq\left|c_{0}\right|_{L^{\infty}}}f^{ \prime}(c)}{2}\int_{\mathcal{O}}n_{m}(x)\left|\nabla c_{m}(x)\right|^{2}dx\] \[\qquad+\frac{1}{2\min_{0\leq c\leq\left|c_{0}\right|_{L^{\infty} }}f^{\prime}(c)}\int_{\mathcal{O}}f^{2}(c_{m}(x))\frac{\left|\nabla n_{m}(x) \right|^{2}}{n_{m}(x)}dx\] \[\leq-\frac{\min_{0\leq c\leq\left|c_{0}\right|_{L^{\infty}}}f^{ \prime}(c)}{2}\left|\sqrt{n_{m}}\nabla c_{m}\right|_{L^{2}}^{2}+\frac{2\max_{ 0\leq c\leq\left|c_{0}\right|_{L^{\infty}}}f^{2}(c)}{\min_{0\leq c\leq\left|c_ {0}\right|_{L^{\infty}}}f^{\prime}(c)}\left|\nabla\sqrt{n_{m}}\right|_{L^{2}}^ {2}.\] Combining these two last inequalities, we derive from equality (4.27) that \[\left|\nabla c_{m}(t\wedge\tau_{N}^{m})\right|_{L^{2}}^{2} +\frac{3\xi}{2}\int_{0}^{t\wedge\tau_{N}^{m}}\left|\Delta c_{m}( s)\right|_{L^{2}}^{2}ds+\min_{0\leq c\leq\left|c_{0}\right|_{L^{\infty}}}f^{ \prime}(c)\int_{0}^{t\wedge\tau_{N}^{m}}\left|\sqrt{n_{m}(s)}\nabla c_{m}(s) \right|_{L^{2}}^{2}ds\] \[\leq\left|\nabla c_{0}^{m}\right|_{L^{2}}^{2}+\frac{\xi(4 \mathcal{K}_{2}+3)}{8}\left|c_{0}\right|_{L^{\infty}}^{2}t+\frac{8\mathcal{K} _{GN}\left|c_{0}\right|_{L^{\infty}}^{2}}{3\xi}\int_{0}^{t\wedge\tau_{N}^{m}} \left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}ds\] \[\qquad+\frac{4\max_{0\leq c\leq\left|c_{0}\right|_{L^{\infty}}}f^ {2}(c)}{\min_{0\leq c\leq\left|c_{0}\right|_{L^{\infty}}}f^{\prime}(c)}\int_{0 }^{t\wedge\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s)}\right|_{L^{2}}^{2}ds\] \[\qquad+\gamma^{2}\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\phi( c_{m}(s))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds+2\gamma\int_{0}^{t \wedge\tau_{N}^{m}}(\nabla\phi(c_{m}(s)),\nabla c_{m}(s))d\beta_{s}.\] Multiplying this last inequality by \(\mathcal{K}_{f}\) and adding the result with inequality (4.26) we obtain \[\int_{\mathcal{O}}n_{m}(t\wedge\tau_{N}^{m},x)\ln n_{m}(t\wedge\tau_ {N}^{m},x)dx+\mathcal{K}_{f}\left|\nabla c_{m}(t\wedge\tau_{N}^{m})\right|_{L^{ 2}}^{2}+\frac{\xi\mathcal{K}_{f}}{4}\int_{0}^{t\wedge\tau_{N}^{m}}\left| \Delta c_{m}(s)\right|_{L^{2}}^{2}ds\\ +2\delta\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s)} \right|_{L^{2}}^{2}ds+\int_{0}^{t}\left|\sqrt{n_{m}(s)}\nabla c_{m}(s)\right|_{ L^{2}}^{2}ds\\ \leq\mathcal{K}_{f}\left|\nabla c_{0}^{m}\right|_{L^{2}}^{2}+\int _{\mathcal{O}}n_{0}^{m}(x)\ln n_{0}^{m}(x)dx+\frac{\mathcal{K}_{f}\xi(4 \mathcal{K}_{f}\mathcal{K}_{2}+3)}{8}\left|c_{0}\right|_{L^{\infty}}^{2}t\\ +\frac{8\mathcal{K}_{f}\mathcal{K}_{GN}\left|c_{0}\right|_{L^{ \infty}}^{2}}{3\xi}\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\mathbf{u}_{m}(s )\right|_{L^{2}}^{2}ds+\frac{4\mathcal{K}_{f}\max_{0\leq c\leq\left|c_{0} \right|_{L^{\infty}}}f^{2}(c)}{\min_{0\leq c\leq\left|c_{0}\right|_{L^{\infty} }}f^{\prime}(c)}\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s)} \right|_{L^{2}}^{2}ds\\ +\gamma^{2}\mathcal{K}_{f}\int_{0}^{t\wedge\tau_{N}^{m}}\left| \nabla\phi(c_{m}(s))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds+2 \gamma\mathcal{K}_{f}\int_{0}^{t\wedge\tau_{N}^{m}}(\nabla\phi(c_{m}(s)), \nabla c_{m}(s))d\beta_{s}.\] By using the first inequality of (3.3), we see that the previous inequality reduces to \[\int_{\mathcal{O}}n_{m}(t\wedge\tau_{N}^{m},x)\ln n_{m}(t\wedge \tau_{N}^{m},x)dx+\mathcal{K}_{f}\left|\nabla c_{m}(t\wedge\tau_{N}^{m}) \right|_{L^{2}}^{2}+\frac{3\xi\mathcal{K}_{f}}{2}\int_{0}^{t\wedge\tau_{N}^{m }}\left|\Delta c_{m}(s)\right|_{L^{2}}^{2}ds\\ +2\delta\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s) }\right|_{L^{2}}^{2}ds+\int_{0}^{t\wedge\tau_{N}^{m}}\left|\sqrt{n_{m}(s)} \nabla c_{m}(s)\right|_{L^{2}}^{2}ds\\ \leq\mathcal{K}_{f}\left|\nabla c_{0}^{m}\right|_{L^{2}}^{2}+\int _{\mathcal{O}}n_{0}^{m}(x)\ln n_{0}^{m}(x)dx+\frac{\mathcal{K}_{f}\xi(4 \mathcal{K}_{f}\mathcal{K}_{2}+3)}{8}\left|c_{0}\right|_{L^{\infty}}^{2}t\\ +\frac{8\mathcal{K}_{f}\mathcal{K}_{GN}\left|c_{0}\right|_{L^{ \infty}}^{2}}{3\xi}\int_{0}^{t\wedge\tau_{N}^{m}}\left|\nabla\mathbf{u}_{m}(s )\right|_{L^{2}}^{2}ds+\gamma^{2}\mathcal{K}_{f}\int_{0}^{t\wedge\tau_{N}^{m}} \left|\nabla\phi(c_{m}(s))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds \\ +2\gamma\mathcal{K}_{f}\int_{0}^{t\wedge\tau_{N}^{m}}(\nabla\phi( c_{m}(s)),\nabla c_{m}(s))d\beta_{s}. \tag{4.32}\] Now, we use the equality (4.8) of Lemma 4.2 and the inequality (3.7) to obtain that \[\left|n_{m}\right|_{L^{2}} \leq\mathcal{K}_{GN}\left(\left|\sqrt{n_{m}}\right|_{L^{2}}\left| \nabla\sqrt{n_{m}}\right|_{L^{2}}+\left|\sqrt{n_{m}}\right|_{L^{2}}^{2}\right) \tag{4.33}\] \[\leq\mathcal{K}_{GN}\left(\left|n_{0}^{m}\right|_{L^{1}}^{\frac{1 }{2}}\left|\nabla\sqrt{n_{m}}\right|_{L^{2}}+\left|n_{0}^{m}\right|_{L^{1}} \right),\] By the relation (4.1), we have \(n_{0}^{m}\to n_{0}\) in \(L^{2}(\mathcal{O})\). Thanks to the continuous embedding of \(L^{2}(\mathcal{O})\) into \(L^{1}(\mathcal{O})\), we derive that \(n_{0}^{m}\to n_{0}\) in \(L^{1}(\mathcal{O})\) and therefore the sequence \(\{n_{0}^{m}\}_{m\geq 1}\) is bounded in \(L^{1}(\mathcal{O})\). This implies that the inequality (4.33) can be controlled as follows \[\left|n_{m}\right|_{L^{2}}\leq\mathcal{K}_{GN}\mathcal{K}^{1/2}\left|\nabla \sqrt{n_{m}}\right|_{L^{2}}+\mathcal{K}, \tag{4.34}\] where \(\mathcal{K}\) is a constant independent of \(m\) and \(N\). Next, applying the Ito formula to \(t\mapsto|\mathbf{u}_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2}\) and using the estimation (4.34), we infer the existence of \(\mathcal{K}_{3}>0\) such that \[\begin{split}&|\mathbf{u}_{m}(t\wedge\tau_{N}^{m})|_{L^{2}}^{2}+2 \eta\int_{0}^{t_{\wedge}\tau_{N}^{m}}|\nabla\mathbf{u}_{m}(s)|_{L^{2}}^{2}\,ds \\ &\leq 2\int_{0}^{t_{\wedge}\tau_{N}^{m}}|\nabla\Phi|_{L^{\infty}} \left|n_{m}(s)\right|_{L^{2}}\left|\mathbf{u}_{m}(s)\right|_{L^{2}}ds\\ &\qquad+\int_{0}^{t_{\wedge}\tau_{N}^{m}}|g(\mathbf{u}_{m}(s),c_{ m}(s))|_{\mathcal{L}^{2}(\mathcal{U};H)}^{2}\,ds+2\int_{0}^{t_{\wedge}\tau_{N}^{m}} (g(\mathbf{u}_{m}(s),c_{m}(s)),\mathbf{u}_{m}(s))dWs\\ &\leq|\mathbf{u}_{0}^{m}|_{L^{2}}^{2}+\frac{\delta\eta}{ \mathcal{K}_{4}}\int_{0}^{t_{\wedge}\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s)} \right|_{L^{2}}^{2}ds+\mathcal{K}_{3}\left|\nabla\Phi\right|_{L^{\infty}}^{2} \int_{0}^{t_{\wedge}\tau_{N}^{m}}|\mathbf{u}_{m}(s)|_{L^{2}}^{2}\,ds\\ &\qquad+\frac{1}{2}t+\frac{1}{2}\left|\nabla\Phi\right|_{L^{ \infty}}^{2}\mathcal{K}^{2}\int_{0}^{t_{\wedge}\tau_{N}^{m}}\left|\mathbf{u}_ {m}(s)\right|_{L^{2}}^{2}ds\\ &\qquad+\int_{0}^{t_{\wedge}\tau_{N}^{m}}|g(\mathbf{u}_{m}(s),c_ {m}(s))|_{\mathcal{L}^{2}(\mathcal{U};H)}^{2}\,ds+2\int_{0}^{t_{\wedge}\tau_{N }^{m}}(g(\mathbf{u}_{m}(s),c_{m}(s)),\mathbf{u}_{m}(s))dWs,\end{split}\] with \(\mathcal{K}_{4}=\frac{8\mathcal{K}_{f}\mathcal{K}_{GN}|c_{0}|_{L^{\infty}}^{2}} {3\xi}\). Multiplying this inequality by \(\frac{\mathcal{K}_{4}}{\eta}\), and adding the result with inequality (4.32) after using the inequality (4.18), we see that there exists positive constants \(\mathcal{K}_{5}\) and \(\mathcal{K}_{6}\) such that for all \(t\in[0,T]\), \(\mathbb{P}\)-a.s. \[\begin{split}&\mathcal{E}(n_{m},c_{m},\mathbf{u}_{m})(t\wedge \tau_{N}^{m})+\delta\int_{0}^{t_{\wedge}\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}( s)}\right|_{L^{2}}^{2}ds\\ &\qquad+\int_{0}^{t_{\wedge}\tau_{N}^{m}}\left[\frac{3\xi \mathcal{K}_{f}}{2}\left|\Delta c_{m}(s)\right|_{L^{2}}^{2}+\mathcal{K}_{4} \left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}+\left|\sqrt{n_{m}(s)}\nabla c _{m}(s)\right|_{L^{2}}^{2}\right]ds\\ &\leq\mathcal{E}(n_{0},c_{0},\mathbf{u}_{0})+\mathcal{K}_{5}T+ \mathcal{K}_{6}\int_{0}^{t_{\wedge}\tau_{N}^{m}}\left|\mathbf{u}_{m}(s)\right| _{L^{2}}^{2}ds+\gamma^{2}\mathcal{K}_{f}\int_{0}^{t_{\wedge}\tau_{N}^{m}}| \nabla\phi(c_{m}(s))|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}\,ds\\ &\qquad+\frac{2\mathcal{K}_{4}}{\eta}\int_{0}^{t_{\wedge}\tau_{N}^ {m}}(g(\mathbf{u}_{m}(s),c_{m}(s)),\mathbf{u}_{m}(s))dW_{s}\\ &\qquad+\frac{\mathcal{K}_{4}}{\eta}\int_{0}^{t_{\wedge}\tau_{N}^ {m}}|g(\mathbf{u}_{m}(s),c_{m}(s))|_{\mathcal{L}^{2}(\mathcal{U},H)}^{2}\,ds+ 2\gamma\mathcal{K}_{f}\int_{0}^{t_{\wedge}\tau_{N}^{m}}(\nabla\phi(c_{m}(s)), \nabla c_{m}(s))d\beta_{s}.\end{split} \tag{4.35}\] Now, since \(\gamma\) satisfies the relation (3.3), taking into account the inequality (4.31), we note that \[\begin{split}\gamma^{2}\mathcal{K}_{f}\left|\nabla\phi(c_{m}) \right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}&\leq 2\gamma^{2} \mathcal{K}_{f}\sum_{k=1}^{2}\int_{\mathcal{O}}\left|\nabla\sigma_{k}(x) \nabla c(x)\right|^{2}dx+2\gamma^{2}\mathcal{K}_{f}\sum_{k=1}^{2}\int_{ \mathcal{O}}\left|D^{2}c(x)\sigma_{k}(x)\right|^{2}dx\\ &\leq 2\gamma^{2}\mathcal{K}_{f}\left|\nabla c\right|_{L^{2}}^{2} \sum_{k=1}^{2}\left|\sigma_{k}\right|_{W^{1,\infty}}^{2}+\left|\Delta c\right|_{L ^{2}}^{2}\frac{8\gamma^{2}\mathcal{K}_{f}}{3}\sum_{k=1}^{2}\left|\sigma_{k} \right|_{L^{\infty}}^{2}\\ &+\frac{8\gamma^{2}\mathcal{K}_{f}\mathcal{K}_{2}}{3}\left|c_{0} \right|_{L^{\infty}}\sum_{k=1}^{2}\left|\sigma_{k}\right|_{L^{\infty}}^{2}\\ &\leq\mathcal{K}\left|\nabla c\right|_{L^{2}}^{2}+\frac{\xi \mathcal{K}_{f}}{2}\left|\Delta c\right|_{L^{2}}^{2}+\mathcal{K}.\end{split} \tag{4.36}\] By the inequalities (2.12) and (4.19), we also note that \[|g(\mathbf{u}_{m},c_{m})|^{2}_{\mathcal{L}^{2}(\mathcal{U},H)} \leqslant 2L_{g}^{2}\left|(\mathbf{u}_{m},c_{m})\right|^{2}_{ \mathcal{H}}+2L_{g}^{2}\] \[\leqslant\mathcal{KE}(n_{m},c_{m},\mathbf{u}_{m})+\mathcal{K} \left|c_{0}\right|^{2}_{L^{\infty}}+2L_{g}^{2}. \tag{4.37}\] From the estimates (4.35) until (4.37), we derive that \[\begin{split}&\mathbb{E}\sup_{0\leqslant s\leqslant T}\mathcal{E}(n _{m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\delta\mathbb{E}\int_{0}^{T \wedge\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s)}\right|^{2}_{L^{2}}ds\\ &\qquad+\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left[\xi\mathcal{ K}_{f}\left|\Delta c_{m}(s)\right|^{2}_{L^{2}}+\mathcal{K}_{4}\left|\nabla \mathbf{u}_{m}(s)\right|^{2}_{L^{2}}+\left|\sqrt{n_{m}(s)}\nabla c_{m}(s) \right|^{2}_{L^{2}}\right]ds\\ &\leqslant\mathcal{E}(n_{0},c_{0},\mathbf{u}_{0})+\mathcal{K}T+ \mathcal{KE}\int_{0}^{T\wedge\tau_{N}^{m}}\mathcal{E}(n_{m}(s),c_{m}(s), \mathbf{u}_{m}(s))ds+2L_{g}^{2}T\\ &\qquad+2\gamma\mathcal{K}_{f}\mathbb{E}\sup_{0\leqslant s \leqslant T}\left|\int_{0}^{s\wedge\tau_{N}^{m}}(\nabla\phi(c_{m}(s)),\nabla c _{m}(s))d\beta_{s}\right|\\ &\qquad+\frac{2\mathcal{K}_{4}}{\eta}\mathbb{E}\sup_{0\leqslant s \leqslant T}\left|\sum_{k=1}^{\infty}\int_{0}^{s\wedge\tau_{N}^{m}}(g(\mathbf{ u}_{m}(s),c_{m}(s))e_{k},\mathbf{u}_{m}(s))dW_{s}^{k}\right|.\end{split} \tag{4.38}\] Now, by making use of the Burkholder-Davis-Gundy, Cauchy-Schwarz, Young inequalities and the fact that \(\gamma\) satisfies the relation (3.3), we infer that \[2\gamma\mathcal{K}_{f}\mathbb{E}\sup_{0\leqslant s\leqslant T} \left|\int_{0}^{s\wedge\tau_{N}^{m}}(\nabla\phi(c_{m}(s)),\nabla c_{m}(s))d \beta_{s}\right|\] \[\leqslant\mathcal{KE}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left|( \nabla\phi(c_{m}(s)),\nabla c_{m}(s))\right|^{2}ds\right)^{1/2}\] \[\leqslant\mathcal{KE}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left| \nabla\phi(c_{m}(s))\right|^{2}_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}\left| \nabla c_{m}(s)\right|^{2}_{L^{2}}ds\right)^{1/2}\] \[\leqslant\frac{\mathcal{K}_{f}}{4}\mathbb{E}\sup_{0\leqslant s \leqslant T}\left|\nabla c_{m}(s\wedge\tau_{N}^{m})\right|^{2}_{L^{2}}+ \mathcal{KE}\int_{0}^{T\wedge\tau_{N}^{m}}\left|\nabla\phi(c_{m}(s))\right|^{2 }_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}ds\] \[\leqslant\frac{1}{4}\mathbb{E}\sup_{0\leqslant s\leqslant T} \mathcal{E}(n_{m}(s),c_{m}(s),\mathbf{u}_{m}(s))(s\wedge\tau_{N}^{m})\] \[\qquad+\frac{\xi\mathcal{K}_{f}}{2}\mathbb{E}\int_{0}^{T\wedge \tau_{N}^{m}}\left|\Delta c_{m}(s)\right|^{2}_{L^{2}}ds+\mathcal{KE}\int_{0}^{T \wedge\tau_{N}^{m}}\left|\nabla c_{m}(s)\right|^{2}_{L^{2}}ds+\mathcal{K}T.\] Similarly, \[\frac{2\mathcal{K}_{4}}{\eta}\mathbb{E}\sup_{0\leqslant s \leqslant T}\left|\sum_{k=1}^{\infty}\int_{0}^{s\wedge\tau_{N}^{m}}(g( \mathbf{u}_{m}(s),c_{m}(s))e_{k},\mathbf{u}_{m}(s))dW_{s}^{k}\right|\] \[\leqslant\frac{1}{4}\mathbb{E}\sup_{0\leqslant s\leqslant T} \mathcal{E}(n_{m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\mathcal{KE} \int_{0}^{T\wedge\tau_{N}^{m}}\left|(\mathbf{u}_{m}(s),c_{m}(s))\right|^{2}_{ \mathcal{H}}ds+\mathcal{K}TL_{g}^{2}.\] It follows from the estimates (4.38) that \[\begin{split}&\mathbb{E}\sup_{0\leqslant s\leqslant T}\mathcal{E}(n_{ m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})\\ &+\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left[\left|\nabla \sqrt{n_{m}(s)}\right|_{L^{2}}^{2}+\mathcal{K}_{f}\left|\Delta c_{m}(s) \right|_{L^{2}}^{2}+\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}+\left| \sqrt{n_{m}(s)}\nabla c_{m}(s)\right|_{L^{2}}^{2}\right]ds\\ &\leqslant\mathcal{KE}(n_{0},c_{0},\mathbf{u}_{0})+\mathcal{K}T+ \mathcal{KE}\int_{0}^{T\wedge\tau_{N}^{m}}\mathcal{E}(n_{m},c_{m},\mathbf{u}_{ m})(s)ds+\mathcal{K},\end{split} \tag{4.39}\] where \(\mathcal{K}\) is a constant depending on the initial data and \(T\) but independent of \(m\) and \(N\). Now, the Gronwall lemma yields \[\begin{split}&\mathbb{E}\sup_{0\leqslant s\leqslant T}\mathcal{E}(n _{m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})\\ &\qquad+\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left[\left| \nabla\sqrt{n_{m}(s)}\right|_{L^{2}}^{2}+\left|\Delta c_{m}(s)\right|_{L^{2}}^ {2}+\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}+\left|\sqrt{n_{m}(s)} \nabla c_{m}(s)\right|_{L^{2}}^{2}\right]ds\leqslant\mathcal{K},\end{split}\] from which we deduce the estimates (4.21) and hence completing the proof of Lemma 4.3. **Lemma 4.4**.: _Under the same assumptions as in Lemma 4.3, for all \(p\geqslant 1\), there exists a positive constant \(\mathcal{K}\) such that we have for all \(m\in\mathbb{N}\) and \(N\in\mathbb{N}\),_ (4.40) \[\begin{split}&\sup_{0\leqslant s\leqslant T}|c_{m}(s\wedge\tau_{N}^ {m})|_{L^{2}}^{2p}+\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left|\nabla c_{m}(s) \right|_{L^{2}}^{2}ds\right)^{p}\leqslant|\mathcal{O}|^{p}\left|c_{0}\right|_ {L^{\infty}}^{2p},\qquad\mathbb{P}\text{-a.s.},\\ &\mathbb{E}\sup_{0\leqslant s\leqslant T}\mathcal{E}^{p}(n_{m},c_ {m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\mathbb{E}\left(\int_{0}^{T\wedge \tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s)}\right|_{L^{2}}^{2}ds\right)^{p} \leqslant\mathcal{K},\\ &\text{and}\ \ \mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}} \left|\Delta c_{m}(s)\right|_{L^{2}}^{2}ds\right)^{p}+\mathbb{E}\left(\int_{0} ^{T\wedge\tau_{N}^{m}}\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}ds \right)^{p}\leqslant\mathcal{K}.\end{split}\] (4.41) Proof.: The inequality (4.40) follows directly from the estimates (4.20) of Lemma 4.3. Next, we are going to derive estimate (4.41). We start with the inequality (4.38) and invoke the Jensen inequality to derive that for all \(p\geqslant 2\), \[\begin{split}&\mathbb{E}\sup_{0\leqslant s\leqslant T}\mathcal{E}^{p}(n _{m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\mathbb{E}\left(\int_{0}^{T \wedge\tau_{N}^{m}}\left|\nabla\sqrt{n_{m}(s)}\right|_{L^{2}}^{2}ds\right)^{ p}\\ &\qquad+\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\xi \mathcal{K}_{f}\left|\Delta c_{m}(s)\right|_{L^{2}}^{2}ds\right)^{p}+\mathbb{ E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\mathcal{K}_{4}\left|\nabla\mathbf{u}_{m}(s) \right|_{L^{2}}^{2}ds\right)^{p}\\ &\leqslant\mathcal{E}^{p}(n_{0},c_{0},\mathbf{u}_{0})+\mathcal{K} T^{p}+\mathcal{KE}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\mathcal{E}(n_{m},c_{m}, \mathbf{u}_{m})(s)ds\right)^{p}\\ &\qquad+\mathcal{K}^{p}+2^{p}\gamma^{p}\mathcal{K}_{f}^{p}\mathbb{ E}\sup_{0\leqslant s\leqslant T}\left|\int_{0}^{s\wedge\tau_{N}^{m}}(\nabla \phi(c_{m}(s)),\nabla c_{m}(s))d\beta_{s}\right|^{p}\\ &\qquad+\mathcal{KE}\sup_{0\leqslant s\leqslant T}\left|\sum_{k=1} ^{\infty}\int_{0}^{s\wedge\tau_{N}^{m}}(g(\mathbf{u}_{m}(s),c_{m}(s))e_{k}, \mathbf{u}_{m}(s))dW_{s}^{k}\right|^{p}.\end{split} \tag{4.42}\] Invoking the Holder inequality, we see that \[\mathcal{KE}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\mathcal{E}(n_{m},c_{m}, \mathbf{u}_{m})(s)ds\right)^{p}\leqslant\mathcal{K}T^{\frac{p}{p-1}}\mathbb{E} \int_{0}^{T\wedge\tau_{N}^{m}}\mathcal{E}^{p}(n_{m},c_{m},\mathbf{u}_{m})(s)ds.\] Thanks to the Burkholder-Davis-Gundy inequality, we see that \[\mathcal{K}\mathbb{E}\sup_{0\leqslant s\leqslant T}\left|\sum_{k=1} ^{\infty}\int_{0}^{s\wedge\tau_{N}^{m}}(g(\mathbf{u}_{m}(s),c_{m}(s))e_{k}, \mathbf{u}_{m}(s))dW_{s}^{k}\right|^{p}\] \[\leqslant\mathcal{K}\mathbb{E}\sum_{k=1}^{\infty}\left(\int_{0}^{ T\wedge\tau_{N}^{m}}\left|(g(\mathbf{u}_{m}(s),c_{m}(s))e_{k},\mathbf{u}_{m}(s)) \right|^{2}ds\right)^{p/2}\] \[\leqslant\mathcal{K}\mathbb{E}\sup_{0\leqslant s\leqslant T}|u_{m} (s\wedge\tau_{N}^{m})|_{L^{2}}^{p}\left(\int_{0}^{T\wedge\tau_{N}^{m}}|g( \mathbf{u}_{m}(s),c_{m}(s))|_{\mathcal{L}^{2}(\mathcal{U};H)}^{2}ds\right)^{p/2}\] \[\leqslant\frac{1}{4}\mathbb{E}\sup_{0\leqslant s\leqslant T} \mathcal{E}^{p}(n_{m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\mathcal{K} \mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}|g(\mathbf{u}_{m}(s),c_{m}(s))|_ {\mathcal{L}^{2}(\mathcal{U};H)}^{2}ds\right)^{p}\] \[\leqslant\frac{1}{4}\mathbb{E}\sup_{0\leqslant s\leqslant T} \mathcal{E}^{p}(n_{m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\mathcal{K} \mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}|(\mathbf{u}_{m}(s),c_{m}(s))|_{ \mathcal{H}}^{2p}\,ds+\mathcal{K}T^{\frac{p}{p-1}}L_{g}^{2p}.\] Taking into account the fact that \(\gamma\) is sufficiently small such that the relation (3.3) is satisfied, we also arrive at \[2^{p}\gamma^{p}\mathcal{K}_{f}^{p}\mathcal{K}\mathbb{E}\sup_{0 \leqslant s\leqslant T}\left|\int_{0}^{s\wedge\tau_{N}^{m}}(\nabla\phi(c_{m}(s )),\nabla c_{m}(s))d\beta_{s}\right|^{p}\] \[\leqslant 2^{p}\gamma^{p}\mathcal{K}_{f}^{p}\mathbb{E}\left(\int_{0}^ {T\wedge\tau_{N}^{m}}\left|\nabla\phi(c_{m}(s))\right|_{\mathcal{L}^{2}( \mathbb{R}^{2};L^{2})}^{2}|\nabla c_{m}(s)|_{L^{2}}^{2}\,ds\right)^{p/2}\] \[\leqslant\frac{1}{4}\mathbb{E}\sup_{0\leqslant s\leqslant T}| \nabla c_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2p}+2^{2p}\gamma^{2p}\mathcal{K}_ {f}^{2p}\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left|\nabla\phi(c_{m}(s ))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds\right)^{p}\] \[\leqslant\frac{1}{4}\mathbb{E}\sup_{0\leqslant s\leqslant T} \mathcal{E}^{p}(n_{m},c_{m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})\] \[\quad+\frac{1}{2}\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}} \xi\mathcal{K}_{f}\left|\Delta c_{m}(s)\right|_{L^{2}}^{2}ds\right)^{p}+ \mathcal{K}T^{\frac{p}{p-1}}\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left| \nabla c_{m}(s)\right|_{L^{2}}^{2p}ds+\mathcal{K}T^{p}.\] It follows from the estimates (4.42) that \[\mathbb{E}\sup_{0\leqslant s\leqslant T}\mathcal{E}^{p}(n_{m},c_{ m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}} \left|\nabla\sqrt{n_{m}(s)}\right|_{L^{2}}^{2}ds\right)^{p}\] \[\quad\quad+\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left| \Delta c_{m}(s)\right|_{L^{2}}^{2}ds\right)^{p}+\mathbb{E}\left(\int_{0}^{T \wedge\tau_{N}^{m}}\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}ds\right)^{p}\] \[\leqslant\mathcal{K}\mathcal{E}^{p}(n_{0},c_{0},\mathbf{u}_{0})+ \mathcal{K}T^{p}+\mathcal{K}\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\mathcal{E} ^{p}(n_{m},c_{m},\mathbf{u}_{m})(s)ds+\mathcal{K}.\] Now, the Gronwall lemma yields \[\mathbb{E}\sup_{0\leqslant s\leqslant T}\mathcal{E}^{p}(n_{m},c_ {m},\mathbf{u}_{m})(s\wedge\tau_{N}^{m})+\mathbb{E}\left(\int_{0}^{T\wedge\tau_{ N}^{m}}\left|\nabla\sqrt{n_{m}(s)}\right|_{L^{2}}^{2}ds\right)^{p}\] \[\quad\quad+\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left| \Delta c_{m}(s)\right|_{L^{2}}^{2}ds\right)^{p}+\mathbb{E}\left(\int_{0}^{T \wedge\tau_{N}^{m}}\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}ds\right)^{ p}\leqslant\mathcal{K},\] and the estimate (4.41) follows directly from this last inequality. This completes the proof of Lemma 4.4. In order to control the process \(t\mapsto n_{m}(t\wedge\tau_{N}^{m})\), we prove the following lemma. **Lemma 4.5**.: _Under the same assumptions as in Lemma 4.3, there exists a positive constant \(\eta_{0}>1\) such that for all \(m\in\mathbb{N}\), \(N\in\mathbb{N}\) and \(\mathbb{P}\)-a.s.,_ \[\sup_{0\leqslant s\leqslant T}|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2}+\int_{0 }^{T\wedge\tau_{N}^{m}}|n_{m}(s)|_{H^{1}}^{2}\,ds\leqslant\eta_{0}\exp\left( \mathcal{K}\!\int_{0}^{T\wedge\tau_{N}^{m}}|\nabla c_{m}(s)|_{L^{4}}^{4}\,ds \right). \tag{4.43}\] Proof.: Let \(t\in[0,T]\) be arbitrary but fixed. Multiplying the last equation of (4.2) by \(n_{m}(s\wedge\tau_{N}^{m})\) for \(0\leqslant s\leqslant t\), and using the fact that \(\nabla\cdot\mathbf{u}_{m}=0\) and the inequality (3.7) as well as the Holder inequality and the Young inequality, we obtain \[\frac{1}{2}\frac{d}{dt}\,|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2}+ \delta\,|\nabla n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2}\] \[=\xi\int_{\mathcal{O}}n_{m}(s\wedge\tau_{N}^{m},x)\nabla c_{m}(s \wedge\tau_{N}^{m},x)\cdot\nabla n_{m}(s\wedge\tau_{N}^{m},x)dx\] \[\leqslant\xi\,|n_{m}(s\wedge\tau_{N}^{m})|_{L^{4}}\,|\nabla c_{m} (s\wedge\tau_{N}^{m})|_{L^{4}}\,|\nabla n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}\] \[\leqslant\mathcal{K}(|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{1/2} \,|\nabla n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{1/2}+|n_{m}(s\wedge\tau_{N}^{m} )|_{L^{2}})\,|\nabla c_{m}(s\wedge\tau_{N}^{m})|_{L^{4}}\,|\nabla n_{m}(s \wedge\tau_{N}^{m})|_{L^{2}}\] \[\leqslant\mathcal{K}\,|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{1/2} \,|\nabla c_{m}(s\wedge\tau_{N}^{m})|_{L^{4}}\,|\nabla n_{m}(s\wedge\tau_{N}^{ m})|_{L^{2}}^{3/2}\] \[\quad\quad+\mathcal{K}\,|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}\,| \nabla c_{m}(s\wedge\tau_{N}^{m})|_{L^{4}}\,|\nabla n_{m}(s\wedge\tau_{N}^{m} )|_{L^{2}}\] \[\leqslant\frac{\delta}{2}\,|\nabla n_{m}(s\wedge\tau_{N}^{m})|_{ L^{2}}^{2}+\mathcal{K}\,|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2}\,(|\nabla c _{m}(s\wedge\tau_{N}^{m})|_{L^{4}}^{4}+|\nabla c_{m}(s\wedge\tau_{N}^{m})|_{ L^{4}}^{2})\] \[\leqslant\frac{\delta}{2}\,|\nabla n_{m}(s\wedge\tau_{N}^{m})|_{ L^{2}}^{2}+\mathcal{K}\,|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2}\left(|\nabla c _{m}(s\wedge\tau_{N}^{m})|_{L^{4}}^{4}+1\right).\] This implies that for all \(t\in[0,T]\), \[\sup_{0\leqslant s\leqslant t}|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2}}^{2}+ \delta\int_{0}^{t\wedge\tau_{N}^{m}}|\nabla n_{m}(s)|_{L^{2}}^{2}\,ds\leqslant |n_{0}^{m}|_{L^{2}}^{2}+\mathcal{K}\int_{0}^{t\wedge\tau_{N}^{m}}|n_{m}(s)|_{L^ {2}}^{2}\left(|\nabla c_{m}(s)|_{L^{4}}^{4}+1\right)ds.\] Since \(n_{m}^{0}\to n_{0}\) in \(L^{2}(\mathcal{O})\), \(|n_{0}^{m}|_{L^{2}}^{2}\) is uniformly bounded. Thus, applying the Gronwall lemma, we obtain that \[\sup_{0\leqslant s\leqslant t}|n_{m}(s\wedge\tau_{N}^{m})|_{L^{2} }^{2}+\int_{0}^{t\wedge\tau_{N}^{m}}|n_{m}(s)|_{H^{1}}^{2}\,ds \leqslant\mathcal{K}_{\delta}\exp\left(\mathcal{K}\!\int_{0}^{t \wedge\tau_{N}^{m}}\left(|\nabla c_{m}(s)|_{L^{4}}^{4}+1\right)ds\right)\] \[\leqslant(\mathcal{K}_{\delta}+1)e^{\mathcal{K}T}\exp\left( \mathcal{K}\!\int_{0}^{t\wedge\tau_{N}^{m}}|\nabla c_{m}(s)|_{L^{4}}^{4}\,ds \right),\] and complete the proof of Lemma 4.5. **Corollary 4.6**.: _Under the same assumptions as in Lemma 4.3, for any \(p\geqslant 1\), there exists a positive constant \(\mathcal{K}\) such that for all \(m\in\mathbb{N}\) and \(N\in\mathbb{N}\),_ \[\mathbb{E}\sup_{0\leqslant s\leqslant T}|\mathbf{u}_{m}(s\wedge \tau_{N}^{m})|_{L^{2}}^{2p}+\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}| \nabla\mathbf{u}_{m}(s)|_{L^{2}}^{2}\,ds\right)^{p}\leqslant\mathcal{K}, \tag{4.45}\] \[\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}|n_{m}(s)|_{L^{2}}^{ 2}\,ds\right)^{p}\leqslant\mathcal{K},\] (4.46) \[\mathbb{E}\sup_{0\leqslant s\leqslant T}|c_{m}(s\wedge\tau_{N}^{m})| _{H^{1}}^{2p}+\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}|c_{m}(s)|_{H^{2}}^{ 2}\,ds\right)^{p}\leqslant\mathcal{K},\] (4.47) \[\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}|\nabla c_{m}(s)|_{L^{2}}^{ 4}\,ds\leqslant\mathcal{K}. \tag{4.44}\] Proof.: The estimate (4.44) is a consequence of the estimates (4.21) and (4.41). From the inequalities (4.34), (4.21) and (4.41), we infer that \[\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left|n_{m}(s)\right|_{L^{2}}^{2} ds\right)^{p}\leq\mathbb{E}\left(\int_{0}^{T\wedge\tau_{N}^{m}}\left(\mathcal{K}_{ GN}\mathcal{K}^{1/2}\left|\nabla\sqrt{n_{m}(s)}\right|_{L^{2}}^{2}+ \mathcal{K}\right)ds\right)^{p}\leq\mathcal{K},\] which proves the second estimate of inequality (4.45). According to [35, Proposition 7.2, P. 404], we have \[\left|c_{m}\right|_{H^{2}}^{2}\leq\mathcal{K}(\left|\Delta c_{m}\right|_{L^{2} }^{2}+\left|c_{m}\right|_{H^{1}}^{2}),\] from which along with (4.21) and (4.41) we deduce (4.46). By applying the inequality (3.7), we obtain that \[\left|\nabla c_{m}\right|_{L^{4}}^{4}\leq\mathcal{K}(\left|c_{m}\right|_{H^{2 }}^{2}\left|\nabla c_{m}\right|_{L^{2}}^{2}+\left|\nabla c_{m}\right|_{L^{2}} ^{4}).\] Therefore, \[\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left|\nabla c_{m}(s) \right|_{L^{4}}^{4}ds \leq\mathcal{K}\mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left|c_{m} (s)\right|_{H^{2}}^{2}\left|\nabla c_{m}(s)\right|_{L^{2}}^{2}ds+\mathcal{K} \mathbb{E}\int_{0}^{T\wedge\tau_{N}^{m}}\left|\nabla c_{m}(s)\right|_{L^{2}}^ {4}ds\] \[\leq\mathcal{K}\mathbb{E}\sup_{0\leq s\leq T}\left|c_{m}(s\wedge \tau_{N}^{m})\right|_{H^{1}}^{2}\int_{0}^{T}\left|c_{m}(s)\right|_{H^{2}}^{2} ds+\mathcal{K}T\mathbb{E}\sup_{0\leq s\leq T}\left|c_{m}(s\wedge\tau_{N}^{m}) \right|_{H^{1}}^{4}\] \[\leq\mathcal{K}\mathbb{E}\sup_{0\leq s\leq T}\left|c_{m}(s\wedge \tau_{N}^{m})\right|_{H^{1}}^{4}+\mathcal{K}\mathbb{E}\left(\int_{0}^{T\wedge \tau_{N}^{m}}\left|c_{m}(s)\right|_{H^{2}}^{2}ds\right)^{2},\] from which along with (4.46) we deduce (4.47). This completes the proof of Corollary 4.6. In the following lemma, we state and prove a result concerning the stopping time \(\tau_{N}^{m}\). More precisely, we prove that \(\sup\limits_{N\in\mathbb{N}}\tau_{m}^{N}\geq 2T\) with probability \(1\) such that the inequality (4.7) holds. **Lemma 4.7**.: _Let \(\tau_{N}^{m}\), \(m,N\in\mathbb{N}\) be the stopping times defined in (4.6). Then, under the same assumptions as in Lemma 4.3, it holds that_ \[\mathbb{P}\left\{\omega\in\Omega:\sup\limits_{N\in\mathbb{N}}\tau_{m}^{N}( \omega)\geq 2T\right\}=1. \tag{4.48}\] _Consequently, the solutions \((\mathbf{u}_{m},c_{m},n_{m})\) of system (4.2) exist almost surely for every \(t\in[0,T]\)._ Proof.: We notice that the inequalities of Corollary 4.6 hold for every \(T>0\). Hence, for a fixed \(T>0\), we set \(\tilde{T}=2T\) and note that for all \(J\in\mathbb{N}\), \[\left\{\omega\in\Omega:\sup\limits_{N\in\mathbb{N}}\tau_{m}^{N}(\omega)<\tilde {T}\right\}\subset\left\{\omega\in\Omega:\tau_{m}^{J}(\omega)<\tilde{T}\right\},\] which implies that \[\mathbb{P}\left\{\omega\in\Omega:\sup\limits_{N\in\mathbb{N}}\tau_{m}^{N}( \omega)<2T\right\}\leq\lim\limits_{N\longrightarrow\infty}\mathbb{P}\left\{ \omega\in\Omega:\tau_{m}^{N}(\omega)<\tilde{T}\right\}, \tag{4.49}\] and therefore, it is enough to show that the second term of the right hand side of this last equality converges to zero as \(N\rightarrow\infty\). To this end, let \[A_{N}=\left\{\omega\in\Omega:\tau_{m}^{N}<\tilde{T}\right\}\] and \[B_{N}=\left\{\omega\in\Omega:\left|n_{m}(\tilde{T}\wedge\tau_{m}^{N})\right|_{L^{ 2}}^{2}+\left|\mathbf{u}_{m}(\tilde{T}\wedge\tau_{m}^{N})\right|_{L^{2}}^{2}+ \left|c_{m}(\tilde{T}\wedge\tau_{m}^{N})\right|_{H^{1}}^{2}\geq N^{2}\right\}.\] Then, we have \(A_{N}\subset B_{N}\) for \(N>\tilde{T}\). Indeed, let \(\omega\in A_{N}\), then \(\tilde{T}\wedge\tau_{m}^{N}(\omega)=\tau_{m}^{N}(\omega)\). Thus, by the definition of the stopping time \(\tau_{m}^{N}\), we see that for \(N>\tilde{T}\), \[\left|n_{m}(\tilde{T}\wedge\tau_{m}^{N})\right|_{L^{2}}^{2}+\left| \mathbf{u}_{m}(\tilde{T}\wedge\tau_{m}^{N})\right|_{L^{2}}^{2}+\left|c_{m}( \tilde{T}\wedge\tau_{m}^{N})\right|_{H^{1}}^{2} =\left|n_{m}(\tau_{m}^{N})\right|_{L^{2}}^{2}+\left|\mathbf{u}_{ m}(\tau_{m}^{N})\right|_{L^{2}}^{2}+\left|c_{m}(\tau_{m}^{N})\right|_{H^{1}}^{2}\] \[\geq N^{2}.\] We then conclude that \(\omega\in B_{N}\). Now, for \(N>\tilde{T}\), using the inclusion \(A_{N}\subset B_{N}\) we derive that \[\mathbb{P}\left\{\omega\in\Omega:\left|n_{m}(\tilde{T}\wedge\tau_ {m}^{N})\right|_{L^{2}}^{2}\geq\frac{N^{2}}{3}\right\}+\mathbb{P}\left\{ \omega\in\Omega:\left|\mathbf{u}_{m}(\tilde{T}\wedge\tau_{m}^{N})\right|_{L^{2 }}^{2}\geq\frac{N^{2}}{3}\right\}\] \[\quad+\mathbb{P}\left\{\omega\in\Omega:\left|c_{m}(\tilde{T} \wedge\tau_{m}^{N})\right|_{H^{1}}^{2}\geq\frac{N^{2}}{3}\right\}. \tag{4.50}\] According to the estimates (4.44) and (4.46) of Corollary 4.6 as well as the Markov inequality, we derive that for \(N>\tilde{T}\) \[\mathbb{P}\left\{\omega\in\Omega:\left|c_{m}(\tilde{T}\wedge\tau_ {m}^{N})\right|_{H^{1}}^{2}\geq\frac{N^{2}}{3}\right\} \leq\mathbb{P}\left\{\omega\in\Omega:\sup_{0\leq s\leq\tilde{T}} \left|c_{m}(s\wedge\tau_{N}^{m})\right|_{H^{1}}^{2}\geq\frac{N^{2}}{3}\right\}\] \[\leq\frac{\mathcal{K}}{N^{2}},\] and \[\mathbb{P}\left\{\omega\in\Omega:\left|\mathbf{u}_{m}(\tilde{T} \wedge\tau_{m}^{N})\right|_{L^{2}}^{2}\geq\frac{N^{2}}{3}\right\} \leq\mathbb{P}\left\{\omega\in\Omega:\sup_{0\leq s\leq\tilde{T}} \left|\mathbf{u}_{m}(s\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}\geq\frac{N^{2}}{3 }\right\}\] \[\leq\frac{3}{N^{2}}\mathbb{E}\sup_{0\leq s\leq\tilde{T}}\left| \mathbf{u}_{m}(s\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}\] \[\leq\frac{\mathcal{K}}{N^{2}}.\] Also for \(N>\max(\sqrt{3\eta_{0}},\tilde{T})\) (where \(\eta_{0}\) is a constant obtained in Lemma 4.5), we use the inequality (4.43) of Lemma 4.5 to infer that \[\mathbb{P}\left\{\omega\in\Omega:\left|n_{m}(\tilde{T}\wedge\tau_ {m}^{N})\right|_{L^{2}}^{2}\geq\frac{N^{2}}{3}\right\} \leq\mathbb{P}\left\{\omega\in\Omega:\sup_{0\leq s\leq\tilde{T}} \left|n_{m}(s\wedge\tau_{N}^{m})\right|_{L^{2}}^{2}\geq\frac{N^{2}}{3}\right\}\] \[\leq\mathbb{P}\left\{\omega\in\Omega:\eta_{0}\exp\left(\mathcal{K }\int_{0}^{\tilde{T}\wedge\tau_{N}^{m}}\left|\nabla c_{m}(s)\right|_{L^{4}}^{ 4}ds\right)\geq\frac{N^{2}}{3}\right\}\] \[\leq\mathbb{P}\left\{\omega\in\Omega:\int_{0}^{\tilde{T}\wedge\tau _{N}^{m}}\left|\nabla c_{m}(s)\right|_{L^{4}}^{4}ds\geq\frac{\ln\left(\frac{N^{ 2}}{3\eta_{0}}\right)}{\mathcal{K}}\right\}.\] Invoking the Markov inequality and using the estimate (4.47) of Corollary 4.6, we see that \[\mathbb{P}\left\{\omega\in\Omega:\left|n_{m}(\tilde{T}\wedge\tau_{m} ^{N})\right|_{L^{2}}^{2}\geq\frac{N^{2}}{3}\right\} \leqslant\frac{\mathcal{K}}{\ln(\frac{N^{2}}{3\eta_{0}})}\mathbb{E} \int_{0}^{\tilde{T}\wedge\tau_{N}^{m}}\left|\nabla c_{m}(s)\right|_{L^{4}}^{4}ds\] \[\leqslant\frac{\mathcal{K}}{2\ln(N)-\ln(3\eta_{0})}.\] Plugging these inequalities into the inequality (4.50), we arrive at \[\mathbb{P}\left\{\omega\in\Omega:\tau_{m}^{N}<\tilde{T}\right\}\leqslant\frac{ \mathcal{K}}{N^{2}}+\frac{\mathcal{K}}{2\ln(N)-\ln(\eta_{0})-\ln(3)},\] for all for \(N>\max(\sqrt{3\eta_{0}},\tilde{T})\). Letting \(N\) to infinity in this last inequality we get \[\lim_{N\longrightarrow\infty}\mathbb{P}\left\{\omega\in\Omega:\tau_{m}^{N}< \tilde{T}\right\}=0,\] which along with (4.49) imply (4.48). By the equality (4.48) we infer the inequality (4.7) and therefore, the relation (4.5) hold and the lemma is then proved. Since \((T\wedge\tau_{m}^{N})_{N\in\mathbb{N}}\) is increasing, we have \(T\wedge\tau_{m}^{N}\to T\) a.s., as \(N\rightarrow\infty\). With this almost surely convergence in hand, we are going to give some consequences of Lemma 4.5 and Corollary 4.6. **Corollary 4.8**.: _Under the same assumptions as in Lemma 4.3, for any \(p\geqslant 1\), there exists a positive constant \(\mathcal{K}\) such that for all \(m\in\mathbb{N}\),_ \[\sup_{0\leqslant s\leqslant T}\left|n_{m}(s)\right|_{L^{2}}^{2}+ \int_{0}^{T}\left|n_{m}(s)\right|_{H^{1}}^{2}ds\leqslant\eta_{0}\exp\left( \mathcal{K}\int_{0}^{T}\left|\nabla c_{m}(s)\right|_{L^{4}}^{4}ds\right),\ \ \mathbb{P}\text{-a.s.} \tag{4.52}\] \[\mathbb{E}\sup_{0\leqslant s\leqslant T}\left|\mathbf{u}_{m}(s) \right|_{L^{2}}^{2p}+\mathbb{E}\left(\int_{0}^{T}\left|\nabla\mathbf{u}_{m}(s) \right|_{L^{2}}^{2}ds\right)^{p}\leqslant\mathcal{K},\] (4.53) \[\mathbb{E}\left(\int_{0}^{T}\left|n_{m}(s)\right|_{L^{2}}^{2}ds \right)^{p}\leqslant\mathcal{K},\] (4.54) \[\mathbb{E}\sup_{0\leqslant s\leqslant T}\left|c_{m}(s)\right|_{H ^{1}}^{2p}+\mathbb{E}\left(\int_{0}^{T}\left|c_{m}(s)\right|_{H^{2}}^{2}ds \right)^{p}\leqslant\mathcal{K},\] (4.55) \[\mathbb{E}\int_{0}^{T}\left|\nabla c_{m}(s)\right|_{L^{2}}^{4}ds \leqslant\mathcal{K}, \tag{4.51}\] _where \(\eta_{0}>1\) is a constant obtained in Lemma 4.5._ Proof.: Since \(T\wedge\tau_{m}^{N}\to T\) a.s., as \(N\rightarrow\infty\), by the path continuity of the process \(t\mapsto(\mathbf{u}_{m}(t),c_{m}(t),n_{m}(t))\), we can let \(N\rightarrow\infty\) in the inequality (4.43) of Lemma 4.5 and derive the inequality (4.51). In addition to the almost surely convergence of \(T\wedge\tau_{m}^{N}\) to \(T\) and the path continuity of the process \(t\mapsto(\mathbf{u}_{m}(t),c_{m}(t),n_{m}(t))\), we invoke the Fatou lemma and pass to the limit as \(N\rightarrow\infty\) in the inequalities (4.44), (4.45), (4.46) and (4.47) and derive the estimate (4.52), (4.53), (4.54) and (4.55). **Corollary 4.9**.: _Under the same assumptions as in Lemma 4.3, there exists a positive constant \(\mathcal{K}\) such that for all \(m\in\mathbb{N}\),_ \[\mathbb{E}\left|n_{m}\right|_{C^{1/2}([0,T];H^{-3})}^{2}\leqslant\mathcal{K}. \tag{4.56}\] Proof.: Let \(v\in H^{3}(\mathcal{O})\). We recall that \(\left|\nabla v\right|_{L^{\infty}}\leqslant\mathcal{K}\left|v\right|_{H^{3}}\). So, using an integration by part and the Holder inequality, we derive that \[\left|(A_{1}n_{m},v)\right|=\left|(n_{m},\Delta v)\right| \leqslant\left|n_{m}\right|_{L^{2}}\left|\Delta v\right|_{L^{2}} \leqslant\left|n_{m}\right|_{L^{2}}\left|v\right|_{H^{3}},\] \[\left|(\mathcal{P}_{m}^{1}B_{1}(\mathbf{u}_{m},n_{m}),v)\right| =\left|(B_{1}(\mathbf{u}_{m},n_{m}),\mathcal{P}_{m}^{1}v)\right|\] \[=\left|(n_{m}\mathbf{u}_{m},\nabla\mathcal{P}_{m}^{1}v)\right|\] \[\leqslant\mathcal{K}\left|n_{m}\right|_{L^{2}}\left|\mathbf{u}_{ m}\right|_{L^{2}}\left|\nabla\mathcal{P}_{m}^{1}v\right|_{L^{\infty}}\] \[\leqslant\mathcal{K}\left|n_{m}\right|_{L^{2}}\left|\mathbf{u}_{ m}\right|_{L^{2}}\left|v\right|_{H^{3}},\] and \[\left|(\mathcal{P}_{m}^{1}R_{2}(n_{m},c_{m}),v)\right| =\xi\left|(n_{m}\nabla c_{m},\nabla\mathcal{P}_{m}^{1}v)\right|\] \[\leqslant\mathcal{K}\left|n_{m}\right|_{L^{2}}\left|\nabla c_{m} \right|_{L^{2}}\left|\nabla\mathcal{P}_{m}^{1}v\right|_{L^{\infty}}\] \[\leqslant\mathcal{K}\left|n_{m}\right|_{L^{2}}\left|\nabla c_{m} \right|_{L^{2}}\left|v\right|_{H^{3}}.\] Due to the continuous Sobolev embeddings \(W^{1,2}(0,T;H^{-3}(\mathcal{O}))\hookrightarrow C^{1/2}(0,T;H^{-3}(\mathcal{ O}))\), and \(L^{2}(\mathcal{O})\hookrightarrow H^{-3}(\mathcal{O})\), we have \[\mathbb{E}\left|n_{m}\right|_{C^{1/2}(0,T;H^{-3})}^{2} \leqslant\mathbb{E}\left|n_{m}\right|_{W^{1,2}(0,T;H^{-3})}^{2}\] \[=\mathbb{E}\int_{0}^{T}\left|n_{m}(s)\right|_{H^{-3}}^{2}ds+ \mathbb{E}\int_{0}^{T}\left|\frac{d}{dt}n_{m}(s)\right|_{H^{-3}}^{2}ds\] \[\leqslant\mathcal{K}\mathbb{E}\int_{0}^{T}\left|n_{m}(s)\right|_ {L^{2}}^{2}ds+\mathbb{E}\int_{0}^{T}\left|\frac{d}{dt}n_{m}(s)\right|_{H^{-3}} ^{2}ds.\] Using the estimates (4.52), (4.53) and (4.54), we arrive at \[\mathbb{E}\left|n_{m}\right|_{C^{1/2}(0,T;H^{-3}))}^{2}\] \[\leqslant\mathcal{K}+\mathcal{K}\mathbb{E}\int_{0}^{T}\left[\left| n_{m}(s)\right|_{L^{2}}^{2}+\left|u_{m}(s)\right|_{L^{2}}^{2}\left|n_{m}(s) \right|_{L^{2}}^{2}+\left|n_{m}(s)\right|_{L^{2}}^{2}\left|\nabla c_{m}(s) \right|_{L^{2}}^{2}\right]ds\] \[\leqslant\mathcal{K}+\mathcal{K}\mathbb{E}\sup_{0\leqslant s \leqslant T}\left|\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}\int_{0}^{T}\left|n_{m}(s )\right|_{L^{2}}^{2}ds+\mathcal{K}\mathbb{E}\sup_{0\leqslant s\leqslant T} \left|\nabla c_{m}(s)\right|_{L^{2}}^{2}\int_{0}^{T}\left|n_{m}(s)\right|_{L^{2 }}^{2}ds\] \[\leqslant\mathcal{K}+\mathcal{K}\mathbb{E}\sup_{0\leqslant s \leqslant T}\left|\mathbf{u}_{m}(s)\right|_{L^{2}}^{4}+\mathcal{K}\mathbb{E} \sup_{0\leqslant s\leqslant T}\left|\nabla c_{m}(s)\right|_{L^{2}}^{4}+ \mathcal{K}\mathbb{E}\left(\int_{0}^{T}\left|n_{m}(s)\right|_{L^{2}}^{2}ds \right)^{2}\leqslant\mathcal{K}.\] **Lemma 4.10**.: _Under the same assumptions as in Lemma 4.3, there exists a positive constant \(\mathcal{K}\) such that for all \(m\in\mathbb{N}\),_ \[\mathbb{E}\int_{0}^{T}\left[\left|A_{1}c_{m}(s)\right|_{L^{2}}^{2} +\left|\mathcal{P}_{m}^{2}B_{1}(\mathbf{u}_{m}(s),c_{m}(s))\right|_{L^{2}}^{2} +\left|\mathcal{P}_{m}^{2}R_{1}(n_{m}(s),c_{m}(s))\right|_{L^{2}}^{2}\right]ds \leqslant\mathcal{K},\] \[\mathbb{E}\int_{0}^{T}\left[\left|A_{0}\mathbf{u}_{m}(s)\right|_{V ^{*}}^{2}+\left|\mathcal{P}_{m}^{2}B_{0}(\mathbf{u}_{m}(s),\mathbf{u}_{m}(s)) \right|_{V^{*}}^{2}+\left|\mathcal{P}_{m}^{2}R_{0}(n_{m}(s),\Phi)\right|_{V^{*} }^{2}\right]ds\leqslant\mathcal{K}. \tag{4.57}\] Proof.: Thanks to the inequalities (4.52), (4.53) and (4.54) once more, we note that \[\mathbb{E}\int_{0}^{T}\left|A_{1}c_{m}(s)\right|_{L^{2}}^{2}ds=\mathbb{E}\int_{0} ^{T}\left|\Delta c_{m}(s)\right|_{L^{2}}^{2}ds\leq\mathcal{K}\mathbb{E}\int_{0} ^{T}\left|c_{m}(s)\right|_{H^{2}}^{2}ds\leq\mathcal{K},\] and \[\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^{2}B_{1}(\mathbf{u}_{ m}(s),c_{m}(s))\right|_{L^{2}}^{2}ds \leq\mathcal{K}\mathbb{E}\int_{0}^{T}\left|\mathbf{u}_{m}(s)\cdot \nabla c_{m}(s)\right|_{L^{2}}^{2}ds\] \[\leq\mathcal{K}\mathbb{E}\sup_{0\leq s\leq T}\left|\mathbf{u}_{ m}(s)\right|_{L^{2}}^{2}\int_{0}^{T}\left|\nabla c_{m}(s)\right|_{L^{2}}^{2}\] \[\leq\mathcal{K}\mathbb{E}\sup_{0\leq s\leq T}\left|u_{m}(s) \right|_{L^{2}}^{4}+\mathcal{K}\mathbb{E}\left(\int_{0}^{T}\left|\nabla c_{m} (s)\right|_{L^{2}}^{2}ds\right)^{2}\leq\mathcal{K},\] as well as \[\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^{2}R_{1}(n_{m}(s),c_{ m}(s))\right|_{L^{2}}^{2}ds \leq\mathcal{K}\mathbb{E}\int_{0}^{T}\left|n_{m}(s)f(c_{m}(s)) \right|_{L^{2}}^{2}ds\] \[\leq\mathcal{K}\sup_{0\leq s\leq\left|c_{0}\right|_{L^{2}}}f^{2} (s)\mathbb{E}\int_{0}^{T}\left|n_{m}(s)\right|_{L^{2}}^{2}\leq\mathcal{K},\] and \[\mathbb{E}\int_{0}^{T}\left|A_{0}\mathbf{u}_{m}(s)\right|_{V*}^{2}ds\leq \mathbb{E}\int_{0}^{T}\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}ds\leq \mathcal{K}.\] In the same way, \[\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^{2}B_{0}(\mathbf{u}_{ m}(s),\mathbf{u}_{m}(s))\right|_{V*}^{2}ds \leq\mathcal{K}\mathbb{E}\int_{0}^{T}\left|\mathbf{u}_{m}\right|_ {L^{2}}^{2}\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}ds\] \[\leq\mathcal{K}\mathbb{E}\sup_{0\leq s\leq T}\left|\mathbf{u}_{ m}(s)\right|_{L^{2}}^{2}\int_{0}^{T}\left|\nabla\mathbf{u}_{m}(s)\right|_{L^{2}}^{2}ds\] \[\leq\mathcal{K}\mathbb{E}\sup_{0\leq s\leq T}\left|u_{m}(s)\right| _{L^{2}}^{4}+\mathcal{K}\mathbb{E}\left(\int_{0}^{T}\left|\nabla\mathbf{u}_{m} (s)\right|_{L^{2}}^{2}ds\right)^{2}\leq\mathcal{K},\] and \[\mathbb{E}\int_{0}^{T}\left|R_{0}(n_{m}(s),\Phi)\right|_{V*}^{2}ds\leq\left| \Phi\right|_{W^{1,\infty}}^{2}\mathbb{E}\int_{0}^{T}\left|n_{m}(s)\right|_{L^{ 2}}^{2}ds\leq\mathcal{K}.\] Combining all these inequalities, we obtain the relation (4.57). ### Tightness result and passage to the limit This subsection is devoted to the study of the tightness of the approximations solutions and the proof of several convergences which will enable us to pass to the limit and construct a weak probabilistic solution to our problem via the martingale representation theorem given in [12, Theorem 8.2]. For this purpose, we consider the following spaces: \[\mathcal{Z}_{n}=L_{w}^{2}(0,T;H^{1}(\mathcal{O}))\cap L^{2}(0,T;L^ {2}(\mathcal{O}))\cap\mathcal{C}([0,T];H^{-3}(\mathcal{O}))\cap\mathcal{C}([0,T ];L_{w}^{2}(\mathcal{O})),\] \[\mathcal{Z}_{\mathbf{u}}=L_{w}^{2}(0,T;V)\cap L^{2}(0,T;H)\cap \mathcal{C}([0,T];V^{*})\cap\mathcal{C}([0,T];H_{w}),\] \[\mathcal{Z}_{c}=L_{w}^{2}(0,T;H^{2}(\mathcal{O}))\cap L^{2}(0,T;H ^{1}(\mathcal{O}))\cap\mathcal{C}([0,T];L^{2}(\mathcal{O}))\cap\mathcal{C}([0, T];H_{w}^{1}(\mathcal{O})),\] \[\mathcal{Z}=\mathcal{Z}_{n}\times\mathcal{Z}_{\mathbf{u}}\times \mathcal{Z}_{c}. \tag{4.58}\] By making appropriate use of Lemma A.3, Corollary A.8, and Corollary A.9, we will now show that the sequence of probability law \(\mathcal{L}_{m}=\mathcal{L}(n_{m})\times\mathcal{L}(\mathbf{u}_{m})\times \mathcal{L}(c_{m})\) is tight in \(\mathcal{Z}\). **Lemma 4.11**.: _We suppose that the hypotheses of Proposition 4.3 hold. Then the family of probability laws \((\mathcal{L}_{m})_{m\in\mathbb{N}}\) is tight on the space \(\mathcal{Z}\)._ Proof.: We firstly prove that \((\mathcal{L}(n_{m}))_{m}\) is tight on \(\mathcal{Z}_{n}\). For any \(\varepsilon>0\) we set \(\mathcal{K}_{\varepsilon}=\eta_{0}e^{\mathcal{K}/\varepsilon}>\eta_{0}\) where \(\eta_{0}>1\) is given by Lemma 4.5. From the inequality (4.51), we deduce that \[\sup_{m}\mathbb{P}\left\{\omega\in\Omega:\ \ |n_{m}|_{L^{\infty}(0,T;L^{2})}^{2}> \mathcal{K}_{\varepsilon}\right\} \leq\sup_{m}\mathbb{P}\left\{\omega\in\Omega:\ \ \eta_{0}\exp\left(\mathcal{K}\int_{0}^{T}|\nabla c_{m}(s)|_{L^{4}}^{4}\,ds \right)>\mathcal{K}_{\varepsilon}\right\}\] \[\leq\sup_{m}\mathbb{P}\left\{\omega\in\Omega:\ \ \mathcal{K}\int_{0}^{T}|\nabla c_{m}(s)|_{L^{4}}^{4}\,ds>\ln\left(\frac{ \mathcal{K}_{\varepsilon}}{\eta_{0}}\right)\right\}.\] Using the Markov inequality and inequality (4.55), we infer that \[\sup_{m}\mathbb{P}\left\{\omega\in\Omega:\ \ |n_{m}|_{L^{\infty}(0,T;L^{2})}^{ 2}>\mathcal{K}_{\varepsilon}\right\} \leq\frac{1}{\ln\left(\frac{\mathcal{K}_{\varepsilon}}{\eta_{0}} \right)}\mathbb{E}\left(\mathcal{K}\int_{0}^{T}|\nabla c_{m}(s)|_{L^{4}}^{4} \,ds\right)\] \[\leq\frac{\varepsilon}{\mathcal{K}}\mathbb{E}\left(\mathcal{K} \int_{0}^{T}|\nabla c_{m}(s)|_{L^{4}}^{4}\,ds\right)\] \[\leq\varepsilon.\] Similarly, we can also prove that \[\sup_{m}\mathbb{P}\left\{\omega\in\Omega:\ \ |n_{m}|_{L^{2}(0,T;H^{1})}^{ 2}>\mathcal{K}_{\varepsilon}\right\} \leq\sup_{m}\mathbb{P}\left\{\omega\in\Omega:\ \ \eta_{0}\exp\left(\mathcal{K}\int_{0}^{T}|\nabla c_{m}(s)|_{L^{4}}^{4}\,ds \right)>\mathcal{K}_{\varepsilon}\right\}\] \[\leq\varepsilon.\] Thanks to inequality (4.56) we derive that \[\sup_{m}\mathbb{P}\left\{\omega\in\Omega:\ \ |n_{m}|_{\mathcal{C}^{1/2}([0,T];H^{-3})} ^{2}>\frac{\mathcal{K}}{\varepsilon}\right\}\leq\frac{\varepsilon}{\mathcal{K }}\mathbb{E}\left|n_{m}\right|_{\mathcal{C}^{1/2}([0,T];H^{-3})}^{2}\leq\varepsilon.\] Since these three last inequalities hold, we can apply Lemma A.3 and conclude that the law of \(n_{m}\) form a family of probability measures which is tight on \(\mathcal{Z}_{n}\). Secondly, we will prove that the laws of \(\mathbf{u}_{m}\) and \(c_{m}\) are tight on \(\mathcal{Z}_{\mathbf{u}}\times\mathcal{Z}_{c}\). From inequalities (4.52) and (4.54), we obtain the first two conditions of Corollaries A.8 and A.9 for \(\mathbf{u}_{m}\) and \(c_{m}\) respectively. Hence, it is sufficient to prove that the sequences \((\mathbf{u}_{m})_{m}\) and \((c_{m})\) satisfy the Aldous condition in the spaces \(V^{*}\) and \(L^{2}(\mathcal{O})\) respectively. Let \(\theta>0\)\((\tau_{\ell})_{\ell\geq 1}\) be a sequence of stopping times such that \(0\leq\tau_{\ell}\leq T\). From the second equation of system (4.2) we have \[c_{m}(\tau_{\ell}+\theta)-c_{m}(\tau_{\ell}) =\xi\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}A_{1}c_{m}(s)ds-\int_ {\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P}_{m}^{2}B_{1}(\mathbf{u}_{m}(s), c_{m}(s))ds \tag{4.59}\] \[+\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P}_{m}^{2}R_{1} (n_{m}(s),c_{m}(s))ds+\gamma\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P} _{m}^{2}\phi(c_{m}(s))d\beta_{s}.\] By the Fubini theorem, the Holder inequality and inequality (4.57), we have the following estimates \[\mathbb{E}\left|\xi\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}A_{1}c_ {m}(s)ds\right|_{L^{2}}^{2} \leq\xi^{2}\theta^{1/2}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+ \theta}|A_{1}c_{m}(s)|_{L^{2}}^{2}\,ds\] \[\leq\xi^{2}\theta^{1/2}\mathbb{E}\int_{0}^{T}|A_{1}c_{m}(s)|_{L^ {2}}^{2}\,ds\leq\mathcal{K}\theta^{1/2},\] \[\mathbb{E}\left|\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P}_{m}^ {2}B_{1}(\mathbf{u}_{m}(s),c_{m}(s))ds\right|_{L^{2}}^{2}ds \leq\theta^{1/2}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+\theta} \left|\mathcal{P}_{m}^{2}B_{1}(\mathbf{u}_{m}(s),c_{m}(s))\right|_{L^{2}}^{2}ds\] \[\leq\theta^{1/2}\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^{2}B_ {1}(\mathbf{u}_{m}(s),c_{m}(s))\right|_{L^{2}}^{2}ds\leq\mathcal{K}\theta^{1/ 2},\] and \[\mathbb{E}\left|\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{ P}_{m}^{2}R_{1}(n_{m}(s),c_{m}(s))ds\right|_{L^{2}}^{2}ds \leq\theta^{1/2}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+\theta} \left|\mathcal{P}_{m}^{2}R_{1}(n_{m}(s),c_{m}(s))\right|_{L^{2}}^{2}ds\] \[\leq\theta^{1/2}\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^{2}R _{1}(n_{m}(s),c_{m}(s))\right|_{L^{2}}^{2}ds\leq\mathcal{K}\theta^{1/2}.\] By the Ito isometry, we note that \[\mathbb{E}\left|\gamma\int_{\tau_{\ell}}^{\tau_{\ell}+\theta} \mathcal{P}_{m}^{2}\phi(c_{m}(s))d\beta_{s}\right|_{L^{2}}^{2} \leq\gamma^{2}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+\theta} \left|\phi(c_{m}(s))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2},L^{2})}^{2}\] \[\leq\gamma^{2}\sum_{k=1}^{2}\left|\sigma_{k}\right|_{L^{2}}^{2} \mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\left|\nabla c_{m}(s)\right|_ {L^{2}}^{2}ds\] \[\leq\mathcal{K}\theta\mathbb{E}\sup_{0\leq s\leq T}\left|\nabla c _{m}(s)\right|_{L^{2}}^{2}\leq\mathcal{K}\theta.\] Combining these inequalities, we infer from equality (4.59) that the condition (A.5) is satisfies for \((c_{m})_{m\geq 1}\) in \(L^{2}(\mathcal{O})\). Hence by Lemma A.7 the sequence \((c_{m})_{m\geq 1}\) satisfies the Aldous condition in the space \(L^{2}(\mathcal{O})\). Now we will consider the sequence \((\mathbf{u}_{m})_{m\geq 1}\). We first observe that from the first equation of system (4.2) we infer that \[\mathbf{u}_{m}(\tau_{\ell}+\theta)-\mathbf{u}_{m}(\tau_{\ell}) =-\eta\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}A_{0}\mathbf{u}_{m}( s)ds-\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P}_{m}^{1}B_{0}( \mathbf{u}_{m}(s),\mathbf{u}_{m}(s))ds \tag{4.60}\] \[+\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P}_{m}^{1}R_{0} (n_{m}(s),\varPhi)ds+\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P}_{m}^{1} g(\mathbf{u}_{m}(s),c_{m}(s))dW_{s}.\] Thanks to the Holder inequality and (4.57), we have the following estimates \[\mathbb{E}\left|\eta\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}A_{0} \mathbf{u}_{m}(s)ds\right|_{V*}^{2} \leq\eta^{2}\theta^{1/2}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell} +\theta}\left|A_{0}\mathbf{u}_{m}(s)\right|_{V*}^{2}ds\] \[\leq\eta^{2}\theta^{1/2}\mathbb{E}\int_{0}^{T}\left|A_{0}\mathbf{ u}_{m}(s)\right|_{V*}^{2}ds\leq\mathcal{K}\theta^{1/2},\] and \[\mathbb{E}\left|\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{ P}_{m}^{2}B_{0}(\mathbf{u}_{m}(s),\mathbf{u}_{m}(s))ds\right|_{V*}^{2}ds \leq\theta^{1/2}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+\theta }\left|\mathcal{P}_{m}^{2}B_{1}(\mathbf{u}_{m}(s),\mathbf{u}_{m}(s))\right|_{V* }^{2}ds\] \[\leq\theta^{1/2}\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^{2}B_{ 1}(\mathbf{u}_{m}(s),\mathbf{u}_{m}(s))\right|_{V*}^{2}ds\leq\mathcal{K} \theta^{1/2},\] as well as \[\mathbb{E}\left|\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{P}_{ m}^{2}R_{0}(n_{m}(s),\varPhi)ds\right|_{V^{*}}^{2}ds \leqslant\theta^{1/2}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+ \theta}\left|\mathcal{P}_{m}^{2}R_{0}(n_{m}(s),\varPhi)\right|_{V^{*}}^{2}ds\] \[\leqslant\theta^{1/2}\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m} ^{2}R_{0}(n_{m}(s),\varPhi)\right|_{V^{*}}^{2}ds\leqslant\mathcal{K}\theta^{1 /2}.\] Thanks to the Ito isometry and the assumption on \(g\) we obtain \[\mathbb{E}\left|\int_{\tau_{\ell}}^{\tau_{\ell}+\theta}\mathcal{ P}_{m}^{1}g(\mathbf{u}_{m}(s),c_{m}(s))dW_{s}\right|_{V^{*}}^{2} \leqslant\mathcal{K}\mathbb{E}\left|\int_{\tau_{\ell}}^{\tau_{ \ell}+\theta}\mathcal{P}_{m}^{1}g(\mathbf{u}_{m}(s),c_{m}(s))dW_{s}\right|_{ L^{2}}^{2}\] \[\leqslant\mathcal{K}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+ \theta}\left|\mathcal{P}_{m}^{1}g(\mathbf{u}_{m}(s),c_{m}(s))\right|_{ \mathcal{L}^{2}(\mathcal{U},H)}^{2}ds\] \[\leqslant\mathcal{K}\mathbb{E}\int_{\tau_{\ell}}^{\tau_{\ell}+ \theta}(1+\left|(\mathbf{u}_{m}(s),c_{m}(s))\right|_{\mathcal{H}}^{2})ds\] \[\leqslant\mathcal{K}\left(1+\mathbb{E}\sup_{0\leqslant s\leqslant T }\left|(\mathbf{u}_{m}(s),c_{m}(s))\right|_{\mathcal{H}}^{2}\right)\theta \leqslant\mathcal{K}\theta.\] From these inequalities and equality (4.60), we can conclude by Lemma A.7 that the sequence \((\mathbf{u}_{m})_{m\geqslant 1}\) satisfies the Aldous condition in the space \(V^{*}\). Hence, by applying Corollary A.8 and Corollary A.9, we see that the laws of \(c_{m}\) and \(\mathbf{u}_{m}\) are tight on \(\mathcal{Z}_{c}\) and \(\mathcal{Z}_{\mathbf{u}}\), respectively. Since \((\mathcal{L}_{m})_{m}\) is tight on \(\mathcal{Z}\), invoking [28, Corollary 2, Appendix B] (see also [7, Theorem 4.13]) there exists a probability space \[(\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime}),\] and a subsequence of random vectors \((\bar{\mathbf{u}}_{m_{k}},\bar{c}_{m_{k}},\bar{n}_{m_{k}})\) with values in \(\mathcal{Z}\) such that **i):**: \((\bar{\mathbf{u}}_{m_{k}},\bar{c}_{m_{k}},\bar{n}_{m_{k}})\) have the same probability distributions as \((\mathbf{u}_{m_{k}},c_{m_{k}},n_{m_{k}})\), **ii):**: \((\bar{\mathbf{u}}_{m_{k}},\bar{c}_{m_{k}},\bar{n}_{m_{k}})\) converges in the topology of \(\mathcal{Z}\) to a random element \((\mathbf{u},c,n)\in\mathcal{Z}\) with probability \(1\) on \((\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime})\) as \(k\to\infty\). To simplify the notation, we will simply denote these sequences by \((\mathbf{u}_{m},c_{m},n_{m})_{m\geqslant 1}\) and \((\bar{\mathbf{u}}_{m},\bar{c}_{m},\bar{n}_{m})_{m\geqslant 1}\), respectively. Next, from the definition of the space \(\mathcal{Z}\), we deduce that \(\mathbb{P}^{\prime}\)-a.s., \[\bar{\mathbf{u}}_{m}\to\mathbf{u}\ \ \text{in}\ \ L_{w}^{2}(0,T;V)\cap L ^{2}(0,T;H)\cap\mathcal{C}([0,T];V^{*})\cap\mathcal{C}([0,T];H_{w}),\] \[\bar{c}_{m}\to c\ \ \text{in}\ \ L_{w}^{2}(0,T;H^{2}(\mathcal{O}))\cap L ^{2}(0,T;H^{1}(\mathcal{O}))\cap\mathcal{C}([0,T];L^{2}(\mathcal{O}))\cap \mathcal{C}([0,T];H_{w}^{1}(\mathcal{O})),\] \[\bar{n}_{m}\to n\ \ \text{in}\ \ L_{w}^{2}(0,T;H^{1}(\mathcal{O}))\cap L ^{2}(0,T;L^{2}(\mathcal{O}))\cap\mathcal{C}([0,T];H^{-3}(\mathcal{O}))\cap \mathcal{C}([0,T];L_{w}^{2}(\mathcal{O})). \tag{4.61}\] According to [40, Theorem 1.10.4 and Addendum 1.10.5], a family of measurable map \(\Psi_{m}:\Omega^{\prime}\to\Omega\) can be constructed such that together with the new probability space \((\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime})\) satisfy the property \[\bar{\mathbf{u}}_{m}(\omega^{\prime})=\mathbf{u}_{m}\circ\Psi_{m}( \omega^{\prime}),\ \ \bar{n}_{m}(\omega^{\prime})=n_{m}\circ\Psi_{m}(\omega^{\prime}),\] \[\bar{c}_{m}(\omega^{\prime})=c_{m}\circ\Psi_{m}(\omega^{\prime}), \ \ \text{and}\ \ \mathbb{P}=\mathbb{P}^{\prime}\circ\Psi_{m}^{-1}, \tag{4.62}\] for all \(\omega^{\prime}\in\Omega^{\prime}\). Taking into account the fact that inequality (4.10) holds, we can derive that for almost every \((t,\omega^{\prime})\in[0,T]\times\Omega^{\prime}\), \[\left|\bar{c}_{m}(t,\omega^{\prime})\right|_{L^{\infty}}=\left|c_{m}(t,\Psi_{m} (\omega^{\prime}))\right|_{L^{\infty}}\leq\left|c_{0}\right|_{L^{\infty}}, \qquad\text{for \ all \ }m\geq 1. \tag{4.63}\] Since the laws of \((\mathbf{u}_{m},c_{m},n_{m})\) and \((\bar{\mathbf{u}}_{m},\bar{c}_{m},\bar{n}_{m})\) are equal in the space \(\mathcal{Z}_{\mathbf{u}}\times\mathcal{Z}_{c}\times\mathcal{Z}_{n}\), we have the estimates (4.52), (4.54) and \[\mathbb{E}^{\prime}\int_{0}^{T}\left|\bar{c}_{m}(s)\right|_{H^{2}}^{2}ds\leq \mathcal{K},\quad\mathbb{E}^{\prime}\int_{0}^{T}\left|\nabla\bar{\mathbf{u}} _{m}(s)\right|_{L^{2}}^{2}ds\leq\mathcal{K}, \tag{4.64}\] as well as \[\mathbb{E}^{\prime}\int_{0}^{T}\left|\bar{n}_{m}(s)\right|_{L^{2}}^{2}ds\leq \mathcal{K}. \tag{4.65}\] From (4.64) and (4.65) and the Banach-Alaoglu Theorem, we conclude that, there exists a subsequence of \((\bar{\mathbf{u}}_{m})_{m\geq 1}\), \((\bar{c}_{m})_{m\geq 1}\), and \((\bar{n}_{m})_{m\geq 1}\) weakly convergent in \(L^{2}(\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime};L^{2}(0,T;V))\), \(L^{2}(\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime};L^{2}(0,T;H^{2} (\mathcal{O})))\), and \(L^{2}(\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime};L^{2}(0,T;L^{2} (\mathcal{O})))\) respectively. i.e. \[\mathbf{u}\in L^{2}(\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{ P}^{\prime};L^{2}(0,T;V)),\quad c\in L^{2}(\Omega^{\prime},\mathcal{F}^{\prime}, \mathbb{P}^{\prime};L^{2}(0,T;H^{2}(\mathcal{O}))),\] \[n\in L^{2}(\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{ \prime};L^{2}(0,T;L^{2}(\mathcal{O}))). \tag{4.66}\] On the other hand, from estimates (4.52), (4.53) and (4.54) of Corollary 4.8, and the equalities given by (4.62), we get for any \(p\geq 1\), \[\mathbb{E}^{\prime}\sup_{0\leq s\leq T}\left|\bar{\mathbf{u}}_{m} (s)\right|_{L^{2}}^{2p}+\mathbb{E}^{\prime}\left(\int_{0}^{T}\left|\nabla\bar{ \mathbf{u}}_{m}(s)\right|_{L^{2}}^{2}ds\right)^{p}\leq\mathcal{K}, \tag{4.68}\] \[\mathbb{E}^{\prime}\left(\int_{0}^{T}\left|\bar{n}_{m}(s)\right| _{L^{2}}^{2}ds\right)^{p}\leq\mathcal{K},\] (4.69) \[\mathbb{E}^{\prime}\sup_{0\leq s\leq T}\left|\bar{c}_{m}(s)\right| _{H^{1}}^{p}+\mathbb{E}^{\prime}\left(\int_{0}^{T}\left|\bar{c}_{m}(s)\right|_{ H^{2}}^{2}ds\right)^{p}\leq\mathcal{K}. \tag{4.67}\] Then, invoking the Fatou lemma, we infer that for \(p\geq 2\), we have \[\mathbb{E}^{\prime}\sup_{0\leq s\leq T}\left|\mathbf{u}(s)\right|_{L^{2}}^{p} <\infty,\qquad\mathbb{E}^{\prime}\sup_{0\leq s\leq T}\left|c(s)\right|_{H^{1} }^{p}<\infty. \tag{4.70}\] and \[\mathbb{E}^{\prime}\left(\int_{0}^{T}\left|\nabla\mathbf{u}(s)\right|_{L^{2}} ^{2}ds\right)^{p}<\infty,\ \ \mathbb{E}^{\prime}\left(\int_{0}^{T}\left|n(s)\right|_{L^{2}}^{2}ds\right)^{p} <\infty,\ \ \mathbb{E}^{\prime}\left(\int_{0}^{T}\left|c(s)\right|_{H^{2}}^{2}ds \right)^{p}<\infty. \tag{4.71}\] Now, we prove three lemmata which show how convergence in \(\mathcal{Z}\) given by (4.61) will be used for the convergence of the deterministic terms appearing in the Galerkin approximation. We start by noting that since \(n_{0}^{m}\), \(c_{0}^{m}\) and \(\mathbf{u}_{0}^{m}\) have been chosen such that (4.1) holds, we can derive that for all \(\psi\in H^{3}(\mathcal{O})\) and \((\psi,\mathbf{v})\in L^{2}(\mathcal{O})\times V\), \[\lim_{m\longrightarrow\infty}(n_{0}^{m},\psi)=(n_{0},\psi),\quad\lim_{m \longrightarrow\infty}(c_{0}^{m},\psi)=(c_{0},\psi),\ \ \text{and}\quad\lim_{m\longrightarrow\infty}(\mathbf{u}_{0}^{m},\mathbf{v})=( \mathbf{u}_{0},\mathbf{v}). \tag{4.72}\] **Lemma 4.12**.: _For any \(r,t\in[0,T]\) with \(r\leqslant t\) and \(\psi\in H^{3}(\mathcal{O})\), the following convergences hold \(\mathbb{P}^{\prime}\)-a.s._ \[\lim_{m\longrightarrow\infty}(\bar{n}_{m}(t),\psi)=(n(t),\psi),\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(A_{1}\bar{n}_{m}(s), \psi)ds=\int_{r}^{t}(A_{1}n(s),\psi)ds\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(\mathcal{P}_{m}^{2}B_{ 1}(\bar{\mathbf{u}}_{m}(s),\bar{n}_{m}(s)),\psi)ds=\int_{r}^{t}(B_{1}( \mathbf{u}(s),n(s)),\psi)ds,\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(\mathcal{P}_{m}^{2}R_{ 2}(\bar{n}_{m}(s),\bar{c}_{m}(s)),\psi)ds=\int_{r}^{t}(R_{2}(n(s),c(s)),\psi)ds. \tag{4.73}\] Proof.: Let \(\psi\in H^{3}(\mathcal{O})\) and \(t\in[0,T]\) be arbitrary but fixed. By the Holder inequality we have \[|(\bar{n}_{m}(t),\psi)-(n(t),\psi)| \leqslant|\bar{n}_{m}(t)-n(t)|_{H^{-3}}\left|\psi\right|_{H^{3}}\] \[\leqslant|\bar{n}_{m}-n|_{\mathcal{C}([0,T];H^{-3})}\left|\psi \right|_{H^{3}}, \tag{4.74}\] which along with (4.61) implies the first convergence in (4.73). Now, we also fix \(r\in[0,T]\) such that \(r\leqslant t\). By an integration-by-parts and the Holder inequality we note that \[\left|\int_{r}^{t}(A_{1}\bar{n}_{m}(s),\psi)ds-\int_{r}^{t}(A_{1} n(s),\psi)ds\right|dt \leqslant\int_{0}^{T}|(A_{1}\bar{n}_{m}(s)-A_{1}n(s),\psi)|\,ds\] \[\leqslant\int_{0}^{T}|(\bar{n}_{m}(s)-n(s),A_{1}\psi)|\,ds\] \[\leqslant T\sup_{0\leqslant s\leqslant T}|(\bar{n}_{m}(s)-n(s),A_ {1}\psi)|\,. \tag{4.75}\] From the convergence (4.61) we infer that \(\bar{n}_{m}\to n\) in \(\mathcal{C}([0,T];L_{w}^{2}(\mathcal{O})\), \(\mathbb{P}^{\prime}\)-a.s. This means that \(\sup_{0\leqslant s\leqslant T}|(\bar{n}_{m}(s)-n(s),\varphi)|\) tends to zero for all \(\varphi\in L^{2}(\mathcal{O})\) as \(m\) goes to infinity with probability one. We plug \(\varphi=A_{1}\psi\) and pass to the limit in (4.75) and derive the second convergence of (4.73). We have for all \(\omega\in\Omega\), \[\left|\int_{r}^{t}(\mathcal{P}_{m}^{2}B_{1}(\bar{\mathbf{u}}_{m}( s),\bar{n}_{m}(s)),\psi)ds-\int_{r}^{t}(B_{1}(\mathbf{u}(s),n(s)),\psi)ds\right|\] \[\leqslant\int_{0}^{T}\left|(B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{n }_{m}(s)),\mathcal{P}_{m}^{2}\psi-\psi)\right|+\int_{0}^{T}|(B_{1}(\bar{ \mathbf{u}}_{m}(s),\bar{n}_{m}(s))-B_{1}(\mathbf{u}(s),n(s)),\psi)|\,ds\] Since \(\bar{\mathbf{u}}_{m}\to\mathbf{u}\) in \(L^{2}(0,T;H)\), and \(\bar{n}_{m}\to n\) in \(L^{2}(0,T;L^{2}(\mathcal{O}))\)\(\mathbb{P}^{\prime}\)-a.s., by integration-by-parts, we derive that \[\int_{0}^{T}\left|(B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{n}_{m}(s)), \mathcal{P}_{m}^{2}\psi-\psi)\right|ds\] \[\leqslant\int_{0}^{T}\left|(\bar{n}_{m}(s)\bar{\mathbf{u}}_{m}( s),\nabla(\mathcal{P}_{m}^{2}\psi-\psi))\right|\] \[\leqslant\left|\nabla(\mathcal{P}_{m}^{2}\psi-\psi)\right|_{L^{ \infty}}\int_{0}^{T}|\bar{n}_{m}(s)|_{L^{2}}\left|\bar{\mathbf{u}}_{m}(s) \right|_{L^{2}}ds\] \[\leqslant\left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{H^{3}}\left( \int_{0}^{T}|\bar{\mathbf{u}}_{m}(s)|_{L^{2}}^{2}\,ds\right)^{1/2}\left(\int_{ 0}^{T}|\bar{n}_{m}(s)|_{L^{2}}^{2}\,ds\right)^{1/2}\] \[\leqslant\mathcal{K}\left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{H^ {3}}.\] By using an integration-by-parts and the fact that \(\nabla\cdot\mathbf{u}=0\) we get \[\int_{0}^{T}\left|(B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{n}_{m}(s))-B_ {1}(\mathbf{u}(s),n(s)),\psi),\psi)\right|ds\] \[\leq\int_{0}^{T}\left|((\bar{\mathbf{u}}_{m}(s)-\mathbf{u}(s)) \nabla\bar{n}_{m}(s),\psi)\right|ds+\int_{0}^{T}\left|(\mathbf{u}(s)\nabla( \bar{n}_{m}(s)-n(s)),\psi)\right|ds\] \[\leq\int_{0}^{T}\left|(\bar{n}_{m}(s),(\bar{\mathbf{u}}_{m}(s)- \mathbf{u}(s))\cdot\nabla\psi)\right|ds+\int_{0}^{T}\left|((\bar{n}_{m}(s)-n( s)),\mathbf{u}(s)\cdot\nabla\psi)\right|ds\] \[\leq\left|\psi\right|_{L^{\infty}}\int_{0}^{T}\left|\bar{\mathbf{ u}}_{m}(s)-\mathbf{u}(s)\right|_{L^{2}}\left|\bar{n}_{m}(s)\right|_{L^{2}}ds+ \left|\nabla\psi\right|_{L^{\infty}}\int_{0}^{T}\left|\bar{n}_{m}(s)-n(s) \right|_{L^{2}}\left|\mathbf{u}(s)\right|_{L^{2}}ds.\] Using the fact that \(\left|\nabla\psi\right|_{L^{\infty}}\leq\left|\psi\right|_{H^{3}}\), we infer from the two last inequalities that \[\left|\int_{0}^{t}(\mathcal{P}_{m}^{2}B_{1}(\bar{\mathbf{u}}_{m}( s),\bar{n}_{m}(s)),\psi)ds-\int_{0}^{t}(B_{1}(\mathbf{u}(s),n(s)),\psi)ds\right|\] \[\leq T\left|\psi\right|_{H^{3}}\left(\int_{0}^{T}\left|\bar{ \mathbf{u}}_{m}(s)-\mathbf{u}(s)\right|_{L^{2}}^{2}ds\right)^{1/2}\left(\int_{ 0}^{T}\left|\bar{n}_{m}(s)\right|_{L^{2}}^{2}ds\right)^{1/2} \tag{4.76}\] \[\qquad+T\left|\psi\right|_{H^{3}}\left(\int_{0}^{T}\left|\bar{n} _{m}(s)-n(s)\right|_{L^{2}}^{2}ds\right)^{1/2}\left(\int_{0}^{T}\left|\mathbf{ u}(s)\right|_{L^{2}}^{2}ds\right)^{1/2}+\mathcal{K}\left|\mathcal{P}_{m}^{2} \psi-\psi\right|_{H^{3}}\] \[\leq\mathcal{K}\left(\int_{0}^{T}\left|\bar{\mathbf{u}}_{m}(s)- \mathbf{u}(s)\right|_{L^{2}}^{2}ds\right)^{1/2}\] \[\qquad+\mathcal{K}\left(\int_{0}^{T}\left|\bar{n}_{m}(s)-n(s) \right|_{L^{2}}^{2}ds\right)^{1/2}\left(\int_{0}^{T}\left|\mathbf{u}(s)\right| _{L^{2}}^{2}ds\right)^{1/2}+\mathcal{K}\left|\mathcal{P}_{m}^{2}\psi-\psi \right|_{H^{3}},\] which upon letting \(n\rightarrow\infty\), implies the third convergence in (4.73). Similarly, we have \[\left|\int_{r}^{t}(\mathcal{P}_{m}^{2}R_{2}(\bar{n}_{m}(s),\bar{c }_{m}(s)),\psi)ds-\int_{r}^{t}(R_{2}(n(s),c(s)),\psi)ds\right|\] \[\leq\int_{0}^{T}\left|(R_{2}(\bar{n}_{m}(s),\bar{c}_{m}(s))-R_{2} (n(s),c(s)),\psi)\right|ds\] \[\qquad+\int_{0}^{T}\left|(R_{2}(\bar{n}_{m}(s),\bar{c}_{m}(s)), \mathcal{P}_{m}^{2}\psi-\psi)\right|ds. \tag{4.77}\] Since \((\bar{c}_{m},\bar{n}_{m})\rightarrow(c,n)\) in \(\mathcal{Z}_{c}\times\mathcal{Z}_{n}\), we see that \(\mathbb{P}^{\prime}\)-a.s, \[\int_{0}^{T}\left|(R_{2}(\bar{n}_{m}(s),\bar{c}_{m}(s)),\mathcal{ P}_{m}^{2}\psi-\psi)\right|ds\] \[\leq\left|\nabla(\mathcal{P}_{m}^{2}\psi-\psi)\right|_{L^{\infty}} \int_{0}^{T}\left|\bar{n}_{m}(s)\right|_{L^{2}}\left|\nabla\bar{c}_{m}(s) \right|_{L^{2}}ds\] \[\leq\mathcal{K}\left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{H^{3}}.\] On the other hand, we obtain \[\int_{0}^{T}\left|(R_{2}(\bar{n}_{m}(s),\bar{c}_{m}(s))-R_{2}(n(s),c( s)),\psi),\psi)\right|\,ds\] \[\leq\int_{0}^{T}\left|((\bar{n}_{m}(s)-n(s))\nabla\bar{c}_{m}(s), \nabla\psi)\right|ds+\int_{0}^{T}\left|(n(s)\nabla(\bar{c}_{m}(s)-c(s)),\nabla \psi)\right|\,ds\] \[\leq\left|\nabla\psi\right|_{L^{\infty}}\int_{0}^{T}\left|\bar{n} _{m}(s)-n(s)\right|_{L^{2}}\left|\nabla\bar{c}_{m}(s)\right|_{L^{2}}ds\] \[\qquad+\left|\nabla\psi\right|_{L^{\infty}}\int_{0}^{T}\left| \nabla(\bar{c}_{m}(s)-c(s))\right|_{L^{2}}\left|n(s)\right|_{L^{2}}ds\] \[\leq\mathcal{K}\left(\int_{0}^{T}\left|\bar{n}_{m}(s)-n(s)\right| _{L^{2}}^{2}ds\right)^{1/2}\] \[\qquad+\mathcal{K}\left(\int_{0}^{T}\left|\nabla(\bar{c}_{m}(s) -c(s))\right|_{L^{2}}^{2}ds\right)^{1/2}\left(\int_{0}^{T}\left|n(s)\right|_{ L^{2}}^{2}ds\right)^{1/2},\] which along with (4.61) implies the fourth convergence in (4.73). **Lemma 4.13**.: _For any \(r,t\in[0,T]\) with \(r\leq t\) and \(\psi\in H^{2}(\mathcal{O})\), the following convergences hold \(\mathbb{P}^{\prime}\)-a.s._ \[\lim_{m\longrightarrow\infty}(\bar{c}_{m}(t),\psi)=(c(t),\psi),\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(A_{1}\bar{c}_{m}(s), \psi)ds=\int_{r}^{t}(A_{1}c(s),\psi)ds,\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(\mathcal{P}_{m}^{2}B_{ 1}(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s)),\psi)ds=\int_{r}^{t}(B_{1}( \mathbf{u}(s),c(s)),\psi)ds,\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(\mathcal{P}_{m}^{2}R_{ 1}(\bar{n}_{m}(s),\bar{c}_{m}(s)),\psi)ds=\int_{r}^{t}(R_{1}(n(s),c(s)),\psi)ds. \tag{4.78}\] Proof.: Since \(\bar{c}_{m}\to c\) in \(\mathcal{C}([0,T];L^{2}(\mathcal{O}))\), \(\mathbb{P}^{\prime}\)-a.s., the first convergence is done exactly using a similarly inequality as (4.74). By an integration by part and the Holder inequality we note that \[\left|\int_{r}^{t}(A_{1}\bar{c}_{m}(s),\psi)ds-\int_{r}^{t}(A_{1} c(s),\psi)ds\right| \leq\int_{0}^{T}\left|(A_{1}\bar{c}_{m}(s)-A_{1}c(s),\psi)\right|\,ds\] \[\leq\int_{0}^{T}\left|(\nabla(\bar{c}_{m}(s)-c(s)),\nabla\psi) \right|\,ds\] \[\leq T^{1/2}\left|\psi\right|_{H^{1}}\left(\int_{0}^{T}\left| \bar{c}_{m}(s)-c(s)\right|_{H^{1}}^{2}ds\right)^{1/2},\] which altogether with (4.61) implies the second convergence in (4.78). Next, using the Sobolev embedding \(H^{1}(\mathcal{O})\hookrightarrow L^{4}(\mathcal{O})\), we get \[\left|\int_{r}^{t}(\mathcal{P}_{m}^{2}B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s)),\psi)ds-\int_{r}^{t}(B_{1}(\mathbf{u}(s),c(s)),\psi)ds\right|\] \[\leq\int_{0}^{T}\left|(B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}( s))-B_{1}(\mathbf{u}(s),c(s)),\psi),\psi)\right|ds+\int_{0}^{T}\left|(B_{1}( \bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s)),\mathcal{P}_{m}^{2}\psi-\psi)\right|ds\] \[\leq\int_{0}^{T}\left|((\bar{\mathbf{u}}_{m}(s)-\mathbf{u}(s)) \nabla\bar{c}_{m}(s),\psi)\right|ds+\int_{0}^{T}\left|(\mathbf{u}(s)\nabla( \bar{c}_{m}(s)-c(s)),\psi)\right|ds\] \[\qquad+T^{1/2}\left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{L^{2}} \left(\int_{0}^{T}\left|B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s))\right|_ {L^{2}}^{2}ds\right)^{1/2}\] \[\leq\left|\psi\right|_{L^{4}}\int_{0}^{T}\left|\bar{\mathbf{u}}_{ m}(s)-\mathbf{u}(s)\right|_{L^{2}}\left|\nabla\bar{c}_{m}(s)\right|_{L^{4}}ds+ \left|\psi\right|_{L^{4}}\int_{0}^{T}\left|\nabla(\bar{c}_{m}(s)-c(s))\right|_ {L^{2}}\left|\mathbf{u}(s)\right|_{L^{4}}ds\] \[\qquad+\mathcal{K}\left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{L^{ 2}}\] \[\leq T\left|\psi\right|_{H^{1}}\int_{0}^{T}\left|\bar{\mathbf{u}}_{ m}(s)-\mathbf{u}(s)\right|_{L^{2}}\left|\bar{c}_{m}(s)\right|_{H^{2}}ds\] \[\qquad+T\left|\psi\right|_{H^{1}}\int_{0}^{T}\left|\nabla(\bar{c} _{m}(s)-c(s))\right|_{L^{2}}\left|\nabla\mathbf{u}(s)\right|_{L^{2}}ds+ \mathcal{K}\left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{L^{2}}.\] Since the convergence (4.61) holds, we arrive at \[\left|\int_{r}^{t}(\mathcal{P}_{m}^{2}B_{1}(\bar{\mathbf{u}}_{m} (s),\bar{c}_{m}(s)),\psi)ds-\int_{r}^{t}(B_{1}(\mathbf{u}(s),c(s)),\psi)ds\right|\] \[\leq T\left|\psi\right|_{H^{1}}\left(\int_{0}^{T}\left|\bar{ \mathbf{u}}_{m}(s)-\mathbf{u}(s)\right|_{L^{2}}^{2}ds\right)^{1/2}\left(\int_{ 0}^{T}\left|\bar{c}_{m}(s)\right|_{H^{2}}^{2}ds\right)^{\frac{1}{2}}\] \[\qquad+T\left|\psi\right|_{H^{1}}\left(\int_{0}^{T}\left|\bar{c}_ {m}(s)-c(s)\right|_{H^{1}}^{2}ds\right)^{\frac{1}{2}}\left(\int_{0}^{T}\left| \nabla\mathbf{u}(s)\right|_{L^{2}}^{2}ds\right)^{\frac{1}{2}}+\mathcal{K} \left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{L^{2}},\] which along with (4.61) implies the third convergence in (4.78). Now we prove the last convergence. To this purpose, we note that \[\left|\int_{r}^{t}(\mathcal{P}_{m}^{2}R_{1}(\bar{n}_{m}(s),\bar{c }_{m}(s)),\psi)ds-\int_{r}^{t}(R_{1}(n(s),c(s)),\psi)ds\right|\] \[\leq\int_{0}^{T}\left|(R_{1}(\bar{n}_{m}(s),\bar{c}_{m}(s))-R_{1} (n(s),c(s)),\psi)\right|ds\] \[\qquad+\int_{0}^{T}\left|(R_{1}(\bar{n}_{m}(s),\bar{c}_{m}(s)), \mathcal{P}_{m}^{2}\psi-\psi)\right|ds\] \[\leq\int_{0}^{T}\left|((\bar{n}_{m}(s)-n(s))f(\bar{c}_{m}(s)), \psi)\right|ds\] \[\qquad+\int_{0}^{T}\left|n(s)(f(\bar{c}_{m}(s))-f(c(s))),\psi) \right|ds+\mathcal{K}\left|\mathcal{P}_{m}^{2}\psi-\psi\right|_{L^{2}}. \tag{4.79}\] Using (4.63), we derive that \[\int_{0}^{T}\left|((\bar{n}_{m}(s)-n(s))f(\bar{c}_{m}(s)),\psi) \right|ds\] \[\leq\left|\psi\right|_{L^{\infty}}\int_{0}^{T}\int_{\mathcal{O}} \left|\bar{n}_{m}(s)-n(s)\right|\left|f(\bar{c}_{m}(s))\right|dxds\] \[\leq T^{1/2}\left|\mathcal{O}\right|^{1/2}\left|\psi\right|_{H^{ 2}}\sup_{0\leq s\leq\left|c_{0}\right|_{L^{\infty}}}f(s)\left(\int_{0}^{T} \left|\bar{n}_{m}(s)-n(s)\right|_{L^{2}}^{2}ds\right)^{1/2}.\] In a similar way, we see that \[\int_{0}^{T}\left|n(s,x)(f(\bar{c}_{m}(s,x))-f(c(s,x))),\psi) \right|dsdx\] \[\leq\left|\psi\right|_{H^{2}}\int_{0}^{T}\int_{\mathcal{O}}\left| n(s,x)f(\bar{c}_{m}(s,x))-n(s,x)f(c(s,x))\right|dxds. \tag{4.80}\] Since the strong convergence \(\bar{c}_{m}\to c\) in \(L^{2}(0,T;H^{1}(\mathcal{O}))\), \(\mathbb{P}^{\prime}\)-a.s., holds, we derive that up to a subsequence \[\bar{c}_{m}\to c\qquad dt\otimes dx\text{-a.e}\] Owing to the fact that \(f\) is continuous, we infer that \(\mathbb{P}^{\prime}\)-a.s., \[nf(\bar{c}_{m})\to nf(c)\qquad a.e\ \ \text{in}\ \ \times(0,T)\times \mathcal{O}.\] We also note that \(\mathbb{P}\)-a.s., \(\{nf(\bar{c}_{m})\}_{m\geq 1}\) is uniformly integrable over \((0,T)\times\mathcal{O}\). Indeed, we have \[\int_{(0,T)\times\mathcal{O}}\left|n(s,x)f(\bar{c}_{m}(s,x)) \right|^{2}dxdsd\mathbb{P} \leq\sup_{0\leq s\leq\left|c_{0}\right|_{L^{\infty}}}f^{2}(s)\int _{0}^{T}\int_{\mathcal{O}}\left|n(s,x)\right|^{2}dxds\] \[\leq\mathcal{K}\int_{0}^{T}\left|n(s)\right|_{L^{2}}^{2}ds.\] Therefore, by the Vitali Convergence Theorem, we derive that \(\mathbb{P}^{\prime}\)-a.s., the right answer of the inequality (4.80) tends to zero as \(m\) tends to \(\infty\). Owing to this result, we can pass to the limit in the inequality (4.79) and obtain the last convergence of (4.78). Next we prove the following convergences. **Lemma 4.14**.: _For any \(r,t\in[0,T]\) with \(r\leq t\) and \(\mathbf{v}\in V\), the following convergences hold \(\mathbb{P}^{\prime}\)-a.s._ \[\lim_{m\longrightarrow\infty}(\bar{\mathbf{u}}_{m}(t),\mathbf{v}) =(\mathbf{u}(t),\mathbf{v}),\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(A_{0}\bar{\mathbf{u}}_{ m}(s),\mathbf{v})ds=\int_{r}^{t}(A_{0}\mathbf{u}(s),\mathbf{v})ds,\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(\mathcal{P}_{m}^{1}B_{ 0}(\bar{\mathbf{u}}_{m}(s),\bar{\mathbf{u}}_{m}(s)),\mathbf{v})ds=\int_{r}^{t }(B_{0}(\mathbf{u}(s),\mathbf{u}(s)),\mathbf{v})ds,\] \[\lim_{m\longrightarrow\infty}\int_{r}^{t}(\mathcal{P}_{m}^{1}R_{ 0}(\bar{n}_{m}(s),\varPhi),\mathbf{v})ds=\int_{r}^{t}(R_{0}(n(s),\varPhi), \mathbf{v})ds. \tag{4.81}\] Proof.: The proof is similar to the proof of Lemma 4.12 and Lemma 4.13. In what follows, we will combine the convergence result from Lemma 4.12, Lemma 4.13 and Lemma 4.14 as well as martingale representation theorem to construct a probabilistic weak solution to the problem (1.2). In order to simplify the notation, we define on the probability space \((\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime})\) the processes \(N_{m}^{1}\), \(N_{m}^{2}\), and \(N_{m}^{3}\), respectively, by for \(t\in[0,T]\), \[N_{m}^{1}(t):=-\bar{\mathbf{u}}_{m}(t)-\int_{0}^{t}[\eta A_{0}\bar{\mathbf{u}}_ {m}(s)+\mathcal{P}_{m}^{1}B_{0}(\bar{\mathbf{u}}_{m}(s),\bar{\mathbf{u}}_{m}(s ))]ds+\mathbf{u}_{0}^{m}+\int_{0}^{t}\mathcal{P}_{m}^{1}R_{0}(\bar{n}_{m}(s), \Phi)ds,\] \[N_{m}^{2}(t):=-\bar{c}_{m}(t)-\int_{0}^{t}[\xi A_{1}\bar{c}_{m}(s)+\mathcal{P} _{m}^{2}B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s))]ds+c_{0}^{m}-\int_{0}^{ t}\mathcal{P}_{m}^{2}R_{1}(\bar{n}_{m}(s),\bar{c}_{m}(s))ds,\] and \[N_{m}^{3}(t):=-\bar{n}_{m}(t)-\int_{0}^{t}[\delta A_{1}\bar{n}_{m}(s)+ \mathcal{P}_{m}^{2}B_{1}(\bar{\mathbf{u}}_{m}(s),\bar{n}_{m}(s))]ds+n_{0}^{m}- \int_{0}^{t}\mathcal{P}_{m}^{2}R_{2}(\bar{n}_{m}(s),\bar{c}_{m}(s))ds.\] **Lemma 4.15**.: _For all \(m\in\mathbb{N}\) and for any \(t\in[0,T]\), we have_ \[N_{m}^{3}(t)=0,\qquad\mathbb{P}^{\prime}\text{-a.s.} \tag{4.82}\] Proof.: Let \(m\in\mathbb{N}\) and \(t\in[0,T]\) be arbitrary but fixed. On the probability space \((\Omega,\mathcal{F},\mathbb{P})\), we define the processes \(M_{m}^{3}(t)\) by \[M_{m}^{3}(t):=-n_{m}(t)-\int_{0}^{t}[\delta A_{1}n_{m}(s)+\mathcal{P}_{m}^{2} B_{1}(\mathbf{u}_{m}(s),n_{m}(s))]ds+n_{0}^{m}-\int_{0}^{t}\mathcal{P}_{m}^{2}R_{2} (n_{m}(s),c_{m}(s))ds.\] We also define the following subsets of \(\Omega\) and \(\Omega^{\prime}\) \[\mathcal{A}_{m}^{N}(t):=\left\{\omega^{\prime}\in\Omega^{\prime}:N_{m}^{3}(t) =0\right\}\text{ and }\mathcal{A}_{m}^{M}(t):=\left\{\omega\in\Omega:M_{m}^{3}(t)=0\right\}.\] We note that, since the last equation of (4.2) holds, \(\mathbb{P}(\mathcal{A}_{m}^{M}(t))=1\). Furthermore, by (4.62), we derive that for all \(\omega^{\prime}\in\Omega\), \(N_{m}^{3}(t,\omega^{\prime})=M_{m}^{3}(t,\Psi_{m}(\omega^{\prime}))\) and therefore we observe that \(\mathcal{A}_{m}^{N}(t)=\Psi_{m}^{-1}(\mathcal{A}_{m}^{M}(t))\). Invoking (4.62) once more, we deduce that \[\mathbb{P}^{\prime}(\mathcal{A}_{m}^{N}(t))=\mathbb{P}^{\prime}(\Psi_{m}^{-1} (\mathcal{A}_{m}^{M}(t)))=\mathbb{P}(\mathcal{A}_{m}^{M}(t))=1,\] which completes the proof of Lemma 4.15. Using the convergences (4.72) and (4.73) as well as Lemma 4.15 we see that for all \(t\in[0,T]\), \(\mathbb{P}^{\prime}\)-a.s. \[n(t)+\int_{0}^{t}[\delta A_{1}n(s)+B_{1}(\mathbf{u}(s),n(s))]ds=n_{0}-\int_{0} ^{t}R_{2}(n(s),c(s))ds,\qquad\text{in }\ H^{-3}(\mathcal{O}). \tag{4.83}\] Now, on the probability space \((\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime})\) we define a the \(\mathbf{H}_{m}\times H_{m}\)-valued processes \(N_{m}\) by \(N_{m}(t)=(N_{m}^{1}(t),N_{m}^{2}(t))\) for all \(m\geq 1\) and \(t\in[0,T]\). Since \[\mathbf{H}_{m}\times H_{m}\subset H\times L^{2}(\mathcal{O})\hookrightarrow V ^{*}\times H^{-2}(\mathcal{O}), \tag{4.84}\] the process \(N_{m}\) can be seen as a \(V^{*}\times H^{-2}(\mathcal{O})\)-valued process. Next, we collect the necessary ingredients for the application of the martingale representation theorem from [12, Theorem 8.2]. To this aim, we consider the following Gelfand triple \(V\hookrightarrow H\hookrightarrow V^{*}\) and \(H^{2}(\mathcal{O})\hookrightarrow L^{2}(\mathcal{O})\hookrightarrow H^{-2}( \mathcal{O})\). Let \(i^{1}:V\hookrightarrow H\) be the usual embedding and \(i^{1*}\) its Hilbert-space-adjoint such that \((ix,y)=(x,i^{1*}y)_{V}\) for all \(x\in V\) and \(y\in H\). In a very similar way, we denote the usual embedding \(H^{2}(\mathcal{O})\hookrightarrow L^{2}(\mathcal{O})\) by \(i^{2}\) and by \(i^{*2}\) its Hilbert-space-adjoint. We define the embedding \(i:V\times H^{2}(\mathcal{O})\hookrightarrow H\times L^{2}(\mathcal{O})\) and its adjoint \(i^{*}:H\times L^{2}(\mathcal{O})\longrightarrow V\times H^{2}(\mathcal{O})\) respectively by \[i=\begin{pmatrix}i^{1}&0\\ 0&i^{2}\end{pmatrix},\qquad i^{*}=\begin{pmatrix}i^{1*}&0\\ 0&i^{2*}\end{pmatrix}.\] Further, we set \(L^{1}=(i^{1*})^{\prime}:V^{*}\longrightarrow H\) as the dual operator of \(i^{1*}\) such that for all \(x\in H\) and \(y\in V^{*}\), \((Ly,x)=\langle y,x\rangle\). Similarly, the dual operator of \(i^{2*}\) will be denoted by \(L^{2}:H^{-2}(\mathcal{O})\longrightarrow L^{2}(\mathcal{O})\). We then define the following dual operator \(L:=(i^{*})^{\prime}:V^{*}\times H^{-2}(\mathcal{O})\longrightarrow H\times L ^{2}(\mathcal{O})\) by \[L=\begin{pmatrix}L^{1}&0\\ 0&L^{2}\end{pmatrix}.\] On the space \(\mathbf{H}_{m}\times H_{m}\), we define a mapping \(G_{m}\) by \[G_{m}(\mathbf{v},\psi)=\begin{pmatrix}L^{1}\mathcal{P}_{m}^{1}g(\mathbf{v}, \psi)&0\\ 0&L^{2}\mathcal{P}_{m}^{2}\phi(\psi)\end{pmatrix},\qquad(\mathbf{v},\psi)\in \mathbf{H}_{m}\times H_{m}.\] Here \((\mathcal{P}_{m}^{1}g(\mathbf{v},\psi),\mathcal{P}_{m}^{2}\phi(\psi))=( \mathcal{P}_{m}^{1}g(\mathbf{v},\psi),\mathcal{P}_{m}^{2}\phi(\psi))\) is seen as an element of \(V^{*}\times H^{-2}(\mathcal{O})\) owing to the inclusion (4.84). In the following lemma, we prove the martingale property of the process \(LN_{m}\). **Lemma 4.16**.: _For each \(m\geqslant 1\), the process \(LN_{m}\) is an \(H\times L^{2}(\mathcal{O})\)-valued continuous square integrable martingale with respect to the filtration_ \[\mathbb{F}^{{}^{\prime}m}=\left\{\sigma\left(\sigma\left((\bar{\mathbf{u}}_{m} (s),\bar{c}_{m}(s),\bar{n}_{m}(s));s\leqslant t\right)\cup\mathcal{N}^{ \prime}\right)\right\}_{t\in[0,T]},\] _where \(\mathcal{N}^{\prime}\) is the set of null sets of \(\mathcal{F}^{\prime}\). The quadratic variation of \(LN_{m}\) is given by_ \[\langle\langle LN_{m}\rangle\rangle_{t}=\int_{0}^{t}G_{m}(\bar{\mathbf{u}}_{m} (s),\bar{c}_{m}(s))G_{m}(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s))^{*}ds, \tag{4.85}\] _where \(G_{m}(\bar{\mathbf{u}}_{m},\bar{c}_{m})^{*}:H\times L^{2}(\mathcal{O}) \rightarrow\mathcal{U}\times\mathbb{R}^{2}\) is the adjoint of the operator \(G_{m}(\bar{\mathbf{u}}_{m},\bar{c}_{m})\) and is given by_ \[G_{m}(\bar{\mathbf{u}}_{m},\bar{c}_{m})^{*}\mathbf{v}=\left(\sum_{k=1}^{\infty }(\mathcal{P}_{m}^{1}g(\bar{\mathbf{u}}_{m},\bar{c}_{m})e_{k},i^{1*}\mathbf{w} )e_{k},\sum_{k=1}^{2}(\mathcal{P}_{m}^{2}\phi(\bar{c}_{m})g_{k},i^{2*}\psi)g_{ k}\right),\] _for all \(\mathbf{v}=(\mathbf{w},\psi)\in H\times L^{2}(\mathcal{O})\)._ Proof.: For any \(m\geqslant 1\) we define the \(V^{*}\times H^{-2}(\mathcal{O})\)-valued processes \(M_{m}\) by \[M_{m}(t)=(M_{m}^{1}(t),M_{m}^{2}(t)),\quad t\in[0,T],\] where \[M_{m}^{1}(t):=-\mathbf{u}_{m}(t)-\int_{0}^{t}[\eta A_{0}\mathbf{u}_{m}(s)+ \mathcal{P}_{m}^{1}B_{0}(\mathbf{u}_{m}(s),\mathbf{u}_{m}(s))]ds+\mathbf{u}_{0 }^{m}+\int_{0}^{t}\mathcal{P}_{m}^{1}R_{0}(n_{m}(s),\Phi)ds,\] \[M_{m}^{2}(t):=-c_{m}(t)-\int_{0}^{t}[\xi A_{1}c_{m}(s)+\mathcal{P}_{m}^{2}B_{1 }(\mathbf{u}_{m}(s),c_{m}(s))]ds+c_{0}^{m}-\int_{0}^{t}\mathcal{P}_{m}^{2}R_{1 }(n_{m}(s),c_{m}(s))ds.\] Let us set \(\mathbf{W}_{s}:=(W_{s},\beta_{s})\). Then, since \((\mathbf{u}_{m},c_{m},n_{m})\) is a solution of the finite dimensional system (4.2), we deduce that \(LM_{m}\) can be represented as \[LM_{m}(t)=\int_{0}^{t}G_{m}(\mathbf{u}_{m}(s),c_{m}(s))d\mathbf{W}_{s},\quad \mathbb{P}\text{-a.s.}\quad\text{for all }t\in[0.T].\] Using the continuity property of the operators \(L^{1}\) and \(L^{2}\) as well as Corollary 4.8, the estimate \[\mathbb{E}\int_{0}^{T}\left|G_{m}(\mathbf{u}_{m}(s),c_{m}(s))\right| _{\mathcal{L}^{2}(\mathcal{U}\times\mathbb{R}^{2},H\times L^{2})}^{2}ds\] \[\leqslant\mathcal{K}\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^ {1}g(\mathbf{u}_{m}(s),c_{m}(s))\right|_{\mathcal{L}^{2}(\mathcal{U},H)}^{2}ds +\mathcal{K}\mathbb{E}\int_{0}^{T}\left|\mathcal{P}_{m}^{2}\phi(c_{m}(s)) \right|_{\mathcal{L}^{2}(\mathbb{R}^{2},L^{2})}^{2}ds\] \[\leqslant\mathcal{K}\mathbb{E}\int_{0}^{T}(1+\left|(\mathbf{u}_{ m}(s),c_{m}(s))\right|_{\mathcal{H}}^{2})ds+\gamma^{2}\sum_{k=1}^{2}\left|\sigma_{k} \right|_{L^{2}}^{2}\mathbb{E}\int_{0}^{T}\left|\nabla c_{m}(s)\right|_{L^{2}} ^{2}ds\] \[\leqslant\mathcal{K}\left(1+\mathbb{E}\sup_{0\leqslant s \leqslant T}\left|(\mathbf{u}_{m}(s),c_{m}(s))\right|_{\mathcal{H}}^{2} \right)+\mathcal{K}\mathbb{E}\sup_{0\leqslant s\leqslant T}\left|\nabla c_{m} (s)\right|_{L^{2}}^{2}<\infty,\] yields that \(M_{m}\) is a square integrable continuous martingale over the probability space \((\Omega,\mathcal{F},(\mathcal{F}_{t})_{t\in[0,T]},\mathbb{P})\). Moreover, from the definition of \(M_{m}\) we derive that for each \(t\in[0.T]\), \(M_{m}(t)\) is measurable with respect to the \(\sigma\)-field \[\mathbb{P}^{m}=\left\{\sigma\left(\sigma\left((\mathbf{u}_{m}(s),c_{m}(s),n_{ m}(s));s\leqslant t\right)\cup\mathcal{N}\right)\right\}_{t\in[0,T]},\] where \(\mathcal{N}\) is the set of null sets of \(\mathcal{F}\). Hence, invoking [12, Theorem 4.27] we infer that \(M_{m}\) is a \(\mathbb{P}^{m}\)-martingale with quadratic variation \[\langle\langle M_{m}\rangle\rangle_{t}=\int_{0}^{t}G_{m}(\mathbf{u}_{m}(s),c_{ m}(s))G_{m}(\mathbf{u}_{m}(s),c_{m}(s))^{*}ds.\] This means that for all \(s,t\in[0,T]\), \(s\leqslant t\), all \(\mathbf{v}_{i}=(\mathbf{w}_{i},\psi_{i})\in H\times L^{2}(\mathcal{O})\), \(i=1,2\), and all bounded and continuous real-valued functions \(h=(h_{1},h_{2},h_{3})\) on \(\mathcal{C}([0,T];H\times L^{2}(\mathcal{O})\times L^{2}(\mathcal{O}))\), we have \[\mathbb{E}\left[(LM_{m}(t)-LM_{m}(s),\mathbf{v}_{1})_{H\times L^{2}(\mathcal{O })}\,h_{1}(\mathbf{u}_{m}|_{[0,s]})h_{2}(c_{m}|_{[0,s]})h_{3}(n_{m}|_{[0,s]}) \right]=0,\] and \[\mathbb{E}\left[\left((LM_{m}(t),\mathbf{v}_{1})_{H\times L^{2}( \mathcal{O})}\,(LM_{m}(t),\mathbf{v}_{2})_{H\times L^{2}(\mathcal{O})}-(LM_{m }(s),\mathbf{v}_{1})_{H\times L^{2}(\mathcal{O})}\,(LM_{m}(s),\mathbf{v}_{2})_ {H\times L^{2}(\mathcal{O})}\right.\] \[\left.-\int_{0}^{t}\left(G_{m}(\mathbf{u}_{m}(s),c_{m}(s))^{*} \mathbf{v}_{1},G_{m}(\mathbf{u}_{m}(s),c_{m}(s))^{*}\mathbf{v}_{2}\right)_{ \mathcal{U}\times\mathbb{R}^{2}}ds\right)\times\] \[\times h_{1}(\mathbf{u}_{m}|_{[0,s]})h_{2}(c_{m}|_{[0,s]})h_{3}(n _{m}|_{[0,s]})\right]=0.\] Since \((\mathbf{u}_{m},c_{m},n_{m})\) and \((\bar{\mathbf{u}}_{m},\bar{c}_{m},\bar{n}_{m})\) have the same laws on \(\mathcal{C}([0,T];\mathcal{H}_{m})\), we deduce from these two last equalities that \[\mathbb{E}^{\prime}\left[\left((LN_{m}(t),\mathbf{v}_{1})_{H\times L^{2}( \mathcal{O})}\,(LN_{m}(t),\mathbf{v}_{2})_{H\times L^{2}(\mathcal{O})}\right.\] \[\left.\qquad-(LN_{m}(s),\mathbf{v}_{1})_{H\times L^{2}(\mathcal{O })}\,(LN_{m}(s),\mathbf{v}_{2})_{H\times L^{2}(\mathcal{O})}\right. \tag{4.87}\] \[\left.\qquad-\int_{0}^{t}\left(G_{m}(\bar{\mathbf{u}}_{m}(s),\bar {c}_{m}(s))^{*}\mathbf{v}_{1},G_{m}(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s))^{ *}\mathbf{v}_{2}\right)_{\mathcal{U}\times\mathbb{R}^{2}}ds\right)\times\] \[\times h_{1}(\bar{\mathbf{u}}_{m}|_{[0,s]})h_{2}(\bar{c}_{m}|_{[0,s ]})h_{3}(\bar{n}_{m}|_{[0,s]})\right]=0, \tag{4.86}\] for all \(s,t\in[0,T]\), \(s\leqslant t\), all \(\mathbf{v}_{i}=(\mathbf{w}_{i},\psi_{i})\in H\times L^{2}(\mathcal{O})\), \(i=1,2\), and all (real-valued) function \(h_{i}\), \(i=1,2,3\) bounded and continuous on \(\mathcal{C}([0,T];\mathcal{H}_{m})\), \(\mathcal{C}([0,T];H_{m})\), and \(\mathcal{C}([0,T];H_{m})\) respectively, This implies that \(LN_{m}\) is a continuous square integrable martingale with respect to \(\mathbb{F}^{\prime\,m}\) and the quadratic variation is given as claimed by equality (4.85). On the new probability space \((\Omega^{\prime},\mathcal{F}^{\prime},\mathbb{P}^{\prime})\), we consider the \(V^{*}\times H^{-2}(\mathcal{O})\)-valued continuous process \(N\) defined by \(N(t)=(N^{1}(t),N^{2}(t))\) for all \(t\in[0,T]\), where \[N^{1}(t) :=-\mathbf{u}(t)-\int_{0}^{t}[\eta A_{0}\mathbf{u}(s)+B_{0}( \mathbf{u}(s),\mathbf{u}(s))]ds+\mathbf{u}_{0}+\int_{0}^{t}R_{0}(n(s),\Phi)ds,\] \[N^{2}(t) :=-c(t)-\int_{0}^{t}[\xi A_{1}c(s)+B_{1}(\mathbf{u}(s),c(s))]ds+c_ {0}-\int_{0}^{t}R_{1}(n(s),c(s))ds.\] In the next lemma, we state that \(LN=(L^{1}N^{1},L^{2}N^{2})\) is also an \(H\times L^{2}(\mathcal{O})\)-valued martingale. **Lemma 4.17**.: _The process \(LN\) is an \(H\times L^{2}(\mathcal{O})\)-valued continuous square integrable martingale with respect to the filtration \(\mathbb{F}^{\prime}=\left\{\sigma\left((\mathbf{u}(s),c(s),n(s));s\leq t \right)\right\}_{t\in[0,T]}\). The quadratic variation is given by_ \[\langle\langle LN\rangle\rangle_{t}=\int_{0}^{t}G(\mathbf{u}(s),c(s))G( \mathbf{u}(s),c(s))^{*}ds,\] _where_ \[G(\mathbf{u},c)=\begin{pmatrix}L^{1}g(\mathbf{u},c)&0\\ 0&L^{2}\phi(c)\end{pmatrix},\] _and \(G(\mathbf{u},c)^{*}:H\times L^{2}(\mathcal{O})\to\mathcal{U}\times\mathbb{R}^ {2}\) is the adjoint of the operator \(G(\mathbf{u},c)\) given by_ \[G(\mathbf{u},c)^{*}\mathbf{v}=\left(\sum_{k=1}^{\infty}(L^{1}g(\mathbf{u}(s), c(s))e_{k},\mathbf{w})e_{k},\sum_{k=1}^{2}(L^{2}\phi(c(s))g_{k},\psi)g_{k} \right),\] _for all \(\mathbf{v}=(\mathbf{w},\psi)\in H\times L^{2}(\mathcal{O})\)._ Proof.: Let \(t\in[0,T]\). We first prove that \(LN\) is an \(H\times L^{2}(\mathcal{O})\)-valued square integrable random variable. Thanks to the continuity of \(L\), it will be sufficient to prove that \(\mathbb{E}\left|N\right|_{V^{*}\times H^{-2}}^{2}<\infty\). Using Lemma 4.13 and Lemma 4.14, we conclude that \[\lim_{m\longrightarrow\infty}N_{m}(t)=N(t)\qquad\mathbb{P}^{\prime}\text{-a.s. \ in}\quad V^{*}\times H^{-2}(\mathcal{O}).\] By the continuity of the injection \(H\times L^{2}(\mathcal{O})\hookrightarrow V^{*}\times H^{-2}(\mathcal{O})\), the Burkholder-Gundy-Davis inequality for continuous martingales and equality (4.85) as well as inequalities (4.67) and (4.69), we have \[\mathbb{E}^{\prime}\sup_{0\leq s\leq T}\left|N_{m}(s)\right|_{V^ {*}\times H^{-2}}^{4} \leq\mathcal{K}\mathbb{E}^{\prime}\sup_{0\leq s\leq T}\left|N_{m}(s) \right|_{L^{2}\times L^{2}}^{4}\] \[\leq\mathcal{K}\mathbb{E}^{\prime}\left(\int_{0}^{T}\left|G_{m}( \bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s))\right|_{\mathcal{L}^{2}(\mathcal{U} \times\mathbb{R}^{2},H\times L^{2})}^{2}ds\right)^{2}\] \[=2\mathcal{K}\mathbb{E}^{\prime}\left(\int_{0}^{T}\left|\mathcal{ P}_{m}^{1}g(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s))\right|_{\mathcal{L}^{2}( \mathcal{U},H)}^{2}ds\right)^{2}\] \[\qquad+2\mathcal{K}\mathbb{E}^{\prime}\left(\int_{0}^{T}\left| \mathcal{P}_{m}^{2}\phi(\bar{c}_{m}(s))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2},L^{2})}^{2}ds\right)^{2}\] \[\leq\mathcal{K}\left(1+\mathbb{E}^{\prime}\sup_{0\leq s\leq T} \left|(\bar{\mathbf{u}}_{m}(s),\bar{c}_{m}(s))\right|_{\mathcal{H}}^{4} \right)+\mathcal{K}\mathbb{E}^{\prime}\sup_{0\leq s\leq T}\left|\nabla\bar{c}_{ m}(s)\right|_{L^{2}}^{4}<\mathcal{K}. \tag{4.88}\] Hence, by the Vitali Theorem, we infer that \(N(t)\in L^{2}(\Omega^{\prime};V^{*}\times H^{-2}(\mathcal{O}))\) and \[\lim_{m\longrightarrow\infty}N_{m}(t)=N(t)\quad\text{ in }\quad L^{2}(\Omega^{ \prime};V^{*}\times H^{-2}(\mathcal{O})).\] Next, let \(\mathbf{v}=(\mathbf{w},\psi)\in V^{*}\times H^{-2}(\mathcal{O})\), and \(h_{i}\), \(i=1,2,3\) be a bounded and continuous function on \(\mathcal{C}([0,T];V^{*})\), \(\mathcal{C}([0,T];H^{-2}(\mathcal{O}))\), and \(\mathcal{C}([0,T];H^{-3}(\mathcal{O}))\) respectively. Let \(s,t\in[0,T]\) such that \(s\leq t\). Let \[F_{m}(t,s):=\left(LN_{m}(t)-LN_{m}(s),\mathbf{v}\right)_{H\times L ^{2}(\mathcal{O})}h_{1}(\bar{\mathbf{u}}_{m}|_{[0,s]})h_{2}(\bar{c}_{m}|_{[0, s]})h_{3}(\bar{n}_{m}|_{[0,s]}),\] \[F(t,s):=\left(LN(t)-LN(s),\mathbf{v}\right)_{H\times L^{2}( \mathcal{O})}h_{1}(\mathbf{u}|_{[0,s]})h_{2}(c|_{[0,s]})h_{3}(n|_{[0,s]}).\] We will prove that \[\lim_{m\longrightarrow\infty}\mathbb{E}^{\prime}F_{m}(t,s)=\mathbb{E}^{\prime }F(t,s). \tag{4.89}\] To this aim, we start by noting that by the \(\mathbb{P}^{\prime}\)-a.s.-convergence \((\bar{\mathbf{u}}_{m},\bar{c}_{m},\bar{n}_{m})\rightarrow(\mathbf{u},c,n)\) in \(\mathcal{Z}\) and Lemma 4.13 as well as Lemma 4.14, we infer that \[\lim_{m\longrightarrow\infty}F_{m}(t,s)=F(t,s),\qquad\mathbb{P}^{\prime}\text{- a.s.}\] We will now show that the function \(\{F_{m}(t,s)\}_{m\geq 1}\) are uniformly integrable. We use the estimate (4.88) to derive that \[\mathbb{E}^{\prime}\left|F_{m}(t,s)\right|^{4} \leq\mathcal{K}\left|h_{1}\right|_{L^{\infty}}^{4}\left|h_{2} \right|_{L^{\infty}}^{4}\left|h_{3}\right|_{L^{\infty}}^{4}\left|\mathbf{v} \right|_{H\times L^{2}}^{4}\mathbb{E}^{\prime}\left[|N_{m}(t)|_{L^{2}\times L ^{2}}^{4}+|N_{m}(s)|_{L^{2}\times L^{2}}^{4}\right]\] \[\leq\mathcal{K}\left|h_{1}\right|_{L^{\infty}}^{4}\left|h_{2} \right|_{L^{\infty}}^{4}\left|h_{3}\right|_{L^{\infty}}^{4}\left|\mathbf{v} \right|_{H\times L^{2}}^{4}.\] Invoking the Vitali Theorem, we get the convergence (4.89). Let \(0\leq s\leq t\leq T\) and \(\mathbf{v}_{i}=(\mathbf{w}_{i},\psi_{i})\in H\times L^{2}(\mathcal{O})\), \(i=1,2\). Let \[Q_{m}(t,s): =\left((LN_{m}(t),\mathbf{v}_{1})_{H\times L^{2}(\mathcal{O})} \left(LN_{m}(t),\mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})}\right.\] \[-\left(LN_{m}(s),\mathbf{v}_{1}\right)_{H\times L^{2}(\mathcal{O} )}\left(LN_{m}(s),\mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})}\right)h_ {1}(\bar{\mathbf{u}}_{m}|_{[0,s]})h_{2}(\bar{c}_{m}|_{[0,s]})h_{3}(\bar{n}_{m}| _{[0,s]}),\] \[Q(t,s): =\left((LN(t),\mathbf{v}_{1})_{H\times L^{2}(\mathcal{O})}\left( LN(t),\mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})}\right.\] \[-\left(LN(s),\mathbf{v}_{1}\right)_{H\times L^{2}(\mathcal{O})} \left(LN(s),\mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})}\right)h_{1}( \mathbf{u}|_{[0,s]})h_{2}(c|_{[0,s]})h_{3}(n|_{[0,s]}).\] Our purpose now is to prove that \[\mathbb{E}^{\prime}Q(t,s)=\lim_{m\longrightarrow\infty}\mathbb{E}^{\prime}Q_{m} (t,s), \tag{4.90}\] imitating the proof before. Indeed, by \(\mathbb{P}^{\prime}\)-a.s.-convergence \((\bar{\mathbf{u}}_{m},\bar{c}_{m},\bar{n}_{m})\rightarrow(\mathbf{u},c,n)\) in \(\mathcal{Z}\) and Lemma 4.13 as well as Lemma 4.14 once more, we obtain \[\lim_{m\longrightarrow\infty}Q_{m}(t,s)=Q(t,s),\qquad\mathbb{P}^{\prime}\text{- a.s.}\] We now prove the uniform integrability of \(Q_{m}(t,s)\). For this purpose, by (4.88) we find that \[\mathbb{E}^{\prime}\left|Q_{m}(t,s)\right|^{2} \leq\mathcal{K}\left|h_{1}\right|_{L^{\infty}}^{2}\left|h_{2} \right|_{L^{\infty}}^{2}\left|h_{3}\right|_{L^{\infty}}^{2}\mathbb{E}^{\prime} \left[\left|(N_{m}(t),\mathbf{v}_{1})_{H\times L^{2}(\mathcal{O})}\left(N_{m} (t),\mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})}\right|^{2}\right.\] \[\qquad\left.+\left|(N_{m}(s),\mathbf{v}_{1})_{H\times L^{2}( \mathcal{O})}\left(N_{m}(s),\mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})} \right|^{2}\right]\] \[\leq\mathcal{K}\left|h_{1}\right|_{L^{\infty}}^{2}\left|h_{2} \right|_{L^{\infty}}^{2}\left|h_{3}\right|_{L^{\infty}}^{2}\left|\mathbf{v}_{1} \right|_{H\times L^{2}}^{2}\left|\mathbf{v}_{2}\right|_{H\times L^{2}}^{2} \mathbb{E}^{\prime}\left[|N_{m}(t)|_{L^{2}\times L^{2}}^{4}+|N_{m}(s)|_{L^{2} \times L^{2}}^{4}\right]\] \[\leq\mathcal{K}\left|h_{1}\right|_{L^{\infty}}^{2}\left|h_{2} \right|_{L^{\infty}}^{2}\left|h_{3}\right|_{L^{\infty}}^{2}\left|\mathbf{v}_{1} ^{2}\right|_{H\times L^{2}}^{2}.\] As before, the Vitali Theorem yields equality (4.90). Finally, we also define \[R_{m}(t,s):= \left(\int_{s}^{t}\left(G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r ))^{*}\mathbf{v}_{1},G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v} _{2}\right)_{\mathcal{U}\times\mathbb{R}^{2}}dr\right)\times\] \[\times h_{1}(\bar{\mathbf{u}}_{m}|_{[0,s]})h_{2}(\bar{c}_{m}|_{[0,s]})h_{3}(\bar{n}_{m}|_{[0,s]}),\] and \[R(t,s):=\left(\int_{s}^{t}\left(G(\mathbf{u}(r),c(r))^{*}\mathbf{v}_{1},G( \mathbf{u}(r),c(r))^{*}\mathbf{v}_{2}\right)_{\mathcal{U}\times\mathbb{R}^{2} }dr\right)h_{1}(\mathbf{u}|_{[0,s]})h_{2}(c|_{[0,s]})h_{3}(n|_{[0,s]}),\] We claim that \[\lim_{m\longrightarrow\infty}\mathbb{E}^{\prime}R_{m}(t,s)=\mathbb{E}^{\prime }R(t,s). \tag{4.91}\] In order to establish this claim we first show that \[\lim_{m\longrightarrow\infty}R_{m}(t,s)=R(t,s),\qquad\mathbb{P}^{\prime}\text{-a.s.} \tag{4.92}\] Since \(h_{1}(\bar{\mathbf{u}}_{m}|_{[0,s]})h_{2}(\bar{c}_{m}|_{[0,s]})h_{3}(\bar{n}_ {m}|_{[0,s]})\to h_{1}(\mathbf{u}|_{[0,s]})h_{2}(c|_{[0,s]})h_{3}(n|_{[0,s]})\)\(\mathbb{P}\)-a.s., in order to prove (4.92), it is sufficient to prove that \[\lim_{m\longrightarrow\infty}\int_{s}^{t}\left(G_{m}(\bar{\mathbf{ u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{1},G_{m}(\bar{\mathbf{u}}_{m}(r), \bar{c}_{m}(r))^{*}\mathbf{v}_{2}\right)_{\mathcal{U}\times\mathbb{R}^{2}}dr \tag{4.93}\] \[=\int_{s}^{t}\left(G(\mathbf{u}(r),c(r))^{*}\mathbf{v}_{1},G( \mathbf{u}(r),c(r))^{*}\mathbf{v}_{2}\right)_{\mathcal{U}\times\mathbb{R}^{2} }dr,\qquad\mathbb{P}^{\prime}\text{-a.s.}\] For all \(r\in[s,t]\), we set \[J(r):= \left(G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v }_{1},G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{2}\right)_{ \mathcal{U}\times\mathbb{R}^{2}}\] \[-\left(LG(\mathbf{u}(r),c(r))^{*}\mathbf{v}_{1},LG(\mathbf{u}(r), c(r))^{*}\mathbf{v}_{2}\right)_{\mathcal{U}\times\mathbb{R}^{2}}.\] Then, we note that \[\int_{s}^{t}|J(r)|\,dz \leq\int_{0}^{T}\left|(G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}( r))^{*}\mathbf{v}_{1}-LG(\mathbf{u}(r),c(r))^{*}\mathbf{v}_{1},G_{m}(\bar{ \mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{2}\right)_{\mathcal{U}\times \mathbb{R}^{2}}\right|dr\] \[\qquad+\int_{0}^{T}\left|(G(\mathbf{u}(r),c(r))^{*}\mathbf{v}_{1},G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{2}-G(\mathbf{u} (r),c(r))^{*}\mathbf{v}_{2}\right)_{\mathcal{U}\times\mathbb{R}^{2}}\right|dr\] \[=I_{1}(m)+I_{2}(m). \tag{4.94}\] Using the Cauchy-Schwarz inequality and the Holder inequality, we derive that \[I_{1}(m)\leq\] \[\qquad\qquad\times\left(\int_{0}^{T}|G_{m}(\bar{\mathbf{u}}_{m}( r),\bar{c}_{m}(r))^{*}\mathbf{v}_{2}|_{\mathcal{U}\times\mathbb{R}^{2}}^{2}dr \right)^{\frac{1}{2}}.\] Owing to the fact that \(\mathcal{P}_{m}^{1}g(\bar{\mathbf{u}}_{m},\bar{c}_{m})e_{k}\in H\) and \(\mathcal{P}_{m}^{2}\phi(\bar{c}_{m})g_{k}\in L^{2}(\mathcal{O})\), we infer that \[(L^{1}\mathcal{P}_{m}^{1}g(\bar{\mathbf{u}}_{m},\bar{c}_{m})e_{k},\mathbf{w}_{ 1}):=\langle\mathcal{P}_{m}^{1}g(\bar{\mathbf{u}}_{m},\bar{c}_{m})e_{k},i^{1*} \mathbf{w}_{1}\rangle=(g(\mathbf{u},c)e_{k},i^{1*}\mathbf{w}_{1}).\] and \[(L^{2}\mathcal{P}_{m}^{2}\phi(\bar{c}_{m})g_{k},\psi_{2}):=\langle\mathcal{P}_ {m}^{2}\phi(\bar{c}_{m})g_{k},i^{2*}\psi_{2}\rangle=(\mathcal{P}_{m}^{2}\phi( \bar{c}_{m})g_{k},i^{2*}\psi_{2}).\] Thus, using the inequality (2.12) and the fact that \(\{e_{k}\}_{k\geqslant 1}\) and \(\{g_{k}\}_{k=1,2}\) are orthonormal basis of \(\mathcal{U}\) and \(\mathbb{R}^{2}\) respectively, we derive that \[\int_{0}^{T}|G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*} \mathbf{v}_{2}|_{\mathcal{U}\times\mathbb{R}^{2}}^{2}\,dr\] \[=\int_{0}^{T}\left(\left|\sum_{k=1}^{\infty}(L^{1}\mathcal{P}_{m}^ {1}g(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))e_{k},\mathbf{w}_{2})e_{k}\right|_ {\mathcal{U}}^{2}+\left|\sum_{k=1}^{2}(L^{2}\mathcal{P}_{m}^{2}\phi(\bar{c}_{m }(r))g_{k},\psi_{2})g_{k}\right|_{\mathbb{R}^{2}}^{2}\right)dr \tag{4.95}\] \[\leqslant\int_{0}^{T}\sum_{k=1}^{\infty}\left|(\mathcal{P}_{m}^{ 1}g(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))e_{k},i^{1*}\mathbf{w}_{2})\right|^ {2}dr+\int_{0}^{T}\sum_{k=1}^{2}\left|(\mathcal{P}_{m}^{2}\phi(\bar{c}_{m}(r) )g_{k},i^{2*}\psi_{2})\right|^{2}dr\] \[\leqslant\left|i^{1*}\mathbf{w}_{2}\right|_{L^{2}}^{2}\int_{0}^{ T}\left|g(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))\right|_{\mathcal{L}^{2}( \mathcal{U},H)}^{2}dr+\left|i^{2*}\psi_{2}\right|_{L^{2}}^{2}\int_{0}^{T}\left| \phi(\bar{c}_{m}(r))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2},L^{2})}^{2}dr\] \[\leqslant\mathcal{K}\int_{0}^{T}(1+\left|(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))\right|_{\mathcal{H}}^{2})dr+\mathcal{K}\int_{0}^{T}\left| \nabla\bar{c}_{m}(r)\right|_{L^{2}}^{2}dr\] \[\leqslant\mathcal{K},\qquad\mathbb{P}^{\prime}\text{-a.s.}\] In the last line we used the fact that \(\bar{c}_{m}\to c\) in \(L^{2}(0,T;H^{1}(\mathcal{O}))\) and \(\bar{\mathbf{u}}_{m}\rightarrow\mathbf{u}\) in \(L^{2}(0,T;H)\)\(\mathbb{P}^{\prime}\)-a.s. On the other hand, we note that \[\int_{0}^{T}|G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*} \mathbf{v}_{1}-G(\mathbf{u}(r),c(r))^{*}\mathbf{v}_{1})|_{\mathcal{U}\times \mathbb{R}^{2}}^{2}\,dr\] \[\leqslant\int_{0}^{T}\left|\left[\sum_{k=1}^{\infty}(L^{1} \mathcal{P}_{m}^{1}g(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))e_{k},\mathbf{w}_ {1})-\sum_{k=1}^{\infty}(L^{1}g(\mathbf{u}(r),c(r))e_{k},\mathbf{w}_{1}) \right]e_{k}\right|_{\mathcal{U}}^{2}dr\] \[\qquad+\int_{0}^{T}\left|\left[\sum_{k=1}^{2}(L^{2}\mathcal{P}_{ m}^{2}\phi(\bar{c}_{m}(r))g_{k},\psi_{1})-\sum_{k=1}^{2}(L^{2}\phi(c(r))g_{k}, \psi_{1})\right]g_{k}\right|_{\mathbb{R}^{2}}^{2}dr.\] Then by this last inequality and the inequality (4.95), we infer that \[I_{1}^{2}(m) \leqslant\mathcal{K}\int_{0}^{T}\left|\sum_{k=1}^{\infty}(g(\bar {\mathbf{u}}_{m}(r),\bar{c}_{m}(r))e_{k},\mathcal{P}_{m}^{1}i^{1*}\mathbf{w}_{ 1})-\sum_{k=1}^{\infty}(g(\mathbf{u}(r),c(r))e_{k},i^{1*}\mathbf{w}_{1}) \right|^{2}dr \tag{4.96}\] \[\qquad+\mathcal{K}\int_{0}^{T}\left|\sum_{k=1}^{2}(\phi(\bar{c}_ {m}(r))g_{k},\mathcal{P}_{m}^{2}i^{2*}\psi_{1})-\sum_{k=1}^{2}(\phi(c(r))g_{k},i^{2*}\psi_{1})\right|^{2}dr\] \[\leqslant\mathcal{K}\left|i^{1*}\mathbf{w}_{1}\right|_{L^{2}}^{2} \int_{0}^{T}\left|g(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))-g(\mathbf{u}(r),c(r ))\right|_{\mathcal{L}^{2}(\mathcal{U},H)}^{2}dr\] \[\qquad+\left|i^{2*}\psi_{1}\right|_{L^{2}}^{2}\int_{0}^{T}\left| \phi(\bar{c}_{m}(r))-\phi(c(r))\right|_{\mathcal{L}^{2}(\mathbb{R}^{2},L^{2})} ^{2}dr\] \[\qquad+\left|\mathcal{P}_{m}^{2}i^{2*}\psi_{1}-i^{2*}\psi_{1} \right|_{L^{2}}^{2}\int_{0}^{T}\left|\phi(\bar{c}_{m}(r))\right|_{\mathcal{L}^ {2}(\mathbb{R}^{2},L^{2})}^{2}dr\] \[:=II_{1}(m)+II_{2}(m)+II_{3}(m)+II_{4}(m).\] By means of the continuity of \(g\), the \(\mathbb{P}^{\prime}\)-a.s.-convergence \((\bar{\mathbf{u}}_{m},\bar{c}_{m},\bar{n}_{m})\to(\mathbf{u},c,n)\) in \(\mathcal{Z}\), the inequality (2.12) and the Vitali Theorem, we can derive that \(\lim_{m\longrightarrow\infty}II_{1}(m)=0\). Furthermore, since \[\int_{0}^{T}|g(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))|^{2}_{ \mathcal{L}^{2}(\mathcal{U},H)}\,dr+\int_{0}^{T}|\phi(\bar{c}_{m}(r))|^{2}_{ \mathcal{L}^{2}(\mathbb{R}^{2},L^{2})}\,dr\] \[\leq\mathcal{K}\int_{0}^{T}(1+|(\bar{\mathbf{u}}_{m}(r),\bar{c}_ {m}(r))|^{2}_{\mathcal{H}})dr+\mathcal{K}\int_{0}^{T}|\nabla\bar{c}_{m}(r)|^{2 }_{L^{2}}\,dr\] \[\leq\mathcal{K}\qquad\mathbb{P}^{\prime}\text{-a.s.},\] we deduce that \[\lim_{m\longrightarrow\infty}II_{2}(m)=\lim_{m\longrightarrow\infty}II_{4}(m)=0.\] Now, we study the \(II_{3}(m)\). We see that \[II_{3}(m) \leq|\psi_{1}|^{2}_{L^{2}}\,\gamma^{2}\,|\sigma|^{2}_{L^{\infty} }\int_{0}^{T}|\nabla\bar{c}_{m}(r)-\nabla c(r)|^{2}_{L^{2}}\,dr\] \[\leq|\psi_{1}|^{2}_{L^{2}}\,\gamma^{2}\,|\sigma|^{2}_{L^{\infty} }\int_{0}^{T}|\bar{c}_{m}(r)-c(r)|^{2}_{H^{1}}\,dr.\] By using the fact that \(\bar{c}_{m}\to c\) in \(L^{2}(0,T;H^{1}(\mathcal{O}))\), \(\mathbb{P}^{\prime}\)-a.s., we can pass to the limit in this last inequality and infer that \(\lim_{m\longrightarrow\infty}II_{3}(m)=0\). Hence passing to the limit in (4.96) we get \(\lim_{m\longrightarrow\infty}I_{1}(m)=0\). In a similar fashion, we can also prove that \(\lim_{m\longrightarrow\infty}I_{2}(m)=0\). Therefore, passing to the limit in (4.94), we obtain the convergence (4.93) and completes the proof of the almost surely convergence (4.92). To finish the proof of equality (4.91), it remains to prove the uniform integrability of \(R_{m}(t,s)\). For this purpose, using the Young inequality, a similar calculations as in inequality (4.95) and the estimates (4.67) and (4.69), we arrive at \[\mathbb{E}^{\prime}\,|R_{m}(t,s)|^{2} \leq\prod_{i=1}^{3}|h_{i}|^{2}_{L^{\infty}}\,\mathbb{E}^{\prime} \left(\int_{s}^{t}(G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v }_{1},G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{2})_{ \mathcal{U}\times\mathbb{R}^{2}}\,dr\right)^{2}\] \[\leq\mathcal{K}(t-s)\mathbb{E}^{\prime}\int_{s}^{t}|G_{m}(\bar{ \mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{1}|^{2}_{\mathcal{U}\times \mathbb{R}^{2}}\,|G_{m}(\bar{\mathbf{u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{ 2}|^{2}_{\mathcal{U}\times\mathbb{R}^{2}}\,dr\] \[\leq\mathcal{K}\mathbb{E}^{\prime}\int_{0}^{T}|G_{m}(\bar{\mathbf{ u}}_{m}(r),\bar{c}_{m}(r))^{*}\mathbf{v}_{1}|^{4}_{\mathcal{U}\times\mathbb{R}^{2}} \,dr+\mathcal{K}\mathbb{E}^{\prime}\int_{0}^{T}|G_{m}(\bar{\mathbf{u}}_{m}(r), \bar{c}_{m}(r))^{*}\mathbf{v}_{2}|^{4}_{\mathcal{U}\times\mathbb{R}^{2}}\,dr\] \[\leq\mathcal{K}\mathbb{E}^{\prime}\int_{0}^{T}|g(\bar{\mathbf{u}} _{m}(r),\bar{c}_{m}(r))|^{4}_{\mathcal{L}^{2}(\mathcal{U},H)}\,dr+\mathcal{K} \mathbb{E}^{\prime}\int_{0}^{T}|\phi(\bar{c}_{m}(r))|^{4}_{\mathcal{L}^{2}( \mathbb{R}^{2},L^{2})}\,dr\] \[\leq\mathcal{K}\mathbb{E}^{\prime}\sup_{0\leq r\leq T}(1+|(\bar{ \mathbf{u}}_{m}(r),\bar{c}_{m}(r))|^{4}_{\mathcal{H}})+\mathcal{K}\mathbb{E}^{ \prime}\sup_{0\leq r\leq T}|\nabla\bar{c}_{m}(r))|^{4}_{L^{2}}\] \[\leq\mathcal{K},\] which prove the uniform integrability of \(R_{m}(t,s)\). Thus, invoking the Vitali Theorem, we obtain the convergence (4.91). Taking into account the convergences (4.89), (4.90) and (4.91), we can pass to the limit in the equalities (4.86) and (4.87) to get \[\mathbb{E}\left[(LN(t)-LN(s),\mathbf{v}_{1})_{H\times L^{2}(\mathcal{O})}\,h_{ 1}(\mathbf{u}|_{[0,s]})h_{2}(c|_{[0,s]})h_{3}(n|_{[0,s]})\right]=0,\] and \[\mathbb{E}\left[\left(\left(LN(t),\mathbf{v}_{1}\right)_{H\times L^{ 2}(\mathcal{O})}\left(LN(t),\mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})} -\left(LN(s),\mathbf{v}_{1}\right)_{H\times L^{2}(\mathcal{O})}\left(LN(s), \mathbf{v}_{2}\right)_{H\times L^{2}(\mathcal{O})}\right.\right.\] \[\left.\left.-\int_{0}^{t}\left(G(\mathbf{u}(s),c(s))^{*}\mathbf{v }_{1},G(\mathbf{u}(s),c(s))^{*}\mathbf{v}_{2}\right)_{\mathcal{U}\times \mathbb{R}^{2}}ds\right)h_{1}(\mathbf{u}|_{[0,s]})h_{2}(c|_{[0,s]})h_{3}(n|_{[ 0,s]})\right]=0,\] which complete the proof of Lemma 4.17. Thanks to Lemma 4.17, we apply the usual martingale representation theorem proved in [12, Theorem 8.2] to the process \(LN\) and conclude that there exists a probability space \((\tilde{\Omega},\tilde{\mathcal{F}},\tilde{\mathbb{P}})\), a filtration \(\tilde{\mathbb{F}}\) and a \(\mathcal{U}\times\mathbb{R}^{2}\)-cylindrical Wiener process \(\tilde{\mathbf{W}}_{s}:=(\bar{W}_{s},\bar{\beta}_{s})\) defined on the probability space \((\bar{\Omega},\tilde{\mathcal{F}},\bar{\mathbb{P}})=(\Omega^{\prime}\times \tilde{\Omega},\mathcal{F}^{\prime}\otimes\tilde{\mathcal{F}},\mathbb{P}^{ \prime}\otimes\tilde{\mathbb{P}})\) adapted to the filtration \(\bar{\mathbb{F}}=\mathbb{F}^{\prime}\otimes\tilde{\mathbb{F}}\) such that \[LN(t,\omega^{\prime},\tilde{\omega})=\int_{0}^{t}G(\mathbf{u}(s,\omega^{ \prime},\tilde{\omega}),c(s,\omega^{\prime},\tilde{\omega}))d\tilde{\mathbf{W }}_{s}(\omega^{\prime},\tilde{\omega}),\qquad t\in[0,T],\qquad(\omega^{\prime},\tilde{\omega})\in\bar{\Omega},\] where \[LN(t,\omega^{\prime},\tilde{\omega})=LN(t,\omega^{\prime}),\ \ (\mathbf{u}(s,\omega^{ \prime},\tilde{\omega}),c(s,\omega^{\prime},\tilde{\omega}))=(\mathbf{u}(s, \omega^{\prime}),c(s,\omega^{\prime})),\ \ t\in[0,T],\ \ (\omega^{\prime},\tilde{\omega})\in\bar{\Omega}.\] This implies that in the probability space \((\bar{\Omega},\tilde{\mathcal{F}},\bar{\mathbb{P}})\), for \(t\in[0,T]\) and \(\bar{\mathbb{P}}\)-a.s. \[\left\{\begin{aligned} & L^{1}N^{1}(t)=\int_{0}^{t}L^{1}g( \mathbf{u}(s),c(s))d\bar{W}_{s},\ \ \text{in}\ \ H,\\ & L^{2}N^{2}(t)=\int_{0}^{t}L^{2}\phi(c(s))d\bar{\beta}_{s},\ \ \text{in}\ \ L^{2}(\mathcal{O}).\end{aligned}\right. \tag{4.97}\] Thanks to (2.12) and (4.70) the estimate \[\bar{\mathbb{E}}\int_{0}^{T}|g(\mathbf{u}(s),c(s))|^{2}_{\mathcal{ L}^{2}(\mathcal{U},V^{*})}\,ds \leq\mathcal{K}\bar{\mathbb{E}}\int_{0}^{T}|g(\mathbf{u}(s),c(s) )|^{2}_{\mathcal{L}^{2}(\mathcal{U},H)}\,ds\] \[\leq\mathcal{K}\left(1+\mathbb{E}^{\prime}\sup_{0\leq s\leq T}|( \mathbf{u}(s),c(s))|^{2}_{\mathcal{H}}\right)<\infty,\] and \[\bar{\mathbb{E}}\int_{0}^{T}|\phi(c(s))|^{2}_{\mathcal{L}^{2}( \mathbb{R}^{2},H^{-2})}\,ds \leq\mathcal{K}\bar{\mathbb{E}}\int_{0}^{T}|\phi(c(s))|^{2}_{ \mathcal{L}^{2}(\mathbb{R}^{2},L^{2})}\,ds\] \[\leq\mathcal{K}\left(1+\mathbb{E}^{\prime}\sup_{0\leq s\leq T}|c(s )|^{2}_{H^{1}}\right)<\infty,\] yield that \(L^{1}N^{1}\) and \(L^{2}N^{2}\) in (4.97) are continuous martingale in \(H\) and \(L^{2}(\mathcal{O})\) respectively. In a similar fashion as in [6, Proof of Theorem 1.1], using the continuity of the operators \(L^{1}\) and \(L^{2}\), we get \[\int_{0}^{t}L^{1}g(\mathbf{u}(s),c(s))d\bar{W}_{s}=L^{1}\left(\int_{0}^{t}g( \mathbf{u}(s),c(s))d\bar{W}_{s}\right)\ \ \text{and}\ \ \int_{0}^{t}L^{2}\phi(c(s))d\bar{\beta}_{s}=L^{2}\left(\int_{0}^{t}\phi(c(s))d \bar{\beta}_{s}\right),\] for all \(t\in[0,T]\). Combining these two last inequalities with the injectivity of the operators \(L^{1}\) and \(L^{2}\), we infer from the system (4.97) that for \(t\in[0,T]\), \[\left\{\begin{aligned} & N^{1}(t)=\int_{0}^{t}g(\mathbf{u}(s),c(s))d \bar{W}_{s},\ \ \text{in}\ \ V^{*},\\ & N^{2}(t)=\int_{0}^{t}\phi(c(s))d\bar{\beta}_{s},\ \ \text{in}\ \ H^{-2}(\mathcal{O}).\end{aligned}\right. \tag{4.98}\] On the new probability space \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{P}})\), we also extend the random variable \(n(t)\) by \[n(t,\omega^{\prime},\tilde{\omega})=n(t,\omega^{\prime}),\ \ t\in[0,T],\ \ (\omega^{\prime},\tilde{\omega})\in\bar{\Omega},\] and infer that the equality (4.83) also holds in \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{P}})\). Using this, the definition of \(N^{1}\) and \(N^{2}\), and the system (4.98), we derive that \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{P}},(\mathbf{u},c,n),(\bar{W}, \bar{\beta}))\) satisfies the system (3.2). In particular, we have for all \(t\in[0,T]\) and \(\bar{\mathbb{P}}\)-a.s. \[\begin{cases}\mathbf{u}(t)=\mathbf{u}_{0}-\int_{0}^{t}[\eta A_{0} \mathbf{u}(s)+B_{0}(\mathbf{u}(s),\mathbf{u}(s))+R_{0}(n(s),\Phi)]ds+\int_{0}^{ t}g(\mathbf{u}(s),c(s))d\bar{W}_{s},\ \ \mbox{in}\ \ V^{*},\\ c(t)=c_{0}-\int_{0}^{t}[\xi A_{1}c(s)+B_{1}(\mathbf{u}(s),c(s))-R_{1}(n(s),c( s))]ds+\gamma\int_{0}^{t}\phi(c(s))d\bar{\beta}_{s},\ \ \mbox{in}\ \ H^{-2}(\mathcal{O}),\end{cases}\] which can be written as \[\begin{cases}\mathbf{u}(t)=\mathbf{u}_{0}-\int_{0}^{t}G_{0}(s)ds+\int_{0}^{t} S_{0}(s)d\bar{W}_{s},\ \ \mbox{in}\ \ V^{*},\\ c(t)=c_{0}-\int_{0}^{t}G_{1}(s)ds+\int_{0}^{t}S_{1}(s)d\bar{\beta}_{s},\ \ \mbox{in}\ \ H^{-2}(\mathcal{O}),\end{cases}\] where for all \(t\in[0,T]\), \[G_{0}(t):=\eta A_{0}\mathbf{u}(t)+B_{0}(\mathbf{u}(t),\mathbf{u} (t))+R_{0}(n(t),\Phi),\] \[G_{1}(t):=\xi A_{1}c(t)+B_{1}(\mathbf{u}(t),c(t))-R_{1}(n(t),c( t)),\] \[S_{0}(t):=g(\mathbf{u}(t),c(t)),\quad\mbox{and}\quad S_{1}(t):= \gamma\phi(c(t)).\] Since the identities (4.66), (4.70) and (4.71) hold, following the idea of the proof of estimate (4.57), we can see that \(G_{0}\in L^{2}([0,T]\times\bar{\Omega};V^{*})\), \(G_{1}\in L^{2}([0,T]\times\bar{\Omega};L^{2}(\mathcal{O}))\), \(S_{0}\in L^{2}([0,T]\times\bar{\Omega};H)\) and \(S_{1}\in L^{2}([0,T]\times\bar{\Omega};H^{1}(\mathcal{O}))\). Therefore, it follows from [23, Theorem 3.2] that there exists \(\bar{\Omega}_{0}\in\bar{\mathcal{F}}\) such that \(\bar{\mathbb{P}}(\bar{\Omega}_{0})=1\) and for all \(\omega\in\bar{\Omega}_{0}\), the function \(\mathbf{u}\) and \(c\) take values in \(H\) and in \(H^{1}(\mathcal{O})\) respectively and are continuous in \(H\) and \(H^{1}(\mathcal{O})\) with respect to \(t\). Owing to the fact that \((\mathbf{u},c,n)\) is \(\mathcal{Z}_{\mathbf{u}}\times\mathcal{Z}_{c}\times\mathcal{Z}_{n}\)-valued random variable and progressively measurable over the filtration \(\bar{\mathbb{F}}\), we derive that \((\bar{\Omega},\bar{\mathcal{F}},\bar{\mathbb{F}},\bar{\mathbb{P}},(\mathbf{u},c,n),(\bar{W},\bar{\beta}))\) is a probabilistic weak solution of system (1.2). We recall that the inequalities (3.1) directly follows from relations (4.66), (4.70), and (4.71). ## 5. Properties of solution and energy inequality In this section we prove the mass conservation property, the non-negativity property and the \(L^{\infty}\)-norm stability for the prrobabilistic strong solution of system (1.2). By these properties, we also prove an energy inequality which may be useful for the study of the invariant measure of system (1.2) which is still an opened problem according to our knowledge. ### Non-negativity and mass conservation The following theorem gives the conservation of the total mass property and the non-negativity of the strong solutions of system (1.2). **Theorem 5.1**.: _Let \(\mathfrak{A}=(\Omega,\mathcal{F},\{\mathcal{F}_{t}\}_{t\in[0,T]},\mathbb{P})\) be a filtered probability space, \(\mathcal{U}\) be a separable Hilbert space, \(W\) be cylindrical Wiener process on \(\mathcal{U}\) over \(\mathfrak{A}\), and \(\beta=(\beta^{1},\beta^{2})\) be a two dimensional standard Brownian motion over \(\mathfrak{A}\) independent of \(W\). If \((\mathbf{u},c,n)\) is a probabilistic strong solution of system (1.2), then the following equality holds for all \(t\in[0,T]\)_ \[\int_{\mathcal{O}}n(t,x)dx=\int_{\mathcal{O}}n_{0}(x)dx,\ \ \mathbb{P}\mbox{-a.s.} \tag{5.1}\] _Furthermore, if \(c_{0}>0\) and \(n_{0}>0\), then the following inequality hold \(\mathbb{P}\)-a.s_ \[n(t)>0,\ \ \text{and}\ \ c(t)>0,\ \ \text{for}\ \ \text{all}\ \ t\in[0,T]. \tag{5.2}\] Proof.: We Note that, the conservation of the total mass (5.1) follows straightforwardly from the fact that \(\nabla\cdot\mathbf{u}=0\) and the proof of (5.2) is very similar to the proof of Lemma 3.6. The following theorem gives the \(L^{\infty}\)-stability of the probabilistic strong solution of system (1.2). **Theorem 5.2**.: _Let \(\mathfrak{A}=(\Omega,\mathcal{F},\{\mathcal{F}_{t}\}_{t\in[0,T]},\mathbb{P})\) be a filtered probability space, \(\mathcal{U}\) be a separable Hilbert space, \(W\) be cylindrical Wiener process on \(\mathcal{U}\) over \(\mathfrak{A}\), and \(\beta=(\beta^{1},\beta^{2})\) be a two dimensional standard Brownian motion over \(\mathfrak{A}\) independent of \(W\). If \((\mathbf{u},c,n)\) is a probabilistic strong solution of system (1.2) in the filtered probability space \(\mathfrak{A}\), then for all \(t\in[0,T]\)_ \[\left|c(t)\right|_{L^{\infty}}\leqslant\left|c_{0}\right|_{L^{\infty}},\ \ \ \mathbb{P}\text{-a.s.} \tag{5.3}\] Proof.: The proof is similar to the proof of Corollary 3.7. ### Energy inequality In this subsection, we will derive an energy inequality. The probabilistic strong solution \((\mathbf{u},n,c)\) involving the following Lyapunov functional \[\mathcal{E}(n,c,\mathbf{u})(t)=\int_{\mathcal{O}}n(t)\ln n(t)dx+\mathcal{K}_{f }\left|\nabla c(t)\right|_{L^{2}}^{2}+\frac{8\mathcal{K}_{f}\mathcal{K}_{GN} \left|c_{0}\right|_{L^{\infty}}^{2}}{3\xi\eta}\left|\mathbf{u}(t)\right|_{L^{2 }}^{2}+e^{-1}\left|\mathcal{O}\right|,\ \ \ t\in[0,T],\] where \(\mathcal{K}_{GN}\) is a constant given by the Gagliardo-Niremberg inequality (3.7) and \(\mathcal{K}_{f}\) is defined in (2.2). **Proposition 5.3**.: _Suppose that Assumption 1, Assumption 2 and the following inequality_ \[\frac{4\mathcal{K}_{f}\max_{0\leqslant c\leqslant\left|c_{0}\right|_{L^{ \infty}}}f^{2}}{\min_{0\leqslant c\leqslant\left|c_{0}\right|_{L^{\infty}}}f^{ \prime}}\leqslant\delta, \tag{5.4}\] _are satisfied. Let \(\mathfrak{A}=(\Omega,\mathcal{F},\{\mathcal{F}_{t}\}_{t\in[0,T]},\mathbb{P})\) be a filtered probability space, \(\mathcal{U}\) be a separable Hilbert space, \(W\) be cylindrical Wiener process on \(\mathcal{U}\) over \(\mathfrak{A}\), and \(\beta=(\beta^{1},\beta^{2})\) be a two dimensional standard Brownian motion over \(\mathfrak{A}\) independent of \(W\). Then, any probabilistic strong solution \((\mathbf{u},c,n)\) of system (1.2) in the filtered probability space \(\mathfrak{A}\) satisfies the following entropy functional relations for almost all \(t\in[0,T]\),_ \[\left|c(t)\right|_{L^{2}}^{2}+2\eta\int_{0}^{t}\left|\nabla c(s)\right|_{L^{2 }}^{2}ds+2\int_{0}^{t}(n(s)f(c(s)),c(s))ds=\left|c_{0}\right|_{L^{2}}^{2}, \tag{5.5}\] (5.6) \[\mathcal{E}(n,c,\mathbf{u})(t) +\int_{0}^{t}\left[\delta\left|\nabla\sqrt{n(s)}\right|_{L^{2}}^{ 2}+\frac{3\xi\mathcal{K}_{f}}{2}\left|\Delta c(s)\right|_{L^{2}}^{2}+\frac{8 \mathcal{K}_{f}\mathcal{K}_{GN}\left|c_{0}\right|_{L^{\infty}}^{2}}{3\xi} \left|\nabla\mathbf{u}(s)\right|_{L^{2}}^{2}+\left|\sqrt{n(s)}\nabla c(s) \right|_{L^{2}}^{2}\right]ds\] \[\leqslant\mathcal{E}(n_{0},c_{0},\mathbf{u}_{0})+\mathcal{K}_{5} t+\mathcal{K}_{6}\int_{0}^{t}\left|\mathbf{u}(s)\right|_{L^{2}}^{2}ds+\gamma^{2} \mathcal{K}_{f}\int_{0}^{t}\left|\nabla\phi(c(s))\right|_{\mathcal{L}^{2}( \mathbb{R}^{2};L^{2})}^{2}ds\] \[\ \ Proof.: The equality (5.5) follows directly from the application of the Ito formula to \(t\mapsto\left|c(t)\right|_{L^{2}}^{2}\) and the fact that \[(B_{1}(\mathbf{u},c),c)=\frac{1}{2}\int_{\mathcal{O}}\mathbf{u}(x)\cdot\nabla c ^{2}(x)dx=-\frac{1}{2}\int_{\mathcal{O}}c^{2}(x)\nabla\cdot\mathbf{u}(x)dx=0,\] as well as \[(\phi(c),c)=\sum_{k=1}^{2}\int_{\mathcal{O}}\sigma_{k}(x)\cdot\nabla c(x)c(x)dx =\frac{1}{2}\sum_{k=1}^{2}\int_{\mathcal{O}}\sigma_{k}(x)\cdot\nabla c^{2}(x)dx=0\] and \[\left|\phi(c)\right|_{\mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}=\left|\nabla c \right|_{L^{2}}^{2}.\] Next, we multiply equation (2.14)\({}_{3}\) by \(1+\ln n(s)\) for \(s\in[0,t]\) and integrate the resulting equation in \(\mathcal{O}\) to obtain \[\frac{d}{dt}\int_{\mathcal{O}}n(s,x)\ln n(s,x)dx+\delta\int_{\mathcal{O}}\frac {\left|\nabla n(s,x)\right|^{2}}{n(s,x)}dx=\chi\int_{\mathcal{O}}\nabla n(s,x )\cdot\nabla c(s,x)dx. \tag{5.7}\] Thanks to the Young inequality and the Cauchy-Schwartz inequality we note that \[\chi\int_{\mathcal{O}}\nabla n(x)\cdot\nabla c(x)dx\leq 2\delta\int_{ \mathcal{O}}\left|\nabla\sqrt{n(x)}\right|^{2}dx+\frac{\chi^{2}}{2\delta}\int _{\mathcal{O}}n(x)\left|\nabla c(x)\right|^{2}dx.\] Combining the last inequality with equality (5.7) we arrive at \[\int_{\mathcal{O}}n(t,x)\ln n(t,x)dx+2\delta\int_{0}^{t}\left| \nabla\sqrt{n(s)}\right|_{L^{2}}^{2}ds\leq \int_{\mathcal{O}}n_{0}(x)\ln n_{0}(x)dx \tag{5.8}\] \[\qquad\qquad+\frac{\chi^{2}}{2\delta}\int_{0}^{t}\left|\sqrt{n(s )}\nabla c(s)\right|_{L^{2}}^{2}ds.\] By applying the Ito formula to \(t\mapsto\left|\nabla c(t)\right|_{L^{2}}^{2}\), we find that \[\left|\nabla c(t)\right|_{L^{2}}^{2}+2\xi\int_{0}^{t}\left| \Delta c(s)\right|_{L^{2}}^{2}ds= \left|\nabla c_{0}\right|_{L^{2}}^{2}-2\int_{0}^{t}(\nabla B_{1} (\mathbf{u}(s),c(s)),\nabla c(s))ds\] \[-2\int_{0}^{t}(\nabla R_{2}(n(s),c(s)),\nabla c(s))ds \tag{5.9}\] \[+\gamma^{2}\int_{0}^{t}\left|\nabla\phi(c(s))\right|_{\mathcal{L} ^{2}(\mathbb{R}^{2};L^{2})}^{2}+2\gamma\int_{0}^{t}(\nabla\phi(c(s)),\nabla c (s))d\beta_{s}.\] Due to the Assumption \(1\) and the \(L^{\infty}\)-norm stability obtained in Theorem 5.2, we obtain \[(\nabla B_{1}(\mathbf{u},c),\nabla c) \leq\left|\nabla\mathbf{u}\right|_{L^{2}}\left|\nabla c\right|_{L ^{4}}^{2}\] \[\leq\frac{3\xi}{16\mathcal{K}_{GN}\left|c_{0}\right|_{L^{\infty}} ^{2}}\left|\nabla c\right|_{L^{4}}^{4}+\frac{4\mathcal{K}_{GN}\left|c_{0} \right|_{L^{\infty}}^{2}}{3\xi}\left|\nabla\mathbf{u}\right|_{L^{2}}^{2}\] \[\leq\frac{\xi}{4}\left|\Delta c\right|_{L^{2}}^{2}+\frac{4\mathcal{ K}_{GN}\left|c_{0}\right|_{L^{\infty}}^{2}}{3\xi}\left|\nabla\mathbf{u}\right|_{L^{2}}^ {2}+\frac{\xi(4\mathcal{K}_{2}+3)}{16}\left|c_{0}\right|_{L^{\infty}}^{2}.\] and \[-(\nabla R_{2}(n,c),\nabla c(s))ds \leq-\frac{\min_{0\leq c\leq|c0|_{L^{\infty}}}f^{\prime}(c)}{2}\int_ {\mathcal{O}}n(x)\left|\nabla c(x)\right|^{2}dx\] \[\qquad+\frac{1}{2\min_{0\leq c\leq|c0|_{L^{\infty}}}f^{\prime}} \int_{\mathcal{O}}f^{2}(c(x))\frac{\left|\nabla n(x)\right|^{2}}{n(x)}dx\] \[\leq-\frac{\min_{0\leq c\leq|c0|_{L^{\infty}}}f^{\prime}(c)}{2} \left|\sqrt{n}\nabla c\right|_{L^{2}}^{2}+\frac{2\max_{0\leq c\leq|c0|_{L^{ \infty}}}f^{2}}{\min_{0\leq c\leq|c0|_{L^{\infty}}}f^{\prime}(c)}\left|\sqrt{n }\right|_{L^{2}}^{2}.\] Thus, we see from (5.9) that \[\left|\nabla c(t)\right|_{L^{2}}^{2} +\frac{3\xi}{2}\int_{0}^{t}\left|\Delta c(s)\right|_{L^{2}}^{2}ds +\min_{0\leq c\leq|c0|_{L^{\infty}}}f^{\prime}\int_{0}^{t}\left|\sqrt{(s)} \nabla c(s)\right|_{L^{2}}^{2}ds\] \[\leq\left|\nabla c_{0}\right|_{L^{2}}^{2}+\frac{\xi(4\mathcal{K} _{2}+3)}{8}\left|c_{0}\right|_{L^{\infty}}^{2}t+\frac{8\mathcal{K}_{GN}\left|c _{0}\right|_{L^{\infty}}^{2}}{3\xi}\int_{0}^{t}\left|\nabla\mathbf{u}(s) \right|_{L^{2}}^{2}ds\] \[\qquad+\frac{4\max_{0\leq c\leq|c0|_{L^{\infty}}}f^{2}}{\min_{0 \leq c\leq|c0|_{L^{\infty}}}f^{\prime}}\int_{0}^{t}\left|\nabla\sqrt{n(s)} \right|_{L^{2}}^{2}ds\] \[\qquad+\gamma^{2}\int_{0}^{t}\left|\nabla\phi(c(s))\right|_{ \mathcal{L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds+2\gamma\int_{0}^{t}(\nabla\phi(c (s)),\nabla c(s))d\beta_{s}.\] Now, we multiply this last inequality by \(\mathcal{K}_{f}\), add the result with inequality (5.8), and use the inequality (5.4) to obtain \[\int_{\mathcal{O}}n(t,x)\ln n(t,x)dx +\mathcal{K}_{f}\left|\nabla c(t)\right|_{L^{2}}^{2}+\frac{3\xi \mathcal{K}_{f}}{2}\int_{0}^{t}\left|\Delta c(s)\right|_{L^{2}}^{2}ds \tag{5.10}\] \[\qquad+2\delta\int_{0}^{t}\left|\nabla\sqrt{n(s)}\right|_{L^{2} }^{2}ds+\int_{0}^{t}\left|\sqrt{n(s)}\nabla c(s)\right|_{L^{2}}^{2}ds\] \[\leq\mathcal{K}_{f}\left|\nabla c_{0}\right|_{L^{2}}^{2}+\int_{ \mathcal{O}}n_{0}(x)\ln n_{0}(x)dx+\frac{\mathcal{K}_{f}\xi(4\mathcal{K}_{f} \mathcal{K}_{2}+3)}{8}\left|c_{0}\right|_{L^{\infty}}^{2}t\] \[\qquad+\frac{8\mathcal{K}_{f}\mathcal{K}_{GN}\left|c_{0}\right|_ {L^{2}}^{2}}{3\xi}\int_{0}^{t}\left|\nabla\mathbf{u}(s)\right|_{L^{2}}^{2}ds +\gamma^{2}\mathcal{K}_{f}\int_{0}^{t}\left|\nabla\phi(c(s))\right|_{\mathcal{ L}^{2}(\mathbb{R}^{2};L^{2})}^{2}ds\] \[\qquad+2\gamma\mathcal{K}_{f}\int_{0}^{t}(\nabla\phi(c(s)),\nabla c (s))d\beta_{s}.\] Using the equality (5.1) and the inequality (3.7) we note that \[\left|n\right|_{L^{2}} \leq\mathcal{K}_{GN}\left(\left|\sqrt{n}\right|_{L^{2}}\left| \nabla\sqrt{n}\right|_{L^{2}}+\left|\sqrt{n}\right|_{L^{2}}^{2}\right) \tag{5.11}\] \[\leq\mathcal{K}_{GN}\left(\left|n_{0}\right|_{L^{1}}^{\frac{1}{2} }\left|\nabla\sqrt{n}\right|_{L^{2}}+\left|n_{0}\right|_{L^{1}}\right),\] which altogether with the Ito formula to \(t\mapsto\left|\mathbf{u}(t)\right|_{L^{2}}^{2}\) implies the existence of \(\mathcal{K}_{3}>0\) such that \[\begin{split}\left|\mathbf{u}(t)\right|_{L^{2}}^{2}+2\eta\int_{0}^ {t}\left|\nabla\mathbf{u}(s)\right|_{L^{2}}^{2}ds&\leq 2\int_{0}^{t}\left| \nabla\Phi\right|_{L^{\infty}}\left|n(s)\right|_{L^{2}}\left|\mathbf{u}(s) \right|_{L^{2}}ds\\ &\qquad+\int_{0}^{t}\left|g(\mathbf{u}(s),c(s))\right|_{\mathcal{ L}^{2}(\mathcal{U};H)}^{2}ds+2\int_{0}^{t}(g(\mathbf{u}(s),c(s)),\mathbf{u}(s)) dWs\\ &\leq\left|\mathbf{u}_{0}\right|_{L^{2}}^{2}+\frac{\delta\eta}{ \mathcal{K}_{4}}\int_{0}^{t}\left|\nabla\sqrt{n(s)}\right|_{L^{2}}^{2}ds+ \mathcal{K}_{3}\left|\nabla\Phi\right|_{L^{\infty}}^{2}\left|n_{0}\right|_{L^ {1}}\int_{0}^{t}\left|\mathbf{u}(s)\right|_{L^{2}}^{2}ds\\ &\qquad+\frac{1}{2}t+\frac{1}{2}\left|\nabla\Phi\right|_{L^{ \infty}}^{2}\left|n_{0}\right|_{L^{1}}^{2}\int_{0}^{t}\left|\mathbf{u}(s) \right|_{L^{2}}^{2}ds\\ &\qquad+\int_{0}^{t}\left|g(\mathbf{u}(s),c(s))\right|_{\mathcal{ L}^{2}(\mathcal{U};H)}^{2}ds+2\int_{0}^{t}(g(\mathbf{u}(s),c(s)),\mathbf{u}(s)) dWs,\end{split} \tag{5.12}\] with \(\mathcal{K}_{4}=\frac{8\mathcal{K}_{f}\mathcal{K}_{GN}\left|c_{0}\right|_{L^{ \infty}}^{2}}{3\xi}\). Multiplying the inequality (5.12) by \(\frac{\mathcal{K}_{4}}{\eta}\), and adding the result with inequality (5.10), we obtain some positive constants \(\mathcal{K}_{5}\) and \(\mathcal{K}_{6}\) such that the inequality (5.6) holds. ## Appendix A Compactness and tightness criteria In this appendix we recall several compactness and tightness criteria that are frequently used in this paper. We start with the following lemma based on the Dubinsky Theorem. **Lemma A.1**.: _Let us consider the space_ (A.1) \[\tilde{\mathcal{Z}}_{0}=L_{w}^{2}(0,T;H^{1}(\mathcal{O}))\cap L^{2}(0,T;L^{2} (\mathcal{O}))\cap\mathcal{C}([0,T];H^{-3}(\mathcal{O}))\] _and \(\tilde{\mathcal{T}}_{0}\) be the supremum of the corresponding topologies. Then a set \(\bar{\bar{K}}_{0}\subset\tilde{\mathcal{Z}}_{0}\) is \(\tilde{\mathcal{T}}_{0}\)-relatively compact if the following three conditions hold_ * \(\sup\limits_{\varphi\in\bar{\bar{K}}_{0}}\int_{0}^{T}\left|\varphi(s)\right|_{ H^{1}}^{2}ds<\infty\)_, i.e.,_ \(\bar{\bar{K}}_{0}\) _is bounded in_ \(L^{2}(0,T;H^{1}(\mathcal{O}))\)_,_ * \(\exists\gamma>0\)_:_ \(\sup\limits_{\varphi\in\bar{\bar{K}}_{0}}\left|\varphi\right|_{C^{\gamma}([0,T ];H^{-3})}<\infty\)_._ Proof.: We note that the following embedding is continuous \(H^{1}(\mathcal{O})\hookrightarrow L^{2}(\mathcal{O})\hookrightarrow H^{-3}( \mathcal{O})\) with \(H^{1}(\mathcal{O})\hookrightarrow L^{2}(\mathcal{O})\) compact. By the Banach-Alaoglu Theorem condition (a) yields that \(\bar{\bar{K}}_{0}\) is compact in \(L_{w}^{2}(0,T;H^{1}(\mathcal{O}))\). Moreover (b) implies that the functions \(\varphi\in\bar{\bar{K}}_{0}\) are equicontinuous, i.e. for all \(\varepsilon>0\), there exists \(\delta>0\) such that if \(\left|t-s\right|<\delta\) then \(\left|\varphi(t)-\varphi(s)\right|_{H^{-3}}<\varepsilon\) for all \(\varphi\in\bar{\bar{K}}_{0}\). We can then apply Dubinsky's Theorem (see [41, Theorem IV.4.1]) since by condition (a), \(\bar{K}_{0}\) is bounded in \(L^{2}(0,T;H^{1}(\mathcal{O}))\). Following the same method as in [8, Lemma 3.3 ], we obtain the following compactness result. **Lemma A.2**.: _Let us consider the space_ (A.2) \[\tilde{\mathcal{Z}}_{n}=L_{w}^{2}(0,T;H^{1}(\mathcal{O}))\cap L^{2}(0,T;L^{2} (\mathcal{O}))\cap\mathcal{C}([0,T];H^{-3}(\mathcal{O}))\cap\mathcal{C}([0,T]; L_{w}^{2}(\mathcal{O})),\] _and \(\tilde{\mathcal{T}}_{0}\) be the supremum of the corresponding topologies. Then a set \(\bar{\bar{K}}_{0}\subset\tilde{\mathcal{Z}}_{n}\) is \(\tilde{\mathcal{T}}_{0}\)-relatively compact if the following three conditions hold_ * \(\sup\limits_{\varphi\in\bar{K}_{0}}|\varphi|_{L^{\infty}(0,T;L^{2})}<\infty\), * \(\sup\limits_{\varphi\in\bar{K}_{0}}\int\limits_{0}^{T}|\varphi(s)|_{H^{1}}^{2}ds<\infty\), i.e., \(\bar{\bar{K}}_{0}\) is bounded in \(L^{2}(0,T;H^{1}(\mathcal{O}))\), * \(\exists\gamma>0\): \(\sup\limits_{\varphi\in\bar{K}_{0}}|\varphi|_{C^{\gamma}([0,T];H^{-3})}<\infty\). From this lemma we also get the following tightness criteria for stochastic processes with paths in \(\tilde{\mathcal{Z}}_{n}\) where the proof is the same as the proof of [3, Lemma 5.5]. **Lemma A.3** (Tightness criterion for \(n\)).: _Let \(\gamma>0\) be a given parameters and \((\varphi_{n})_{n}\) be a sequence of continuous \(\{\mathcal{F}_{t}\}_{t\in[0,T]}\)-adapted \(H^{-3}(\mathcal{O})\)-valued processes. Let \(\mathcal{L}_{m}\) be the law of \(\varphi_{n}\) on \(\tilde{\mathcal{Z}}_{n}\). If for any \(\varepsilon>0\) there exists a constant \(\mathcal{K}_{i}\), \(i=1,...,3\) such that_ \[\sup\limits_{m}\mathbb{P}\left(|\varphi_{m}|_{L^{\infty}(0,T;L^{2})}>K_{1} \right)\leq\varepsilon,\] \[\sup\limits_{m}\mathbb{P}\left(|\varphi_{m}|_{L^{2}(0,T;H^{1})}>K_{2}\right) \leq\varepsilon,\] \[\sup\limits_{m}\mathbb{P}\left(|\varphi_{m}|_{C^{\gamma}(0,T;H^{-3})}>K_{3} \right)\leq\varepsilon,\] _then the sequence \((\mathcal{L}_{m})_{m}\) is tight on \(\tilde{\mathcal{Z}}_{n}\)._ The following compactness results are due to [7, Theorem 4.4 and Theorem 4.5] (see also [28]), where we can see the details of the proof. **Lemma A.4**.: _Let us consider the space_ (A.3) \[\tilde{\mathcal{Z}}_{\mathbf{u}}=L_{w}^{2}(0,T;V)\cap L^{2}(0,T;H)\cap \mathcal{C}([0,T];V^{*})\cap\mathcal{C}([0,T];H_{w}),\] _and \(\tilde{\mathcal{T}}_{1}\) be the supremum of the corresponding topologies. Then a set \(\bar{K}_{1}\subset\tilde{\mathcal{Z}}_{\mathbf{u}}\) is \(\tilde{\mathcal{T}}_{1}\)-relatively compact if the following three conditions hold_ * \(\sup\limits_{\mathbf{v}\in\bar{K}_{1}}\sup\limits_{t\in[0,T]}|\mathbf{v}(t)|_ {L^{2}}<\infty\)_,_ * \(\sup\limits_{\mathbf{v}\in\bar{K}_{1}}\int\limits_{0}^{T}|\nabla\mathbf{v}(s )|_{L^{2}}^{2}ds<\infty\)_, i.e.,_ \(\bar{\bar{K}}_{2}\) _is bounded in_ \(L^{2}(0,T;V)\)_,_ * \(\lim\limits_{\delta\to 0}\sup\limits_{\mathbf{v}\in\bar{K}_{1}}\sup \limits_{s,t\in[0,T],|t-s|\leq\delta}|\mathbf{v}(t)-\mathbf{v}(s)|_{V^{*}}=0\)_._ **Lemma A.5**.: _Let us consider the space_ (A.4) \[\tilde{\mathcal{Z}}_{c}=L_{w}^{2}(0,T;H^{2}(\mathcal{O}))\cap L^{2}(0,T;H_{w}^ {1}(\mathcal{O}))\cap\mathcal{C}([0,T];L^{2}(\mathcal{O}))\cap\mathcal{C}([0, T];H_{w}^{1}(\mathcal{O})),\] _and \(\tilde{\mathcal{T}}_{2}\) be the supremum of the corresponding topologies. Then a set \(\bar{K}_{2}\subset\tilde{\mathcal{Z}}_{c}\) is \(\tilde{\mathcal{T}}_{2}\)-relatively compact if the following three conditions hold_ * \(\sup\limits_{\varphi\in\bar{K}_{2}}\sup\limits_{t\in[0,T]}|\varphi(t)|_ {H^{1}}<\infty\)_,_ * \(\sup\limits_{\varphi\in\bar{K}_{2}}\int\limits_{0}^{T}|\varphi(s)|_ {H^{2}}^{2}ds<\infty\)_, i.e.,_ \(\bar{\bar{K}}_{2}\) _is bounded in_ \(L^{2}(0,T;H^{2}(\mathcal{O}))\)_,_ * \(\lim\limits_{\delta\to 0}\sup\limits_{\varphi\in\bar{K}_{2}}\sup \limits_{s,t\in[0,T],|t-s|\leq\delta}|\varphi(t)-\varphi(s)|_{L^{2}}=0\)_._ We now consider a filtered probability space \((\Omega,\mathcal{F},\mathbb{P})\) with filtration \(\mathbb{F}:=\left\{\mathcal{F}_{t}\right\}_{t\geq 0}\) satisfying the usual hypotheses. Let \((\mathbb{M},d_{1})\) be a complete, separable metric space and \((y_{n})_{n\in\mathbb{N}}\) be a sequence of \(\mathbb{F}\)-adapted and \(\mathbb{M}\)-valued processes. We recall from [20] the following definition. **Definition A.6**.: A sequence \((y_{n})_{n\in\mathbb{N}}\) satisfies the **Aldous condition** in the space \(\mathbb{M}\) if and only if \(\forall\epsilon>0\ \ \forall\zeta>0\ \ \exists\delta>0\) such that for every sequence \((\tau_{n})_{n\in\mathbb{N}}\) of \(\mathbb{F}\)-stopping times with \(\tau_{n}\leq T\) one has \(\sup_{n\in\mathbb{N}}\sup_{0\leq\theta\leq\delta}\mathbb{P}\left\{|y_{n}(\tau_ {n}+\theta)-y_{n}(\tau_{n})|_{\mathbb{M}}\geq\zeta\right\}\leq\epsilon\). In Definition A.6, and throughout we understand that \(y_{n}\) is extended to zero outside the interval \([0,T]\). The following lemma is proved in [28, Appendix A, Lemma 6.3]. **Lemma A.7**.: _Let \((X,|.|_{X})\) be a separable Banach space and let \((y_{n})_{n\in\mathbb{N}}\) be a sequence of \(X\)-valued random variables. Assume that for every \((\tau_{n})_{n\in\mathbb{N}}\) of \(\mathbb{F}\)-stoppings times with \(\tau_{n}\leq T\) and for every \(n\in\mathbb{N}\) and \(\theta\geq 0\) the following condition holds_ (A.5) \[\mathbb{E}\left|y_{n}(\tau_{n}+\theta)-y_{n}(\tau_{n})\right|_{X}^{\alpha} \leq C\theta^{\beta},\] _for some \(\alpha,\beta>0\) and some constant \(C>0\). Then the sequence \((y_{n})_{n\in\mathbb{N}}\) satisfies the **Aldous condition** in the space \(X\)._ In the view of Lemma A.4 and Lemma 4.2, in the next corollaries, we will state a tightness criteria for stochastic processes with part in \(\tilde{\mathcal{Z}}_{\mathbf{u}}\) or in \(\tilde{\mathcal{Z}}_{c}\). **Corollary A.8**.: _Let \((\mathbf{v}_{m})_{m}\) be a sequence of continuous \(\{\mathcal{F}_{t}\}_{t\in[0,T]}\)-adapted \(V\)*-valued processes satisfying_ **(a):**: _there exists a constant_ \(\mathcal{K}_{1}>0\) _such that_ \(\sup_{m}\mathbb{E}\sup_{0\leq s\leq T}|\mathbf{v}_{m}(s)|_{L^{2}}^{2}\leq \mathcal{K}_{1},\)__ **(b):**: _there exists a constant_ \(\mathcal{K}_{2}>0\) _such that_ \(\sup_{m}\int_{0}^{T}|\nabla\mathbf{v}_{m}(s)|_{L^{2}}^{2}\,ds\leq\mathcal{K}_ {2},\)__ **(c):**: \((\mathbf{v}_{m})_{m}\) _satisfies the_ **Aldous condition** _in_ \(V\)*_._ _Let \(\mathcal{L}_{m}(\mathbf{v}_{m})\) be the law of \(\mathbf{v}_{m}\) on \(\tilde{\mathcal{Z}}_{\mathbf{u}}\). Then, the sequence \((\mathcal{L}_{m}(\mathbf{v}_{m}))_{m}\) is tight in \(\tilde{\mathcal{Z}}_{\mathbf{u}}\)._ **Corollary A.9**.: \((v_{m})_{m}\) _be a sequence of continuous \(\{\mathcal{F}_{t}\}_{t\in[0,T]}\)-adapted \(L^{2}(\mathcal{O})\)-valued processes satisfying_ **(a):**: _there exists a constant_ \(\mathcal{K}_{1}>0\) _such that_ \(\sup_{m}\mathbb{E}\sup_{0\leq s\leq T}|v_{m}(s)|_{H^{1}}^{2}\leq\mathcal{K}_ {1},\)__ **(b):**: _there exists a constant_ \(\mathcal{K}_{2}>0\) _such that_ \(\sup_{m}\int_{0}^{T}|v_{m}(s)|_{H^{2}}^{2}\,ds\leq\mathcal{K}_{2},\)__ **(c):**: \((v_{m})_{m}\) _satisfies the_ **Aldous condition** _in_ \(L^{2}(\mathcal{O})\)_._ _Let \(\mathcal{L}_{m}(v_{m})\) be the law of \(v_{m}\) on \(\tilde{\mathcal{Z}}_{c}\). Then, the sequence \((\mathcal{L}_{m}(v_{m}))_{m}\) is tight in \(\tilde{\mathcal{Z}}_{c}\)._ ## Acknowledgment We acknowledge financial support provided by the Austrian Science Fund (FWF). In particular, Boris Jidjou Moghomye and partially Erika Hausenblas were supported by the Austrian Science Fund, project 32295.

2303.11120

Positional Diffusion: Ordering Unordered Sets with Diffusion Probabilistic Models

Positional reasoning is the process of ordering unsorted parts contained in a set into a consistent structure. We present Positional Diffusion, a plug-and-play graph formulation with Diffusion Probabilistic Models to address positional reasoning. We use the forward process to map elements' positions in a set to random positions in a continuous space. Positional Diffusion learns to reverse the noising process and recover the original positions through an Attention-based Graph Neural Network. We conduct extensive experiments with benchmark datasets including two puzzle datasets, three sentence ordering datasets, and one visual storytelling dataset, demonstrating that our method outperforms long-lasting research on puzzle solving with up to +18% compared to the second-best deep learning method, and performs on par against the state-of-the-art methods on sentence ordering and visual storytelling. Our work highlights the suitability of diffusion models for ordering problems and proposes a novel formulation and method for solving various ordering tasks. Project website at https://iit-pavis.github.io/Positional_Diffusion/

Francesco Giuliari, Gianluca Scarpellini, Stuart James, Yiming Wang, Alessio Del Bue

2023-03-20T14:01:01Z

http://arxiv.org/abs/2303.11120v1

# Positional Diffusion: Ordering Unordered Sets ###### Abstract Positional reasoning is the process of ordering unsorted parts contained in a set into a consistent structure. We present Positional Diffusion, a plug-and-play graph formulation with Diffusion Probabilistic Models to address positional reasoning. We use the forward process to map elements' positions in a set to random positions in a continuous space. Positional Diffusion learns to reverse the noising process and recover the original positions through an Attention-based Graph Neural Network. We conduct extensive experiments with benchmark datasets including two puzzle datasets, three sentence ordering datasets, and one visual storytelling dataset, demonstrating that our method outperforms long-lasting research on puzzle solving with up to \(+18\%\) compared to the second-best deep learning method, and performs on par against the state-of-the-art methods on sentence ordering and visual storytelling. Our work highlights the suitability of diffusion models for ordering problems and proposes a novel formulation and method for solving various ordering tasks. Project website at [https://it-pavis.github.io/Positional_Diffusion/](https://it-pavis.github.io/Positional_Diffusion/) ## 1 Introduction The ability to arrange elements is a fundamental human skill that is acquired during the early stages of development and is essential for carrying out daily tasks. Such ability is general across different tasks and researchers suggest that childhood games, such as Jigsaw puzzles, Lego\({}^{\copyright}\) blocks, and crosswords play a critical role in building the foundations of reasoning over the correct arrangement of things [22, 39]. While each of these tasks is tackling a very specific problem, humans have remarkable skills in _"putting an element in the correct place"_ regardless of the dimensionality and the information modality of the problems, such as 1-dimensional (1D) for arranging texts or 2D for solving puzzles. We refer to this ability as _positional reasoning_, and formulate it as an _ordering_ problem, i.e., assigning a correct _discrete_ position to each element of an unordered set. The difficulty lies in the combinatorial nature of ordering a set of elements into a coherent (given) structure. A robust ordering method has to be invariant to random permutations of the input sets, while consistently providing the correct output. Previous solutions have been designed to be problem-specific. For example, methods addressing Jigsaw puzzle operates on a 2D grid by jointly optimizing similarities and permutations [45] or by learning first an image representation complaint with the set of image tiles and then solving a standard Hungarian approach for matching the pieces [35]. Sentence ordering is another relevant 1D ordering NLP problem where a paragraph is formed from a set of unordered sentences by exploiting pairwise similarities and attention mechanisms [11, 25, 6, 43, 42]. Although all these positional reasoning problems involve finding a correct ordering of a set, their solutions are mostly customized to the data structure, position dimensionality, and contextual Figure 1: _Positional Diffusion_ is a unified architecture based on Diffusion Probabilistic Models following a graph formulation. It can solve several ordering problems with different dimensionality and multi-modal data such as Jigsaw puzzles, sentence ordering and coherent visual storytelling. information. We propose a unified model for positional reasoning, which does not require a re-design of the architecture given different input modalities or the dimensionality of the positional problem. We solve the ordering problem by regressing the position of each element in the set in a bounded continuous space. We then use the continuous position to retrieve the element's ordering in the set. Our approach is based on Diffusion Probabilistic Models (DPM) to estimate the position (and thus ordering) of each element in the set. We achieve permutation invariance by representing elements in the set as nodes of a fully connected graph. Using a diffusion formulation at training, we inject noise to the node positions and train an Attention-based Graph Neural Network (GNN) to learn the reverse process that recovers the correct positions. The attention mechanism aggregates relevant information from neighboring nodes given the current node features and positions. At inference, we initialize the graph with sampled positions and iteratively retrieve the correct ordinal positions by conditioning on nodes' features. Our proposed method, named _Positional Diffusion_, can address various problems that require ordering an arbitrary set in a plug-and-play manner. In this paper, we demonstrate the effectiveness of our formulation and method with three fundamental tasks: _i) puzzle solving_, where we compare _Positional Diffusion_ to both optimization-based and deep-learning-based methods, scoring the new state-of-the-art (SOTA) performance among all methods with a margin up to \(+18\%\) compared to the second-best deep-learning method; _ii) sentence ordering_, where we obtain the SOTA performance in a subset of the test datasets, including NeurIPs Abstract [25] and Wikipedia Plots [5]; and _iii) visual storytelling_, where _Positional Diffusion_ is on par with the SOTA methods on the VIST dataset [17] without relying on an ensemble of methods or any matching algorithms. To summarize, our main contributions are the following: * We propose a novel graph formulation with DPMs to address positional reasoning. The graph formulation addresses the invariance to input set permutations while the DPMs learn to restore the positions via the noising and de-noising processes; * We propose a task-agnostic method, _Positional Diffusion_, that implements an Attention-based GNN following a DPM formulation to address positional reasoning in various tasks in a plug-and-play manner; * We show without any task-specific customization, _Positional Diffusion_ can generalize and achieve SOTA or on-par performance among existing methods that are specifically designed for the tasks. ## 2 Related works We consider related works on recent developments of Diffusion Probabilistic Models and the SOTA methods of the three representative tasks for positional reasoning, including _puzzle solving_, _sentence ordering_, and _visual storytelling_. **Diffusion Probabilistic Models.** Diffusion Probabilistic Models (DPMs) solve the inverse problem of removing noise from a noisy data distribution [32]. They gained popularity thanks to their impressive results on image synthesis [15, 8] and their elegant probabilistic interpretation [34]. Recent literature showed that DPMs' capabilities extend to the 3D space [26] and unveiled promising applications for molecule generation [16]. We propose a novel formulation of the forward and reverse diffusion process for coherently sorting a shuffled input by treating the problem as either \(n\)-dimensional vectors sampled from a Gaussian distribution.We are unaware of previous works proposing an extensive study on positional reasoning with diffusion models. **Positional reasoning.** Literature on positional reasoning is vast and assumes different connotations depending on the task and modalities involved. Our study focuses on positional reasoning as an ordering task, i.e., sorting shuffled elements into a coherent output. **i)**_Jigsaw Puzzles_[4] interested the optimization community with puzzles as a benchmark for studying image ordering with intrinsic combinatorial complexity. The most successful strategies are related to greedy approaches using handcrafted features [10, 29] with robustness to noise and missing pieces [28] and solving thousands of pieces. For deep learning, puzzles have also been addressed as a permutation problem. Zhang et al. [45] optimizes both the cost matrix assessing pairwise relationships between pieces and the correct permutation in a bi-level optimization scheme, retaining the iterative elements of optimization methods. Alternatively, [46] used puzzles as a self-supervised representation learning task, where concatenation fixed the number of solvable pieces without optimization. Talon et al. [35] overcame this by exploiting a GAN [12] and reframing the problem as an assignment problem against the generated image. **ii)**_Sentence ordering_ involves positional reasoning on textual contents, which aims to order sentences into a coherent narration. Early works solved the task by modeling local coherence using language-based features [20, 2, 9, 14]. Recent works leverage deep learning to encode sentences and retrieve the final order using pointer networks, which compare sentences in a pairwise fashion [40, 11, 25, 6, 43, 42]. Several proposed approaches utilize attention-based pointer networks [40], topological sorting [30, 27], deep relational modules [7], and constraint graphs to enhance sentence representations [41, 47]. Other works also reframed the problem as a ranking problem [3], while Chowdhury et al. [5] formulated sentence ordering as a conditional text generation task using a sequence-to-sequence model [23]. **iii)**_Visual storytelling_ is an extension of sentence ordering with both textual and visual inputs to form a coherent visual stories [1]. In this multi-modal task formulation, the input is a shuffled set of sentences and their visual representation. VIST dataset [17] is the benchmark for this task. While Zellers et al. [44] constrained this task to visual ordering, where the sentences are presented in order, we maintain the original formulation for this task [1] to study the capabilities of diffusion models in a multi-modal setting. Differently from previous literature in computer vision, natural language processing, and multimodal learning, we interpret data shuffling as the noise injection of DPMs' forward process and exploit the reverse process of a DPM to retrieve the final position of each element, that being a sentence, a puzzle piece, or a sentence-image pair. To the best of our knowledge, our _Positional Diffusion_ is the first DPM-based solution for positional reasoning that can work with different modalities. ## 3 Positional Diffusion We introduce positional reasoning as a restoring process from a shuffled, unstructured data distribution in a Euclidean space \(\mathbb{R}^{n}\), where \(n\)=1 for 1D problems such as sentence ordering, \(n\)=2 for 2D tasks such as puzzle pieces arrangement and so on. Given an unordered set of \(K\) elements with some task-specific features \(\textbf{H}=\{\textbf{h}^{1},\ldots,\textbf{h}^{K}\},\textbf{h}^{i}\in\mathbb{ R}^{d}\), where \(d\) is the dimension of the features, and with ground truth positions \(\textbf{X}~{}=~{}\{\textbf{x}^{1},\ldots,\textbf{x}^{K}\},\textbf{x}^{i}~{} \in~{}\mathbb{R}^{n}\), our network outputs an estimate set of positions \(\hat{\textbf{X}}~{}=~{}\{\hat{\textbf{x}}^{1},\ldots,\hat{\textbf{x}}^{K}\}, \hat{\textbf{x}}^{i}~{}\in~{}\mathbb{R}^{n}\), that matches the real position of each element. We encode each data point as a node in a fully connected graph, allowing each node to influence the others. Graph representations have the advantage to admit a variable number of input data in a permutation-invariant way. Our proposed _Positional Diffusion_ uses the DPMs formulation to iteratively restore the position of the unordered data from a randomly sampled position, combined with GNNs to work with our graph-structured data. ### Network architecture To solve the reverse process, we train a neural network that given noisy positions \(\textbf{X}_{t}\), features **H** and a time step \(t\), it outputs the noise \(\epsilon_{t}\) that is used to calculate \(\textbf{X}_{t-1}\). Our network operates with element features \(\textbf{h}^{i}\) that can be extracted from any pre-trained task-specific backbone. We create a graph structure \(G\) where each node represents an input point and assign \([\textbf{x}^{i}_{t};\textbf{h}^{i}]^{\top}\) as node features. We input this graph to our Attention-based GNN backbone, which comprises a stack of four Graph Transformers layers [31]. Such Graph Transformers use the attention mechanism on top of a graph structure to control the amount of information that is gathered from neighboring nodes. The attention is indeed what allows the network to learn to perform positional reasoning. Fig. 2 summarizes our architecture. ### Forward and reverse process Building upon [15], we define the forward process as a fixed Markov chain that adds Gaussian noise to each input's starting position \(\textbf{x}^{k}_{0}=\textbf{x}^{k}\) according to a Gaussian distribution. At timestep \(t\in[0,T]\), we adopt the variance \(\beta_{t}\) according to a linear scheduler and define \(q(\textbf{x}_{t}|\textbf{x}_{0})\) as: \[q(\textbf{x}^{i}_{t}|\textbf{x}^{i}_{0})=\mathcal{N}(\textbf{x}^{i}_{t}; \sqrt{\overline{\alpha}_{t}}\textbf{x}^{i}_{0},(1-\overline{\alpha}_{t}) \textbf{I}), \tag{1}\] Figure 2: For each task, the input initial set (i) is a permuted version of the solution. Each element of the set is correlated with an initial sample location (ii) \(\textbf{x}^{i}_{T}\) (in 1D or 2D) and an encoding \(\textbf{h}^{i}\) from a task-specific backbone (iii). During Training of the diffusion steps (iv) we apply a noising process to each element position \(\textbf{x}^{i}\) to obtain a noisy position \(\textbf{x}^{i}_{t}\). We concatenate \(\textbf{h}^{i}\) with the noisy positions \(x^{i}_{t}\) to create the features and encode them as node features in a fully connected graph. We use a Graph Neural Network with Attention-based message passing to generate the less noisy positions \(\textbf{x}^{i}_{t-1}\). During inference, for each element, we sample an initial position \(\textbf{x}^{i}_{T}\) from \(\mathcal{N}(0,1)\) or set it to \([0,0]\), and use _Positional Diffusion_ for the full reverse process to obtain the estimated positions \(\hat{\textbf{x}}^{i}_{0}\). where \(\alpha_{t}=1-\beta_{t}\), \(\overline{\alpha}_{t}=\prod_{s=1}^{t}\alpha_{s}\). Using this formulation, we can obtain a noisy position \(\mathbf{x}_{t}^{k}\) from \(\mathbf{x}_{0}^{k}\). The reverse process retrieves the correct position for each data point using the noisy positions \(\mathbf{x}_{t}^{i}\), and element features \(\mathbf{h}^{i}\).We adopt DDIM [33] algorithm and sample \(\hat{\mathbf{x}}_{t-1}\) as: \[\hat{\mathbf{x}}_{t-1}= \sqrt{\overline{\alpha}_{t-1}}\left(\frac{\mathbf{x}_{t}-\sqrt{1 -\overline{\alpha}_{t}}\epsilon_{\theta}(\mathbf{x}_{t},\mathbf{t},\mathbf{h} )}{\sqrt{\overline{\alpha}_{t}}}\right)\] \[+\sqrt{1-\overline{\alpha}_{t-1}-\sigma_{t}^{2}}\cdot\epsilon_{ \theta}(\mathbf{x}_{t},\mathbf{t},\mathbf{h})+\sigma_{t}\epsilon,\] where \(\epsilon_{\theta}(\mathbf{x}_{t},\mathbf{t},\mathbf{h})\) is the estimated noise that has to be removed from \(\mathbf{x}_{t}\) to recover \(\hat{\mathbf{x}}_{t-1}\) and \(\mathbf{t}\) is a learned vector embedding for timestep \(t\). In the formula, we omit the superscripts \(i\) as the network operates on all elements simultaneously as a graph. DDIM introduces the parameter \(\sigma\) to control the stochastic sampling. As the ordering tasks have only one correct arrangement, we set \(\sigma=0\) to make the sampling deterministic. Our method is trained using the simple loss for diffusion models introduced in [15]: \[L_{\text{simple}}(\theta)=\mathbb{E}_{t,\mathbf{x}_{0},\epsilon}[\|\epsilon- \epsilon_{\theta}(\underbrace{\sqrt{\overline{\alpha}_{t}}\mathbf{x}_{0}+ \sqrt{1-\overline{\alpha}_{t}}}_{\mathbf{x}_{t}},\mathbf{t},\mathbf{h})\|].\] We calculate \(\mathbf{x}_{t}\) in closed form from \(\mathbf{x}_{0}\), using the reparametrization trick with the noise vector \(\epsilon\). The network learns to minimize the Mean Squared Error between \(\epsilon\) and the output \(\hat{\epsilon}=\epsilon_{\theta}(\mathbf{x}_{t},\mathbf{t},\mathbf{h})\). ### Zero-centered initialization In generative diffusion models, the initial \(\mathbf{X}_{T}\) used during the reverse process is sampled from \(\mathcal{N}(0,1)\). In standard image generation tasks, this noise introduces stochasticity to synthesize different images. Differently, the solution in positional reasoning is the true final arrangement, thus such arrangement should only be influenced by the input features \(\mathbf{H}\) and not by the initial \(\mathbf{X}_{T}\). We found that by setting \(\mathbf{x}_{T}=\mathbf{0}\), which is the mean of normal distribution, the network achieves more stable results as verified in the experimental section. The effect of different sampling on the final position can be observed in Fig. 3. The rearrangement is more precise when \(\mathbf{x}_{T}=\mathbf{0}\). A quantitative comparison is reported for puzzles, in Tab. 2. We use zero-centered initialization throughout the experiments. ## 4 Experiment We evaluate _Positional Diffusion_ on three tasks that require positional reasoning with input data of different modalities: _i)_ puzzle solving operates with visual data to order the \begin{table} \begin{tabular}{c|c|c|c|c|c} \hline \hline Task & \begin{tabular}{c} **Position** \\ **Dim.** \\ \end{tabular} & \begin{tabular}{c} **Data** \\ **Modality** \\ \end{tabular} & \begin{tabular}{c} **Feature** \\ **Backbone(s)** \\ \end{tabular} & \begin{tabular}{c} **Trainable Parameters** \\ **Backbone** \\ \end{tabular} & \begin{tabular}{c} **GNN** \\ \end{tabular} \\ \hline \multirow{3}{*}{\begin{tabular}{c} Puzzle solving \\ Sentences ordering \\ \end{tabular} } & 2D & RGB & EfficientNet [36] & 6.8 M & \\ & 1D & Text & BART [23] & 28.2 M\({}^{\dagger}\) & 3.2 M \\ \cline{1-1} \cline{2-6} & 1D & \begin{tabular}{c} RGB \\ \& Text \\ \end{tabular} & \begin{tabular}{c} EfficientNet [36] \\ \& BART [23] \\ \& BART [23] \\ \end{tabular} & 31.8 M\({}^{\dagger}\) & \\ \hline \hline \end{tabular} \end{table} Table 1: We show the different dimensionality, modality, and number of parameters for each of our downstream tasks. Our _Positional Diffusion_ shares the same structure across tasks. \({}^{\dagger}\)We report the parameters of the trainable Transformer built on top of the frozen BART model (425 M). Figure 3: Visualization of the reverse process for solving puzzles of size 6x6 with both standard and zero-centered initialization. The top part shows a sample from _PuzzleCelebA_ while the bottom part shows the results with a sample from _PuzzleWikiArt_. shuffled image patches into a complete image; _ii_) sentence ordering operates with textual data that aims to order the shuffled sentences to form a complete and reasonable paragraph; and _iii_) visual storytelling operates with textual and visual data and requires to order sentence-image pairs into a coherent story. Tab. 1 summarizes the experimental settings. The following sections introduce the detailed experimental setup for each task regarding the evaluation protocols, performance metrics, and comparisons. We present more qualitative results in the Supplementary Materials. ### Puzzle solving We follow the experimental setup in Ganzzle [35] and report the results of _Positional Diffusion_ in comparison to optimization-based and deep learning-based methods on _PuzzleCelebA_ and _PuzzleWikiArts_. These two datasets feature a large number of images which allows for method training with deep learning, while other puzzle datasets typically only contain \(\leq 100\) images. * _PuzzleCelebA_ is based on CelebA-HQ [21] which contains 30K images of celebrities in High Definition (HD). The images are cropped and positioned to show only centered faces. This is an easier dataset for puzzle solving as the images share a consistent global structure. * _PuzzleWikiArts_ is based on WikiArts [37], and contains 63K images of paintings in HD. This dataset contains paintings with very different content and artistic styles. It represents a more challenging dataset for puzzle solving as the paintings do not have a common pattern as in PuzzleCelebA (i.e. portraits). For both datasets, we test with puzzles of sizes 6x6, 8x8, 10x10, and 12x12. As the puzzle size increases, the problem becomes more difficult, as the permutations increase and each piece contains less discriminative information. **Evaluation Metrics.** We evaluate the performance of _Positional Diffusion_ using the _Direct Comparison Metric_[4], a percentage that indicates the number of correctly ordered pieces over the full test set. A higher score indicates better performance. **Implementation Details.** We divide an image in \(n\times n\) patches, resulting a total of \(K=n^{2}\) elements. We divide a 2D space with a range of (-1,-1), (1,1) into a grid of \(n\times n\) cells. We use the centers of the cells as starting positions \(\mathbf{X}\) for the patches. The input data for puzzle solving are the pixel values for each patch, resized to 32x32. We use EfficientNet [36] as the task-specific backbone to extract the patch visual features \(\mathbf{h}^{i}\) and we train the diffusion model with \(T=300\) and sample it with inference ratio \(r=10\). We train a single model with all puzzle sizes simultaneously. At inference, we arrange the patches by mapping each estimated patch position \(\hat{\mathbf{x}}^{i}\) to a cell in the grid. We measure the distance between each patch position and cells' centers, and assign each patch to its closest cell, mapping each cell to at most one patch. By using a greedy approach that prioritizes the assignment between cells-patch pairs starting from those with the lowest distance, we ensure that the most confident prediction will be assigned first, increasing the prediction robustness to noise. **Comparisons.** We compared _Positional Diffusion_ against a set of SOTA methods for puzzle solving. * _Optimization methods_[28, 29, 10] are handcrafted methods for puzzle solving. They involve computing a compatibility score between all pairs of pieces, to predict which pieces are neighbors. * _PO-LA_[46] uses a neural network to learn a differentiable permutation invariant ordering cost between a set of patches. The learned cost function is then used to order the pieces and form the full image. * _Ganzzle_[35] employs a GAN to generate a hallucinated version of the full image from the set of pieces. Then, Ganzzle solves the puzzle as an assignment problem by matching the patch features with the features extracted from the generated image at specific locations. * _Transformer_ is a standard Transformer-based architecture [38] that predicts the positions of each piece. This method uses the self-attention mechanism to propagate relevant information between patches. We present two variants of _Positional Diffusion_, where one uses the standard DPM random sampling from \(\mathcal{N}(0,1)\), and the other uses the proposed zero-centered initialization for sampling. Tab. 2 presents the results of all methods for solving \begin{table} \begin{tabular}{l|c c c c|c c c} \hline \hline Dataset & \multicolumn{4}{c|}{**PuzzleCelebA**} & \multicolumn{4}{c}{**PuzzleWikiArts**} \\ \cline{2-9} & **6x6** & **8x8** & **10x10** & **12x12** & **6x6** & **8x8** & **10x10** & **12x12** \\ \hline Pikin and Tal [28] & 99.12 & **98.67** & 98.39 & 96.51 & 98.03 & 97.35 & 95.31 & 90.52 \\ Pomerran et al. [29] & 84.59 & 79.43 & 74.80 & 66.43 & 79.23 & 72.64 & 67.70 & 62.13 \\ Gallagher [10] & 98.55 & 97.04 & 95.49 & 93.13 & 88.77 & 82.28 & 77.17 & 73.40 \\ \hline PO-LA [46]\({}^{\dagger}\) & 71.96 & 50.12 & 38.05 & - & 12.19 & 5.77 & 3.28 & - \\ Ganzzle [35] & 72.18 & 53.26 & 32.84 & 12.94 & 13.48 & 6.93 & 4.10 & 2.58 \\ Transformer [38] & 99.60 & 95.20 & 98.62 & 96.55 & 98.52 & 95.30 & 88.76 & 75.84 \\ \hline _Positional Diffusion_ - \(\mathcal{N}(0,1)\) sampling & 99.72 & 96.78 & 99.28 & 98.55 & 98.52 & 97.15 & 94.34 & 90.26 \\ _Positional Diffusion_ - Zero-centered initialization & **99.77** & 97.53 & **99.37** & **98.88** & **99.12** & **98.27** & **96.28** & **93.26** \\ \hline \hline \end{tabular} \end{table} Table 2: Results on puzzle solving in terms of the _Direct Comparison Metric_, evaluated with _PuzzleCelebA_ and _PuzzWikiArts_. **Best**. \({}^{\dagger}\)Trained on individual puzzle sizes. puzzles of various sizes with the two datasets. On _Puzzle-CelebA_, both the Transformer baseline and our _Positional Diffusion_ outperform the previous SOTA methods on almost all puzzle sizes. In particular, _Positional Diffusion_ scores the new SOTA performance among deep-learning methods on all puzzle sizes, with a significant improvement against the previous best-performing method Ganzle [35], even outperforming classical optimization approaches. Moreover, we observe that the performance of previous deep learning methods degrades significantly with the puzzle sizes, while _Positional Diffusion_ only presents a minor degradation. On 12x12 puzzles, _Positional Diffusion_ achieves \(98.88\%\), \(+2\%\) higher than the Transformer baseline, \(+86\%\) higher than Ganzle, and \(+2\%\) higher than the best optimization method. In general, _PuzzleCelebA_ is an easier dataset for puzzle solving compared to _PuzzleWikiArts_ as it contains well-centered faces with common global patterns. Our method can exploit the shared pattern to solve the puzzle, e.g., eyes position relative to the image. The top part in Fig. 3 clearly shows that _Positional Diffusion_ can correctly position the eyes, mouth, and hair patches. On _PuzzleWikiArts_, we observe that all previous methods achieve worse performance on all puzzle sizes, among which the deep-learning approaches almost fail to solve the puzzles. _PuzzleWikiArts_ contains puzzles that are harder to solve, as they come from paintings with different pictorial styles and subjects, with little common patterns. Nevertheless, _Positional Diffusion_ consistently obtains the best performance among all methods, overshooting deep learning methods by a large margin on all puzzle sizes, i.e., \(+1\%\) on 6x6, \(+3\%\) on 8x8, \(+8\%\) on 10x10, and \(+18\%\) on 12x12 compared to the Transformer baseline. In particular, _Positional Diffusion_ also outperforms the optimization-based methods, which require hand-crafted features and greedy solutions, on all puzzle sizes. Moreover, using the same trained model, _Positional Diffusion_ with the zero-centered initialization consistently obtains better performance than using the standard DPM random sampling from \(\mathcal{N}(0,1)\). The advantages can be observed from both datasets on all puzzle sizes, as shown in Fig. 3. Finally, we show in Fig. 4, three examples of the puzzles solved with _Positional Diffusion_ on _PuzzleWikiArt_. When the predicted positions are noisy but still close to their ground-truth positions, we can recover their correct ordering by the assignment procedure. However, when the errors are large and systematic, e.g., such as when there is a local collapse in the prediction, the assignment procedure fails to fix the positions. It's important to note that the _Direct Comparison Metric_ does not reflect the performance in terms of solving a puzzle as a whole, as it is computed at the patch level. For example, the Transformer positioned \(75.84\%\) patches correctly on _PuzzleWikiArt_ 12x12, but it only solved \(6.64\%\) of the puzzles, while _Positional Diffusion_ with \(93.26\%\) correctly positioned patches solved \(69.32\%\) of puzzles. ### Sentence ordering For sentence ordering, we follow the experimental setup in [5] and report the results of all compared methods on three common textual datasets (dataset statistics are in Tab. 4): * _NeurIPS Abstract_ is obtained from the abstracts of scientific articles featured at NeurIPS; * _Wikipedia Movie Plots_ is a collection of plots of popular movies that are available on Wikipedia; * _ROCStories_ is a collection of 5 sentences stories regarding everyday events. **Evaluation metrics.** We quantify the sentence ordering performances with three metrics as in [5]: * _Accuracy (Acc.)_ is the percentage of correctly predicted sentence positions in an input text. * _Perfect Match Ratio (PMR)_ is the percentage of the number of correctly ordered texts over the total number of texts in the test set. Differently from Acc. which is calculated over individual sentences, PMR measures if the full input text is ordered correctly. * _Kendall's Tau_ (\(\tau\)) measures the correlation between the ground-truth orders of sentences and the predicted ones, Figure 4: Results of 12x12 puzzles solved with _Positional Diffusion_ on _PuzzleWikiArt_. The predicted positions of patches are visualized next to the resulting puzzles. The positions are color-coded based on the patch position in the original image, from the top-left _red_ to the bottom-right _green_. (a) The network predicts the positions of all elements correctly. (b) The network predicts the positions of the patches with slight noises. In this case, the assignment process maps the noisy positions to their correct slot. (c) The network wrongly predicts the positions of some patches in a local region. These positions cannot be recovered by the assignment process. defined as: \(\tau=1-(2(\#\text{Inversions}){K\choose 2}^{-1})\), where \(K\) is the number of sentences in an input text, and \(\#\text{Inversions}\) is the number of discordant pairs. We report the metrics averaged over the test set. The higher values of the three metrics indicate better performance of the sentence ordering methods. **Implementation Details.** We divide a text into a variable number \(K\) sentences with shuffled orders as the input. To assign the correct positions \(\mathbf{x}_{0}\) to each sentence, we evenly sample \(K\) positions over the interval (-1,1), and assigned them to the divided sentences based on their position in the text. The starting sentence will have the smallest position, while the ending sentence will have the largest position. We use a frozen pre-trained BART [23] language model for our task-specific feature backbone, to which we added a learnable transformer encoder layer at the end. For each sentence, we prepend a \(\langle bos\rangle\) token and pass the sentence to BART to obtain the token feature as the task-specific feature \(\textbf{h}^{i}\) in _Positional Diffusion_. We train our method with \(T=300\) and sample with inference ratio \(r=10\). **Comparisons.** We conducted a comprehensive evaluation of _Positional Diffusion_ against the current best-performing methods BERSON [7], Re-BART [5], and BART for seq2seq generation as proposed in [5], as well as other baselines including B-TSort [30], RankTxNet [19], TGCM [27]. We also provide a baseline that is composed of pretrained BART backbone with a Transformer head. We report the results of all methods in Tab. 3. _Wikipedia Movie Plots_ has the largest average number of sentences in a text, which is more than double compared to that of _NeurIPS Abstract_ and _On ROCStories. Positional Diffusion_ scores the best Accuracy on _Wikipedia Movie Plots_, with an improvement of \(+8\%\) over the current SOTA method Re-BART, with on par performance in terms of PMR and \(\tau\). With _NeurIPS Abstract_, _Positional Diffusion_ is the second-best performing method in Accuracy and \(\tau\), while Re-BART remains the best-performing method. Finally, on _ROCStories_, _Positional Diffusion_ performs worse than BEARSON and Re-BART. Compared to the well-structured texts in _NeurIPS Abstract_ and _Wikipedia Movie Plots_, the logical connection among sentences in _ROCStories_ can be weak in some cases (as shown in Tab. 5). This could be the main reason why _Positional Diffusion_ struggles to learn positional reasoning. Moreover, it is important to note that we use the frozen language model BART to extract features to train our GNN model for positional reasoning. Instead, Re-BART [5] fine-tunes BART with all sentences simultaneously to predict the sequence order. In fact, the trainable parameters of _Positional Diffusion_ is 32M parameters for text ordering, which is negligible compared to Re-BART's 425M. ### Visual storytelling We finally evaluate _Positional Diffusion_ on a multi-modal task: visual storytelling, which is harder than text reasoning, as it requires understanding and relating visual and text inputs. We follow the evaluation protocol in [1] using the visual storytelling dataset VIST [17]. The dataset contains stories of sentence-image pairs with each story describing everyday events, as shown in Fig. 5. **Evaluation metrics.** We adopt three complementary metrics for the evaluation as in [1]: \begin{table} \begin{tabular}{l c c c c c c c} \hline \hline \multirow{2}{*}{Dataset} & \multicolumn{3}{c}{**Split**} & \multicolumn{3}{c}{**Length**} & \multicolumn{2}{c}{**Tokens / sentence**} \\ \cline{2-7} & **Train** & **Dev** & **Test** & **Max** & **Avg** & **Max** & **Avg** \\ \hline _NeurIPS Abstract_ & 2.4K & 0.4K & 0.4K & 15 & 6 & 158 & 24.4 \\ _Wikipedia M. P._ & 27.9K & 3.5K & 3.5K & 20 & 13.5 & 319 & 20.4 \\ _ROCStories_ & 78K & 9.8k & 9.8k & 5 & 5 & 21 & 9.1 \\ \hline \hline \end{tabular} \end{table} Table 4: Dataset statistics of _NeurIPS Abstract_, _Wikipedia Movie Plots_ and _ROCStories_ for sentence ordering. \begin{table} \begin{tabular}{l c c} \hline \hline Sentence & **Predicted Pos.** & **GT Pos.** \\ \hline Tom was driving to work. & (1) & (1) \\ He got pulled over by a cop. & (2) & (2) \\ The cop mentioned a busted tail light. & (3) & (4) \\ Tom asked why. & (4) & (3) \\ Tom agreed to fix it and only got a warning. & (5) & (5) \\ \hline \hline \end{tabular} \end{table} Table 5: Result of five sentences from _ROCStories_ ordered based on the positions predicted by _Positional Diffusion_. On the right is the ground-truth position in the full text. We highlight in red the wrongly predicted positions. * _Spearman's rank correlation (Sp.)_ evaluates the monotonic relationship between predicted and ground-truth rankings. A higher score indicates better performance. * _Pairwise accuracy (Pairw.)_ measures the percentage of pairs of elements with identical predicted and true ordering. A higher score indicates better performance. * _Average Distance (Dist.)_ measures the average displacement of all predicted elements to the ground truth order. A lower value indicates better performance. **Implementation Details.** In this task, we are given five images with their related caption that have to be arranged correctly to form a visual story. Similarly to Sentence Ordering, we divide a 1D space of range (-1,1) into five segments and assign to each image/text pair the center of its corresponding segment as the ground-truth position. The images/text at the beginning of the sequence have a lower position, while those at the end of the sequence have a larger position. For this task, we extract the image feature using EfficientNet and extract a text summary for the phrase using BART as done for the Sentence ordering task. We then concatenate the output of these two models to obtain the features \(\mathbf{h}^{i}\). We train _Positional Diffusion_ with \(T=100\) and sample it with inference ratio \(r=10\). **Comparisons.** We compare _Positional Diffusion_ with _Sort Story_ as proposed by Agrawal et al. [1]. _Sort Story_ is a combination of Skip-Thought [18] with pairwise ranking [24], a custom CNN, and Neural Position Embedding module with LSTM [13]. Agrawal et al. proposed two versions of their approach: an ensemble that adopts the Hungarian algorithm to find the permutation that maximizes the ensemble's voting and a standalone module. We also compare against a Transformer-based baseline with BART [23] and EfficientNet [36] for the textual and visual encoding, respectively. Tab. 6 shows that _Positional Diffusion_ outperforms all the baselines in terms of the average distance (_Dist._). Our approach builds coherent stories with fewer wrong displacements compared to the ground truth. _Positional Diffusion_ also performs close to _Sort Story_[1] in terms of pairwise distance (_pairw._) and correlation (_sp._), which measure the global coherence, with only a slight difference. Note that _Sort Story_ adopts specific design choices including the pairwise distance between each visual-text pair, an ensemble of modules, and Hungarian matching algorithm, while our method is solely data-driven and relies on the reversing diffusion process. Fig. 5 shows some qualitative results. Our approach produces a coherent story even where the story's structure is loose (Fig. 5 top). These results confirm the advantage of our GNN formulation which enables each node to be coherent with others. In the failure case in Fig. 5 (bottom), _Positional Diffusion_ correctly predicts _(1)_ as first and _(3)-(4)-(5)_ in order, while misplaces _(2)_ as the last element of the story. As a plug-and-play method, _Positional Diffusion_ demonstrates competitive performance in building a coherent narration with multi-modal data. ## 5 Conclusion In this work, we proposed _Positional Diffusion_, a graph-based DPM for positional reasoning on unordered sets. _Positional Diffusion_ represents the set as a fully connected graph where each element is a node of the graph. By using an Attention-based GNN, we update the node features to estimate the node position. The diffusion formulation allows us to learn the underlying patterns and iteratively refine the element positions. _Positional Diffusion_ is generic and applicable to multiple tasks that require positional reasoning regardless of the data modality and positional dimension, as demonstrated in the experimental section. We experimented with three ordering tasks: puzzle solving, sentence ordering, and visual storytelling. _Positional Diffusion_ reaches SOTA on puzzle solving and comparable results with sentence ordering and visual storytelling when compared to methods that are specifically designed for each task. **Acknowledgments** We would like to thank Pietro Morerio, Davide Talon, and Theodore Tsesmelis for helping improving the manuscript and for the useful discussions. \begin{table} \begin{tabular}{l|c c c} \hline \hline Method & **Sp. \(\uparrow\)** & **Pairw. \(\uparrow\)** & **Dist. \(\downarrow\)** \\ \hline Sort Story\({}^{\ddagger}\)[1] & **0.67** & **0.79** & 0.72 \\ Skip-Thought + pairwise [1] & 0.56 & 0.74 & 0.89 \\ Transformer [38] & 0.54 & 0.75 & 0.56 \\ _Positional Diffusion_ & 0.63 & 0.77 & **0.51** \\ \hline \hline \end{tabular} \end{table} Table 6: Performance of different methods on the visual storytelling task. **Best** / Second best. \(\ddagger\) Ensemble of multiple methods. Figure 5: Successful (top) and failure (bottom) cases for ordering of a visual story from VIST [17]. The image-sentence pairs are ordered from left to right as predicted by _Positional Diffusion_. The numbers indicate the ground-truth positions of the image-caption in the story.

2308.13445

Eigenvector Dreaming

Among the performance-enhancing procedures for Hopfield-type networks that implement associative memory, Hebbian Unlearning (or dreaming) strikes for its simplicity and its clear biological interpretation. Yet, it does not easily lend itself to a clear analytical understanding. Here we show how Hebbian Unlearning can be effectively described in terms of a simple evolution of the spectrum and the eigenvectors of the coupling matrix. We use these ideas to design new dreaming algorithms that are effective from a computational point of view, and are analytically far more transparent than the original scheme.

Marco Benedetti, Louis Carillo, Enzo Marinari, Marc Mèzard

2023-08-09T16:18:47Z

http://arxiv.org/abs/2308.13445v1

# Eigenvector dreaming ###### Abstract Among the performance-enhancing procedures for Hopfield-type networks that implement associative memory, Hebbian Unlearning (or dreaming) strikes for its simplicity and its clear biological interpretation. Yet, it does not easily lend itself to a clear analytical understanding. Here we show how Hebbian Unlearning can be effectively described in terms of a simple evolution of the spectrum and the eigenvectors of the coupling matrix. We use these ideas to design new dreaming algorithms that are effective from a computational point of view, and are analytically far more transparent than the original scheme. ## I Introduction Consider a fully connected network of \(N\) binary variables \(\{S_{i}=\pm 1\}\), \(i\in[1,..,N]\), linked by couplings \(J_{ij}\). The network is endowed with a dynamics \[S_{i}(t+1)=\mathrm{sign}\left(\sum_{j=1}^{N}J_{ij}S_{j}(t)\right),\qquad i=1,..,N \tag{1}\] which can be run either in parallel (i.e. _synchronously_) or in series (i.e. _asynchronously_ in a predetermined or in a random order) over the \(i\) indices. This kind of network can be used as an associative memory device, namely for reconstructing an extensive number \(P=\alpha N\) of binary patterns \(\{\xi_{i}^{\mu}\}=\pm 1\), \(\mu\in[1,...,P]\), called _memories_. In this work, we will focus on i.i.d. memories, generated with a probability \(P(\xi_{i}^{\mu}=\pm 1)=1/2\). We consider a recognition process based on initializing the network dynamics to a configuration similar enough to one of the memories, and iterating eq. (1) asynchronously until a fixed point is reached. The network performs well if such asymptotic states are similar enough to the memories. Whether this is the case depends on the number of patterns one wants to store and on the choice of the coupling matrix \(J\). Hebb's learning prescription [1] \[J_{ij}^{H}=\frac{1}{N}\sum_{\mu=1}^{p}\xi_{i}^{\mu}\xi_{j}^{\mu}\,,\qquad J_{ ii}^{H}=0 \tag{2}\] used in the seminal work of Hopfield [2], allows retrieving memories up to a critical capacity \(\alpha_{c}^{H}\sim 0.14\)[3]. In this model even when \(\alpha<\alpha_{c}^{H}\) memories are not perfectly recalled, but the state of the system always presents a small finite fraction of misaligned spins. This feature is linked to the value of the minimum stability \(\Delta_{\mathrm{min}}\), defined as \[\Delta_{\mathrm{min}}\equiv\mathrm{min}_{i,\mu}\{\Delta_{i}^{\mu}\}, \tag{3}\] where the _stability_\(\Delta_{i}^{\mu}\) is defined by \[\Delta_{i}^{\mu}=\frac{\xi_{i}^{\mu}}{\sqrt{N}\sigma_{i}}\sum_{j=1}J_{ij}\xi_ {j}^{\mu},\qquad\sigma_{i}=\sqrt{\sum_{j=1}^{N}J_{ij}^{2}/N}. \tag{4}\] The value of the stability tells us if a given pattern is aligned or not to its memory field. As soon as \(\Delta_{\mathrm{min}}>0\), memories themselves become fixed points of the dynamics [4], allowing error-less retrieval when the dynamics is initialized close enough to one of them. Several techniques have been developed to build better performing coupling matrices, i.e. to reduce the retrieval error and increase the critical capacity as well as the size of the basins of attraction to which the memories belong [5; 6; 7; 8; 9]. One such technique is Hebbian Unlearning. ## II Hebbian Unlearning (HU) Inspired by the brain functioning during REM sleep [10], the unlearning algorithm [11; 12; 13; 14] is a training procedure for the coupling matrix \(J\), leading to error-less retrieval and increased critical capacity in a symmetric neural network. The coupling matrix is built according to the following iterative procedure: The learning rate \(\epsilon\) and the number of dreams \(D_{max}\) are free parameters of the algorithm. The algorithm 1 does not change the diagonal elements of the coupling matrix, which are fixed to \(J_{ii}=0\). For sufficiently small values of the learning rate, below the critical load \(\alpha<\alpha_{c}^{HU}\sim 0.6\) the evolution of \(\Delta_{min}\) follows a non-monotonic curve as a function of \(D_{max}\), as illustrated in fig. 1. The number of dreams \(D=D_{in}\) marks the point where \(\Delta_{\min}\) crosses \(0\). Here all the memories are fixed points of the dynamics. Other two points, \(D=(D_{top},D_{fin})\) are shown in the plot, corresponding to the maximum of \(\Delta_{min}\) and the point where \(\Delta_{min}\) becomes negative again. The scaling of \((D_{in},D_{top},D_{fin})\) was studied in [14]. In addition to error-less retrieval, when \(\alpha<\alpha_{c}^{HU}\), dreaming creates large basins of attraction around the memories. This can be measured in terms of the _retrieval map_ \[m_{f}(m_{0})\equiv\overline{\left<\frac{1}{N}\sum_{i=1}^{N}\xi_{i}^{\mu}S_{i} ^{\mu}(\infty)\right>}\;. \tag{5}\] Here, \(\vec{S}^{\mu}(\infty)\) is the stable fixed point reached when the dynamics is initialized to a configuration \(\vec{S}^{\mu}(0)\) having overlap \(m_{0}\) with a given memory \(\vec{\xi}^{\mu}\). The symbol \(\overline{\cdot}\) denotes the average over different realizations of the memories and \(\langle\cdot\rangle\) the average over different realizations of \(\vec{S}^{\mu}(0)\). We show in fig. 2 the retrieval map for \(N=1000\) and \(\alpha=0.4\). The performance of HU is best at \(D=D_{in}\). Interestingly, as discussed in [14], the curve relative to Gardner's optimal symmetric perceptron [4; 5] and to unlearning at \(D=D_{in}\) coincide with good accuracy. ## III Two novel dreaming algorithms An interesting interpretation of the HU algorithm emerges when analyzing the evolution of the spectrum and of the eigenvectors of the coupling matrix \(J\) during the dreaming procedure. Before dreaming, the spectrum of \(J\) is of the Marchenko-Pastur type [15], and the \(N\)-dimensional vector space is split between a degenerate \(N-P\) dimensional eigenspace orthogonal to all the memories, and a \(P\) dimensional space spanned by the memories, split in non-degenerate eigenspaces. Fig. 3 focuses on the evolution under dreaming of the ranked spectrum of \(J\). The evolution of the ranked spectrum indicates that HU is targeting, and reducing, the largest eigenvalues of the coupling matrix, while all other eigenvalues are increased by a constant amount at every dream, maintaining a traceless coupling. This leads to a plateau on the high end of the ranked spectrum. In fig. 4 we qualify the evolution of the eigenvectors \(\vec{\zeta}\) of the coupling matrix \(J\) as a function of the dreaming number. For each D, eigenvalues are ranked from \(1\) to N. For each rank, we measure the overlap \(\omega(\vec{\zeta}(D),\vec{\zeta}(D-1))\) between the corresponding eigenvector at step \(D\) and at step \(D-1\). Eigenvalues in the same rank at different dreaming steps are connected by a continuous line, colored with a color code connected Figure 2: Retrieval map \(m_{f}(m_{0})\) for the unlearning algorithm at the three relevant steps indicated in Fig. 1, and before unlearning. All measurements are averaged over \(10\) realizations of the network. \(N=1000\), \(\alpha=0.4\), \(\epsilon=10^{-2}\). The performance of the algorithm is maximal ad \(D=D_{in}\). Figure 1: The minimum stability \(\Delta_{\min}\) as a function of the normalized number of dreams, for different values of \(\alpha\). The threshold \(\Delta=0\) is indicated with the gray dotted line. For \(\alpha<0.59\), \(\Delta_{min}\) crosses zero at \(D_{in}\), peaks at \(D=D_{top}\) and then becomes negative again at \(D=D_{fin}\). Where appropriate the three relevant amounts of dreams are indicated: \(D=D_{in}\) by ”\(x\)”, \(D=D_{top}\) by a dot, \(D=D_{fin}\) by a ”\(+\)”. All measurements are averaged over \(50\) realizations of the network. \(N=400\), \(\epsilon=10^{-2}\). to \(\omega\). For clarity, only lines corresponding to overlaps larger than \(0.1\) are shown. As the dreaming procedure unfolds, the majority of the eigenvectors does not change much (blue lines), and lines do not cross. This means that eigenvalues evolve continuously, while the corresponding eigenvectors barely change. The highest and lowest part of the ranked spectrum, on the other hand, show some crossing of lines, and low values of the overlaps (in red). This is due to the eigenvalues becoming almost equal, leading to an effectively degenerate eigenspace, corresponding to the plateau in fig. 3. These observations suggest the following alternative algorithm. ### Eigenvector dreaming ``` Initialize \(J\) using Hebb's rule eq. (2) for\(D=1\) to \(D_{max}\)do 1-Find an orthonormal basis of eigenvectors \(\zeta^{\mu}\) of \(J\). 2-Select the eigenvector \(\zeta^{u_{D}}\) with the largest absolute eigenvalue. 3-Update \(J_{ij}\gets J_{ij}-\epsilon_{i}^{\omega_{D}}\zeta_{j}^{u_{D}}\). 4-Reset diagonal terms to zero \(J_{ii}\equiv 0\) endfor ``` **Algorithm 2** EVdreaming In this algorithm, the update of the couplings reduces the value of the highest eigenvalue by an amount \(\epsilon\), leaving the eigenvectors unchanged. Resetting the diagonal to zero, on the other hand, increases the value of every eigenvalue by a stochastic amount (see section III.2), and also modifies the eigenvectors. Each step of this algorithm is based on the spectrum of the current coupling matrix. Note that this algorithm could be implemented using purely local rules, by iterating the synchronous update \(\sigma^{t+1}=f(J\sigma^{t})\) with\(f(x)=\frac{x}{||x||_{2}}\), which converges towards the eigenvector of \(J\) with the largest eigenvalue. ### Initial Eigenvector dreaming An even simpler dreaming procedure, which does reproduce the qualitative features of HU (specifically the centrality of the spectrum evolution and the marginality of the eigenspaces evolution) is obtained by modifying the coupling matrix on the basis of the eigenvectors of the _initial_ coupling matrix \(J^{H}\), as listed in algorithm 3. We call this procedure _Initial Eigenvector dreaming_ (IEVdreaming). ``` 1-Initialize \(J\) using Hebb's rule eq. (2) 2-Find an orthonormal basis of eigenvectors \(\zeta^{\mu}\) of the initial coupling matrix. for\(D=1\) to \(D_{max}\)do 3-Consider the most recent coupling matrix \(J^{D-1}\), and select the eigenvector \(\zeta^{u_{D}}\) with the largest absolute eigenvalue. 4-Update \(J_{ij}\gets J_{ij}-\epsilon_{i}^{\omega_{D}}\zeta_{j}^{u_{D}}\). 5-Remove the average value of the diagonal elements of \(J\): \(J_{ii}\gets J_{ii}-\frac{\epsilon}{N}\). endfor ``` **Algorithm 3** IEVdreaming This algorithm is simple enough that it can be analyzed in some detail. Figure 4: On the x-axis, normalized number of steps of the dreaming algorithm. On the y-axes, eigenvalues of the coupling matrix, for one sample, \(N=100\). Eigenvalues at different steps of the algorithm are connected by colored lines. Darker colors indicate a high overlap between the corresponding eigenvectors. Only lines corresponding to overlaps larger than \(0.1\) are shown. The overlap among subsequent eigenvectors is high, except for the highest and lowest part of the ranked spectrum, where the eigenvalues are effectively degenerate. Figure 3: On the y-axes, the value of the eigenvalues; on the x-axes their ranking. Curves of different colors correspond to measures of the ranked spectrum taken after different amounts of dreams. Before dreaming, the spectrum is of the Marchenko–Pastur type. HU progressively flattens the high portion of the ranked spectrum ### A first analysis of IEVdreaming As a first approach, imagine removing step 5 of the iterative process, and simply setting the diagonal to zero after the for cycle. The resulting J reads \[J_{ij}^{D} =\sum_{\mu=1}^{N}\zeta_{i}^{\mu}\zeta_{j}^{\mu}\left(\lambda_{\mu}- \epsilon\sum_{d=1}^{D}\delta_{\mu}^{u_{d}}\right)+\epsilon\sum_{d=1}^{D}(\zeta _{i}^{u_{d}})^{2}\delta_{ij} \tag{6}\] \[=\sum_{\mu=1}^{N}\zeta_{i}^{\mu}\zeta_{j}^{\mu}\left(\lambda_{\mu }-\epsilon\sum_{d=1}^{D}\delta_{\mu}^{u_{d}}\right)+\epsilon\sum_{d=1}^{D}( \langle\zeta_{i}^{u_{d}}\rangle^{2})\delta_{ij}+\] \[\quad+\epsilon\sum_{d=1}^{D}\Big{[}(\zeta_{i}^{u_{d}})^{2}-\langle (\zeta_{i}^{u_{d}})^{2}\rangle\Big{]}\delta_{ij}\;,\] where the average \(\langle(\zeta_{i}^{u_{d}})^{2}\rangle\) is computed over the statistics generated by the choice of the eigenvector \(u_{D}\) to be dreamed at each step, given the realization of disorder (i.e. the value of the eigenvectors \(\zeta_{i}^{\mu}\)). Since the eigenvectors of a Wishart matrix are isotropically distributed on the \((N-1)\)-dimensional sphere, one has that \(\langle(\zeta_{i}^{u_{d}})^{2}\rangle=1/N\). The result is then \[J_{ij}^{D}\simeq\sum_{\mu=1}^{N}\zeta_{i}^{\mu}\zeta_{j}^{\mu}\left(\lambda_{ \mu}-\epsilon\,d_{\mu}\right)+\epsilon\frac{D}{N}\delta_{ij}+\eta_{ij}\,, \tag{7}\] where \(d_{\mu}=\sum_{D=1}^{D}\delta_{\mu}^{u_{D}}\) and \(\eta_{ij}\) is a diagonal random matrix \[\eta_{ij}\equiv\epsilon\sum_{d=1}^{D}\Big{[}(\zeta_{i}^{u_{d}})^{2}-\langle( \zeta_{i}^{u_{d}})^{2}\rangle\Big{]}\delta_{ij}\;. \tag{8}\] The first two terms preserve the eigenvectors of \(J\). The \(\eta\) correction changes both the eigenvectors and eigenvalues of the coupling matrix, and assuming that \(\eta\) is small enough, we can compute those changes perturbatively. In particular, the degenerate eigenspace corresponding to the low eigenvalue plateau will be split by corrections \(\lambda\to\lambda+\delta\lambda_{i}\), \(i=1,...,N-P\) given by the \(N-P\) eigenvalues of the matrix \[A^{\mu\nu}\equiv\zeta^{\mu\top}\eta\zeta^{\nu},\qquad\mu,\nu=1,...,N-P\,, \tag{9}\] where the eigenvectors all belong to the low eigenvalue degenerate plateau (any orthonormal set of eigenvectors is equivalent). In the thermodynamic limit, the impact of \(\eta\) on \(J\) becomes negligible, as shown in fig. 5. The \(x\)-axis represents \(N\). The \(y\)-axis represents the eigenvalues of the \(A\) matrix eq. (9) divided by the absolute height of the low plateau. In the thermodynamic limit, all curves tend to zero, showing that the corrections become negligible compared to the low plateau value. Some insight into this behavior can be gained by considering the statistics of the diagonal element of \(\eta\). Their average is zero, by definition. If the \(\xi_{i}^{\mu}\) involved in eq. (8) were a finite number, they could be treated as i.i.d. normal variables \(\mathcal{N}(0,1/N)\), and the statistics of \(\eta\) could be heuristically understood as proportional to a \(\chi^{2}\) distribution, whose variance scales as \(1/N\) (this is not exact, since not every eigenvector is dreamed the same number of times). Since we are dreaming an extensive number of eigenvectors, the \(\xi_{i}^{\mu}\) are not independent (for one thing, they are constrained by normalization \(\sum_{\mu=1}^{N}\xi_{i}^{\mu}=1\)). Intuitively though, this has the effect of reducing the variance of \(\eta_{ii}\). Hence, the \(\chi^{2}\) distribution is an upper bound for the size of \(\eta\), going to zero. Given this, the dreaming procedure is described by the simple update rule \[J_{ij}^{D}\simeq\sum_{\mu=1}^{N}\zeta_{i}^{\mu}\zeta_{j}^{\mu}\left(\lambda_{ \mu}-\epsilon d_{\mu}\right)+\epsilon\frac{D}{N}\delta_{ij}. \tag{10}\] This algorithm is very inexpensive from the computational point of view, since one does not need to compute eigenvectors multiple times. Whether the correction to the diagonal elements of \(J\) is carried out at each step of the algorithm or at the end, affects the choice of the eigenvector that gets dreamed: if the correction is carried out at the end, the negative degenerate plateau will quite soon be higher in absolute value than the high plateau (we call this _inversion_). Then, the algorithm will start selecting eigenvectors from the low plateau, which are orthogonal to the memories, having no effect on the stabilities. On the other hand, the choice in algorithm 3 reproduces the qualitative behavior of HU in an analytically simple setting, since taking out the diagonal at each step decreases the absolute value of the low negative plateau while increasing the absolute value of the positive plateau, delaying the inversion. ## IV Algorithm performance In fig. 6 we show representative examples of the evolution of \(\Delta_{min}\) according to the different dreaming procedures. The newly introduced algorithms have very simi Figure 5: Dispersion of the corrections to the low plateau eigenvalues, divided by the low plateau eigenvalue, at \(D_{top}\), as a function of N, for different values of \(\alpha\). As the system size is increased, the corrections become negligible compared to the low plateau eigenvalue. lar performance before the inversion point \(D_{inv}\) (marked by circles on the curves in fig. 6). This also indicates that the IEVdreaming is indeed a good model of EVdreaming. They also display the same qualitative behavior as HU. In fig. 6, crosses on the curves indicate when the algorithms start dreaming for the first time the lowest eigenvalue of the high portion of the ranked spectrum. This condition corresponds to the highest portion of the ranked spectrum becoming a plateau. In our new procedures this instant is very close to \(D_{top}\). After \(D_{top}\), IEV and EV display a plateau in the stability curve, which lasts until the inversion point, marked by dots in the curves. After the inversion point, which experimentally happens first in EVdreaming, EV and IEV display different behaviors, since the procedure becomes very sensitive to the eigenvectors dreamt. The behavior of IEV dreaming is detailed in section V. In fig. 7 we compare the different algorithms in terms of the retrieval mapping, at \(d=D_{in}\), where the performance is optimal. The quantitative differences in the \(\Delta_{min}\) profile between the algorithms are reduced to virtually no difference, when the retrieval mapping is concerned. Below the critical load wide basins of attractions are produced around the memories. Defining the critical capacity of an algorithm \(\alpha_{c}\) as the highest load such that \(\Delta_{min}>0\) is reached before \(D_{inv}\), we find \(\alpha^{IEVd}\sim 0.57\) and \(\alpha_{c}^{EVd}\sim 0.55\), to be compared with \(\alpha_{c}^{HU}\sim 0.59\). ## V Analytical characterization of IEVdreaming In the case of IEVdreaming, both the values of \(D_{top}\) and \(D_{inv}\) can be computed analytically. Let us define by \(\lambda_{l}(D)\) the height of the low plateau, by \(\lambda_{1-\alpha}(D)\) the height of the lowest eigenvalue in the high part of the ranked spectrum, and by \(\delta(D)\) the distance between the high plateau and \(\lambda_{1-\alpha}(D)\) (see fig. 8). Before dreaming, one has \[\lambda_{l}(0)=-\alpha \tag{11}\] \[\lambda_{1-\alpha}(0)=1-2\sqrt{\alpha}\] (12) \[\delta(0)=4\sqrt{\alpha}\;. \tag{13}\] At each dream, the change in the ranked spectrum consists of an increase of every eigenvalue due to the resetting to zero of the diagonal elements of \(J\), and a decrease of the dreamed eigenvalue, as per eq. (10). Prior to \(D_{top}\), i.e. before the high part of the ranked spectrum is completely flattened into a plateau, the evolution of the spectrum can be characterized by: \[\lambda_{l}(D)=\lambda_{l}(0)+\frac{\epsilon D}{N} \tag{14}\] \[\lambda_{1-\alpha}(D)=\lambda_{1-\alpha}(0)+\frac{\epsilon D}{N}\;, \tag{15}\] while \(\delta(D)\) can be determined numerically, noting that the area \(A(D)\) is \[A(D)=\frac{\epsilon D}{N}. \tag{16}\] Figure 8: Evolution of the ranked spectrum during IEVdreaming Figure 6: Evolution of \(\Delta_{min}\) while iterating different dreaming procedures, for some \(\alpha\) values. \(N=400\), \(\epsilon=0.001\). \(D_{top}\) is indicated by a cross, \(D_{inv}\) is indicated by a dot. The new algorithms have very similar performances before \(D_{inv}\), indicating the IEVdreaming is indeed a good model of EVdreaming. Figure 7: Retrieval mapping for the various dreaming procedures, at \(D=D_{in}\), where attraction basins are the largest. \(N=400\), \(\alpha=0.4\), \(\epsilon=0.01\). Different curves coincide, suggesting that our new dreaming procedures capture the essence of HU. Similar geometrical reasoning for \(D>D_{top}\) leads to even simpler equations: \[\lambda_{l}(D)=\lambda_{l}(D_{top})+\frac{\epsilon(D_{top}-D)}{N} \tag{17}\] \[\lambda_{1-\alpha}(D)=\lambda_{1-\alpha}(D_{top})+\frac{\epsilon( D_{top}-D)}{N}\Big{(}1-\frac{1}{\alpha}\Big{)}\] (18) \[\delta(D)=0\;. \tag{19}\] Given these relations, \(D_{top}\) and \(D_{inv}\) are determined by \[\delta\big{(}D_{top}\big{)}=0 \tag{20}\] \[\big{|}\lambda_{l}(D_{inv})\big{|}=\big{|}\lambda_{1-\alpha}(D_{ inv})+\delta(D_{inv})\big{|}\;. \tag{21}\] These theoretical results for \(D_{top}\) and \(D_{inv}\) are compared to the results of the numerical simulations in fig. 9, with excellent agreement. In IEV dreaming, the evolution of the stabilities is determined exclusively by the evolution of the spectrum of \(J\), since the eigenvectors do not change. \[\Delta_{i}^{\mu}=\xi_{i}^{\mu}\frac{\sum_{\nu=1}^{N}\lambda_{\nu}\zeta_{i}^{ \nu}w_{\nu}^{\mu}}{\sqrt{\sum_{\nu=1}^{N}\left(\lambda_{\nu}\zeta_{i}^{\nu} \right)^{2}}}, \tag{22}\] where \(w_{\nu}^{\mu}\) are the coordinates of the memories in the basis of the eigenvectors \[w_{\nu}^{\mu}\equiv(\mathbf{\zeta}^{\nu}\cdot\mathbf{\xi}^{\mu})\;. \tag{23}\] After \(D_{top}\), when the spectrum is composed by two plateaus \(\mathcal{P}\pm\), this expression simplifies to \[\Delta_{i}^{\mu}=\xi_{i}^{\mu}\frac{\sum_{\nu\in\mathcal{P}_{+}}\zeta_{i}^{ \nu}w_{\nu}^{\mu}}{\sqrt{\sum_{\nu\in\mathcal{P}_{+}}\left(\zeta_{i}^{\nu} \right)^{2}+\left(\frac{\lambda_{l}(D)}{\lambda_{1-\alpha}(D)}\right)^{2}\sum _{\nu\in\mathcal{P}_{-}}\left(\zeta_{i}^{\nu}\right)^{2}}}\;, \tag{24}\] which is constant (after \(D_{top}\)) as a consequence of eqs. (17) and (18). This explains the plateaus in fig. 6. For \(\alpha<0.5\), one has \(D_{inv}=P/\epsilon\), and \(\lambda_{l}(D_{inv})=\lambda_{1-\alpha}(D_{inv})=0\). This means that at \(D_{inv}\) we have \(J=0\). In numerical simulations, given the finite value of \(\epsilon\), this never happens. Instead, from \(D_{inv}\) the network dreams every eigenvector of the high plateau, making it smaller than the low plateau, and then every eigenvector in the low plateau. Over \(N\) dreams, all eigenvectors have been dreamed once. Thus, each eigenvalue is decreased once by \(-\epsilon\) and increased \(N\) times by \(\frac{\epsilon}{N}\), restoring it to the initial value. This reflects in a periodic behavior of \(\Delta_{min}\), which oscillates (see fig. 6). For \(\alpha>0.5\), on the other hand, the inversion happens with well separated plateaus \(\lambda_{l}(D_{inv})<0<\lambda_{1-\alpha}(D_{inv})\). Hence, around \(D_{inv}\), when the high plateau and the low plateau become closer than \(\epsilon\) in absolute value, the network starts dreaming one eigenvector of the low plateau. At each dream, the corresponding eigenvalue is made even smaller, i.e. bigger in absolute value, and the network gets stuck dreaming it repeatedly. Asymptotically, this eigenvector (orthogonal to the memories) dominates the coupling matrix, leading again to zero stability without oscillations (see fig. 6). ## VI Conclusions In this paper we unveiled an interesting feature of Hebbian Unlearning, namely the fact that eigenvectors of the coupling matrix do not change significantly during the algorithm, and the improvement in recognition performance is mostly due to a modification of the spectrum. Starting from this observation, we have proposed two new effective unlearning algorithms: Eigenvector dreaming and Initial Eigenvector dreaming, which emphasize the splitting of the learning problem into a trivial eigenvector evolution and a non-trivial spectrum evolution. IEVdreaming is the simplest algorithm, being computationally efficient and easy to control analytically. IEVdreaming turns out to give a very good description of EVdreaming, and a qualitatively good description of HU. Finally, in our new algorithms, we found a strong correlation between the moment when lowest eigenvalues of the high plateau starts being dreamed, and the moment when the algorithm stops increasing the minimum stability \(\Delta_{min}\). This correlation, which follows from simple analytical arguments in the case of IEV dreaming, is also present, to a lesser extent, in HU. ## VII Acknowledgments EM acknowledges funding from the PRIN funding scheme (2022LMHTET - Complexity, disorder and fluctuations: spin glass physics and beyond) and from the FIS (Fondo Italiano per la Scienza) funding scheme (FIS783 - SMaC - Statistical Mechanics and Complexity: theory meets experiments in spin glasses and neural networks) from Italian MUR (Ministery of University and Research). MM acknowledges financial support by the Figure 9: Comparison between analytical estimate and simulations for \(D_{inv}\) and \(D_{top}\) as a function of \(\alpha\). Parameters for the simulations are \(N=1000\), \(\epsilon=0.001\). The agreement is excellent, as finite size effects are already small at this size.

2306.05953

Calculation of the entropy for hard-sphere from integral equation method

The Ornstein-Zernike integral equation method has been employed for a single-component hard sphere fluid in terms of the Percus-Yevick (PY) and Martynov-Sarkisov (MS) approximations. Virial equation of state has been computed in both approximations. An excess chemical potential has been calculated with an analytical expression based on correlation functions, and the entropy has been computed with a thermodynamic relation. Calculations have been carried out for a reduced densities of 0.1 to 0.9. It has been shown that the MS approximation gives better values than those from the PY approximation, especially for high densities and presents a reasonable comparison with available data in the literature.

Purevkhuu Munkhbaatar, Banzragch Tsednee, Tsogbayar Tsednee, Tsookhuu Khinayat

2023-06-09T15:09:36Z

http://arxiv.org/abs/2306.05953v1

# Calculation of the entropy for hard-sphere from integral equation method ###### Abstract The Ornstein-Zernike integral equation method has been employed for a single-component hard sphere fluid in terms of the Percus-Yevick (PY) and Martynov-Sarkisov (MS) approximations. Virial equation of state has been computed in both approximations. An excess chemical potential has been calculated with an analytical expression based on correlation functions, and the entropy has been computed with a thermodynamic relation. Calculations have been carried out for a reduced densities of 0.1 to 0.9. It has been shown that the MS approximation gives better values than those from the PY approximation, especially for high densities and presents a reasonable comparison with available data in the literature. Introduction In classical statistical physics the physical systems, such as, a liquid can be described as a spherical symmetric hard-sphere particle model or Lennard-Jones potentials [1; 2]. Theoretical investigations for the systems can be performed with various methods, such as an explicit approaches-Monte-Carlo or Molecular dynamics simulations [1], and an implicit approaches represented as an integral equation or a polarizable continuum model methods [3]. An integral equation (IE) approach mentioned here is a mathematical tool we use in our study. As an implicit approach, the IE method does not consider a number of particles in the system which in turn may make a calculation a cheap, and a solution of the IE can give directly the correlation functions determining a general structure of the system. A one-component, homogeneous system can be successfully investigated with the Ornstein-Zernike (OZ) [4] IE theory combined with an appropriate auxiliary equation. In this work our purpose is to obtain an excess entropy for single-component hard-sphere fluid using the OZ IE approach combined with the Percus-Yevick [5] and Martynov-Sarkisov [6] approximations. To reach it, we will first compute a virial equation of state and along with it, we will obtain an excess chemical potential for the system at equilibrium using an analytical expression based on the correlation function. Using these two quantities, we will compute the excess entropy employing a thermodynamic relation. We will compare our findings for thermodynamic properties with available data in literature [7; 8]. Note that, to our knowledge, the MS approximation has not been tested for this calculation, yet, even though this problem had been considered in the past [7; 8; 9]. Therefore, we believe that our findings in this work can be considered as some contributions to this area. In Section II we will discuss about the Ornstein-Zernike theory and thermodynamic properties which we will compute. In Section III we present numerical results and their discussions. In Section IV the conclusion is given. ## II Theory ### The Ornstein-Zernike equation In statistical mechanics an structural properties for the liquids existing at equilibrium can be obtained in terms of the integral equation formalism [3]. For a single-component homogeneous system the Ornstein-Zernike integral equation can be written in the form \[h(r)=c(r)+\rho\int c(|\mathbf{r}-\mathbf{r}^{\prime}|)h(\mathbf{r}^{\prime})d \mathbf{r}^{\prime} \tag{1}\] where \(h(r)\) and \(c(r)\) are the total and direct correlation functions, respectively, and \(\rho\) is density of the system. In equation (1), the two correlation functions are unknown, therefore, it cannot be solved directly. To solve this OZ equation (1), we need another equation which is solved together with the OZ equation (1) in the self-consistent way. This required equation is called a _closure equation (relation)_ which may be written in the form \[h(r)=\exp[-\beta u(r)+\gamma(r)-B(r)]-1, \tag{2}\] where \(u(r)\) is a pair potential for particles in the system; \(\gamma(r)=h(r)-c(r)\) is an indirect correlation function; \(B(r)\) is a bridge function; \(\beta=1/k_{\mathrm{B}}T\) where \(k_{\mathrm{B}}\) is the Boltzmann's constant and \(T\) is a temperature of the system. The radial distribution function \(g\) can be defined as \(g(r)=h(r)+1\) as well. An inter-particle interaction potential for the hard-sphere with a diameter \(\sigma\) can be written in the form [2] \[u(r)=\begin{cases}0,&r\leq\sigma\\ \infty,&r>\sigma.\end{cases} \tag{3}\] The bridge functions we use in this work can be given in the forms: \[B(r)=\begin{cases}\ln(1+\gamma)-\gamma,&\text{Percus-Yevick (PY) \@@cite[cite]{[\@@bibref{}{Percus-Yevick (PY)}{}{}]}\\ \sqrt{1+2\gamma}-\gamma-1,&\text{Martynov-Sarkisov (MS) \@@cite[cite]{[\@@bibref{}{Martynov-Sarkisov (MS)}{}{}]}.\end{cases}}\] ### Thermodynamic quantities Once we solve the OZ equation (1), we can have the correlation functions with which we can compute thermodynamic properties for the system. #### ii.2.1 Virial equation of state For the hard-sphere system, the virial equation of state can be written in the form [2] \[\frac{\beta p}{\rho}=1+\frac{2\pi}{3}\rho\sigma^{3}g(\sigma), \tag{4}\] where \(g(\sigma)\) is the contact value of the radial distribution function at \(\sigma\). An excess chemical potential The excess (e) chemical potential \(\beta\mu^{e}\) can be computed with a following approximated analytical expression \[\beta\mu^{e} \approx \rho\int\Big{(}\frac{1}{2}h(r)^{2}-c(r)-\frac{1}{2}h(r)c(r)\Big{)} d\mathbf{r}\] \[+\rho\int\Big{(}B(r)+\frac{2}{3}h(r)B(r)\Big{)}d\mathbf{r}.\] Note that this expression does not depend an explicit form of the bridge function. Therefore, we can use it for both approximation in this work. A derivation of this expression can be found in Ref. [10]. #### ii.1.3 An excess entropy For the hard-sphere system in which an internal energy is zero, the excess entropy \(S^{e}/Nk_{B}\) can be computed as a following thermodynamic relation [2] \[\frac{S^{e}}{Nk_{\mathrm{B}}}=\frac{\beta p}{\rho}-\beta\mu^{e}-1. \tag{6}\] In evaluating expression (6), we use previously obtained values for the pressure and excess chemical potential. ## III Results and discussion In this work we have done calculations for a reduced densities: \(\rho\sigma^{3}=0.1\) to \(0.9\). For high density, such as, when \(\rho\sigma^{3}\sim 0.9\), the hard-sphere system behaves like a fluid [1]. We use the Picard iteration method to solve the OZ equation, in which the OZ equation (1) is solved in the Fourier space while the closure equation (2) is solved in a coordinate space. A number of grid points in a length interval of \([0,\,16\sigma]\) is \(2^{15}\). The numerical calculation has been done with an in-house Matlab [11] code. The numerical tolerance for a root-mean-squared residual of the indirect correlation functions of a successive iterations was set at \(10^{-8}\). In table 1 we have compared the values of the equation of states (EOS) and excess chemical potential obtained from both the PY and MS approximations with available data in Ref. [7], which was obtained in terms of the Carnahan and Starling (CS) EOS calculation [8]. We note that the CS data [8] can be considered as 'exact' values [7]. For higher densities, values for both quantities from PY approximation are lower than those from the MS approximation. The MS values are quite close to those obtained in Ref. [8]. Table 2 presents our findings for an excess entropy \(S^{e}/Nk_{\rm B}\) obtained in both approximations and their comparison with those of Refs. [7] and [8]. As expected, the largest deviations come from the PY results here, especially for high density, since both the PY pressure and excess chemical potential values are lower (previous table). Values from Ref. [7] are obtained with the help of hybrid-bridge function, which enables better values than ours. Based on results shown in tables 1 and 2 we note that the MS approximation makes better calculation than the PY does. A reason why this happens might be related to the fact that an correlation function from the MS approximation are better than those from the PY approximation [12; 13]. Finally, note that our results obtained are independent on number of grid points and a length interval employed. ## IV Conclusion In this work we have implemented the Orsnetein-Zernike integral equation theory with the Percus-Yevick and Martynov-Sarkisov bridge functions for single-component hard-sphere system. Analytical expressions based on correlation functions which have been obtained as a solution of the integral equation for a density, and an excess chemical potential and entropy have been tested. Our findings for these thermodynamic quantities from both approximations have been compared with available accurate data. It has been shown that Matrynov-Sarkisov approximation does work better than the Percus-Yevick approximation in which the integral equation can have a closed form solution [9]. The MS values are close to the accurate data. Note that it is better to use a well-approximated bridge functions, such as hybrid or pressure consistent bridge approximations [7] to obtain well-consistent data from the integral equation method. Acknowledgement(S) This research work has been supported by the Mongolian Foundation for Science and Technology (Project No. ShUTBIKhKhZG-2022/167).

2301.10447

On algebraic and non-algebraic neighborhoods of rational curves

We prove that for any $d>0$ there exists an embedding of the Riemann sphere $\mathbb P^1$ in a smooth complex surface, with self-intersection $d$, such that the germ of this embedding cannot be extended to an embedding in an algebraic surface but the field of germs of meromorphic functions along $C$ has transcendence degree $2$ over $\mathbb C$. We give two different constructions of such neighborhoods, either as blowdowns of a neighborhood of the smooth plane conic, or as ramified coverings of a neighborhood of a hyperplane section of a surface of minimal degree. The proofs of non-algebraicity of these neighborhoods are based on a classification, up to isomorphism, of algebraic germs of embeddings of $\mathbb P^1$, which is also obtained in the paper.

Serge Lvovski

2023-01-25T07:48:21Z

http://arxiv.org/abs/2301.10447v3

# On algebraic and non-algebraic neighborhoods of rational curves ###### Abstract. We prove that for any \(d>0\) there exists an embedding of the Riemann sphere \(\mathbb{P}^{1}\) in a smooth complex surface, with self-intersection \(d\), such that the germ of this embedding cannot be extended to an embedding in an algebraic surface but the field of germs of meromorphic functions along \(C\) has transcendence degree \(2\) over \(\mathbb{C}\). We give two different constructions of such neighborhoods, either as blowdowns of a neighborhood of the smooth plane conic, or as ramified coverings of a neighborhood of a hyperplane section of a surface of minimal degree. The proofs of non-algebraicity of these neighborhoods are based on a classification, up to isomorphism, of algebraic germs of embeddings of \(\mathbb{P}^{1}\), which is also obtained in the paper. Key words and phrases:Neighborhoods of rational curves, surfaces of minimal degree, blowup 2020 Mathematics Subject Classification: 32H99, 14J26 This study was partially supported by the HSE University Basic Research Program and by SRISA research project FNEF-2022-0007 (Reg. No 1021060909180-7-1.2.1). ## 1. Introduction In this paper we study germs of embeddings of the Riemann sphere aka \(\mathbb{P}^{1}\) in smooth complex surfaces (see precise definitions in Section 1.1 below). The structure of such germs for which the degree of the normal bundle, which is equal to the self-intersection index of the curve is question, is non-positive, is well known and simple (see [6] for the negative degree case and [10] for the zero degree case). Germs of embeddings \((C,U)\), where \(C\cong\mathbb{P}^{1}\), \(U\) is a smooth complex surface, and \((C\cdot C)>0\), are way more diverse. Let us say that a germ of neighborhood of \(C\cong\mathbb{P}^{1}\) is algebraic if it is isomorphic to the germ of embedding of \(C\) in a smooth algebraic surface. M. Mishustin, in his paper [9], showed that the space of isomorphism classes of germs of embeddings of \(C\cong\mathbb{P}^{1}\), \((C\cdot C)>0\), in smooth surfaces, is infinite-dimensional, so one would expect that "most" germs of such embeddings are not algebraic. (It is well known that if \((C\cdot C)=d\leq 0\), then for any such \(d\) there exists only one germ up to isomorphism, and these germs are algebraic.) In this paper we will construct explicit examples of non-algebraic germs of embeddings of \(\mathbb{P}^{1}\). An interesting series of such examples was constructed in a recent paper by M. Falla Luza and F. Loray [4]. For each \(d>0\), they construct an embedding of \(C\cong\mathbb{P}^{1}\) is a smooth surface such that \((C\cdot C)=d\) and the field of germs of meromorphic functions along \(C\) consists only of constants. For curves on an algebraic surface this is impossible, so the germs of neighborhoods constructed in [4] are examples of non-algebraic germs. In Section 5.3 of the paper [5] the same authors give an example of a non-algebraic germ of neighborhood of \(\mathbb{P}^{1}\), with self-intersection \(1\), for which the field of germs of meromorphic functions is as big as possible: it has transcendence degree \(2\) over \(\mathbb{C}\). The aim of this paper is to construct two series of explicit examples of non-algebraic germs of neighborhoods of \(\mathbb{P}^{1}\) for which the field of germs of meromorphic functions is as big as possible. The first of these series is constructed in Section 4. Specifically, for any integer \(m\geq 5\) we construct a non-algebraic germ of neighborhood \((C,U)\) such that \(C\cong\mathbb{P}^{1}\), \((C\cdot C)=m\), and one can blow up \(m-4\) points on \(C\) to obtain the germ of neighborhood of the conic in the plane. The field of germs of meromorphic functions along \(C\) has transcendence degree \(2\) over \(\mathbb{C}\) (Construction 4.10 and Proposition 4.11). The second series of examples is constructed in Section 5. For any positive integer \(n\) we construct a non-algebraic germ of neighborhood \((C,U)\) such that \(C\cong\mathbb{P}^{1}\), \((C\cdot C)=n\), and the field of germs of meromorphic functions along \(C\) has transcendence degree \(2\) over \(\mathbb{C}\), as a ramified two-sheeted covering of the germ of a neighborhood of \(\mathbb{P}^{1}\) with self-intersection \(2n\). This construction is a generalisation of that from [5, Section 5.3] (and coincides with the latter for \(n=1\)), but the method of proof if non-algebraicity is different. See Construction 5.3 and Proposition 5.4. I do not know whether the germs of neighborhoods constructed in Sections 4 and 5 are isomorphic. The proofs of non-algebraicity of the neighborhoods constructed in Sections 4 and 5 is based on the classification of algebraic germs of neighborhoods of \(\mathbb{P}^{1}\). It turns out that any such germ with self-intersection \(d>0\) is isomorphic to the germ of a hyperplane section of a surface of degree \(d\) in \(\mathbb{P}^{d+1}\); moreover, any isomorphism of germs of such embeddings \((C_{1},F_{1})\) and \((C_{2},F_{2})\) (where \(F_{j}\), \(j=1,2\), are surfaces of degree \(d\) in \(\mathbb{P}^{d+1}\) and \(C_{j}\) a hyperplane section of \(F_{j}\)) is induced by a linear isomorphism between the surfaces \(F_{1},F_{2}\subset\mathbb{P}^{d+1}\) (Propositions 3.3 and 3.4). The key role in the proofs is played by Lemma 3.6. The paper is organized as follows. In Section 2 we recall the properties of surfaces of degree \(d\) in \(\mathbb{P}^{d+1}\). In Section 3 we obtain a classification of algebraic neighborhoods of \(\mathbb{P}^{1}\). Finally, in Sections 4 and 5 we construct two series of examples of non-algebraic neighborhoods. **Acknowledgements.** I am grateful to Frank Loray and Grigory Merzon for useful discussions. ### Notation and conventions All algebraic varieties are varieties over \(\mathbb{C}\). All topological terminology pertains to the classical (complex) topology. Suppose we are given the pairs \((C_{1},S_{1})\) and \((C_{2},S_{2})\), where \(C_{j}\), \(j=1,2\), are projective algebraic curves contained in smooth complex analytic surfaces \(S_{j}\). We will say that these two pairs are _isomorphic as germs of neighborhoods_ if there exists an isomorphism \(\varphi\colon V_{1}\to V_{2}\), where \(C_{1}\subset V_{1}\subset S_{1}\), \(C_{2}\subset V_{2}\subset S_{2}\), \(V_{1}\) and \(V_{2}\) are open, such that \(\varphi(C_{1})=C_{2}\). In this paper we are mostly concerned with germs of neighborhoods, but sometimes, abusing the language, we will write "neighborhood" instead of "germ of neighborhoods"; this should not lead to confusion. If \(C\) is a projective algebraic curve on a smooth complex analytic surface \(S\), then a _germ of holomorphic_ (resp. _meromorphic_) _function along \(S\)_ is an equivalence class of pairs \((U,f)\), where \(U\) is a neighborhood of \(C\) in \(S\), \(f\) is a holomorphic (resp. meromorphic) function on \(U\), and \((U_{1},f_{1})\sim(U_{2},f_{2})\) if there exists a neighborhood \(V\supset C\), \(V\subset U_{1}\cap U_{2}\), on which \(f_{1}\) and \(f_{2}\) agree. Germs of holomorphic (resp. meromorphic) functions along \(C\subset S\) form a ring (resp. a field). The field of germs of meromorphic functions along \(C\subset S\) will be denoted, following the paper [4], by \(\mathcal{M}(S,C)\). According to [1], one has \(\operatorname{tr.deg}_{\mathbb{C}}\mathcal{M}(S,C)\leq 2\) (here and below, \(\operatorname{tr.deg}_{\mathbb{C}}\) means "transcendence degree over \(\mathbb{C}\)"). A germ of neighborhood of a projective curve \(C\) will be called _algebraic_ if it is isomorphic, as a germ, to the germ of neighborhood of \(C\) in \(X\), where \(X\supset C\) is a smooth projective algebraic surface; since desingularization of algebraic surfaces over \(\mathbb{C}\) exists, one may as well say that a germ of neighborhood of \(C\) is algebraic if it is isomorphic to the germ of a neighborhood \(C\subset X\), where \(X\) is a an arbitrary smooth algebraic surface, not necessarily projective. In this case, \(\operatorname{tr.deg}_{\mathbb{C}}\mathcal{M}(X,C)=2\) since this field contains the field of rational functions on \(X\). _Remark 1.1_.: A germ of neighborhood of a projective curve \(C\)_with positive self-intersection_ is algebraic if and only if it is isomorphic to the germ of embedding of \(C\) into a compact complex surface. Indeed, any smooth complex surface containing a projective curve with positive self-intersection, can be embedded in \(\mathbb{P}^{N}\) for some \(N\) (see [2, Chapter IV, Theorem 6.2]). A projective subvariety \(X\subset\mathbb{P}^{N}\) is called _non-degenerate_ if it does not lie in a hyperplane, and _linearly normal_ if the natural homomorphism from \(H^{0}(\mathbb{P}^{N},\mathcal{O}_{\mathbb{P}^{N}}(1))\) to \(H^{0}(X,\mathcal{O}_{X}(1))\) is surjective. If \(X\) is non-degenerate, the latter condition holds if and only if \(X\) is not an isomorphic projection of a non-degenerate subvariety of \(\mathbb{P}^{N+1}\). Non-degenerate projective subvarieties \(X_{1}\subset\mathbb{P}^{N_{1}}\) and \(X_{2}\subset\mathbb{P}^{N_{2}}\) will be called _projectively isomorphic_ if there exists a linear isomorphism \(f\colon\mathbb{P}^{N_{1}}\to\mathbb{P}^{N_{2}}\) such that \(f(X_{1})=X_{2}\) (in particular, it is implied in this definition that \(N_{1}=N_{2}\)). If \(C_{1}\) and \(C_{2}\) are two projective algebraic curves on a smooth complex surface, then \((C_{1}\cdot C_{2})\) is their intersection index. The terms "vector bundle" and "locally free sheaf" will be used interchangeably. If \(C\) is a smooth curve on a smooth complex surface \(X\), then \(\mathcal{N}_{X|C}\) is the normal bundle to \(C\) in \(X\). If \(\mathcal{E}\) is a vector bundle on an algebraic variety, then \(\mathbb{P}(\mathcal{E})\) (the projectivisation of \(\mathcal{E}\)) is the algebraic variety such that its points are lines in the fibers of \(\mathcal{E}\). If \(\mathcal{F}\) is a coherent sheaf on a complex space \(X\), we will sometimes write \(h^{i}(\mathcal{F})\) instead of \(\dim H^{i}(X,\mathcal{F})\). By definition, a projective surface \(X\) has _rational singularities_ if \(p_{*}\mathcal{O}_{\bar{X}}=\mathcal{O}_{X}\) and \(R^{1}p_{*}\mathcal{O}_{\bar{X}}=0\) for some (hence, any) desingularization \(p\colon\bar{X}\to\bar{X}\). If \(f\colon S\to T\) is a dominant morphism of smooth projective algebraic surfaces, we will say that its _critical locus_ is the set \[R=f(\{x\in S\colon df_{x}\text{ is degenerate}\})\subset T,\] and that its _branch divisor_\(B\subset T\) is the union of one-dimensional components of \(R\). ## 2. Recap on surfaces of minimal degree In this section we will recall, without proofs, some well-known results. Most of the details can be found in [3]. If \(X\subset\mathbb{P}^{N}\) is a non-degenerate irreducible projective variety, then \[\deg X\geq\operatorname{codim}X+1, \tag{1}\] and there exists a classification of the varieties for which the lower bound (1) is attained. We reproduce this classification for the case \(\dim X=2\). **Notation 2.1**.: For any integer \(n\geq 0\), put \(\mathbb{F}_{n}=\mathbb{P}(\mathcal{O}_{\mathbb{P}^{1}}\oplus\mathcal{O}_{ \mathbb{P}^{1}}(n))\). The surface \(\mathbb{F}_{0}\) is just the quadric \(\mathbb{P}^{1}\times\mathbb{P}^{1}\); if \(n>0\), then the natural projection \(\mathbb{F}_{n}\to\mathbb{P}^{1}\) has a unique section \(E\subset\mathbb{F}_{n}\) such that \((E\cdot E)=-n\). The section \(E\) will be called _the exceptional section_ of \(\mathbb{F}_{n}\). The divisor class group of \(\mathbb{F}_{n}\) is generated by the class \(e\) of the exceptional section and the class \(f\) of the fiber (if \(n=0\), we denote by \(e\) and \(f\) the classes of lines of two rulings on \(\mathbb{P}^{1}\times\mathbb{P}^{1}\)). One has \[(e\cdot e)=-n,\quad(e\cdot f)=1,\quad(f\cdot f)=0. \tag{2}\] If \(r\geqslant 0\) is an integer and \((n,r)\neq(0,0)\), then the complete linear system \(|e+(n+r)f|\) on \(\mathbb{F}_{n}\) has no basepoints and defines a mapping \(\mathbb{F}_{n}\to\mathbb{P}^{n+2r+1}\). **Notation 2.2**.: If \(n,r\) are non-negative integers and \((n,r)\neq(0,0)\), then by \(F_{n,r}\subset\mathbb{P}^{n+2r+1}\) we will denote the image of the mapping \(\mathbb{F}_{n}\to\mathbb{P}^{n+2r+1}\) defined by the complete linear system \(|e+(n+r)f|\). It follows from (2) that the variety \(F_{n,r}\subset\mathbb{P}^{n+2r+1}\) is a surface of degree \(n+2r\). If \(r>0\), the surface \(F_{n,r}\) is smooth and isomorphic to \(\mathbb{F}_{n}\). The surface \(F_{n,0}\) with \(n\geq 2\) is the cone over the normal rational curve of degree \(n\) in \(\mathbb{P}^{n}\) (this cone is obtained by contracting the exceptional section on \(\mathbb{F}_{n}\)), and the surface \(F_{1,0}\) is just the plane; the surfaces \(F_{n,0}\) are normal and, moreover, have rational singularities. If \(n>0\) and \(r>0\), then the exceptional section on \(F_{n,r}\) is a rational curve of degree \(r\). Finally, the surface \(F_{0,1}\subset\mathbb{P}^{3}\) is the smooth quadric. Recall that the quadratic Veronese surface \(V\subset\mathbb{P}^{5}\) is the image of the mapping \(v\colon\mathbb{P}^{2}\to\mathbb{P}^{5}\) defined by the formula \[v\colon(x_{0}:x_{1}:x_{2})\mapsto(x_{0}^{2}:x_{1}^{2}:x_{2}^{2}:x_{0}x_{1}:x_{ 0}x_{2}:x_{1}x_{2}); \tag{3}\] one has \(\deg V=4\). The mapping \(v\) induces an isomorphism from \(\mathbb{P}^{2}\) to \(V\); hyperplane sections of \(V\) are images of conics in \(\mathbb{P}^{2}\). **Proposition 2.3**.: _If \(X\subset\mathbb{P}^{N}\) is a non-degenerate irreducible projective surface, then \(\deg X\geq N-1\) and the bound is attained if and only if either \(X=F_{n,r}\), where \((n,r)\neq(0,0)\), or \(X=V\subset\mathbb{P}^{5}\), where \(V\) is the quadratic Veronese surface._ If \((n,r)\neq(n^{\prime},r^{\prime})\), then the surfaces \(F_{n,r}\) and \(F_{n^{\prime},r^{\prime}}\) are _not_ projectively isomorphic, and none of them is projectively isomorphic to the Veronese surface \(V\). (Indeed, if \(n\neq n^{\prime}\) then \(F_{n,r}\) and \(F_{n^{\prime},r^{\prime}}\) are not isomorphic even as abstract varieties, and if \(n=n^{\prime}\) but \(r\neq r^{\prime}\) then their degrees are different; speaking of the Veronese surface, it does not contain lines while each \(F_{n,r}\) is swept by lines.) Suppose now that \(X\subset\mathbb{P}^{N+1}\), \(N\geq 2\), is a surface of minimal degree (i.e., of degree \(N\)) and \(p\in F\) is a smooth point (i.e., either \(X\neq F_{n,0}\) and \(p\) is arbitrary or \(X=F_{n,0}\) and \(p\) is not the vertex of the cone). Let \(\pi_{p}\) denote the projection from \(\mathbb{P}^{N+1}\) to \(\mathbb{P}^{N}\) with the center \(p\). **Proposition 2.4**.: _In the above setting, the projection \(\pi_{p}\) induces a birational mapping from \(X\) onto its image. If \(X^{\prime}\subset\mathbb{P}^{N}\) is \((\)the closure of\()\) the image of \(\pi_{p}\colon X\dashrightarrow\mathbb{P}^{N}\), then \(X^{\prime}\) is also a surface of minimal degree._ _If \(X=F_{n,r}\), where \(n>0\) and \(r>0\), then \(X^{\prime}=F_{n+1,r-1}\) if \(p\) lies on the exceptional section and \(X^{\prime}=F_{n-1,r}\) otherwise._ _If \(X=F_{0,r}\), \(r>0\), then \(X^{\prime}=F_{1,r-1}\)._ _If \(X=F_{n,0}\), \(n\geq 2\), then \(X^{\prime}=F_{n-1,0}\)._ _Finally, if \(X=V\subset\mathbb{P}^{5}\), then \(X^{\prime}=F_{1,1}\subset\mathbb{P}^{4}\)._ These projections for surfaces of minimal degree \(\leq 6\) are depicted in Figure 1. Observe that no arrow points at the surface \(V\); this fact will play a crucial role in the sequel. The birational transformations induced by the projections form Proposition 2.4 can be described explicitly. **Proposition 2.5**.: _Suppose that \(F\subset\mathbb{P}^{N}\) is a surface of minimal degree, \(p\in F\) is a non-singular point, and \(\pi_{p}\colon F\dasharrow\mathbb{P}^{N-1}\) is the projection from \(p\). The projection \(\pi_{p}\) acts on the surface \(F\) as follows._ 1. _If_ \(F=F_{n,r}\subset\mathbb{P}^{n+2r+1}\)_, where_ \(r>1\)_, then the projection_ \(\pi_{p}\) _blows up the point_ \(p\) _and blows down the strict transform of the only line on_ \(F\) _passing through_ \(p\)_._ 2. _If_ \(F=F_{n,1}\subset\mathbb{P}^{n+3}\)_, where_ \(n>0\) _(in this case the exceptional section of_ \(F\cong\mathbb{F}_{n}\) _is a line), then two cases are possible._ _If the point_ \(p\) _does not lie on the exceptional section, then the projection_ \(\pi_{p}\) _blows up the point_ \(p\) _and blows down the strict transform of the only line passing through_ \(p\)_, and the image of the projection is the surface_ \(F_{n-1,1}\subset\mathbb{P}^{n+2}\)_. If, on the other hand,_ \(p\) _lies on the exceptional section, then the projection_ \(\pi_{p}\) _blows up the point_ \(p\) _and blows down both the strict transform of the fiber passing through_ \(p\) _and the strict transform of the exceptional section; in this latter case the image of the projection is the cone_ \(F_{n+1,0}\subset\mathbb{P}^{n+2}\) _(the strict transform of the exceptional section is blown down to the vertex of the cone)._ 3. _If_ \(F=F_{0,1}\subset\mathbb{P}^{3}\) _(that is, if_ \(F\subset\mathbb{P}^{3}\) _is the smooth quadric), then the projection_ \(\pi_{p}\) _blows up the point_ \(p\) _and blows down strict transforms Figure 1. Projections of surfaces of minimal degree of the two lines passing through \(p\); the image of the projection is, of course, just the plane._ 4. _If_ \(F=F_{n,0}\subset\mathbb{P}^{n+1}\)_, where_ \(n>1\) _(that is, if_ \(F\) _is a cone over the rational normal curve of degree_ \(n\) _in_ \(\mathbb{P}^{n}\)_), then the projection_ \(\pi_{p}\) _blows up the point_ \(p\) _and blows down the strict transform of the generatrix of the cone passing through_ \(p\)_; the image of this projection is the cone_ \(F_{n-1,0}\subset\mathbb{P}^{n}\) _(if_ \(n=2\)_, this cone is just the plane)._ 5. _Finally, if_ \(F=V\subset\mathbb{P}^{5}\) _is the Veronese surface, then the projection_ \(\pi_{p}\) _just blows up the point_ \(p\)_, and the image of this projection is_ \(F_{1,1}\subset\mathbb{P}^{3}\)_._ ## 3. Rational curves with positive self-intersection and algebraic germs **Proposition 3.1**.: _Suppose that \(X\) is a smooth projective surface and \(C\subset X\) is a curve isomorphic to \(\mathbb{P}^{1}\). If \((C\cdot C)=m>0\), then the complete linear system \(|C|\) has no basepoints, \(\dim|C|=m+1\), the morphism \(\varphi_{|C|}\) is a birational isomorphism between \(X\) and \(\varphi(X)\subset\mathbb{P}^{m+1}\), and \(\varphi(X)\) is a surface in \(\mathbb{P}^{m+1}\) of minimal degree \(m\)._ Proof.: Since the normal bundle \(\mathcal{N}_{X|C}\) is isomorphic to \(\mathcal{O}_{\mathbb{P}^{1}}(m)\), where \(m>0\), one has \(h^{0}(\mathcal{N}_{X|C})=m+1\), \(h^{1}(\mathcal{N}_{X|C})=0\), so the Hilbert scheme of the curve \(C\subset X\) is smooth and has dimension \(m+1\) at the point corresponding to the curve \(C\). A general curve from this \((m+1)\)-dimensional family is isomorphic to \(\mathbb{P}^{1}\); since \(m>0\), through a general point \(p\in X\) there passes a positive-dimensional family of rational curves. Therefore, the Albanese mapping of \(X\) is constant, whence \(H^{1}(X,\mathcal{O}_{X})=0\). Now it follows from the exact sequence \[0\to\mathcal{O}_{X}\to\mathcal{O}_{X}(C)\xrightarrow{\alpha}\mathcal{O}_{C}(C )\to 0 \tag{4}\] that the homomorphism \(\alpha_{*}\colon H^{0}(X,\mathcal{O}_{X}(C))\to H^{0}(C,\mathcal{O}_{C}(C))\) is surjective. Since the linear system \(|\mathcal{O}_{C}(C)|=|\mathcal{O}_{\mathbb{P}^{1}}(m)|\) has no basepoints, the linear system \(|C|\) has no basepoints either, and it follows from (4) and the vanishing of \(H^{1}(\mathcal{O}_{X})\) that \(\dim|C|=m+1\). If \(\varphi=\varphi_{|C|}\colon X\to\mathbb{P}^{m+1}\) and \(Y=\varphi(X)\), then \(\dim Y=2\) and \(\deg Y\cdot\deg\varphi=(C\cdot C)=m\). Since \(Y\subset\mathbb{P}^{m+1}\) is non-degenerate, one has \(\deg Y\geq m\) (see (1)), whence \(\deg Y=m\) and \(\deg\varphi=1\), so \(\varphi\) is birational onto its image. **Corollary 3.2**.: _If \(X\) is a projective surface with rational singularities and \(C\subset X_{\rm sm}\) is a curve that is isomorphic to \(\mathbb{P}^{1}\) and such that \((C\cdot C)>0\), then \(h^{1}(\mathcal{O}_{X})=0\) and \(h^{0}(\mathcal{O}_{X}(C))=(C\cdot C)+1\)._ Proof.: Let \(\bar{X}\) be a desingularization of \(X\). Arguing as in the proof of Proposition 3.1, we conclude that through a general point of \(\bar{X}\) there passes a positive-dimensional family of rational curves, whence \(H^{1}(\bar{X},\mathcal{O}_{\bar{X}})=0\). Since the singularities of the surface \(X\) are rational, \(H^{1}(X,\mathcal{O}_{X})\), so \(H^{1}(X,\mathcal{O}_{X})=0\). Now the result follows from the exact sequence (4). Proposition 3.1 implies the following characterisation of algebraic neighborhoods of rational curves. **Proposition 3.3**.: _If \((C,U)\) is an algebraic neighborhood of the curve \(C\cong\mathbb{P}^{1}\) and if \((C\cdot C)=d>0\), then the germ of this neighborhood is isomorphic to the germ of neighborhood of a smooth hyperplane section in a surface of minimal degree \(d\) in \(\mathbb{P}^{d+1}\)._ Proof.: Passing to desingularization, one may without loss of generality assume that the neighborhood in question is a neighborhood of a curve \(C\subset X\), where \(C\cong\mathbb{P}^{1}\), \(X\) is a smooth projective surface, and \((C\cdot C)=d>0\). If \(\varphi\colon X\to Y\), where \(Y\) is a surface of minimal degree, is the birational morphism the existence of which is asserted by Proposition 3.1, then \(\varphi\) is an isomorphism in a neighborhood of \(C\) and \(\varphi(C)\) is a hyperplane section of \(Y\), whence the result. Proposition 3.3 may be regarded as a generalization of Proposition 4.7 from [8], which asserts that any algebraic germ of neighborhood of \(\mathbb{P}^{1}\) with self-intersection \(1\) is isomorphic to the germ of neighborhood of a line in \(\mathbb{P}^{2}\). Now we show that not only all germs of algebraic neighborhoods of \(\mathbb{P}^{1}\) can be obtained from surfaces of minimal degree, but that their isomorphisms are induced by isomorphisms of surfaces of minimal degree. **Proposition 3.4**.: _Suppose that \(X_{1}\subset\mathbb{P}^{N_{1}}\) and \(X_{2}\subset\mathbb{P}^{N_{2}}\) are linearly normal projective surfaces with rational singularities, \(C_{1}\subset X_{1}\) and \(C_{2}\subset X_{2}\) are their smooth hyperplane sections, and that \(C_{1}\) and \(C_{2}\) are isomorphic to \(\mathbb{P}^{1}\)._ _If there exist analytic neighborhoods \(U_{j}\supset C_{j}\), \(j=1,2\), and a holomorphic isomorphism \(\varphi\colon U_{1}\to U_{2}\) such that \(\varphi(C_{1})=C_{2}\), then \(\varphi\) extends to a projective isomorphism \(\Phi\colon X_{1}\to X_{2}\)._ To prove this proposition we need two lemmas. The first of them is well known. **Lemma 3.5**.: _If \(X\) is a projective surface with isolated singularities and \(C\subset X_{\rm sm}\) is an ample irreducible curve, then the ring of germs of holomorphic functions along \(C\) coincides with \(\mathbb{C}\)._ Sketch of proof.: This follows immediately from the fact that \(H^{0}(\hat{X},\mathcal{O}_{\hat{X}})=\mathbb{C}\), where \(\hat{X}\) is the formal completion of \(X\) along \(C\) (see [7, Chapter V, Proposition 1.1 and Corollary 2.3]). Here is a more elementary argument. Since \(C\) is an ample divisor in \(X\), there exists and embedding of \(X\) in \(\mathbb{P}^{N}\) such that \(rC\), for some \(r>0\), is a hyperplane section of \(X\). Suppose that \(U\supset C\), \(U\subset X\) is a connected neighborhood of \(C\). There exists a family of hyperplane sections \(\{H_{\alpha}\}\), close to the one corresponding to \(rC\), such that \(H_{\alpha}\subset U\) for each \(\alpha\) and contains a non-empty open subset \(V\subset U\). If \(f\) is a holomorphic function on \(U\), then \(f\) is constant on each \(H_{\alpha}\); since \(H_{\alpha}\cap H_{\alpha^{\prime}}\neq\varnothing\) for each \(\alpha\) and \(\alpha^{\prime}\), \(f\) is constant on the union of all the \(H_{\alpha}\)'s, hence on \(V\), hence on \(U\). **Lemma 3.6**.: _Suppose that \(X\) is a projective surface such that \(H^{1}(X,\mathcal{O}_{X})=0\), \(D\subset X_{\mathrm{sm}}\) is an ample irreducible projective curve, and \(r\) is a positive integer. Then any germ of meromorphic function along \(C\), with possibly a pole of order \(\leq r\) along \(C\) and no other poles, is induced by a rational function on \(X\) with possibly a pole of order \(\leq r\) along \(C\) and no other poles._ Proof.: Let \(\mathcal{I}_{C}\subset\mathcal{O}_{X}\) be the ideal sheaf of \(C\); put \(\mathcal{I}_{rc}=\mathcal{I}_{c}^{m}\), \(\mathcal{O}_{rC}=\mathcal{O}_{X}/\mathcal{I}_{c}^{m}\), and \[\mathcal{N}_{X|rC}=\underline{\mathrm{Hom}}_{\mathcal{O}_{rC}}(\mathcal{I}_{rC }/\mathcal{I}_{rC}^{2},\mathcal{O}_{rC})=\underline{\mathrm{Hom}}_{\mathcal{O }_{X}}(\mathcal{I}_{rC},\mathcal{O}_{rC}).\] Identifying \(\mathcal{O}_{X}(rC)\) with the sheaf of meromorphic functions having at worst a pole of order \(\leq r\) along \(C\), one has the exact sequence \[0\to\mathcal{O}_{X}\to\mathcal{O}_{X}(rC)\xrightarrow{\alpha}\mathcal{N}_{X|rC }\to 0, \tag{5}\] in which the homomorphism \(\alpha\) has the form \[g\mapsto(s\mapsto gs\bmod\mathcal{I}_{rC}),\] where \(g\) is a meromorphic function on an open subset of \(V\subset X\), with at worst a pole of order \(\leq r\) along \(C\) and \(s\) is a section of \(\mathcal{I}_{rC}\) over \(V\). In particular, if \(U\supset C\) is a neighborhood, then any section of \(g\in H^{0}(U,\mathcal{O}_{X}(rC))\) induces a global section of \(\mathcal{N}_{X|rC}\). Since \(H^{1}(X,\mathcal{O}_{X})=0\), the homomorphism \(\alpha\) from (5) induces a surjection on global sections, so there exists a section \(f\in H^{0}(X,\mathcal{O}_{X}(rC))\) such that \(f\) and \(g\) induce the same global section of \(\mathcal{N}_{X|rC}\). Hence, the meromorphic function \((f|_{U})-g\) has no pole in \(U\), so by virtue of Lemma 3.5 this function is equal to a constant \(c\) on a (possibly smaller) neighborhood of \(C\). Thus, the germ of \(f-c\) along \(C\) equals that of \(g\). Proof of Proposition 3.4.: It follows from the hypothesis that \((C_{1}\cdot C_{1})=(C_{2}\cdot C_{2})\). If we denote these intersection indices by \(m\), then Corollary 3.2 implies that \(\dim|C_{1}|=\dim|C_{2}|=m+1\). Let \(f_{0},\ldots,f_{m+1}\) be a basis of \(H^{0}(\mathcal{O}_{X_{1}}(C_{1}))\) (i.e., the basis of space of meromorphic functions on \(X_{1}\) with at worst a simple pole along \(C_{1}\)), and similarly let \((g_{0},\ldots,g_{m+1})\) be a basis of \(H^{0}(\mathcal{O}_{X_{2}}(C_{2}))\). Embed \(X_{1}\) (resp. \(X_{2}\)) into \(\mathbb{P}^{m+1}\) with the linear system \(|C_{1}|\) (resp. \(|C_{2}|\)), that is, with the mappings \[x\mapsto(f_{0}(x):\cdots:f_{n+1}(x))\quad\text{and}\quad y\mapsto(g_{0}(y): \cdots:g_{n+1}(y)).\] If \(\gamma_{i}\), \(0\leq i\leq m+1\), is the germ along \(C_{1}\) of the meromorphic function \(g_{i}\circ\varphi\), then by virtue of Lemma 3.6, which we apply in the case \(r=1\), each \(\gamma_{i}\) is the germ along \(C_{1}\) of a meromorphic function \(h_{i}\in H^{0}(\mathcal{O}_{X_{1}}(C_{1}))\). If \(h_{i}=\sum a_{ij}f_{j}\), then the matrix \(\|a_{ij}\|\) defines a linear automorphism \(\Phi\colon\mathbb{P}^{m+1}\to\mathbb{P}^{m+1}\) such that its restriction to a neighborhood of \(C_{1}\) coincides with \(\Phi\). Hence, \(\Phi\) maps \(X_{1}\) isomorphically onto \(X_{2}\) **Corollary 3.7**.: _Suppose that \(F\subset\mathbb{P}^{m}\)\((\)resp. \(F^{\prime}\subset\mathbb{P}^{m^{\prime}})\) is a surface of minimal degree and \(C\)\((\)resp. \(C^{\prime})\) is its smooth hyperplane section. Then the germs of neighborhoods of \(C\) in \(F\) and of \(C^{\prime}\) in \(F^{\prime}\) are isomorphic if and only if there exists a linear isomorphism \(\Phi\colon\mathbb{P}^{m}\to\mathbb{P}^{m^{\prime}}\) such that \(\Phi(F)=F^{\prime}\) and \(\Phi(C)=C^{\prime}\)._ Proof.: Immediate from Proposition 3.4 if one takes into account that all surfaces of minimal degree have rational singularities. _Remark 3.8_.: We see that any algebraic neighborhood of \(C\cong\mathbb{P}^{1}\) has one more discrete invariant, besides the self-intersection \(d=(C\cdot C)\): if this neighborhood is isomorphic to the germ of neighborhood of the minimal surface \(F_{n,r}\), where \(d=n+2r\), this is the integer \(n\geq 0\) (and if the surface is not \(F_{n,r}\) but the Veronese surface \(V\subset\mathbb{P}^{5}\), we assign to our neighborhood the tag \(V\) instead). It should be noted however that, as a rule, the pair \((d,n)\) does _not_ determine the germ of neighborhood up to isomorphism. Indeed, the dimension of the group of automorphisms of the surface \(\mathbb{F}_{n}\) is \(n+5\) if \(n>0\) and \(6\) if \(n=0\). In most cases this is less that the dimension of the space of hyperplanes in \(\mathbb{P}^{n+2r+1}\), in which \(F_{n,r}\) is embedded. On the other hand, linear automorphisms of \(F_{n,0}\subset\mathbb{P}^{n+1}\) act transitively on the set of smooth hyperplane sections of \(F_{n,0}\), and ditto for \(V\subset\mathbb{P}^{5}\). Thus, tags \((n,0)\) or \(V\) do determine an algebraic germ of neighborhood of \(\mathbb{P}^{1}\) up to isomorphism. ## 4. Blowups and blowdowns Suppose that a smooth projective curve \(C\) lies on a smooth complex analytic surface \(S\) and that \(p\in C\). Let \(\sigma\colon\tilde{S}\to S\) be the blowup of \(S\) at \(p\), and let \(\tilde{C}\subset\tilde{S}\) be the strict transform of \(C\). It is clear that the germ of neighborhood \(\tilde{C}\subset\tilde{S}\) depends only on the germ of neighborhood \(C\subset S\) and on the point \(p\in C\). **Definition 4.1**.: In the above setting, the germ of neighborhood \((\tilde{C},\tilde{U})\) will be called _the blowup_ of the germ \((C,U)\) at the point \(p\). For future reference we state the following obvious properties of blowups of neighborhoods. **Proposition 4.2**.: _Suppose that the germ of neighborhoods \((\tilde{C},\tilde{U})\) is a blowup of \((C,U)\). Then_ 1. \(\tilde{C}\) _is isomorphic to_ \(C\)_;_ 2. \((\tilde{C}\cdot\tilde{C})=(C\cdot C)-1\)_;_ 3. _if_ \((C,U)\) _is algebraic then_ \((\tilde{C},\tilde{U})\) _is algebraic._ For algebraic neighborhoods of \(\mathbb{P}^{1}\) the assertion (3) of Proposition 4.2 can be made more explicit. **Proposition 4.3**.: _If an algebraic germ \((C,U)\) is isomorphic to the germ of neighborhood of a hyperplane section of a surface of minimal degree \(F\subset\mathbb{P}^{N}\) _then the blowup of this germ at a point \(p\in C\) is isomorphic to the germ of neighborhood of a hyperplane section of the surface \(F^{\prime}\subset\mathbb{P}^{N-1}\) that is obtained from \(F\) by projection from the point \(p\)._ Proof.: Immediate from Proposition 2.5. _Remark 4.4_.: Even though \(\mathbb{P}^{1}\) is homogeneous, which means that its points are indistinguishable, germs of blowups of a given neighborhood of \(\mathbb{P}^{1}\) at different points are not necessarily isomorphic. Indeed, suppose that \(C\cong\mathbb{P}^{1}\) is a smooth hyperplane section of the surface \(F_{n,r}\), where \(n>0\) and \(r>0\). If \(p\in C\) does not lie on the exceptional section \(E\subset F_{n,r}\), then Proposition 2.4 implies that the blowup at \(p\) of the germ of neighborhood of \(C\) is isomorphic to a neighborhood of a hyperplane section of \(F_{n-1,r}\), and if \(p\) does lie on \(E\), Proposition 2.4 implies that the blowup in question is isomorphic to a neighborhood of a hyperplane section of \(F_{n+1,r-1}\) (observe that \(C\neq E\) and \(C\cap E\neq\varnothing\), so points of both kinds are present). If the blowups at such points were isomorphic as germs of neighborhoods, then, by virtue of Proposition 3.4, this isomorphism would be induced by a linear isomorphism between \(F_{n-1,r}\) and \(F_{n+1,r-1}\), which does not exist. **Proposition 4.5**.: _Suppose that a curve \(D\cong\mathbb{P}^{1}\) is embedded in a surface \(U\). If, blowing up \(s>0\) points of the germ of neighborhood \((D,U)\), one obtains a germ of neighborhood \((C,W)\) that is isomorphic to the germ of neighborhood of a non-degenerate conic in \(\mathbb{P}^{2}\), then the original germ \((D,U)\) is not algebraic._ Proof.: Without loss of generality we may and will assume that \(C\) is a conic in \(\mathbb{P}^{2}\) and \(W\supset C\) is an open subset of \(\mathbb{P}^{2}\). The Veronese mapping \(v\colon\mathbb{P}^{2}\to V\) (see (3)) identifies \(\mathbb{P}^{2}\) with the Veronese surface \(V\subset\mathbb{P}^{5}\) and \(C\subset\mathbb{P}^{2}\) with a smooth hyperplane section of \(V\). Arguing by contradiction, suppose that the germ \((D,U)\) is algebraic. Then Proposition 3.3 implies that this germ is isomorphic to the germ of neighborhood of a hyperplane section of a surface of minimal degree \(m=4+s>4\). Hence, this surface is of the form \(F_{n,r}\), where \(n+2r=m\) (see Proposition 2.3). By construction, the germ of \((C,W)\) can be obtained from the germ \((D,U)\) by blowing up \(s\) points on \(D\). Hence, by Proposition 4.3, the germ of \((C,W)\) is isomorphic to the germ of a hyperplane section of a surface that can be obtained from \(F_{n,r}\) by \(s\) consecutive projections. However, Proposition 2.4 shows that the resulting surface cannot be projectively isomorphic to \(V\subset\mathbb{P}^{5}\) (cf. Figure 1). On the other hand, Proposition 3.4 implies that if germs of hyperplane sections of two surfaces of minimal degree are isomorphic then the surfaces are projectively isomorphic. This contradiction shows that the germ \((D,U)\) is not algebraic. Now we can construct our first series of non-algebraic examples. **Lemma 4.6**.: _Suppose that \(C\subset\mathbb{P}^{2}\) is a non-degenerate conic and \(s\) is a positive integer. Then there exist \(s\) lines \(L_{1},\ldots,L_{s}\subset\mathbb{P}^{2}\) neighborhoods \(W\supset C\), \(W_{j}\supset L_{j}\), \(1\leq j\leq s\), in \(\mathbb{P}^{2}\) having the following properties._ 1. _each_ \(L_{j}\) _intersects the conic_ \(C\) _at precisely two points,_ \(p_{j}\) _and_ \(q_{j}\)_;_ 2. _all the points_ \(p_{1},\ldots,p_{s}\) _are distinct, all the points_ \(q_{1},\ldots,q_{s}\) _are distinct, and_ \(p_{i}\neq q_{j}\) _for any_ \(i,j\)_._ 3. \(W_{j}\cap W\cap\{p_{1},\ldots,p_{s},q_{1},\ldots,q_{s}\}=\{p_{j},q_{j}\}\) _for each_ \(j\)_._ 4. _The open subset_ \(W_{j}\cap W\) _has precisely two connected components_ \(P_{j}\ni p_{j}\) _and_ \(Q_{j}\ni q_{j}\)_._ 5. \(P_{i}\cap P_{j}=\varnothing\) _whenever_ \(i\neq j\)_,_ \(Q_{i}\cap Q_{j}=\varnothing\) _whenever_ \(i\neq j\)_, and_ \(P_{i}\cap Q_{j}=\varnothing\) _for any_ \(i,j\)_._ Proof.: Only the assertions (3) and (4) deserve a sketch of proof. To justify them choose a Hermitian metric on \(\mathbb{P}^{2}\) and let \(W\) be a small enough tubular neighborhood of \(C\) and \(W_{1},\ldots,W_{s}\) be small enough tubular neighborhoods of \(L_{1},\ldots,L_{s}\). The proof of the following lemma is left to the reader. **Lemma 4.7**.: _Suppose that \(X_{1}\) and \(X_{2}\) are Hausdorff topological spaces, \(U_{1}\subset X_{1}\) and \(U_{2}\subset X_{2}\) are open subsets, and \(X\) is the topological space obtained by gluing \(X_{1}\) and \(X_{2}\) by a homeomorphism between \(U_{1}\) and \(U_{2}\)._ _Then \(X\) is Hausdorff if and only if_ \[\pi(\operatorname{bd}(U_{1}))\cap\operatorname{pr}(\operatorname{bd}(U_{2})) =\varnothing,\] _where \(\pi\colon X_{1}\sqcup X_{2}\to X\) is the canonical projection and \(\operatorname{bd}\) means "boundary". _ **Construction 4.8**.: Suppose that \(C\), \(L_{1},\ldots,L_{s}\), \(W_{1},\ldots,W_{s}\), and \(W\) are as in Lemma 4.6. Put \[U_{0}=W\sqcup W_{1}\cdots\sqcup W_{s}\] (disjoint sum), and let \(\pi_{0}\colon U_{0}\to\mathbb{P}^{2}\) be the natural projection. Define the equivalence relation \(\sim\) on \(U_{0}\) as follows: if \(x,y\in U_{0}\) and \(x\neq y\), then \(x\sim y\) if and only if \(\pi_{0}(x)=\pi_{0}(y)\in P_{1}\cup\cdots\cup P_{s}\). Let \(U_{1}\) be the quotient of \(U_{0}\) by the equivalence relation \(\sim\), and let \(\pi_{1}\colon U_{1}\to\mathbb{P}^{2}\) be the natural projection. Denote the images of \(C\subset W\) and \(L_{j}\subset W_{j}\) in \(U_{1}\) by \(C_{1}\) and \(L_{j}^{\prime}\). **Lemma 4.9**.: _In the above setting, \(U_{1}\) is a Hausdorff and connected complex surface with respect and \(\pi_{1}\colon U_{1}\to\mathbb{P}^{2}\) is a local holomorphic isomorphism._ _The curves \(C_{1}\) and \(L_{j}^{\prime}\) are isomorphic to \(\mathbb{P}^{1}\) and that \((L_{j}^{\prime}\cdot L_{j}^{\prime})=(L_{j}\cdot L_{j})=1\), \((L_{j}^{\prime}\cdot C_{1})=1\) for each \(j\), and \((C_{1}\cdot C_{1})=(C\cdot C)=4\)._ Proof.: If we put, in Lemma 4.7, \(X_{1}=W\), \(X_{2}=W_{1}\sqcup\cdots\sqcup W_{s}\), \(U_{1}=P_{1}\cup\ldots\cup P_{s}\subset W\), \(U_{2}=P_{1}\sqcup\cdots\sqcup P_{s}\subset W_{1}\sqcup\cdots\sqcup W_{s}\), then the hypothesis of this lemma is satisfied if and only if, putting \(P=P_{1}\cup\cdots\cup P_{s}\) and \(Q=Q_{1}\cup\cdots\cup Q_{s}\), one has \[((\bar{P}\cap W)\setminus P)\cap(\bar{P}\cap(W_{1}\cup\cdots\cup W_{s})\setminus P )=\varnothing. \tag{6}\] The left-hand side of (6) is equal to \[(\bar{P}\cap W\cap(W_{1}\cup\cdots\cup W_{s}))\setminus P=(\bar{P}\setminus P )\cap(P\cup Q)\subset\bar{P}\cap Q,\] which is empty by Lemma 4.6(5). Hence, \(U_{1}\) is Hausdorff. The rest is obvious. **Construction 4.10**.: In the above setting, for each \(j\), \(1\leq j\leq s\), choose two different points \(u_{j},v_{j}\in L^{\prime}_{j}\), different from the intersection point of \(L^{\prime}_{j}\) and \(C_{1}\). Let \(U_{2}\) be the blowup of the surface \(U_{1}\) at the points \(u_{1},\ldots,u_{s},v_{1},\ldots,v_{s}\). If \(\sigma\colon U_{2}\to U_{1}\) is the natural morphism, put \(C_{2}=\sigma^{-1}(C^{\prime})\subset U_{2}\); it is clear that \(\sigma\) is an isomorphism on a neighborhood of \(C_{2}\); in particular, \(C_{2}\cong C_{1}\cong\mathbb{P}^{1}\) and \((C_{2}\cdot C_{2})=4\). For each \(j\), let \(\tilde{L}_{j}\subset U_{2}\) be the strict transform of \(L^{\prime}_{j}\) with respect to the blowup \(\sigma\colon U_{2}\to U_{1}\). By construction, \(\tilde{L}_{j}\cong\mathbb{P}^{1}\), \((\tilde{L}_{j}\cdot\tilde{L}_{j})=-1\) for each \(j\), and the curves \(\tilde{L}_{j}\) are pairwise disjoint. Hence, one can blow down the curves \(\tilde{L}_{1},\ldots,\tilde{L}_{s}\) to obtain a smooth complex surface \(U_{3}\) and a curve \(C_{3}\subset U_{3}\), which is the image of \(C_{2}\); one has \(C_{3}\cong\mathbb{P}^{1}\) and \((C_{3}\cdot C_{3})=(C_{2}\cdot C_{2})+s=4+s>4\). **Proposition 4.11**.: _If \((C_{3},U_{3})\) is the germ of neighborhood from Construction 4.10, then this germ is not algebraic and \(\operatorname{tr.deg_{\mathbb{C}}}\mathcal{M}(U_{3},C_{3})=2\)._ Proof.: It follows from the construction that the blowup of the germ of neighborhood of \(C_{3}\) in \(U_{3}\) at the \(s\) points to which \(\tilde{L}_{1},\ldots,\tilde{L}_{s}\) were blown down, is isomorphic to the germ of neighborhood of \(C_{2}\) in \(U_{2}\), which is isomorphic to the of neighborhood of the conic \(C\) in \(\mathbb{P}^{2}\). Now Proposition 4.5 implies that the germ \((C_{3},U_{3})\) is not algebraic. Since \(\pi_{1}\colon U_{1}\to\mathbb{P}^{2}\) is a local isomorphism, the filed of meromorphic functions on \(\mathbb{P}^{2}\), which is isomorphic to the field \(\mathbb{C}(X,Y)\) of rational functions in two variables, can be embedded in the field of meromorphic functions on \(U_{1}\). Since the surface \(U_{3}\) is obtained from \(U_{1}\) by a sequence of blowups and blowdowns, the fields of meromorphic functions on \(U_{1}\) and \(U_{3}\) are isomorphic. Hence, \(\mathbb{C}(X,Y)\) can be embedded in the field of meromorphic functions on \(U_{3}\), which can be embedded in \(\mathcal{M}(U_{3},C_{3})\). Thus, \(\operatorname{tr.deg_{\mathbb{C}}}\mathcal{M}(U_{3},C_{3})\geq 2\), whence \(\operatorname{tr.deg_{\mathbb{C}}}\mathcal{M}(U_{3},C_{3})=2\). This completes the proof. ## 5. Ramified coverings In this section we construct another series of examples of non-algebraic neighborhoods \((C,U)\), where \(C\cong\mathbb{P}^{1}\) and \(\operatorname{tr.deg_{\mathbb{C}}}\mathcal{M}(U,C)=2\). In these examples, the self-intersection \((C\cdot C)\) may be an arbitrary positive integer. We begin with two simple lemmas. **Lemma 5.1**.: _Suppose that \(X\) is a smooth complex surface, \(C\subset X\) is a projective curve, \(C\cong\mathbb{P}^{1}\), and \(U\subset X\) is a tubular neighborhood of \(C\). Then \(\pi_{1}(U\setminus C)\cong\mathbb{Z}/m\mathbb{Z}\), where \(m=(C\cdot C)\)._ Proof.: Immediate from the homotopy exact sequence of the fiber bundle \(U\setminus C\to C\). **Lemma 5.2**.: _Suppose that \(f\colon S\to T\) is a dominant morphism of smooth projective algebraic surfaces and that \(B\subset T\) is the branch divisor of \(f\) (see the definition in Section 1.1). If \(T\setminus B\) is simply connected, then \(\deg f=1\)._ Proof.: The critical locus \(R\subset T\) of \(f\) is of the form \(B\cup E\), where \(B\) is the branch divisor and \(E\) is a finite set. The mapping \[f|_{S\setminus f^{-1}(R)}\colon S\setminus f^{-1}(R)\to T\setminus R\] is a topological covering. Since the subset \(E\subset T\setminus B\) is finite and \(T\setminus B\) is smooth, fundamental groups of \(T\setminus R\) and \(T\setminus B\) are isomorphic, so \(T\setminus R\) is also simply connected, whence the result. **Construction 5.3**.: Fix an integer \(n>0\). We are going to construct a certain neighborhood of \(\mathbb{P}^{1}\) with self-intersection \(n\). To that end, suppose that \(X\subset\mathbb{P}^{2n+1}\) is a non-degenerate surface of degree \(2n\) which is not the cone \(F_{2n,0}\) and, if \(n=2\), not the Veronese surface \(V\). Let \(C\subset X\) be a smooth hyperplane section, and let \(U\supset C\), \(U\subset X\) be a tubular neighborhood of \(C\). By virtue of Lemma 5.1 one has \(\pi_{1}(U\setminus C)=\mathbb{Z}/2n\mathbb{Z}\). Hence, there exists a two-sheeted ramified covering \(\pi\colon V\to U\) that is ramified along \(C\) with index \(2\). If \(C^{\prime}=\pi^{-1}(C)\), then \(C^{\prime}\cong\mathbb{P}^{1}\) and \((C^{\prime}\cdot C^{\prime})=n\). **Proposition 5.4**.: _If \((C^{\prime},V)\) is the neighborhood from Construction 5.3, then \(\operatorname{tr.deg}_{\mathbb{C}}\mathcal{M}(V,C^{\prime})=2\) and the neighborhood \((C^{\prime},V)\) is not algebraic._ Proof.: The neighborhood \((C,U)\) is algebraic, so \(\operatorname{tr.deg}_{\mathbb{C}}\mathcal{M}(U,C)=2\), and the morphism \(\pi\colon V\to U\) induces an embedding of \(\mathcal{M}(U,C)\) in \(\mathcal{M}(V,C^{\prime})\), hence \(\operatorname{tr.deg}_{\mathbb{C}}\mathcal{M}(V,C^{\prime})\geq 2\), hence this transcendence degree equals \(2\). To prove the non-algebraicity of \((C^{\prime},V)\), assume the converse. Then, by virtue of Proposition 3.3, the germ of the neighborhood \((C^{\prime},V)\) is isomorphic to the germ of neighborhood of a smooth hyperplane section of a non-degenerate surface \(X^{\prime}\subset\mathbb{P}^{n+1}\), \(\deg X^{\prime}=n\); we will identify \(C^{\prime}\) with this hyperplane section and \(V\) with a neighborhood of \(C^{\prime}\) in \(X^{\prime}\). Let \(f_{0},\dots,f_{2n}\) be a basis of the space \(H^{0}(X,\mathcal{O}_{X}(C))\) (i.e., of the space of meromorphic functions on \(X\) with at worst a simple pole along \(C\)). For each \(j\), the function \((f_{j}|_{U})\circ\pi\) is a meromorphic function on \(V\) with at worst a pole of order \(2\) along \(C^{\prime}\). Using Lemma 3.6 (in which one puts \(r=2\)), one sees that there exist meromorphic functions \(g_{0},\dots,g_{2n}\in H^{0}(X^{\prime},\mathcal{O}_{X^{\prime}}(2C^{\prime}))\) such that, for each \(j\), the germ of \(g_{j}\) along \(C\) is the same as that of \((f_{j}|_{U})\circ\pi\). Choose a basis \(h_{0},\dots,h_{N}\) is of \(H^{0}(X^{\prime},\mathcal{O}_{X^{\prime}}(2C^{\prime}))\), and let \(X_{1}\subset\mathbb{P}^{N}\) be the image of \(X^{\prime}\) under the embedding \[x\mapsto(h_{0}(x):\dots:h_{N}(x))\] (this is the embedding defined by the complete linear system \(|2C|=|\mathcal{O}_{X^{\prime}}(2)|\)). If \(g_{j}=\sum a_{jk}h_{k}\) for each \(j\), \(0\leq j\leq 2n\), then the matrix \(\|a_{jk}\|\) defines a rational mapping \(p\colon X_{1}\dasharrow X\), induced by a linear projection \(\bar{p}\colon\mathbb{P}^{N}\dasharrow\mathbb{P}^{2n}\). Hence, \[\deg X\leq\frac{\deg X_{1}}{\deg p}, \tag{7}\] and the equality is attained if and only if the rational mapping \(p\) is regular. On the other hand, \(\deg X_{1}=4\deg X^{\prime}=4n\), \(\deg X=2n\), and \(\deg p\geq 2\) since the restriction of \(p\) to \(V\subset X^{\prime}\cong X_{1}\) coincides with our ramified covering \(\pi\colon V\to U\). Now it follows from (7) that the projection \(p\) is regular (i.e., its center does not intersect \(X_{1}\)) and \(\deg p=2\). If \(X^{\prime}\subset\mathbb{P}^{n+1}\) is not a cone (i.e., if \(X^{\prime}\neq F_{n,0}\)), put \(X_{2}=X_{1}\) and \(q=p\), and if \(X^{\prime}\) is the cone \(F_{n,0}\), put \(X_{2}=\mathbb{F}_{n}\) and \(q=p\circ\sigma\), where \(\sigma\colon\mathbb{F}_{n}\to F_{n,0}=F^{\prime}\) is the standard resolution. So, we have a holomorphic mapping \(q\colon X_{2}\to X\), \(\deg q=2\). One has either \(X_{2}\cong\mathbb{F}_{n}\), or \(X_{2}\cong\mathbb{P}^{2}\) (the latter case is possible only if \(n=4\) and \(X^{\prime}\subset\mathbb{P}^{5}\) is the Veronese surface). Since \(q\) agrees with \(\pi\) on a neighborhood of the curve \(C^{\prime}\subset X_{2}\), the curve \(C\subset X\) is contained in the branch divisor of \(q\). Let us show that the branch divisor of \(q\colon X_{2}\to X\) coincides with \(C\). To that end, denote this branch divisor by \(B\subset X\). Let \(D\subset X\) be a general hyperplane section, and put \(D_{2}=q^{-1}(D)\subset X_{2}\). For a general \(D\), one has \(D\cong\mathbb{P}^{1}\), \(D_{2}\) is a smooth and connected projective curve, and the morphism \(q|_{D_{2}}\colon D_{2}\to\mathbb{P}^{1}\cong D\) is ramified over \(\deg B\) points. If \(n=4\) and \(X^{\prime}\) is the Veronese surface \(V\subset\mathbb{P}^{5}\), then \((X_{2},\mathcal{O}_{X_{2}}(D))\cong(\mathbb{P}^{2},\mathcal{O}_{\mathbb{P}^{ 2}}(4))\), so the curve \(D_{2}\) is isomorphic to a smooth plane quartic. Such a curve does not admit a mapping to \(\mathbb{P}^{1}\) of degree \(2\), so this case is impossible. Thus, whatever be the value of \(n\), \(X^{\prime}=F_{k,l}\), where \(k+2l=n\). In the notation of Section 2, the divisor \(D_{2}\subset X_{2}\) is equivalent to \(2(e+(k+l)f)\); since the canonical class \(K_{X_{2}}\) of the surface \(X_{2}\cong\mathbb{F}_{k}\) is equivalent to \(-2e-(k+2)f\), one has, denoting the genus of \(D_{2}\) by \(g\), \[2g-2=(D_{2}\cdot D_{2}+K_{X_{2}})=(2e+2(k+l)f\cdot(k+2l-2)f)=2(n-2),\] whence \(g=n-1\). Applying Riemann-Hurwitz formula to the degree \(2\) morphism \(q|_{D_{2}}\colon D_{2}\to D\), one sees that the number of its branch points equals \(2n\). So, \(\deg B=2n\). Since \(B\supset C\) and \(\deg C=2n\), one has \(B=C\). Observe now that \(X\setminus C\) is simply connected since \(X\setminus C\), as a topological space, is a fiber bundle over \(\mathbb{P}^{1}\) with the fiber \(\mathbb{C}\), and the complement \(X_{2}\setminus q^{-1}(C)\) is connected. Applying Lemma 5.2 to the mapping \(q\colon X_{2}\to X\), one sees that \(\deg q=1\). We arrived at a contradiction.

2310.08549

Cross-Episodic Curriculum for Transformer Agents

We present a new algorithm, Cross-Episodic Curriculum (CEC), to boost the learning efficiency and generalization of Transformer agents. Central to CEC is the placement of cross-episodic experiences into a Transformer's context, which forms the basis of a curriculum. By sequentially structuring online learning trials and mixed-quality demonstrations, CEC constructs curricula that encapsulate learning progression and proficiency increase across episodes. Such synergy combined with the potent pattern recognition capabilities of Transformer models delivers a powerful cross-episodic attention mechanism. The effectiveness of CEC is demonstrated under two representative scenarios: one involving multi-task reinforcement learning with discrete control, such as in DeepMind Lab, where the curriculum captures the learning progression in both individual and progressively complex settings; and the other involving imitation learning with mixed-quality data for continuous control, as seen in RoboMimic, where the curriculum captures the improvement in demonstrators' expertise. In all instances, policies resulting from CEC exhibit superior performance and strong generalization. Code is open-sourced at https://cec-agent.github.io/ to facilitate research on Transformer agent learning.

Lucy Xiaoyang Shi, Yunfan Jiang, Jake Grigsby, Linxi "Jim" Fan, Yuke Zhu

2023-10-12T17:45:05Z

http://arxiv.org/abs/2310.08549v1

# Cross-Episodic Curriculum for Transformer Agents ###### Abstract We present a new algorithm, Cross-Episodic Curriculum (CEC), to boost the learning efficiency and generalization of Transformer agents. Central to CEC is the placement of _cross-episodic_ experiences into a Transformer's context, which forms the basis of a curriculum. By sequentially structuring online learning trials and mixed-quality demonstrations, CEC constructs curricula that encapsulate learning progression and proficiency increase across episodes. Such synergy combined with the potent pattern recognition capabilities of Transformer models delivers a powerful _cross-episodic attention_ mechanism. The effectiveness of CEC is demonstrated under two representative scenarios: one involving multi-task reinforcement learning with discrete control, such as in DeepMind Lab, where the curriculum captures the learning progression in both individual and progressively complex settings, and the other involving imitation learning with mixed-quality data for continuous control, as seen in RoboMimic, where the curriculum captures the improvement in demonstrators' expertise. In all instances, policies resulting from CEC exhibit superior performance and strong generalization. Code is open-sourced on the project website cec-agent.github.io to facilitate research on Transformer agent learning. ## 1 Introduction The paradigm shift driven by foundation models [8] is revolutionizing the communities who study sequential decision-making problems [80], with innovations focusing on control [2; 45; 38; 9], planning [76; 32; 33; 78; 17], pre-trained visual representation [57; 50; 67; 51], among others. Despite the progress, the data-hungry nature makes the application of Transformer [75] agents extremely challenging in data-scarce domains like robotics [52; 53; 19; 38; 9]. This leads us to the question: Can we maximize the utilization of limited data, regardless of their optimality and construction, to foster more efficient learning? To this end, this paper introduces a novel algorithm named _Cross-Episodic Curriculum_ (CEC), a method that explicitly harnesses the shifting distributions of multiple experiences when organized into a curriculum. The key insight is that sequential _cross-episodic_ data manifest useful learning signals that do not easily appear in any separated training episodes.1 As illustrated in Figure 1, CEC realizes this through two stages: 1) formulating curricular sequences to capture (a) the policy improvement on single environments, (b) the learning progress on a series of progressively harder environments, or (c) the increase of demonstrators' proficiency; and 2) causally distilling policy improvements into the model weights of Transformer agents through _cross-episodic attention_. When a policy is trained to predict actions at current time steps, it can trace back beyond ongoing trials and internalize improved behaviors encoded in curricular data, thereby achieving efficient learning and robust deployment when probed with visual or dynamics perturbations. Contrary to prior works like Algorithm Distillation (AD, Laskin et al. [42]) which, at test time, samples and retains a single task configuration across episodes for in-context refinement, our method, CEC, prioritizes zero-shot generalization across a distribution of test configurations. With CEC, agents are evaluated on a new task configuration in each episode, emphasizing adaptability to diverse tasks. We investigate the effectiveness of CEC in enhancing sample efficiency and generalization with two representative case studies. They are: 1) Reinforcement Learning (RL) on DeepMind Lab (DMLab) [5], a 3D simulation encompassing visually diverse worlds, complicated environment dynamics, ego-centric pixel inputs, and joystick control; and 2) Imitation Learning (IL) from mixed-quality human demonstrations on RoboMimic [53], a framework designed to study robotic manipulation with proprioceptive and external camera observations and continuous control. Despite RL episodes being characterized by state-action-reward tuples and IL trajectories by state-action pairs, our method exclusively employs state-action pairs in its approach. In challenging embodied navigation tasks, despite significant generalization gaps (Table 1), our method surpasses concurrent and competitive method Agentic Transformer (AT, Liu and Abbeel [47]). It also significantly outperforms popular offline RL methods such as Decision Transformer (DT, Chen et al. [13]) and baselines trained on expert data, with the same amount of parameters, architecture, and data size. It even exceeds RL oracles directly trained on test task distributions by \(50\%\) in a _zero-shot_ manner. CEC also yields robust embodied policies that are up to \(1.6\times\) better than RL oracles when zero-shot probed with unseen environment dynamics. When learning continuous robotic control, CEC successfully solves two simulated manipulation tasks, matching and outperforming previous well-established baselines [53, 25, 41]. Further ablation reveals that CEC with cross-episodic attention is a generally effective recipe for learning Transformer agents, especially in applications where sequential data exhibit moderate and smooth progression. Figure 1: **Cross-episodic curriculum for Transformer agents.** CEC involves two major steps: _1) Preparation of curricular data._ We order multiple experiences such that they explicitly capture curricular patterns. For instance, they can be policy improvement in single environments, learning progress in a series of progressively harder environments, or the increase of the demonstrator’s expertise. _2) Model training with cross-episodic attention._ When training the model to predict actions, it can trace back beyond the current episode and internalize the policy refinement for more efficient learning. Here each \(\tau\) represents an episode (trajectory). \(\hat{a}\) refers to actions predicted by the model. Colored triangles denote causal Transformer models. Cross-Episodic Curriculum: Formalism and Implementations In this section, we establish the foundation for our cross-episodic curriculum method by first reviewing the preliminaries underlying our case studies, which encompass two representative scenarios in sequential decision-making. Subsequently, we formally introduce the assembly of curricular data and the specifics of model optimization utilizing cross-episodic attention. Lastly, we delve into the practical implementation of CEC in the context of these two scenarios. ### Preliminaries Reinforcement learning.We consider the setting where source agents learn through trial and error in partially observable environments. Denoting states \(s\in\mathcal{S}\) and actions \(a\in\mathcal{A}\), an agent interacts in a Partially Observable Markov Decision Process (POMDP) with the transition function \(p(s_{t+1}|s_{t},a_{t}):\mathcal{S}\times\mathcal{A}\to\mathcal{S}\). It observes \(o\in\mathcal{O}\) emitted from observation function \(\Omega(o_{t}|s_{t},a_{t-1}):\mathcal{S}\times\mathcal{A}\to\mathcal{O}\) and receives scalar reward \(r\) from \(R(s,a):\mathcal{S}\times\mathcal{A}\to\mathbb{R}\). Under the episodic task setting, RL seeks to learn a parameterized policy \(\pi_{\theta}(\cdot|s)\) that maximizes the return over a fixed length \(T\) of interaction steps: \(\pi_{\theta}=\arg\max_{\theta\in\Theta}\sum_{t=0}^{T-1}\gamma^{t}r_{t}\), where \(\gamma\in[0,1)\) is a discount factor. Here we follow the canonical definition of an episode \(\tau\) as a series of environment-agent interactions with length \(T\), \(\tau:=(s_{0},a_{0},r_{0},\ldots,s_{T-1},a_{T-1},r_{T-1},s_{T})\), where initial states \(s_{0}\) are sampled from initial state distribution \(s_{0}\sim\rho_{0}(s)\) and terminal states \(s_{T}\) are reached once the elapsed timestep exceeds \(T\). Additionally, we view all RL tasks considered in this work as goal-reaching problems [39; 26] and constrain all episodes to terminate upon task completion. It is worth noting that similar to previous work [42], training data are collected by source RL agents during their online learning. Nevertheless, once the dataset is obtained, our method is trained _offline_ in a purely supervised manner. Imitation learning.We consider IL settings with existing trajectories composed only of state-action pairs. Furthermore, we relax the assumption on demonstration optimality and allow them to be crowdsourced [10; 12; 11]. Data collected by operators with varying expertise are therefore unavoidable. Formally, we assume the access to a dataset \(\mathcal{D}^{N}:=\{\tau_{1},\ldots,\tau_{N}\}\) consisting of \(N\) demonstrations, with each demonstrated trajectory \(\tau_{i}:=(s_{0},a_{0},\ldots,s_{T-1},a_{T-1})\) naturally identified as an episode. The goal of IL, specifically of behavior cloning (BC), is to learn a policy \(\pi_{\theta}\) that accurately models the distribution of behaviors. When viewed as goal-reaching problems, BC policies can be evaluated by measuring the success ratio in completing tasks [26]. ### Curricular Data Assembly and Model Optimization Meaningful learning signals emerge when multiple trajectories are organized and examined cross-episodically along a curriculum axis. This valuable information, which is not easily discernible in individual training episodes, may encompass aspects such as the improvement of an RL agent's navigation policy or the generally effective manipulation skills exhibited by operators with diverse proficiency levels. With a powerful model architecture such as Transformer [75; 16], such emergent and valuable learning signals can be baked into policy weights, thereby boosting performance in embodied tasks. For a given embodied task \(\mathcal{M}\), we define its curriculum \(\mathcal{C}_{\mathcal{M}}\) as a collection of trajectories \(\tau\) consisting of state-action pairs. A series of ordered levels \([\mathcal{L}_{1},\ldots,\mathcal{L}_{L}]\) partitions this collection such that \(\bigcup_{l\in\{1,\ldots,L\}}\mathcal{L}_{l}=\mathcal{C}_{\mathcal{M}}\) and \(\bigcap_{\forall i,j\in\{1,\ldots,L\},i\neq j}\mathcal{L}_{\{i,j\}}=\emptyset\). More importantly, these ordered levels characterize a curriculum by encoding, for example, learning progress in single environments, learning progress in a series of progressively harder environments, or the increase of the demonstrator's expertise. With a curriculum \(\mathcal{C}_{\mathcal{M}}:=\{\tau_{i}\}_{i=1}^{N}\) and its characteristics \([\mathcal{L}_{1},\ldots,\mathcal{L}_{L}]\), we construct a curricular sequence \(\mathcal{T}\) that spans multiple episodes and captures the essence of gradual improvement in the following way: \[\mathcal{T}:=\bigoplus_{l\in\{1,\ldots,L\}}\left[\tau^{(1)},\ldots,\tau^{(C)} \right],\quad\text{where}\quad C\sim\mathcal{U}\left(\llbracket\mathcal{L}_{l }\rrbracket\right)\quad\text{and}\quad\tau^{(c)}\sim\mathcal{L}_{l}. \tag{1}\] The symbol \(\oplus\) denotes the concatenation operation. \(\mathcal{U}\left(\llbracket K\rrbracket\right)\) denotes a uniform distribution over the discrete set \(\{k\in\mathbb{N},k\leq K\}\). In practice, we use values smaller than \(|\mathcal{L}_{l}|\) considering the memory consumption. We subsequently learn a causal policy that only depends on cross-episodic historical observations \(\pi_{\theta}(\cdot|o_{\leq t}^{(\leq n)})\). Note that this modeling strategy differs from previous work that views sequential decision-making as a big sequence-modeling problem [13; 37; 42; 38]. It instead resembles the causal policy in Baker et al. [4]. Nevertheless, we still follow the best practice [36; 60; 22] to provide previous action as an extra modality of observations in POMDP RL tasks. We leverage the powerful attention mechanism of Transformer [75] to enable cross-episodic attention. Given observation series \(O_{t}^{(n)}:=\{o_{0}^{(1)},\dots,o_{\leq t}^{(\leq n)}\}\) (shorthanded as \(O\) hereafter for brevity), Transformer projects it into query \(Q=f_{Q}(O)\), key \(K=f_{K}(O)\), and value \(V=f_{V}(O)\) matrices, with each row being a \(D\)-dim vector. Attention operation is performed to aggregate information: \[\text{Attention}(Q,K,V)=\text{softmax}(\frac{QK^{\intercal}}{\sqrt{D}})V. \tag{2}\] Depending on whether the input arguments for \(f_{Q}\) and \(f_{\{K,V\}}\) are the same, attention operation can be further divided into self-attention and cross-attention. Since tasks considered in this work do not require additional conditioning for task specification, we follow previous work [4; 82] to utilize self-attention to process observation series. Nevertheless, ours can be naturally extended to handle, for example, natural language or multi-modal task prompts, following the cross-attention introduced in Jiang et al. [38]. Finally, this Transformer policy is trained by simply minimizing the negative log-likelihood objective \(\mathcal{J}_{\text{NLL}}\) of labeled actions, conditioned on cross-episodic context: \[\mathcal{J}_{\text{NLL}}=-\log\pi_{\theta}(\cdot|\mathcal{T})=\frac{1}{| \mathcal{T}|\times T}\sum_{n=1}^{|\mathcal{T}|}\sum_{t=1}^{T}-\log\pi_{\theta }\left(a_{t}^{(n)}|o_{\leq t}^{(\leq n)}\right). \tag{3}\] Regarding the specific memory architecture, we follow Baker et al. [4], Adaptive Agent Team et al. [1] to use Transformer-XL [16] as our model backbone. Thus, during deployment, we keep its hidden states propagating across test episodes to mimic the training settings. ### Practical Implementations We now discuss concrete instantiations of CEC for 1) RL with DMLab and 2) IL with RoboMimic. Detailed introductions to the benchmark and task selection are deferred to Sec. 3. We investigate the following three curricula, where the initial two pertain to RL, while the final one applies to IL: Learning-progress-based curriculum.In the first instantiation, inspired by the literature on learning progress [54; 27; 65; 40], we view the progression of learning agents as a curriculum. Concretely, we train multi-task PPO agents [70; 63] on tasks drawn from test distributions. We record their online interactions during training, which faithfully reflect the learning progress. Finally, we form the _learning-progress-based curriculum_ by sequentially concatenating episodes collected at different learning stages. Note that this procedure is different from Laskin et al. [42], where for each environment, the learning dynamics of _multiple_ single-task RL agents has to be logged. In contrast, we only track a _single_ multi-task agent per environment. Task-difficulty-based curriculum.In the second instantiation, instead of taking snapshots of RL agents directly trained on test configurations, we collect learning progress on a series of easier Figure 2: We evaluate our method on five tasks that cover challenges such as exploration and planning over long horizons in RL settings, as well as object manipulation and continuous control in IL settings. Figures are from Beattie et al. [5] and Mandlekar et al. [53]. but progressively harder tasks. For instance, in an embodied navigation task, the test configuration includes 20 rooms. Rather than logging source agents' learning progression in the 20-room maze, we record in a series of mazes with 5, 10, and 15 rooms. We then structure stored episodes first following learning progress and then the increase of layout complexity. This practice naturally creates a _task-difficulty-based curriculum_, which resembles curriculum RL that is based on task difficulty [54; 58]. We find it especially helpful for hard-exploration problems where the source RL agent does not make meaningful progress. Expertise-based curriculum.For the setting of IL from mixed-quality demonstrations, we instantiate a curriculum based on demonstrators' expertise. This design choice is motivated by literature on learning from heterogeneous demonstrators [6; 81], with the intuition that there is little to learn from novices but a lot from experts. To realize this idea, we leverage the Multi-Human dataset from RoboMimic [53]. Since it contains demonstrations collected by human demonstrators with varying proficiency, we organize offline demonstration trajectories following the increase of expertise to construct the _expertise-based curriculum_. ## 3 Experimental Setup In this section, we elaborate on the experimental setup of our case studies. Our investigation spans two representative and distinct settings: 1) online reinforcement learning with 3D maze environments of DMLab [5], and 2) imitation learning from mixed-quality human demonstrations of RoboMimic [53]. For each of them, we discuss task selection, baselines, and training and evaluation protocols. Teasers of these tasks are shown in Figure 2. ### Task Settings and Environments **DeepMind Lab**[5] is a 3D learning environment with diverse tasks. Agents spawn in visually complex worlds, receive ego-centric (thus partially observable) RGB pixel inputs, and execute joystick actions. We consider three levels from this benchmark: Goal Maze, Watermaze [56], and Sky Maze with Irreversible Path. They challenge agents to explore, memorize, and plan over a long horizon. Their goals are similar -- to navigate in complicated mazes and find a randomly spawned goal, upon which sparse rewards will be released. Episodes start with randomly spawned agents and goals and terminate once goals are reached or elapsed steps have exceeded pre-defined horizons. **RoboMimic**[53] is a framework designed for studying robot manipulation and learning from demonstrations. Agents control robot arms with fixed bases, receive proprioceptive measurements and image observations from mounted cameras, and operate with continuous control. We evaluate two simulated tasks: "Lift" and "Can". In the "Lift" task, robots are tasked with picking up a small cube. In the "Can" task, robots are required to pick up a soda can from a large bin and place it into a smaller target bin. Episodes start with randomly initialized object configuration and terminate upon successfully completing the task or exceeding pre-defined horizons. ### Baselines The primary goal of these case studies is to assess the effectiveness of our proposed cross-episodic curriculum in increasing the sample efficiency and boosting the generalization capability of Transformer agents. Therefore, in online RL settings, we compare against source RL agents which generate training data for our method and refer to them as _oracles_. These include a) PPO agents directly \begin{table} \begin{tabular}{c|c|c|c c c c c} \hline \hline \multirow{2}{*}{\begin{tabular}{c} **Level** \\ **Name** \\ \end{tabular} } & \multirow{2}{*}{\begin{tabular}{c} **Difficulty** \\ **Parameter** \\ \end{tabular} } & \multirow{2}{*}{ \begin{tabular}{c} **Test** \\ **Difficulty** \\ \end{tabular} } & \multicolumn{5}{c}{**Training Difficulty**} \\ \cline{3-8} & & & Ours & Ours & BC & RL & Curriculum RL \\ & & & (Learning Progress) & (Task Difficulty) & \(\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{ \mathsf{\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{\mathsf{ \mathsf{ }}}}}}}}}}}}}}\) & & (Oracle) & (Oracle) \\ \hline Goal Maze & Room Numbers & 20 & 20 & 5\(\rightarrow\)10\(\rightarrow\)15 & 20 & 20 & 5\(\rightarrow\)10\(\rightarrow\)15\(\rightarrow\)20 \\ Watermaze & Spawn Radius & 580 & 580 & 150\(\rightarrow\)300\(\rightarrow\)450 & 580 & 580 & 150\(\rightarrow\)300\(\rightarrow\)450\(\rightarrow\)580 \\ Irreversible Path & Built-In Difficulty &.9 &.9 &.1\(\rightarrow\)3\(\rightarrow\)5\(\rightarrow\)7 &.9 &.9 &.1\(\rightarrow\)3\(\rightarrow\)5\(\rightarrow\)7\(\rightarrow\)9 \\ \hline \hline \end{tabular} \end{table} Table 1: **Generalization gaps between training and testing for DMLab levels. Note that agents resulting from task-difficulty-based curricula are not trained on test configurations. Therefore, their performance should be considered as _zero-shot_.** trained on test task distributions, denoted as "**RL (Oracle)**" hereafter, and b) curriculum PPO agents that are gradually adapted from easier tasks to the test difficulty, which is referred to as "**Curriculum RL (Oracle)**". Furthermore, we compare against one concurrent and competitive method Agentic Transformer [47], denoted as "**AT**". It is closely related to our method, training Transformers on sequences of trajectory ascending sorted according to their rewards. We also compare against popular offline RL method Decision Transformer [13], denoted as "**DT**". Additionally, we include another behavior cloning agent that has the same model architecture as ours but is trained on optimal data without cross-episodic attention. This baseline is denoted as "**BC w/ Expert Data**". For the case study on IL from mixed-quality demonstrations, we adopt the most competing approach, **BC-RNN**, from Mandlekar et al. [53] as the main baseline. We also include comparisons against other offline RL methods [44] such as Batch-Constrained Q-learning (**BCQ**) [25] and Conservative Q-Learning (**CQL**) [41]. ### Training and Evaluation We follow the best practice to train Transformer agents, including adopting AdamW optimizer [49], learning rate warm-up and cosine annealing [48], etc. Training is performed on NVIDIA V100 GPUs. During evaluation, for agents resulting from our method, each run involves several test rollouts to fill the context. We keep hidden states of Transformer-XL [16] propagating across episodes. We run other baselines and oracles for 100 episodes to estimate their performances. For our methods on RL settings, we compute the maximum success rate averaged across a sliding window over all test episodes to account for in-context improvement. The size of the sliding window equals one-quarter of the total test episodes. These values are averaged over 20 runs to constitute the final reporting metric. For our methods on the IL setting, since all training data are successful trajectories, we follow Mandlekar et al. [53] to report the maximum success rate achieved over the course of training, directly averaged over test episodes. ## 4 Experiments We aim to answer the following four research questions through comprehensive experiments. 1. To what extent can our cross-episodic curriculum increase the sample efficiency of Transformer agents and boost their generalization capability? 2. Is CEC consistently effective and generally applicable across distinct learning settings? 3. What are the major components that contribute to the effectiveness of our method? Figure 3: **Evaluation results on DMLab. Our CEC agents perform comparable to RL oracles and on average outperform other baseline methods. On the hardest task Irreversible Path where the RL oracle and BC baseline completely fail, our agents outperform the curriculum RL oracle by \(50\%\) even in a _zero-shot_ manner. For our methods, DT, AT, and the BC w/ expert data baselines, we conduct 20 independent evaluation runs, each consisting of 100 episodes for Goal Maze and Watermaze and 50 episodes for Irreversible Path due to longer episode length. We test RL oracles for 100 episodes. The error bars represent the standard deviations over 20 runs.** ### Main Evaluations We answer the first two questions above by comparing learned agents from our method against 1) Reinforcement Learning (RL) oracles in online RL settings and 2) well-established baselines on learning from mixed-quality demonstrations in the Imitation Learning (IL) setting. We first examine agents learned from learning-progress-based and task-difficulty-based curricula in challenging 3D maze environments. The first type of agent is denoted as "**Ours (Learning Progress)**". For the second type, to ensure that the evaluation also contains a series of tasks with increasing difficulty, we adopt two mechanisms that control the task sequencing [58]: 1) fixed sequencing where agents try each level of difficulty for a fixed amount of times regardless of their performance and 2) dynamic sequencing where agents are automatically promoted to the next difficulty level if they consecutively succeed in the previous level for three times. We denote these two variants as "**Ours (Task Difficulty), Fixed**" and "**Ours (Task Difficulty), Auto**", respectively. Note that because the task-difficulty-based curriculum does not contain any training data on test configurations, these two settings are zero-shot evaluated on test task distributions. We summarize these differences in Table 1. We denote AT and DT trained on data consisting of a mixture of task difficulties as "**AT (Mixed Difficulty)**" and "**DT (Mixed Difficulty)**". Note that these data are the same used to train "Ours (Task Difficulty)". Similarly, we denote AT and DT directly trained on test difficulty as "AT (Single Difficulty)" and "DT (Single Difficulty)". These data are the same used to train "Ours (Learning Progress)". Cross-episodic curriculum results in sample-efficient agents.As shown in Figure 3, on two out of three examined DMLab levels, CEC agents perform comparable to RL oracles and outperform the BC baselines trained on expert data by at most \(2.8\times\). On the hardest level Irreversible Path where agents have to plan the route ahead and cannot backtrack, both the BC baseline and RL oracle fail. However, our agents succeed in proposing correct paths that lead to goals and significantly outperform the curriculum RL oracle by \(50\%\) even in a _zero-shot_ manner. Because CEC only requires environment interactions generated during the course of training of online source agents (the task-difficulty-based curriculum even contains fewer samples compared to the curriculum RL, as illustrated in Table 1), the comparable and even better performance demonstrates that our method yields highly sample-efficient embodied policies. On average, our method with task-difficulty-based curriculum performs the best during evaluation (Table A.5), confirming the benefit over the Figure 4: **Generalization results on DMLab.**_Top row_: Evaluation results on Goal Maze with unseen maze mechanism and Irreversible Path with out-of-distribution difficulty levels. _Bottom row_: Evaluation results on three levels with environment dynamics differing from training ones. CEC agents display robustness and generalization across various dimensions, outperforming curriculum RL oracles by up to \(1.6\times\). We follow the same evaluation protocol as in Figure 3. The error bars represent the standard deviations over 20 runs. concurrent AT approach that leverages chain-of-hindsight experiences. When compared to DT, it outperforms by a significant margin, which suggests that our cross-episodic curriculum helps to squeeze learning signals that are useful for downstream decision-making. Cross-episodic curriculum boosts the generalization capability.To further investigate whether CEC can improve generalization at test time, we construct settings with unseen maze mechanisms (randomly open/closed doors), out-of-distribution difficulty, and different environment dynamics. See the Appendix, Sec. C.2 for the exact setups. As demonstrated in Figure 4, CEC generally improves Transformer agents in learning robust policies that can generalize to perturbations across various axes. On three settings where the BC w/ Expert Data baseline still manages to make progress, CEC agents are up to \(2\times\) better. Compared to oracle curriculum RL agents, our policies significantly outperform them under three out of five examined scenarios. It is notable that on Irreversible Path with out-of-distribution difficulty, CEC agent is \(1.6\times\) better than the curriculum RL oracle trained on the same data. These results highlight the benefit of learning with curricular contexts. On average, our method surpasses the concurrent AT baseline and achieves significantly better performance than other baselines (Table A.6). This empirically suggests that CEC helps to learn policies that are robust to environmental perturbations and can quickly generalize to new changes. Cross-episodic curriculum is effective across a wide variety of learning scenarios.We now move beyond RL settings and study the effectiveness of the expertise-based curriculum in the IL setting with mixed-quality demonstrations. This is a common scenario, especially in robotics, where demonstrations are collected by human operators with varying proficiency [52]. As presented in Table 2, visuomotor policies trained with the expertise-based curriculum are able to match and outperform the well-established baseline [53] on two simulated robotic manipulation tasks and achieve significantly better performance than agents learned from prevalent offline RL algorithms [25, 41]. These results suggest that our cross-episodic curriculum is effective and broadly applicable across various problem settings. More importantly, it provides a promising approach to utilizing limited but sub-optimal data in data-scarce regimes such as robot learning. ### Ablation Studies In this section, we seek to answer the third research question to identify the components critical to the effectiveness of our approach. We focus on three parts: the importance of cross-episodic attention, the influence of curriculum granularity, and the effect of varying context length. Finally, we delve into the fourth question, identifying scenarios where CEC is expected to be helpful. Importance of cross-episodic attention.The underlying hypothesis behind our method is that cross-episodic attention enables Transformer agents to distill policy improvement when mixed-optimality trajectories are viewed collectively. To test this, on DMLab levels and RoboMimic tasks, we train the same Transformer agents with the same curricular data and training epochs but \begin{table} \begin{tabular}{l|c c c|c} \hline \hline **Task** & **Ours** & **BC-RNN**[53] & **BCQ**[25] & **CQL**[41] \\ \hline Lift & \(100.0\pm 0.0\) & \(100.0\pm 0.0\) & \(93.3\pm 0.9\) & \(11.3\pm 9.3\) \\ Can & \(100.0\pm 0.0\) & \(96.0\pm 1.6\) & \(77.3\pm 6.8\) & \(0.0\pm 0.0\) \\ \hline \hline \end{tabular} \end{table} Table 2: **Evaluation results on RoboMimic.** Visuomotor policies trained with our expertise-based curriculum outperform the most competing history-dependent behavior cloning baseline, as well as other offline RL algorithms. For our method on the Lift task, we conduct 5 independent runs each with 10 rollout episodes. On the Can task, we conduct 10 independent runs each with 5 rollout episodes due to the longer horizon required to complete the task. Standard deviations are included. \begin{table} \begin{tabular}{l|c c c|c c} \hline \hline & \multicolumn{3}{c|}{**DMLab**} & \multicolumn{2}{c}{**RoboMimic**} \\ \cline{2-5} & Goal Maze & Watermaze & Irreversible Path & Lift & Can \\ \hline Ours & \(65.2\pm 6.7\) & \(50.9\pm 6.6\) & \(38.2\pm 7.0\) & \(100.0\pm 0.0\) & \(100.0\pm 0.0\) \\ Ours w/o Cross-Episodic Attention & \(35.0\pm 7.1\) & \(20.0\pm 2.5\) & \(3.8\pm 4.9\) & \(75.9\pm 12.3\) & \(99.3\pm 0.9\) \\ \hline \hline \end{tabular} \end{table} Table 3: **Ablation on the importance of cross-episodic attention.** Transformer agents trained with the same curricular data but without cross-episodic attention degrade significantly during evaluation, suggesting its indispensable role in learning highly performant policies. without cross-episodic attention. We denote such agents as "**Ours w/o Cross-Episodic Attention**" in Table 3. Results demonstrate that the ablated variants experience dramatic performance degradation on four out of five examined tasks, which suggests that naively behaviorally cloning sub-optimal data can be problematic and detrimental. Cross-episodic attention views curricular data collectively, facilitating the extraction of knowledge and patterns crucial for refining decision-making, thereby optimizing the use of sub-optimal data. Curriculum granularity.We perform this ablation with the task-difficulty-based curriculum on DMLab levels, due to the ease of adjusting granularity. We treat the curricula listed in the column "Ours (Task Difficulty)" in Table 1 as "Fine", and gradually make them coarser to study the impact. Note that we ensure the same amount of training data. See the Appendix, Sec. C.4 for how we define granularity levels "Medium" and "Coarse". We visualize the performance relative to the most fine-grained in Figure 5. The monotonic degradation of policy performance with respect to curriculum coarseness suggests that fine-grained curricula are critical for Transformer agents to mostly benefit from cross-episodic training. Varying context length.Lastly, we study the effect of varying context length on DMLab and visualize it in Figure 6. We normalize all performance values relative to those of "Ours (Task Difficulty), Auto" reported in Figure 3. It turns out that both too short and unnecessarily long context windows are harmful. On two out of three levels, using a shorter context decreases the performance even more. This finding coincides with Laskin et al. [42] that a sufficiently long Transformer context is necessary to retain cross-episodic information. Furthermore, we also discover that an unnecessarily long context is also harmful. We hypothesize that this is due to the consequent training and optimization instability. Curriculum selection based on task complexities and data sources.For RL tasks, we recommend starting with the learning-progress-based curriculum. However, if the task itself is too challenging, such that source algorithms barely make progress, we recommend the task-difficulty-based curriculum. In IL settings, we further investigate the performance of the learning-progress-based curriculum on RoboMimic tasks considered in this work. Detailed setup and results are included in Appendix, Sec C.5. To summarize, if human demonstrations are available, even if they are generated to be heterogeneous in quality, we recommend using the expertise-based curriculum. However, in the absence of human demonstrations and only with access to machine-generated data (e.g., generated by RL agents), our learning-progress-based curriculum is recommended because it achieves non-trivial performance and significantly outperforms offline RL methods such as CQL [41]. ## 5 Related Work Sequential decision-making with Transformer agents.There are many ongoing efforts to replicate the strong emergent properties demonstrated by Transformer models for sequential decision-making problems [80]. Decision Transformer [13] and Trajectory Transformer [37] pioneered this thread by casting offline RL [44] as sequence modeling problems. Gato [68] learns a massively multi-task agent that can be prompted to complete embodied tasks. MineDojo [22] and VPT [4] utilize numerous YouTube videos for large-scale pre-training in the video game _Minecraft_. VIMA [38] and RT-1 [9] build Transformer agents trained at scale for robotic manipulation tasks. BeT [71] and C-BeT [14] design novel techniques to learn from demonstrations with multiple modes with Trans Figure 5: We compare the performance relative to agents trained with the fine-grained curricula. Performance monotonically degrades as task-difficulty-based curricula become coarser. Figure 6: Both short and unnecessarily long context windows decrease the performance. Numbers in the legend denote context lengths. Performance values are relative to those of “Ours (Task Difficulty), Auto” reported in Figure 3. “Irrevers. Path” stands for the task “Irreversible Path”. formers. Our causal policy most resembles to VPT [4]. But we focus on designing learning techniques that are generally effective across a wide spectrum of learning scenarios and application domains. Cross-episodic learning.Cross-episodic learning is a less-explored terrain despite that it has been discussed together with meta-RL [77] for a long time. RL\({}^{2}\)[18] uses recurrent neural networks for online meta-RL by optimizing multi-episodic value functions. Meta-Q-learning [21] instead learns multi-episodic value functions in an offline manner. Algorithm Distillation (AD) [42] and Adaptive Agent (AdA) [1] are two recent, inspiring methods in cross-episodic learning. Though at first glance our learning-progress-based curriculum appears similar to AD, significant differences emerge. Unlike AD, which focuses on in-context improvements at test time and requires numerous single-task source agents for data generation, our approach improves data efficiency for Transformer agents by structuring data in curricula, requiring only a single multi-task agent and allowing for diverse task instances during evaluations. Meanwhile, AdA, although using cross-episodic attention with a Transformer backbone, is rooted in online RL within a proprietary environment. In contrast, we focus on offline behavior cloning in accessible, open-source environments, also extending to IL scenarios unexplored by other meta-learning techniques. Complementary to this, another recent study [43] provides theoretical insight into cross-episodic learning. Curriculum learning.Curriculum learning represents training strategies that organize learning samples in meaningful orders to facilitate learning [7]. It has been proven effective in numerous works that adaptively select simpler task [58; 74; 69; 62; 15; 55; 59; 46] or auxiliary rewards[35; 72]. Tasks are also parameterized to form curricula by manipulating goals [24; 30; 66], environment layouts[79; 3; 64], and reward functions [28; 34]. Inspired by this paradigm, our work harnesses the improving nature of sequential experiences to boost learning efficiency and generalization for embodied tasks. ## 6 Conclusion In this work, we introduce a new learning algorithm named _Cross-Episodic Curriculum_ to enhance the sample efficiency of policy learning and generalization capability of Transformer agents. It leverages the shifting distributions of past learning experiences or human demonstrations when they are viewed as curricula. Combined with cross-episodic attention, CEC yields embodied policies that attain high performance and robust generalization across distinct and representative RL and IL settings. CEC represents a solid step toward sample-efficient policy learning and is promising for data-scarce problems and real-world domains. Limitations and future work.The CEC algorithm relies on the accurate formulation of curricular sequences that capture the improving nature of multiple experiences. However, defining these sequences accurately can be challenging, especially when dealing with complex environments or tasks. Incorrect or suboptimal formulations of these sequences could negatively impact the algorithm's effectiveness and the overall learning efficiency of the agents. A thorough exploration regarding the attainability of curricular data is elaborated upon in Appendix, Sec D. In subsequent research, the applicability of CEC to real-world tasks, especially where task difficulty remains ambiguous, merits investigation. A deeper assessment of a demonstrator's proficiency trajectory -- from initial unfamiliarity to the establishment of muscle memory -- could offer a valuable learning signal. Moreover, integrating real-time human feedback to dynamically adjust the curriculum poses an intriguing challenge, potentially enabling CEC to efficiently operate in extended contexts, multi-agent environments, and tangible real-world tasks. ## Acknowledgments and Disclosure of Funding We thank Guanzhi Wang and Annie Xie for helpful discussions. We are grateful to Yifeng Zhu, Zhenyu Jiang, Soroush Nasiriany, Huihan Liu, and Rutav Shah for constructive feedback on an early draft of this paper. We also thank the anonymous reviewers for offering us insightful suggestions and kind encouragement during the review period. This work was partially supported by research funds from Salesforce and JP Morgan.

2306.15598

The ${\mathbb S}_n$-equivariant Euler characteristic of the moduli space of graphs

We prove a formula for the ${\mathbb S}_n$-equivariant Euler characteristic of the moduli space of graphs $\mathcal{MG}_{g,n}$. Moreover, we prove that the rational ${\mathbb S}_n$-invariant cohomology of $\mathcal{MG}_{g,n}$ stabilizes for large $n$. That means, if $n \geq g \geq 2$, then there are isomorphisms $H^k(\mathcal{MG}_{g,n};\mathbb{Q})^{{\mathbb S}_n} \rightarrow H^k(\mathcal{MG}_{g,n+1};\mathbb{Q})^{{\mathbb S}_{n+1}}$ for all $k$.

Michael Borinsky, Jos Vermaseren

2023-06-27T16:34:42Z

http://arxiv.org/abs/2306.15598v3

# The \(\mathbb{S}_{n}\)-equivariant Euler characteristic of ###### Abstract. We prove a formula for the \(\mathbb{S}_{n}\)-equivariant Euler characteristic of the moduli space of graphs \(\mathcal{M}\mathcal{G}_{g,n}\). Moreover, we prove that the rational \(\mathbb{S}_{n}\)-invariant cohomology of \(\mathcal{M}\mathcal{G}_{g,n}\) stabilizes for large \(n\). That means, if \(n\geq g\geq 2\), then there are isomorphisms \(H^{k}(\mathcal{M}\mathcal{G}_{g,n};\mathbb{Q})^{\mathbb{S}_{n}}\to H^{k}( \mathcal{M}\mathcal{G}_{g,n+1};\mathbb{Q})^{\mathbb{S}_{n+1}}\) for all \(k\). ## 1. Introduction A graph \(G\) is a one-dimensional CW complex. It has _rank_\(g\) if its fundamental group is a free group of rank \(g\): \(\pi_{1}(G)\simeq F_{g}\). Here, graphs shall be _admissible_, that means they do not have vertices of degree \(0\) or \(2\). Univalent vertices have a special role and are called _legs_ (often also _hairs_, _leaves_ or _marked points_). Similarly, we will reserve the name _edge_ to \(1\)-cells that are only incident to non-leg vertices. Legs of graphs are uniquely labeled by integers \(\{1,\ldots,n\}\). A _metric graph_ is additionally equipped with a length \(\ell(e)\geq 0\) for each edge \(e\) such that all edge lengths sum to one, \(\sum_{e}\ell(e)=1\). Fix \(g,n\) such that \(g>0\) and \(2g-2+n>0\). The moduli space of graphs, \(\mathcal{M}\mathcal{G}_{g,n}\), is the space of isometry classes of metric graphs of rank \(g\) with \(n\) legs except for graphs that have a self-loop edge (i.e. an edge that connects to the same vertex) of length \(0\). It inherits the topology from the metric and by identifying each graph that has a non-self-loop edge \(e\) of length \(0\) with the respective graph where \(e\) is collapsed. The moduli space of graphs was introduced in [13], where it was shown that \(\mathcal{M}\mathcal{G}_{g,0}\) serves as a classifying space for \(\mathrm{Out}(F_{g})\), the outer automorphism group of the free group of rank \(g\). Further, \(\mathcal{M}\mathcal{G}_{g,n}\) can be seen as the moduli space of _pure tropical curves_[1] and it is a natural integration domain for _Feynman amplitudes_ which are pivotal objects in quantum field theory [4]. A partition \(\lambda\vdash n\) gives rise to both an irreducible representation \(V_{\lambda}\) of the symmetric group \(\mathbb{S}_{n}\) and a Schur polynomial \(s_{\lambda}\), a symmetric polynomial in \(\Lambda_{n}=\mathbb{Q}[x_{1},\ldots,x_{n}]^{\mathbb{S}_{n}}\). The symmetric group acts on the cohomology of \(\mathcal{M}\mathcal{G}_{g,n}\) by permuting the leg-labels. So, \(H^{k}(\mathcal{M}\mathcal{G}_{g,n};\mathbb{Q})\) is an \(\mathbb{S}_{n}\)-representation that we can decompose into irreducibles, i.e. there are integers \(c_{g,\lambda}^{k}\) such that \[H^{k}(\mathcal{M}\mathcal{G}_{g,n};\mathbb{Q})\simeq\bigoplus_{\lambda\vdash n }c_{g,\lambda}^{k}V_{\lambda}.\] The multiplicities \(c_{g,\lambda}^{k}\) are known explicitly if \(g\leq 2\)[11]. The \(\mathbb{S}_{n}\)-equivariant Euler characteristic of \(\mathcal{M}\mathcal{G}_{g,n}\) is the following symmetric polynomial that involves an alternating sum over the \(c_{g,\lambda}^{k}\), \[e_{\mathbb{S}_{n}}(\mathcal{M}\mathcal{G}_{g,n})=\sum_{\lambda\vdash n}s_{ \lambda}\sum_{k}(-1)^{k}c_{g,\lambda}^{k}. \tag{1}\] Our first main result is an effective formula for \(e_{\mathbb{S}_{n}}(\mathcal{M}\mathcal{G}_{g,n})\). It is stated as Theorem 2.17. Its proof in Section 2 is based on prior work by Vogtmann and the first author [7]. Analogous formulas exist, for instance, for the \(\mathbb{S}_{n}\)-equivariant Euler characteristic of \(\mathcal{M}_{g,n}\)[16] and for the \(\mathbb{S}_{n}\)-equivariant Euler characteristic of the moduli space of stable tropical curves [8]. The latter moduli space is a compactification of \(\mathcal{M}\mathcal{G}_{g,n}\) and its cohomology injects into the cohomology of \(\mathcal{M}_{g,n}\)[9]. Introduction Let \(\mathbb{S}_{n}\) be a finite set of integers, and let \(\Gamma_{g,n}\) be a \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-dimensional \(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\)-\(n\)-\(n\)-\(n\)-dimensional \(n\)-\(n\) previous stability results for \(\mathcal{MG}_{g,n}\) (see [11] and the references therein). Here, in contrast to these previous results, the range of stabilization does not depend on the cohomological degree. ## Acknowledgements MB is grateful to Karen Vogtmann for many discussions and related joint work. He is indebted to Soren Galatius and Thomas Willwacher for valuable insights that led to the proof of Theorem 3.1 and thanks Benjamin Bruck and Nathalie Wahl for helpful discussions. He also thanks the Institute of Advanced Studies, Princeton US, where parts of this work were completed, for hospitality. MB was supported by Dr. Max Rossler, the Walter Haefner Foundation and the ETH Zurich Foundation. ## 2. The \(\mathbb{S}_{n}\)-equivariant Euler characteristic of \(\mathcal{MG}_{g,n}\) ### Forested graph complexes In this section we will describe chain complexes that compute the homology of \(\mathcal{MG}_{g,n}\). These chain complexes are generated by certain graphs. A subgraph is a subcomplex of a graph that consists of all its vertices, its non-edge \(1\)-cells and a subset of its edges. A subforest is an acyclic subgraph. A pair \((G,\Phi)\) of a graph \(G\) and a subforest \(\Phi\subset G\) is a _forested graph_. We write \(|\Phi|\) for the number of edges in the forest \(\Phi\). Figure 1 shows some examples of forested graphs with different rank, forest edge and leg numbers. The forest edges are drawn thicker and in blue. Legs are drawn as labeled half-edges. A \((+)\)-marking \(\sigma_{\Phi}\) of \((G,\Phi)\) is an ordering of the forest edges, i.e. a bijection \(\sigma_{\Phi}:E_{\Phi}\to\{1,\ldots,|\Phi|\}\). A \((-)\)-marking \((\sigma_{\Phi},\sigma_{H_{1}(G,\mathbb{Z})})\) of \((G,\Phi)\) is such an ordering of the forest edges \(\sigma_{\Phi}\) together with a basis for the first homology of the graph, i.e. a bijection \(\sigma_{H_{1}}:H_{1}(G,\mathbb{Z})\to\mathbb{Z}^{h_{1}(G)}\), where \(h_{1}(G)=\dim H_{1}(G,\mathbb{Z})\). **Definition 2.1**.: _For given \(g,n\geq 0\) with \(2g-2+n\geq 0\), we define two \(\mathbb{Q}\)-vector spaces:_ * \(\mathcal{F}^{+}_{g,n}\) _is generated by tuples_ \((G,\Phi,\sigma_{\Phi})\) _of a connected admissible forested graph_ \((G,\Phi)\) _of rank_ \(g\) _with_ \(n\) _legs, which is_ \((+)\)_-marked with_ \(\sigma_{\Phi}\)_, modulo the relation_ \[(G,\Phi,\pi\circ\sigma_{\Phi})\sim\operatorname{sign}(\pi)\cdot(G,\Phi,\sigma _{\Phi})\text{ for all }\pi\in\mathbb{S}_{|\Phi|},\] _and modulo isomorphisms of_ \((+)\)_-marked forested graphs._ * \(\mathcal{F}^{-}_{g,n}\) _is generated by tuples_ \((G,\Phi,\sigma_{\Phi},\sigma_{H_{1}})\) _of a connected admissible forested graph_ \((G,\Phi)\) _of rank_ \(g\) _with_ \(n\) _legs, which is_ \((-)\)_-marked with_ \(\sigma_{\Phi},\sigma_{H_{1}}\) _modulo the relation_ \[(G,\Phi,\pi\circ\sigma_{\Phi},\rho_{H_{1}}\circ\sigma_{H_{1}}) \sim\operatorname{sign}(\pi)\cdot\det\rho_{H_{1}}\cdot(G,\Phi,\sigma_{\Phi})\] \[\text{ for all }\pi\in\mathbb{S}_{|\Phi|}\text{ and }\rho_{H_{1}} \in\operatorname{GL}_{h_{1}(G)}(\mathbb{Z})\] _and modulo isomorphisms of_ \((-)\)_-marked forested graphs._ We will discuss the relations imposed in this definition and how they give rise to two different ways to impose _orientations_ on graphs in more detail in Section 2.3. In what follows, we will often cover both the \((+)\) and \((-)\)-cases analogously in the same sentence using the \(\pm\)-notation. Notice that the vector spaces \(\mathcal{F}^{\pm}_{g,n}\) are defined for a slightly larger range of pairs \((g,n)\) then the moduli spaces \(\mathcal{MG}_{g,n}\). This generalization makes the generating functions for the Euler characteristics in Section 2.6 easier to handle. There are no (admissible) graphs of rank one without legs, so \(\mathcal{F}^{+}_{1,0}=\mathcal{F}^{-}_{1,0}=\emptyset\), but there is one admissible graph of rank \(0\) with two legs and no vertices or edges. It just consists of a \(1\)-cell that connects the legs. The vector spaces \(\mathcal{F}^{\pm}_{g,n}\) are graded by the number of edges in the forest. Let \(C_{k}(\mathcal{F}^{\pm}_{g,n})\) be the respective subspace restricted to generators with \(k\) forest edges. These spaces form a chain complex, so we will refer to \(\mathcal{F}^{\pm}_{g,n}\) as the _forested graph complex_ with \((\pm)\) orientation. We will not explicitly state the boundary maps, \(\partial_{k}:C_{k}(\mathcal{F}^{\pm}_{g,n})\to C_{k-1}(\mathcal{F}^{\pm}_{g,n})\) here (see, [12]), as knowledge of the dimensions of these chain groups suffices for our Euler characteristic considerations. The following theorem is a consequence of the works of Culler-Vogtmann [13], Kontsevich [18, 19] and Conant-Vogtmann [12] (see in particular [12, Sec. 3.1-3.2]): **Theorem 2.2**.: _For \(g>0\), \(n\geq 0\) and \(2g-2+n>0\), the chain complexes \(\mathcal{F}^{+}_{g,n}\) (\(\mathcal{F}^{-}_{g,n}\)) compute the homology of \(\mathcal{M}\mathcal{G}_{g,n}\) with trivial coefficients \(\mathbb{Q}\) (with twisted coefficients \(\mathbb{Q}\)). The \(\mathbb{S}_{n}\)-action on \(H^{\bullet}(\mathcal{M}\mathcal{G}_{g,n},\mathbb{Q})\) (\(H^{\bullet}(\mathcal{M}\mathcal{G}_{g,n},\widetilde{\mathbb{Q}})\)) descents obviously to \(\mathcal{F}^{+}_{g,n}\) (\(\mathcal{F}^{-}_{g,n}\)) by permuting leg-labels._ In what follows, we will use this theorem to prove a formula for \(e_{\mathbb{S}_{n}}(\mathcal{M}\mathcal{G}_{n,s})\) and \(e_{\mathbb{S}_{n}}^{\mathrm{odd}}(\mathcal{M}\mathcal{G}_{n,s})\). ### Equivariant Euler characteristics Recall that a permutation \(\pi\in\mathbb{S}_{n}\) factors uniquely as a product of disjoint cycles. If the orders of these cycles are \(\lambda_{1},\ldots,\lambda_{\ell}\), then \((\lambda_{1},\ldots,\lambda_{\ell})\) is a partition of \(n\) called the _cycle type_ of \(\pi\). For such a permutation \(\pi\in\mathbb{S}_{n}\), we define the symmetric polynomial, \(p^{\pi}=p_{\lambda_{1}}\cdots p_{\lambda_{\ell}}\in\Lambda_{n}\), where \(p_{k}=\sum_{i=1}^{n}x_{i}^{k}\) is the _\(k\)-th power sum symmetric polynomial_. The _Frobenius characteristic_ is a symmetric polynomial associated uniquely to a \(\mathbb{S}_{n}\)-representation \(V\). It is defined by \[\mathrm{ch}(\chi_{V})=\frac{1}{n!}\sum_{\pi\in\mathbb{S}_{n}}\chi_{V}(\pi)p^{ \pi},\] where \(\chi_{V}\) is the _character_ associated to \(V\) (see, e.g., [23, SS7.18]). The \(\mathbb{S}_{n}\)_-equivariant Euler characteristic_ of \(\mathcal{F}^{\pm}_{g,n}\) is the alternating sum over the Frobenius characteristics of \(H_{k}(\mathcal{F}^{\pm}_{g,n};\mathbb{Q})\). Note that this is consistent with the definition of \(e_{\mathbb{S}_{n}}(\mathcal{M}\mathcal{G}_{g,n})\) in eq. (1) since \(\mathrm{ch}(\chi_{V_{\lambda}})=s_{\lambda}\). We can compute the equivariant Euler characteristic on the chain level: **Proposition 2.3**.: _The \(\mathbb{S}_{n}\)-equivariant Euler characteristic of \(\mathcal{F}^{\pm}_{g,n}\) is given by_ \[e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})=\sum_{k}(-1)^{k}\,\mathrm{ch}( \chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})}),\] _where \(\mathrm{ch}(\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})})\) is the Frobenius characteristic of \(C_{k}(\mathcal{F}^{\pm}_{g,n})\) as an \(\mathbb{S}_{n}\)-representation,_ \[\mathrm{ch}(\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})})=\frac{1}{n!}\sum_{\pi\in \mathbb{S}_{n}}\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})}(\pi)p^{\pi},\] _and \(\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})}\) is the character associated to \(C_{k}(\mathcal{F}^{\pm}_{g,n})\)._ **Corollary 2.4**.: _For \(g>0\), \(n\geq 0\) and \(2g-2+n>0\),_ \[e_{\mathbb{S}_{n}}(\mathcal{M}\mathcal{G}_{g,n})=e_{\mathbb{S}_{n}}(\mathcal{ F}^{+}_{g,n})\qquad\qquad\text{and}\qquad\qquad e_{\mathbb{S}_{n}}^{\mathrm{odd}}( \mathcal{M}\mathcal{G}_{g,n})=e_{\mathbb{S}_{n}}(\mathcal{F}^{-}_{g,n}).\] Proof.: Follows directly from Theorem 2.2. Figure 1. Examples of forested graphs The other discussed Euler characteristics of \(\mathcal{MG}_{g,n}\) can be obtained by evaluating the polynomials \(e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{\pm})\) for certain values of \(\overline{p}=p_{1},p_{2},\ldots\). We write \(\overline{p}=\overline{1}\) for the specification \(p_{1}=1\), \(p_{2}=p_{3}=\ldots=0\) and \(\overline{p}=\mathbf{1}\) for the specification \(p_{1}=p_{2}=\ldots=1\). **Proposition 2.5**.: _For \(g>0\), \(n\geq 0\) and \(2g-2+n>0\),_ \[e(\mathcal{MG}_{g,n}) =n!\cdot e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{+})|_{\overline{p} =\overline{1}}, e^{\mathrm{odd}}(\mathcal{MG}_{g,n}) =n!\cdot e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{-})|_{\overline{p} =\overline{1}},\] \[e(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}}) =e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{+})|_{\overline{p}= \mathbf{1}}, e^{\mathrm{odd}}(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}}) =e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{-})|_{\overline{p}= \mathbf{1}}.\] Proof.: To verify the first two equations, observe that \(\chi_{V}(\mathrm{id})=\dim V\), where \(\mathrm{id}\) is the trivial permutation. For the second line recall that \(\frac{1}{n!}\sum_{\pi\in\mathbb{S}_{n}}\chi_{V}(\pi)=\dim V^{\mathbb{S}_{n}}\), where \(V^{\mathbb{S}_{n}}\) is the \(\mathbb{S}_{n}\)-invariant subspace of \(V\). Additionally, use Proposition2.3 and Corollary2.4. To explicitly compute \(e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{\pm})\), we hence need to compute the Frobenius characteristic of the chain groups and to compute those we need to know the character \(\chi_{C_{k}(\mathcal{F}_{g,n}^{\pm})}\). To compute these characters, we need a more detailed description of the chain groups \(C_{k}(\mathcal{F}_{g,n}^{\pm})\) that are generated only by _orientable forested graphs_. ### Orientable forested graphs Roughly, the relations in Definition2.1 have the effect that a chosen ordering of the forest edges or a chosen homology basis, _only matters up to its sign or its orientation_. We can therefore think of the generators as _oriented_ forested graphs. Due to the relations, every forested graphs gives rise to at most one generator of \(\mathcal{F}_{g,n}^{+}\) or \(\mathcal{F}_{g,n}^{-}\). However, not every forested graph is _orientable_ in this way, i.e. gives rise to a generator. Even though Definition2.1 only involves connected forested graphs, we will define the notion of orientability here also for disconnected graphs. We will need it later. Let \(\mathrm{Aut}(G,\Phi)\) be the group of automorphisms of the forested graph \((G,\Phi)\). Each automorphism is required to fix the leg-labels and the forest. For instance, the graph in Figure1 has one automorphism of order two that mirrors the graph on the horizontal axis. The graph in Figure1 has one automorphism that flips the two doubled edges and the graph in Figure1 has no (leg-label-preserving) automorphisms. Each \(\alpha\in\mathrm{Aut}(G,\Phi)\) induces a permutation, \(\alpha_{\Phi}:E_{\Phi}\to E_{\Phi}\) on the set of forest edges and an automorphism on the homology groups \(\alpha_{H_{0}}:H_{0}(G,\mathbb{Z})\to H_{0}(G,\mathbb{Z})\) and \(\alpha_{H_{1}}:H_{1}(G,\mathbb{Z})\to H_{1}(G,\mathbb{Z})\). For each (possibly disconnected) forested graph \((G,\Phi)\) with an automorphism \(\alpha\in\mathrm{Aut}(G,\Phi)\), we define \[\xi^{+}(G,\Phi,\alpha)=\mathrm{sign}(\alpha_{\Phi})\text{ and }\xi^{-}(G,\Phi, \alpha)=\det(\alpha_{H_{0}})\det(\alpha_{H_{1}})\mathrm{sign}(\alpha_{\Phi}).\] As connected graphs come with a canonical basis for \(H_{0}(G,\mathbb{Z})\simeq\mathbb{Z}\) that cannot be changed by automorphisms, we always have \(\det(\alpha_{H_{0}})=1\) for them. The other sign factors capture the signs of the relations in Definition2.1 if the \((\pm)\)-marking of the graph \((G,\Phi)\) is acted upon using \(\alpha\) in the obvious way. **Definition 2.6**.: _A forested graph \((G,\Phi)\) is \((\pm)\)-orientable if it has no automorphism \(\alpha\in\mathrm{Aut}(G,\Phi)\) for which \(\xi^{\pm}(G,\Phi,\alpha)=-1\)._ For example, the automorphism of the forested graph in Figure1 switches two forest edges and flips the orientation of a chosen homology basis. Hence, the graph is \((-)\)-, but not \((+)\)-orientable. The automorphism of the graph in Figure1 does not affect its subforest, but flips the orientation of its homology basis. So, it is \((+)\)-, but not \((-)\)-orientable. The forested graph in Figure1 is both \((+)\)- and \((-)\)-orientable as it has no nontrivial automorphism. There are also forested graphs that are neither \((+)\)- nor \((-)\)-orientable. **Proposition 2.7**.: _The chain groups \(C_{k}(\mathcal{F}_{g,n}^{\pm})\) are freely generated by connected \((\pm)\)-orientable forested graphs of rank \(g\) with \(n\) legs and \(k\) forest edges._ Proof.: Follows from Definitions 2.1 and 2.6. ### The action of \(\mathbb{S}_{n}\) on orientable graphs The next step for the explicit evaluation of \(e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{\pm})\) is to quantify the action of \(\mathbb{S}_{n}\) that permutes the legs of the generators of \(\mathcal{F}_{g,n}^{\pm}\). Let \(\operatorname{UAut}(G,\Phi)\) be the set of automorphisms of a forested graph \((G,\Phi)\) with \(n\) legs that are _allowed_ to permute the leg-labels. For instance, for the graph in Figure 0(c), which has a trivial leg-label-preserving automorphism group, the group \(\operatorname{UAut}(G,\Phi)\) is generated by the automorphism that mirrors the graph vertically and permutes the leg-labels by (12)(34). We have a map \(\pi_{G}:\operatorname{UAut}(G,\Phi)\to\mathbb{S}_{n}\), given by only looking at the induced permutation on the leg-labels. The kernel of this map is equal to \(\operatorname{Aut}(G,\Phi)\), the group of leg-label-fixing automorphisms of \((G,\Phi)\). The \(\mathbb{S}_{n}\)-action gives a linear map \(\rho:\mathbb{S}_{n}\to\operatorname{GL}(C_{k}(\mathcal{F}_{g,n}^{\pm}))\). For a specific \(\pi\in\mathbb{S}_{n}\), the linear map \(\rho(\pi)\in\operatorname{GL}(C_{k}(\mathcal{F}_{g,n}^{\pm}))\) replaces each generator of \(C_{k}(\mathcal{F}_{g,n}^{\pm})\) with the respective generator where the leg labels are permuted by \(\pi\). The character of \(C_{k}(\mathcal{F}_{g,n}^{\pm})\) is the composition of \(\rho\) with the trace, \(\chi_{C_{k}(\mathcal{F}_{g,n}^{\pm})}=\operatorname{Tr}\circ\rho\). As \(\rho(\pi)\) maps each generator to a multiple of another generator, it is sufficient to look at generators that happen to be Eigenvectors of \(\rho(\pi)\) to compute \(\operatorname{Tr}(\rho(\pi))\). Let \((G,\Phi,\sigma^{\pm})\) be a connected \((\pm)\)-orientable forested graph with a \((\pm)\)-marking \(\sigma^{\pm}\) corresponding to a generator of \(C_{k}(\mathcal{F}_{g,n}^{\pm})\). This generator is an Eigenvector of \(\rho(\pi)\) if the forested graph \((G,\Phi)\) has a non-leg-label-fixing automorphism \(\alpha\in\operatorname{UAut}(G,\Phi)\) such that \(\pi_{G}(\alpha)=\pi\). The following lemma describes the Eigenvalue corresponding to such an Eigenvector. It is either \(+1\) or \(-1\). **Lemma 2.8**.: _If, for given \(\pi\in\mathbb{S}_{n}\), the generator \((G,\Phi,\sigma^{\pm})\in C_{k}(\mathcal{F}_{g,n}^{\pm})\) is an Eigenvector of \(\rho(\pi)\), then the corresponding Eigenvalue is \(\xi^{\pm}(G,\Phi,\alpha^{\prime})\), where \(\alpha^{\prime}\) is some representative \(\alpha^{\prime}\in\pi_{G}^{-1}(\pi)\)._ Proof.: By Proposition 2.7, \((G,\Phi)\) cannot have a leg-label-fixing automorphism that flips the orientation. However, an automorphism from the larger group \(\operatorname{UAut}(G,\Phi)\) can change the sign of the orientation (i.e. the sign of the ordering and basis given by the \((\pm)\)-marking in Definition 2.1 can be flipped). The map \(\rho(\pi)\) does so if \(\xi^{\pm}(G,\Phi,\alpha^{\prime})=-1\) for a representative of the kernel \(\alpha^{\prime}\in\pi_{G}^{-1}(\pi)\). As \(\alpha\mapsto\xi^{\pm}(G,\Phi,\alpha)\) gives a group homomorphism \(\operatorname{UAut}(G,\Phi)\to\mathbb{Z}/2\mathbb{Z}\) and as \(\xi^{\pm}(G,\Phi,\alpha)=1\) for all \(\alpha\in\ker\pi_{G}\), it does not matter which representative we pick. Summing over all such Eigenvalues of \(\rho(\pi)\) gives the value of \(\operatorname{Tr}(\rho(\pi))=\chi_{C_{k}(\mathcal{F}_{g,n}^{\pm})}(\pi)\): **Corollary 2.9**.: _For each \(\pi\in\mathbb{S}_{n}\), the character of \(C_{k}(\mathcal{F}_{g,n}^{\pm})\) is_ \[\chi_{C_{k}(\mathcal{F}_{g,n}^{\pm})}(\pi)=\sum\xi^{\pm}(G,\Phi,\alpha^{\prime }_{(G,\Phi,\pi)}),\] _where we sum over all \((\pm)\)-orientable forested graphs \((G,\Phi)\) that are left invariant by permuting the leg-labels with \(\pi\) and for each \((G,\Phi)\), \(\alpha^{\prime}_{(G,\Phi,\pi)}\) is some representative in \(\pi_{G}^{-1}(\pi)\subset\operatorname{UAut}(G,\Phi)\)._ To continue, it is convenient to pass to a sum over all connected forested graphs without restrictions on the orientability to get better combinatorial control over the expression: **Corollary 2.10**.: _For \(g,n\geq 0\) with \(2g-2+n\geq 0\) and \(k\geq 0\), we have_ \[\chi_{C_{k}(\mathcal{F}_{g,n}^{\pm})}(\pi)=\sum_{[G,\Phi]}\frac{1}{| \operatorname{Aut}(G,\Phi)|}\sum_{\alpha\in\pi_{G}^{-1}(\pi)}\xi^{\pm}(G,\Phi, \alpha),\] _where we sum over all isomorphism classes of (not necessarily orientable) connected forested graphs \([G,\Phi]\) of rank \(g\), \(n\) legs and \(k=|\Phi|\) forest edges._ Proof.: As \(\alpha\mapsto\xi^{\pm}(G,\Phi,\alpha)\) also gives a map \(\operatorname{Aut}(G,\Phi)\to\mathbb{Z}/2\mathbb{Z}\), we have by Definition 2.6 \[\sum_{\alpha\in\ker\pi_{G}}\xi^{\pm}(G,\Phi,\alpha)=\begin{cases}| \operatorname{Aut}(G,\Phi)|&\text{ if }(G,\Phi)\text{ is }(\pm)\text{-orientable}\\ 0&\text{ else}\end{cases}\] The statement follows, as \(\sum_{\alpha\in\pi_{G}^{-1}(\pi)}\xi^{\pm}(G,\Phi,\alpha)=\xi^{\pm}(G,\Phi,\alpha ^{\prime})\sum_{\alpha\in\ker\pi_{G}}\xi^{\pm}(G,\Phi,\alpha)\), for any representative \(\alpha^{\prime}\in\pi_{G}^{-1}(\pi)\) and the formula from Corollary 2.9 for \(\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})}(\pi)\). With this we finally obtain our first explicit formula for \(e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})\): **Theorem 2.11**.: _For \(g,n\geq 0\) with \(2g-2+n\geq 0\),_ \[e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})=\sum_{[G,\Phi]_{U}}\frac{(-1)^{| \Phi|}}{|\mathrm{UAut}(G,\Phi)|}\sum_{\alpha\in\mathrm{UAut}(G,\Phi)}\xi^{\pm} (G,\Phi,\alpha)p^{\pi_{G}(\alpha)},\] _where we sum over connected forested graphs \([G,\Phi]_{U}\) of rank \(g\) with \(n\) unlabeled legs._ Proof.: We can plug the statement of Corollary 2.10 into the definition of the Frobenius characteristic in Proposition 2.3 to get \[\mathrm{ch}(\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})})=\frac{1}{n!}\sum_{\pi\in \mathbb{S}_{n}}p^{\pi}\sum_{[G,\Phi]}\frac{1}{|\mathrm{Aut}(G,\Phi)|}\sum_{ \alpha\in\pi_{G}^{-1}(\pi)}\xi^{\pm}(G,\Phi,\alpha).\] Next, we can merge the first and the third sum into a summation over the whole group \(\mathrm{UAut}(G,\Phi)\), as the preimages of different \(\pi\in\mathbb{S}_{n}\) partition \(\mathrm{UAut}(G,\Phi)\): \[\mathrm{ch}(\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})})=\frac{1}{n!}\sum_{[G,\Phi ]}\frac{1}{|\mathrm{Aut}(G,\Phi)|}\sum_{\alpha\in\mathrm{UAut}(G,\Phi)}\xi^{ \pm}(G,\Phi,\alpha)p^{\pi_{G}(\alpha)}.\] Let \(L_{S}(G,\Phi)\) be the set of mutually non-isomorphic forested graphs \((G,\Phi)\) that only differ by a relabeling of the legs. Obviously, \(\mathbb{S}_{n}\) acts transitively on \(L_{S}(G,\Phi)\) by permuting the leg-labels. The stabilizer of this action is the image of \(\pi_{G}:\mathrm{UAut}(G,\Phi)\to\mathbb{S}_{n}\). By the orbit-stabilizer theorem, \(n!=|\,\mathbb{S}_{n}\,|=|\,\mathrm{im}\,\pi_{G}||L_{S}(G,\Phi)|\). By the short exact sequence, \(1\to\mathrm{Aut}(G,\Phi)\to\mathrm{UAut}(G,\Phi)\to\mathrm{im}\,\pi_{G}\to 1\), we have \(|\,\mathrm{im}\,\pi_{G}|=|\mathrm{UAut}(G,\Phi)|/|\mathrm{Aut}(G,\Phi)|\). Hence, \[\mathrm{ch}(\chi_{C_{k}(\mathcal{F}^{\pm}_{g,n})})=\sum_{[G,\Phi]}\frac{1}{|L _{S}(G,\Phi)||\mathrm{UAut}(G,\Phi)|}\sum_{\alpha\in\mathrm{UAut}(G,\Phi)}\xi ^{\pm}(G,\Phi,\alpha)p^{\pi_{G}(\alpha)}.\] The terms in this sum do not depend on the leg-labeling of the graphs, so we can just sum over non-leg-labeled graphs and remove the \(|L_{S}(G,\Phi)|\) in the denominator. ### Disconnected forested graphs The expression for \(e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})\) in Theorem 2.11 involves a sum over _connected_ forested graphs without leg-labels. To eventually get an effective generating function for \(e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})\), it is convenient to pass to an analogous formula that sums over _disconnected_ forested graphs. Moreover, it is helpful to change from grading the graphs by rank to grading them by their negative Euler characteristic. For connected graphs, this is just a trivial shift as the negative Euler characteristic of such graphs fulfills \(\dim H_{1}(G,\mathbb{Z})-\dim H_{0}(G,\mathbb{Z})=g-1\). So, we define for all \(t\in\mathbb{Z}\) and \(n\geq 0\), \[\widehat{\mathrm{e}}^{\pm}_{t,n}=\sum_{[G,\Phi]_{U}}\frac{1}{|\mathrm{UAut}(G,\Phi)|}\sum_{\alpha\in\mathrm{UAut}(G,\Phi)}\xi^{\pm}(G,\Phi,\alpha)p^{\pi_{G }(\alpha)}, \tag{2}\] where we sum over all isomorphism classes of (possibly disconnected) forested graphs \([G,\Phi]_{U}\) of Euler characteristic \(\dim H_{0}(G,\mathbb{Z})-\dim H_{1}(G,\mathbb{Z})=-t\) and \(n\) unlabeled legs. There is only a finite number of such graphs, so the sum is finite and \(\widehat{\mathrm{e}}^{\pm}_{t,n}\) is a symmetric polynomial in \(\Lambda_{n}\). Later in this section we will prove a generating function for the polynomials \(\widehat{\mathrm{e}}^{\pm}_{t,n}\). Before that, we explain how we can translate them into our desired \(\mathbb{S}_{n}\)-equivariant Euler characteristics: **Proposition 2.12**.: _We define the following Laurent series over the ring of symmetric functions,_ \[\mathbf{e}^{\pm}(\hbar,\overline{p}) =\sum_{\begin{subarray}{c}g,n\geq 0\\ 2g-2+n\geq 0\end{subarray}}e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})(\pm \hbar)^{g-1},\] \[\mathbf{E}^{\pm}(\hbar,\overline{p}) =\sum_{t\in\mathbb{Z}}\sum_{n\geq 0}\overline{\mathbf{e}^{\pm}_{t,n }}(\pm\hbar)^{t},\] _which are elements of \(\Lambda((\hbar))=\bigoplus_{n\geq 0}\Lambda_{n}((\hbar))\). Both are related by the plethystic exponential_ \[\mathbf{E}^{\pm}(\hbar,\overline{p})=\exp\left(\sum_{k\geq 1}\frac{\mathbf{e}^{ \pm}(\hbar^{k},\overline{p}_{[k]})}{k}\right),\] _where \(\mathbf{e}^{\pm}(\hbar^{k},\overline{p}_{[k]})\) denotes the power series \(\mathbf{e}^{\pm}\) with the substitutions \(\hbar\to\hbar^{k}\) and \(p_{i}\to p_{ik}\)._ Proof.: The combinatorial argument for [7, Proposition 3.2] applies to translate between the sum over _connected_ forested graphs in Theorem 2.11 to a sum over disconnected forested graphs in eq.2. The strategy goes back to Polya [21] (see also [3, Chapter 4.3]). Briefly, each summand \(\mathbf{e}^{\pm}(\hbar^{k},\overline{p}_{[k]})/k\) in the exponent of the stated formula counts pairs consisting of a \(k\)-tuple of mutually isomorphic forested graphs and an automorphism that cyclically permutes the different graphs. Such automorphisms give rise to different sign factors depending on the orientation of the graphs. Accounting for these signs gives the minus signs in front of \(\hbar\) in the \((-)\)-orientation case (see [7, Theorem 5.1]). We can solve the equation in the statement above for the generating functions \(\mathbf{e}^{\pm}(\hbar,\overline{p})\) and therefore obtain the value of \(e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})\) if we know sufficiently many coefficients of \(\mathbf{E}^{\pm}(\hbar,\overline{p})\). The required inverse transformation of power series is the plethystic logarithm: **Corollary 2.13**.: \[\mathbf{e}^{\pm}(\hbar,\overline{p})=\sum_{k\geq 1}\frac{\mu(k)}{k}\log \mathbf{E}^{\pm}(\hbar^{k},\overline{p}_{[k]}),\] _where \(\mu(k)\) is the number-theoretic Mobius function._ Proof.: Use the definition of the Mobius function: \(\sum_{d|n}\mu(d)=0\) for all \(n\geq 2\) and \(\mu(1)=1\). ### Generating functions In this section we will give the desired generating function for the polynomials \(\widehat{\mathbf{e}^{\pm}_{t,n}}\). Together with the discussion in the last section, this generating function will give us an effective formula for the \(\mathbb{S}_{n}\)-equivariant Euler characteristic \(e_{\mathbb{S}_{n}}(\mathcal{F}^{\pm}_{g,n})\). The generating function is closely related to the one given in [7, Theorem 3.12] and we refer to the argument given there. As in [7], we define the following power series in \(\overline{q}=q_{1},q_{2},\ldots\) \[\mathbf{V}(\overline{q})=q_{1}+\frac{q_{1}^{2}}{2}-\frac{q_{2}}{2}-(1+q_{1}) \sum_{k\geq 1}\frac{\mu(k)}{k}\log(1+q_{k}). \tag{3}\] See [7] for the first coefficients of \(\mathbf{V}(\overline{q})\). Moreover, we define two power series \(\mathbf{F}^{+}\) and \(\mathbf{F}^{-}\) both in two infinite sets of variables \(\overline{q}=q_{1},q_{2},\ldots\), \(\overline{p}=p_{1},p_{2},\ldots\) and a single variable \(u\), \[\mathbf{F}^{\pm}(u,\overline{q},\overline{p})=\exp\left(\sum_{k\geq 1}(\pm 1)^{k+1 }u^{-2k}\frac{\mathbf{V}((u\cdot\overline{q})_{[k]})+u^{k}q_{k}p_{k}}{k} \right), \tag{4}\] where \(\mathbf{V}((u\cdot\overline{q})_{[k]})\) means that we replace each variable \(q_{i}\) in \(\mathbf{V}(\overline{q})\) with \(u^{ki}q_{ki}\). Recall that a forest is an acyclic graph. As graphs, also forests are required to be admissible that means they have no vertices of degree \(0\) and \(2\). Again, the univalent vertices are interpreted as the legs of the forest. An _extended_ forest is a forests that is additionally allowed to have _special_ univalent vertices that are always connected by a \(1\)-cell to a leg. In contrast to graphs, we do not allow extended forests to have components that consist of two adjacent legs or two adjacent special vertices. See also [7, Section 3.7] for a discussion of extended forests. The legs of a forest are labeled by integers \(\{1,\ldots,s\}\). The special vertices remain unlabeled. Figure 2 depicts an extended forest with three components; one of which is special. The special vertex is marked as a box. Legs are again drawn as labeled half-edges. We write \(k(\Phi)\), \(s(\Phi)\) and \(n(\Phi)\) for the total number of connected components, the number of legs and the number of special vertices of an extended forest \(\Phi\). An automorphism \(\gamma\in\operatorname{UAut}(\Phi)\) that is allowed to permute the leg-labels gives rise to a permutation of the edges of \(\Phi\). We write \(e_{\gamma}(\Phi)\) for the numbers of orbits of this permutation. An automorphism \(\gamma\in\operatorname{UAut}(\Phi)\) also gives rise to a permutation \(\pi_{G}(\gamma)\in\mathbb{S}_{s(\Phi)}\) of the legs, a permutation \(\pi_{G}^{\star}(\gamma)\in\mathbb{S}_{n(\Phi)}\) of the special vertices and a permutation \(\gamma_{H_{0}(\Phi)}\in\mathbb{S}_{h_{0}(\Phi)}\) of the connected components of \(\Phi\). **Proposition 2.14**.: _The generating functions \(\mathbf{F}^{\pm}\) count signed pairs of an extended forest \(\Phi\) and an automorphism \(\gamma\) of \(\Phi\). Explicitly,_ \[\mathbf{F}^{+}(u,\overline{q},\overline{p}) =\sum_{(\Phi,\gamma)} (-1)^{e_{\gamma}(\Phi)}u^{s(\Phi)-2k(\Phi)}p^{\pi_{G}^{\star}( \gamma)}\frac{q^{\pi_{G}(\gamma)}}{s(\Phi)!},\] \[\mathbf{F}^{-}(u,\overline{q},\overline{p}) =\sum_{(\Phi,\gamma)}\operatorname{sign}(\gamma_{H_{0}(\Phi)})(- 1)^{e_{\gamma}(\Phi)}u^{s(\Phi)-2k(\Phi)}p^{\pi_{G}^{\star}(\gamma)}\frac{q^{ \pi_{G}(\gamma)}}{s(\Phi)!},\] _where we sum over all pairs of an extended forest \(\Phi\) and all \(\gamma\in\operatorname{UAut}(\Phi)\)._ Proof.: This statement is a slight generalization of [7, Proposition 3.10] and [7, Proposition 5.5]. Here, we also allow forests to have special vertices and modify the generating function accordingly. The term \((\pm 1)^{k+1}u^{-k}q_{k}p_{k}/k\) in eq. (4) accounts for these special components. Explicitly, it stands for \(k\) special components that are cyclically permuted by the overall automorphism that is acting on the forested graph (see, [7, Lemma 3.3] or [3]). Each component contributes two negative powers of \(u\), because it adds one component, and one positive power of \(u\) as it adds one leg. So, we mark a cycle of \(k\) special components with \(u^{-k}\). The different signs for the odd case are a consequence of [7, Lemma 5.3] and the fact that each special vertex counts as a new connected component of \(\Phi\). We will use the coefficient extraction operator notation. That means, we denote the coefficient of a power series \(f(\overline{q})\) in front of \(q^{\lambda}\) as \([q^{\lambda}]f(\overline{q})\). **Corollary 2.15**.: _The coefficient \([u^{2t}q^{\mu}p^{\lambda}]\mathbf{F}^{\pm}(u,\overline{q},\overline{p})\) vanishes if \(|\mu|=\sum_{i}\mu_{i}>6t+4|\lambda|\)._ Proof.: A maximal \((r,n)\)-forest is an extended forest that consists of \(r\) copies of a degree \(3\) vertex with three legs, and \(n\) special components of a special vertex and one leg. All extended Figure 2. Extended forest with one special component forests with \(n\) special components can be obtained by first starting with a maximal \((r,n)\)-forest, subsequently creating new edges by gluing together pairs of legs of different components and finally by contracting edges. The difference \(s(\Phi)-2k(\Phi)\) is left invariant by these gluing and contracting operations, but the number of legs \(s(\Phi)\) decreases each time we glue together a pair of legs. It follows that maximal \((r,n)\)-forests have the maximal number of legs for fixed \(n\). Such a forest contributes a power \(u^{3r-2r+n-2n}q^{\mu}p^{\lambda}=u^{r-n}q^{\mu}p^{\lambda}\) to the generating function, for some partitions \(\mu,\lambda\) with \(|\mu|=3r+n\) and \(|\lambda|=n\). Fixing \(2t=r-n\) gives \(|\mu|=6t+4n\). Alternatively, the statement can also be verified by expanding \(\mathbf{V}\) and \(\mathbf{F}^{\pm}\) from eqs. (3)-(4). We define two sets of numbers, \(\eta_{\lambda}^{+}\) and \(\eta_{\lambda}^{-}\), that are indexed by an integer partition, \(\lambda\vdash s\). These numbers combine the definitions in Corollaries 3.5 and 5.8 of [7], where \(\eta_{\lambda}^{+}\) is denoted as \(\eta_{\lambda}\) and \(\eta_{\lambda}^{-}\) as \(\eta_{\lambda}^{\mathrm{odd}}\). The discussion around these corollaries also includes a detailed combinatorial interpretation of these numbers: they count (signed) fixed-point free involutions that commute with a given permutation of cycle type \(\lambda\). An alternative notation for an integer partitions is \(\lambda=[1^{m_{1}}2^{m_{2}}\cdots]\), where \(m_{k}\) denotes the number of parts of size \(k\) in \(\lambda\). Let \[\eta_{\lambda}^{\pm}=\prod_{k=1}^{s}\eta_{k,m_{k}}^{\pm},\text{ where }\eta_{k, \ell}^{\pm}=\begin{cases}0&\text{if $k$ and $\ell$ are odd}\\ k^{\ell/2}(\ell-1)!!&\text{if $k$ is odd and $\ell$ is even}\\ \sum_{r=0}^{\lfloor\ell/2\rfloor}(\pm 1)^{\ell k/2+r}\binom{\ell}{2r}k^{r}(2r-1)!!& \text{else}\end{cases}\] With this we get an effective expression for the polynomials \(\widehat{\mathrm{e}}_{t,n}^{\pm}\) from eq. (2): **Theorem 2.16**.: \[\widehat{\mathrm{e}}_{t,n}^{\pm}=\sum_{\mu}\eta_{\mu}^{\pm}\sum_{\lambda \vdash n}p^{\lambda}[u^{2t}q^{\mu}p^{\lambda}]\mathbf{F}^{\pm}(u,\overline{q},\overline{p}),\] _where we sum over all integer partitions \(\mu\) and all partitions \(\lambda\) of \(n\)._ The sum over \(\mu\) in this statement is finite by Corollary 2.15. Proof.: Matching all legs of an extended forest in pairs gives a graph with a marked forest and special univalent vertices. We get this graph by gluing together the legs as described by a matching. Gluing together two legs creates a new \(1\)-cell between the vertices that are adjacent to the legs and forgets about the legs and the \(1\)-cells that are incident to them. The special vertices are subsequently promoted to (unlabeled) legs of the resulting forested graph. All forested graphs with unlabeled legs can be obtained this way. As an example consider the extended forest in Figure 2. We can match the legs in the pairs \((1,2),(3,7),(4,6),(5,10)\) and \((8,9)\). Gluing together these legs and promoting the special vertex to a new leg recreates the forested graph in Figure 0(a) without the leg-label. In general, if the extended forest that we start with has \(k\) connected components and \(s\) legs, then the graph that we obtain after the gluing has Euler characteristic \(k-s/2\). By Proposition 2.14 and the definition of the polynomials \(\widehat{\mathrm{e}}_{t,n}\) in eq. (2) we therefore extract the correct coefficient as all forests \(\Phi\) with \(s(\Phi)-2k(\Phi)=2t\) contribute to the coefficient of \(u^{2t}\). See the proof of [7, Proposition 3.10] and its odd version [7, Proposition 5.5] for the discussions of automorphisms and sign factors which apply also in our generalized case. Together Corollary 2.4, Corollary 2.13 and Theorem 2.16 give an effective algorithm for the computation of the polynomials \(e_{\mathbb{S}_{n}}(\mathcal{M}\mathcal{G}_{g,n})\) and \(e_{\mathbb{S}_{n}}^{\mathrm{odd}}(\mathcal{M}\mathcal{G}_{g,n})\). In summary: **Theorem 2.17**.: _Fix \(\chi>1\). To compute \(e(\mathcal{F}_{g,n}^{\pm})\) for all \(2g-2+n>0\) and \(g+1+n\leq\chi\),_ 1. _Compute the coefficients of_ \(\mathbf{V}\) _up to homogeneous order_ \(6\chi\) _in the_ \(\overline{q}\)_-variables by expanding the power series defined in eq. (_3_)._ 2. _Compute the coefficients of_ \(\mathbf{F}^{\pm}\) _up to homogeneous order_ \(\chi\) _in_ \(u^{2}\) _and in the_ \(\overline{p}\) _variables by expanding the power series defined in eq._ (4)_._ 3. _Compute the polynomials_ \(\widehat{\mathrm{e}}_{t,n}^{\pm}\) _for all pairs_ \((t,n)\) _with_ \(n\geq 0\)_,_ \(t+n\leq\chi\) _and_ \(t\geq-n/2\) _using Theorem_ 2.16_._ 4. _Compute the polynomials_ \(e_{\mathbb{S}_{n}}(\mathcal{F}_{g,n}^{\pm})\) _using the formula from Corollary_ 2.13_._ The formulas in Corollary 2.4 and Proposition 2.5 can be used to translate the result into the numbers \(e(\mathcal{MG}_{g,n}),e^{\mathrm{odd}}(\mathcal{MG}_{g,n}),e(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}})\) and \(e^{\mathrm{odd}}(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}})\). To compute the integers \(\sum_{k}(-1)^{k}c_{g,\lambda}^{k}\) that are the alternating sums over the multiplicities of the irreducible representations in the respective cohomology of \(\mathcal{MG}_{g,n}\), we have to write the polynomials \(e_{\mathbb{S}_{n}}(\mathcal{MG}_{g,n})\) and \(e^{\mathrm{odd}}_{\mathbb{S}_{n}}(\mathcal{MG}_{g,n})\) in terms of Schur polynomials as in eq. (1). We can do so using the Murnaghan-Nakayama rule. ### Implementation of Theorem 2.17 in \(\mathsf{FORM}\) The most demanding computational step in Theorem 2.17 is the expansion of the power series \(\mathbf{F}^{\pm}\) as defined in eq. (4) in the formal variables \(u,\overline{p}\) and \(\overline{q}\). Conventional computer algebra struggles with such expansions; usually only a small number of terms are accessible. To be able to apply Theorem 2.17 at moderately large values of \(\chi\), we use the \(\mathsf{FORM}\) programming language. \(\mathsf{FORM}\) is designed to deal with large analytic expressions that come up in high-energy physics. A \(\mathsf{FORM}\) program that implements Theorem 2.17 is included in the ancillary files to this article in the file eMGgn.frm. It can be run with the command form eMGgn.frm after downloading and installing \(\mathsf{FORM}\) from [https://github.com/vermaseren/form.git](https://github.com/vermaseren/form.git). The syntax and details of the code are described in a \(\mathsf{FORM}\) tutorial [25]. We used \(\mathsf{FORM}\) version _5 beta_ for our computations. The output of the program is a power series in which each coefficient is a symmetric function that describes the respective \(\mathbb{S}_{n}\)-equivariant Euler characteristic. These coefficients are given in the power sum basis of the ring of symmetric functions. To translate the output into Schur symmetric function via the Murnaghan-Nakayama rule, we used \(\mathsf{Sage}\)[14]. _Remark 2.18_.: By employing the _Feynman transform_ introduced by Getzler and Kapranov [15], modified versions of this program can effectively compute the Euler characteristics of _modular operads_. Furthermore, by combining Joyal's theory of species (see, e.g., [3]) with findings from the first author's thesis [5], the program can be adapted to count various combinatorial objects, such the number of isomorphism classes of admissible graphs of rank \(n\)[17]. ### Large \(g\) asymptotics of the Euler characteristics of \(\mathcal{MG}_{g,n}\) The _rational_ or _virtual_ Euler characteristic \(\chi(G)\) is an invariant of a group \(G\) that is often better behaved than the usual Euler characteristic. Recall that the notation '\(f(g)\sim h(g)\) for large \(g\)' means that \(\lim_{g\to\infty}f(g)/h(g)=1\). By the short exact sequence \(1\to F_{g}^{n}\to\Gamma_{g,n}\to\mathrm{Out}(F_{g})\to 1\)[11], we have \(\chi(\Gamma_{g,n})=(1-g)^{n}\chi(\mathrm{Out}(F_{g}))\). The numbers \(\chi(\mathrm{Out}(F_{g}))\) can be computed using [6, Proposition 8.5] and the asymptotic growth rate of \(\chi(\mathrm{Out}(F_{g}))\) is known explicitly by [6, Theorem A]. Using this together with the formula for \(\chi(\Gamma_{g,n})\) and Stirling's approximation, we find that for fixed \(n\geq 0\), \[\chi(\Gamma_{g,n})\sim(-1)^{n+1}g^{n}\left(\frac{g}{e}\right)^{g}/(g\log g)^{2} \text{ for large }g.\] In [7], it was proven that \(e(\mathcal{MG}_{g,0})\sim e^{-\frac{1}{4}}\chi(\mathrm{Out}(F_{g}))\) and \(e^{\mathrm{odd}}(\mathcal{MG}_{g,0})\sim e^{\frac{1}{4}}\chi(\mathrm{Out}(F_{ g}))\) for large \(g\). It would be interesting to make similar statements about \(\mathcal{MG}_{g,n}\) for \(n\geq 1\). Using our data on the Euler characteristics of \(\mathcal{MG}_{g,n}\), we empirically verified the following conjecture which generalizes the known asymptotic behaviour of \(\mathcal{MG}_{g,0}\) to \(\mathcal{MG}_{g,n}\) for all \(n\geq 0\). **Conjecture 2.19**.: _For fixed \(n\geq 0\), we have for large \(g\)_ \[e(\mathcal{MG}_{g,n}) \sim e^{-\frac{1}{4}}\chi(\Gamma_{g,n}) e^{\mathrm{odd}}(\mathcal{MG}_{g,n}) \sim e^{\frac{1}{4}}\chi(\Gamma_{g,n})\] \[e(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}}) \sim e^{-\frac{1}{4}}\chi(\Gamma_{g,n})/n! e^{\mathrm{odd}}(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}}) \sim e^{\frac{1}{4}}\chi(\Gamma_{g,n})/n!\] Proving this conjecture should be feasible by generalizing the analytic argument in [7, Sec. 4]. . The \(\mathbb{S}_{n}\)-invariant cohomological stability of \(\mathcal{MG}_{g,n}\) for large \(n\) Our data in the Tables 2-5 exhibit an obvious pattern: For fixed \(g\) the \(\mathbb{S}_{n}\)_-invariant_ Euler characteristics \(e(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}})\) and \(e^{\mathrm{odd}}(\mathcal{MG}_{g,n}^{\mathbb{S}_{n}})\) appear to be constant for all \(n\geq g\). Unfortunately, this is not manifest from our formulas (i.e. from Theorem 2.17). To explain this pattern, we will prove the stabilization of the associated cohomologies. **Theorem 3.1**.: _Fix \(\mathbb{Q}_{\rho}\in\{\mathbb{Q},\widetilde{\mathbb{Q}}\}\). The cohomology \(H^{\bullet}(\mathcal{MG}_{g,n};\mathbb{Q}_{\rho})^{\mathbb{S}_{n}}\) stabilizes for \(n\to\infty\): If \(n\geq g\geq 2\), then there are isomorphisms \(H^{k}(\mathcal{MG}_{g,n};\mathbb{Q}_{\rho})^{\mathbb{S}_{n}}\to H^{k}( \mathcal{MG}_{g,n+1};\mathbb{Q}_{\rho})^{\mathbb{S}_{n}}\) for all \(k\)._ This statement is a refinement of the known _representational stability_[10] of \(\mathcal{MG}_{g,n}\), which was shown to hold in [11]. In contrast to those previous results, Theorem 3.1 holds independently of the cohomological degree \(k\). We will prove this theorem below in Section 3.2 using an argument that is based on the Lyndon-Hochschild-Serre spectral sequence and closely related to lines of thought in [11] and [22]. Unfortunately, our proof of Theorem 3.1 gives neither a concrete description of the stable cohomologies \(H^{\bullet}(\mathcal{MG}_{g,\infty};\mathbb{Q})^{\mathbb{S}_{\infty}}\) and \(H^{\bullet}(\mathcal{MG}_{g,\infty};\widetilde{\mathbb{Q}})^{\mathbb{S}_{ \infty}}\) nor gives explicit stabilization maps. A candidate for such a map is a generalization of the injection \(H^{\bullet}(\mathrm{Out}(F_{g});\mathbb{Q})\to H^{\bullet}(\mathrm{Aut}(F_{g });\mathbb{Q})\) from Theorem 1.4 of [11] to arbitrarily many legs. The first few terms of the Euler characteristics associated to these stable cohomologies are tabulated in Table 1. The values are remarkably small in comparison to the value of the Euler characteristic of \(\mathrm{Out}(F_{g})\) for the respective rank (see the top and bottom row of Table 4 for a direct comparison). Empirically, the Euler characteristics of the stable cohomologies appear to grow exponentially and not super-exponentially. Our argument for Theorem 3.1 does not give any hint why these Euler characteristics are so small. It would also be interesting to prove Theorem 3.1 using graph cohomology methods as this kind of stabilization appears to be a distinguished feature of Lie- and forest graph cohomology. For instance, commutative graph cohomology with legs does not stabilize in the strong sense observed here [24]. ### Analogy to Artin's braid group The observed large-\(n\) stabilization carries similarities with the cohomology of Artin's _braid group_\(B_{n}\) of equivalence classes of \(n\)-braids. For a graph \(G\) of rank \(g\) with \(n\) legs, let \(\mathrm{UI}_{g,n}\) be the group of homotopy classes of self-homotopy equivalences of \(G\) that only fix the legs as a set and not point-wise, i.e. \(\mathrm{UI}_{g,n}=\pi_{0}(\mathrm{HE}(G,\partial G)).\) By looking only at the action of \(\mathrm{UI}_{g,n}\) on the leg-labels \(\{1,\dots,n\}\), we get a surjective map to the symmetric group \(\mathbb{S}_{n}\), i.e. \[1\to\Gamma_{g,n}\to\mathrm{UI}_{g,n}\to\mathbb{S}_{n}\to 1,\] where the 'pure' group, \(\Gamma_{g,n}\), is the subgroup of \(\mathrm{U}\Gamma_{g,n}\) that fixes the legs point-wise as defined in the previous section. Analogously, the braid group \(B_{n}\) maps surjectively to \(\mathbb{S}_{n}\). So, \[1\to P_{n}\to B_{n}\to\mathbb{S}_{n}\to 1,\] where the kernel \(P_{n}\) is the _pure braid group_. Whereas the braid groups \(B_{n}\) exhibit _homological stability_, i.e. if \(n\geq 3\), then \(H_{k}(B_{n};\mathbb{Q})\simeq H_{k}(B_{n+1};\mathbb{Q})\) for all \(k\)[2], the pure braid groups \(P_{n}\) only satisfy representational stability [10]. For instance, \(H^{\bullet}(P_{n};\mathbb{Q})\) is an exterior algebra on \(\binom{n}{2}\) generators modulo a \(3\)-term relation [2] and \(H^{\bullet}(\Gamma_{1,n};\mathbb{Q})\) is the even degree part of an exterior algebra on \(n-1\) generators [11]. The numbers of generators of both algebras increase with \(n\). The cohomology of \(\mathrm{U}\Gamma_{g,n}\) is equal to the \(\mathbb{S}_{n}\)-invariant cohomology of \(\mathcal{MG}_{g,n}\). So, analogously to the stabilization of \(H^{\bullet}(B_{n})\), Theorem 3.1 implies the large-\(n\) cohomological stability of \(\mathrm{U}\Gamma_{g,n}\). ### The Lyndon-Hochschild-Serre spectral sequence Our proof of Theorem 3.1 makes heavy use of tools from [11]. Following [11], we abbreviate \(\mathrm{H}=H^{1}(F_{g})\) and think of it as an \(\mathrm{Out}(F_{g})\)-module. The action of \(\mathrm{Out}(F_{g})\) on \(\mathrm{H}\) factors through the action of \(\mathrm{GL}_{g}(\mathbb{Z})\) on \(\mathrm{H}\). The \(q\)_-th exterior power_ of \(\mathrm{H}\) is denoted as \(\bigwedge^{q}\mathrm{H}\). As \(\dim H=g\), the determinant representation is recovered by \(\bigwedge^{g}\mathrm{H}=\widetilde{\mathbb{Q}}\). As before, we only work with modules over rational coefficients. **Proposition 3.2**.: _Fix \(g,n\) with \(g\geq 2\), \(n\geq 0\). There are two Lyndon-Hochschild-Serre spectral sequences with \(E^{2}\) pages given by_ \[E^{2}_{p,q} =H^{p}\left(\mathrm{Out}(F_{g});\bigwedge^{q}\mathrm{H}\right)\] \[\widetilde{E}^{2}_{p,q} =H^{p}\left(\mathrm{Out}(F_{g});\widetilde{\mathbb{Q}}\otimes \bigwedge^{q}\mathrm{H}\right)\] _for \(p,q\geq 0\) with \(p\leq 2g-3\) and \(q\leq\min(g,n)\), and \(E^{2}_{p,q}=\widetilde{E}^{2}_{p,q}=0\) for all other values of \(p,q\). Both spectral sequences converge: \(E^{2}_{p,q}\Rightarrow H^{p+q}(\Gamma_{g,n};\mathbb{Q})^{\mathbb{S}_{n}}\) and \(\widetilde{E}^{2}_{p,q}\Rightarrow H^{p+q}(\Gamma_{g,n};\widetilde{\mathbb{Q }})^{\mathbb{S}_{n}}\)._ The argument works along the lines of Section 3.2 of [11] followed by an application of Schur-Weyl duality and the projection to the \(\mathbb{S}_{n}\)-invariant cohomology. A similar argument can be found in [22, Lemma 4.1] where it is used to prove representational stability of \(H^{\bullet}(\Gamma_{g,n};\mathbb{Q})\). Proof.: For \(g\geq 2\) and \(n\geq 0\), the Lyndon-Hochschild-Serre spectral sequence associated to the group extension \(1\to F^{n}_{g}\to\Gamma_{g,n}\to\mathrm{Out}(F_{g})\to 1\) is a first-quadrant spectral sequence with the second page given by \(E^{2}_{p,q}=H^{p}(\mathrm{Out}(F_{g});H^{q}(F^{n}_{g};\mathbb{Q}))\Rightarrow H ^{p+q}(\Gamma_{g,n};\mathbb{Q})\) (see [11, Section 3.2]). By the Kunneth formula, the \(\mathbb{S}_{n}\)-module \(H^{q}(F^{n}_{g};\mathbb{Q})\) vanishes if \(q>n\) and for \(0\leq q\leq n\) it is obtained by inducing the \(\mathbb{S}_{q}\times\mathbb{S}_{n-q}\)-module \(\mathrm{H}^{\wedge q}\otimes V_{(n-q)}\) to \(\mathbb{S}_{n}\), (see [11, Lemma 3.4] for details), \[H^{q}(F^{n}_{g};\mathbb{Q})=\mathrm{Ind}^{\mathbb{S}_{n}}_{\mathbb{S}_{q} \times\mathbb{S}_{n-q}}\left(H^{\wedge q}\otimes V_{(n-q)}\right),\] where \(V_{(n-q)}\) is the trivial representation of \(\mathbb{S}_{n-q}\) and \(\mathrm{H}^{\wedge q}\) is \(\mathrm{H}^{\otimes q}\otimes V_{(1^{q})}\) with \(V_{(1^{q})}\) the alternating representation of \(\mathbb{S}_{q}\) and \(\mathbb{S}_{q}\) acts on \(H^{\otimes q}\) by permuting the entries of the tensor product. We can set up a similar spectral sequence with coefficients twisted by \(\widetilde{\mathbb{Q}}\) with second page \(\widetilde{E}^{2}_{p,q}=H^{p}(\mathrm{Out}(F_{g});H^{q}(F^{n}_{g};\widetilde{ \mathbb{Q}}))\Rightarrow H^{p+q}(\Gamma_{g,n};\widetilde{\mathbb{Q}})\). Note that \(F^{n}_{g}\) acts trivially on \(\widetilde{\mathbb{Q}}\). So, applying the Kunneth formula to expand \(H^{q}(F^{n}_{g};\widetilde{\mathbb{Q}})\) as an \(\mathbb{S}_{n}\)-module gives \[H^{q}(F^{n}_{g};\widetilde{\mathbb{Q}})=\widetilde{\mathbb{Q}}\otimes\mathrm{ Ind}^{\mathbb{S}_{n}}_{\mathbb{S}_{q}\times\mathbb{S}_{n-q}}\left(H^{\wedge q} \otimes V_{(n-q)}\right),\] which only differs by the \(GL_{g}(\mathbb{Z})\)-action on \(\widetilde{\mathbb{Q}}\). Schur-Weyl duality gives the irreducible decomposition of \(\mathrm{H}^{\wedge q}\) as a module over \(\mathrm{GL}(\mathrm{H})\times\mathbb{S}_{q}\) (see, e.g., [11, Section 3.1]): \[\mathrm{H}^{\wedge q}=\bigoplus_{\lambda\vdash q}W_{\lambda}\otimes V_{\lambda^{ \prime}},\] where we sum over all partitions \(\lambda\) of \(q\) with at most \(g\) rows and \(\lambda^{\prime}\) is the transposed partition. Here, \(W_{\lambda}\) and \(V_{\lambda}\) are the irreducible \(\operatorname{GL}(\operatorname{H})\)- and \(\mathbb{S}_{q}\)-representations associated to \(\lambda\). As \(\mathbb{S}_{n}\) only acts on the coefficients in \(E^{2}_{p,q}\), we get \[E^{2}_{p,q} =H^{p}\left(\operatorname{Out}(F_{g});\operatorname{Ind}_{ \mathbb{S}_{q}\,\times\,\mathbb{S}_{n-q}}^{\mathbb{S}_{n}}\left(H^{\wedge q} \otimes V_{(n-q)}\right)\right)\] \[=\bigoplus_{\lambda\vdash q}H^{p}\left(\operatorname{Out}(F_{g}); W_{\lambda}\right)\otimes\operatorname{Ind}_{\mathbb{S}_{q}\,\times\,\mathbb{S}_{n-q}} ^{\mathbb{S}_{n}}\left(V_{\lambda^{\prime}}\otimes V_{(n-q)}\right).\] If we project to the trivial \(\mathbb{S}_{n}\) representation, only the partition \(\lambda=(1^{q})\) contributes. Hence, \[(E^{2}_{p,q})^{\mathbb{S}_{n}}=H^{p}\left(\operatorname{Out}(F_{g});W_{(1^{q} )}\right).\] The representation \(W_{(1^{q})}\) is the \(q\)-th exterior power of the defining representation \(\operatorname{H}\). It vanishes if \(q>\dim H=g\). The argument works analogously for \(\widetilde{E}^{2}_{p,q}\). Proof of Theorem 3.1.: For \(n\geq g\geq 2\), the \(E^{2}\) pages of the spectral sequences in Proposition 3.2 are independent of \(n\). Hence, by the spectral sequence comparison theorem, also \(H^{k}(\Gamma_{g,n},\mathbb{Q})\) and \(H^{k}(\Gamma_{g,n},\widetilde{\mathbb{Q}})\) must be independent of \(n\). In the stable regime, the Euler characteristics \(e(\mathcal{MG}^{\mathbb{S}_{n}}_{g,n})\) and \(e^{\operatorname{odd}}(\mathcal{MG}^{\mathbb{S}_{n}}_{g,n})\) are equal up to a sign factor (see Table 1). This can be explained as another consequence of Proposition 3.2: **Corollary 3.3**.: _If \(n\geq g\geq 2\), then \(e(\mathcal{MG}^{\mathbb{S}_{n}}_{g,n})=(-1)^{g}e^{\operatorname{odd}}( \mathcal{MG}^{\mathbb{S}_{n}}_{g,n})\)._ Proof.: There is an isomorphism of \(\operatorname{GL}_{g}(\mathbb{Z})\) representations: where \({}^{*}\) takes the dual representation. This can be seen by computing the character Laurent polynomials of both \(\bigwedge^{g}\operatorname{H}\otimes\bigwedge^{q}\operatorname{H}\) and \(\bigwedge^{g-q}\operatorname{H}^{*}\) and by observing that they differ by a multiple of the character of \((\bigwedge^{g})^{\otimes 2}\), which is the same as the trivial representation of \(\operatorname{GL}_{g}(\mathbb{Z})\), because \(\det(h)^{2}=1\) for each \(h\in\operatorname{GL}_{g}(\mathbb{Z})\) (see, e.g., [23, Ch. 7.A.2]). Hence, for \(n\geq g\geq 2\), we have for the \(E^{2}\) pages of the spectral sequences in Proposition 3.2: \[\widetilde{E}^{2}_{p,q}=H^{p}\left(\operatorname{Out}(F_{g});\widetilde{ \mathbb{Q}}\otimes\bigwedge^{q}\operatorname{H}\right)\simeq H^{p}\left( \operatorname{Out}(F_{g});\bigwedge^{g-q}\operatorname{H}^{*}\right)\simeq E^{2 }_{p,g-q}.\] As we can compute the respective Euler characteristic on the \(E^{2}\) page, we have \[e(\mathcal{MG}^{\mathbb{S}_{n}}_{g,n})=\sum_{p,q}(-1)^{p+q}\dim E^{2}_{p,q}= \sum_{p,q}(-1)^{p+g-q}\dim E^{2}_{p,g-q}=(-1)^{g}e^{\operatorname{odd}}( \mathcal{MG}^{\mathbb{S}_{n}}_{g,n}).\qed\] The isomorphism that was used between the \(E^{2}\) pages of both spectral sequences is not filtration preserving. So, apart from the (up-to-sign) equality of the Euler characteristics, we cannot say if and how even and odd \(\mathbb{S}_{n}\)-invariant stable \(n\to\infty\) cohomology of \(\mathcal{MG}_{g,n}\) are related. Moreover, the \(E^{2}\) page of the spectral sequences in Proposition 3.2 contains the whole (twisted) cohomology of \(\operatorname{Out}(F_{g})\) (e.g. \(E^{2}_{p,0}=H^{p}(\operatorname{Out}(F_{g});\mathbb{Q})\)). So, we also cannot explain why the Euler characteristics of the large-\(n\) stable \(\mathbb{S}_{n}\)-invariant cohomologies of \(\mathcal{MG}_{g,n}\) are so small.

2301.06225

Non-phononic density of states of two-dimensional glasses revealed by random pinning

The vibrational density of states of glasses is considerably different from that of crystals. In particular, there exist spatially localized vibrational modes in glasses. The density of states of these non-phononic modes has been observed to follow $g(\omega) \propto \omega^4$, where $\omega$ is the frequency. However, in two-dimensional systems, the abundance of phonons makes it difficult to accurately determine this non-phononic density of states because they are strongly coupled to non-phononic modes and yield strong system-size and preparation-protocol dependencies. In this article, we utilize the random pinning method to suppress phonons and disentangle their coupling with non-phononic modes and successfully calculate their density of states as $g(\omega) \propto \omega^4$. We also study their localization properties and confirm that low-frequency non-phononic modes in pinned systems are truly localized without far-field contributions. We finally discuss the excess density of states over the Debye value that results from the hybridization of phonons and non-phononic modes.

Kumpei Shiraishi, Hideyuki Mizuno, Atsushi Ikeda

2023-01-16T00:51:40Z

http://arxiv.org/abs/2301.06225v1

# Non-phononic density of states of two-dimensional glasses revealed by random pinning ###### Abstract The vibrational density of states of glasses is considerably different from that of crystals. In particular, there exist spatially localized vibrational modes in glasses. The density of states of these non-phononic modes has been observed to follow \(g(\omega)\propto\omega^{4}\), where \(\omega\) is the frequency. However, in two-dimensional systems, the abundance of phonons makes it difficult to accurately determine this non-phononic density of states because they are strongly coupled to non-phononic modes and yield strong system-size and preparation-protocol dependencies. In this article, we utilize the random pinning method to suppress phonons and disentangle their coupling with non-phononic modes and successfully calculate their density of states as \(g(\omega)\propto\omega^{4}\). We also study their localization properties and confirm that low-frequency non-phononic modes in pinned systems are truly localized without far-field contributions. We finally discuss the excess density of states over the Debye value that results from the hybridization of phonons and non-phononic modes. ## I Introduction Low-frequency vibrational states of glasses have been attracting considerable attention in recent years. Unlike crystals [1], their low-frequency vibrational modes are not described by phonons alone; there exist spatially localized vibrations. The vibrational density of states of these non-phononic localized modes follows \(g(\omega)\propto\omega^{4}\)[2; 3]. The localized modes are widely observed in various systems regardless of interaction potentials [4], details of constituents [5], asphericity of particles [6], and stability of configurations [7]. Theoretical backgrounds of the non-phononic vibrational density of states have been studied. Mean-field theories predict that glasses exhibit the non-Debye scaling law of \(g(\omega)\propto\omega^{2}\) at low frequencies by both the replica theory [8] and the effective medium theory [9], and numerical simulations of high-dimensional packings confirm this behavior [10; 11]. Recently, replica theories of interacting anharmonic oscillators [12; 13] and the effective medium theory [14; 15; 16] have also successfully derived the \(\omega^{4}\) scaling of glasses. Of these mean-field theories, the effective medium theory [9; 14; 15; 16] naturally deals with phonon modes together with non-phononic modes, whereas the other theories focus on non-phononic modes without particular attention on phonon modes. Meanwhile, phonons do exist even in the amorphous solids, which strongly hybridize with the non-phononic localized modes. In this case, the scaling of \(g(\omega)\) is described by the framework of the generalized Debye model [17; 18; 19; 20] that predicts that the exponent should be consistent with that of the Rayleigh scattering \(\Gamma\propto\Omega^{d+1}\) of acoustic attenuation (\(\Gamma\) is attenuation rate, \(\Omega\) is propagation frequency, and \(d\) is the spatial dimension). Therefore, \(g(\omega)\) is predicted to scale with \(\omega^{d+1}\). Numerical simulations of three-dimensional glasses (\(d=3\)) show that the phonon attenuation rate follows \(\Gamma\propto\Omega^{4}\)[19; 21; 22; 23; 24]. This behavior of Rayleigh scattering has also been observed in recent experimental studies [25; 26; 27; 28]. Simulation study also reveals that the vibrational density of states follows \(g(\omega)\propto\omega^{4}\)[3]. Thus, in three-dimensional systems, acoustic attenuation and the vibrational density of states both exhibit the exponent of \(d+1=4\), consistent with the generalized Debye theory. However, in two-dimensional glasses, conflicting results have been reported. In acoustic attenuation simulations in two-dimensional glasses (\(d=2\)), the Rayleigh scattering of \(\Gamma\propto\Omega^{3}\) is indeed observed [23; 29; 30; 31]. In simulations of direct measurements of \(g(\omega)\) in two dimensions, Mizuno _et al._ performed the vibrational analysis of glass configurations of large system sizes and revealed that localized vibrations were too few to determine the non-phononic scaling of \(g(\omega)\)[3]. Afterward, Kaptejins _et al._ reported that the \(\omega^{4}\) scaling holds even for two-dimensional glasses by performing simulations of systems with small system sizes for a large ensemble of configurations to extract the sufficient number of modes below the first phonon frequency [32]. However, a recent study by Wang _et al._ reported a contradictory result of \(g(\omega)\propto\omega^{3.5}\) from simulations of small systems [33]. More recently, Lerner and Bouchbinder suggested that the exponent depends on the glass formation protocol and system size and claimed the exponent to be 4 in the thermodynamic limit even in two dimensions [34]. In contrast, a recent work by Wang _et al._ claimed that there are no system-size effects and the exponent remains as 3.5 [35]. The above conflicting results could be due to the emergence of phonons and their coupling with the localized modes, making it difficult to accurately determine the non-phononic vibrational density of states. Here, we utilize the random pinning method to resolve this problem. Originally, this method is used to realize equilibrium glass states [36; 37; 38]. Angelani _et al._ showed that this method can be used to suppress phononic modes and probe the non-phononic density of states [39]. Recently, we revealed that low-frequency localized modes of pinned glasses are disentangled with phonons by numerical simulations of three-dimensional glasses [40]. By performing vibrational analysis in two-dimensional pinned glasses, we can expect to put an end to the controversial results of the non-phononic density of states. In this paper, we report the properties of low-frequency localized modes in two-dimensional glasses induced by randomly pinned particles. First, we study the participation ratio of each mode and show the low-frequency modes of pinned glasses indeed have a localized character. Second, we also study their localization properties by calculating the decay profile. Those modes show exponentially decaying profiles, that is, they are truly localized. Finally, we evaluate the vibrational density of states of localized modes and observe the scaling of \(g(\omega)\propto\omega^{4}\) in two-dimensional glasses with pinned particles. Our results elucidate the bare nature of low-frequency localized modes of glasses by obliterating harmful phononic modes using the random pinning operation. ## II Methods We perform vibrational mode analyses on the randomly pinned Kob-Andersen system in two-dimensional space [41], which is identical to a model studied by Wang _et al._[33]. We consider a system of \(N\) particles with identical masses of \(m\) enclosed in a square box with periodic boundary conditions. The linear size \(L\) of the box is determined by the number density of \(\rho=1.204\). Particles A and B are mixed in a ratio of 65:35 to avoid crystallization [41]. The particles interact via the Lennard-Jones potential \[V(r_{ij})=\phi(r_{ij})-\phi(r_{ij}^{\mathrm{cut}})-\phi^{\prime}(r_{ij}^{ \mathrm{cut}})(r_{ij}-r_{ij}^{\mathrm{cut}}), \tag{1}\] with \[\phi(r_{ij})=4\epsilon_{ij}\Big{[}(\sigma_{ij}/r_{ij})^{12}-(\sigma_{ij}/r_{ ij})^{6}\Big{]}, \tag{2}\] where \(r_{ij}\) denotes the distance between interacting particles, and the cut-off distance is set to \(r_{ij}^{\mathrm{cut}}=2.5\sigma_{ij}\). The interaction parameters are chosen as follows: \(\sigma_{\mathrm{AA}}=1.0,\ \sigma_{\mathrm{AB}}=0.8,\ \sigma_{\mathrm{BB}}=0.88,\ \epsilon_{ \mathrm{AA}}=1.0,\ \epsilon_{\mathrm{AB}}=1.5,\ \epsilon_{\mathrm{BB}}=0.5\). Lengths, energies, and time are measured in units of \(\sigma_{\mathrm{AA}}\), \(\epsilon_{\mathrm{AA}}\), and \(\left(m\sigma_{\mathrm{AA}}^{2}/\epsilon_{\mathrm{AA}}\right)^{1/2}\), respectively. The Boltzmann constant \(k_{\mathrm{B}}\) is set to unity when measuring the temperature \(T\). To prepare the randomly pinned system, we first run molecular dynamics simulations in the \(NVT\) ensemble to equilibrate the system in the normal liquid state at \(T=5.0\) for the time of \(t=2.0\times 10^{2}\), which is sufficiently longer than the structural relaxation time. After the equilibration, we randomly choose particles and freeze their positions. The FIRE algorithm [42] is applied to the system to minimize energy (stop condition is \(\max_{i}F_{i}<3.0\times 10^{-10}\)), which produces the glass-solid state at zero temperature, \(T=0\). We denote the fraction of pinned particles as \(c\) (\(0\leq c\leq 1\)) and the number of unpinned (vibrating) particles as \(N_{\mathrm{up}}=(1-c)N\). Then, we perform the vibrational mode analysis on the randomly pinned system and obtain the eigenvalues \(\lambda_{k}\) and eigenvectors \(\mathbf{e}_{k}=\left(\mathbf{e}_{k}^{1},\mathbf{e}_{k}^{2},\ldots,\mathbf{e}_{k}^{N_{\mathrm{up }}}\right)\), where \(k=1,2,\ldots,2N_{\mathrm{up}}\)[43]. Note that two zero-frequency modes corresponding to global translations do not appear in pinned systems because the existence of pinned particles breaks translational invariance [39; 40]. For details of the random pinning procedure and vibrational mode analysis, please refer to Ref. [40]. ## III Results ### Participation ratio First, we study the participation ratio \[p_{k}=\frac{1}{N_{\mathrm{up}}\sum_{i=1}^{N_{\mathrm{up}}}\left|\mathbf{e}_{k}^{ i}\right|^{4}}, \tag{3}\] Figure 1: Participation ratio \(p_{k}\) versus mode frequencies \(\omega_{k}\). The figures show the data of the lowest-frequency region. The fractions \(c\) of pinned particles are (a) \(0.03\) and (b) \(0.20\). which quantifies the fraction of particles that participate in the mode \(k\)[44; 45]. Figure 1 shows \(p_{k}\) versus eigenfrequencies \(\omega_{k}=\sqrt{\lambda_{k}}\) for \(c=0.03\) and \(c=0.20\). The number of particles in the systems ranges from \(N=\) 16,000 to \(N=\) 2,000,000. As we can easily recognize from Fig. 1, pinned systems have numerous localized modes with low \(p_{k}\) in the low-frequency region. This result is strikingly different from the unpinned system, where most low-frequency modes are spatially extended phonons and localized modes are hard to observe in two dimensions [3]. When pinned particles are introduced, these phonon modes are suppressed because translational invariance is violated, and low-frequency localized modes emerge, like in three-dimensional glasses [39; 40]. Comparing the cases of \(c=0.03\) and 0.20 shows that \(p_{k}\) is lower in \(c=0.20\). In particular, when \(c=0.20\), there are modes whose participation ratio is near \(p_{k}=1/N_{\rm up}\), indicating that only one particle out of \(N_{\rm up}\) particles vibrates in the mode \(k\). As mentioned in the Introduction, the difficulty of studying low-frequency localized modes in two-dimensional glasses originates from the abundance of low-frequency phonons [34]. As demonstrated in Fig. 1, phonon modes are well-suppressed in two-dimensional pinned glasses, and only low-frequency localized modes remain. Our data of \(p_{k}\) clearly shows that random pinning excludes phonons and resolves this difficulty for analysis on non-phononic modes in two-dimensional glasses. ### Decay profile Next, we scrutinize the spatial structure of a low-frequency mode by calculating the decay profile \(d(r)\) as in Ref. [2], which is defined as \[d(r)=\frac{\left|\mathbf{e}_{k}^{i}\right|}{\max_{i}\left|\mathbf{e}_{k}^{i}\right|}. \tag{4}\] When calculating \(d(r)\), we take the median of each contribution \(\left|\mathbf{e}_{k}^{i}\right|\) from particles inside a shell with radius \(r\) from the most vibrating particle \(i_{\rm max}=\operatorname*{argmax}_{i}\left|\mathbf{e}_{k}^{i}\right|\). Figure 2 presents the decay profile \(d(r)\) of a low-frequency mode of a configuration with \(N=\) 2,000,000 and \(c=\) 0.20 (\(N_{\rm up}=\) 1,600,000). As in Fig. 2, the decay profile of pinned glasses deviates from the power-law behavior of \(d(r)\propto r^{-1}\)[32]. Instead, \(d(r)\) shows an exponential decay, consistent with the behavior in three-dimensional pinned glasses [40]. This result indicates that the spatial structures of low-frequency localized modes are significantly different from those of unpinned glasses [2; 32; 46]. The power-law decay of \(d(r)\propto r^{-1}\), which is missing in Fig. 2, is a consequence of the absence of hybridization with phonons [2]. Therefore, we conclude that the random pinning method prevents non-phononic localized modes from hybridizing with phonon modes, as in the three-dimensional system [40]. ### Vibrational density of states Finally, we study the vibrational density of states in the low-frequency regime of randomly pinned two-dimensional glasses. The vibrational density of states is calculated as \[g(\omega)=\frac{1}{N_{\rm mode}}\sum_{k}\delta(\omega-\omega_{k}), \tag{5}\] where \(N_{\rm mode}=2N_{\rm up}\) is the number of all eigenmodes and \(\delta(x)\) is the Dirac delta function. However, the value of \(g(\omega)\) is sensitive to the binning setups used for the Figure 2: Decay profile \(d(r)\) of a low-frequency mode of the system with \(N=\) 2,000,000 and \(c=\) 0.20. The mode has the eigenfrequency of \(\omega_{k}=0.5968\) and participation ratio of \(p_{k}=1.9\times 10^{-6}\). The dashed line indicates the power-law behavior of \(d(r)\propto r^{-1}\). Figure 3: Cumulative density of states \(C(\omega)\) of systems with \(c=0.03\) and \(c=0.20\). The dashed lines indicate \(C(\omega)\propto\omega^{5}\). calculation. To determine the density of states without the arbitrariness of binning, we present the cumulative density of states: \[C(\omega)=\int_{0}^{\omega}g(\omega^{\prime})\,d\omega^{\prime}\,. \tag{6}\] Figure 3 presents \(C(\omega)\) for \(c=0.03\) and \(c=0.20\). When generating Fig. 3, we averaged \(C(\omega)\) of different system sizes presented in Fig. 1. The results from these different system sizes provide information for the very low-frequency regime [3]. We recall that each of these systems has the fraction \(c\) of pinned particles; therefore, the number of vibrating particles \(N_{\rm up}\) is smaller than \(N\). As shown in Fig. 3, \(C(\omega)\) obeys \(\omega^{5}\) scaling, that is, the vibrational density of states obeys \(g(\omega)\propto\omega^{4}\) in the low-frequency regime, which is the main result of this work. This behavior is consistent with various reports in three-dimensional glasses [2; 3; 39; 40]. Our result is also consistent with a report by Kapteijns _et al._[32] who studied two-dimensional unpinned glasses of small systems. Here, we emphasize that the random pinning method suppresses phononic modes and enables us to directly probe the non-phononic density of states without generating a large ensemble of small systems. Furthermore, because the low-frequency modes of pinned glasses do not hybridize with phonons, the investigation of \(g(\omega)\) with random pinning is free of finite-size effects [34; 47] or glass-formation-protocol dependence [34] appearing in \(g(\omega)\). ## IV Discussions In summary, we report the properties of low-frequency vibrations of two-dimensional glasses with randomly pinned particles. While there exist a large number of phonon modes in two-dimensional glasses, which cause hybridization with non-phononic modes, the random pinning operation can well suppress phonon modes to disentangle their hybridization. We confirm the disentanglement numerically by observing the participation ratio and decay profile and conclude that non-phononic modes are truly localized modes that are not coupled to phonon modes. Therefore, we can easily intrude on the non-phononic density of states of localized modes at low frequencies. Then, our main result is that the cumulative vibrational density of states of non-phononic modes obeys \(C(\omega)\propto\omega^{5}\), that is, the vibrational density of states follows \(g(\omega)\propto\omega^{4}\) in two-dimensional glasses. This result provides a sound basis for the controversial vibrational density of states of two-dimensional glasses and could resolve the conflicting reports of the exponent [32; 33; 34; 35]. Our work also demonstrates the benefit of the random pinning method, not only for the glass transition studies but also for the material properties of amorphous solids. Our present analysis of randomly pinned two-dimensional glasses reveals the vibrational density of states of non-phononic modes that are completely free from hybridization with phonons. On the other hand, in the following, we discuss the "excess" density of states over the Debye value in a situation where abundant phonon modes exist and hybridize with non-phononic modes. Here, we use the phrase "excess density of states" because we generally cannot distinguish non-phonon modes from phonon modes when they are strongly hybridized. In this situation, we can apply the generalized Debye theory [17; 18; 19; 20; 23] to measure the "excess" density of states, where the exponent \(\beta\) of \(g(\omega)\propto\omega^{\beta}\) is provided by the exponent \(\gamma\) of the acoustic attenuation \(\Gamma\propto\Omega^{\gamma}\). We refer to previous studies and summarize the values of \(\beta\) in Table 1 for the spatial dimensions of \(d=2\), \(d=3\), and \(d\geq 4\). In the table, we also present the corresponding values of \(\beta\) of the non-phononic density of states without phonon modes for comparison. For the case without phonons, where truly-localized modes are realized, the non-phononic density of states follows \(g(\omega)\propto\omega^{4}\) for \(d=2\) and \(d=3\), as confirmed in the present (\(d=2\)) and previous study [40] (\(d=3\)) using the random pinning method. The previous numerical work [32] also provided the value of \(\beta=4\) for \(d=2\) to \(d=4\). In addition, the mean-field theories predicted \(g(\omega)\propto\omega^{4}\)[12; 13], which validates the value of \(\beta=4\) for \(d\geq 4\). In contrast, for the case with phonons where non-phononic modes hybridize with phonons to become quasi-localized, the Rayleigh scattering behavior of \(\Gamma\propto\Omega^{\gamma}=\Omega^{d+1}\) is observed in \(d=2\) and \(d=3\), leading to the value of \(\beta=d+1\)[23]. For the larger dimensions of \(d\geq 4\), there are no numerical results so far; however, we speculate the following. The non-phononic density of states without phonons, \(g(\omega)\propto\omega^{4}\), shows larger orders of values than \(g(\omega)\propto\omega^{d+1}\) (in the low-frequency regime) since \(4<d+1\). Considering this, we might expect that the hybridization maintains the value of exponent \(\beta=4\) for the excess density of states. Note that the results shown in Ref. [11] are consistent with this expectation though their system sizes are not large enough to conclude this point. Future studies should focus on measuring the acoustic attenuation \(\Gamma\) for \(d\geq 4\) and determining the scaling of \(\Gamma\propto\Omega^{\gamma}\). In addition, these studies should also measure \(g(\omega)\propto\omega^{\beta}\) directly in the presence of numerous phonon modes. \begin{table} \begin{tabular}{c c c} \hline Dimension & With phonons & Without phonons \\ \hline \(d=2\) & \(\beta=3\)[23] & \(\beta=4\) (this paper) \\ \(d=3\) & \(\beta=4\)[23] & \(\beta=4\)[40] \\ \(d\geq 4\) & \(\beta=4\) (expected) & \(\beta=4\)[32] \\ \hline \end{tabular} \end{table} Table 1: Dimensional dependence of the exponent of the excess density of states \(g(\omega)\propto\omega^{\beta}\) (with phonons) with corresponding values of the non-phononic density of states (without phonons). Note that \(\beta\) has not yet been measured for the excess density of states (with phonons) and \(d\geq 4\); however, we might expect \(\beta=4\) (see the main text). Again, we emphasize that hybridization effects strongly emerge in the \(d=2\) case: \(g(\omega)\propto\omega^{4}\) (non-phononic density of states) without hybridization, whereas \(g(\omega)\propto\omega^{d+1}=\omega^{3}\) (excess density of states) with hybridization. Even when \(d=2\), if we resort to generating a large ensemble of small systems, the exponent of \(g(\omega)\) could be measured [32; 33; 34; 35]. However, the shortcoming of this method is that the intensity of the hybridization of modes, which appears as the distance from the first phonon level, cannot be controlled. The hybridization with phonons causes harmful effects, such as finite-size effects [34; 47] or dependence on preparation protocols [34]. These effects could change the value of the exponent \(\beta\) of \(g(\omega)\). Therefore, we would conclude that the exponent observed using systems with a small number of particles can fluctuate between 3 to 4, which can be the reason for the controversial results in the \(d=2\) case [32; 33; 34; 35]. ###### Acknowledgements. This work is supported by JSPS KAKENHI (Grant Numbers 18H05225, 19H01812, 20H00128, 20H01868, 21J10021, 22K03543) and Initiative on Promotion of Supercomputing for Young or Women Researchers, Information Technology Center, the University of Tokyo.

2303.07742

ForDigitStress: A multi-modal stress dataset employing a digital job interview scenario

We present a multi-modal stress dataset that uses digital job interviews to induce stress. The dataset provides multi-modal data of 40 participants including audio, video (motion capturing, facial recognition, eye tracking) as well as physiological information (photoplethysmography, electrodermal activity). In addition to that, the dataset contains time-continuous annotations for stress and occurred emotions (e.g. shame, anger, anxiety, surprise). In order to establish a baseline, five different machine learning classifiers (Support Vector Machine, K-Nearest Neighbors, Random Forest, Long-Short-Term Memory Network) have been trained and evaluated on the proposed dataset for a binary stress classification task. The best-performing classifier achieved an accuracy of 88.3% and an F1-score of 87.5%.

Alexander Heimerl, Pooja Prajod, Silvan Mertes, Tobias Baur, Matthias Kraus, Ailin Liu, Helen Risack, Nicolas Rohleder, Elisabeth André, Linda Becker

2023-03-14T09:40:37Z

http://arxiv.org/abs/2303.07742v1

# ForDigitStress: A multi-modal stress dataset employing a digital job interview scenario ###### Abstract We present a multi-modal stress dataset that uses digital job interviews to induce stress. The dataset provides multi-modal data of 40 participants including audio, video (motion capturing, facial recognition, eye tracking) as well as physiological information (photoplethysmography, electrodermal activity). In addition to that, the dataset contains time-continuous annotations for stress and occurred emotions (e.g. shanne, anger, anxiety, surprise). In order to establish a baseline, five different machine learning classifiers (Support Vector Machine, K-Nearest Neighbors, Random Forest, Long-Short-Term Memory Network) have been trained and evaluated on the proposed dataset for a binary stress classification task. The best-performing classifier achieved an accuracy of 88.3% and an F1-score of 87.5%. Stress, stress dataset, multimodal dataset, digital stress, stress physiology, job interviews, affective computing ## I Introduction Stress is the body's response to any demand or threat [1]. It is a normal physiological reaction to perceived danger or challenge, and it can be beneficial in small doses, e.g it can support improving your performance or memory functions [2][3]. However, chronic stress can have a negative impact on both physical and mental health. Chronic stress can lead to a variety of mental health problems, including anxiety and depression. It can also make existing mental health conditions worse. Stress can lead to changes in brain chemistry and function, which can disrupt normal communication between brain cells. This can lead to symptoms such as difficulty concentrating, memory problems, and irritability. Stress can also lead to physical symptoms such as headaches, muscle tension, and fatigue [4]. Stress can also impact physical health by weakening the immune system, increasing the risk of heart disease, and promoting unhealthy behaviors such as overeating, smoking, and drinking alcohol [4]. Among the many sources of stress, work-related stress is one of the most widespread and often seems inevitable. Therefore, there is a need to understand stressful situations at work and provide coping mechanisms on how to deal with such in order to prevent chronic stress. Especially, job interviews have been identified as one of the major stressors in a work-related context for many reasons. They often involve a lot of uncertainty, pressure, and potential rejection. In research, job interview scenarios have recently become a popular use case for studying how to recognize and regulate stress as a result of being a natural stress inducing event [5, 6, 7]. As remote job interviews have become common practice in response to the restrictions created by the SARS-CoV-2 crisis, such a setting has been used for collecting a novel multi-modal stress data set in a realistic naturally stress-inducing environment. For data collection, we recorded signals from various sources including audio, video (motion capturing, facial recognition, eye tracking) as well as physiological information (photoplethysmography (PPG), electrodermal activity (EDA)). Synchronization of the different signals was provided by the Social Signal Interpretation (SSI) framework [8]. We gathered data from 40 participants who took part in remote interview sessions, resulting in approximately 56 hours of multi-modal data. For data annotation, participants self-reported stressful situations during the interview as well as their perceived emotions. In addition, two experienced psychologists annotated the interviews frame-by-frame using equal stress and emotion labels. Calculating the inter-rater reliability for the individual labels resulted in substantial to almost perfect agreement (Cohen's \(\kappa>0.7\) for all labels). In addition to that, salivary cortisol levels were assessed in order to investigate whether the participants experienced a biological stress response during the interviews. For automatically classifying the participant's stress level during the interview, the collected signal information was used to produce a rich high-level feature set. The set contains EDA, HRV, body keypoints, facial landmarks including action units, acoustic frequency, and spectral features. Further, a pupil feature set was created based on the latent space features of an autoencoder that has been trained on close-up videos of the eye. In addition to that, the pupil diameter has been extracted as well. For reducing the dimensionality of the input feature vector, two approaches - early and late PCA (Principal Component Analysis) - were compared. The classification problem was formulated as a binary stress recognition task ((stress vs. no stress). We used and compared the performance of five different machine-learning classifiers - SVM (Support Vector Machine), KNN (K-Nearest Neighbors), NN (Feed-forward Neural Network), RFC (Random Forest Classifier), and LSTM (Long-Short-Term Memory Network) solely using the pupil features as input. To the best of our knowledge, we present the first approach utilising close-up eye features for detecting stress. Evaluation of the classifiers revealed that a NN approach using all modalities as input and applying early PCA led to the best recognition of the participant's stress level. An NN approach also performed best for each individual modality. Comparing the different modalities for their impact on the recognition performance, HRV features had the highest accuracy and \(F_{1}\)-scores. The proposed dataset makes the following contributions to the research community. First, we provide data collected in a realistic stress setting that has been validated by the analysis of saliva cortisol levels in order to assess whether participants experienced a biological stress response during the interviews. Secondly, the data set was annotated using a continuous labelling approach enabling dynamic stress recognition. Thirdly, we provide a multi-modal stress dataset containing established as well as novel modalities, e.g. close-up eye features for providing a promising non-invasive modality for detecting stress. The structure of this article is as follows: In Section 2, we present background and related work regarding existing stress data sets. Section 3 describes the data collection process including design principles, the recording system, properties of the data set as well as annotation procedure and feature extraction methods. The method for automatic stress recognition is explained in detail in Section 3. The results of the performance of the different machine-learning classifiers are presented in section 4 and discussed in Section 5. Finally, conclusions are provided in Section 6, and ethical considerations are detailed in Section 7. ## II Background and related work As of today, multiple stress datasets for the automatic recognition of stress are available. Table I displays an overview of some of the existing stress datasets. The datasets not only differ in the used modalities for stress recognition but also in the stimulus to induce stress. Those stimuli range from realistic real-world scenarios to highly optimized lab settings. A common way to induce stress in a controlled way is to use established stress tests like the _Trier Social Stress Test_ (TSST). The WESAD corpus by Schmidt et al. [9] uses the TSST as a stimulus and provides physiological data. Further, various stress-related annotations like the affective state (neutral, stress, amusement) are given that were obtained by a variety of self-report questionnaires, e.g., Positive Negative Affect Schedule (PANAS; [10], State-Trait Anxiety Inventory (STADI; [11]), SAM, Short Stress State Questionnaire and others. Similarly, the UBFC-Phys dataset introduced by Sabour et al. [12] used an approach inspired by the TSST to induce stress. While also providing physiological data, that dataset contains stress states derived from pulse rate variability and EDA. For the _Multimodel Dataset for Psychological Stress Detection_ (MDPSD) corpus provided Chen et al. [13], stress was induced by the classic Stroop Color-Word Test, the Rotation Letter Test, the Stroop Number-Size Test and the Kraepelin Test. Facial videos, PPG and EDA data are provided. Stress annotations were obtained through a self-assessment questionnaire. Koldjik et al. [14] introduced the SWELL dataset where they tried to simulate stress-inducing office work by applying time pressure in combination with typical work interruptions like emails. In order to assess the subjective experience during the study they relied on various validated questionnaires to gather data about task load, mental effort, emotion response and perceived stress. In contrast to the above datasets, Healey and Picard [15] presented a dataset for _Stress Recognition in Automobile Drivers_ using highly realistic real-world stressors instead of rather controlled approaches to induce stress. Here, they induced stress by letting the subjects perform open-road drivings. Besides recording physiological data, stress annotations were obtained through self-assessment questionnaires using free scale and forced scale stress ratings. The MuSE dataset introduced by Jaiswal et al. [16] also used a real-world stressor, but in contrast to other datasets, they did not induce stress by simulating a specific scenario themselves. They made use of the final exams period at a university as an external stressor. Therefore, they recruited 28 college students and recorded them in two sessions, one during the finals period and one afterwards. During the recordings, they confronted the participants with various emotional stimuli. Afterwards, the participants self-reported their perceived stress and emotions. Moreover, additional emotion annotations have been created by employing Amazon Mechanical Turk workers. Similar to the MuSE dataset the SWEET study [17] also relied on naturally occurring external stressors as a stimulus. They assessed stress manifested by daily life stressors of 1002 office workers. In contrast to other studies that are conducted in laboratory settings, they investigated the perceived stress of the participants during their daily life for five consecutive days. Throughout those five days, they collected physiological data with wearables, contextual information (e.g., location, incoming messages) provided by a smartphone as well as self-reported stress. The daily self-assessment was done with a smartphone application that questions the user 12 times a day about their perceived stress. Further datasets exist that are based on non-physiological feature sets. For example, the Dreaddit corpus presented by Turcan et al. [18] contains a collection of social media posts that were annotated regarding stress by Amazon MTurk workers. Other datasets, like the SLADE dataset introduced by Ganchev et al. [19], focus on scenarios facilitating stress, although not explicitly giving stress annotations. Instead, the SLADE dataset provides valence-arousal labels for situations where stress was induced using audio-visual stimuli, i.e. movie excerpts. Similarly, the CLAS corpus presented by Markova et al. [20] provides valence-arousal labels as well as cognitive load annotations to situations where stress was induced by a math problems test, a Stroop test, and a logic problems test. Additionally, physiological data, such as ECG, PPG and EDA is provided. Altogether, a large variety of different stress datasets already exists and is available to the research community. However, existing datasets show some drawbacks regarding stress labels, recorded modalities and availability. Existing stress datasets predominantly are labelled through stress questionnaires or similar assessments. Those approaches come with the disadvantage of yielding annotations of low temporal resolution, i.e., large time frames are treated as one and aggregated to a single annotation. As such, short-term deviations in stress levels can not be modelled with sufficient precision. In contrast to that, the dataset presented in this paper was annotated in a time-continuous manner. This allows for the development of stress recognition systems that are more accurate, reactive and robust than is the case with existing datasets. Even though multi-modal stress datasets exist they rarely provide a comprehensive representation of the participants' behavior. The majority of the datasets rely on physiological signals e.g. HRV and EDA with some of them also providing video or audio or already extracted features. However, to the best of our knowledge, there is no dataset present that provides a comprehensive collection of relevant modalities. The proposed ForDigitStress dataset contains audio, video, skeleton data, facial landmarks including action units as well as physiological information (PPG, EDA). In addition to the raw signals, we also provide already extracted features for HRV and EDA as well as established feature sets like GEMAPS [21] and OpenPose [22]. Furthermore, this dataset contains pupillometry data which is a mostly overlooked modality for the recognition of stress. As prior work suggests [23, 24, 25], there are correlations between various affective states and pupil dilation. Also collecting pupillometry data can be done unobtrusively by using existing eyetrackers or even laptop webcams [5]. Therefore, we believe that incorporating pupillometry data can benefit multiple stress-related use cases where eye-tracking is a reasonable option. The dataset provides already extracted pupil diameter as well as close-up infrared videos of the eye. Based on the close-up videos we trained an autoencoder and extracted the latent space features that represent an abstracted version of the eye. Those features are also made available as part of the dataset. ## III Dataset ### _Design Principles_ #### Iii-A1 Setting The main requirement for the setup has been to elicit stress and emotional arousal in participants. Moreover, the setting should reflect a familiar real-world scenario. Therefore, we opted for a remote job interview scenario, a typical digital stressor. Performing remote job interviews has become a common procedure in many modern working environments. Job interviews are by their nature a complex stressful social scenario where different aspects of human interaction and perception collude. Previous research has shown that psycho-social stress also occurs in mock job interviews [26, 27]. Figure 2 shows a schematic of the employed study setup. To mimic remote job interviews participant and interviewer were interacting via two laptops while sitting in two separate rooms. #### Iii-A2 Procedure Participants were invited to the laboratory and were told that physiological reactions during an online job interview will be recorded. In advance, participants sent their curriculum vitae (CV) to the experimenter and filled out an online survey, in which demographic variables and experiences with job interviews were assessed. After arrival in the laboratory, they were asked about their dream job and were equipped with PPG and EDA sensors as well as a wearable eye tracker. Then, they had fifteen minutes to prepare for the interview. The participant and interviewer were seated in two separate rooms and were interacting with each other over two connected laptops similar to an online meeting. The interviewer tried to ask critical questions to stress the applicant and to induce negative emotions. Contents of the interviews included questions about strengths and weaknesses of the applicant, dealing with difficult situations on the job, salary expectations, willingness to work overtime, as well as inconsistencies in the CV. In addition, tasks related to logical thinking were asked as well as questions about basic knowledge in the areas of mathematics and language. The procedure is described in detail in [28]. After the job interviews, participants were asked about their emotions during the interview. After this, participants reported whether they felt stressed at any time during the interviews. Afterwards, participants were instructed to describe as precisely as possible in which specific situations during the job interviews they felt stressed. This procedure (rating and assignment to specific situations) was repeated for all of the reported emotional states (i.e., share, anxiety, pride, anger, annoyed, confused, creative, happy, insecure, nervous, offended, sad, surprised). In order to assess whether the mock job interview did elicit stress in the participants not only self-reports were collected but also saliva samples were taken to determine cortisol levels. Salivary cortisol levels are a measure for the activity of the hypothalamic-pituitary adrenal (HPA) axis. Increased cortisol levels can be observed when a person is exposed to stress [29], especially for social-evalative situations. They are therefore an adequate measure to investigate the participant's biological response to the remote job interview. When a person has been exposed to a stressor the cortisol level does not increase instantly. Peak levels are usually found about 20 minutes after psycho-social stressors of short duration (e.g., the TSST). After this, cortisol levels return to baseline levels. The samples of participants that have been stressed by the interview will show an increase in cortisol level until they reach a peak followed by a decrease back to their baseline levels. Therefore, salivary cortisol was assessed as a measure for biological stress. For saliva collection, Salivettes (Sarstedt, Numbrecht) were used. Each participant provided six saliva samples at different time points. Figure 1 displays an overview of the timing of saliva sample collection during the study. The first sample was collected at the beginning of the study and the second at the end of the preparation phase (i.e., immediately before the actual job interview started). Those two samples were separated by about 15 minutes in order to assess the baseline cortisol level before the participant was exposed to the stressor, i.e., the job interview. The further four samples were collected immediately after the job interview, 5 minutes, 20 minutes, and 35 minutes after it to cover the cortisol increase, its peak, and its return to baseline. During each saliva sampling, participants rated their current stress level on a 10-point Likert scale with the anchors "not stressed at all" and "totally stressed". ### _Recording System_ Various sensors were used to record the participants' physiological responses. For recording and streaming the participant's data, we employed a Microsoft Kinect 2. The Microsoft Kinect 2 supports FullHD video captures as well as optical motion capturing to extract skeleton and facial data. Moreover, the built-in microphone was used to record ambient sound data. In addition to that, the participants were equipped with an ordinary USB headset from Trust. Furthermore, the IOMI biofeedback sensor was used to collect PPG and EDA data. Finally, participants were wearing a Pupil Labs eyetracker to record closeup videos of their eye. All sensors were connected to a Lenovo Thinkpad P15. The setup for the interviewers only consisted of audio recorded with the same Trust USB Headset and video from the built-in Lenovo Thinkpad P15 webcam. A schematic overview of the recording setup is displayed in Figure 2. The participant and interviewer were seated in two different rooms and were interacting remotely with each other through the two laptops. In a third room, another computer was set up to act as an observer. This way the interaction between the participant and the interviewer could be monitored unobtrusively. In order to keep the recorded signals in synchrony we implemented a SSI [8] pipeline. ### _Collected Data_ Data of \(N\) = 40 healthy participants (57.5% female, 40% male, 2.5% diverse) was included in the data set. Mean age was \(22.7\pm 3.2\) years (min: 18, max: 31). Mean body-mass-index (BMI) was \(23.2\pm 4.1\)\(kg/m^{2}\) (min: 17.9, max: 37.7; 1 missing). In total 56 hours and 24 minutes of multi-modal data have been recorded. An overview of all the recorded files is displayed in Table II. ### _Annotation_ The basis for the annotations was the self-reports of the participants regarding perceived stressful situations and emotions. Two experienced psychologists annotated the recorded sessions frame by frame based on the participants' reports and content of the interviews. Categories for the annotations were the categories from the questionnaire (i.e., stress as well as the reported emotions like shame, anxiety, anger, and pride). In total, 1,286 minutes of data were annotated. There were no disagreements between the psychologists' ratings and the participants' self-reports, i.e., for every situation that was assigned to stress or an emotion by the participants, a time window could be assigned by the psychologists and a corresponding annotation could be created. Figure 3 displays the overall label distribution for the occurred emotions. In the first step, the two psychologists independently annotated the 40 videos with the NOVA tool [30]. During the annotation process, the job interview videos were examined with regard to stress and different emotions. The annotations were created based on the observable behavior of the participants. In a second step, the annotations were supplemented with information from the self-reports of the interviewees. For every visible or reported feeling of stress, a discrete label was created. Emotions were annotated accordingly. In a last step, disagreements in the annotations were discussed by the two psychologists. The annotations in which there was agreement, regarding the subject's perception of stress were adjusted. Situations that continued to be interpreted differently after the discussion remained unchanged in the annotation. A screenshot of a loaded recording session from the dataset is shown in Figure 5. In order to measure the quality and reliability of the discrete annotations we calculated the inter-rater agreement between the two psychologists using Cohen's Kappa (see Figure 4). The majority of the annotations have shown a strong to almost perfect agreement following the interpretation for Cohen's Kappa. ### _Feature Extraction_ The recorded raw data has been used to extract features that are valuable for stress recognition. The following section gives an overview of the extracted features as well as additional information regarding the extraction process. Moreover, the presented features are also available for download. Fig. 1: Overview of the timing of saliva sample collection during the different stages of the study. #### Iii-A1 Eda Features derived from the EDA signal are widely used for stress recognition [9, 14, 15, 31]. The EDA signal can be decomposed to skin conductance level (SCL) and skin conductance response (SCR) [9, 32]. SCL or the tonic component is the slow-changing part of the EDA signal. SCR or the phasic component is the rapid changes as a response to a specific stimulus. First, we remove the high-frequency noise by applying a \(5\) Hz low-pass filter [9, 32]. We use the filtered signal to calculate statistical features [9, 31, 33] like mean, standard deviation, dynamic range, etc. We compute the SCL and SCR components using the cvxEDA decomposition algorithm [34]. In addition to the various statistical features of SCL and SCR signals, we also compute features derived from the peaks in the SCR signal [15]. We compute a total of \(17\) features (see Table III) from a \(60\) seconds long input EDA signal. #### Iii-A2 Ppg As demonstrated in previous studies [9, 35], the PPG signal can be used to derive HRV (Heart Rate Variability) features for predicting stress. We compute \(22\) PPG-based HRV features which are listed in Table III. To derive the HRV from PPG, we detect the Systolic Peaks (P) from the input signal. The first step is to remove baseline wander and high-frequency noises from the raw PPG signal. We use a band-pass filter (\(0.5-8\) Hz) to reduce the noise and enhance the peaks [36]. Next, we use a peak finding algorithm to detect peaks such that (a) their amplitudes are above a specified threshold and, (b) consecutive peaks are sufficiently apart. The amplitude threshold is set to the mean of the \(75\) percentile and \(90\) percentile of the peak heights in the input signal. The typical maximum heart rate of healthy participants during exercise stress is 3 beats per second (180 beats per minute) [37]. Hence, we set the minimum time between two consecutive peaks as Fig. 4: Average Cohen’s Kappa calculated for stress and each emotion to map the interrater agreement between the two psychologists. Fig. 3: Number of samples per occurred emotion. Fig. 2: Overview of the study setup. Participant and interviewer were seated in different rooms and interacting remotely with each other. A third computer was acting as an observer to unobtrusively monitor the interaction between the participant and interviewer. \(0.333\) seconds. We use \(60\) seconds long PPG segments to detect the peaks and compute the HRV signal. We compute various HRV features [38, 39, 31, 9, 33] from time domain, frequency domain, and Poincare plots. #### Iii-A3 Body keypoints Prior studies have established the value of body language and body behavior for the recognition of stress [40][41][42]. Therefore, our study setup included a Microsoft Kinect2 to extract 3D body data. This data provides information about 25 joints consisting of position in 3D space, orientation of the joints in 3D space as well as a confidence rating in regard to the tracking performance. Even though the Microsoft Kinect2 has been used in prior studies in the context of stress recognition [40, 41, 42] we aimed to provide additional body data in order to enable others to utilize the provided dataset across multiple datasets. Therefore, we extracted the OpenPose [22] features from the recorded HD video displaying the participant. OpenPose is a widely used state-of-the-art framework for the detection of human body key points in single images. It is important to point out that OpenPose solely returns the body key points in 2D space, therefore, losing some information when compared to the Microsoft Kinect2 data. However, in order to extract the OpenPose features no special hardware is required and the data of a simple camera is sufficient enough. It is important to point out that due to the study setup, not all joints could be successfully tracked as the participants were sitting and their lower body was concealed by the table. Therefore only the features corresponding to the upper body joints provide reliable information. #### Iii-A4 Action units Facial expressions play an important role in communicating emotions and therefore are frequently used for the automatic detection of affective states [43][44]. Further, recent studies have utilized facial action units to successfully predict human stress [41][45][46]. We extracted 17 facial action units (see Table III) provided by the Microsoft Kinect2. In addition to that, we also extracted the OpenFace2 [47] features that consist of facial landmarks, head pose, facial action units, and eye-gaze information. Similar to OpenPose, those features can be extracted from any video data. #### Iii-A5 Audio features Knapp et al. [48] argue that emotions are reliably transported by the voice. Indeed it is a well-established fact that the acoustic characteristics of speech e.g. pitch and speaking rate are altered by emotions [49]. Moreover, vocal signs of stress are mainly induced by negative emotions [50]. Multiple studies were able to show that it is possible to automatically detect stress with acoustic features [51][50][52][53]. In order to provide meaningful acoustic features we chose to extract the GEMAPS features [21]. One of the main objectives of the GEMAPS feature set has been to provide access to a comprehensive and standardized acoustic feature set. It contains frequency and energy-related features like pitch, jitter, shimmer and loudness, as well as spectral features, e.g., Hammarberg Index and harmonic differences. We calculated the features over a one second time window. #### Iii-A6 Pupil features Responses of the pupil like pupil dilation are closely related to subjective and physiological stress responses [54][55]. Furthermore, a recent study has shown that pupillometry is a suitable tool to measure arousal during Fig. 5: An instance of a recorded session loaded in NOVA.The top row displays the eyterracking video alongside the video recording of the participant. Below that several feature streams are displayed: HRV feature stream, EDA, Gemaps audio features, skeleton data, and action units. At the bottom, two discrete annotation tiers are shown displaying stressful situations and the interview phase. emotion regulation after an acute stressor [56][55]. Therefore, part of our study setup has been a wearable eye tracker that provides close-up video data of the participant's eye. From those videos, we automatically extracted the pupil diameter by employing the extraction pipeline described in [5]. In addition to that, we also trained an autoencoder on the close-up eye videos in order to extract the corresponding latent space features. The latent space features contain an abstract representation of the eye. Figure 6 displays the original input image of the eye and the output image produced by the autoencoder below. During the encoding and decoding process, barely any loss of information occurred as the input image and corresponding output image are almost identical. This is a strong indicator that the autoencoder has learnt meaningful features to accurately translate the image into and out of the latent space. The resulting feature set consists of 512 parameters corresponding to the size of the latent space. ### _Availability_ The ForDigitStress dataset is freely available for research and non-commercial use. Access to the dataset can be requested at [https://hcai.eu/fordigitstress](https://hcai.eu/fordigitstress). The dataset is organized in sessions with a total size of approximately 360 GB. ### _Automatic Stress Detection_ #### Iv-G1 Dimensionality Reduction As seen from Table III, various features have been extracted from each modality. The size of the input dimension can be a concern for some machine learning techniques, especially when we consider multi-modal stress recognition. Therefore, we use PCA (Principal Component Analysis) as it has been shown to reduce Fig. 6: Examples of reconstructed images. The top row displays the original input image, while the bottom row shows the images reconstructed with the autoencoder. dimensionality without a drop in classification performance of the machine learning models [57]. We apply PCA for stress models involving individual modalities as well as the multi-modal stress recognition models. The length of the feature vectors of action units, EDA, HRV, OpenPose, and Gemaps was \(17,17,22,24,58\). We retain \(95\%\) of the components using PCA, reducing the length of the feature vectors to \(10,9,10,8,19\), respectively. We follow two approaches for combining features for multi-modal stress recognition - early PCA and late PCA. In early PCA, we first apply PCA to individual modality features and then combine them. Whereas in late PCA, we first combine the features and then apply PCA to the combined feature vector. The length of the feature vector for early PCA is \(56\) (sum of the length of feature vectors of each modality), and for late PCA is \(49\). Similar to Reddy et al. [57], we perform a MinMax normalization before applying PCA. #### Iii-B2 Classifiers Previous works [9, 58, 59, 33] have demonstrated that many of the machine learning classifiers such as SVM (Support Vector Machine), KNN (K-Nearest Neighbors) and RFC (Random Forest Classifier) can achieve good stress recognition performance. Recent works [60] have shown that simple feed-forward neural networks perform better than popular machine learning classifiers in feature-based stress recognition. We train the following classifiers as a baseline for our dataset. * **KNN** This machine learning technique classifies samples based on the labels of the nearest neighbouring samples. The neighbouring samples are determined using the Euclidean distance between them. We use \(K=50\) neighbouring samples to classify the samples. * **Simple Neural Network** This is a Multi-Layer Perceptron with an input layer, two hidden layers, and a prediction layer. Since the size of the input varies depending on the modalities, we have a varying number of nodes in the hidden layers. We set the number of nodes in the first hidden layer as half of the input size, rounded up to a multiple of \(2\). The number of nodes in the second hidden layer is half of the first layer. The activation function for hidden layers is ReLU (rectified linear unit). The prediction layer has a single node with Sigmoid activation to discern between stress and no-stress classes. We avoid over-fitting by using a dropout layer (dropout rate \(=~{}0.2\)) after the input layer. * **RFC** This is an example of an ensemble classifier that trains a number of decision tree classifiers on subsets of the training set. This training technique controls overfitting. Hence, the RFC achieves better overall performance, even if the individual decision trees are weak. In our evaluations, we use an RFC with \(100\) decision trees (or estimators) and \(50\) minimum samples for splitting a node. * **SVM** This is a popular supervised learning technique that often achieves good stress recognition performance. Similar to previous works [59, 33], we use the Radial basis function (Rbf) as the kernel function for our SVMs. The simple neural networks were implemented using Tensorflow. We use the SGD optimizer (learning rate \(=~{}0.001\)) and binary cross-entropy loss. We train them for \(100\) epochs with a batch size of \(256\). All other machine learning models were trained using Scikit-learn. We balanced our training set by randomly down-sampling the no-stress class depending on the number of stress samples annotated for each participant. In addition to the baseline models we also trained a simple LSTM network on the autoencoder features extracted from the eye tracker video data. The model consists of one LSTM layer with a time step size of 50 frames and one fully connected layer. Unfortunately, some participants accidentally manipulated the eye tracker and changed the alignment of the built-in camera. In some cases, this resulted in uncaptured eyes. Therefore the LSTM network could only be trained on a subset of the recorded data. The subset contains 19 sessions for training the model. For that reason, we report the results separately from the baseline results. Apart from the reduced training data, the procedure for training the LSTM model was similar to the other classifiers. #### Iii-B3 Evaluation Metrics Similar to previous work [9], we use accuracy and f1-score as the performance metrics to evaluate our stress models. To assess the generalizability of our models on data from unseen users, we perform LOSO (leave-one-subject-out) evaluations. ## IV Results ### _Automatic Stress Detection_ We evaluate our dataset on a binary stress recognition task (stress vs. no stress). Popular machine learning techniques such as RFC, KNN, SVM, and simple feed forward neural networks are trained on features extracted from facial action units, EDA, HRV, OpenPose, and Gemaps. The results of our LOSO evaluation are presented in Table IV. Combining modalities (both early and late PCA) yields better stress recognition performance than individual modalities. However, early PCA achieves slightly better performance across classifiers. The best stress recognition performance (\(F1=88.1\%\), \(Accuracy=88.3\%\) ) is obtained by a simple feed-forward neural network using all modalities with early PCA. The simple feed-forward neural networks consistently outperform other models across modalities. This is in line with the observations of related work [60] that used simple neural networks on other stress datasets. When considering stress recognition using a single modality, HRV features yield the best results across classifiers, followed by facial action units and OpenPose features. The Gemaps (speech) and EDA features rank the lowest in stress recognition performance, achieving \(15-20\%\) lower f1-score and accuracy. As mentioned in subsection III-G we also trained a simple LSTM network on the extracted eye autoencoder features. The model achieved a f1-score of 68.3% and an accuracy of 70.2%. ### _Biological Stress_ As a manipulation check, i.e. to prove whether our job interview scenario indeed induced stress, biological and perceived stress were measured at 6 time points (2 before and 4 after the job interview). Cortisol levels as a marker for biological stress significantly changed during the whole session (Figure 7A; \(F\)(5, 190) = 3.19, \(p\) = 0.009). They were highest 5 minutes after the job interview and then decreased to baseline levels 35 minutes after the stressor. A similar time course was found for perceived stress, which was highest immediately after the job interview and decreased to baseline afterwards (Figure 7B; \(F\)(5, 190) = 39.82, \(p\)\(<\) 0.001) ## V Discussion In order to establish a baseline on our dataset for the automatic recognition of stress we trained several machine learning models on different modalities. Throughout our experiments, a simple NN performed best across all modalities. In single-modality stress recognition, the models trained on HRV features achieved the best results. This is in line with existing research that identified heart rate and HRV as excellent measures for predicting stress [61, 62]. Moreover, models trained with action units and OpenPose features achieved similar results, i.e., 78.0% and 79.5% compared to 79.7% for the HRV features. Another well-established modality to detect stress is EDA [61]. Models solely trained on EDA features were able to achieve accuracy scores of up to 91% in a binary stress recognition task [63]. Interestingly, in our experiments, the models trained on the EDA features were the ones having the second worst accuracy and f1-scores. One reason for that observation could be that existing datasets often aggregate larger time frames to one label whereas we worked with time-continuous annotations with a high temporal resolution. This could be a problem when working with EDA as there is a delay from the sympathetic nervous systems stimulation and the corresponding EDA response [64]. Therefore, the EDA features could still represent a non-stressed state due to the delay for situations identified as stress. This could potentially be mitigated by either shifting the signal corresponding to the delay or calculating the EDA features over a longer time window. Further investigations should be conducted in future work to check whether following those approaches leads to better classification performance. The worst-performing modality in our experiments was the GEMAPS features. The best classifier only achieved an accuracy of 60.3%. Similar research [53][52] reported slightly better classification accuracies of 66.4% and respectively 70.0%. Especially subject independent stress classification based on audio features shows room for improvement when compared to other modalities. Investigating other deep learning architectures like LSTM models or CNN models trained on spectrograms to automatically detect stress could be promising. The model solely trained on the eye features achieved in our experiment an accuracy of 70.2%. This places the model in the midfield regarding single modality classification performance even though the model could only be trained on a subset of the recorded data. However, this was the only model that has been trained on time series data therefore results can not be compared without further ado. Nevertheless, the results indicate that features extracted from close-up eye video data hold relevant information for the recognition of stress. Considering that there is only very Fig. 7: Time course of cortisol levels (A) and perceived stress (B) during the whole session. limited research available [5] that has been using close-up eye features to automatically detect stress this experiment highlights the usefulness of such features. Features derived from the movement of the eye as well as changes in pupil size are a promising, non-invasive modality for the automatic recognition of stress. Overall we found that a fusion of the action unit, EDA, HRV, OpenPose and GEMAPS features that already have been reduced in dimensionality by employing PCA achieved the best accuracy and f1-scores with 88.3% and 88.1%. In order to validate whether mock digital job interviews are a suitable scenario for inducing stress we measured biological as well as perceived stress during the study. Salivary cortisol levels were used as a marker for biological stress. We found a significant change in cortisol levels and perceived stress throughout the study. Peak cortisol levels were observed 5 minutes after the interview whereas perceived stress was found to be highest immediately after the interview. The delay of peak cortisol levels in comparison to perceived stress ratings is due to the fact that it takes some time for the body to release cortisol. In order to reach peak cortisol levels it usually takes 10 to 30 minutes [29]. This delay can be observed in Figure 7. Overall, the results show that mock digital job interviews are a reliable scenario to induce stress in participants. Finally, the stress response can be associated with a variety of person characteristics such as personality or coping styles. Whether the biological stress response in our study was associated with person variables has been analyzed and is reported in [28]. ## VI Conclusion In this paper, we present a comprehensive multi-modal stress dataset that is employing a digital job interview scenario for stress induction. The dataset provides signals from various sources including audio, video, body skeleton, facial landmarks, action units, eye tracking, physiological information (PPG, EDA), as well as already extracted features like GEMAPS, OpenPose, pupil dilation and HRV. In total, 40 participants have been recorded resulting in approximately 56 hours of multi-modal data. Moreover, the dataset contains discrete annotations created by two experienced psychologists for stress and emotions that occurred during the interviews. The inter-rater reliability for the individual stress and emotion labels showed a substantial to almost perfect agreement (Cohen's \(\kappa>0.7\) for all labels). Based on the stress annotations several machine learning models (SVM, KNN, NN, RFC) were trained to predict stress vs. no-stress. The best single modality performance of 79.7% was achieved by a NN trained on the HRV features. The best stress recognition performance (\(F1=88.1\%\), \(Accuracy=88.3\%\) ) was obtained by training a NN on all modalities with early PCA. Moreover, we validated whether the digital mock job interviews are capable of inducing stress by assessing salivary cortisol levels and perceived stress. The analysis revealed a significant change in cortisol levels and perceived stress throughout the study. Therefore, we conclude that digital mock job interviews are well-suited to induce biological and perceived stress. In summary, the dataset presented in this work provides the research community with a comprehensive basis for further experiments, studies, and analyses on human stress. In future work, we plan to establish an additional baseline for the automatic detection of emotions that occurred during the interviews. For this purpose, we plan to extend the dataset by valence and arousal annotations. ## VII Ethics The study has been approved by the local Ethics Committee of the FAU (protocol no.: 21-408-S). All participants gave written and informed consent for participation and for publication of their data. Moreover, the presented study has been approved by the data protection officer of the University of Augsburg. ## Acknowledgements This work presents and discusses results in the context of the research project ForDigitHealth. The project is part of the Bavarian Research Association on Healthy Use of Digital Technologies and Media (ForDigitHealth), which is funded by the Bavarian Ministry of Science and Arts. Linda Becker was funded by the Emerging Talents Initiative of the Friedrich-Alexander-Universitat Erlangen-Nurnberg. We thank Leonie Bast, Steffen Franke, and Katharina Hahn for data collection.

2307.04964

Secrets of RLHF in Large Language Models Part I: PPO

Large language models (LLMs) have formulated a blueprint for the advancement of artificial general intelligence. Its primary objective is to function as a human-centric (helpful, honest, and harmless) assistant. Alignment with humans assumes paramount significance, and reinforcement learning with human feedback (RLHF) emerges as the pivotal technological paradigm underpinning this pursuit. Current technical routes usually include \textbf{reward models} to measure human preferences, \textbf{Proximal Policy Optimization} (PPO) to optimize policy model outputs, and \textbf{process supervision} to improve step-by-step reasoning capabilities. However, due to the challenges of reward design, environment interaction, and agent training, coupled with huge trial and error cost of large language models, there is a significant barrier for AI researchers to motivate the development of technical alignment and safe landing of LLMs. The stable training of RLHF has still been a puzzle. In the first report, we dissect the framework of RLHF, re-evaluate the inner workings of PPO, and explore how the parts comprising PPO algorithms impact policy agent training. We identify policy constraints being the key factor for the effective implementation of the PPO algorithm. Therefore, we explore the PPO-max, an advanced version of PPO algorithm, to efficiently improve the training stability of the policy model. Based on our main results, we perform a comprehensive analysis of RLHF abilities compared with SFT models and ChatGPT. The absence of open-source implementations has posed significant challenges to the investigation of LLMs alignment. Therefore, we are eager to release technical reports, reward models and PPO codes, aiming to make modest contributions to the advancement of LLMs.

Rui Zheng, Shihan Dou, Songyang Gao, Yuan Hua, Wei Shen, Binghai Wang, Yan Liu, Senjie Jin, Qin Liu, Yuhao Zhou, Limao Xiong, Lu Chen, Zhiheng Xi, Nuo Xu, Wenbin Lai, Minghao Zhu, Cheng Chang, Zhangyue Yin, Rongxiang Weng, Wensen Cheng, Haoran Huang, Tianxiang Sun, Hang Yan, Tao Gui, Qi Zhang, Xipeng Qiu, Xuanjing Huang

2023-07-11T01:55:24Z

http://arxiv.org/abs/2307.04964v2

# Secrets of RLHF in Large Language Models ###### Abstract Large language models (LLMs) have formulated a blueprint for the advancement of artificial general intelligence. Its primary objective is to function as a human-centric (helpful, honest, and harmless) assistant. Alignment with humans assumes paramount significance, and reinforcement learning with human feedback (RLHF) emerges as the pivotal technological paradigm underpining this pursuit. Current technical routes usually include **reward models** to measure human preferences, **Proximal Policy Optimization** (PPO) to optimize policy model outputs, and **process supervision** to improve step-by-step reasoning capabilities. However, due to the challenges of reward design, environment interaction, and agent training, coupled with huge trial and error cost of large language models, there is a significant barrier for AI researchers to motivate the development of technical alignment and safe landing of LLMs. The stable training of RLHF has still been a puzzle. In the first report, we dissect the framework of RLHF, re-evaluate the inner workings of PPO, and explore how the parts comprising PPO algorithms impact policy agent training. We identify policy constraints being the key factor for the effective implementation of the PPO algorithm. Therefore, we explore the PPO-max, an advanced version of PPO algorithm, to efficiently improve the training stability of the policy model. Based on our main results, we perform a comprehensive analysis of RLHF abilities compared with SFT models and ChatGPT. Beyond additional qualitative results, we even find that LLMs successfully trained by our algorithm can often better understand the deep meaning of the queries, and its responses are more able to hit people's soils directly. The absence of open-source implementations has posed significant challenges to the investigation of LLMs alignment. Therefore, we are eager to release technical reports, reward models and PPO codes1, aiming to make modest contributions to the advancement of LLMs. Footnote 1: [https://github.com/OpenLMLab/MOSS-RLHF](https://github.com/OpenLMLab/MOSS-RLHF) **Disclaimer: This paper contains content that may be profane, vulgar, or offensive.** Introduction Nowadays, large language models (LLMs) have made remarkable progress, posing a significant impact on the AI community [1; 2; 3; 4]. By scaling up model size, data size, and the amount of training computation, these LLMs emerge prominent characteristics that are not present in small models, typically including in-context learning [5], instruction following [6; 7], and step-by-step reasoning [8]. Based on these emergent abilities, LLMs even exhibit some potential to link between words and percepts for interacting with the real world, leading to the possibilities of artificial general intelligence (AGI), like embodied language models with tool manipulation [9] and generative agents in interactive sandbox environment [10]. Despite the capacities, since LLMs are trained to capture the data characteristics of pre-training corpora (including both high-quality and low-quality data) [11; 12], these models are likely to express unintended behaviors such as making up facts, generating biased or toxic text, or even harmful content for humans [13; 14]. Accordingly, it is crucial that the ratio of safety progress to capability progress increases as emphasized in OpenAI's plan for AGI [15]. Hence, it is necessary to align LLMs with human values, e.g., helpful, honest, and harmless (3H) [12; 16; 17]. Especially, the arrival of open source foundation models, such as LLaMA [1] and OpenChineseLLaMA [18], has rapidly promoted the LLMs into the supervised fine-tuning (SFT) stage. In order to mitigate a huge risk of harmfulness, most of the current work tries to add some 3H data in SFT, hoping to activate the responses of the models to make a positive change at the moral and ethical level [7; 19; 20]. However, even though a set of safety and groundedness objectives are added to capture the behavior that the model should exhibit in a dialog [12], the model's performance remains below human levels in safety and groundedness [17]. Hence, it requires more effective and efficient control approaches to eliminate the potential risk of the use of LLMs. Fortunately, OpenAI and Anthropic have verified that RLHF is a valid avenue for aligning language models with user intent on a wide range of tasks [16; 17]. However, training large language models that align with human values is a daunting task, often resulting in repeated failure when trained using reinforcement learning [21]. Generally speaking, successful RLHF training requires an accurate reward model as a surrogate for human judgment, careful hyperparameter exploration for stable parameter updating, and a strong PPO algorithm for robust policy optimization. While the reward model trained by low-quality data and hard-to-define alignment target can easily mislead the PPO algorithm to a unintelligible direction. Besides, finetuning language models with PPO needs to coordinate four models to work together, i.e., a policy model, a value model, a reward model, and a reference model, making it hard to train and scale up to large-scale parameter models. In the new language environment, PPO suffers from sparse reward and inefficient exploration in word space, making it sensitive to hyperparameters. Models trained solely through repeated experiments, failed runs, and hyperparameter sweeps achieve far inferior results. The huge trial and error cost of LLMs makes researchers dare not easily let the research enter the RLHF stage, which hinders the LLMs safe landing. Hence, a robust PPO algorithm specially designed for LLMs is the key step to align human preferences. In this report, we carefully dissect the framework of RLHF and discuss the entire process that determines the success of the algorithm's training. We explored how the quality of the reward model affects the final result of the policy model. We find that the quality of the reward model directly determines the upper bound of the policy model, and designing an appropriate PPO algorithm is crucial for RLHF's successful training. Moreover, accurate code implementation matters in deep policy (practice makes perfect). Therefore, we have conducted in-depth evaluations of the inner workings of PPO algorithm to study how code-level and theory-level optimizations change agent training dynamics. We propose to monitor the PPO training process by using action space modeling metrics derived from the policy model, such as perplexity, response length, and KL divergence between the policy model and the SFT model. These metrics are more informative of the training stability than the values of response reward and loss functions. Based on these observations, we identify the policy constraints in the PPO algorithm as the key factor to achieve consistent alignment with human preferences. After extensive comparative experiments with various possible implementations of PPO framework, we finally introduce a preferable policy optimization algorithm named PPO-max, which incorporates the collection of effective and essential implementations, and is carefully calibrated to avoid interference among them. PPO-max alleviates the instability of vanilla PPO training and enables longer training steps with a larger training corpus. We evaluate PPO-max on 7B and 13B SFT models, demonstrating comparable alignment performance with ChatGPT. Contributions are summarized as follows: 1) we release competitive Chinese and English reward models, respectively, which have good cross-model generalization ability, alleviating the cost of relabeling human preference data; 2) we conduct in-depth analysis on the inner workings of PPO algorithm and propose the PPO-max algorithm to ensure stable model training; and 3) we release the complete PPO-max codes to ensure that the LLMs in the current SFT stage can be better aligned with humans. ## 2 Related Work Despite the promising capacities, LLMs are likely to express unintended behaviors such as making up facts, generating biased or toxic text, or even harmful content for humans [13; 14] due to the low-quality pre-training data. Hence, it is necessary to align LLMs with human values, e.g., helpful, honest, and harmless (3H) [16; 17; 12]. In order to mitigate a huge risk of harmfulness, most of the current work tries to involve 3H data in SFT, hoping to activate the responses of the models to make a positive change at the moral and ethical level [7; 19; 20], while the model's performance remains below human levels in safety and groundedness [17]. Hence, more effective and efficient control approaches are required to eliminate the potential risk of LLMs. Fine-tuning language models to align with human preferences provides an effective solution to this challenge, where an agent is required to learn human preferences and provide human-like results given a context and corresponding suffixes ranked or scored by human annotators. Reinforcement Learning (RL) provides the most straightforward solution to reach this goal, for the agent needs just scarce supervision signal from the reward model as human proxies, and is modified through numerous trials under RL framework, namely Reinforcement Learning from Human Feedback (RLHF). There have been many attempts on this path recently [22; 23; 24; 25; 17; 16; 26]. In the context of large language models, RLHF is especially adopted for the purpose of a helpful, honest, and harmless LLM that aligns with human values [16; 17; 12], alleviating the negative societal impacts from general-purpose language models. LaMDA [12] finetunes large language models to participate in interesting, helpful, factually grounded, and safe natural language dialogue and use of external information to ensure accuracy and groundedness. Rather than using reinforcement learning, they apply a mix of supervised learning techniques for human preference alignment. InstructGPT [16] finetunes GPT-3-type models [5] to improve helpfulness, which is mixed with RL from human preferences expressed through comparisons. [27] adopts the pre-training and fine-tuning tradition to train the preference model for human alignment, claiming that ranked preference modeling turns out to be the most effective training objective for distinguishing between "good" and "bad" behavior. This attempt is further improved by an iterated online mode of training, where preference models and RL policies are updated on a weekly cadence with fresh human feedback data, and PPO is incorporated to stabilize RL training [17]. Despite its effectiveness, RLHF (especially PPO) exhibits complexity, instability, and sensitivity to hyperparameters, which is not yet addressed in previous works. Under similar concerns, several works highlighted the importance of PPO for RL framework and made an attempt to improve its efficiency [28; 29]. [29] reveals that much of the observed improvement in reward brought by PPO may come from seemingly small modifications to the core algorithm (i.e. code-level optimizations). [28] further points out that a large number of low- and high-level design decisions of RL are usually not discussed in research papers but are indeed crucial for performance. As a result, [28] conducts a fair comparison among low-level designs based on a unified RL implementation and claims that the policy initialization scheme significantly influences the performance. Despite the efforts of revealing the importance of PPO and its recommended implementation, few attempts have been made to address the problem of instability and sensitivity to hyperparameters. In this paper, we dissect the framework of RLHF, especially shedding light on the inner workings of PPO, and explore an advanced version of the PPO which efficiently improves the training stability of the policy model. ## 3 Reinforcement Learning from Human Feedback The training process of AI assistant comprises three main stages: supervised fine-tuning (SFT), reward model (RM) training, and proximal policy optimization (PPO) on this reward model. During the SFT phase, the model learns to engage in general human-like dialogues by imitating human-annotated dialogue examples. Subsequently, the reward model is trained, in which the model learns to compare the preference of different responses based on human feedback. Lastly, in the PPO phase, the model is updated based on feedback from the reward model, striving to discover an optimized policy through exploration and exploitation. In the RLHF process, we mainly consider the stages of RM training and reinforcement learning via PPO. The PPO algorithm follows a series of steps as depicted in Figure 1. ### Reward Modeling For the RM architecture, we use pre-trained transformer-based language models with the last unembedding layer removed and add an additional linear layer to the final transformer layer. Given any text, the reward model will assign a scalar reward value to the last token, and the larger the reward value, the better the sample. Following Stiennon et al. [25], training reward models often involves utilizing a dataset comprised of paired comparisons between two responses generated for the same input. The modeling loss for each pair of preferred and dispreferred samples is: \[\mathcal{L}(\psi)=\log\sigma(r(x,y_{w})-r(x,y_{l})), \tag{1}\] where \(\sigma\) is the sigmoid function. \(r\) represents the reward model with parameters \(\psi\), and \(r(x,y)\) is the a single scalar predicted reward for input prompt \(x\) and response \(y\). Additionally, we follow [27] to use imitation learning, which introduces the autoregressive LM loss on the preferred response of each pair, allowing the model to imitate the preferred response in each sentence pair. In practice, we add the coefficient \(\beta_{\mathrm{rm}}\) the LM loss respectively. Finally, we define the following reward modeling loss: \[\mathcal{L}(\psi)=-\lambda\mathbb{E}_{(x,y_{w},y_{l})\sim\mathcal{D}_{rm}}[ \log\sigma(r(x,y_{w})-r(x,y_{l}))]+\beta_{\mathrm{rm}}\mathbb{E}_{(x,y_{w}) \sim\mathcal{D}_{rm}}[\log(r^{\prime}(x,y_{w})], \tag{2}\] where \(\mathcal{D}_{\mathrm{rm}}\) is the empirical distribution of the training set. \(r^{\prime}\) is the same model with \(r\) except for the top linear layer, the dimension of which corresponds to the vocabulary size, and \(r^{\prime}(x,y_{w})\) is the likelihood given the prompt \(x\) and the preferred response \(y_{w}\). We incorporate an extra term into the reward function, which introduces a penalty based on the Kullback-Leibler (KL) divergence between the learned RL policy \(\pi_{\phi}^{\mathrm{RL}}\) and initial supervised model \(\pi^{\mathrm{SFT}}\). The total reward can be expressed as [30]: \[r_{\mathrm{total}}=r(x,y)-\eta\mathrm{KL}(\pi_{\phi}^{\mathrm{RL}}(y|x),\pi^{ \mathrm{SFT}}(y|x)), \tag{3}\] where \(\eta\) is KL reward coefficient and controls the strength of the KL penalty. This KL divergence term plays two significant roles within this context. First, it functions as an entropy bonus, fostering Figure 1: PPO workflow, depicting the sequential steps in the algorithm’s execution. The process begins with sampling from the environment, followed by the application of GAE for improved advantage approximation. The diagram then illustrates the computation of various loss functions employed in PPO, signifying the iterative nature of the learning process and the policy updates derived from these losses. exploration within the policy landscape and preventing the policy from prematurely converging to a single mode. Second, it works to ensure that the RL policy's output does not deviate drastically from the samples that the reward model encountered during its training phase. ### Reinforcement Learning Applying RL to dialogue generation presents significant challenges due to the substantial state-action space. In this context, we consider human interaction as the "environment". At each timestep, \(t\), the agent (i.e., the AI assistant) receives a state \(s_{t}\) from the environment (i.e., the dialogue history), which consists of all the dialogue text up to this point, both by the assistant and the human. Then, based on its policy \(\pi\), the agent's action \(a_{t}\) is to generate the next token. The environment returns a reward \(r(s_{t},a_{t})\), which is calculated from a reward function \(r\) trained from human preference data. The agent then transitions to the next state \(s_{t+1}\), which includes the next dialogue history. The aim of RL is to find an optimal behavior strategy for the agent to maximize the cumulative reward (i.e., return) over a trajectory \(\tau=\{s_{1},a_{1},\dots,s_{T},a_{T}\}\). One kind of return is finite-horizon undiscounted return \(R(\tau)=\sum_{t=1}^{T^{\prime}}r(s_{t},a_{t})\), which is simply the sum of rewards accumulated with a fixed number of steps. Another one is the infinite-horizon discounted return \(R(\tau)=\sum_{t=0}^{\infty}\gamma^{t}r(s_{t},a_{t})\), takes into account all rewards obtained by the agent throughout its entire trajectory with a discount factor \(\gamma\in(0,1)\). #### 3.2.1 Policy Gradient Methods Policy gradient methods [31] are a type of RL techniques that directly optimize the policy of the agent--the mapping of states to actions--instead of learning a value function as in value-based methods. The central idea behind policy gradient methods is to improve the policy using the gradient ascent algorithm. In essence, these methods adjust the parameters of the policy in the direction that maximally improves the expected return. The policy \(\pi\) is typically parameterized by \(\theta\), we denote it as \(\pi(a|s,\theta)\), which is the probability of taking action \(a\) in state \(s\). The update rule for the policy gradient is given as: \[\theta\leftarrow\theta+\alpha\nabla_{\theta}J(\theta), \tag{4}\] where \(\alpha\) is the learning rate, \(J(\theta)\) represents the expected return when following policy \(\pi_{\theta}\) and the gradient of policy performance \(\nabla_{\theta}J(\theta)\) is called the policy gradient. A general form of policy gradient can be formulated as: \[\nabla_{\theta}J(\theta)=\mathbb{E}_{\tau\sim\pi_{\theta}}\left[\sum_{t=0}^{ T}\nabla_{\theta}\log\pi_{\theta}(a_{t}|s_{t})\Phi_{t}\right], \tag{5}\] where \(\Phi_{t}\) could be any of \(\Phi_{t}=R(\tau)\) or \(\Phi_{t}=\sum_{t^{\prime}=t}^{T}R(s_{t^{\prime}},a_{t^{\prime}})\) or \(\Phi_{t}=\sum_{t^{\prime}=t}^{T}R(s_{t^{\prime}},a_{t^{\prime}})-b(s_{t})\) with baseline \(b\). All of these choices lead to the same expected value for the policy gradient, despite having different variances. The return is calculated through Monte Carlo sampling. If the return is favorable, all actions are "reinforced" by increasing their probability of being selected. The advantage of this approach lies in its unbiased nature, as we rely solely on the actual return obtained rather than estimating it. However, a challenge arises due to the high variance associated with this method. This variance stems from the fact that different trajectories can result in diverse returns due to the stochasticity of the environment (random events during an episode) and the policy itself. To reduce this variance, a common strategy is to use advantage function estimates in place of raw returns in the policy gradient update rule. The advantage function \(A(s_{t},a_{t})\) represents how much better it is to take a specific action \(a_{t}\) at state \(s_{t}\), compared to the average quality of actions at that state under the same policy. Thus, \[\Phi_{t}=A(s_{t},a_{t}). \tag{6}\] Mathematically, \(A(s_{t},a_{t})=Q(s_{t},a_{t})-V(s_{t})\), where \(Q(s_{t},a_{t})\) is the action-value function, representing the expected return after taking action \(a_{t}\) at state s, and \(V(s_{t})\) is the value function, representing the average expected return at state \(s_{t}\). The application of policy gradients with advantage functions forms a crucial backbone in the realm of RL. However, the estimation methods for the advantage function vary significantly across different algorithms, thereby creating a landscape of diverse approaches. In the next section, we introduce Generalized Advantage Estimation (GAE) [32], a method that is foundational to policy optimization algorithms and has seen widespread use. #### 3.2.2 Generalized Advantage Estimation The following is a layman-friendly explanation of how GAE is derived. The advantage function, \(A\), is defined as the difference between the \(Q\) function (the expected return) and the value function (the expected return from following the policy from a given state). The \(Q\) function considers a specific action, while the value function averages over all possible actions according to the policy. However, in practice, we use returns (sum of rewards) from actual episodes to estimate the \(Q\) function. This introduces a high amount of variance because future rewards can be very noisy. One way to reduce this noise is by estimating future returns (after time step \(t\)) using the value function. The GAE algorithm effectively acts as a middle ground between using simple one-step Temporal Difference (TD) returns and using full Monte Carlo returns, balancing bias and variance. The following is a layman-friendly explanation of how GAE is derived. The TD-\(k\) return \(\hat{R}_{t}^{k}\) is a combination of actual rewards and estimated returns: \[\hat{R}_{t}^{k}=r_{t}+\gamma r_{t+1}+\ldots+\gamma^{(k-1)}r_{t+k-1}+\gamma^{k} V(s_{t+k}), \tag{7}\] where \(\gamma\) is the discount factor. The advantage estimate using TD-\(k\) returns is called the \(k\)-step advantage, defined as: \[\hat{A}_{t}^{k}=\hat{R}_{t}^{k}-V(s_{t})=\sum_{l=1}^{k}\gamma^{l}\delta_{t+l}=- V(s_{t})+r_{t}+\gamma r_{t+1}+\cdots+\gamma^{k-1}r_{t+k-1}+\gamma^{k}V(s_{t+k}), \tag{8}\] where \(\delta_{t}=r_{t}+\gamma V(s_{t+1})-V(s_{t})\) is the TD error. There's a significant bias-variance trade-off with \(k\)-step advantages. If \(k\) is small, the bias is high because the advantage estimation is based on fewer steps and thus depends heavily on the accuracy of the value function. On the other hand, if \(k\) is large, the variance can be high because the advantage estimation involves summing up many noisy rewards. In order to balance the bias-variance trade-off in the advantage estimation, GAE defines the advantage function as an exponential moving average of \(k\)-step advantages, with weights \((1-\lambda)\lambda^{(k-1)}\): \[\begin{split}\hat{A}_{t}^{\mathrm{GAE}(\gamma,\lambda)}=& (1-\lambda)(\hat{A}_{t}^{(1)}+\lambda\hat{A}_{t}^{(2)}+\lambda^{2} \hat{A}_{t}^{(3)}+\cdots)\\ =&(1-\lambda)(\delta_{t}+\lambda(\delta_{t}+\gamma \delta_{t+1})+\lambda^{2}(\delta_{t}+\gamma\delta_{t+1}+\gamma^{2}\delta_{t+2 })+\ldots)\\ =&(1-\lambda)(\delta_{t}(1+\lambda+\lambda^{2}+ \ldots)+\gamma\delta_{t+1}(\lambda+\lambda^{2}+\lambda^{3}+\ldots)\\ &+\gamma^{2}\delta_{t+2}(\lambda^{2}+\lambda^{3}+\lambda^{4}+ \ldots)+\ldots)\\ =&(1-\lambda)(\delta_{t}(\frac{1}{1-\lambda})+ \gamma\delta_{t+1}(\frac{\lambda}{1-\lambda})+\gamma^{2}\delta_{t+2}(\frac{ \lambda^{2}}{1-\lambda})+\ldots)\\ =&\sum_{l=0}^{\infty}(\gamma\lambda)^{l}\delta_{t+l}. \end{split} \tag{9}\] This definition of GAE smoothly interpolates between high bias (when \(\lambda=0\)) and high variance (when \(\lambda=1\)) estimators, effectively managing the trade-off. \[\mathrm{GAE}(\gamma,0):\hat{A}_{t}=\delta_{t}=r_{t}+\gamma V(s_{t+1})-V(s_{t}). \tag{10}\] \[\mathrm{GAE}(\gamma,1):\hat{A}_{t}=\sum_{l=0}^{\infty}\gamma^{l}\delta_{t+1}= \sum_{l=0}^{\infty}\gamma^{l}r_{t+1}-V(s_{t}). \tag{11}\] Through GAE, we can estimate \(\hat{A}_{t}\) of the advantage function \(A(s_{t},a_{t})\) accurately. This estimate will play a crucial role in constructing a policy gradient estimator: \[\nabla_{\theta}\hat{J}(\theta)=\frac{1}{|\mathcal{D}|}\sum_{\tau\in\mathcal{D} }\sum_{t=1}^{T}\nabla_{\theta}\log\pi_{\theta}(a_{t}|s_{t})\hat{A}_{t}, \tag{12}\] where \(\mathcal{D}\) is a finite batch of samples, we will use \(\hat{\mathbb{E}}_{t}\) to represent the aforementioned \(\frac{1}{|\mathcal{D}|}\sum_{\tau\in\mathcal{D}}\sum_{t=1}^{T}\). #### 3.2.3 Proximal Policy Optimization PPO and TRPO [33] are two pivotal techniques in RL, aimed at effectively training a policy without jeopardizing its stability. The underlying intuition for these methods is the idea of "small, stable steps": a philosophy of gently nudging the policy towards optimization, rather than forcing aggressive updates that might destabilize the overall learning process. In traditional RL, the principle of policy gradient mandates that new and old policies remain close in the parameter space. However, this proximity in parameter space does not necessarily equate to similar performance, and a slight variance in parameters can drastically impact the effectiveness of the policy. Furthermore, if a large, unrestrained step is taken, it can lead to a collapse in policy performance, a scenario often described as "falling off the cliff". This inherent risk is a limiting factor in terms of sample efficiency in vanilla policy gradients. Instead of being confined by parameter closeness, TRPO introduces a different kind of constraint on policy updates. It regulates the change in policies by ensuring the KL divergence, remains within an acceptable limit: \[\begin{split}\operatorname{maximize}_{\theta}& \hat{\mathbb{E}}_{t}\left[\frac{\pi_{\theta}(a_{t}|s_{t})}{\pi_{\theta_{ \mathrm{old}}}(a_{t}|s_{t})}\hat{A}_{t}\right],\\ \operatorname{subject}&\text{ to }\hat{\mathbb{E}}_{t} \left[\operatorname{KL}(\pi_{\theta_{\mathrm{old}}}(\cdot|s_{t}),\pi_{\theta }(\cdot|s_{t}))\right]\leq\delta,\end{split} \tag{13}\] where \(\theta_{\mathrm{old}}\) is the old policy parameters before the update. There are two primary variants of PPO: PPO-Penalty and PPO-Clip. While TRPO puts a hard constraint on the KL divergence to prevent harmful updates, PPO-Penalty addresses the unconstrained optimization problems by employing a penalty-based approach instead of constraints: \[\mathcal{L}_{\mathrm{ppo-penalty}}(\theta)=\hat{\mathbb{E}}_{t}\left[\frac{ \pi_{\theta}(a_{t}|s_{t})}{\pi_{\theta_{\mathrm{old}}}(a_{t}|s_{t})}\hat{A}_{ t}\right]-\beta\operatorname{KL}(\pi_{\theta_{\mathrm{old}}}(\cdot|s_{t}),\pi_{ \theta}(\cdot|s_{t})), \tag{14}\] with penalty factor \(\beta\). Clipped Surrogate Objective.PPO-Clip attempts to keep the new policy close to the old policy, but instead of putting a constraint on the KL divergence like TRPO, it uses a clipped version of the policy ratio in its objective. The objective function is expressed as: \[\mathcal{L}_{\mathrm{ppo-clip}}(\theta)=\hat{\mathbb{E}}_{t}\left[\min\left( \frac{\pi_{\theta}(a_{t}|s_{t})}{\pi_{\theta_{\mathrm{old}}}(a_{t}|s_{t})} \hat{A}_{t},\operatorname{clip}\left(\frac{\pi_{\theta}(a_{t}|s_{t})}{\pi_{ \theta_{\mathrm{old}}}(a_{t}|s_{t})},1-\epsilon,1+\epsilon\right)\hat{A}_{t} \right)\right], \tag{15}\] where \(\frac{\pi_{\theta}(a_{t}|s_{t})}{\pi_{\theta_{\mathrm{old}}}(a_{t}|s_{t})}\) is the ratio of the new policy's probability over the old policy's probability and \(\epsilon\) is a hyperparameter that determines how much the new policy can deviate from the old policy. The \(\operatorname{clip}\) function limits the value of \(\pi_{\theta_{\mathrm{old}}}(a_{t}|s_{t})\) between \((1-\epsilon,1+\epsilon)\). The clipping acts as a regularizer, limiting the extent to which the policy can change drastically from one iteration to the next. Preventing overly large policy updates ensures the learning process's robustness while maintaining more sample-efficient learning than vanilla policy gradient methods. Value Function Estimation.In PPO algorithm, the critic model, often referred to as the value function, estimates the expected returns for each state. The learning objective of this model is to minimize the discrepancy between its predicted values and the actual return values. The loss function of the critic model is commonly defined using Mean Squared Error (MSE), given by the following formula: \[\mathcal{L}_{\mathrm{critic}}(\phi)=\hat{\mathbb{E}}_{t}\left[\|V_{\phi}(s_{t} )-\hat{R}_{t}\|^{2}\right]. \tag{16}\] Here, \(V_{\phi}(s_{t})\) represents the critic model's predicted value for state \(s_{t}\) with parameters \(\phi\), and \(\hat{R}_{t}\) represents the actual return value for state \(s_{t}\) and always can be estimated as: \(\hat{R}_{t}=\sum_{l=0}^{\infty}\gamma^{l}r_{t+l}\). Mixing Pretraining Gradients.To mitigate potential degradation in the model's language skills and knowledge retention during PPO, we also explore the incorporation of pretraining data into the RL phase. The models utilizing this method are denoted as "PPO-ptx", a combined objective function is shown as follows [16]: \[\mathcal{L}_{\mathrm{ppo-ptx}}(\theta)=\mathcal{L}_{\mathrm{ppo-clip}}(\theta )+\lambda_{\mathrm{ptx}}\mathbb{E}_{x\sim\mathcal{D}_{\mathrm{pretrain}}} \left[\log(\pi_{\theta}^{\mathrm{RL}}(x))\right], \tag{17}\] where \(\lambda_{\mathrm{ptx}}\) is the pretraining loss coefficient and \(\mathcal{D}_{\mathrm{pretrain}}\) is the pretraining data distribution. ## 4 Reward Modeling for Helpfulness and Harmlessness Reward model is trained to reflect the preference of human. Theoretically, we can directly fine-tune the model using Reinforcement Learning and human annotations. While due to constraints in workload and time availability, it is unfeasible for humans to provide sufficient feedback for training before each optimization iteration. Therefore, a more effective way involves training a reward model (RM), which aims to emulate the evaluation process performed by humans. In this section, we first cover the technical details of RM, then show the RM performance we used, and attach the performance changes during training. ### Models and Datasets For English, we start with the original LLaMA-7B[1] which is of the decoder-only architecture. We use 160k pairwise samples of the HH-RLHF dataset[17] which consists of 118k helpful and 42k harmless instances as training set. From the remaining 8.5k data, we randomly selected approximately 0.7k helpful and 0.3k harmless examples for a total of 1k data as the test set, and the rest is used as the validation set during training. For Chinese, we use the OpenChineseLLaMA [18]. It is developed through incremental pre-training on Chinese datasets, building upon the foundation of LLaMA-7B, which significantly improves its understanding and generation abilities on Chinese. We hired professional annotators to manually label 39k pairwise samples including 31k helpful and 8k harmless samples. We constructed the training set by randomly sampling 24k helpful and 6k harmless instances, and then we allocated 2.4k helpful and 0.6k harmless samples from the remaining data at random to form the test set. The rest is used for validation. ### Training Setup This section introduces the training implementations for the RM. The learning rate is set to 5e-6 with a warmup over the first 10% steps. We use a dynamic batch method instead of a fixed value, which balances the number of tokens in each batch as much as possible for a more efficient and stable training phase. The batch size changes according to the number of tokens in a batch, with a maximum of 128 and a minimum of 4. We fixed the training step to \(1000\), approximately \(1.06\) epoch for the whole training set. We set \(\beta_{\mathrm{rm}}=1\), which represents LM loss weight to train our reward model for the entire experiment. ### HH Evaluation Results In this section, we present the HH evaluation results of our RM. We primarily analyze the trained reward model with the test set introduced in Sec. 4.1, which comprises of 0.9k samples of HH-RLHF for English and 3k samples sampled from the dataset labeled by annotators for Chinese. We feed the test input into our RM and get the reward value on the preferred and dispreferred responses respectively, and then subtract them to get the difference score. Figure 2 shows the distribution of the difference score. Both models exhibit a degree of alignment with human preferences, with the RM trained on Chinese data we construct by hiring annotators showing substantial consistency with human judgments. We examined several samples from the test dataset that displayed the most significant disparities between the model and human preferences. For the Chinese test data, we observed that for each pair the response that RM gave a higher reward was notably longer compared to the other which is preferred by human, although more or less involving fabricating facts and making false claims. In the case of English test data, we noticed that the model assigned lower scores to responses that acknowledged the lack of information, which were characterized by their honesty but lacked helpfulness. Conversely, those responses appeared to be correct and helpful, while containing deceptive information, misleading our RM into assigning high rewards. We provide such an example in Chinese and English respectively in Table 1. ### Training Performance In this section, we show the performance changes in the training process. Specifically, Figure 3 shows the trend of training loss of PM. We can see that the accuracy of RM trained on the Chinese dataset is higher than that of English because the Chinese dataset we constructed exhibits a significant disparity between the better and worse responses in most pairs. While many English pairs show similar levels of quality, which poses a greater challenge for RM to determine the superiority or inferiority of responses, resulting in model facing difficulty in modeling the differential features between the two responses. As a result, training and testing accuracy on the English dataset is expected to be lower. Besides, we find that the rate of improvement significantly slows down after 200 steps for both models, approximately equivalent to 0.2 epochs, the accuracy of which is comparable to that obtained after training for a complete epoch. However, when utilizing the 200-step model as the initialization for PPO, we observe unsatisfactory performance. Thus, accuracy alone is insufficient as a criterion for the RM. ## 5 Exploration of PPO Proximal Policy Optimization (PPO) [34] is the core algorithm to achieve alignment with human preferences. The performance of PPO is influenced by multiple factors in practical applications. Some prior works have summarized possible tricks that may be necessary and effective in the field of reinforcement learning [35], but how to stabilize RLHF training with language models remains unknown. We expect to explore which tricks are critical, and which metrics can reflect the model Figure 2: Histograms of the RM predictions for the HH evaluations. The left figure shows the score distribution for a PM trained on manually labeled Chinese data, while the right one shows that of HH-RLHF data. Both models roughly align with human preferences, especially the RM trained on Chinese data. state during and after RLHF training. We first introduce the metrics that are instructive in the training process, and then the training trajectories and effects under different implementations to reveal core tricks in RLHF. We use PPO-max to denote the most suitable implementation we find for the language model. ### Models and Training Setup The training implementations for the preference model (PM) and PM dataset are introduced in Sec. 4. In this section, we introduce the models' initialisation and the hyper-parameter details in exploring PPO. We verified a number of methods in reinforcement learning to ensure stable convergence and \begin{table} \begin{tabular}{l} \hline \hline **Human Prompt:**\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\)\(\exists\exists\)\(\exists\) better results for PPO training phase. To improve the experimental efficiency, these experiments are mainly conducted on a randomly selected subset of our Chinese data and will not be trained to optimal results when we have observed enough information to analyze the comparison methods. As shown in Sec. 3, four models need to be loaded during the ppo training phase. For reference model and policy model, we initialize both models from a 7B SFT model. The SFT model is applied to supervised fine-tuning for 2 epochs based on OpenChineseLLaMA on 1M filtered instruction data (containing 400K single-round instruction samples and 600K multi-turn instruction samples). We set a learning rate of 9.5e-6 and a consume learning rate schedule. The learning rate eventually decays to 10% of the peak learning rate. The global batch size is set to 1024. We use the reward model to initialize the critic model and reward model. We train the models on a manually constructed HH dataset containing 8k harmless queries and 20k helpful queries and we fix the number of steps instead of the number of epochs. In all experiments, we set a batch size of 128 for sampling from the environment and a batch size of 32 for training policy model and critic model. The learning rate of policy model and critic model is set to 5e-7 and 1.65e-6 with a warmup over the first 10% steps, respectively. All of the experiments are conducted on identically implemented machines. Each machine contains eight 80G A100 GPUs, 1TB of RAM, and 128 CPUs. We use ZERO2 and gradient checkpoint to save on GPU memory cost in the training phase. ### Evaluation Metrics for Monitor Training Process We expect to identify some metrics that reflect the quality of PPO training, this contributes to tracking the helpful, honest, and harmless capability of policy models without resorting to manual (or GPT-4) evaluation. We found it challenging to accurately distinguish the merits of two models with similar abilities. But it is indeed feasible to observe training stability and promptly identify serious deviations. Various metric curves when continuously optimizing policy model with vanilla PPO implementation are shown in Figure 4. We first introduce the pattern collapse phenomenon in vanilla PPO training, which means that SFT models are over-optimized and exhibit highly biased behavior. A reasonable policy model is expected to be consistent with human preferences in the distribution of dialogue variety in the real world (e.g., data not seen in training the reward model). However, we observe that the trained policy model has a tendency to cheat the reward model through specific patterns for anomalous higher scores. The training trajectories on reward score and training loss of vanilla PPO are illustrated at the top of Figure 4: **(Top) We show the response reward and training loss under vanilla PPO implementation. The red line in the first sub-figure shows the win rate of policy model response compared to SFT model response. (Bottom) Informative metrics for the collapse problem in PPO training, we observe significant variation in these metrics when there was a misalign between the human evaluation results and reward scores.** Figure 4. We observed stable convergence processes in training loss, but higher rewards do not reflect better policy behaviors from the perspective of human and GPT-4 evaluation. This means that the reward scores and training losses do not indicate whether the PPO is optimizing correctly. In vanilla PPO training, the response rewards of policy model gradually deviate from the original distribution and exhibit long-tail characteristics. We show the distribution of response rewards under different training steps in the Appendix A. An empirical strategy is to compare the training process of good and bad policy models to find suitable metrics. We show more indicative training metrics at the bottom of Figure 4, including perplexity, KL divergence between the policy and reference models, and the average length of generation responses. Previous work proposed an approximate linear relationship between the root KL and PM scores [17], but for smaller models, such an association appeared to be weak. We find the model response falls into the OOD region of preference model when the original policy is over-optimized. We will further discuss this scaling effects in the next section. We simultaneously observe that the collapsed model uniformly delivers longer responses and exhibits lower perplexity for such generative patterns. We use these metrics to show the importance of different tricks and their impact on PPO training in section 5.3. ### Implement Details in PPO We propose the instability and pattern collapse problem of the primitive PPO algorithm in sec 5.2. Such sensitivity derives from the over-optimization of the policy model which traps it into fixed generative patterns. Recent works have explored the implementation details of PPO algorithms in different scenarios. However, the application scenarios and data structures of traditional RL are quite different from RLHF. We determined to verify the applicability of these tricks in language model training and propose a set of PPO implementations that support stable optimization. We mainly focus on methods that efficiently assist PPO training and their parameter sensitivity in the body of this paper. Figure 5 illustrates numerous available tricks in PPO training, we first summarize the score reparameterization method (SS5.3.1), followed by the optimization constraints for policy model (SS5.3.2), and finally we present the different initialization methods for policy and critic models (SS5.3.3). More experiments on hyper-parameter tuning and tricks that are verified as less critical Figure 5: **Left** shows an equivalent structure to the RLHF framework in Figure 1. **Right** shows an implementation detail list for PPO. The number with circle indicates where this strategy is used in the PPO training. The pentagram indicates the method used by PPO-max. are discussed in the appendix, such as advantage estimation function and gradient clipping. In the following, it always refers to our own experiments when we mention PPO if not specifically stated. #### 5.3.1 Score Reparameterization We use the term "score" to refer to the two vital intermediate variables involved in PPO training. The reward score is given by the reward model trained with human preferences data, and the advantage score is calculated by the GAE function. According to existing works, reparameterizing these scores to a stable distribution (e.g., a standard normal distribution) may intensify the stability of PPO. The reported operations are into three parts for verification. We use \(\left\{r\left(x,y\right)\right\}\triangleq\left\{r_{n}\left(x,y\right)\right\} _{n=1}^{\mathcal{B}}\) to denote a reward sequence in training, \(r_{n}\left(x,y\right)\) to denote the results of per-batch reward, \(\sigma(A)\) and \(\tilde{A}\) to denote the mean and standard deviation of variable \(A\). Comparative experiments with different tricks and hyperparameters are shown in Figure 6. **Reward Scaling** controls training fluctuations by scaling the rewards where the rewards are divided by the standard deviation of a rolling discounted sum. Based on the observation history, the reward for current state can be expressed as \(r_{n}\left(x,y\right)/\sigma(r\left(x,y\right))\). In contrast to the experimental results of Engstrom [29], we show that reward scaling doesn't guide proper policy optimization, and PPO exhibits consistent patterns in training trajectories with and without reward scaling. In our experiments, we believe that tighter constraints are required to ensure training stability. **Reward Normalization and Clipping** was first proposed by Mnih [36]. The processed reward can be denoted as: \[\tilde{r}\left(x,y\right)=\text{clip}\left(\frac{r_{n}\left(x,y\right)- \overline{r\left(x,y\right)}}{\sigma(r\left(x,y\right)},-\delta,\delta\right), \tag{18}\] Figure 6: We show the variation of training metrics when constraining the fluctuations of intermediate variables. \(\delta\) indicates the clipped range, the KL divergence indicates the optimization magnitude of policy model, and the perplexity indicates the uncertainty of policy model for current response. Scaling or clipping strategy for reward and advantage contributes to the training stability compared to vanilla PPO. Temporarily stable settings, such as reward normalize with \(\delta=0.3\), also exhibit consistent upward trends across metrics, which implies that pattern collapse problems likewise occur when training longer. where \(\delta\) denotes the clip region. It is generally believed In traditional RL that reward clip is ineffective or even detrimental in certain scenarios [29]. However, we find that strict advantage cropping can also maintain training stability within a fixed epoch. Interestingly, hyperparameter tuning does not affect the similarity of the different methods in the early training period, and models with larger clipping thresholds exhibit greater strategy alteration and converge to higher rewards in the latter half. As we mentioned earlier, this does not imply better performance in the manual evaluation. Determining the optimal clipping bound within a limited number of trials is challenging in view of such inconsistency between the reward model and manual evaluation results, we suggest adopting a relaxed clipping strategy and incorporating other tricks to constrain the policy optimization when training RLHF. **Advantages Normalization and Clipping** has similarities to the operation on reward, but differs in details that its normalization occurs only at the minibatch level. After calculating the advantage based on GAE, PPO normalizes the advantage value by subtracting its mean and dividing it by its standard deviation. Andrychowicz [28] first attempt to apply Advantages Normalization in gaming domain and reported that this trick didn't exhibit significant improvements. Although parameter selection for advantage clipping would be more sensitive and difficult, we instead find that a severe constraint on advantage can provide similar effects to reward clip in PPO training. Considering that different score reparameterization operations theoretically provide similar effects on PPO training, we recommend constraining the instability of policy optimization on the reward level. Experiments on the simultaneous application of reward, advantage, or value clipping operations are shown in Appendix B.1. #### 5.3.2 Policy Constraints To tackle the over-optimization problem on the policy model, an intuitive solution is to constrain the policy optimization to a limited range. We validate various existing tricks to control the update of generation policy, such constraints are empirically proved to be necessary for longer training Figure 7: Training dynamics when using different methods to constrain the policy optimization. We show that all modifications can induce convergence, but only a penalty of the policy entropy or KL divergence can provide a long-lasting stable optimization. It is worth noting that all methods ( including those shown in Sec 5.3.1) exhibit consistent variation in response length and perplexity in the early training period, which may imply some bias in the reward model preference. procedures. Figure. 7 shows the influence of different constraint methods and hyperparameters on policy optimization. **Token Level KL-Penalty** constrains the policy optimization by applying a regularization term to reward that is proportional to the KL-divergence of current and original policy distributions. This approach was first introduced by Stiennon [25] and widely adopted in different RLHF implementations. Given a template-response pair \((x,y)\), we treat the logits distribution of the token output as a sampling of the policy distribution and apply an empirically estimated KL-penalty sequence to response reward, the total reward with KL-penalty can be denoted as: \[r_{\mathrm{total}}(x,y_{i})=r(x,y_{i})-\eta\mathrm{KL}(\pi_{\theta}^{\mathrm{ RL}}(y_{i}|x),\pi^{\mathrm{SFT}}(y_{i}|x)), \tag{19}\] where \(\pi_{\theta}^{\mathrm{RL}}(y_{i}|x)\) denotes the action space of \(i-\mathrm{th}\) repose token, and \(\eta\) is a hyper-parameter. Anthropic [17] used a small weight to balance the ratio of reward and KL-penalty in PPO training (\(0.001\)), and they did not find significant effects of the above operation on RL training. Instead, we find this constraint critical to the stability of PPO and allow further scaling up on the training step. Results with policy divergence penalty are illustrated in Figure 7 by setting lambda to 0.05, and there is a significant difference to the method in Figure 6 with a noticeable correction in the later training period. Interestingly, we show that RLHF is able to significantly improve the response quality while barely modifying the language modeling (exhibiting an almost zero KL divergence from the original policy). More experiments on the impact of different constraint values are shown in appendix B.2 **Importance Sampling** in PPO aims to rectify the policy divergence between the historical generative model and current model when optimizing policy model with responses in the experience buffer. EasyRL [37] argues that an oversized buffer would induce a wrong estimation of the advantage of the current policy, which impairs the stability of the policy optimization. We revalidated this hypothesis by directly fixing the policy distribution to observations of reference model, which is equivalent to having an infinite experience buffer in the training process. We find this setup doesn't have as severe impacts as expected, and only exhibits fluctuations in the later stage of training. We additionally investigate the cooperative effect of this setup with KL penalties in view that they share similar controls on PPO. Experimental results indicate that this implementation further stabilizes PPO training, but compromises the final performance of the policy model. **Entropy Bonus** provides a reference model-independent constraint on PPO training. There is controversy in past research about whether this method is effective in different scenarios. Mnih [36] reported that entropy bonus could enhance exploration by encouraging policy models to generate more diverse actions, while others did not find clear evidence that such operations help [28]. We claim that these views can coexist as configurations regarding entropy bonus exhibit vast sensitivity on parameter selection and code implementation. A comparison of successful and failed experiments is presented in appendix B.3. With correct configurations, we did not find an obvious advantage of this trick relative to KL-penalty. We, therefore, recommend the latter instead of directly constraining the diversity of the strategy space. #### 5.3.3 Pretrained Initialization A common setting is to initialize the policy and critic model over the existing reference model and reward model in RLHF. Such initialization is quite rare in past research scenarios and its impact on PPO training is still unexplored. We investigated different initialization methods at the early stage of training, expecting to uncover the requirements of RLHF for the trained model capabilities. The training discrepancy induced by different initialization methods is shown in Figure 8. The initialization of the critic model did not significantly affect the convergence or fluctuation of the PPO and only varied the numerical stability at the early stage of optimization. In contrast, a policy model initialized without SFT training is clearly incapable in PPO training, which indicates that the construction of a supervised policy model is indispensable in RLHF. Critic Model InitializationWe first discuss the influence of different critic model initialization on PPO training. An observation is that the critic model requires giving feedback to each step in the decision sequence, and introduces a gap between this task requirement and directly scoring response, which makes it a less-than-perfect choice to initialize the critic model with the reward model. We explore this issue by applying a different initialization. Considering that providing correct score feedback for a single action requires the model to have basic language modeling capability, we design two scenarios to vary the consistency between the critic model initialization and its training objective: (1) Initialize the critic model with our SFT model and randomly initialize its reward head. (2) Optimize only the reward model until the loss of value prediction function approaches zero. We show the training dynamics of this setup starting from the optimization policy model in Figure 8. Based on the experimental results, we believe the critic model pre-training helps to improve the training stability by providing better advantage estimation. Initializing the critic model with a reward or SFT model will converge to similar results, implying that PPO can adaptively provide the capability to fit the advantage function. Intuitively, fluctuations in the early training period imply that the model is focusing on optimizing the critic model and does not have a consistent optimization direction in terms of generation policies. We recommend replacing the learning rate warmup with the critic model pre-training as a generic initialization strategy. Policy Model InitializationAn interesting question is whether we need to supervise fine-tuning our pre-train model before PPO, we wondered about the feasibility of directly enabling language models to interact with humans through policy optimization. Unfortunately, such attempts failed and we observed a severe reduction in language modeling ability in the training results, which implies that a qualified dialogue model is essential for underlying PPO training. Furthermore, we notice that the train model response obtains lower rewards relative to the policy model after SFT, which may provide circumstantial evidence for the effectiveness of using human preference data to directly fine-tune the model for alignment. ### PPO-max Setup We now describe our training implementations in the PPO-max algorithm. Based on the discussion and validation in Sec 5.3, we selected the most effective strategy for each component of PPO. We normalize and clip the current group of rewards based on historical mean and variance records, and subsequently add a KL-penalty term to constrain the policy optimization. In the model loading phase, Figure 8: We show the necessity regarding supervised fine-tuning (SFT) of the policy model and the non-necessity regarding specific initialization of critic model. In the subfigure about KL-divergence and perplexity, the right axis represents the result under initiating policy model without SFT. It’s a reduction to RLHF process when initializing the critic model with SFT model or omitting the fine-tuning process on policy model, we experiment with these changes on the basis of PPO-max. Pre-training the critic model introduced additional processing to PPO and provides more stable optimization. we initialize the critic model with our reward model and pre-train it before applying PPO formally. We use global gradient clipping and set a small size of the experience buffer. To reduce alignment tax, we add pre-train language model loss in policy optimization as InstructGPT [16] and simultaneously clip the value function loss. More detailed settings can be found in our open-source code. We show the complete training dynamics of PPO-max in Figure 9. ## 6 Evaluations and Discussions In this section, we provide a detailed analysis of the advantages of the RLHF models over the SFT models. These advantages are evident not only in the direct comparison between RLHF and SFT models but also in their performance gap when facing ChatGPT. ### Alignment Metrics and Experiment Setups Alignment is a vague and confusing topic that is intractable to evaluate. In the context of our paper, we endeavor to align models with human intentions. To be more specific, we define models to act as being helpful and harmless similar to [27]. **Helpfulness** means the model should follow instructions; it must not only follow instructions but also deduce the intent from a few-shot prompt or another interpretable pattern. However, the intention behind a given prompt can often be unclear or ambiguous, which is why we depend on our annotators' judgment, and their preference ratings constitute our primary metric. **Harmlessness** is also challenging to measure. The extent of damage caused by language models usually depends on how their outputs are utilized in the real world. For instance, a model that generates toxic outputs could be harmful in a deployed chatbot but could also be beneficial if used for data augmentation to train a more precise toxicity detection model. As a result, we employ more precise proxy criteria to capture various aspects of a deployed model's behavior that can be helpful or harmful. In order to compare the RLHF models with baseline models, we generate a single response for each test prompt and task human annotators by comparing the responses from different models and labeling their preferences. We repeat this experiment multiple times using GPT-4 as the annotator and consistently obtain agreement levels between the evaluations. Figure 9: 10K steps training dynamics of PPO-max. PPO-max ensures long-term stable policy optimization for the model. Baseline.We employ several baselines for comparison, including two SFT models trained on LLaMA and OpenChineseLAMA datasets. These SFT models are trained on Chinese and English datasets, respectively. Additionally, we derive two RLHF models using PPO-max from these two types of SFT models 3 We also compare our models with OpenAI's ChatGPT 4 (gpt-3.5-turbo-0613), an excellent language model tuned with RLHF. Footnote 3: We differentiate between two language models, one trained on English text (‘en’) and the other on Chinese text (‘zh’). Footnote 4: [https://platform.openai.com/docs/models](https://platform.openai.com/docs/models) Generation.We generate a single response for each prompt using nucleus sampling [30] with a probability threshold of \(p=0.9\) and a temperature of \(\tau=0.8\) for each baseline model. To avoid repetitive responses, we apply a repetition penalty [38] with a hyperparameter of \(\beta=1.1\) based on previously generated tokens. Additionally, we set the maximum token length to \(2048\). ### Preference Comparison between RLHF models and SFT models Human evaluation is known to be both time-consuming and costly, yet it remains crucial for obtaining human-aligned assessments and serving as a reliable foundation for comprehensive evaluation. Following a similar approach as InstructGPT [16], our primary metric for evaluation is based on human preference ratings derived from a held-out set of prompts. It is important to note that we only select prompts that have not been included in the training process, ensuring unbiased evaluation. Furthermore, incorporating the expertise of GPT-4, the most powerful model to date, to compare responses from different chatbots offers valuable insights and enhances the evaluation process. This approach aligns with the findings of studies such as AlpacaFarm [39] and LLM-as-a-judge [40], which suggest that end-to-end automation evaluation can provide a relatively fair assessment when compared to human preferences. Therefore, in this paper, we follow a similar evaluation method in LLM-as-a-judge [40] and supplement the overall evaluation process with GPT-4. Human Evaluation.Our annotators consistently expressed a strong preference for the outputs of RLHF-trained models across all question types in both Chinese and English, as illustrated in Figure 10. Specifically, the RLHF model on the English dataset exhibits significant advantages on the Harmless held-out dataset, receiving a rating of \(62\%\) compared to \(5\%\) for the SFT model. These findings indicate that the RLHF model substantially enhances its ability to address a wide range of issues, including personal privacy, political sensitivity, and the handling of toxic and biased prompts within minority communities and ethnic groups. Additionally, there is a slight improvement observed in the Helpful held-out dataset, with a rating of \(44\%\) compared to \(30\%\) for the SFT model, suggesting that the SFT model can also benefit from optimization via RLHF. We have also demonstrated that our RLHF model enhances the performance of the SFT model on both the Helpful and Harmless datasets in the Chinese domain. This showcases the substantial potential of PPO-max in the RLHF phrase. Figure 10: Preference evaluations, compared RLHF models with SFT models in human evaluation (left) and GPT-4 evaluation (right). GPT-4 as a Judge.While GPT-4 may not be a perfect evaluator, we can observe some similarities between its results and human evaluations. In our GPT-4 evaluation setting, the results closely mirror those of human evaluation, as depicted in the right sub-figure of Figure 10. When assessing harmful prompts, the RLHF model trained on the English dataset continues to demonstrate significant advantages in the Harmless dataset, despite GPT-4 producing more tie votes than human evaluators. This trend is also apparent in the Chinese Harmless evaluation. Notably, Figure 10 highlights a substantial improvement in the RLHF model, particularly in helpful datasets, compared to evaluations based on human preferences. ### Our Models vs. ChatGPT on Harmless Evaluation In this part, we conduct a comparison between our model and one of the most popular existing models, ChatGPT. Our objective was to showcase the advantages of the RLHF model when facing a more formidable opponent, rather than aiming to surpass ChatGPT. To achieve this, we select the "harmless" capability as our comparative metric, and we employ GPT-4 for automated evaluations. Mitigating Defeats to ChatGPT.Figure 11 provides evidence that our RLHF models still lag behind OpenAI's ChatGPT. However, we observe significant improvements in our RLHF models compared to the SFT models, particularly in mitigating losses when facing ChatGPT. Specifically, the RLHF model trained on English text managed to decrease the defeat rate from \(45\%\) to \(24\%\). Similarly, the RLHF model trained on Chinese text achieved a reduction in the defeat rate from \(37\%\) to \(29\%\). While surpassing ChatGPT's performance remains a challenging task, it is noteworthy that the RLHF models were able to compete on par with ChatGPT on certain prompts where the SFT models previously failed. This indicates that the RLHF approach enhances the models' ability to generate more effective responses and bridge the gap between their performance and that of ChatGPT. ### Language Understanding Evaluation To examine the potential decline in Natural language understanding (NLU) abilities resulting from finetuning models using PPO, we conduct tests on Chinese RLHF model using the C-Eval5, which is a comprehensive Chinese evaluation suite for foundation models. It consists of approximately \(13k\) multi-choice questions spanning \(52\) diverse disciplines and four difficulty levels. We primarily evaluate our models in the initial release, whose results are from few-shot prompting. Footnote 5: [https://github.com/SJTU-LIT/ceval](https://github.com/SJTU-LIT/ceval) The experimental results indicate a decrease in NLU capabilities after employing PPO. By incorporating pre-training data into the PPO training phase, PPO-ptx effectively alleviates the decline in NLU capabilities. The rationale behind this method was to leverage the knowledge acquired during pre-training and combine it with the reinforcement learning framework of PPO. Figure 11: Preference comparison on the “harmless” evaluation between our RLHF and SFT models versus ChatGPT (gpt-3.5-turbo-0613) reveals that the RLHF-trained models exhibit a significant reduction in the number of queries being outperformed by ChatGPT. ### Example Dialogues To provide a more intuitive demonstration of our model's dialogue abilities, we present some dialogue examples in Tables 2 and 3. It is evident that the RLHF-trained model generates responses with a higher level of informational content compared to the SFT model. These responses effectively assist in addressing user prompts. Moreover, the SFT model demonstrates a basic ability to identify harmful prompts, but it still remains susceptible to producing harmful outputs when prompted accordingly. In contrast, the RLHF model exhibits superior judgment when it comes to harmful content and is less prone to inducements, displaying a higher degree of coherency. More dialogue examples are presented in the appendix C.4. ## Limitations Exploring RLHF is indeed a valuable but lonely direction, and we are glad that the core backbone of the laboratory can firmly explore an uncertain direction. Moreover, in the past few months, everyone has been so full of passion and motivation. RLHF not only allows the models to achieve human alignment, but also seems to align everyone's will. A thousand mile journey begins with the first step. Although we have taken the first step in RLHF, due to time and resource constraints, this work still has the following limitations: Scaling Law.While our study primarily focuses on a 7-billion-parameter model, we have yet to investigate the impact of model size and data scale on the performance of RLHF. Reward Model.Our experiments are based on openly available English human preference datasets and a small amount of self-constructed Chinese data. The quality and quantity of the data we have at our disposal are arguably not sufficient for a comprehensive evaluation of the reward model. Evaluation Metric.Our evaluation criteria largely rely on manual evaluations and GPT-4 automated evaluations. We have not utilized numerous available benchmarks and NLP tasks to conduct a detailed assessment of our models. Performance Indicator.Our focus during the PPO phase is more geared towards achieving stability rather than enhancing the final performance. While stability is crucial, it does not necessarily guarantee improved outcomes. Additionally, the reward score cannot reliably serve as an indicator for predicting RLHF performance during the training phase. It implies that a more suitable performance indicator during the training phase needs to be sought. Figure 12: The bar chart displays the results of C-eval for SFT, PPO-max, and PPO-ptx respectively. The result demonstrates that PPO-ptx mitigates the decline in language understanding capabilities caused by PPO.

2303.16897

Physics-Driven Diffusion Models for Impact Sound Synthesis from Videos

Modeling sounds emitted from physical object interactions is critical for immersive perceptual experiences in real and virtual worlds. Traditional methods of impact sound synthesis use physics simulation to obtain a set of physics parameters that could represent and synthesize the sound. However, they require fine details of both the object geometries and impact locations, which are rarely available in the real world and can not be applied to synthesize impact sounds from common videos. On the other hand, existing video-driven deep learning-based approaches could only capture the weak correspondence between visual content and impact sounds since they lack of physics knowledge. In this work, we propose a physics-driven diffusion model that can synthesize high-fidelity impact sound for a silent video clip. In addition to the video content, we propose to use additional physics priors to guide the impact sound synthesis procedure. The physics priors include both physics parameters that are directly estimated from noisy real-world impact sound examples without sophisticated setup and learned residual parameters that interpret the sound environment via neural networks. We further implement a novel diffusion model with specific training and inference strategies to combine physics priors and visual information for impact sound synthesis. Experimental results show that our model outperforms several existing systems in generating realistic impact sounds. More importantly, the physics-based representations are fully interpretable and transparent, thus enabling us to perform sound editing flexibly.

Kun Su, Kaizhi Qian, Eli Shlizerman, Antonio Torralba, Chuang Gan

2023-03-29T17:59:53Z

http://arxiv.org/abs/2303.16897v3

# Physics-Driven Diffusion Models for Impact Sound Synthesis from Videos ###### Abstract Modeling sounds emitted from physical object interactions is critical for immersive perceptual experiences in real and virtual worlds. Traditional methods of impact sound synthesis use physics simulation to obtain a set of physics parameters that could represent and synthesize the sound. However, they require fine details of both the object geometries and impact locations, which are rarely available in the real world and can not be applied to synthesize impact sounds from common videos. On the other hand, existing video-driven deep learning-based approaches could only capture the weak correspondence between visual content and impact sounds since they lack of physics knowledge. In this work, we propose a physics-driven diffusion model that can synthesize high-fidelity impact sound for a silent video clip. In addition to the video content, we propose to use additional physics priors to guide the impact sound synthesis procedure. The physics priors include both physics parameters that are directly estimated from noisy real-world impact sound examples without sophisticated setup and learned residual parameters that interpret the sound environment via neural networks. We further implement a novel diffusion model with specific training and inference strategies to combine physics priors and visual information for impact sound synthesis. Experimental results show that our model outperforms several existing systems in generating realistic impact sounds. Lastly, the physics-based representations are fully interpretable and transparent, thus allowing us to perform sound editing flexibly. We encourage the readers visit our project page 1 to watch demo videos with the audio turned on to experience the result. Footnote 1: [https://sukun1045.github.io/video-physics-sound-diffusion/](https://sukun1045.github.io/video-physics-sound-diffusion/) ## 1 Introduction Automatic sound effect production has become demanding for virtual reality, video games, animation, and movies. Traditional movie production heavily relies on talented Foley artists to record many sound samples in advance and manually perform laborious editing to fit the recorded sounds to visual content. Though we could obtain a satisfactory sound experience at the cinema, it is labor-intensive and challenging to scale up the sound effects generation of various complex physical interactions. Recently, much progress has been made in automatic sound synthesis, which can be divided into two main categories. The first category is physics-based modal synthesis methods [37, 38, 51], which are often used for simulating sounds triggered by various types of object interactions. Although the synthesized sounds can reflect the differences between various interactions and the geometry property of the objects, such approaches require a sophisticated designed environment to perform physics simulation and compute a set of physics parameters for sound synthesis. It is, therefore, impractical to scale up for a complicated scene because of the time-consuming parameter selection procedure. On the other hand, due to the availability of a significant amount of impact sound videos in the wild, training deep learning models for impact sound synthesis turns out to be a promising direction. Indeed, several works have shown promising results in various audio-visual applications [65]. Unfortunately, most existing video-driven neural sound synthesis methods [7, 64] apply end-to-end black box model training and lack of physics knowledge which plays a significant role in modeling impact sound because a minor change in the impact location could exert a significant difference in the sound generation process. As a result, these methods are prone to learning an average or smooth audio representation that contains artifacts, which usually leads to generating Figure 1: The physics-driven diffusion model takes physics priors and video input as conditions to synthesize high-fidelity impact sound. Please also see the supplementary video and materials with sample results. unfaithful sound. In this work, we aim to address the problem of automatic impact sound synthesis from video input. The main challenge for the learning-based approach is the weak correspondence between visual and audio domains since the impact sounds are sensitive to the undergoing physics. Without further physics knowledge, generating high-fidelity impact sounds from videos alone is insufficient. Motivated by physics-based sound synthesis methods using a set of physics mode parameters to represent and re-synthesize impact sounds, we design a physics prior that could contain sufficient physics information to serve as a conditional signal to guide the deep generative model synthesizes impact sounds from videos. However, since we could not perform physics simulation on raw video data to acquire precise physics parameters, we explored estimating and predicting physics priors from sounds in videos. We found that such physics priors significantly improve the quality of synthesized impact sounds. For deep generative models, recent successes in image generation such as DALL-E 2 and Imagen [45] show that Denoising Diffusion Probabilistic Models (DDPM) outperform GANs in terms of fidelity and diversity, and its training process is usually with less instability and mode collapse issues. While the idea of the denoising process is naturally fitted with sound signals, it is unclear how video input and physics priors could jointly condition the DDPM and synthesize impact sounds. To address all these challenges, we propose a novel system for impact sound synthesis from videos. The system includes two main stages. In the first stage, we encode physics knowledge of the sound using physics priors, including estimated physical parameters using signal processing techniques and learned residual parameters interpreting the sound environment via neural networks. In the second stage, we formulate and design a DDPM model conditioned on visual input and physics priors to generate a spectrogram of impact sounds. Since the physics priors are extracted from the audio samples, they become unavailable at the inference stage. To solve this problem, we propose a novel inference pipeline to use test video features to query a physics latent feature from the training set as guidance to synthesize impact sounds on unseen videos. Since the video input is unseen, we can still generate novel impact sounds from the diffusion model even if we reuse the training set's physics knowledge. In summary, our main contributions to this work are: * We propose novel physics priors to provide physics knowledge to impact sound synthesis, including estimated physics parameters from raw audio and learned residual parameters approximating the sound environment. * We design a physics-driven diffusion model with different training and inference pipeline for impact sound synthesis from videos. To the best of our knowledge, we are the first work to synthesize impact sounds from videos using the diffusion model. * Our approach outperforms existing methods on both quantitative and qualitative metrics for impact sound synthesis. The transparent and interpretable properties of physics priors unlock the possibility of interesting sound editing applications such as controllable impact sound synthesis. ## 2 Related Work ### Sound Synthesis from Videos Sound synthesis has been an ongoing research theme with a long history in audio research. Traditional approaches mainly use linear modal synthesis to generate rigid body sounds [51]. While such methods could produce sounds reflecting the properties of impact sound objects such as the geometry difference, it is often the case that the simulation and engineering tuning on the initial parameters for the virtual sounding materials in the modal analysis is time-consuming and non-intuitive. Suppose we are under a complicated scene consisting of many different sounding materials; the traditional approach can quickly become prohibitively expensive and tedious [42]. In recent years, deep learning approaches have been developed for sound synthesis. Owens et al. [39] investigated predicting the sound emitted by interacting in the wild objects using a wood drumstick. However, instead of directly using LSTM to generate sound, they first predict sound features and then performed an exemplar-based retrieval algorithm. Instead of performing retrieval, our work directly generates the impact sounds. In addition to impact sound, a conditional generative adversarial network is proposed for cross-modal generation on music performances collected in a lab environment by Chen et al. [5]. Moreover, natural sounds are explored by Zhou et al. [64] who introduced a SampleRNN-based method to directly predict audio waveform from Youtube videos data but the number of sound categories is limited to ten. Next, several works attempt to generate aligned audio to input videos via a perceptual loss [4] and information bottleneck [7]. More recently, music generation from visual input has also achieved various attentions [49, 10, 48]. ### Audio-visual learning In recent years, methods for multi-modality learning have shown significance in learning joint representation for downstream tasks [41], and unlocked novel cross-modal applications such as visual captioning [30, 60], visual question answering (VQA) [55, 8], vision language navigation [1], spoken question answering (SQA) [56, 6], healthcare AI [57, 58, 31, 59], etc. In this work, we are in the field of audio-visual learning, which deals with exploring and leveraging both audio and video correlation at the same time. For example, earlier work from Owens et al. [40] tried using clustered sound to learn visual representations from unla beled video data, and similarly, Aytar et al. [3] leveraged the scene to learn the audio representations. Later, [2] investigated audio-visual joint learning the visual by training a visual-audio correspondence task. More recently, several works have also explored sound source localization in images or videos in addition to the audio-visual representations [19, 23, 46]. Such works include a lot of applications such as biometric matching [35], visually-guided sound source separation [11, 53, 62, 15], understanding physical scene via multi-modal [12], auditory vehicle tracking [14], multi-modal action recognition [32, 16, 33], audio-visual event localization [50], audio-visual co-segmentation [44], audio inpainting [63], and audio-visual embodied navigation [13]. ### Diffusion Model The recently explored diffusion probabilistic models (DPMs) [47] have served as a powerful generative backbone that achieves promising results in various generative applications [20, 21, 25, 34, 36, 9, 26], outperforming GANs in terms of fidelity and diversity. More intriguing, the training process is usually with less instability and mode collapse issues. Compared to the unconditional case, conditional generation is usually applied in more concrete and practical cross-modality scenarios. Most existing DPM-based conditional synthesis works [9, 18] learn the connection between the conditioning and the generated data implicitly by adding a prior to the variational lower bound. Most of these methods focus on the image domain, while audio data differs in its long-term temporal dependencies. Several works have explored to use of diffusion models for text-to-speech (TTS) synthesis [24, 22]. Unlike the task of text-to-speech synthesis, which contains a strong correlation between phonemes and speech, the correspondences between impact sounds and videos are weak. Therefore it is non-trivial to directly apply a conditional diffusion model to impact sound synthesis from videos. In this work, we found that only video condition is insufficient to synthesize high-fidelity impact sounds and additionally apply physics priors significantly improve the results. Moreover, due to the difficulty of predicting physics priors from video, we propose different training and testing strategies that could benefit the information of physics priors but also synthesize new impact sounds from the video input. ## 3 Method Our method includes two main components: (a) physics priors reconstruction from sound (shown in Fig. 2), and (b) a physics-driven diffusion model for impact sound synthesis (shown in Fig. 3). We first show how we can acquire physics priors from sounds In (a). Then in (b), we use reconstructed physics priors as additional information to the video input and guide the diffusion model to learn impact sound synthesis. Since no sound is available during the test time, we use different training and inference strategies to keep the benefit of physics priors and generate novel impact sounds. ### Reconstruct Physics Priors From Sound We aim to reconstruct physics from sound. There are two modules: \(1)\) the physics parameters estimation extracting modes parameters from audio waveform, and \(2)\) the residual parameters prediction learning to encode the environment information such as background noise and reverberation using neural networks. **Physics Parameters Estimation**. The standard linear modal synthesis technique is frequently used for modeling physics-based sound synthesis. The displacement \(x\) in such a system can be computed with a linear equation described as follows: \[M\ddot{x}+C\dot{x}+Kx=F, \tag{1}\] where \(F\) represents the force, \(M\) represents the mass, \(C\) represents the damping, and \(K\) represents the stiffness. With such a linear system, we can solve the generalized eigenvalue problem \(KU=\Lambda MU\) and decouple it into the following form: \[\ddot{q}+(\alpha I+\beta\Lambda)\dot{q}+\Lambda q=U^{T}F \tag{2}\] where \(\Lambda\) represents the diagonal matrix that contains eigenvalues of the system, \(U\) represents the eigenvectors which can transform \(x\) into the bases of decoupled deformation \(q\) by matrix multiplication \(x=Uq\). After solving the decoupled system, we will obtain a set of modes that can be simply expressed as damped sinusoidal waves. The \(i\)-th mode can be expressed by: \[q_{i}=p_{i}e^{-\lambda_{i}t}\sin(2\pi f_{i}t+\theta_{i}) \tag{3}\] where \(f_{i}\) is the frequency of the mode, \(\lambda_{i}\) is the decaying rate, \(p_{i}\) is the excited power, and \(\theta_{i}\) is the initial phase. It is also common to represent \(q_{i}\) under the decibel scale and we have \[q_{i}=10^{(p_{i}-\lambda_{i}t)/20}\sin(2\pi f_{i}t+\theta_{i}). \tag{4}\] The frequency, power, and decay rate together define the physics parameter feature \(\phi\) of mode \(i\): \(\phi=(f_{i},p_{i},\lambda_{i})\) and we ignore \(\theta_{i}\) since we assume the object is initially at rest and struck at \(t=0\) and therefore it is usually treated as zero in the estimation process [42]. Given a recorded audio waveform \(s\in\mathbb{R}^{T}\), from which we first estimate physics parameters including a set of damped sinusoids with constant frequencies, powers, and decay rates. We first compute the log-spectrogram magnitude \(S\in\mathbb{R}^{D\times N}\) of the audio by short-time-Fourier-transform (STFT), where \(D\) is the number of frequency bins and \(N\) is the number of frames. To capture sufficient physics parameters, we set the number of modes to be equal to the number of frequency bins. Within the range of each frequency bin, we identify the peak frequency \(f\) from the fast Fourier transform (FFT) magnitude result of the whole audio segment. Next, we extract the magnitude at the first frame in the spectrogram to be the initial power \(p\). Finally, we compute the decay time \(\lambda\) for the mode according to the temporal bin when it reaches the silence (\(-80\)dB). At this point, we obtain \(D\) modes physics parameters \(\{(f_{i},p_{i},\lambda_{i})\}_{i=1}^{D}\) and we can re-synthesize an audio waveform \(\hat{s}\) using equation 4. **Residual Parameters Prediction**. While the estimated modes capture most of the components of the impact sound generated by physical object interactions, the recorded audio in the wild has complicated residual components such as background noise and reverberation dependent on the sound environment which is critical for a real and immersive perceptual experience. Here we propose a learning-based approach to model such residual parameters. We approximate the sound environment component with exponentially decaying filtered noise. We first randomly generate a Gaussian white noise \(\mathcal{N}(0,1)\) signal and perform a band-pass filter (BPF) to split it into \(M\) bands. Then, for each band \(m\), the residual component is formulated as \[R_{m}=10^{(-\gamma t)/20}\text{BPF}(\mathcal{N}(0,1))_{m} \tag{5}\] The accumulated residual components \(R\) is a weighted sum of subband residual components \[R=\sum_{m=1}^{M}w_{m}R_{m}, \tag{6}\] where \(w_{m}\) is the weight coefficient of band \(m\) residual component. Given the log-spectrogram \(S\in\mathbb{R}^{D\times N}\) as input, we use a transformer-based encoder to encode each frame of the \(S\). The output features are then averaged and two linear projections are used to estimate \(\gamma\in\mathbb{R}^{M}\) and \(w\in\mathbb{R}^{M}\). We minimize the error between \(\hat{s}+R\) and \(s\) by a multi-resolution STFT loss \(L_{\text{me-stft}}(\hat{s}+R,s)\) which has been shown effective in modeling audio signals in the time domain [54]. By estimating physics parameters and predicting residual parameters, we obtain the physics priors and it is ready to be a useful condition to guide the impact sound synthesis model to generate high-fidelity sounds from videos. ### Physics-Driven Diffusion Models With the physics priors and video inputs, we propose a conditional Denoising Diffusion Probabilistic Model (DDPM) for impact sound synthesis. Our model performs a reverse diffusion process to guide the noise distribution to a spectrogram distribution corresponding to the input physics priors and video content. We encode all physics and residual parameters as a latent feature embedding with multi-layer perceptron (MLPs). The resulting physics latent vector is denoted by \(\mu\). For video inputs, given a sequence of RGB frames, we use temporal-shift-module (TSM) [29] to efficiently extract visual features, which are then average pooled to compute a single visual latent representation \(\nu\). We show our physics-driven diffusion model for sound synthesis in Fig. 3. The main component is a diffusion forward process that adds Gaussian noise \(\mathcal{N}(0,I)\) at time steps \(t=0,...,T\) to a spectrogram \(x\) with variance scale \(\beta\). We can use a scheduler to change the variance scale at each time step to have \(\beta_{1},\beta_{2},...,\beta_{T}\)[24]. We denote the spectrogram at diffusion time step \(t\) as \(x_{t}\). Given the spectrogram at time step \(t-1\) as \(x_{t-1}\), physics latent \(\mu\), and visual latent \(\nu\), the explicit diffusion process for spectrogram at time step \(t\) can Figure 2: Reconstruction of physics priors by two components: \(1)\) We estimate a set of physics parameters (frequency, power, and decay rate) via signal processing techniques. \(2)\) We predict residual parameters representing the environment by a transformer encoder. A reconstruction loss is applied to optimize all trainable modules. be written as \(q(x_{t}|x_{t-1},\mu,\nu)\). Since the complete diffusion process that takes \(x_{0}\) to \(x_{T}\) conditioned on \(\mu\) and \(\nu\) is a Markov process, we can factorize it into a sequence of multiplication \(\prod_{t=1}^{T}q(x_{t}|x_{t-1})\). To generate a spectrogram, we need the reverse process that aims to recover a spectrogram from Gaussian noise. The reverse process can be defined as the conditional distribution \(p_{\theta}(x_{0:T-1}|x_{T},\mu,\nu)\), and according to Markov chain property, it can be factorized into multiple transitions as follows: \[p_{\theta}(x_{0},...,x_{T-1}|x_{T},\mu,\nu)=\prod_{t=1}^{T}p_{\theta}(x_{t-1}| x_{t},\mu,\nu). \tag{7}\] Given the diffusion time-step with physics latent and visual latent conditions, a spectrogram is recovered from the latent variables by applying the reverse transitions \(p_{\theta}(x_{t-1}|x_{t},\mu,\nu)\). Considering the spectrogram distribution as \(q(x_{0}|\mu,\nu)\), we aim to maximize the log-likelihood of the spectrogram by learning a model distribution \(p_{\theta}(x_{0}|\mu,\nu)\) obtained from the reverse process to approximate \(q(x_{0}|\mu,\nu)\). Since it is common that \(p_{\theta}(x_{0}|\mu,\nu)\) is computationally intractable, we follow the parameterization trick in [20, 24] to calculate the variational lower bound of the log-likelihood. Specifically, the training objective of the diffusion model is L1 loss function between the noise \(\epsilon\sim\mathcal{N}(0,I)\) and the diffusion model output \(f_{\theta}\) described as follows: \[\min_{\theta}||\epsilon-f_{\theta}(h(x_{0},\epsilon),t,\mu,\nu)||_{1}, \tag{8}\] where \(h(x_{0},\epsilon)=\sqrt{\hat{\beta}_{t}}x_{0}+\sqrt{1-\hat{\beta}_{t}}\epsilon\), and \(\hat{\beta}_{t}=\prod_{t=1}^{t}1-\beta_{\overline{t}}\). ### Training and Inference During training, we use physics priors extracted from the audio waveform as an additional condition to guide the model to learning correspondence between video inputs and impact sounds. However, since the ground truth sound clip is unavailable during inference, we could not obtain the corresponding physics priors for the video input as we did in the training stage. Therefore, we propose a new inference pipeline to allow us to preserve the benefit of physics priors. To achieve this goal, we construct key-value pairs for visual and physics latents in our training sets. At the inference stage, we feed the testing video input and acquire the visual latent vector \(\nu^{\text{test}}\). We then take \(\nu^{\text{test}}\) as a query feature and find the key in training data by computing the Euclidean distance between the test video latent \(\nu^{\text{test}}_{i}\) and all training video latents \(\{\nu^{\text{train}}_{j}\}_{j=1}^{J}\). Given the key \(\nu^{\text{train}}_{i}\), we then use the value \(\mu^{\text{train}}_{j}\) as our test physics latent \(\hat{\mu}^{\text{test}}\). Once we have both visual latent \(\nu^{\text{test}}\) and physics latent \(\hat{\mu}^{\text{test}}\), the model reverses the noisy spectrogram by first predicting the added noise at each forward iteration to get model output \(f_{\theta}(x_{t},t,\hat{\mu}^{\text{test}},\nu^{\text{test}})\) and then removes the noise by the following: \[x_{t-1}=\frac{1}{\sqrt{1-\beta_{t}}}(x_{t}-\frac{\beta_{t}}{ \sqrt{1-\hat{\beta}_{t}}}f_{\theta}(x_{t},t,\hat{\mu}^{\text{test}},\nu^{ \text{test}}))+\eta_{t}\epsilon_{t}, \tag{9}\] where \(\hat{\beta}_{t}=\prod_{t=1}^{t}1-\beta_{\overline{t}}\), \(\epsilon_{t}\sim\mathcal{N}(0,I)\), \(\eta=\sigma\sqrt{\frac{1-\hat{\beta}_{t-1}}{1-\beta_{t}}\beta_{t}}\), and \(\sigma\) is a temperature scaling factor of the variance [24]. After iterative sampling over all of the time steps, we can obtain the final spectrogram distribution \(p_{\theta}(x_{0}|\hat{\mu}^{\text{test}},\nu^{\text{test}})\). It is worth noting that while we use the physics latent from the training set, we can still generate novel sound since the diffusion model also takes additional visual features as input. Figure 3: Overview of the physics-driven diffusion model for impact sound synthesis from videos. (left) During training, we reconstruct physics priors from audio samples and encode them into a physics latent. Besides, we use a visual encoder to extract visual latent from the video input. We apply these two latents as conditional inputs to the U-Net spectrogram denoiser. (right) During testing, we extract the visual latent from the test video and use it to query a physics latent from the key-value pairs of visual and physics latents in the training set. Finally, the physics and visual latents are used as conditional inputs to the denoiser and the denoiser iteratively generates the spectrogram. ## 4 Experiments ### Dataset To evaluate our physics-driven diffusion models and make comparison to other approaches, we use the _Greatest Hits_ dataset [39] in which people interact with physical objects by hitting and scratching materials with a drumstick, comprising 46,577 total actions in 977 videos. Human annotators labeled the actions with material labels and the time stamps of the impact sound. According to the dataset annotation assumption that the time between two consecutive object sounds is at least \(0.25\) second, we segment all audios into \(0.25\) second clips based on the data annotation for training and testing. We use the pre-defined train/test split for all experiments. ### Implementation Details We use Pytorch to implement all models in our method. For physics parameter estimation, all audio waveforms are in 44.1Khz and we compute log-scaled spectrograms with 2048 window size and 256 hop size, leading to a \(1025\times 44\) spectrogram for each impact sound. Then we estimate \(1025\) modes parameters from the spectrogram as described in the Sec 3.1. For residual parameter prediction, the transformer encoder is a 4-layer transformer encoder with 4 attention heads. The residual weights and decay rate dimensions are both \(100\). In the physics-driven diffusion model, we feed \(22\) video frames centered at the impact event to the video encoder which is a ResNet-50 model with TSM [29] to efficiently handle the temporal information. The physics encoder consists of five parallel MLPs which take each of physics priors as input and project into lower-dimension feature vectors. The outputs are concatenated together into a \(256\)-dim physics latent vector \(\mu\). The spectrogram denoiser is an Unet architecture, which is constructed as a spatial downsampling pass followed by a spatial upsampling pass with skip connections to the downsampling pass activation. We use Griffin-Lim algorithm to convert the spectrogram to the final audio waveform [17]. We use AdamW optimizer to train all models on a A6000 GPU with a batch size of 16 until convergence. The initial learning rate is set to \(5e-4\), and it gradually decreases by a factor of 0.95. ### Baselines We compare our physics-driven diffusion model against various state-of-the-art systems. For fair comparison, we use the same video features extracted by TSM [29]. \(\bullet\)**ConvNet-based Model**: With a sequence video features, we first up-sampled them to have the same number of frames as the spectrogram. Then we perform a Unet architecture to convert video features to spectrogram. Such a architecture has shown successful results in spectrogram-based music generation [52]. \(\bullet\)**Transformer-based Model**: We implement a conditional Transformer Network which has shown promising results in Text-to-Speech [27]. Instead of using text as condition, here we use the extracted video features. \(\bullet\)**Video conditioned Diffusion model**: We also compare our approach to two video conditioned spectrogram diffusion model variants. In the first setup, we do not include the physics priors and keep all other settings the same. \(\bullet\)**Video + Class Label conditioned Diffusion model**: In the second variant, we provide a class-label of the impact sound material as an additional condition to the video features. All other settings are the same as ours. \(\bullet\)**Video + Other Audio Features Diffusion model**: To show the importance of physics latents, we replace the physics latent with spectrogram/mfcc latent by extracting spectrogram/mfcc features from the raw audio and pass them to a transformer encoder similar to the one used in physics parameters reconstruction, and then we apply average pooling to obtain the latent vector. During testing, we still use visual features to query the corresponding spectrogram/mfcc latent in the training set and synthesize the final results. ### Evaluation Metrics We use four different metrics to automatically assess both the fidelity and relevance of the generated samples. For automatic evaluation purpose, we train an impact sound object material classifier using the labels in Great Hits Dataset. The classifier is a ResNet-50 convolutional-based neural network and we use the spectrogram as input to train the classifier. \(\bullet\)**Frechet Inception Distance (FID)** is used for evaluating the quality of generated impact sound spectrograms. The FID score evaluates the distance between the distribution of synthesized spectrograms and the spectrograms in the test set. To build the distribution, we extract the features before the impact sound classification layer. \(\bullet\)**Kernel Inception Distance (KID)** is calculated via maximum mean discrepancy (MMD). Again, we extract features from synthesized and real impact sounds. The MMD is calculated over a number of subsets to both get the mean and standard deviation of KID. \(\bullet\)**KL Divergence** is used to individually compute the distance between output distributions of synthesized and ground truth features since FID and KID mainly rely on the distribution of a collection of samples. \(\bullet\)**Recognition accuracy** is used to evaluate if the quality of generated impact sound samples can fool the classifier. ### Results Quantitative evaluation results are shown in Table 1. Our proposed physics-driven diffusion model outperforms all other methods across all metrics. It is worth noting that without physics priors, using video features alone as condition to the spectrogram denoiser is not sufficient to generate high fidelity sounds. While this could be improved when class labels are available, it is obvious that there is a large gap to reach the performance of the physics-driven method. Fig. 4 illustrates a comparison of three examples of generated spectrograms given a video by ConvNet-based, Transformer-based, and our physics-driven approaches to the ground truth. While the ConvNet and Transformer-based approaches could also capture some correspondences between audio and video, it is obvious that a lot of noise appears in the generated spectrogram because these approaches are prone to learn an average smoothed representation, and thus introducing many artifacts in the end. In comparison, our physics-driven diffusion approach does not suffer from this problem and can synthesize high fidelity sound from videos. It is worth noting that the interoperability of our approach could potentially unlock applications such as controllable sound synthesis by manipulating the physics priors. ### Human Perceptual Evaluation In addition to the objective evaluation of our method, we also perform human perceptual surveys using Amazon Mechanical Turk (AMT). We aim to use perceptual surveys to evaluate the effectiveness of our generated samples to match the video content and the fidelity of the generated samples. For all surveys, we do not request participants with any background on the survey or our approach was given to the participants to avoid perceptual biases. We surveyed \(50\) participants individually, where each participant was asked to evaluate \(10\) videos along with different generated samples from various methods. A total of \(500\) opinions were collected in the end. \(\bullet\)**Matching**. In the first survey, we asked people to watch the same video with different synthesized sounds and answer the question: "In which video the sound best matches the video content?". The participants would choose one soundtrack from the ConvNet-based, Transformer-based and Physics-driven diffusion approaches. From results shown in Table. 2 (Top) (left column), we observe that there exists a clear indication that the sound generated with our method \begin{table} \begin{tabular}{|l|c c c c|} \hline Model\(\backslash\)Metric & FID \(\downarrow\) & KID (mean, std)\(\downarrow\) & KL Div. \(\downarrow\) & Recog. Acc (\%) \(\uparrow\) \\ \hline ConvNet-based & 43.50 & 0.053, 0.013 & 4.65 & 51.69 \\ Transformer-based & 34.35 & 0.036, 0.015 & 3.13 & 62.86 \\ Video Diffusion & 54.57 & 0.054, 0.014 & 2.77 & 69.94 \\ Video + Class label Diffusion & 31.82 & 0.026, 0.021 & 2.38 & 72.02 \\ Video + MFCC Diffusion & 40.21 & 0.037, 0.010 & 2.84 & 67.87 \\ Video + Spec Diffusion & 28.77 & 0.016, 0.009 & 2.55 & 70.46 \\ \hline **Video + Physics Diffusion (Ours)** & **26.20** & **0.010, 0.008** & **2.04** & **74.09** \\ \hline \end{tabular} \end{table} Table 1: Quantitative evaluations for different models. For FID, KID, and KL Divergence, lower is better. For recognition accuracy, higher is better. Bold font indicates the best value. Figure 4: Qualitative Comparison results on sound spectrogram generated by different methods. is selected as the best match to the visual content with a higher selected rate. * **Quality**. In the second survey, we asked people (non-expert) to choose the video with the highest sound quality, including 3 variations of samples generated by ConvNet-based, Transformer-based and Physics-driven diffusion approaches. Results in Table clearly indicate our approach achieves the best sound quality. * **Perceptual Ablation Studies**. In the last survey, we performed a perceptual ablation study to test how the physics priors could influence the perception of the generated impact sounds compared to the approaches without it. Survey results shown in Table 2 (Bottom) and suggest that in comparison to video only model, the physics priors improve the overall perception of synthesized impact sounds. ### Ablation Studies We performed three ablation studies to answer the following questions. **Q1**: How do residual parameters influence the physics priors? **Q2**: What is the contribution of each component to our approach? **Q3**: Is our method better than simple retrieval methods? **Q1**. Since the physics and residual parameters are essential in our approach. We have investigated different physics priors variants to find the most informative physics priors and use the multi-resolution STFT loss of the reconstructed sounds for evaluation. The results in Fig. 5(a) clearly show that the loss decreases significantly with residual parameters. We also find that using \(100\) residual parameters achieves the best performance, while fewer or more residual parameters may damage the performance. **Q2**. We perform extensive experiments to understand the contribution of each component. For all studies, we use the nearest physics parameters/priors retrieved by visual latent to synthesize the sound. Results are shown in Fig. 5(b). We first observe that without residual components and diffusion models, using estimated physics parameters to perform modal synthesis could not obtain faithful impact sounds. The physics priors could re-synthesize impact sounds with much better quality with learned residual parameters. We further show that using physics priors as the condition input to the diffusion model achieves even better performance. We have also performed an experiment to predict physics latent from video input and use it as the condition for the diffusion model but the quality of generated samples is poor. This is due to the weak correspondence between video inputs and physics behind the impact sounds and indicates the importance of using video inputs to query physics priors of the training set at the inference stage. **Q3**. We consider two retrieval baselines for comparison. The first one is a simple baseline without physics priors and diffusion model. We only use visual features extracted from the ResNet-50 backbone to search the nearest neighbor (NN) in the training set and use the audio as output. In the second experiment, we try our best to reproduce the model in [39] since no official implementation is available. The model predicts sound features (cochleagrams) from images via LSTM. For fair evaluation, a collection-based metric like FID is invalid because the retrieved audios are in the real data distribution. Therefore, we use sample-based metrics, including KL Divergence between predicted and ground truth audio features and Mean Square Error on the spectrogram level. The table 3 clearly shows that our approach outperforms the retrieval baselines by a large margin. ## 5 Conclusion We present a physics-driven diffusion model for impact sound synthesis from videos. Our model can effectively generate high fidelity sounds for physical object interactions. We achieve such function by leveraging physics priors as guidance for the diffusion model to generate impact sounds from video input. Experimental results demonstrate that our approach outperforms other methods quantitatively and qualitatively. Ablation studies have demonstrated that physics priors are critical for generating high-fidelity sounds from video inputs. The limitation of our approach naturally be \begin{table} \begin{tabular}{|l|c|c|} \hline Model\(\backslash\)Metric & Matching & Quality \\ \hline \multicolumn{3}{|l|}{_Comparison to Baselines_} \\ \hline ConvNet-based & 18\% & 17.6\% \\ Transformer-based & 26.6\% & 28.8\% \\ \hline **Ours** & **55.4\%** & **33.6\%** \\ \hline \multicolumn{3}{|l|}{_Perceptual Ablation Studies_} \\ \hline Video-only & 23.6\% & 23.6\% \\ Video+label & 37.8\% & 35.8\% \\ \hline **Ours** & **38.6\%** & **40.6\%** \\ \hline \end{tabular} \end{table} Table 2: (Top) Human perceptual evaluation on matching and quality metrics. (Bottom) Ablation study on human perceptual evaluation. The value indicates the percentage of Amazon Turkers who select the method. Figure 5: (a) Ablation study on the importance and selection for the number of residual parameters by testing multi-resolution STFT loss. (b) Ablation study on the contribution of each component of our approach using FID score, the lower the better. \begin{table} \begin{tabular}{|l|c c|} \hline Model\(\backslash\)Metric & KL Div. \(\downarrow\) & Spec. MSE\(\downarrow\) \\ \hline NN via Visual Features & 10.60 & 0.307 \\ NN via Predicted Sound Features [39] & 7.39 & 0.205 \\ \hline **Ours** & **2.04** & **0.149** \\ \hline \end{tabular} \end{table} Table 3: Comparison with retrieval methods. comes that our approach cannot generate impact sounds for unseen physics parameters due to the query process (failure case demonstration is shown in Supplementary material), while we can generate novel sounds given an unseen video. Acknowledgements.This work was supported by the MIT-IBM Watson AI Lab, DARPA MCS, DSO grant DSOCO21072, and gift funding from MERL, Cisco, Sony, and Amazon.

2308.02548

Aspect based sentimental analysis for travellers' reviews

Airport service quality evaluation is commonly found on social media, including Google Maps. This valuable for airport management in order to enhance the quality of services provided. However; prior studies either provide general review for topics discussed by travellers or provide sentimental value to tag the entire review without specifically mentioning the airport service that is behind such value. Accordingly, this work proposes using aspect based sentimental analysis in order to provide more detailed analysis for travellers reviews. This works applied aspect based sentimental analysis on data collected from Google Map about Dubai and Doha airports. The results provide tangible reasons to use aspect based sentimental analysis in order to understand more the travellers and spot airport services that are in need for improvement.

Mohammed Saad M Alaydaa, Jun Li, Karl Jinkins

2023-08-01T21:23:02Z

http://arxiv.org/abs/2308.02548v1

# Aspect-based Sentimental Analysis for Travellers' Reviews ###### Abstract Airport service quality evaluation is commonly found on social media, including Google Maps. This valuable for airport management in order to enhance the quality of services provided. However; prior studies either provide general review for topics discussed by travellers or provide sentimental value to tag the entire review without specifically mentioning the airport service that is behind such value. Accordingly; this work proposes using aspect based sentimental analysis in order to provide more detailed analysis for travellers' reviews. This works applied aspect based sentimental analysis on data collected from Google Map about Dubai and Doha airports. The results provide tangible reasons to use aspect based sentimental analysis in order to understand more the travellers and spot airport services that are in need for improvement. Airport service quality, aspect-based sentimental analysis, traveller's feedback ## 1 Introduction The reviews provided by travellers hold immense significance for the aviation industry. These reviews have the potential to strongly influence travellers' decision when it comes to selecting an airport [1-5]. Even minor improvements in airport services can lead to positive changes in travellers' perceptions and enhance their overall airport experience [6-9]. Moreover; travellers' positive-sentiment is considered among the competitive features of airports [9]. Given that travellers can easily access and refer to other travellers' online reviews, airport management must prioritise the Airport Service Quality (ASQ). In order to understand the key areas that airport management should focus on to enhance positive reviews, researchers have developed tools [1] for extracting and analysing travellers' reviews. This study employed aspect-based sentimental analysis in order to explicitly tag every airport service-mentioned in the traveller's feedback with positive/negative. This; in contrast to prior studies that tag the entire review with positive/negative; clearly assists airport management to spot services that are in need for improvement. ## 2 Literature Review Most of the studies, particularly those that use secondary data such as Twitter, Google Review, airline quality or Skytrax employ topic modelling and sentimental analysis. The rest mostly use statistical analysis based on primary dataset collected directly from travellers to investigate the impact of ASQ on travellers' satisfaction, revisits and reviews. Dhini and Kusumaningrum [4] used Support vector Machine (SVM) and Naive Bayes Classifier to classify traveller's feedback (reviews from google) into positive or negative. Meanwhile; 20,288 online reviews posted between 2005 and 2018 on TripAdvisor were analysed by Moro, et al. [10], Heat maps for airport hotel services and sentimental status of the guests were reported. Deep learning networks (CNN and LSTM) were developed by Barakat, et al. [3] to recognize sentimental status (positive/negative) of travellers' posts found in US Airline Sentiment dataset (14487 records) and AraSenTi dataset (15,752 records). Similar work on twitter dataset (London Heathrow airport's Twitter account - dataset includes 4,392 tweets) by Martin-Domingo, et al. [11], topic modelling was used. Online reviews platform from Skytrax (2,278) were investigated by Kilic and Cadirci [8], Halpern and Mwesiumo [12] via multinomial logit model, topic modelling, sentimental analysis, and emotion recognition to spot airport services that receive high positive/negative feedback. [13] used topic modelling and sentimental analysis with 42,137 reviews collected from Google Maps. Shadiyar, et al. [14], Bunchongchit and Wattanacharoensil [15] employed several methods (text mining analysis, semantic network analysis, frequency analysis and linear regression analysis) to assess 1,693 and 7,358 reviews related to airport and flights respectively. In effort to determine a list (scale) of airport services that could be used with online social media posts- in analogy with airport service quality scale developed from survey; Tian, et al. [16] used text mining and sentiment analysis to come up with scale of 6 airport service scale. Topic modelling is a popular method used to analyse online comments made by travellers, with tools such as Latent Dirichlet Allocation (LDA) commonly employed to investigate the major airport services [8, 13]. These tools combined with dimension reduction approaches are applied to identify a limited number of topics from the comments of the travellers. The above discussion was extensively used NLP qualitative approach such as Latent Semantic Analysis (LSA) and Latent Dirichlet Allocation (LDA) to determine airport services mentioned in travellers' feedback (via topic modelling). Later, sentimental analysis used to know positivity/negativity of travellers' feedback. Then, recognizing sentiment scores (i.e., positive and negative) [8] or sentimental values (i.e., positive, negative, and neutral) are not sufficient to accurately reveal people's specific sentiments [16] or which specific airport service targeted by this feedback. Lee and Yu [13] applied LDA to predict the star ratings of airports from sentimental scores. Bae and Chi [17] employed an alternative approach called content analysis to distinguish between satisfied and dissatisfied travellers using their online reviews. The study found that dissatisfied travellers frequently used words such as "security," "check," "staff," "flight," and "line," whereas satisfied travellers often used words like "staff," "terminal," "time," "clean," "immigration," and "free." In recent years, Machine Learning, especially supervised methods such as Deep Learning, have gained popularity in predicting traveller sentimental values. Li, et al. [2] reported that studies using social media data to predict sentimental values based on Vader and LSVA. Taecharungroj and Mathayomchan [18] found that the quality of airport services can be measured by sentimental values associated with various services, such as access, check-in/security, wayfinding, facilities, airport environment, and staff. Barakat, et al. [3] used thousands of English and Arabic tweets to train CNN and LSTM models to predict positive or negative traveller sentiments toward airport services. Although the LSTM model showed better prediction, the difference is insignificant. Kamis and Goularas [19] evaluated several Deep Learning architectures with different datasets and found that the best performance was achieved when LSTM and CNN were combined. Generally, studies in Machine Learning and Deep Learning on airport service quality and travellers' sentimental value since 2018 have been limited. ### Airport Services Despite the various techniques used to measure ASQ, most studies come to a similar conclusion that certain airport services are more likely to receive positive reviews if they are effectively managed. However, there is no standardized way of listing the airport services that should be focused on. Some researchers, like Gajewicz, et al. [6], evaluate facility attributes such as waiting time, cleanliness, efficiency, and availability of services individually, while others consider these attributes as a whole. Additionally, some researchers use broader terms, such as facilities to include amenities like food, restaurants, and ATMs, while others are more specific. Consequently, different lists of airport services are found in the studies, making it difficult to standardize a list of services in airports to be evaluated. Table 1 provides a list of airport services that cover all explicit facilities in the airport, based on the review. Table 2 provides a list of airport services based on a sample of 13 studies, where check-in is mentioned most frequently and queuing/waiting time occurs in studies least frequently. However, there are some inconsistencies in how certain services are categorized. For example, some studies treat check-in and security as a single category, while queuing/waiting time is classified as a feature for arrival. Additionally, some airport services are uniquely featured in specific studies, such as services cap [20], prime services [21], and airport appearance [22]. The gap found in the current studies that employed sentimental analysis was given a polarity value (negative, positive or neutral) as the overall sentimental value for travellers' feedback. in many cases, travellers feedback contains several sentimental values (positive, negative or neutral) tagging different airport services. Therefore, tagging the feedback with a single sentimental value may underestimate other important values that could alert airport management to drawbacks in the \begin{table} \begin{tabular}{|p{142.3pt}|p{142.3pt}|} \hline **Services** & **Specification** \\ \hline Access & Transportation, parking facilities, trolleys, baggage, and cars etc. \\ \hline Check-in and security & Waiting time, check-in queue/ line, efficiency of check-in staff, and waiting time at security inspection etc. \\ \hline Facilities & ATM, toilets, and restaurants etc. \\ \hline Wayfinding & Ease of finding your way through airport, and flight information screens etc. \\ \hline Airport environment & Cleanliness of airport terminal, ambience of the airport, etc. \\ \hline \end{tabular} \end{table} Table 1: A list of airport services and specification \begin{table} \begin{tabular}{|p{142.3pt}|p{142.3pt}|} \hline **Airport service** & **Study** \\ \hline Passport control, arrival services, airport environment, wayfinding, airport facilities, check-in, security, and access & [23] \\ \hline Access, facilities, wayfinding, environment, personnel, check-in, security, and arrival & [2] \\ \hline Access, check-in, passport, wayfinding, facilities, environment, arrival, people & [3] \\ (personnel), and waiting & \\ \hline Signage and wayfinding, information, security, waiting times, staff, cleanness, comfort, and availability/efficiency of the airport services & [6] \\ \hline Access, Security, check-in, facilities, wayfinding, environment, and arrival & [24] \\ \hline Airport staff and queuing times & [12] \\ \hline Security, check-in, wayfinding, environment, access, arrival services and airport facilities & [24] \\ \hline Facilities, check-in, services cap, security and ambience & [20] \\ \hline Traffic, check-in, signs and wayfinding, environment, security and passport/ID card inspection, entry procedures, and facilities & Liu and Zheng [25] \\ \hline Non-processing (main facilities, value addition) and processing (queue and waiting time, staff (helpfulness and communication), prime services) & [21] \\ \hline Seat comfort, staff, food and beverage, entertainment, ground services, and value for money & [14] \\ \hline Access, check-in/security, way finding, facilities, environment, and staff & [3] \\ \hline Services, airport appearance, check in/out services, and waiting time & [22] \\ \hline \end{tabular} \end{table} Table 2: Airport services reported in the studies services provided. Li, et al. [2] found a significant relationship between review rating and some specific airport services mentioned in google map reviews. Accordingly, Aspect-Based Sentimental Analysis (ABSA) could provide more detailed information about the sentimental values that travellers want to deliver. ## 3 Methodology ### Datasets Datasets were collected from Google Maps, and the tool provided by outscraper.com was used to collect the data of two famous airports in the Arabic peninsula: Dubai and Doha. The number of reviews collected related to Doha and Dubai airports were 11400 and 16170, respectively. No specific dates were set, but most of the reviews were done during the Covid-19 outbreak. The data items used were travellers' reviews and review rate (1\(\sim\)5)- if the rating is greater than or equal to 3, the polarity is positive; otherwise, it is negative [26]. Other items were removed because they either revealed the personal information about the reviewer (name, image, etc.) or were related to the time and date. ### Method To ensure a proper aspect-based sentimental analysis, the entire review is divided into a set of sentences using NLTK Tokenizer. This set of sentences is fed to a method that use _textblob library_ to correct misspellings. The list of aspects extracted from table 2 ("access", "security", "check-in", "facilities", "Wayfinding", "arrival", "staff", "terminal") and related terms (e.g., facilities: food, seats, toilet wifi etc.) will be searched inside the sentence. If any aspect exists, the sentence will be fed to an Aspect-based library (deberta-v3-base-absa-v1.1). The highest score (positive or negative) that comes out of the Aspect-based will tag the sentence. Eventually; a matrix of aspects will be the output that reveal the polarity of traveller's feedback about all possible airport services mentioned in the feedback. ## 4 Results and Discussion A sample of output is presented in table 3. It is important to mention that the number under Facilities column in the first row is the average value of the values predicted by aspect model for sentimental values of "toilets, shops, seats" because all those terms are under facilities aspect. Similarly in the second row, but this time with negative values. Zero values means that the aspects are missing in the travellers' feedback. keywords column refers to services that explicitly mentioned in the traveller's feedback. This to give an idea for which; for instance; facility exactly the traveller gave feedback about. Moreover; this is in line with prior studies that tried to shorten the list of services that could be tracked in feedback in order to give a more accurate result to airport management. Moreover; the results could be averaged in order to provide overall sentimental value for each airport service. This will provide more quantitative data instead of providing a list of words that frequently used under an estimated topic-as LSA and LDA do. In essence; utilizing aspect-based sentimental analysis provides more details regarding the sentimental values exist in the travellers' reviews, in contrast to one single value that tagged the entire review. Moreover; in contrast to LSA and LDA, aspect-based should be used while the aspects (in this context is airport services) already known; meanwhile, LDA needs in advanced the possible topics number in order to come up with a group of words that could describe specific topic. On other hand; the current Aspect-based sentimental analysis tools were trained on data related to restaurant, mobile phones and computer sells, which explains the average accuracy the tool that used in this work. The accuracy was \(\sim\)80%. It was noticed that when airport services repeated several times in the feedback, it makes the predicted sentimental value as a collective value, which may not reflect the real sentimental value. Therefore, there is a need to train the current aspect-based tools with datasets related to travellers' feedback. ## 5 Conclusion NLP provides qualitative approaches such as LSA and LDA in order to collectively bring together frequent words that possibly shape a topic. However; the results need human intervention in order to understand the topic and sentimental values related. The other group of studies concerned to know the polarity of the entire review; which makes it difficult to know the airport service that is specifically behind such polarity. In contrast, this work found that aspect-based sentimental analysis can deliver more accurate answer regarding the polarity of every airport service mentioned in the travellers' reviews. Yet; Aspect-based sentimental analysis needs an explicit list of aspects in order to predict the sentimental value. Accordingly; and based on prior studies, this study found 8 airport services that frequently reported at prior studies (table 2) and been used here to deliver more accurate sentimental values that can help airport management to spot services that travellers complain more about. This work reports part of project, which is in progress to develop multi-label model to predict the airport services and their sentimental values. A more work is needed to develop a specialized aspect-based that consider aspects related to airport services. This can be done by retrained the current tools with datasets similar to the ones collected in this study. The future work is to come up with tool that is capable to located airport services and its polarity within traveller's feedback.

2308.15034

Fast immersed boundary method based on weighted quadrature

Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a regular background mesh cut by a boundary representation that defines the domain of interest. Therefore, we present a novel concept to divide the support of cut basis functions to obtain regular parts suited for sum factorization. These regions require special discontinuous weighted quadrature rules, while Gauss-like quadrature rules integrate the remaining support. Two linear elasticity benchmark problems confirm the derived estimate for the computational costs of the different integration routines and their combination. Although the presence of cut elements reduces the speed-up, its contribution to the overall computation time declines with h-refinement.

Benjamin Marussig, René Hiemstra, Dominik Schillinger

2023-08-29T05:37:57Z

http://arxiv.org/abs/2308.15034v1

# Fast immersed boundary method based on weighted quadrature ###### Abstract Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a regular background mesh cut by a boundary representation that defines the domain of interest. Therefore, we present a novel concept to divide the support of cut basis functions to obtain regular parts suited for sum factorization. These regions require special discontinuous weighted quadrature rules, while Gauss-like quadrature rules integrate the remaining support. Two linear elasticity benchmark problems confirm the derived estimate for the computational costs of the different integration routines and their combination. Although the presence of cut elements reduces the speed-up, its contribution to the overall computation time declines with \(h\)-refinement. ## 1 Introduction In the field of finite element analysis, the generation of a boundary-conforming mesh presents challenges, particularly for complex 3D geometries. This process that often requires labor-intensive manual intervention hinders the efficiency of the design-to-analysis workflow, driving current research and development towards more efficient interactions between geometric models and finite element analysis. Over the past two decades, two families of methods have emerged to address this challenge: isogeometric analysis and immersed boundary methods. Isogeometric analysis (IGA), introduced in 2005 [30], aims to bridge the gap between computer-aided design and finite element analysis. The initial techniques [30, 12, 13, 14] combined spline technology from the field of computer-aided design with standard finite element formation, assembly, and solution procedures. It was soon recognized that the smoothness and structure of splines enable more efficient implementations than were previously possible in IGA and standard \(C^{0}\)-continuous finite element analysis alike [32, 60, 17, 48]. Techniques such as sum factorization, a classical approach in \(hp\)-finite element methods that leverages the local tensor product structure, have been employed to expedite the element formation process [1]. Additionally, more efficient quadrature techniques have been developed, including Generalized Gaussian quadratures [26, 34], reduced integration [60, 26], and weighted quadrature [8, 55, 27, 19]. Studies such as [8, 27] have demonstrated that a combination of sum factorization, weighted quadrature, and row-based assembly can lead to significant speed-ups in the formation and assembly of system matrices. Notably, these advancements have enabled efficient higher-order computations, with the number of operations scaling as \(\mathcal{O}(p^{4})\) instead of \(\mathcal{O}(p^{9})\), as observed in classical techniques [8; 27]. Despite the success of IGA as an analysis technology, it has not fully resolved the challenges associated with mesh generation, leaving a significant gap between computer-aided design and finite element analysis unresolved. Immersed boundary methods, also known as fictitious domain, embedded domain or cut finite element methods, eliminate the need for boundary-conforming discretizations altogether. Thus, they mitigate the complexities of meshing procedures and frequent grid regeneration required for models involving substantial deformations and displacements. Immersed boundary methods offer an alternative to boundary-conforming meshes, but introduce other computational challenges: (1) numerical evaluation of integrals over cut elements, (2) imposition of boundary conditions on immersed boundaries, and (3) maintaining stability of discrete function spaces, in particular in the presence of very small cut elements. Over the past decades, numerous advanced techniques have been developed to address these challenges. As a result, various variants of immersed boundary methods exist, including the finite cell method [52], certain versions of the extended finite element method [18; 25], isogeometric immersed boundary methods [59], fixed-grid methods in fluid-structure interaction [35; 62], weighted extended B-splines [28; 33; 10], and embedded domain approaches utilizing penalty methods [5], Lagrange multipliers [20; 6; 36], Nitsche-type methods [24; 15; 54], and discontinuous Galerkin methods [61; 23]. It is important to note that this list is not exhaustive, and numerous other variations of immersed boundary methods are available. For a comprehensive overview, we refer the interested reader to the reviews articles [58; 7; 53] and the references therein. It is also worth noting that there is a close relation to the treatment of trimmed domains as they occur in CAD geometries [46]. In this paper, we draw our attention to another challenge of the isogeometric immersed boundary method that uses higher-order smooth spline basis functions: applying efficient implementation concepts. Transferring efficient implementation concepts that work for boundary-conforming tensor product spline discretizations is usually not possible, because the arbitrarily located immersed boundary destroys the smoothness and structure of the background mesh's spline discretization. To overcome this obstacle, a few approaches have been suggested in the literature. In [47], a partitioning into macro-elements is proposed. Since these elements follow the tensor product structure, Generalized Gaussian quadrature can be used within these sub-regions. Alternatively, such rules may be employed for all non-cut basis functions, while cut ones are integrated with Gauss quadrature, as recently suggested in [43]. Due to the overlap of the supports of cut and non-cut basis functions, this procedure leads to transition elements that require reduced quadrature and Gauss points. Another approach proposed by the first author allows the utilization of weighted quadrature, sum factorization, and row assembly - a combination we will refer to as fast formation and assembly - by introducing so-called discontinuous weighted quadrature rules [44; 45]. Up to now, this concept has only been tested for simple \(L^{2}\)-projection problems. Therefore, in this paper, we extend this concept to linear elasticity problems by combining it with the ideas presented in [27]. Furthermore, we propose a novel strategy to set up more efficient discontinuous weighted quadrature rules and estimate the associated computational costs in terms of the number of floating-point operations. ## 2 Preliminaries In this work, a tensor product spline discretization defines the background mesh. For a detailed discussion on splines, we refer to [11; 14; 4] and restrict ourselves here to a few preliminaries required later on. A spline is a set of piecewise polynomial segments with prescribed continuity at their breakpoints. The corresponding basis functions are _B-splines_\(\hat{B}_{i,p}\), which specify the spline by its degree \(p\) and a non-decreasing sequence \(\Xi\) of parametric coordinates \(\hat{\xi}_{j}\leqslant\hat{\xi}_{j+1}\) called knot vector and knots, respectively. Each knot value marks a breakpoint \(\xi_{k}^{b}\) of the spline, and the related knot-multiplicity \(m\left(\xi_{k}^{b}\right)\) specifies the continuity \(C^{r_{k}}\) at \(\xi_{k}^{b}\) by \(r_{k}=p-m\left(\xi_{k}^{b}\right)\) To obtain splines with maximal smoothness, \(m=1\) for all interior knot values. It is often convenient to have \(C^{-1}\) continuity at the splines boundary. This property is accomplished by using so-called open knot vectors, which are characterized by setting the multiplicity of end knot values to \(m=p+1\). In general, a knot vector \(\varXi\) defines an entire set of linearly independent B-splines \(\{\hat{B}_{i,p}\}_{i=1}^{n}\) on the parametric domain \(\hat{\Omega}\). The corresponding space of splines on an interval \([a,b]\) is given by \[\mathbb{S}_{\boldsymbol{r}}^{p}\left([a,b]\right):=\left\{\sum_{i}\hat{B}_{i, p}(\xi)c_{i}\ \middle|\ \xi\in[a,b],\ c_{i}\in\mathbb{R},\quad i=1,\ldots,n\right\}. \tag{1}\] where \(\boldsymbol{r}\) is a collection of all regularities \(r_{k}\) at the breakpoints \(\xi_{k}^{b}\). Each \(\hat{B}_{i,p}\) has local support, \(\operatorname{supp}\left\{\hat{B}_{i,p}\right\}\), specified by the knots \(\{\hat{\xi}_{i},\ldots,\hat{\xi}_{i+p+1}\}\). Multivariate basis functions \(\hat{B}_{\boldsymbol{i},\boldsymbol{p}}\) of dimension \(n_{sd}\) are obtained by computing the tensor product of univariate B-splines \(\hat{B}_{i_{d},p_{d}}\) defined by separate degrees \(p_{d}\) and knot vectors \(\varXi_{d}\) for each parametric direction \(d=1,...,n_{sd}\). Thus the evaluation of a multivariate B-spline at a parametric coordinate \(\boldsymbol{\xi}=(\xi_{1},\ldots,\xi_{n_{sd}})\) can be generally expressed as \[\hat{B}_{\boldsymbol{i},\boldsymbol{p}}(\boldsymbol{\xi})=\prod_{d=1}^{n_{sd}} \hat{B}_{i_{d},p_{d}}(\xi_{d}). \tag{2}\] A property that will be useful later is that the first derivative of a B-spline \(\hat{B}_{i,p}^{(1)}\) can be expressed by a linear combination of B-splines of the previous degree \[\hat{B}_{i,p}^{(1)}(\xi)=\frac{p}{\hat{\xi}_{i+p}-\hat{\xi}_{i}}\,\hat{B}_{i, p-1}^{(0)}(\xi)-\frac{p}{\hat{\xi}_{i+p+1}-\hat{\xi}_{i+1}}\,\hat{B}_{i+1,p-1}^{(0) }(\xi),\quad\text{ where }\quad\hat{B}_{j,p-1}^{(0)}\coloneqq\hat{B}_{j,p-1}. \tag{3}\] Usually, \(\hat{B}_{i,p}\) denotes a B-spline defined in the parameter space \(\hat{\Omega}\), while \(B_{i,p}\) represents its counterpart mapped to the physical space \(\Omega\). In the case of immersed boundary methods, the geometric mapping is often the identity. Hence, the background mesh and the parameter space coincide, allowing us to skip the hat-notation for the remainder of the paper. ## 3 Weighted quadrature We shall use _weighted quadrature_ (WQ) for the formation of mass and stiffness matrices. Hence, we consider the following univariate integrals \[\int\limits_{\Omega}M_{i}^{(0)}(\xi)B_{j}^{(0)}(\xi)c(\xi)d\xi, \int\limits_{\Omega}M_{i}^{(0)}(\xi)B_{j}^{(1)}(\xi)c(\xi)d\xi, \tag{4}\] \[\int\limits_{\Omega}M_{i}^{(1)}(\xi)B_{j}^{(0)}(\xi)c(\xi)d\xi, \int\limits_{\Omega}M_{i}^{(1)}(\xi)B_{j}^{(1)}(\xi)c(\xi)d\xi. \tag{5}\] \(M_{i}(\xi)\) and \(B_{j}(\xi)\) are test and trial functions in the spline space \(\mathbb{S}_{\boldsymbol{r}}^{p}\), and \(c(\xi)\) is determined by the geometry mapping and the material behavior. The integrals above can be concisely written as \[\int\limits_{\Omega}M_{i}^{(\alpha)}(\xi)B_{j}^{(\beta)}(\xi)c(\xi)d\xi \text{ with }\alpha,\beta=0,1. \tag{6}\] In general, numerical quadrature rules are designed to be exact for the case that \(c(\xi)=1\). Considering weighted quadrature, quadrature rules \(\mathbb{Q}_{i}^{(\alpha)}\) are designed for each test function and its derivative \(M_{i}^{(\alpha)}\) by incorporating them into the quadrature weights \[\mathbb{Q}_{i}^{(\alpha)}=\sum_{k}B_{j}^{(\beta)}(x_{k})w_{k,i}^{(\alpha)} \coloneqq\int\limits_{\Omega}B_{j}^{(\beta)}(\xi)\left(M_{i}^{(\alpha)}(\xi)d \xi\right)\text{ with }\alpha,\beta=0,1. \tag{7}\] Given a suitable layout of quadrature points \(x_{k}\), which will be discussed later on in Section 3.1, the weights \(w_{k,i}^{(\alpha)}\) can be computed by solving the following system of equations \[\begin{split}\mathbb{Q}_{i}^{(\alpha)}\left(B_{j_{1}}^{*}\right)= &\quad\sum_{k\in\mathcal{Q}_{i}}B_{j_{1}}^{*}(x_{k})w_{k,i}^{( \alpha)}&\coloneqq\int_{\Omega}B_{j_{1}}^{*}(\xi)\left(M_{i}^{( \alpha)}(\xi)d\xi\right)\\ \vdots&\vdots\\ \mathbb{Q}_{i}^{(\alpha)}\left(B_{j_{\ell}}^{*}\right)=& \quad\sum_{k\in\mathcal{Q}_{i}}B_{j_{\ell}}^{*}(x_{k})w_{k,i}^{( \alpha)}&\coloneqq\int_{\Omega}B_{j_{\ell}}^{*}(\xi)\left(M_{i}^{( \alpha)}(\xi)d\xi\right)\end{split} \tag{8}\] where \(B_{j}^{*}\) are the B-splines of the target space \(\mathbb{S}_{\mathbf{r}-1}^{p}\) whose support intersects that of the test function \(M_{i}^{(\alpha)}\in\mathbb{S}_{\mathbf{r}}^{p}\). Note that the spline spaces of the trial functions and their derivatives are contained within the target space since \(\mathbb{S}_{\mathbf{r}}^{p}\subset\mathbb{S}_{\mathbf{r}-1}^{p}\) and \(\mathbb{S}_{\mathbf{r}-1}^{p-1}\subset\mathbb{S}_{\mathbf{r}-1}^{p}\). The indices \(j_{1},\ldots,j_{\ell}\) refer to all target functions whose support overlaps with the one of the current test function, \(\operatorname{supp}\left\{M_{i}^{(\alpha)}\right\}\), and the index set \(\mathcal{Q}_{i}\) refers to all quadrature points that lie within \(\operatorname{supp}\left\{M_{i}^{(\alpha)}\right\}\). The system (8) can be solved for \(w_{k,i}^{(\alpha)},\forall k\in\mathcal{Q}_{i}\) by QR-factorization but the solution maybe not unique [27]. Using QR-factorization is equivalent to solving the least norm solution in the discrete \(l^{2}\)-norm. Positivity of the weights is not explicitly enforced in the optimization problem. Therefore, negative weights can occur. In practice, this is not a large issue because the quadrature rules attain full accuracy, that is, all splines in the target space are integrated exactly to machine precision. In the case of multivariate tensor product test functions, quadrature rules \(\mathbb{Q}_{i_{1}}^{(\alpha_{1})},\ldots,\mathbb{Q}_{i_{n_{sd}}}^{(\alpha_{n_{ sd}})}\) are computed for each parametric direction. In the remainder of the paper, the test functions \(M_{i}\) and trial functions \(B_{i}\) are the same. Thus, we will generally refer to both function types as \(B_{i}\) from now on. ### Layout of quadrature points We consider weighted quadrature rules with predefined point locations \(x_{k}\), which allows the computation of the associated quadrature weights by solving (8). The total number of weighted quadrature points \(n_{q}\) and their distribution must be set such that this system of equations (8) is well defined for all test functions. That is, the resulting system matrix is of full rank, and \(n_{q}\) is equal to or greater than the number of exactness conditions enforced. In general, the required \(n_{q}\) increases when the smoothness of the spline space reduces. In the extreme case where the continuity reduces to \(C^{0}\) everywhere, the minimum number of weighted quadrature points equals the number of Gauss points. For spline spaces with arbitrary continuity, a general procedure is presented in [27] to determine \(n_{q}\) and a suitable point distribution. For splines with maximal smoothness, \(p+1\) points are required in elements next to discontinuities, e.g., at the boundary of open knot vectors. For the remaining inner elements, on the other hand, the number of required quadrature points \(n_{q}^{i}\) is 2 when setting up a mass matrix and 3 when setting up a stiffness matrix. The location of the weighted quadrature points within an element is arbitrary as long as they do not coincide. Often a uniform distribution is chosen, which may or may not contain the boundary of the element. In this work, we do not include boundary points because the proper assembly of their integral contributions increases the implementation complexity when there is more than one quadrature rule per dimension. Here, the critical part is to correctly assign the contribution of the boundary points to the test functions that employ different integration rules and, therefore, may share only some of these points. We will pick the weighted quadrature points as a subset of the locations of the standard element-wise Gauss quadrature points, as illustrated in Figure 1. If \(p\) is the polynomial degree of the test and trial spaces, we require Gauss rules with \(p+1\) points, which is also the maximal number of weighted quadrature points needed per element. For the interior elements of maximally smooth splines, we pick the outer Gauss points and add the one in the middle if an odd number of weighed quadrature points is needed. This choice is random, but note that the points for setting up a mass matrix (Figure 1(b)) and a stiffness matrix (Figure 1(c)) coincide, which allows us to reuse point evaluations if the simulation requires mass and stiffness matrices. Section 4.4 will clarify the motivation for using the Gauss point layout; in principle, it again allows the reuse of evaluations at the quadrature points, but this time for the case when the numerical integration performed over an element employs weighed and Gauss rules. ## 4 Discontinuous weighted quadrature This section details the extension of weighted quadrature to the immersed boundary method. In particular, the different types of basis functions within cut background meshes and their integration are discussed. Then, we focus on deriving weighted quadrature rules for test functions cut by the boundary \(\Gamma\) and estimate the related computational cost. ### Function types of cut background meshes The boundary \(\Gamma\) splits the background mesh into the exterior region and the domain of interest \(\Omega^{\mathrm{v}}\) for the computation. Thus, \(\Omega^{\mathrm{v}}\) consists of _cut elements_ and regular _interior elements_. Likewise, the support of a B-spline \(B_{\mathbf{i}}\) within the background mesh may also be restricted based on its overlaps with \(\Omega^{\mathrm{v}}\), i.e., \(\mathcal{S}^{\mathrm{v}}_{\mathbf{i}}\coloneqq\mathrm{supp}\left\{B_{\mathbf{i}} \right\}\cap\Omega^{\mathrm{v}}\). This measure leads to the classification of three different basis function types: * _Exterior_ if \(\mathcal{S}^{\mathrm{v}}_{\mathbf{i}}=\emptyset\), * _Interior_ if \(\mathcal{S}^{\mathrm{v}}_{\mathbf{i}}=\mathrm{supp}\left\{B_{\mathbf{i}}\right\}\), * _Cut_ if \(0<|\mathcal{S}^{\mathrm{v}}_{\mathbf{i}}|<|\mathrm{supp}\left\{B_{\mathbf{i}}\right\}|\), Figure 1: Weighted quadrature layout for a spline space with \(p=4\) and maximal smoothness: (a) required Gauss points (blue crosses) within each element serve as a superset for (b) the weighted quadrature points (black circles) for setting mass matrices and (c) stiffness matrices. where \(|\cdot|\) denotes the Lebesgue measure in \(\mathbb{R}^{n_{sd}}\). Figure 2 shows examples of these different types. Exterior B-splines do not contribute to the system of equations, and interior ones can be treated directly by standard procedures, which is, in our case, the fast formation and assembly with weighted quadrature. Cut basis functions, however, cannot utilize these weighted quadrature rules directly since they do not consider the boundary \(\Gamma\). In the following, we discuss the efficient numerical integration of the cut basis functions and the construction of suitable weighted quadrature rules. ### Integration of cut basis functions We aim at applying weighted quadrature to cut basis functions. Thereby, the main difficulty is that the boundary \(\Gamma\) introduces an arbitrarily located jump discontinuity within the background mesh. Integrating without taking this interface into account or simply neglecting quadrature points outside of the valid domain \(\Omega^{\mathrm{v}}\) will lead to incorrect results. Consequently, the quadrature rule has to account for these arbitrarily located discontinuities. Considering weighted quadrature, this circumstance affects the correct representation of the integration domain \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}\) of a cut B-spline \(B_{\mathbf{i}}\) and the computation of its weighted quadrature rules. Besides, sum factorization cannot be applied since \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}\) does not follow a tensor product structure in general. In a first step, we split the domain \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}\) into a _regular_ part \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}\), which follows the tensor product structure (at least on the element-level), and a _cut_ part \(\mathcal{S}_{\mathbf{i}}^{\mathrm{c}}\), which consists of all elements cut by the boundary. Hence, the integral over a cut basis function can be written as \[\int\limits_{\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}}B_{\mathbf{i}}(\mathbf{\xi})d\mathbf{\xi}= \int\limits_{\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}}B_{\mathbf{i}}(\mathbf{\xi})d\mathbf{\xi}+ \int\limits_{\mathcal{S}_{\mathbf{i}}^{\mathrm{c}}}B_{\mathbf{i}}(\mathbf{\xi})d\mathbf{\xi}. \tag{9}\] The integration of \(\mathcal{S}_{\mathbf{i}}^{\mathrm{c}}\) requires an element-wise quadrature rule that can treat arbitrary interfaces within an element. There is indeed a large body of literature proposing approaches for this task. One group of schemes represents cut elements by sub-elements that allow the utilization of conventional - usually Gaussian - quadrature rules, e.g., [2, 9, 16, 37, 39, 38, 40]. Such a reparameterization may also involve a mapping of the background mesh [41, 42]. Another strategy is the construction of tailored integration rules for each cut element, e.g., [49, 50, 51, 56, 57, 21, 22]. These strategies usually obtain integration weights by solving a system of moment-fitting equations. When choosing the approach best suited for a specific application, the first distinguishing feature is if the interface \(\Gamma\) is defined in an implicit or a parametric representation. In this work, Figure 2: Background mesh defined by a bi-cubic B-spline basis with the boundary \(\Gamma\) specifying the valid domain \(\Omega^{\mathrm{v}}\) (gray). Examples for the resulting B-spline types based on the overlap of the support, \(\mathrm{supp}\left\{B_{i_{1},i_{2}}\right\}\), with \(\Omega^{\mathrm{v}}\): interior (green), cut (red), and exterior (yellow). a level set function specifies \(\Gamma\), and we employ the algorithms for implicitly defined geometry (Algoim) presented in [56, 57] for the integration of the cut elements representing \(\mathcal{S}_{i}^{\mathrm{c}}\). _Remark:_ In the subsequent figs. 3 to 6, the quadrature points in cut elements are defined by Gauss rules mapped by sub-elements and not by the integration rules [56, 57] utilized in the numerical experiments. ### Computing univariate discontinuous quadrature rules This section details the computation of weighted quadrature rules applicable to cut test functions. Here, the focus lies on the univariate setting to present the essential procedure for obtaining suitable quadrature points and weights. Later on, Section 4.4 discusses the required extension to the multivariate case. #### 4.3.1 Computation of discontinuous weighted quadrature rules \(\mathbb{DQ}^{(0)}(\cdot)\) The domain splitting, \(\mathcal{S}_{i}^{\mathrm{v}}=\mathcal{S}_{i}^{\mathrm{r}}\cup\mathcal{S}_{i}^ {\mathrm{c}}\), allows us to extract the regular integration region \(\mathcal{S}_{i}^{\mathrm{r}}\), in which the corresponding elements are not cut. However, standard weighted quadrature (WQ) rules are defined over the whole parameter space. Thus, they take advantage of the continuity of the entire support, which is violated by the interface \(\Gamma\) present in the cut support \(\mathcal{S}_{i}^{\mathrm{c}}\). Discontinuous weighted quadrature (DWQ) overcomes this problem [44]. For outlining the essential idea of DWQ, let us consider a univariate basis function intersected once by an interface \(\Gamma\), as illustrated in Figure 3. By introducing an artificial discontinuity \(\xi^{\mathrm{disc}}\) at the knot between \(\mathcal{S}_{i}^{\mathrm{r}}\) and \(\mathcal{S}_{i}^{\mathrm{c}}\), the envisaged split of the support is incorporated into the parameter space. This \(\xi^{\mathrm{disc}}\) reduces the smoothness only for the computation of the corresponding weighted quadrature rule; therefore, we label it artificial. The resulting DWQ rule considers \(\xi^{\mathrm{disc}}\) as a discontinuity, i.e., the quadrature points within \(\mathcal{S}_{i}^{\mathrm{r}}\) are independent of those within \(\mathcal{S}_{i}^{\mathrm{c}}\). As pointed out in Section 3.1, a reduced continuity within the spline space increases the required number of weighted quadrature points, which has to be taken into account during the computation of the DWQ rule. In particular, the initial point layout of the WQ rules \(\mathbb{Q}^{(0)}(\cdot)\) and the identified \(\xi^{\mathrm{disc}}\) are the starting point for setting up univariate DWQ rules \(\mathbb{DQ}^{(0)}(\cdot)\). Following Figure 3, the construction employs the subsequent steps: 1. Knot insertion at \(\xi^{\mathrm{disc}}\) so that the univariate basis becomes \(C^{-1}\) continuous there, and storing of the corresponding subdivision matrix \(\mathbf{S}\in\mathbb{R}^{\tilde{n}\times n}\) where \(n\) and \(\tilde{n}\) is the number of functions of the initial and resulting discontinuous basis, respectively. See A for details on setting up \(\mathbf{S}\). 2. Defining the location of the quadrature points \(x_{k}\) with \(k=1,\ldots,n_{k}\) by taking the ones of the WQ rules \(\mathbb{Q}^{(0)}(\cdot)\) and adding further nested points in the elements adjacent to \(\xi^{\mathrm{disc}}\) to comply with the minimum number required for the exactness condition of the discontinuous basis. 3. Computation of the quadrature weights \(\tilde{w}_{k,i}\in\mathbb{R}^{n_{k}\times\tilde{n}}\) at the points \(x_{k}\) for the basis functions \(\tilde{B}_{i}\) with \(i=1,\ldots,\tilde{n}\), of the refined basis using (8), and subsequent multiplication \[w_{k,j}=\sum_{i=0}^{\tilde{n}}\tilde{w}_{k,i}\;\mathbf{S}_{ij}\qquad\qquad \text{ for }\quad j=1,\ldots,n\quad\text{and}\quad k=1,\ldots,n_{k}\] (10) to obtain the weights \(w_{k,j}\in\mathbb{R}^{n_{k}\times n}\) of \(\mathbb{DQ}^{(0)}(\cdot)\) for the initial smooth univariate test functions \(B_{j}\) with \(j=1,\ldots,n\). 4. Finally, the DWQ quadrature points within the _cut_ part, i.e., \(x_{k}\in\mathcal{S}_{i}^{\mathrm{c}}\), can be neglected and replaced by an element-wise rule. This procedure provides the \(\mathbb{DQ}^{(0)}(\cdot)\) rules for all cut basis functions that share the same \(\xi^{\text{disc}}\) value. The extension to artificial artificial discontinuities within a single univariate support follows the same logic. Note that the number of quadrature points \(n_{k}\) is higher for \(\mathbb{DQ}^{(0)}(\cdot)\) than for \(\mathbb{Q}^{(0)}(\cdot)\). These additional points account for the discontinuity due to \(\xi^{\text{disc}}\) and enable the substitution of the weighted quadrature points with an element-wise one in the cut region. #### 4.3.2 Computation of discontinuous weighted quadrature rules \(\mathbb{DQ}^{(1)}(\cdot)\) As demonstrated in [27], the weighted quadrature rule \(\mathbb{Q}^{(1)}_{i,p}(\cdot)\) for the first derivative of the \(i\)th test function of degree \(p\) can be computed based on (3) leading to the following linear combination \[\mathbb{Q}^{(1)}_{i,p}(v)=\frac{p}{\xi_{i+p}-\xi_{i}}\,\mathbb{Q}^{(0)}_{i,p-1 }(v)-\frac{p}{\xi_{i+p+1}-\xi_{i+1}}\,\mathbb{Q}^{(0)}_{i+1,p-1}(v). \tag{11}\] where \(\mathbb{Q}^{(0)}_{i,p-1}(\dots)\) are the weighted quadrature rules for the test functions of lower degree \(p-1\). Here, we adopt this strategy to compute discontinuous weighted quadrature rules \(\mathbb{DQ}^{(1)}(\cdot)\). For the following computation the subdivision matrix \(\mathbf{S}\) of Section 4.3.1 can be reused since knot insertion at the identified artificial discontinuity \(\xi^{\text{disc}}\) is again the starting point. Without a loss of generality, we again detail the construction steps for introducing a single \(\xi^{\text{disc}}\) into the support Figure 3: Construction steps of a DWQ rule for integrating a mass matrix of a cubic basis cut at position \(\Gamma\) shown for the B-spline \(B_{3,3}\): (a) Conventional weighted quadrature (WQ) points (black dots) for \(B_{3,3}\). (b) Quadrature layout with additional quadrature points (white) for WQ of the refined discontinuous \(\tilde{B}_{j,3}\) associated with \(B_{3,3}\). (c) Linear combination of the refined discontinuous WQ rules to obtain the DWQ for \(B_{3,3}\). In (a,c), the points’ height indicates the related weight value. Knot insertion allows going from (a) to (b), and applying the related subdivision matrix \(\mathbf{S}\) allows the mapping from (b) to (c). 1. Splitting the basis at \(\xi^{\rm disc}\) into separate knot vectors \(\tilde{\Xi}_{b}\) with \(b=1,2\). 2. Applying (11) to each sub-basis induced by \(\tilde{\Xi}_{b}\) to compute the related \(\mathbb{Q}^{(1)}_{i,p,b}(\cdot)\) and their weights \(\tilde{w}^{(1)}_{k,j,b}\). 3. Multiplication of the block diagonal matrix obtained by \(\operatorname{diag}\left(\tilde{w}^{(1)}_{k,j,1},\tilde{w}^{(1)}_{k,j,2}\right)\) with \(\mathbf{S}\) to obtain the weights \(w^{(1)}_{k,i}\) of the entire \(\mathbb{DQ}^{(1)}(\cdot)\). Finally, it is noted that the quadrature points of \(\mathbb{DQ}^{(1)}(\cdot)\) that are within the cut part, i.e., \(x_{k}\in\mathcal{S}^{c}_{i}\), can be again replaced by element-wise quadrature rules without affecting the integration result in \(\mathcal{S}^{i}_{i}\). ### Detection of artificial discontinuities for multivariate splines Although sum factorization relies on univariate integrals, constructing DWQ rules for multivariate splines requires further considerations. To be precise, finding proper positions of the artificial discontinuities becomes more involved. In the multivariate case, an artificial discontinuity \(\xi^{\rm disc}_{d}\) introduced for the parametric direction \(d\) of an \(n_{sd}\)-dimensional background mesh propagates through the entire parameter space due to the tensor product structure of the spline basis. Thus, each \(\xi^{\rm disc}_{d}\) represents a line or a plane cutting through the 2D or 3D domain, respectively, which divides a domain into sub-domains that also possess a tensor product structure. Since an interface \(\Gamma\) does not generally follow this structure, it is usually not possible to completely separate \(\mathcal{S}^{\mathbf{r}}_{i}\) and \(\mathcal{S}^{\mathbf{c}}_{i}\) by these \(\xi^{\rm disc}_{d}\). Instead, the regular part of a support is further split, i.e., \(\mathcal{S}^{\mathbf{r}}_{i}=\mathcal{S}^{\mathbf{W}\mathbf{Q}}_{i}\cup \mathcal{S}^{\rm GQ}_{i}\), where \(\mathcal{S}^{\mathbf{W}\mathbf{Q}}_{i}\) denotes a larger tensor product subdomain that can be subject to (discontinuous) weighed quadrature, and \(\mathcal{S}^{\rm GQ}_{i}\) represents the remaining non-cut interior elements of the support. Note that \(\mathcal{S}^{\rm GQ}_{i}\) does not occur in the univariate case. These regions are treated element-wise and integrated by sum factorization with standard Gauss quadrature. Hence, we label the related elements as _Gauss elements_. To sum up, the placement of \(\xi^{\rm disc}_{d}\) affects what kind of quadrature (i.e., Gauss, WQ, or DWQ) is required in which element of the background mesh and is therefore essential for the overall number of quadrature points required. For the sake of clarity, the explanations and examples will consider the 2D case, but all concepts extend straightforwardly to the 3D setting. First, we discuss the strategy proposed in [45] that determines the most effective choice of \(\xi^{\rm disc}_{d}\) for each cut test function independently. Then a novel approach is presented that specifies all \(\xi^{\rm disc}_{d}\) for all cut test functions at once. #### 4.4.1 Individual placement for each test function This concept aims to find the knot values \(\xi^{\rm disc}_{d}\) yielding the largest \(\mathcal{S}^{\rm WQ}_{i}\) of each cut B-spline \(B_{i}\). Thereby, a maximum of one \(\xi^{\rm disc}_{d}\) per direction, \(d=1,\ldots,n_{sd}\), is introduced within the support \(\operatorname{supp}\left\{B_{i}\right\}\). Note that it would be possible to define several \(\xi^{\rm disc}_{d}\) per direction, but every additional \(\xi^{\rm disc}_{d}\) results in more nested DWQ points, and thus, such a discontinuous weighted quadrature rule becomes more expensive. Figure 4 sketches the situation for two test functions, where the individual \(\xi^{\rm disc}_{d}\) divide the \(\operatorname{supp}\left\{B_{i}\right\}\) into two and 4 parts, respectively. The parts that contain cut elements employ Gaussian quadrature since they represent the union of \(\mathcal{S}^{\mathbf{c}}_{i}\) and \(\mathcal{S}^{\rm GQ}_{i}\). The others define \(\mathcal{S}^{\rm WQ}_{i}\) and can be integrated by DWQ rules. Note the nested DWQ points added within \(\mathcal{S}^{\rm WQ}_{i}\) next to the parametric lines associated with \(\xi^{\rm disc}_{d}\). When applied to 3D domains, each \(\xi^{\rm disc}_{d}\) introduces a plane that splits the cut basis function's support. When only a single \(\xi^{\rm disc}_{d}\) is used per test function, the extension to 3D is straightforward because determining the best location only requires counting interior elements on one side of \(\xi^{\rm disc}_{d}\). Considering multiple \(\xi_{d}^{\rm disc}\), however, makes the implementation more involved since different subregion types occur, i.e., rectangles in 2D and cubes in 3D. This strategy is optimal regarding the number of quadrature points per cut test function. At the same time, it may be sub-optimal for the overall integration of the background mesh because the overlap of the individual \(\xi_{d}^{\rm disc}\) can result in elements that require weighted and Gauss quadrature schemes. When choosing the weighted quadrature points as a subset of the Gaussian ones, as discussed in Section 3.1, the problem is mitigated since the number of points is bounded by the Gauss rule. Nevertheless, the affected elements have a computational overhead in the numerical integration since they are evaluated by element assembly _and_ row assembly. #### 4.4.2 Placement based on a global interface Alternatively to the previous strategy, one can consider the whole parameter space at once rather than its individual cut test functions. Here, we propose introducing a global interface within the valid domain that guides the selection of artificial discontinuities. The goal is to have a general split between Gauss elements and those evaluated by weighted quadrature so that no region is integrated by two different routines. The starting point is a global partitioning of the background mesh into boxes of width \(h_{b}\), where \(h_{b}\) defines how many elements per direction fit into a box. The boundaries of these boxes specify the possible locations of artificial discontinuities \(\xi_{d}^{\rm disc}\). Thus, this box partition must be aligned with the elements and enclose the background mesh. The first step to selecting suitable \(\xi_{d}^{\rm disc}\) is the identification of admissible and inadmissible regions. In particular, _admissible_ boxes possess only interior elements, while _inadmissible_ ones either contain the boundary \(\Gamma\) or are entirely outside the domain \(\Omega^{\rm v}\). The interface \(\Gamma^{\rm disc}\) between these different types of blocks determines the regions integrated by weighted quadrature rules \(\Omega^{\rm v}_{WQ}\) and Gauss rules \(\Omega^{\rm v}_{CQ}\). To be precise, \(\Omega^{\rm v}_{WQ}\) represents the elements within admissible blocks, while \(\Omega^{\rm v}_{CQ}\) contains all remaining elements of the valid computational domain \(\Omega^{\rm v}\). Hence, \(\Omega^{\rm v}_{CQ}\) is the collection of all cut and Gauss elements. Using \(\Gamma^{\rm disc}\) and the overlap \(\mathcal{S}_{\mathbf{i}}^{\Omega^{\rm v}_{WQ}}\coloneqq\mathrm{supp}\left\{B_{i} \right\}\cap\Omega^{\rm v}_{WQ}\), we can adapt Figure 4: Individual detection of artificial discontinuities \(\xi_{d}^{\rm disc}\) for cut test functions. The artificial discontinuities \(\xi_{d}^{\rm disc}\) are chosen for each function separately to minimize Gauss points (blue crosses). Due to \(\xi_{d}^{\rm disc}\), the initial WQ points (black dots) require additional ones (white dots). the classification of a test function \(B_{\mathbf{i}}\) to: * _Exterior_ if \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}=\emptyset\), * _Interior_ if \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}_{\mathrm{WQ}}^{\mathrm{v}}}=\mathrm{supp}\left\{ B_{\mathbf{i}}\right\}\), * _Cut_ if \(0<\left|\mathcal{S}_{\mathbf{i}}^{\mathrm{v}_{\mathrm{WQ}}}\right|<\left|\mathrm{ supp}\left\{B_{\mathbf{i}}\right\}\right|\), * _Gauss_ if \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}_{\mathrm{WQ}}}=0\) but \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}}>\emptyset\). Note that the definition of exterior test function stays the same as presented in Section 4.1, while the others now consider \(\Gamma^{\mathrm{disc}}\) rather than \(\Gamma\). Furthermore, the Gauss class represents test functions that are only non-zero within \(\Omega_{\mathit{GQ}}^{\mathrm{v}}\) and, therefore, not subjected to weighed quadrature rules. Hence, the subdomain \(\mathcal{S}_{\mathbf{i}}^{\mathrm{v}_{\mathrm{WQ}}^{\mathrm{v}}}\) is like \(\mathcal{S}_{\mathbf{i}}^{\mathrm{WQ}}\) in the individual placement approach but specified based on the global entity \(\Gamma^{\mathrm{disc}}\). Figure 5 shows an example of a 2D background mesh decomposed by boxes with \(h_{b}=3\). We highlight that inadmissible boxes may contain Gauss elements as well. It is beneficial to reduce their number because integrating them with a weighted quadrature would be more efficient. Note that the degree \(p\) does not play a role in this context, but one can alter \(h_{b}\) or the origin of the box partition. Considering the latter for a fixed \(h_{b}\), all boxes can be shifted \(h_{b}-1\) times in each direction - one element at a time. This procedure results in \((h_{b}-1)^{n_{sd}}\) different partitions; the one with the smallest number of Gauss elements is preferred. Furthermore, the parameter \(h_{b}\) controls how well \(\Gamma^{\mathrm{disc}}\) approximates \(\Gamma\), which leads to two implications: (i) the smaller \(h_{b}\), the smaller the number of Gauss elements within inadmissible boxes, and (ii) the larger \(h_{b}\), the smaller the number of artificial discontinuities \(\xi_{d}^{\mathrm{disc}}\) introduced. While we strive for the former, the latter is advantageous too, because fewer nested points are required for the DWQ rules. Suppose \(h_{b}<3\), all elements within an admissible block are adjacent to the block's boundary. If such a block is part of a cut test function's support, all elements would require nested DWQ points, resulting in the same number of points as for Figure 5: A box partition of a 2D background mesh using boxes of size \(h_{b}=3\). The left figure shows the admissible blocks (green) and inadmissible blocks (red). The right figure depicts the corresponding interface \(\Gamma^{\mathrm{disc}}\) and the Gauss quadrature points (blue crosses) within the inadmissible region. Gauss quadrature. Hence, setting \(h_{b}=3\) seems to be an appropriate choice to balance these two contradictory goals of minimizing the number of Gauss elements in inadmissible blocks and reducing the number of nested DWQ points. The final outcome of the partitioning approach is the interface \(\Gamma^{\mathrm{disc}}\). Test functions whose support intersects with \(\Gamma^{\mathrm{disc}}\) are subjected to DWQ, and the intersections define its \(\xi_{d}^{\mathrm{disc}}\) as sketched in Figure 6. The left example shows an interior test function; here, the weighed quadrature points are given by the tensor product of the univariate layout, c.f. Figure 1(c). The right example, on the other hand, represents a cut test function. Note that the edge of \(\Gamma^{\mathrm{disc}}\) within the support represents the \(\xi_{d}^{\mathrm{disc}}\) required for that test function, as indicated by the blue lines and the added nested DWQ points adjacent to them. Compared to the individual placement of \(\xi_{d}^{\mathrm{disc}}\) described in Section 4.4.1, the number of cut test functions may increase since the approximation by \(\Gamma^{\mathrm{disc}}\) can introduce superfluous Gauss elements, as discussed in the previous paragraphs. Indeed, Figure 6 shows this circumstance since the lowest vertical edge of \(\Gamma^{\mathrm{disc}}\) is adjacent to Gauss elements. Using boxes with variable \(h_{b}\) may be an option, but the implementation gets more involved. Furthermore, equally sized admissible boxes have the same maximal number of quadrature points \[n_{q}^{b}=\prod_{k=1}^{n_{sd}}(p_{k}+1)\cdot 2+\prod_{k=1}^{n_{sd}}n_{q}^{i} \cdot(h_{b}-2) \tag{12}\] where \(n_{q}^{i}\) is the number of univariate weighted quadrature points per direction within inner elements, e.g., \(n_{q}^{i}=3\) for setting up a stiffness matrix. Knowing the number of points in advance is desirable since the metric and material-dependent part needs to be precomputed at the quadrature points for sum factorization. As highlighted in [27], this is a drawback since the overall number of quadrature points \(n_{q}\) has no upper bound with patch refinement. Therefore, the boxes can be used directly for balancing the computational and memory load, which is also beneficial when considering parallelization of the computation. Figure 6: Weighted quadrature point assignement based on the box partition interface \(\Gamma^{\mathrm{disc}}\). Left: the test function’s support (blue) does not intersect with \(\Gamma^{\mathrm{disc}}\) allowing the use of WQ points. Right: the test function’s support (yellow) intersects with \(\Gamma^{\mathrm{disc}}\) yielding to a DWQ rule where \(\xi_{d}^{\mathrm{disc}}\) are the extensions of \(\Gamma^{\mathrm{disc}}\) within the support. The intersection and its extensions are indicated by blue lines. We close this section by comparing the quadrature point layout of both discussed approaches for detecting artificial discontinuities. Figure 7 depicts the quadrature points for two partially overlapping cut test functions. The individual placement concept yields an overlap of Gauss and weighed quadrature points. The number of affected elements correlates to the size of the cut test functions support and, thus, to the degree of the background mesh. Using the global interface \(\Gamma^{\mathrm{disc}}\), on the other hand, prevents this behavior at the cost of introducing more nested discontinuous weighted quadrature points. Note that both basis functions share the same \(\xi_{d}^{\mathrm{disc}}\) since they intersect the same edges of \(\Gamma^{\mathrm{disc}}\). ### Estimation of the computational cost We recapitulate the number of floating point operations for setting up a 3D mass matrix of a tensor product spline of degree \(p=p_{1}=\dots=p_{n_{sd}}\) with maximal smoothness [27]: 1. \(c\cdot p^{9}\) for element assembly and formation by looping over Gauss points, 2. \(c_{1}\cdot p^{5}+c_{2}\cdot p^{6}+c_{3}\cdot p^{7}\) for element assembly and sum factorization using Gauss quadrature, 3. \(c_{1}\cdot p^{7}+c_{2}\cdot p^{6}+c_{3}\cdot p^{5}\) for row assembly and sum factorization using Gauss quadrature, and 4. \(c_{1}\cdot p^{4}+c_{2}\cdot p^{4}+c_{3}\cdot p^{4}\) for row assembly and sum factorization using weighted quadrature. For sum factorization, the different costs refer to the separated stages of the process - one per parametric direction. These estimates refer to the full, non-cut, spline discretization, i.e., the background mesh. However, these cost estimates can be associated with the immersed boundary method when using the combined placement of artificial discontinuities discussed in Section 4.4.2. In particular, (a) is assigned to cut elements, (b) refers to the costs related to the Gauss elements, and (d) applies to test functions subjected to WQ. It remains to estimate Figure 7: Quadrature points of partially overlapping cut test functions. Left: quadrature points due to an individual placement of \(\xi_{d}^{\mathrm{disc}}\). The color of the related lines indicates the test function \(\xi_{d}^{\mathrm{disc}}\) originates from. Right: Alternative point distribution for the same cut test functions due to the global concept. the costs of DWQ for cut test functions. Due to the nested DWQ points next to the artificial discontinuities \(\xi_{d}^{\text{disc}}\), there is a mix of \(p+1\) and \(n_{q}^{i}\) points within the related region \(\mathcal{S}_{\mathbf{i}}^{\Omega_{\text{WQ}}^{\text{TV}}}\). If there is only a single \(\xi_{d}^{\text{disc}}\), the quadrature point distribution is the same as for non-cut boundary test functions. In the case of multiple \(\xi_{d}^{\text{disc}}\), however, the worst-case scenario where all elements contain \((p+1)^{n_{sd}}\) points is possible. Thus, we consider (c) a conservative estimate for the cost of DWQ. The number of floating point operations will often be less since \(\mathcal{S}_{\mathbf{i}}^{\Omega_{\text{WQ}}^{\text{TV}}}\) covers only a subregion of the test function's support. To sum up, the cost for the fast formation and assembly for an immersed boundary method can be estimated by \[\begin{split}& N_{WQ}\left(c_{1}\cdot p^{4}+c_{2}\cdot p^{4}+c_{3} \cdot p^{4}\right)\\ +& N_{DWQ}\left(c_{1}\cdot p^{7}+c_{2}\cdot p^{6}+c_ {3}\cdot p^{5}\right)\\ +& N_{REG}\left(c_{1}\cdot p^{5}+c_{2}\cdot p^{6}+c_ {3}\cdot p^{7}\right)\\ +& N_{CUT}\left(c\cdot p^{9}\right)\end{split} \tag{13}\] where \(N_{WQ}\) and \(N_{DWQ}\) are the number of interior and cut test functions, while \(N_{REG}\) and \(N_{CUT}\) refer to the number of Gauss and cut elements. Apparently, the cost of \(N_{WQ}\) is the one with the lowest complexity, i.e., \(\mathcal{O}\left(N_{WQ}\,p^{n_{sd}+1}\right)\), which may be undermined by the other contributions with \(\mathcal{O}\left(\left(N_{REG}+N_{DWQ}\right)p^{2n_{sd}+1}\right)\) and \(\mathcal{O}\left(N_{CUT}\,p^{3n_{sd}}\right)\). Luckily, \(N_{REG}\) and \(N_{CUT}\) depend primarily on the boundary \(\Gamma\), the interface \(\Gamma^{\text{disc}}\), and the element size \(h\) of the background mesh. Thus, they do not change with \(p\). \(N_{DWQ}\) and \(N_{WQ}\), on the other hand, increase and decrease under \(p\)-refinement, respectively, due to the enlargement of the test functions' supports. Hence, the number of test functions integrated by (discontinuous) weighted quadrature rules counteracts the contribution of \(N_{CUT}\) to some extent. More importantly, \(N_{CUT}\) does not scale with \(h^{n_{sd}}\) but with the number of elements intersected by \(\Gamma\), which has a lower dimension of approximately \(h^{n_{sd}-1}\). Also, \(N_{REG}\) and \(N_{DWQ}\) increase slower with \(h\) than \(N_{WQ}\). Put differently, the contribution of \(N_{WQ}\) becomes more dominant under \(h\)-refinement, and the finer discretization, the more vital becomes efficiency. ## 5 Elastostatics Let us shortly recap the problem considered, using the following notation. We adopt the summation convention and use indices \(i,j,k,l\in{1,2,3}\) to denote components in physical space. The partial derivative of a component \(v_{i}\) of a vector field \(\mathbf{v}\) shall be denoted by \(v_{i,j}\). In addition, we consider the symmetric gradient, which shall be denoted by \(v_{(i,j)}:=\frac{1}{2}(v_{i,j}+v_{j,i})\). ### Model problem Let \(\Omega^{\text{v}}\subset\square\) denote the three-dimensional _physical domain_ and \(\square\) a bounding box referred to as the _uncut domain_, which is the smallest enclosing rectangular domain. The physical domain \(\Omega^{\text{v}}\) is an open set with piecewise smooth boundary \(\Gamma=\overline{\Gamma_{g_{k}}\cup\Gamma_{t_{k}}}\), with \(\Gamma_{g_{k}}\cap\Gamma_{t_{k}}=\emptyset\) and outward unit normal vector \(\mathbf{n}\). We consider displacements in a space \(\mathbf{V}\) with components in \(H^{1}(\Omega^{\text{v}})\) and let \(\mathbf{V}_{g}\subset\mathbf{V}\) denote the subspace that satisfies the Dirichlet conditions on \(\Gamma_{g_{k}}\), \(k=1,2,3\). In particular, \(\mathbf{V}_{0}\), denotes the space with homogeneous Dirichlet conditions. Let the displacement be decomposed as \(\mathbf{V}_{g}\ni\mathbf{u}=\mathbf{v}+\mathbf{g}\), with \(\mathbf{v}\in\mathbf{V}_{0}\) and \(\mathbf{g}\in\mathbf{V}_{g}\). The weak form of the elastostatics problem seeks \(\mathbf{v}\in\mathbf{V}_{0}\) such that \[a(\mathbf{v},\mathbf{w})=l(\mathbf{w})-a(\mathbf{g},\mathbf{w})\quad\forall\mathbf{w}\in\mathbf{V}_{0} \tag{14a}\] with the bilinear and linear form given by \[a(\mathbf{v},\mathbf{w}) =\int_{\Omega^{\mathrm{v}}}w_{(i,j)}\,c_{ijkl}\;v_{(k,l)}dx \mathbf{v},\mathbf{w}\in\mathbf{V} \tag{14b}\] \[l(\mathbf{w}) =\int_{\Omega^{\mathrm{v}}}w_{i}\,f_{i}\,dx\;+\;\sum_{i=1}^{3}\int _{\Gamma_{t_{i}}}w_{i}\,t_{i}\,ds \mathbf{w}\in\mathbf{V}. \tag{14c}\] Here \(f_{i}\) denote the components of a conservative force vector and \(t_{i}=\sigma_{ij}\,n_{j}\) denotes the traction on the Neumann boundary. Furthermore, \(c_{ijkl}\) denotes the fourth order stiffness tensor. In this article, we consider an isotropic material, which implies that \(c_{ijkl}(x)=\mu(x)\,(\delta_{ik}\delta_{jl}+\delta_{il}\delta_{jk})+\lambda(x) \delta_{ij}\delta_{kl}\), see [31]. In our testcases, the Lame parameters \(\mu\) and \(\lambda\) are positive constants, given in terms of the Young's modulus \(E\) and Poisson's ratio \(\nu\) as \(\lambda=\nu E/((1+\nu)(1-2\nu))\) and \(\mu=E/(2(1+\nu))\). ### The discretized problem In the Galerkin method, we consider discrete displacement fields in a finite-dimensional subspace \(\mathbf{V}^{h}\subset\mathbf{V}\) and consider functions \(\mathbf{V}^{h}_{g}\subset\mathbf{V}^{h}\) that approximately satisfy the Dirichlet condition on \(\Gamma_{g_{k}}\), \(k=1,2,3\). We partition the boundary data into two parts that are treated differently. We consider \[\begin{cases}\Gamma_{g_{k}}\cap\partial\Box&\text{Strong imposition}\\ \Gamma_{g_{k}}\,\setminus\,\partial\Box&\text{Weak imposition}\end{cases} \tag{15}\] Weak imposition of Dirichlet data can be done simply via a penalty method, or using Nitsche. In the considered benchmarks such a term is not needed and so we focus on strong imposition of Dirichlet data and, clearly, weak imposition of natural boundary conditions, which is straightforward on fictitious domains. We consider the discrete space with homogeneous boundary conditions, \(\mathbf{V}^{h}_{0}\). For each component \(k\in 1,2,3\), we consider an expansion in terms of basis functions \[v^{h}_{k}(x)=\sum_{\mathbf{i}=1}^{N_{k}}v^{(k)}_{\mathbf{i}}\,N^{(k)}_{ \mathbf{i}}(x). \tag{16}\] The basis functions, \(N^{(k)}_{\mathbf{i}}(x)\), are linear combinations of B-splines, determined via the extended B-spline concept proposed in [29, 28]. It is shown therein that the resulting set of shape functions are linearly independent and have good stability properties, with respect to small cut elements. Extended B-splines may be conveniently implemented via a spline extraction matrix \(\mathbf{C}^{(k)}\in\mathbb{R}^{N_{k}\times M}\) \[N^{(k)}_{\mathbf{i}}(x)=\sum_{\mathbf{j}=1}^{M}\mathbf{C}^{(k)}_{\mathbf{i}\mathbf{ j}}\,B_{\mathbf{j}}(x) \tag{17}\] Here \(N_{k}\leq M\) denotes the dimension of the space of the \(k\)th component of displacement and \(M\) denotes the dimension of the spline space on the uncut domain \(\Box\). The entries in \(\mathbf{C}^{(k)}_{\mathbf{i}\mathbf{j}}\) are determined using the approach in [29, 28] such that all polynomials of degree \(p\) are preserved. Homogeneous boundary conditions on \(\Gamma_{g_{k}}\cap\partial\Box\) are implemented, simply by the condition that all polynomials need to be preserved which satisfy the homogeneous boundary condition. With this in place, the Galerkin method seeks \(\mathbf{v}^{h}\in\mathbf{V}^{h}_{0}\) such that \[a(\mathbf{v}^{h},\mathbf{w}^{h})=l(\mathbf{w}^{h})-a(\mathbf{g}^{h},\mathbf{w}^{h}) \quad\forall\mathbf{w}^{h}\in\mathbf{V}^{h}_{0}. \tag{18}\] The computed displacement is then determined as \(\mathbf{u}^{h}=\mathbf{v}^{h}+\mathbf{g}^{h}\). ### Application of sum factorization The application of sum factorization and weighted quadrature to this problem follows exactly the description provided in [27] and is, thus, not repeated here. The only difference is that each cut test function may consist of a set of tensor product regions that possess different combinations of WQ and DWQ weights. Hence, the preparation of extracting the correct non-zero weights requires more attention. Once the interior and cut test functions are assembled, the element contribution of the cut and Gauss elements are added as well. _Remark:_ When using the individual placement of the artificial discontinuities, it has to be stored what Gauss element is associated with which cut test function. In the scheme with the global interface, this is not needed. ## 6 Numerical results In this section, we investigate the efficiency of the proposed assembly and formation technique. Therefore, we revisit the numerical benchmark problems for linear elasticity shown in Figure 8, which have been used in [27] for boundary-fitted isogeometric discretization. Here, we apply them to the immersed boundary setting where the background mesh is defined by splines with maximal smoothness, and the cutting boundary \(\Gamma\) is specified by a level set function \(\phi\). The implementation for the numerical experiments is built upon the feather-ecosystem1, which is a multiphysics isogeometric environment written in The Julia Programming Language [3]. At its core, it relies on a sum factorization implementation optimized for element-by-element formation. Hence, it provides a competitive reference solution concerning timings. Besides, the code of the proposed discontinuous weighted quadrature utilizes the same representations as the feather-ecosystem and uses its functions whenever possible to obtain a fair comparison. Cut elements are integrated by a Julia wrapper to the Algoim2 library - a C++ implementation of the routines presented in [56, 57]. Like Gauss quadrature rules, the number of integration points increases with the degree by \(\mathcal{O}\left(p^{n_{sd}}\right)\); hence, the same cost estimates apply. Footnote 1: [https://gitlab.com/feather-ecosystem](https://gitlab.com/feather-ecosystem), ImmersedSplines v0.5.0, accessed 8.6.2023 Footnote 2: [https://github.com/JuliaBinaryWrappers/algoim_jil,jl](https://github.com/JuliaBinaryWrappers/algoim_jil,jl), v0.1.0, accessed 26.7.2023 The timings are measured with the Julia package TimerOutputs.jl3, which has a small overhead in timing a code section (\(0.25\mu s\) according to the package's documentation). The reported timings are, however, large enough not to be spoilt by this noise. All computations are performed in serial, and the timings are the average of three successive runs. We measure the total Figure 8: The considered benchmark problems for linear elasticity timings for three different approaches: * _Element assembly_: integration of all interior elements by element-by-element formation using standard Gauss quadrature rules and sum factorization * _Row assembly (individual)_: integration of the regular region using the proposed fast formation with the individual placement of artificial discontinuities detailed in Section 4.4.1 * _Row assembly (global)_: integration of the regular region using the proposed fast formation with the placement of artificial discontinuities based on a global interface, as detailed in Section 4.4.2, employing boxes of size \(h_{b}=3\) The first approach is an efficient element-wise technique and serves as a competitive reference implementation; the others are variances of the fast formation and assembly techniques. For the overall simulation process, these three approaches require an additional routine for treating of \(\mathcal{S}^{\mathrm{c}}_{\mathrm{f}}\), which will be measured independently by * _Cut elements_: integration of cut elements using Algoim Furthermore, sub-components of these four main contributions are investigated. The total timings also include assembling the element/test function contributions to the global stiffness matrix. They, however, do not include setting up the right-hand side of the system or solving the final system since these tasks are preformed by the identical routines for all cases studied. We will first present the benchmark problems and their corresponding results in the following two subsections. The third subsection discusses all results together, allowing us to highlight specific similarities and contrasts between the examples. ### Hole in plate problem We first consider an infinite plate with a circular hole under constant in-plane tension in the \(x\)-direction, \(T_{x}=10\), at infinity. The problem description is given in Figure 8(a). The Poisson's ratio \(\nu=0.3\) and the Young's modulus \(E=10^{5}\) specify the linear elastic material. This classic benchmark has a smooth 2D solution (see, e.g., [27]), but we solve it as a 3D problem allowing us to use the same routines for both benchmarks, which improves their comparability. Using symmetry conditions, only a quarter of the plate is modeled by a background mesh of size \(4\times 4\times 1/4\) partitioned into \((n_{el},n_{el},3)\) number of elements per direction with \(n_{el}=\{5,10,20,40\}\). These partitions also provide the knot values for the spline bases of maximal smoothness of degree (\(p\),\(p\),\(p\)) with \(p=\{2,4,6,8\}\). The hole is introduced by the level set function \(\phi=-x^{2}-y^{2}+1.0\), which cuts out a quarter circle of radius \(R=1\) at the lower left corner of the background mesh. Figure 9: The numerical solution for the discretization of the hole in plate problem using \(p=2\) and \(n_{el}=40\): (a) distribution of the stress component \(\sigma_{xx}\) shown for the entire plate and (b) the relative errors for the displacements \(u\) and stresses \(\sigma\) obtained by the reference element-by-element implementation and the proposed one using the global placement scheme. An example of the obtained errors is summarized in Figure 9. Note that Figure 9(a) displays the whole plate, while only \(1/4\) was used for the simulation. Figure 10 illustrates the absolute formation time for the four key contributions. The triangles indicate the complexity of the timings w.r.t. the degree \(p\). Focusing on the finest discretization, a comparison of the different timing contributions of the row assembly methods is shown in Figure 11. To be precise, the timings for applying WG, DWQ, and integrating the Gauss elements are reported. The remaining graphs refer to the pull-back of the material data at all active integration points to the parameter space [27] and the computation of the weighted quadrature rules. Figure 11: Hole in plate problem: various timing components of the row assembly strategies which only differ in the placement scheme (left/right) for the artificial continuities. Figure 10: Hole in plate problem: absolute formation time in seconds for all degrees \((p,p,p)\) considered and the two finest discretization, (left) \(n_{el}=20\) and right \(n_{el}=40\). Here, we focus again on the \(p\)-related evolvement. In Figure 12, on the other hand, the different timing contributions of the 'row assembly (global)' scheme are related to the number of elements per direction \(n_{el}\). Here, the 'cut test functions' graphs include the integration with DWQ rules and the one for the Gauss elements. ### Spherical cavity problem We now apply the proposed approach to a full 3D problem defined by a spherical cavity located at the origin of an infinite domain subjected to uniform uniaxial tension in the \(z\)-direction, \(T_{z}=10\), at infinity, as illustrated in Figure 8(b). The material parameters are set to the Poisson's ratio \(\nu=0.3\) and the Young's modulus \(E=10^{5}\). We again refer to [27] for the analytic reference solutions. To be precise, Figure 8(b) shows the description for a boundary-fitted spline discretization. In this work, the outer boundaries will be defined by the non-cut boundary of the background mesh, which has the size \(4\times 4\times 4\). The cavity of radius \(a=1\) is given by \(\phi=-x^{2}-y^{2}-z^{2}+1.0\). The spline discretizations investigated have degree (\(p\),\(p\),\(p\)) Figure 12: Hole in plate problem: different timings components of ‘row assembly (global)’ and their development due to \(h\)-refinement of the background mesh which is expressed by the number of elements per direction \(n_{el}\). Figure 13: The numerical solution for the discretization of the spherical cavity problem using \(p=2\) and \(n_{el}=10\): (a) distribution of the stress component \(\sigma_{zz}\) shown for the entire domain, and (b) the relative errors for the displacements \(u\) and stresses \(\sigma\) obtained by the reference implementation and the proposed one using the global placement scheme. with \(p=\{2,4,6,8\}\) and number of elements per direction \((n_{el},n_{el},n_{el})\) with \(n_{el}=\{5,10,21\}\). Case \(n_{el}=20\) led to errors for degree 8 in subroutines related to the integration of cut element and has therefore been skipped. Figure 13 reports the errors of the row assembly scheme and the reference implementation for an example discretization of the problem. Figure 13(a) displays the entire domain, while the removed \(1/8\) of the cube is the actual computational domain. The total formation times and the corresponding complexity are illustrated in Figure 14, and Figure 15 details the different contributions of the row assembly timings obtained for the finest discretization. Furthermore, Figure 16 focuses on the subparts of the 'row assembly (global)' and their behavior w.r.t. the number of elements \(n_{el}\). Finally, we split the total time into the contributions due to the formation of the element or test functions contribution and the assembly to the global stiffness matrix. Figure 17 compares the element-by-element reference routines divided into 'element assembly' and 'element formation', and the row-based one presented consisting of 'WQ/DWQ formation' and 'row assembly'. Hereby, formation refers to the computation of the element or test function contributions, and assembly denotes the assignment of these contributions to the global stiffness matrix. Recall that both formation schemes employ sum factorization. Figure 16: Spherical cavity problem: different timings components of ‘row assembly (global)’ and their development due to \(h\)-refinement of the background mesh which is expressed by the number of elements per direction \(n_{el}\). Figure 17: Spherical cavity problem: timings for the formation of stiffness contributions and their assembly to the global matrix: ‘element formation’ utilized Gauss rules for element-by-element sum factorization, whereas ‘WQ/DWQ formation’ employs (discontinuous) weighted quadrature rules. ### Discussion Here, we interpret the timing results reported in the previous two sections. First, it is apparent that the integration of cut elements is the bottleneck, as shown in Figure 10 and Figure 14, where all related graphs have a slope of 8. This rate would also be the performance obtained by a conventional element-by-element routine that loops over Gauss points. At the same time, the results confirm that this cost contribution decreases with the fineness of the discretization. This conclusion can be drawn by comparing the coarser discretizations with the finer ones by looking at the left and right illustrations as well as opposing Figure 10 and Figure 14. It is noteworthy that the slope of the row assembly results decreases with the greater \(n_{el}\), which indicates that the factor contributed by the most efficient part, i.e., the WQ of interior test functions, becomes dominant. Figure 12 and Figure 16 provide further support for this statement, not only for the row assembly with cut and interior test functions but, more importantly, also for the comparison with the integration of cut elements. Let us now focus on the different row assembly schemes using an (i) individual or (ii) global positioning of the artificial discontinuities \(\xi^{\text{disc}}\). There is a small difference when comparing the total timings. However, the distinguishing behavior surfaces when the different contributions are examined. The affected timings are reported in Figure 11 and Figure 15 by the graphs related to 'DWQ' and 'Gauss elements' since their sum refers to the time needed to integrate all cut test functions. Especially for the spherical cavity problems, it can be seen that 'DWQ' scales better for the individual placement, which can be attributed to the fact that this scheme introduces fewer \(\xi^{\text{disc}}\). This circumstance is also beneficial for the time 'quad. rules' associated with setting up the weighted quadrature rules. However, the 'Gauss elements' graph scales much worse. This contribution is the major weakness of the individual positioning, and it is hard to assess in general since it depends on the degree and the shape of the boundary \(\Gamma\). For the global approach, on the other hand, 'DWQ' and 'Gauss elements' have virtually the same slope, which complies with the estimate (13). Note that the 'pull-back' time is also better, which can be partly explained by the fact that the boxes of the global construction can be directly used for partitioning the quadrature points into tensor product regions, whereas, for the individual concept, this has to be generated separately. We close this discussion by taking a closer look at the performance of the reference solution 'element assembly' and the proposed 'row assembly' using the global strategy. In particular, Figure 17 divides the total time into a formation and assembly part. Here, it can be seen that the element formation scales worse with \(p\) than the weighed quadrature one. Moreover, the element assembly is a dominant factor for the computation time, while the row assembly is almost neglectable. At the same time, it should be noted that the assembly of element contribution can be implemented more efficiently, for example, by utilizing the matrix structure. The reported timings do not take advantage of such concepts. discontinuous weighted quadrature. In this paper, we derive these rules for setting up stiffness matrices based on concepts presented in [27]. Furthermore, we propose a more effective way to construct them, which also allows an estimation of the overall computational cost. The approach introduces an interface \(\Gamma^{\mathrm{disc}}\) that divides the domain of interest into a parts integrated by Gauss and weighted quadrature, respectively. This \(\Gamma^{\mathrm{disc}}\) provides the possible artificial discontinuities which determine the discontinuous weighted quadratures required. The overall cost of the fast immersed boundary method is determined by (i) the number of cut elements, \(N_{CUT}\), (ii) the number of cut test functions, \(N_{DWQ}\), and associated regular elements, \(N_{REG}\), and (iii) the number of interior test functions, \(N_{WQ}\). The corresponding number of operations varies from \(\mathcal{O}\left(N_{CUT}\,p^{3n_{sd}}\right)\) over \(\mathcal{O}\left(\left(N_{DWQ}+N_{REG}\right)p^{2n_{sd}+1}\right)\) to \(\mathcal{O}\left(N_{WQ}\,p^{n_{sd}+1}\right)\). For coarse discretizations, the cut element contribution dominates the overall cost, but the influence of \(N_{WQ}\) increases with \(h\)-refinement. Our numerical experiments of two linear elasticity benchmarks confirm this behavior. Nevertheless, improving the complexity of \(N_{CUT}\) is an interesting future research direction. The integration of any advancement in this regard into the presented methodology is straightforward since the integration of cut elements is independent of the other components. Regarding weighted quadrature, the number of points can be reduced by including boundary points in the layout; however, the correct assignment of the boundary point contributions needs special attention. ## Acknowledgements Benjamin Marussig was partially supported by the SFB TRR361/F90 CREATOR funded by the German Research Foundations DFG and the Austrian Science Fund FWF. ## Appendix A Knot insertion and subdivision matrix Knot insertion denotes the refinement of a B-spline object by adding knots \(\tilde{\xi}\) into its knot vector \(\Xi\). This procedure results in a nested spline space, and the subdivision matrix \(\tilde{\mathbf{S}}\ :\ \mathbb{R}^{n}\mapsto\mathbb{R}^{\tilde{n}}\) encodes the coefficients of the initial coarse representation and the refined one. Considering quadrature weights, we obtain the relation \[\tilde{w}_{i}=\sum_{j=1}^{n}\tilde{\mathbf{S}}_{ij}\ w_{j}\] for \[i=1,\ldots,\tilde{n} \tag{19}\] where \(\tilde{w}_{i}\) refers to quadrature weights computed for the refined basis functions. If only one knot is inserted, i.e., \(\tilde{\Xi}=\Xi\cup\tilde{\xi}\), where \(\tilde{\xi}\in[\xi_{s},\xi_{s+1})\), the non-zero entries of \(\tilde{\mathbf{S}}\) are determined by \[\begin{cases}\tilde{\mathbf{S}}(k,k-1)&=1-\alpha_{k}\\ \tilde{\mathbf{S}}(k,k)&=\alpha_{k}\end{cases}\qquad\qquad\alpha_{k}=\left\{ \begin{array}{ll}1&k\leqslant s-p\\ \frac{\tilde{\xi}-\xi_{k}}{\xi_{k+p}-\xi_{k}}&s-p+1\leqslant k\leqslant s\\ 0&k\geqslant s+1\end{array}\right. \tag{20}\] Multiple knots can be inserted by repeating this process, and the multiplication of the individual single-knot matrices yields the overall subdivision matrix. For introducing an artificial discontinuity \(\xi^{\mathrm{disc}}\) for the discontinuous weighted quadrature rules, the knot \(\xi^{\mathrm{disc}}\) has to be inserted so that the multiplicity after knot insertion \(\tilde{m}\left(\xi^{\mathrm{disc}}\right)=p+1\). The subdivision matrix used to map values of the refined basis to the initial one is given by \(\mathbf{S}=\tilde{\mathbf{S}}^{\intercal}\).

2304.14014

Current Safety Legislation of Food Processing Smart Robot Systems The Red Meat Sector

Ensuring the safety of the equipment, its environment and most importantly, the operator during robot operations is of paramount importance. Robots and complex robotic systems are appearing in more and more industrial and professional service applications. However, while mechanical components and control systems are advancing rapidly, the legislation background and standards framework for such systems and machinery are lagging behind. As part of a fundamental research work targeting industrial robots and industry 4.0 solutions for completely automated slaughtering, it was revealed that there are no particular standards addressing robotics systems applied to the agrifood domain. More specifically, within the agrifood sector, the only standards existing for the meat industry and the red meat sector are hygienic standards related to machinery. None of the identified standards or regulations consider the safety of autonomous robot operations or human robot collaborations in the abattoirs. The goal of this paper is to provide a general overview of the regulations and standards (and similar guiding documents) relevant for such applications, that could possibly be used as guidelines during the development of inherently safe robotic systems for abattoirs. Reviewing and summarizing the relevant standard and legislation landscape should also offer some instrumental help regarding the foreseen certification procedure of meat processing robots and robot cells for slaughterhouses in the near future.

Kristof Takacs, Alex Mason, Luis Eduardo Cordova-Lopez, Marta Alexy, Peter Galambos, Tamas Haidegger

2023-04-27T08:20:13Z

http://arxiv.org/abs/2304.14014v1

# Current Safety Legislation of Food Processing Smart Robot Systems - The Red Meat Sector ###### Abstract _Ensuring the safety of the equipment, its environment and most importantly, the operator during robot operations is of paramount importance. Robots and complex robotic systems are appearing in more and more industrial and professional service applications. However, while mechanical components and control systems are advancing rapidly, the legislation background and standards framework for such systems and machinery are lagging behind. As part of a fundamental research work targeting industrial robots and industry 4.0 solutions for completely automated slaughtering, it was revealed that there are no particular standards addressing robotics systems applied to the agri-food domain. More specifically, within the agri-food sector, the only standards existing for the meat industry and the red meat sector are hygienic standards related to machinery. None of the identified standards or regulations consider the safety of autonomous robot operations or human-robot collaborations in the abattoirs. The goal of this paper is to provide a general overview of the regulations and standards (and similar guiding documents) relevant for such applications, that could possibly be used as guidelines during the development of inherently safe robotic systems for abattoirs. Reviewing and summarizing the relevant standard and legislation landscape should also offer some instrumental help regarding the foreseen certification procedure of meat processing robots and robot cells for slaughterhouses in the near future._ _Keywords: robotic meat processing, robot standardization, agri-food robotics_ ## 1 Introduction In the EU (European Union), the CE mark (Conformite Europeenne) is part of the EU's harmonised legislation, signifying that a product has been assessed to comply with the high safety, health and environmental protection requirements set by the EU. CE mark must be obtained for every new electrical product sold in the EEA (European Economic Area), that supports fair competition too, since all manufacturers have to fulfill the requirements of the same set of rules [1]. The approval procedure can be managed by the manufacturer (this way, the CEO bears all legal responsibility), or by an independent certification body (which is called a Notified Body, in case registered in the EU). Upon the system assessment (carried out by either a Notified Body or the manufacturer), the main goal is to ensure the conformity of the product with the regulations (legal requirements) before the product is put on the European market. By default, standards are voluntary for product manufacturers. They should be based on a consensus between industrial and academic experts, codifying already existing good practices, methods and general requirements. Nevertheless, by definition, they are intended to be the best available set of requirements toward a certain field; for instance, the safety aspects of a type of system, standards often serve as the basis of regulations enacted by lawmakers. For example, the ISO/IEC 60601-1 standard (International Organization for Standardization, International Electrotechnical Commission) regarding medical electrical equipment became the basis of the EC MD (European Commission Machinery Directive) and the subsequent MDD (Medical Device Directive). When a Notified Body is dealing with a new system, it is usually considering the recommendations of some non-compulsory standards during the system assessment as well. Therefore, developers and manufacturers should consider those non-compulsory standards from the early periods of development too. After all, better compliance may increase competitiveness [2]. Until today, the agri-food domain has not seen such structured, specific standards. The increasing autonomy of robots and robotic systems used in the industry has reasonably enhanced certification challenges, only recently evolved standards have the potential to address the safety concerns of this new approach - in an application domain specific manner [3]. It is still an ongoing professional debate to unambiguously define what is a robot or a robotic system. However, efforts for standardization have been extensive in the robotics domain in the past three decades [4]. Traditionally, ISO standards have been providing guidance for safety of robots and robotic systems, and they have been forming the basis of the Machinery Directive [5]. The traditional ISO 8373 - Robots and robotic devices - Vocabulary standard under ISO was published first in 1996, only referring to robots as _Manipulating industrial robots_, but the document was later extended to all kinds of robots (in the ISO sense) [6]. To incorporate all new domains, forms and applications of robots, TC299, the Technical Committee of ISO responsible for this topic, has revised the official definition of robots numerous times in the past decades. The key factors distinguishing robots from other machinery are autonomy, mobility and task-oriented behaviour. The current ISO definition of a robot as per ISO 8373 is [7]: _Programmed actuated mechanism with a degree of autonomy to perform locomotion, manipulation or positioning._ Wherein autonomy is defined as: _Ability to perform intended tasks based on current state and sensing, without human intervention._ Another modern holistic definition of a _robot_ from 2020 was given in the Encyclopedia of Robotics [8]: _A robot is a complex mechatronic system enabled with electronics, sensors, actuators and software, executing tasks with a certain degree of autonomy. It may be pre-programmed, teleoperated or carrying out computations to make decisions._ Robotics is advancing rapidly in practically all professional service domains, entering recently to the agri-food industry and within that, the meat sector as well [9]. A prime example, the robot cell under development within the Ro-BUTCHER project ([https://robutcher.eu](https://robutcher.eu)) aims to carry out the primary cutting and manipulation tasks of a pig slaughtering [10, 11]. The general purpose industrial robots in the cell are supported by RGB-D cameras, Artificial Intelligence, Virtual Reality, intelligent EOAT (End of Arm Tooling), telemanipulation and Digital Twin technology [12, 13, 14]. Accordingly, the designed system will be unprecedented in complexity and autonomy from the safety and legislation aspects. The robots in the Meat Factory Cell (MFC) will handle raw meat products intended for human consumption autonomously, however the risk of contamination due to the presence of the gastrointestinal tract is high. On the other hand, the applied EOAT (grippers, knives and saws) are designed for meat and bone cutting and gripping, making them highly dangerous for humans. Under the current approach for classification within the related standards, the robot cell would be regarded as an industrial service robot application, meaning that it will still fall under the EC MD (2006/42/EC) when assessing the safety assurance of the system (Fig. 1). This paper covers mainly the ISO standards, since they are commonly used in most sectors of the industry, practically world-wide accepted, and they have always been pioneers in the robotics field. Furthermore, ISO certification is often required by industrial customers due to its direct linkage to the EC MD. It is worth mentioning however, that ISO does not act as a Notified Body, meaning that they do not issue certificates, only participate in the process by developing the international standards. The two main options for conformity assessment - according to ISO - are the followings: * the provision by an independent body in written assurance (a certificate) that the product, service or system in question meets specific requirements. * the formal recognition by an independent body, generally known as an accreditation body that a certification body operates according to the international standards. The clear, unambiguous and consistent use of the frequently occurring words, technical terms and expressions in the robot industry is essential, especially when documents with potential legal force are concerned. ISO 8373 states that: _This International Standard specifies vocabulary used in relation with robots and robotic devices operating in both industrial and non-industrial environment._ The standard was recently revised, the latest - third - version is ISO 8373:2021 that cancels and replaces the second edition originally from 2012) [7, 15]. Beside ISO standards, some important and relevant EU directives, guidelines and recommendations were also reviewed and will be summarized in this paper. It is worth mentioning that a relevant Digital Innovation Hub (DIH), called agROBOfood was initiated in 2019, financed by the EU ([https://agrobofood.eu/](https://agrobofood.eu/)). Their motto being "Connecting robotic technologies with the agri-food sector", which means that they aim is to build a European ecosystem for adaptation of robotics and streamline standardization aspirations in Europe [16]. The agROBOfood consortium consists of 7 Regional Clusters involving 49 DIHs and 12 Competence Centers (as of late 2022), actively accelerating the agri-food sector's digital transformation and robotization. ## 2 Industrial robotics applied in the meat sector The automation in the meat industry has started long ago, however its pace is significantly slower compared to other industries. Machines dedicated to accomplish single tasks during the cutting processes were introduced in larger slaughterhouses Figure 1: Conceptual setup of the autonomous pig processing cell in the RoBUCHER project. The carcass is handled by the actuated CHU (Carcass Handling Unit), the intelligent EOATs (knife, gripper) are fixed on the industrial ABB robots along with an RGB-D camera. _Image credit: RoBUCTHER project, RobotNorge AS._ relatively early, however only some simple, straightforward cuts could be automated by these machines. Several examples of such machinery were used and published world-wide in the late 20th century, such as [17] about the modern lamb and beef industry solutions at plants at New Zealand, or the world-wide review of machinery and level of automation of the meat industry by G. Purnell [18]. Broader utilization of industrial robots and robot systems in the meat sector required the development of cognitive systems as well [19]. Nowadays several manufacturers sell commercial intelligent systems for slaughterhouses (e.g., Frontmatec, Marel, Mayekawa, etc.) and the related research activity is significant as well. Mark Seaton from Scott Technology Limited published their experience gained in the last decades in [20]. Their key finding is that product consistency is the paramount advantage of the implementation of their robotised solutions, but shelf life, general product quality and workers' safety can improve as well. Their solutions include, e.g., X-ray based cutting prediction, de-boning with industrial robots and bladesaw that stops under a millisecond. Several review papers were published about the current stage and possibilities of meat industry automation e.g., the paper of Romanov et al. about collaborative robot cells [21], or more general reviews by Khodabandehloo [22] or Esper et al. [12]. ### The RoBUTCHER project The RoBUTCHER research project is funded by the EU, and aims to develop the first entirely automated pig processing robot cell [23]. Therefore, it has been a priority for the study project to establish the framework of guiding documents [24]. The robot cell will carry out all primary steps of the pig-slaughtering with industrial robot arms (according to the EC MD), including the cutting of all four legs, the splitting of the carcass and the evisceration process [10]. Beside the two robots, the cell consists of a motorized carcass handling unit (CHU), intelligent cutting and gripping tools, an RGB-D camera (fixed on one of the robots as well) and some other supplementary equipment (Fig. 1). Modern image processing techniques are widely used in the meat sector to handle the natural variability of animals [25, 26]. The autonomous cutting begins with an imaging sequence, one of the robots moves the RGB-D camera (which is fixed on the shaft of the "smart knife" [27]) to pre-defined positions around the carcass. In a simulation environment (powered by Ocellus: _www.bytemotion.se_) a digital twin of the carcass is constructed from the images, where artificial intelligence (a set of image processing deep neural networks) calculates the desired gripping points and cutting trajectories on the carcass. Although the RoBUTCHER concept strictly rules out all kinds of collaborative behaviour between the machinery and humans, at this point, the supervising operator checks the predicted trajectories on the digital twin using Virtual Reality glasses [28]. They may accept the predicted cutting trajectories, request a new imaging and prediction, or may draw a 3D trajectory in the virtual environment that will be executed by the cutting robot. Thus - in optimal case - the cutting is performed completely without any interaction from human operators. Furthermore, even when the operator chooses to draw new trajectories there is no direct physical interaction, the robots and the operator never share the same workspace. In case of maintenance or any issue within the MFC that requires physical intervention, protective fencing with sensors will ensure that all machinery shuts down while anyone is working inside the cell. This fundamental approach in abattoir-automation introduces several different challenges, not only from the engineering and developing aspects, but also from the safety and legislative side of the development. Automation and generally the robot industry are especially fast evolving and ever-changing fields, and since working together (in a collaborative way) at any level with robots and/or machines is always potentially dangerous, several directives and strict standards apply to robotized solutions [21]. ### Guidance documents for safe industry applications Since the employment of general-purpose robot arms in cell-based automated raw-meat handling or animal slaughtering is unprecedented, no single standard exists that would regulate all aspects of this scenario. To have a thorough view on this domain's standardization, the complete list of Robotistry was scanned for relevant standards, along with traditional online search engines (e.g., Google Scholar, IEEE Explore etc.) [29]. An important document covering almost all aspects of robotics in the EU is the Robotics Multi-Annual Roadmap (MAR), which was also reviewed. However, automated slaughtering seems to be such a special part of robotics, that even the Robotics 2020 MAR does not cover it in detail [30]. The closest to slaughterhouse automation is the "Agriculture Domain" (Chapter 2.4), defined as: _Agriculture is a general term for production of plants and animals by use of paramount natural resources (air, water, soil, minerals, organics, energy, information)._ However, slaughtering itself does not appear in any of the subcategories (Fig. 2), animals are barely mentioned within the document. The only appearance of the meat sector is in the _Food_ section under the _Manufacturing_ sub-domains, where automation and machinery used for deboning and raw-meat handling are mentioned. This lack of recognition of the sector makes solution developers' task especially difficult. In spite of not addressing the meat sector in depth, the recommendations in the "Safety design and certification" section are worth considering. Most of the statements and suggestions can be interpreted to the red meat domain too, although animal rights and animal welfare should always be kept in mind. The _Hardware in Loop_ and the _Semantic Environment Awareness_ sections contain interesting farming-related recommendations as well. The practical and beneficial application of simulations, planning systems, virtual models and semantic environment-representations are discussed, many of which are used in meat sector automation as well (and being used in the RoBUTCHER project). The MAR document, however, only provides general guidelines, suggestions and best practises, while the certification is most crucial in the food industry. Therefore, in this section, the relevant robot industry-related standards will be discussed. ISO/IEC started to work on the integration of the new robotic application domains (e.g., collaborative robotics, medical robotics, self-driving cars) more than a decade ago. Numerous working groups (WGs) are active within the ISO/TC 299 Robotics Technical Committee, dealing with specific fields of robotics; e.g., _Electrical interfaces for industrial robot end-effectors_ (WG 9), _Modularity for service robots_ (WG 6) or _Validation methods for collaborative applications_ (WG 8). One of the most important and fundamental standards for practically every modern industrial automation project is the ISO 12100 Safety of machinery - General principles for design - Risk assessment and risk reduction standard, its latest version is the ISO 12100:2010 [31]. The primary purpose of this standard is to provide engineers and system developers with an overall framework. The document acts as a guidance for decisions during the development of machinery, helping developers to design machines and whole systems that work safely while fulfilling their intended tasks. In spite of all this, at the beginning of the standard in the _Scope_ section it is highlighted that: _It does not deal with risk and/or damage to domestic animals, property or the environment._ It is, therefore, clear that this comprehensive standard does not encompass specific information or advice tailored for meat sector automation projects. ISO 12100:2010 offers a classification of the related safety standards that helps the identification of more specific, relevant ISO standards. This classification of standard-types is used in this paper as well [31]: Figure 2: Simplified structure of agricultural production categories and stakeholders according to the Robotics 2020 MAR. Although the document mentions the meat sector within the agriculture section, it is not presented as a subcategory [30]. * **Type-A standards** (basic safety standards) giving basic concepts, principles for the design and general aspects that can be applied to machinery; * **Type-B standards* * (generic safety standards) dealing with one safety aspect or one type of safeguard that can be used across a wide range of machinery: * **Type-B1 standards* * on particular safety aspects (e.g., safety distances, surface temperature, noise); * **Type-B2 standards* * on safeguards (e.g., two-hand controls, interlocking devices, pressure-sensitive devices, guards); * **Type-C standards** (machine safety standards) dealing with detailed safety requirements for a particular machine or group of machines. In this sense, ISO 12100 is not specifically robotics-standard, rather a more comprehensive one (a type-A standard), covering a wide range of machinery design safety - including robotic applications too. It is, however, intended to be used as the basis for preparation of type-B and type-C safety standards as well, that should be more specific to a given application. Regarding the given domain, presumably the most relevant type-B (more precisely type-B1) standard is the ISO11161:2007 Safety of machinery - Integrated manufacturing systems - Basic requirements [32]. As explained in its introduction, Integrated Manufacturing Systems (IMS) are very different in size, complexity, components, and they might incorporate different technologies that require diverse or specific expertise and knowledge, thus usually more specific (type-C) standards should be identified as well for a given application. As a consequence, this standard mainly describes how to apply the requirements of ISO 12100-1:2003, ISO 12100-2:2003 (and ISO 14121 Safety of machinery, which is currently inactive, due to its integration into ISO 12100) in specific contexts. Figure 3: Graphical representation of hierarchy between standards related to robot system/cell. ISO 11161 as a Type-A standard is on the top level relying on several different Type-B and Type-C standards. The ISO10218:2011 Robots and robotic devices - Safety requirements for industrial robots is a type-C standard, meaning that this document contains specific requirements and guidelines for system safety design that can potentially be used in meat sector automation projects. ISO10218:2011 consists of two main parts: 1. Part 1: Robots [33]; 2. Part 2: Robot systems and integration [34]. While Part 1 only refers to the application of a single robot, Part 2 includes the peripheral elements connected to or working together with the robot(s) too. Part 2, in this sense, is typically more suitable for food-industry projects, since handling of carcasses and meat products usually requires complex EOAT and other external devices (e.g., sensors). Having more robots working together and/or employing external devices results in a "robot system", thus the robot system specific problems (e.g., electrical connection between devices, overlapping workspaces, etc.) shall be considered too [35, 36]. Nevertheless, Part 2 of ISO10218:2011 naturally relies on information presented in Part 1, thus that should also be taken into consideration in all cases when Part 2 is being used. The relationship between the aforementioned ISO standards is shown in Fig. 3. Another type-C standard, ISO/TR 20218-1:2018 Robotics - Safety design for industrial robot systems - Part 1: End-effectors should also be relevant. Meat-industry automation projects typically mean automated deboning and/or meat-cutting, both requiring sharp knives, saws and strong grippers, "potentially dangerous end-effectors" in the wording of the standard (Fig. 4.). Part 2 of ISO/TR 20218-1:2018 is about Figure 4: Typical intelligent EOAT for meat industry automation. The reinforced gripper with pointed claws and the sharp knife are “by design” dangerous robotic tools, even when the robot is not moving. _Image credit: RoBUTCHER Project, Obuda University & NMBU_ manual load/unload stations. This standard offers suggestions for applications where hazard zones are established around the robot(s). In such cases, access restriction to hazard zones and ergonomically suitable work spaces might be important, however, this is not the case in the described autonomous scenario [37]. ISO/TR 20218-1:2018 Part 2 covers collaborative applications too, where human operators and robot systems share the same workspace. However, the recent increase of importance of collaborative robotics resulted in standalone standards for this new special field of robotics, the most significant ISO documents are ISO/TR 15066:2015 Robots and robotic devices - Collaborative robots and ISO/TR 9241-810:2020 Ergonomics of human-system interaction [38, 39]. Beside these specific standards there are several projects and activities offering new solutions and assistance for collaborative robot system development, such as the EU funded _COVR_ project ([https://safearoundrobots.com](https://safearoundrobots.com)) [40]. Nevertheless, meat processing generally requires high payload robots, strong automated tools and single purpose machines that are intended to process and cut human-like tissues. The basic purpose of these devices self-evidently mean unacceptably high risk for any operator within the reach of the robots and the tools (the general workspace), regardless of how strict the safety regulations in place. Therefore, this paper (and the RoBUTCHER project) focuses on the completely automated slaughtering, telepresence of operators and strict physical perimeter guarding, excluding any type of collaborative work. ### ISO 10218: Robots and robotic devices -- Safety requirements for industrial robots ISO 10218:2011 is arguably still the most important ISO standard in relevance of abattoir automation [33, 34]. The latest version of the standard was published in 2011 (more than 10 years ago), but a new version (with a new title: Robotics -- Safety requirements) is currently under development and should be published soon. ISO 10218:2011 mainly offers guidelines and requirements for inherent safe design of machinery (focusing on robots), presenting protective measures, foreseeable hazards and suggestions to eliminate, or at least reduce the risks associated with them. In the standards' terms _hazards_ are possible sources of harm, while the term _risk_ refers to hazard exposure. ISO 10218:2011 Part 1: Industrial robots focuses on individual industrial robots, while Part 2: Robot systems and integration discusses the safety of robot systems and their integration into a larger manufacturing system. The most crucial statement in the standard is that any robot application (or robot system) should be designed in accordance with the principles of ISO 12100 for relevant and predictable hazards. It is worth mentioning as well that the standard emphasizes the fact that - beside the several common and typical hazardous scenarios mentioned in the document - task-specific sources of additional risk are present in most applications that should be examined in detail by the developers as well. ISO 10218 includes important annexes. Annex A presents a list of common significant hazards, classified by their types (mechanical, electrical, etc.). For better understanding examples and potential consequences are presented along with the relevant clause in the standard for each hazard. According to the standard, a suitable hazard identification process should include risk assessment on all identified hazards. Particular consideration shall be given during the risk assessment to the followings: * The intended operations of the robot, including teaching, maintenance, setting and cleaning; * Unexpected start-up; * Access by personnel from any directions; * Reasonably foreseeable misuse of the robot; * The effect of failure in the control system; * Where necessary, the hazards associated with the specific robot application. Risks shall be eliminated, or at least reduced mainly by substitution or by design. If these preferred methods are not feasible, then safeguarding or other complementary methods shall be employed. Any residual risks shall then be reduced by other measures (e.g., warnings, signs, training). ISO 10218 also suggests solutions in many relevant topics, such as: * robot stopping functions; * power loss; * actuating controls; * singularity protection; * axis limiting; * safety-related control system performance. Furthermore, the standard has a dedicated chapter (Information for use) to help preparing a useful and comprehensive documentation (called instruction handbook), using the suggested standard expressions, markings, symbols, etc. Further lists, specific instructions and specific detailed descriptions can be found in the appendix of ISO 10218: * Annex A: List of significant hazards; * Annex B: Stopping time and distance metric; * Annex C: Functional characteristics of three-position enabling device; * Annex D: Optional features; * Annex E: Labelling; * Annex F: Means of verification of the safety requirements and measures. Part 2 (Robot systems and integration) of ISO 10218 states that: _The design of the robot system and cell layout is a key process in the elimination of hazards and reduction of risks [34]._ Correspondingly, this part offers fundamental robot cell layout design principles, referring to different types of workspaces, physical limitations, perimeter safeguarding, manual intervention, human interfacing, ergonomics, etc. Different components of typical robot systems might fall under the scope of other standards too, thus Part 2 of ISO 10218 provides a useful list of those: * Equipotential bonding/earthing requirements (grounding): IEC 60204-1; * Electric power: IEC 60204-1; * Hydraulic power: ISO 4413; * Pneumatic power: ISO 4414; * Actuating control: IEC 60204-1; * Emergency stop function: IEC 60204-1, ISO 13850, IEC 61800-5-2; * Enabling devices: ISO 10218-1-Annex D. ### ISO/TR 20218-1:2018 Robotics -- Safety design for industrial robot systems -- Part 1: End-effectors ISO 20218-1:2018 is a relatively new TR (Technical Report) providing guidance for safe design and integration of EOATs. The standard covers end-effector design, suggested manufacturing principles, integration of an EOAT into a robot system, and necessary information for operation. Part 2 of ISO 20218 is dealing with manual load and unload stations that is out of scope for the red meat sector. The standard's main suggestion is to avoid dangerous structures by design on EOAT, e.g., sharp edges and pointed corners. Nonetheless, knives and saws are indispensable tools of meat-processing robot systems, thus the only option is risk-minimization. Risk reduction in such cases is mostly solved by physical protective devices and built-in safety-related control systems. Commonly used examples for the latter include capabilities for force sensing, speed monitoring, presence sensing, emergency stop. Besides covering sharp and pointed EOAT, ISO 20218 has a dedicated section for grippers, highlighting grasp-type grippers (force closure and form closure types), magnetic grippers and vacuum grippers. Grasp-type and vacuum grippers are commonly used in the meat-industry too, the RoBUTCHER project employs smart grasp-type grippers as EOAT and arrays of vacuum grippers as part of the robot system as well [41]. ISO 20218 contains annexes as well, including references to potentially relevant other standards and presenting real risk assessment scenarios. Furthermore, there are suggestions with examples for safety-rated monitored stopping, gripper safety performance assessment and a table about potential hazards, their possible origins and consequences. ## 3 Food-safety standards In food industry automation projects, hygiene aspects and general food-safety are almost as important concerns as the safety of operators and machinery. Despite the fact that this article focuses on the safety regulations of food-sector robotics, food-safety should be mentioned as well, since the two topics are obviously strongly related [42]. ISO 22000:2018 Food safety management defines food safety as [43]: _Assurance that food will not cause an adverse health effect for the consumer when it is prepared and/or consumed in accordance with its intended use._ This comprehensive standard suggests the adoption of a Food Safety Management System (FSMS), claiming that it has a great potential in helping to develop a system's performance regarding food safety [44]. The most important benefits of introducing an FSMS are: * The organization improves its ability to consistently provide safe products and food-related services that meet customer needs and satisfy all regulatory and statutory requirements; * Identifying and addressing hazards associated with its products and services; * The ability to demonstrate conformity to specified FSMS requirements. The most general ISO standard in this topic is the ISO 22000:2018 Food safety management systems - requirements for any organization in the food chain [43]. The standard introduces a practical plan-do-check-act (PDCA) cycle in details, that shall be used at the development process of an FSMS. The PDCA should also be able to help with improving the FSMS's efficiency to achieve safe production and services along with fulfilling relevant requirements. The technical segment of ISO 22000 specifies the implementation of the PDCA cycle, offers suggestions about the tasks of the organization, and clarifies the communication, operation and documentation that is required to preserve the safety operation. The standard also covers hazard control, analysis and assessment, emergency response, monitoring and measuring. Its last sections offer possibilities and methods for internal auditing, review of management systems and continuous long-term improvement. As ISO 22000 is a comprehensive standard, it suggests potentially relevant more specific standards, as well as other important official documents, such as: * ISO/TS 22002 Prerequisite programmes on food safety; * ISO/TS 22003 Food safety management systems -- Requirements for bodies providing audit and certification of food safety management systems; * CAC/RCP 1-1969 General Principles of Food Hygiene; ## 4 Discussion Although the number of machinery safety related standards for industrial robotics applications became rather large in the past decades, the selection for the fast growing domain of service robots is significantly smaller. Furthermore, there is no technically comprehensive standard for agri-food robotics applications, that would cover all safety aspects, and no specific standard that would cover meat industry automation. Regarding the automated meat processing applications with industrial robots (e.g., the Meat Factory Cell developed within the RoBUTCHER Project, see Fig. 1), the general suggestion of the ISO standards is to follow the minimum hazard principle by methodically identifying and eliminating (or at least reducing) the risk factors. The most relevant ISO standard that was identified in this review is the ISO 10218, which is more than 10 years old, yet a new version is currently under development. According to this type-C standard, a systematic solution for safe design based on the existing relevant ISO standards should be possible to be given, even to novel, innovative robotic systems and applications. However, the Notified Body chosen to certify a new system might propose different or additional requirements. The adoption of already existing safety related guidelines from other domains e.g., from medical robotics, where safety requirements has been linked to the level of autonomy of a robotic system, to the food sector is currently the best-practise, and could be a beneficial method [3, 45]. Generally, the maximum safety control principle of a robot cell (e.g., development of advanced teleoperated systems instead of collaborative operations, especially when the robot cell contains remarkably dangerous tools) most likely will increase the applicability and deployability of such developments in the future. It is also worth mentioning that despite the general public (and official bodies as well) increasing support for sustainability in development of robotic applications with regulations [46, 47], the appropriate guidelines for streamlined implementations are still missing [48]. Similarly, in spite of robot ethics becoming a general discussion topic, the establishment of proper standards and guidelines was just launched in the robotics and automation domains [49, 50]. ## 5 Conclusion Nowadays, it is clear that automation and robotization mean the long-term solutions for many services and industrial applications. However, due to the complexity of the tasks in the food industry (agriculture and meat-processing as well), in many cases, it is still necessary to have human operators in the workplace too. This new kind of collaboration between humans and autonomous robots has elevated need for new and adapting safety features, thus for associated safety guidelines and standards too. The development of such regulations are in their early stages yet, however - derived from the existing standards - implementation of safety features will remain the manufacturer's responsibility, as ss_afety by design_ is still the preferred design principle. ## Acknowledgment This work has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No 871631, RoBUTCHER (A Robust, Flexible and Scalable Cognitive Robotics Platform). P. Galambos's work is partially supported by Project no. 2019-1.3.1-KK-2019-00007, provided by the National Research, Development and Innovation Fund of Hungary. T. Haidegger is a Bolyai Fellow of the Hungarian Academy of Sciences. We acknowledge the assistance of RobotNorge AS with this topic as a partner in the RoBUTCHER project. ## Abbreviations The following abbreviations are used in this article: \begin{tabular}{l l} CE & Conformite Europeenne \\ CEO & Chief Executive Officer \\ DIH & Digital Innovation Hub \\ DoF & Degrees of Freedom \\ EC MD & European Commission Machinery Directive \\ EOAT & End of Arm Tooling \\ EU & European Union \\ FSMS & Food Safety Management System \\ IEC & International Electrotechnical Commission \\ IMS & Integrated Manufacturing System \\ ISO & International Organization for Standardization \\ MAR & Multi-Annual Roadmap \\ PDCA & Plan-Do-Check-Act \\ RGB-D camera & Red-Green-Blue-Depth camera \\ TC & Technical Committee \\ TR & Technical Report \\ \end{tabular}

2310.16944

Zephyr: Direct Distillation of LM Alignment

We aim to produce a smaller language model that is aligned to user intent. Previous research has shown that applying distilled supervised fine-tuning (dSFT) on larger models significantly improves task accuracy; however, these models are unaligned, i.e. they do not respond well to natural prompts. To distill this property, we experiment with the use of preference data from AI Feedback (AIF). Starting from a dataset of outputs ranked by a teacher model, we apply distilled direct preference optimization (dDPO) to learn a chat model with significantly improved intent alignment. The approach requires only a few hours of training without any additional sampling during fine-tuning. The final result, Zephyr-7B, sets the state-of-the-art on chat benchmarks for 7B parameter models, and requires no human annotation. In particular, results on MT-Bench show that Zephyr-7B surpasses Llama2-Chat-70B, the best open-access RLHF-based model. Code, models, data, and tutorials for the system are available at https://github.com/huggingface/alignment-handbook.

Lewis Tunstall, Edward Beeching, Nathan Lambert, Nazneen Rajani, Kashif Rasul, Younes Belkada, Shengyi Huang, Leandro von Werra, Clémentine Fourrier, Nathan Habib, Nathan Sarrazin, Omar Sanseviero, Alexander M. Rush, Thomas Wolf

2023-10-25T19:25:16Z

http://arxiv.org/abs/2310.16944v1

# Zephyr: Direct Distillation of LM Alignment ###### Abstract We aim to produce a smaller language model that is aligned to user intent. Previous research has shown that applying distilled supervised fine-tuning (dSFT) on larger models significantly improves task accuracy; however, these models are unaligned, i.e. they do not respond well to natural prompts. To distill this property, we experiment with the use of preference data from AI Feedback (AIF). Starting from a dataset of outputs ranked by a teacher model, we apply distilled direct preference optimization (dDPO) to learn a chat model with significantly improved intent alignment. The approach requires only a few hours of training without any additional sampling during fine-tuning. The final result, Zephyr-7B, sets a new state-of-the-art on chat benchmarks for 7B parameter models, and requires no human annotation. In particular, results on MT-Bench show that Zephyr-7B surpasses Llama2-Chat-70B, the best open-access RLHF-based model. Code, models, data, and tutorials for the system are available at [https://github.com/huggingface/alignment-handbook](https://github.com/huggingface/alignment-handbook). Figure 1: Model performance on MT-Bench. We compare Zephyr-7B, trained with distilled direct preference optimization (dDPO), to proprietary models as well as larger, open-access models like Llama2-Chat-70B that were additionally trained using reinforcement learning on a large amount of human feedback. ## 1 Introduction Smaller, open large language models (LLMs) have greatly increased in ability in recent years, from early GPT-2-like models (Wang and Komatsuzaki, 2021) to accurate and compact models (Touvron et al., 2023; Penedo et al., 2023; Jiang et al., 2023) that are trained on significantly more tokens than the "compute-optimal" amount suggested by the Chincilla scaling laws (De Vries, 2023). In addition, researchers have shown that these models can be further trained through distilled supervised fine-tuning (dSFT) based on proprietary models to increase their accuracy (Taori et al., 2023). In this approach, the output of a more capable teacher model is used as supervised data for the student model. Distillation has proven to be an effective tool for improving open models on a range of different tasks (Chiang et al., 2023); however, it does not reach the performance of the teacher models (Gudibande et al., 2023). Users have noted that these models are not "intent aligned", i.e. they do not behave in a manner that aligns with human users' preferences. This property often leads to outputs that do not provide correct responses to queries. Intention alignment has been difficult to quantify, but recent work has led to the development of benchmarks like MT-Bench (Zheng et al., 2023) and AlpacaEval (Li et al., 2023) that specifically target this behavior. These benchmarks yield scores that correlate closely with human ratings of model outputs and confirm the qualitative intuition that proprietary models perform better than open models trained with human feedback, which in turn perform better than open models trained with distillation. This motivates careful collection of human feedback for alignment, often at enormous cost at scale, such as in Llama2-Chat (Touvron et al., 2023). In this work, we consider the problem of aligning a small open LLM entirely through distillation. The main step is to utilize AI Feedback (AIF) from an ensemble of teacher models as preference data, and apply distilled direct preference optimization as the learning objective (Rafailov et al., 2023). We refer to this approach as dDPO. Notably, it requires no human annotation and no sampling compared to using other approaches like proximal preference optimization (PPO) (Schulman et al., 2017). Moreover, by utilizing a small base LM, the resulting chat model can be trained in a matter of hours on 16 A100s (80GB). To validate this approach, we construct Zephyr-7B, an aligned version of Mistral-7B (Jiang et al., 2023). We first use dSFT, based on the UltraChat (Ding et al., 2023) dataset. Next we use the AI feedback data collected in the UltraFeedback dataset (Cui et al., 2023). Finally, we apply dDPO based on this feedback data. Experiments show that this 7B parameter model can achieve performance comparable to 70B-parameter chat models aligned with human feedback. Results show improvements both in terms of standard academic benchmarks as well as benchmarks that take into account conversational capabilities. Analysis shows that the use of preference learning is critical in achieving these results. Models, code, and instructions are available at [https://github.com/huggingface/alignment-handbook](https://github.com/huggingface/alignment-handbook). We note an important caveat for these results. We are primarily concerned with intent alignment of models for helpfulness. The work does not consider safety considerations of the models, such as whether they produce harmful outputs or provide illegal advice (Bai et al., 2022). As distillation only works with the output of publicly available models this is technically more challenging to do because of added challenges in curating that type of synthetic data, and is an important subject for future work. ## 2 Related Work There has been significant growth in the number of open large language models (LLMs) that have served as artifacts for the research community to study and use as a starting model for building chatbots and other applications. After the release of ChatGPT, the LLaMA model (Touvron et al., 2023) opened the doors to a wide range of research on efficient fine-tuning, longer prompt context, retrieval augmented generation (RAG), and quantization. After LLaMA, there has been a continuous stream of open access text based LLMs including MosaicML's MPT (ML, 2023), the Together AI's RedPajama-INCITE (AI, 2023), the TII's Falcon (Penedo et al., 2023), Meta's Llama 2 (Touvron et al., 2023), and the Mistral 7B (Jiang et al., 2023). Zephyr uses Mistral 7B as the starting point due to its strong performance. With the development of open models, researchers have worked on approaches to improve small model performance by distillation from larger models. This trend started with self-instruct method (Wang et al., 2023) and the Alpaca model (Taori et al., 2023), which was followed by Vicuna (Chiang et al., 2023) and other distilled models. These works primarily focused on distilling the SFT stage of alignment, whereas we focus on both SFT and preference optimization. Some models such as WizardLM (Xu et al.) have explored methods beyond dSFT. Contemporaneously with this work, Xwin-LM (Team, 2023) introduced an approach that distilled preference optimization through PPO (Schulman et al., 2017). We compare to these approaches in our experiments. Tools for benchmarking and evaluating LLMs have greatly evolved to keep up with the pace of innovation in generative AI. Powerful LLMs such as GPT-4 and Claude are used as evaluators to judge model responses by scoring model outputs or ranking responses in a pairwise setting. The LMSYS chatbot arena benchmarks LLMs in anonymous, randomized battles using crowdsourcing (Zheng et al., 2023). The models are ranked based on their Elo ratings on the leaderboard. AlpacaEval is an example of another such leaderboard that compares models in a pairwise setting but instead uses bigger LLMs such as GPT-4 and Claude in place of humans (Dubois et al., 2023). In a similar spirit, MTBench uses GPT-4 to score model responses on a scale of 1-10 for multi-turn instructions across task categories such as reasoning, roleplay, math, coding, writing, humanities, STEM and extraction (Zheng et al., 2023). The HuggingFace Open LLM leaderbaord (Beeching et al., 2023), the Chain-of-Thought Hub (Fu et al., 2023), ChatEval (Sedoc et al., 2019), and FastEval (fas, 2023) are examples of other tools for evaluating chatty models. We present results by evaluating on MTBench, AlpacaEval, and the HuggingFace OpenLLM Leaderboard. ## 3 Method The goal of this work is to align an open-source large-language model to the intent of the user. Throughout the work we assume access to a larger teacher model \(\pi_{\text{T}}\) which can be queried by prompted generation. Our goal is be to produce a student model \(\pi_{\theta}\) and our approach follows similar stages as InstructGPT (Ouyang et al., 2022) as shown in Figure 2. Figure 2: The three steps of our method: (1) large scale, self-instruct-style dataset construction (UltraChat), followed by distilled supervised fine-tuning (dSFT), (2) AI Feedback (AIF) collection via an ensemble of chat model completions, followed by scoring by GPT-4 (UltraFeedback) and binarization into preferences, and (3) distilled direct preference optimization (dPO) of the dSFT model utilizing the feedback data. Distilled Supervised Fine-Tuning (dSFT)Starting with a raw LLM, we first need to train it to respond to user prompts. This step is traditionally done through supervised fine tuning (SFT) on a dataset of high-quality instructions and responses (Chung et al., 2022; Sanh et al., 2021). Given access to a teacher language models, we can instead have the model generate instructions and responses (Taori et al., 2023), and train the model directly on these. We refer to this as distilled SFT (dSFT). Approaches to dSFT follow the self-instruct protocol (Wang et al., 2023). Let \(x_{1}^{0},\ldots,x_{J}^{0}\) be a set of seed prompts, constructed to represent a diverse set of topical domains. A dataset is constructed through iterative self-prompting where the teacher is used to both respond to an instruction and refine the instruction based on the response. For each \(x^{0}\), we first sample response \(y^{0}\sim\pi_{\text{T}}(\cdot|x^{0})\), and then refine by sampling a new instruction (using a prompt for refinement), \(x^{1}\sim\pi_{\text{T}}(\cdot|x^{0},y^{0})\). The end point is a final dataset, \(\mathcal{C}=\{(x_{1},y_{1}),\ldots,(x_{J},y_{J})\}\). Distillation is performed by SFT, \[\pi_{\text{dSFT}}=\max_{\pi}\operatorname*{\mathbb{E}}_{(x,y)\sim\mathcal{C}} \log\pi(y|x)\] AI Feedback through Preferences (AIF) Human feedback (HF) can provide additional signal to align LLMs. Human feedback is typically given through preferences on the quality of LLM responses (Ouyang et al., 2022). For distillation, we instead use AI preferences from the teacher model on generated outputs from other models. We follow the approach of UltraFeedback (Cui et al., 2023) which uses the teacher to provide preferences on model outputs. As with SFT, the system starts with a set of prompts \(x_{1},\ldots,x_{J}\). Each prompt \(x\) is fed to a collection of four models \(\pi_{1},\ldots,\pi_{4}\), e.g. Claude, Falcon, Llama, etc, each of which yield a response \(y^{1}\sim\pi_{1}(\cdot|x),\ldots,y^{4}\sim\pi_{4}(\cdot|x)\). These responses are then fed to the teacher model, e.g. GPT-4, which gives a score for the response \(s^{1}\sim\pi_{T}(\cdot|x,y^{1}),\ldots,s^{4}\sim\pi_{T}(\cdot|x,y^{4})\). After collecting the scores for a prompt \(x\), we save the highest scoring response as \(y_{w}\) and a random lower scoring prompt as \(y_{l}\). The final feedback dataset \(\mathcal{D}\) consists of a set of these triples \((x,y_{w},y_{l})\). Distilled Direct Preference Optimization (dDPO)The goal of the final step is to refine the \(\pi_{\text{dSFT}}\) by maximizing the likelihood of ranking the preferred \(y_{w}\) over \(y_{l}\) in a preference model. The preference model is determined by a reward function \(r_{\theta}(x,y)\) which utilizes the student language model \(\pi_{\theta}\). Past work using AI feedback has primarily focused on using RL methods such as proximal policy optimization (PPO) to optimize \(\theta\) with respect to this reward. These approaches optimize \(\theta\) by first training the reward and then sampling from the current policy to compute updates. Direct preference optimization (DPO) uses a simpler approach to directly optimize the preference model from the static data (Rafailov et al., 2023). The key observation is to derive the optimal reward function in terms of the optimal LLM policy \(\pi_{*}\) and the original LLM policy \(\pi_{\text{dSFT}}\). Under an appropriate choice of preference model they show, for constant \(\beta\) and partition function \(Z\) that, \[r^{*}(x,y)=\beta\frac{\pi_{*}(y|x)}{\pi_{\text{dSFT}}(y|x)}+\beta\log Z(x)\] By plugging this function of the reward into the preference model, the authors show that the objective can be written as, \[\pi_{\theta}=\max_{\pi}\operatorname*{\mathbb{E}}_{(x,y_{w},y_{l})}\sim \operatorname*{\mathbb{D}}\log\sigma\left(\beta\log\frac{\pi(y_{w}|x)}{\pi_{ \text{dSFT}}(y_{w}|x)}-\beta\log\frac{\pi(y_{l}|x)}{\pi_{\text{dSFT}}(y_{l}|x )}\right). \tag{1}\] While this term looks complex, we note that it implies a simple training procedure. Starting with the dSFT version of the model, we iterate through each AIF triple \((x,y_{w},y_{l})\). 1. Compute the probability for \((x,y_{w})\) and \((x,y_{l})\) from the dSFT model (forward-only). 2. Compute the probability for \((x,y_{w})\) and \((x,y_{l})\) from the dDPO model. 3. Compute Eq 1 and backpropagate to update. Repeat. ## 4 Experimental Details We conduct all of our fine-tuning experiments using Mistral 7B (Jiang et al., 2023), which is the current state-of-the-art base LM at the 7B parameter scale, and matches the performance of much larger models like LLaMa 34B on many NLP benchmarks. We use the Transformer Reinforcement Learning (TRL) library for fine-tuning (von Werra et al., 2020), in conjunction with DeepSpeed ZeRO-3 (Rajbhandari et al., 2020) and FlashAttention-2 (Dao, 2023) to optimize memory and improve training speed. All models are trained with the AdamW optimizer and no weight decay. We did not experiment with parameter-efficient techniques such as LoRA (Hu et al., 2021), but expect similar results to hold with these methods. All experiments were run on 16 A100s using bfloat16 precision and typically took 2-4 hours to complete. For the full set of hyperparameters and instructions on how to train the models, see: [https://github.com/huggingface/alignment-handbook](https://github.com/huggingface/alignment-handbook). ### Datasets We focus on two dialogue datasets that have been distilled from a mix of open and proprietary models, and have previously been shown to produce strong chat models like the UltraLM (Ding et al., 2023): * **UltraChat**(Ding et al., 2023) is a self-refinement dataset consisting of 1.47M multi-turn dialogues generated by gpt-3.5-turbo over 30 topics and 20 different types of text material. We initially ran dSFT over the whole corpus, but found the resulting chat model had a tendency to respond with incorrect capitalization and would preface its answers with phrases such as "I don't have personal experiences", even for straightforward questions like "How do I clean my car?". To handle these issues in the training data, we applied truecasing heuristics to fix the grammatical errors (approximately 5% of the dataset), as well as several filters to focus on helpfulness and remove the undesired model responses. The resulting dataset contains approximately 200k examples. * **UltraFeedback**(Cui et al., 2023) consists of 64k prompts, each of which have four LLM responses that are rated by GPT-4 according to criteria like instruction-following, honesty, and helpfulness. We construct binary preferences from UltraFeedback by selecting the highest mean score as the "chosen" response and one of the remaining three at random as "rejected". We opted for random selection instead of selecting the lowest-scored response to encourage diversity and make the DPO objective more challenging. As noted above, this step is computed offline and does not involve any sampling from the reference model. We make the pre-processed datasets available on the Hugging Face Hub.1 Footnote 1: [https://huggingface.co/collections/HuggingFaceH4/](https://huggingface.co/collections/HuggingFaceH4/) zephyr-7b-6538c6dd6d5bdd1Cbb1744a66 ### Evaluation Our main evaluations are on single-turn and multi-turn chat benchmarks that measure a model's ability to follow instructions and respond to challenging prompts across a diverse range of domains: * **MT-Bench**(Zheng et al., 2023) is a multi-turn benchmark that consists of 160 questions across eight different areas of knowledge. In this benchmark, the model must answer an initial question, and then provide a second response to a predefined followup question. Each model response is then rated by GPT-4 on a scale from 1-10, with the final score given by the mean over the two turns. * **AlpacEval**(Li et al., 2023) is a single-turn benchmark where a model must generate a response to 805 questions on different topics, mostly focused on helpfulness. Models are also scored by GPT-4, but the final metric is the pairwise win-rate against a baseline model (text-davinci-003). We also evaluate Zephyr-7B on the Open LLM Leaderboard (Beeching et al., 2023), which measures the performance of LMs across four multiclass classification tasks: ARC (Clark et al., 2018), HellaSwag (Zellers et al., 2019), MMLU (Hendrycks et al., 2021), and Truthful QA(Lin et al., 2022). Although this leaderboard does not directly measure the conversational quality of chat models, it does provide a useful signal to validate whether fine-tuning has introduced regressions on the base model's reasoning and truthfulness capabilities. Across all benchmarks, we compare Zephyr-7b against a variety of open and proprietary models, each with different alignment procedures. To facilitate comparison across open model sizes, we group our comparisons in terms of 7B models (Xwin-LM (Team, 2023), Mistral-Instruct (Jiang et al., 2023), MPT-Chat (ML, 2023), and StableLM-\(\alpha\)), as well as larger models up to 70B parameters (Llama2-Chat (Touvron et al., 2023), VicuNa (Chiang et al., 2023), WizardLM (Xu et al.), and Guanaco (Dettmers et al., 2023)). For the chat benchmarks, we also compare against proprietary models, including Claude 2, GPT-3.5-turbo and GPT-4 (OpenAI, 2023). ### Details of SFT training We train our SFT models for one to three epochs. We use a cosine learning rate scheduler with a peak learning rate of 2e-5 and 10% warmup steps. We train all models with a global batch size of 512 and use packing with a sequence length of 2048 tokens. ### Details of DPO training Similar to SFT, we train our DPO models for one to three epochs. We use a linear learning rate scheduler with a peak learning rate of 5e-7 and 10% warmup steps. We train all models with a global batch size of 32 and use \(\beta=0.1\) from Eq. (1) to control the deviation from the reference model. The final Zephyr-7B model was initialized from the SFT model that was trained for one epoch and further optimized for three DPO epochs (see Figure 3 for an epoch ablation on MT-Bench). ## 5 Results and Ablations In this section we collect our main results; see Appendix A for sample model completions. dDPO Improves Chat Capabilities.In Table 1 we compare the performance of Zephyr-7B on the MT-Bench and AlpacEval benchmarks. Compared to other open 7B models, Zephyr-7B sets a new state-of-the-art and performs significantly better than dSFT models across both benchmarks. In particular, Zephyr-7B outperforms Xwin-LM-7B, which is one of the few open models to be trained with dPPO (dPPO). When compared to larger open models, Zephyr-7B achieves competitive performance with Llama2-Chat 70B, scoring better on MT-Bench and within two standard deviations on AlpacEval. However, zephyr-7B performs worse than WizardLM-70B \begin{table} \begin{tabular}{l c c|c c} \hline \hline **Model** & Size & Align & MT-Bench (score) & AlpacEval (win \%) \\ \hline StableLM-Tuned-\(\alpha\) & 7B & dSFT & 2.75 & - \\ MPT-Chat & 7B & dSFT & 5.42 & - \\ Xwin-LM v0.1 & 7B & dPPO & 6.19\({}^{*}\) & 87.83\({}_{1.15}\) \\ Mistral-Instruct v0.1 & 7B & - & 6.84 & - \\ **Zephyr** & 7B & dDPO & **7.34** & **90.60\({}_{1.03}\)** \\ \hline Falcon-Instruct & 40B & dSFT & 5.17 & 45.71\({}_{1.75}\) \\ Guanaco & 65B & SFT & 6.41 & 71.80\({}_{1.59}\) \\ Llama2-Chat & 70B & RLHF & 6.86 & 92.66\({}_{0.91}\) \\ Vicuna v1.3 & 33B & dSFT & 7.12 & 88.99\({}_{1.10}\) \\ WizardLM v1.0 & 70B & dSFT & **7.71** & - \\ Xwin-LM v0.1 & 70B & dPPO & - & **95.57\({}_{0.72}\)** \\ \hline GPT-3.5-turbo & - & RLHF & 7.94 & 89.37\({}_{1.08}\) \\ Claude 2 & - & RLHF & 8.06 & 91.36\({}_{0.99}\) \\ GPT-4 & - & RLHF & **8.99** & **95.28\({}_{0.72}\)** \\ \hline \hline \end{tabular} \end{table} Table 1: Chat benchmark results for open-access and proprietary models on MT-Bench and AlpacEval. A dash \((-)\) indicates model or alignment information that is not publicly available, or an evaluation that is absent on the public leaderboards. Scores marked with an asterisk \((*)\) denote evaluations done by ourselves. and Xwin-LM-70B, which suggests that applying dDPO to larger model sizes may be needed to match performance at these scales. When compared to proprietary models, zephyr-7B is competitive with gpt-3.5-turbo and Claude 2 on AlpacaEval, however these results should be interpreted with care since the prompts in AlpacaEval may not be representative of real-usage and advanced applications. This is partly visible in Figure 1, which shows the breakdown of model performance on MT-Bench across each domain. We can see that although Zephyr-7B is competitive with proprietary models on several categories, is much worse in math and coding. dDPO Improves Academic Task PerformanceTable 2 shows the main chat results comparing the performance of the proposed model with a variety of other closed source and open-source LLMs. Results show that the dDPO model performs the best among all 7B models, with a large gap over the best dSFT models as well as Xwin-LM dPPO model. Model scale does matter more for these results and the larger models perform better than Zephyr on some of the knowledge intensive tasks. However, Zephyr does reach the performance of the 40B scale models. Is Preference Optimization Necessary?In Table 3 we examine the impact from different steps of the alignment process by fine-tuning Mistral 7B in four different ways: * dSFT** fine-tunes the base model directly with DPO for one epoch on UltraFeedback. * **dSFT-1** fine-tunes the base model with SFT for one epoch on UltraChat. * **dSFT-2** applies dSFT-1 first, followed by one more epoch of SFT on the top-ranked completions of UltraFeedback. * **dDPO + dSFT** applies dSFT-1 first, followed by one epoch of DPO on UltraFeedback. First, we replicate past results (Ouyang et al., 2022) and show that without an initial SFT step (-dSFT), models are not able to learn at all from feedback and perform terribly. Using dSFT improves model score significantly on both chat benchmarks. We also consider running dSFT directly on the feedback data by training on the most preferred output (dSFT-2); however we find that this does not make an impact in performance. Finally, we see that the full Zephyr models (dDPO+dDSFT) gives a large increase in both benchmarks. Does Overfitting Harm Downstream Performance?In the process of training Zephyr-7B we observed that after one epoch of DPO training, the model would strongly overfit, as indicated by perfect training set accuracies in Figure 3. Surprisingly, this did not harm downstream performance on MT-Bench and AlpacaEval; as shown in Figure 3, the strongest model was obtained with one epoch of SFT followed by three epochs of DPO. However, we do observe that if the SFT model is trained for more than one epoch, the DPO step actually induces a performance regression with longer training. \begin{table} \begin{tabular}{l c c|c c c c} \hline \hline **Model** & Size & Align & ARC & \begin{tabular}{c} Hella \\ Swag \\ \end{tabular} & \begin{tabular}{c} MMLU \\ \end{tabular} & \begin{tabular}{c} Truthful \\ QA \\ \end{tabular} \\ \hline StableLM-Tuned-\(\alpha\) & 7B & dSFT & 31.91 & 53.59 & 24.41 & 40.37 \\ MPT-Chat & 7B & dSFT & 46.50 & 75.51 & 37.62 & 40.16 \\ Xwin-LM v0.1 & 7B & dPPO & 56.57 & 79.40 & 49.98 & 47.89 \\ Mistral-Instruct v0.1 & 7B & dSFT & 54.52 & 75.63 & 55.38 & 56.28 \\ **Zephyr** & 7B & dDPO & **62.03** & **84.52** & **61.44** & **57.44** \\ \hline Falcon-Instruct & 40B & dSFT & 61.60 & 84.31 & 55.45 & 52.52 \\ Guanco & 65B & SFT & 65.44 & 86.47 & 62.92 & 52.81 \\ Llama2-Chat & 70B & RLHF & 67.32 & 87.33 & 69.83 & 44.92 \\ Vicuna v1.3 & 33B & dSFT & 62.12 & 83.00 & 59.22 & 56.16 \\ WizardLM v1.0 & 70B & dSFT & 64.08 & 85.40 & 64.97 & 54.76 \\ Xwin-LM v0.1 & 70B & dPPO & 70.22 & 87.25 & 69.77 & 59.86 \\ \hline \hline \end{tabular} \end{table} Table 2: Academic benchmark results for open-access models on the Open LLM Leaderboard. ## 6 Conclusions and Limitations We consider the problem of alignment distillation from an LLM onto a smaller pretrained model. The method avoids the use of sampling-based approaches like rejection sampling or PPO, and distills conversational capabilities with direct preference optimization (DPO) from a dataset of AI feedback. The resulting model Zephyr-7B, based on Mistral-7B, sets a new state=of-the-art for 7B parameter chat models, and even outperforms Llama2-Chat-70B on MT-Bench. We hope this approach motivates further exploration of the capacity of smaller, open-models by demonstrating their ability to align to the intent of user interactions. There are several limitations associated with our study. The main one is the use of GPT-4 as an evaluator for the AlpacaEval and MT-Bench benchmarks, which is known to be biased towards models distilled from it, or those that produce verbose, but potentially incorrect responses. Another limitation is examining whether our method scales to much larger models like Llama2-70B, where the performance gains are potentially larger. ## 7 Acknowledgements We thank Philipp Schmid for many helpful discussions on aligning LLMs, Olivier Dehaene and Nicolas Patry for their assistance with model deployments, Yacine Jernite for his valuable advice on preparing responsible model releases, and Pedro Cuenca for providing feedback on the report. We are grateful to Eric Mitchell, Rafael Rafailov, and Archit Sharma for sharing their insights on DPO. Teven Le Scao for helping with initial experiments. The Mistral, UltraChat, UltraFeedback, Alpaca, and LMSys projects for their support and for releasing great open models. This work would not have been possible without the Hugging Face Training Cluster, and we thank Guillaume Salou and Guillaume Legendre for their help with making the GPUs go brrrr. Figure 3: Train and test set accuracy during DPO (left) and MT-Bench scores for Mistral-7B models fine-tuned first with dSFT and then dDPO for a varying number of epochs on the UltraChat and UltraFeedback datasets (right). \begin{table} \begin{tabular}{l|c c} \hline Align & MT-Bench (score) & AlpacaEval (win \%) \\ \hline dDPO - dSFT & 4.76 & 30.76\({}_{1.63}\) \\ dSFT-1 & 6.64 & 85.65\({}_{1.23}\) \\ dSFT-2 & 6.19 & 78.54\({}_{1.44}\) \\ dDPO + dSFT & **7.00** & **86.07\({}_{1.22}\)** \\ \hline \end{tabular} \end{table} Table 3: Ablation of different alignment methods on the base Mistral 7B model.

2305.03641

Phase-locking an interferometer with single-photon detections

We report on a novel phase-locking technique for fiber-based Mach-Zehnder interferometers based on discrete single-photon detections, and demonstrate this in a setup. Our interferometer decodes relative-phase-encoded optical pulse pairs for quantum key distribution applications and requires no locking laser in addition to the weak received signal. Our new simple locking scheme is shown to produce an Ornstein-Uhlenbeck dynamic and achieve optimal phase noise for a given count rate. In case of wavelength drifts that arise during the reception of Doppler-shifted satellite signals, the arm-length difference gets continuously readjusted to keep the interferometer phase stable.

Bastian Hacker, Kevin Günthner, Conrad Rößler, Christoph Marquardt

2023-05-05T16:01:47Z

http://arxiv.org/abs/2305.03641v2

# Phase-locking an interferometer with single-photon detections ###### Abstract We report on a novel phase-locking technique for fiber-based Mach-Zehnder interferometers based on discrete single-photon detections, and demonstrate this in a setup. Our interferometer decodes relative-phase-encoded optical pulse pairs for quantum key distribution applications and requires no locking laser in addition to the weak received signal. Our new simple locking scheme is shown to produce an Ornstein-Uhlenbeck dynamic and achieve optimal phase noise for a given count rate. In case of wavelength drifts that arise during the reception of Doppler-shifted satellite signals, the arm-length difference gets continuously readjusted to keep the interferometer phase stable. _Keywords_: interferometry, Mach-Zehnder, phase-locking, feedback, quantum communication, quantum key distribution, single-photon detection ## 1 Introduction Quantum communication and specifically Quantum Key Distribution (QKD) requires the encoding, transmission and reception of high-bandwidth signals with high fidelity. Encoding is possible in various degrees of freedom, typically polarization, time bin or phase [1]. The decoding of time bin and phase-encoded signals requires the interference of pulses from different time slots before measurement at chosen relative phases [2]. This is achieved with a phase-locked Mach-Zehnder interferometer (MZI). Decoding of satellite QKD signals poses additional challenges of a low signal level due to high propagation losses as well as a significantly varying Doppler shift [3]. Nevertheless, QKD at loss levels above 50 dB is feasible [4] with the detection of single photons on modern Superconducting Nanowire Single Photon Detectors (SNSPDs) that are available with high detection efficiency and timing precision down to few ps [5]. Driven from these applications we pose the following question: How to optimize phase locking in the few-photon regime under realistic boundary conditions? In this work we investigate this question with an experimental setup and discuss the choice of optimal working points. MZIs consist of two subsequent beam splitters with two independent interferometer arms in between (figure 1a). This configuration can decode phase information when two subsequent pulses of the incident signal get split into two different arms at the first beam splitter, then get delayed individually and finally interfere on the second beam splitter at a chosen relative phase. This directs light to an output port that depends on the incident relative pulse phase and thereby measures the phase. The relative interferometer phase depends on the precise length of each two arms on a nanometer scale, and therefore requires active stabilization against random drifts [6, 7]. Conventionally optical interferometers are phase-locked with intensities in a range of nanowatts to watts, where the achievable accuracy is limited by the finite feedback-loop response time or mechanical actuator bandwidth, and not by photon shot-noise [8]. In contrast, QKD applications require signals on the level of single resolvable photons (femtowatts to picowatts), where an intense locking beam in the signal path is a huge disturbance. The issue is sometimes circumvented by using different wavelengths for the signal and locking [9, 10, 11, 12], which can be separated after the MZI. Suppression of leakage from locking light into the signal path is however limited, and the signal phase becomes ambiguous after phase slips of the locking light. To resolve this, the MZIs may be locked directly with the weak signal that is detected on single-photon detectors at count rates of kHz to MHz [13, 14]. Due to the gain-bandwidth product limit (connected to the fundamental Heisenberg number-phase uncertainty) [15, 16], low count rates allow only for slow feedback. At count rates of few kHz in [13, 14], the resulting feedback bandwidth is in the Hz range. Thus, such a locking system cannot cancel acoustic noise in the kHz-range, where only few photons are received during one oscillation. Passive stability at those frequencies is therefore crucial [17]. Low count rates call for an optimal use of the available information to reach the best achievable residual phase noise [18]. This work introduces such an optimal locking scheme, demonstrates the experimental implementation, and derives the achievable accuracy for any given system parameters. Figure 1: (a) Schematic of the dual-fiber-MZI setup with two independent locking phases. 50:50: beam splitter; Pol: In-fiber polarizer to counteract finite PER; VODL: Variable Optical Delay Line; phase shift: Electrically controlled phase shifter; SNSPD: Superconducting Nanowire Single-Photon Detector; TDC: Time-to-Digital Converter; FPGA: Field-Programmable Gate Array. (b) Fiber-setup on breadboard in 19” rack drawer. Beam-splitters and stretchers are visible on the board. Figure 2: (a) Optical pulse pattern used for locking in our experiment. We receive alternating pulse pairs of \(0^{\circ}\) and \(90^{\circ}\) relative phase, where half of the power interferes at the second beam splitter. Output intensities represent the case \(\phi=0^{\circ}\). (b) Count ratio \(r\) vs. relative MZI phase \(\phi\) in our setup. The total signal (purple) with visibility \(v=1/\sqrt{8}\) is the mean value of pulse-pairs with \(0^{\circ}\) relative phase (blue) and \(90^{\circ}\) (red), each with a visibility of \(50\,\%\) due to non-interfering pulses. We use two different locking points (purple dots) for the two MZIs with \(r_{0}=5/8\) and slopes of \(r^{\prime}_{0}=\pm 1/8\) at \(\phi_{0}=0^{\circ}\) and \(\phi_{0}=90^{\circ}\), respectively. ## 2 Setup Our fully fiber-based setup (figure 1b), sketched in figure 1a, consists of two identical MZIs behind a 50/50 non-polarizing beam splitter, which simultaneously decode optical (\(\lambda=1550\,\mathrm{nm}\)) pulses in two independent bases. The optical input signal consists of rectangular pulse pairs with temporal separation matched by the interferometer arm length difference, with much less than one photon per pulse. The pulse pairs alternate between two different relative phases (figure 2a), which enable the locking of our two MZIs to the two different phases with only one input signal. Each interferometer has its individual relative phase between its two arms, that defines its measurement basis. For QKD operation, these pulses act as phase reference, where much weaker quantum signals are interleaved. The received pattern with partially interfering pulses results in a reduced visibility \(v=1/\sqrt{8}\) of the mean signal (figure 2b). In each MZI, one arm contains a variable optical delay line with a range of \(600\,\mathrm{ps}\) for coarse adjustment of the interferometer delay \(T\). The other arm contains a stretcher (FPS-002-L-15-PP) with a \(10\,\mathrm{kHz}\) bandwidth and a voltage-controlled phase delay range of \(3.4\) wavelengths at a \(0-10\,V\) input. Figure 3 demonstrates the output click ratio for various stretcher voltages. To ensure polarization-mode-matching at the end of each MZI, we use Polarization-Maintaining (PM) fibers like in [14, 12], where alternative solutions are active stabilization [19] or the use of Faraday mirrors [9]. In the PM setup, each component has a finite Polarization Extinction Ratio (PER) on the order of \(-20\,\mathrm{dB}\) that may allow power to swap from the desired polarization mode to the orthogonal one, and back. This can decrease the interferometer visibility in a time-dependent fashion and due to amplitude interference, the worst-case effect increases quadratically Figure 3: Measured count rates after one MZI, and stretcher voltage \(U\). 0–200 s: Linear phase sweep of \(2\pi/100\,\mathrm{s}\); 200–400 s: Free drift at \(U=5\,\mathrm{V}\); 400–600 s: Count ratio locked to \(5:3\). with the number of subsequent imperfect components. We mitigated this effectively by the addition of two in-line clean-up polarizers in each arm, which remove wrong polarization components before they can interfere. The arm-length in each interferometer is \(7.08\,\mathrm{m}\), mainly determined by the un-shortened fiber leads of each component. All four output channels lead to SNSPDs, that are electrically connected to a time-to-digital converter. The individual timestamps of each detected photon are then processed by an FPGA (Kintex-7 160T), which performs the locking algorithm at a clock rate of \(500\,\mathrm{kHz}\) and feeds back two 16-bit analog signals to the fiber stretchers. The setup is passively stabilized through close contact of the fibers to a heavy metallic breadboard, mounted on four spring dampers inside of a rack drawer, lined with porous open-cell foam. The temperature is stabilized by the laboratory air conditioning. Nevertheless, the phase difference between each two MZI arms changes naturally over time, due to mechanical stress, temperature changes and acoustic vibrations. The average amount of change over various timescales was determined by a measurement of the free phase evolution over time and is shown in figure 4 (time domain) and in figure 5 (frequency domain). The drift characteristic follows roughly the "red noise" of a Wiener process, which is the continuous version of a random walk (dashed line in figure 4 and slope \(-1\) in figure 5). The noise amplitude at \(1\,\mathrm{kHz}\) is about an order of magnitude above the expected fundamental thermal fluctuations in the fiber [20]. To compensate the drifts and keep the MZI phase-difference at a constant value, we apply active feed-back through the fiber stretchers [6, 7]. Figure 4: Allan deviation of the passive phase drift of one MZI arm with respect to the other across time intervals from \(1\,\mathrm{ms}\) to \(10^{5}\,\mathrm{s}\). On timescales from \(1\,\mathrm{ms}\) to \(3\,\mathrm{s}\) the drift follows approximately a Wiener process with slope \(1/2\) (dashed). Due to recording limitations, the progression was measured in two sections: With sampling of \(f_{s}=2\,\mathrm{kHz}\) up to \(\Delta t=1\,\mathrm{s}\), and above with \(f_{s}=2\,\mathrm{Hz}\). ## 3 Phase locking ### Locking algorithm Our locking algorithm detects single-photon-detector clicks on two channels, which are the two outputs of the balanced MZI. Let \[P(0)=r\quad\text{and}\quad P(1)=1-r \tag{1}\] be the relative fractions of photons received in the first and second of two channels, respectively. The ratio \(r\) depends on the interferometer phase \(\phi\) (figure 2), and \(r_{0}:=r(\phi_{0})\) is the ratio for the desired phase \(\phi_{0}\). Let \(r_{0}^{\prime}:=\frac{\mathrm{d}\,r}{\mathrm{d}\,\phi}|_{r=r_{0}}\) be the slope that links phase and click ratio at the locking point, which takes the magnitude \(|r_{0}^{\prime}|=\sqrt{v^{2}-(2r_{0}-1)^{2}}/2\) at visibility \(v\). Our regulator works in the simple manner that it changes the phase of one MZI arm by a constant step size at each registered photon (with a negligible time delay of the FPGA clock time). The step sizes \(\epsilon_{0}\) and \(\epsilon_{1}\) for detections in each channel differ depending on \(r_{0}\) and are adjusted by a step-size parameter \(\epsilon\): * Photon in channel 0: \(\Delta\phi=\epsilon_{0}=\epsilon\cdot 2(1-r_{0})\) * Photon in channel 1: \(\Delta\phi=\epsilon_{1}=-\epsilon\cdot 2r_{0}\) Such feedback creates an average phase change at each detected photon of \[\langle\Delta\phi\rangle=P(0)\cdot\epsilon_{0}+P(1)\cdot\epsilon_{1}=2\, \epsilon\cdot(r-r_{0}). \tag{2}\] Thus, in sufficient proximity to the locking point, the average phase adjustment is \[\langle\Delta\phi\rangle=2\,\epsilon\cdot(r-r_{0})=2\,\epsilon\cdot r_{0}^{ \prime}\cdot(\phi-\phi_{0})\, \tag{3}\] Figure 5: Amplitude spectral density (ASD) of total phase noise \(\sqrt{S}\), both free-drifting (\(\sqrt{S_{\mathrm{drift}}}\), blue line, measured) and locked with various locking parameters \(\epsilon\) at constant count rate \(f_{c}=200\,\mathrm{kHz}\), \(r_{0}=5/8\) and \(r_{0}^{\prime}=1/8\), calculated via (13). At lower \(\epsilon\), low-frequency drift-noise dominates, and at higher \(\epsilon\), high-frequency locking-noise dominates. proportional to the error of \(\phi\). Therefore, we effectively integrate up the phase proportionally to its error, which constitutes an integral (I)-regulator. As the step-size is small, we can express the differential progression in time at total photon count rate \(f_{c}\) as \[\frac{\langle\mathrm{d}\phi\rangle}{\mathrm{d}t}=\langle\Delta\phi\rangle\cdot f _{c}=2\,\epsilon\cdot r_{0}^{\prime}\cdot(\phi-\phi_{0})\cdot f_{c}\, \tag{4}\] which causes exponential damping of phase errors in time \[\phi(t)=\phi_{0}+\phi(t{=}0)\cdot\mathrm{e}^{-\theta\cdot t}\, \tag{5}\] with regulator stiffness (exponential decay rate) \[\theta=-2\,\epsilon\,r_{0}^{\prime}f_{c}\, \tag{6}\] time constant \[\tau=\frac{1}{\theta}=\frac{1}{-2\,\epsilon\,r_{0}^{\prime}\,f_{c}}\, \tag{7}\] and locking bandwidth \[f_{\mathrm{lock}}=\frac{\theta}{2\pi}=\frac{-\epsilon\,r_{0}^{\prime}\,f_{c}} {\pi}. \tag{8}\] ### Discrete locking noise In addition to the linear feedback, there is stochastic noise from the random nature of the photon statistics (Poissonian in time and binomial per detection). Each detection is a Bernoulli trial, and the phase variance increases by the variance \(V\) of a binomial distribution with probability \(r\), which is \[V=\sum_{i\in\{0,1\}}P(i)\cdot(\epsilon_{i}-\langle\Delta\phi\rangle)^{2}=4 \epsilon^{2}r(1-r). \tag{9}\] The successive phase adjustments create a phase random-walk with mean step \(\langle\Delta\phi\rangle\) and an added variance per step \(V\). For sufficiently small phase errors (\(|\phi-\phi_{0}|\ll\pi/2\)) which we find in the experiment, and thus \(r\) close to \(r_{0}\) and a near-constant slope \(r_{0}^{\prime}\), the variance can be approximated by the constant value \(V=4\epsilon^{2}r_{0}(1-r_{0})\). At small step sizes, the phase evolution follows the stochastic differential equation \[\mathrm{d}\phi=-\theta\cdot(\phi-\phi_{0})\,\mathrm{d}t+\sigma\,\mathrm{d}W_{t} \tag{10}\] where \(W_{t}\) is a Wiener process, \(\sigma=\sqrt{Vf_{c}}\), and the diffusion constant is \(D=Vf_{c}/2\). Such a random-walk with linear feedback is called an **Ornstein-Uhlenbeck (OU) process** with stiffness \(\theta\) and diffusion \(\sigma\)[21, 22]. This has not been previously identified in the context of phase-locking, and provides the basis for a deep understanding of the locking dynamic. It follows that the probability distribution of phases around the desired phase \(\phi_{0}\) is Gaussian with a standard deviation of \[\sigma_{\phi,\mathrm{lock}}=\sqrt{\frac{D}{\theta}}=\sqrt{\frac{\epsilon\,r_{ 0}(1-r_{0})}{-r_{0}^{\prime}}}. \tag{11}\] Here, in order for \(\phi_{0}\) to be a stable locking point, \(\epsilon\) and \(r_{0}^{\prime}\) need to have opposite signs. It is evident from equation (11) that in absence of external noise, the locking error scales with the square root of the chosen step size \(|\epsilon|\). The (two-sided) power-spectral-density of the phase progression is that of low-pass filtered white noise with a cutoff frequency of \(f_{\mathrm{lock}}\)[21, 23] \[S_{\mathrm{lock}}(f)=\frac{r_{0}(1-r_{0})}{r_{0}^{\prime 2}\,f_{c}(1+(f/f_{ \mathrm{lock}})^{2})}\, \tag{12}\] where \(\int_{-\infty}^{\infty}S_{\mathrm{lock}}(f)\,\mathrm{d}f=\sigma_{\phi, \mathrm{lock}}^{2}\). ### Total phase error The total phase error is a combination of the locking error and the residual phase drift. Due to independence (locking noise is random), both variances add up, and so do their power spectra. Like every I-regulator, the lock is basically a first-order high-pass filter on the free phase drift (of spectrum \(S_{\rm drift}\), figure 5) with cutoff-frequency \(f_{\rm lock}\) (8). In addition, the locking noise (11, 12) is added. This is most simply expressed in the spectral domain, where the total noise spectrum becomes \[S(f)=S_{\rm lock}(f)+\frac{S_{\rm drift}(f)}{1+(f_{\rm lock}/f)^{2}}\, \tag{13}\] and the total phase error \[\sigma_{\phi}=\sqrt{\int_{-\infty}^{\infty}S(f)\,\mathrm{d}f}=\sqrt{\sigma_{ \phi,\rm lock}^{2}+\int_{-\infty}^{\infty}\frac{S_{\rm drift}(f)}{1+(f_{\rm lock }/f)^{2}}\,\mathrm{d}f}. \tag{14}\] At larger step-sizes \(|\epsilon|\), the free phase drift gets suppressed more and with a higher cutoff-frequency, but the locking-noise increases in bandwidth and magnitude (figure 5). Therefore we can find an optimum magnitude of \(\epsilon\), for which the total noise is minimal. Figure 6 shows this dependence for a fixed count-rate. The experimental phase noise for this (figure 7) was measured with macroscopic optical power on photodiodes and artificially sampled Poissonian photon counts for locking. Measured error values \(\sigma_{\phi}\) follow the predictions with a slight variation, due to the fiber phase drift behaviour changing gradually over the measurement time of the spectrum of several weeks (for \(\mu\)Hz frequency components), as the setup relaxed. Figure 6: Phase error vs. locking step-size parameter \(|\epsilon|\) without external drift at \(f_{c}=200\,\)kHz, \(r_{0}=5/8\) and \(r_{0}^{\prime}=1/8\). Solid lines are computed from (14) with the measured drift spectrum of figure 5, and dashed lines from the analytic model of (21). #### 3.3.1 Linear phase drift approximation Let us now analyze the behaviour for linear phase drifts. Such drifts occur for instance when the fiber temperature changes continuously. In figure 4, they appear on timescales between \(50\,\mathrm{s}\) and \(2000\,\mathrm{s}\), where the phase changes proportional to \(\Delta t\). Linear drifts are also induced from changing Doppler shifts in satellite QKD, where the maximum frequency chirp from low Earth orbits at altitude \(h\) and speed \(v_{o}\) is \(\gamma=\mathrm{d}f/\mathrm{d}t=v_{o}^{2}/(h\,\lambda)\approx c/\lambda\cdot 4 \cdot 10^{-7}\,\mathrm{s}^{-1}\). In a MZI of path difference \(T\), this induces a phase drift of \(d=\mathrm{d}\phi/\mathrm{d}t=2\pi\gamma T\) on the order of \(0.08\,\mathrm{rad/s}\). At a mean photon count rate \(f_{c}\) per MZI, a phase step size \(\epsilon\) and a locking ratio \(r_{0}\) at phase \(\phi_{0}\), the average phase drift during each count is \(\Delta\phi_{\mathrm{drift}}=d/f_{c}\). The equilibrium is reached when the drift becomes opposite equal to the mean locking correction \(\langle\Delta\phi\rangle\), thus \[\Delta\phi_{\mathrm{drift}}=-\langle\Delta\phi\rangle\,\qquad\frac{d}{f_{c}}=-2 \,\epsilon\,r_{0}^{\prime}\cdot(\phi-\phi_{0})\, \tag{15}\] therefore \[\phi_{\mathrm{drift}}=\phi-\phi_{0}=-\frac{d}{2f_{c}\,\epsilon\,r_{0}^{\prime }}. \tag{16}\] This drift error is proportional to \(1/\epsilon\). Together with the locking error (11), it leads to a total phase error of \[\sigma_{\phi,\mathrm{drift}}=\sqrt{\phi_{\mathrm{drift}}^{2}+\sigma_{\phi, \mathrm{lock}}^{2}}=\sqrt{\frac{d^{2}}{(2f_{c}\,\epsilon\,r_{0}^{\prime})^{2}} +\frac{\epsilon\,r_{0}(1-r_{0})}{-r_{0}^{\prime}}}\, \tag{17}\] which takes a minimum value \[\min(\sigma_{\phi,\mathrm{drift}})=\sqrt{3}\sqrt[3]{\frac{|d|\,r_{0}(1-r_{0}) }{4f_{c}r_{0}^{\prime 2}}} \tag{18}\] Figure 7: Sample traces of the phase error during locking for step sizes of \(|\epsilon|=10^{-6}\), \(|\epsilon|=10^{-5}\) and \(|\epsilon|=10^{-4}\), with locking time constants of \(\tau=20\,\mathrm{s}\), \(\tau=2\,\mathrm{s}\) and \(\tau=0.2\,\mathrm{s}\), respectively. at an optimum stepsize \[\epsilon_{\rm opt,drift}=\sqrt[3]{\frac{d^{2}}{2f_{c}^{2}r_{0}(1-r_{0})|r_{0}^{ \prime}|}}\,{\rm sign}(-r_{0}^{\prime}). \tag{19}\] #### 3.3.2 Wiener phase drift approximation On timescales below \(3\,\)s, at which the locking typically operates, the free phase drift (figure 4) is roughly proportional to \(\Delta t^{1/2}\), a Wiener process of random phase drifts. For this simplified case, we can again estimate the locking behaviour analytically. The diffusion constant in our case is \(D_{\rm fiber}=(4\,{\rm mrad})^{2}/\)s. This type of phase-noise can be easily included in the variance of the locking OU process from equation (9) as \[V=4\epsilon^{2}r(1-r)+D_{\rm fiber}/f_{c} \tag{20}\] to yield a total phase error (analogous to equation (11)) of \[\sigma_{\phi,{\rm Wiener}}=\sqrt{\frac{4\epsilon^{2}\,r_{0}(1-r_{0})+D_{\rm fiber }/f_{c}}{-4\epsilon r_{0}^{\prime}}}\, \tag{21}\] which takes a minimum value \[\min(\sigma_{\phi,{\rm Wiener}})=\sqrt[4]{\frac{D_{\rm fiber}\,r_{0}(1-r_{0})} {f_{c}r_{0}^{\prime 2}}} \tag{22}\] at an optimum stepsize \[\epsilon_{\rm opt,Wiener}=\sqrt{\frac{D_{\rm fiber}}{4f_{c}r_{0}(1-r_{0})}}\, {\rm sign}(-r_{0}^{\prime}). \tag{23}\] ### Count rate dependence Figure 8 shows the achievable root-mean-squared phase error \(\sigma_{\phi}\) versus received photon count rates \(f_{c}\). The locking generally improves with larger \(f_{c}\), as the available information increases. Larger locking step sizes \(|\epsilon|\) lead to better noise suppression at smaller count rates, because the lock will act stronger against phase deviations. However, a larger \(|\epsilon|\) also leads to more locking noise, that dominates at higher count rates. Therefore, as in (19) and (23), the optimum \(\epsilon\) depends on \(f_{c}\). In absence of external phase drifts, \(|\epsilon|=10^{-5}\,\)rad is a near-optimum choice in our setup for a wide range of count rates from around \(3\cdot 10^{4}\,\)Hz to \(10^{6}\,\)Hz. For the default count rate \(f_{c}=200\,\)kHz, this yields \(\sigma_{\phi,{\rm min}}=6.5\,\)mrad with a locking bandwidth of \(f_{\rm lock}=0.08\,\)Hz. At presence of external phase drifts (dotted lines in figure 8), the required count rate to suppress drift errors generally increases. This can be mitigated by a larger \(|\epsilon|\) at the cost of increased minimum achievable phase accuracy. For instance, a desired phase accuracy \(\Delta\phi=\pi/100\) allows for a maximum \(|\epsilon|=5\cdot 10^{-4}\,\)rad (11). The desired accuracy can then be maintained down to \(f_{c}=1\,\)kHz, where the locking bandwidth reduces to \(f_{\rm lock}=0.02\,\)Hz. For a minimal phase error over a wider range of count rates, it can make sense to choose \(\epsilon\) adaptively to the count rate, following the green lines in figure 8). ### Darkcounts The effect of darkcounts (or random-phase quantum signals) is most simply included by a reduced visibility \(v\) of \(r(\phi)\), because darkcounts are constant with regard to the MZI phase. Therefore, darkcounts may shift the locking point \(r_{0}\) (towards \(1/2\) if the darkcounts are equal in both channels) and they flatten the slope \(r_{0}^{\prime}\) by a factor of \(f_{\rm dark}/f_{\rm total}\). In practice, with dark count rates of few Hz and signal count rates of hundreds of kHz, the effect is often negligible. ### Optimality of the direct-counting I-controller Our locking scheme of applying immediate constant phase changes at each registered photon is not just simple, but also optimal with regard to some often-used modifications: First, applying immediate feedback is better than additional averaging over several counts \(n\) (as for example applied in [13, 14]). When averaging over subsequent counts, the mean stepsize from equation (2) becomes \(\langle\Delta\phi_{n}\rangle=n\cdot 2\,\epsilon\,r_{0}^{\prime}\cdot(\phi- \phi_{0})\), and \(\theta_{n}=-2\,n\,\epsilon r_{0}^{\prime}(f_{c}/n)=-2\,\epsilon r_{0}^{\prime} f_{c}=\theta\) for any chosen \(\epsilon\). The added variance at each phase adjustment from equation (9) becomes \(V_{n}=n\cdot 4\epsilon^{2}r(1-r)\), because independent variances add up, and thus \(D_{n}=V_{n}(f_{c}/n)/2=D\). Together this yields \(\sigma_{\phi,{\rm lock},n}=\sqrt{D_{n}/\theta_{n}}=\sigma_{\phi,{\rm lock}}\), the same locking noise as without averaging. The only difference is an additional mean time delay of \(n/(2f_{c})\) in the feedback, which will slow down the locking response and degrade the suppression of external phase-noise. Therefore, it is best to adjust the phase immediately on each detection of a single photon. Figure 8: Phase error versus count rate \(f_{c}\) for various fixed values of the locking parameter \(|\epsilon|\). Curves are computed with (14) using the measured free drift spectrum, \(r_{0}=5/8\) and \(r_{0}^{\prime}=1/8\). Solid lines are without external phase drift, dotted lines with linear external drift of \(d=0.08\,\)rad/s. Second, instead of pure integral (I)-regulation, a PID-controller with nonzero proportional (P) or differential (D) parts might be employed (for example, PI-control in [13]). The I-part is required in order to accumulate long-term phase drifts. The advantage of a PI-controller over a pure I-controller is that it is normally faster, because the P-part can react immediately, while the I-part needs to integrate for a time that is longer than the actuator and sensor loop delay (few \(100\,\mu\)s here) to avoid oscillation. In the low-count-rate regime, however, immediate P-response is impossible, because low-noise statistics on the discrete count ratios is only acquired on timescales much longer than the loop delay. Then, however, the I-part has already utilized the corresponding clicks and the P-response comes too late to add anything useful. Things are even worse for a D-part, as the differentiation makes it even more prone to noise, and the required integration time would be even longer. ## 4 Conclusion We have laid out and implemented a novel phase-locking scheme for MZIs, that utilizes discrete detections of single photons. As demonstrated, immediate feedback on each detected photon is optimal in the low count-rate regime. Despite the limitation of a relatively low locking frequency in the Hz-range, inherently restricted by the available information, we were able to achieve a very low phase error of \(6\,\)mrad (\(0.35^{\circ}\)) in our \(7\,\)m-long interferometer. The interferometer can be locked to any phase value where the slope of click ratios \(r_{0}^{\prime}\) is nonzero. In case of an initially vanishing slope, the desired phase value can be made accessible by the injection of pulse pairs with carefully chosen relative phases, as we have demonstrated. The simplicity of our scheme, to move a fixed phase step on arrival of every photon, allows it to be implemented straightforwardly on basic hardware, that does not necessarily include an FPGA. It may find applications in various optical interferometers at low intensities, such as quantum key distribution setups [19, 24], quantum repeaters [25], precision measurements [8] and receivers for deep-space probes [26, 27]. Part of this research was carried out within the scope of the QuNET project, funded by the German Federal Ministry of Education and Research (BMBF) in the context of the federal government's research framework in IT security "Digital. Secure. Sovereign.". The authors are grateful for financial support from the Bavarian State Ministry of Economic Affairs and Media, Energy and Technology through the project "Satellitegestutzte Quantenkryptografie" BayernQSat (LABAY98A).

2306.15573

Reliability and operation cost of underdamped memories during cyclic erasures

The reliability of fast repeated erasures is studied experimentally and theoretically in a 1-bit underdamped memory. The bit is encoded by the position of a micro-mechanical oscillator whose motion is confined in a double well potential. To contain the energetic cost of fast erasures, we use a resonator with high quality factor $Q$: the erasure work $W$ is close to Landauer's bound, even at high speed. The drawback is the rise of the system's temperature $T$ due to a weak coupling to the environment. Repeated erasures without letting the memory thermalize between operations result in a continuous warming, potentially leading to a thermal noise overcoming the barrier between the potential wells. In such case, the reset operation can fail to reach the targeted logical state. The reliability is characterized by the success rate $R^s_i$ after $i$ successive operations. $W$, $T$ and $R^s_i$ are studied experimentally as a function of the erasure speed. Above a velocity threshold, $T$ soars while $R^s_i$ collapses: the reliability of too fast erasures is low. These experimental results are fully justified by two complementary models. We demonstrate that $Q\simeq 10$ is optimal to contain energetic costs and maintain high reliability standards for repeated erasures at any speed.

Salambô Dago, Sergio Ciliberto, Ludovic Bellon

2023-06-27T15:49:17Z

http://arxiv.org/abs/2306.15573v2

# Reliability and operation cost of underdamped memories during cyclic erasures ###### Abstract The reliability of fast repeated erasures is studied experimentally and theoretically in a 1-bit underdamped memory. The bit is encoded by the position of a micro-mechanical oscillator whose motion is confined in a double well potential. To contain the energetic cost of fast erasures, we use a resonator with high quality factor \(Q\): the erasure work \(\mathcal{W}\) is close to Landauer's bound, even at high speed. The drawback is the rise of the system's temperature \(T\) due to a weak coupling to the environment. Repeated erasures without letting the memory thermalize between operations result in a continuous warming, potentially leading to a thermal noise overcoming the barrier between the potential wells. In such case, the reset operation can fail to reach the targeted logical state. The reliability is characterized by the success rate \(R_{i}^{\mathrm{s}}\) after \(i\) successive operations. \(\mathcal{W}\), \(T\) and \(R_{i}^{\mathrm{s}}\) are studied experimentally as a function of the erasure speed. Above a velocity threshold, \(T\) soars while \(R_{i}^{\mathrm{s}}\) collapses: the reliability of too fast erasures is low. These experimental results are fully justified by two complementary models. We demonstrate that \(Q\simeq 10\) is optimal to contain energetic costs and maintain high reliability standards for repeated erasures at any speed. The performance of information storage and processing is not only bounded by technological advances, but also constrained by fundamental physics laws: handling information requires energy [1; 2]. R. Landauer laid the foundations for the connection between information theory and thermodynamics by demonstrating theoretically the lower bound required to erase a one-bit memory: \(W_{LB}=k_{B}T_{0}\ln 2=3\times 10^{-21}\,\mathrm{J}\) at room temperature \(T_{0}\)[1], with \(k_{B}\) Boltzmann's constant. This tiny limit has been experimentally illustrated since, using quasi-static processes in model experiments [3; 4; 5; 6; 7; 8; 9; 10; 11]. Paving the way to concrete applications, many researches tackled information processing in a finite time. It was found that when decreasing the duration of operations, an energy overhead proportional to the processing speed appears [3; 8; 12; 13; 14] and could explain why nowadays fast devices still consume orders of magnitude more energy than Landauer's bound. Several strategies have been explored to decrease this extra energy consumption: use intrinsically fast devices [5], lower the damping mechanism [11], use an out of equilibrium final state [8]. However, in this perspective, only the thermodynamic cost of a _single_ erasure in a finite time has been studied, allowing an infinitely long relaxation afterwards: as long as the final state reaches the targeted logical state with high fidelity, no prescription on the equilibration time of the system has been studied. In this article, we aim to go beyond this fundamental approach and adopt a practical point of view: we study the robustness and the erasure cost evolution of a logic gate when it is used repeatedly. In other words, we investigate on a memory response to successive use without letting the system relax to its initial equilibrium configuration in between. Our experiments are based on an underdamped oscillator confined in a double-well potential, used as a model for a memory [11; 15]. This system can be operated fast: an erasure can be reliably performed in just a few oscillation periods of the resonator. Its low dissipation then allows us to contain the overhead to Landauer's bound [16; 17]. There are however two important counterparts to this low damping: the intrinsic relaxation time is large, and the heat exchanges with the environment are reduced. The consequence is that after a fast erasure, which requires some energetic input (the erasure work, at least \(W_{LB}\)), the memory temperature raises: the system stays out of equilibrium for a long time. The logical outcome and energetic cost of _successive_ operations is therefore an open question that we tackle in the next sections. In the first one, we introduce our experimental setup and summarize the consequence of a single high speed, low dissipation erasure: a warming of the memory, transiently up to doubling its temperature. In section II, we present our repeated erasures procedure and analysis criteria. The experimental results are presented in section III, and modeled in sections IV and V: first with a simple toy-model giving a simple reliability criterion, then with a more complete semi-quantitative model. We conclude the article with a discussion on the practical consequences and limitations of underdamped memories, and provide a cost map to optimize the choice of the memory characteristics with respect to the operation speed, reliability and power consumption. ## I Single fast erasure in underdamped memories Before exploring the memory performance in response to a concrete use (successive use rather than independent single erasures), we summarize in this section the behavior of underdamped memories subject to a single fast erasure, in the framework of our previous explorations [16; 17]. Our experiment is built around an underdamped micro-mechanical resonator (a cantilever in light vacuum at \(\sim 1\,\mathrm{mbar}\)) characterized by its high quality factor \(Q\sim 80-100\), effective mass \(m\), natural stiffness \(k\), leading to a resonance angular frequency of \(\omega_{0}=\sqrt{k/m}=2\pi\times(1350\,\mathrm{Hz})\). The position \(x\) of the oscillator is measured with a high precision differential interferometer [18; 19], and due to thermal noise its variance at rest is \(\sigma_{0}^{2}=\langle x^{2}\rangle=k_{B}T_{0}/k\sim 1\,\mathrm{nm}^{2}\), with \(T_{0}\) the bath temperature. Thanks to a fast feedback loop and an electrostatic actuation, the oscillator can be operated in a double-well bi-quadratic potential, \(U_{1}(x,x_{1})=\frac{1}{2}k(|x|-x_{1})^{2}\), with \(x_{1}\) the user-controlled parameter tuning the barrier height [11; 15]. This double well allows us to define a 1-bit information: its state is 0 (respectively state 1) if the system is confined in the left (respectively right) hand well of \(U_{1}\). At rest, we use \(x_{1}=X_{1}\gtrsim 5\sigma_{0}\), corresponding to an energetic barrier \(\mathcal{B}=\frac{1}{2}kX_{1}^{2}=12.5k_{B}T_{0}\) high enough to secure the initial 1-bit information. A sketch of the setup and an example of double well are displayed on Fig. 1. Further details on the experimental setup and the validity of the virtual potential constructed by the feedback loop are discussed in Ref. [15]. The basic erasure procedure is similar to the standard approach used in previous stochastic thermodynamics realizations [3; 4; 5; 6; 7; 8; 9; 10]: lower the barrier, tilt the potential towards the reset state, raise the barrier. In our case, it corresponds to the following steps: 1. [Merge]: \(x_{1}\) is decreased from \(X_{1}\) to 0 in a time \(\tau\), corresponding to the dimensionless speed \(\mathbf{v}_{1}=X_{1}/(\sigma_{0}\omega_{0}\tau)\) of the center of the wells of \(U_{1}(x,x_{1})\). This results in merging the two wells into a single one, effectively compressing the phase space along the spatial coordinate \(x\). This step implies a warming of the underdamped system for high speeds or low damping: the heat flux with the bath is not efficient enough to compensate the compression work influx [16; 17]. 2. [Relax]: during this optional step, the system is left at rest in the single well in order to equilibrate it with the thermal bath after the wells merging. 3. [Translate]: the single well described by the potential \(U_{2}(x,x_{1})=\frac{1}{2}k(x\pm x_{1})^{2}\) is translated to the final position \(\mp X_{1}\) by ramping \(x_{1}\) from 0 to \(X_{1}\) at the same speed \(\mathbf{v}_{1}\) as in the previous step. 4. [Recreate]: the potential is switched back to the initial one \(U_{1}^{0}=U_{1}(x,X_{1})\), thus recreating an empty well on the opposite side of the reset position. Starting from equilibrium, this procedure (summarized in Fig. 2(a) has a 100% success rate: it always drives the system to the target state independently of its initial one. We define the system internal temperature \(T\) via the average value of the kinetic energy \(\langle K\rangle=\langle\frac{1}{2}mv^{2}\rangle=\frac{1}{2}k_{B}T\) (see _Methods_ M4). When the memory is at equilibrium with the bath at temperature \(T_{0}\), the equipartition imposes \(\langle K\rangle_{eq}=\frac{1}{2}k_{B}T_{0}\), so that as expected \(T=T_{0}\). In Fig. 2b we observe the time evolution of \(\langle K\rangle\) during an erasure performed at \(\mathbf{v}_{1}=0.12\). We observe on the experimental and numerical simulation results that the temperature increases as expected during step 1, followed by a slow relaxation to \(T_{0}\) during step 1*. Then, step 2 fast translation triggers tiny transient oscillations. The temperature profile is successfully modeled following Ref. [17]. Let us emphasize again that this warming of the memory is due to the high quality factor and erasure speed, as both result in inefficient heat exchanges with the bath. It saturates at the adiabatic limit \(T_{a}=2T_{0}\) when the heat exchanges are negligible during step 1 [16]. In Fig. 2(b), for \(\mathbf{v}_{1}=0.12\), the kinetic energy only approaches the adiabatic limit \(K_{a}=\frac{1}{2}k_{B}T_{a}=k_{B}T_{0}\). If step 1* [Relax] is long enough to let the system reach the equilibrium before step 2 [Translate], then one can perform successive and equivalent erasures, maintaining a constant operation cost. Nevertheless, one may wonder on a practical point of view, what happens if the erasures are repeated without waiting for equilibrium between each steps. Such a procedure would get rid of the long relaxation times (for example \(20\,\mathrm{ms}\) in Fig. 2(b) and significantly shorten the process. Figure 1: **(a) Sketch of the experiment.** A conductive cantilever (yellow) is used in vacuum as an underdamped harmonic oscillator. Its deflection \(x\) is measured by a high resolution interferometer, and compared in a fast digital feedback loop to the user controlled threshold \(x_{0}\). This feedback applies a voltage \(\pm V_{1}\) to the cantilever depending on the sign of \(x-x_{0}\). An electrostatic force between the cantilever and a facing electrode at voltage \(V_{0}\gg V_{1}\) displaces the center of the harmonic well potential to \(\pm x_{1}\), with \(x_{1}\) tunable via the voltage \(V_{1}\). When \(x_{0}>x_{1}\) (respectively \(x_{0}<x_{1}\)), this results in a single well centered in \(-x_{1}\) (respectively \(+x_{1}\)), and if \(x_{0}=0\), in a virtual bi-parabolic potential energy \(U_{1}(x,x_{1})=\frac{1}{2}k(|x|-x_{1})^{2}\). **(b) Double well potential.** From the statistical distribution of \(x\) at equilibrium in the double well, we reconstruct using Boltzmann’s distribution the effective potential energy felt by the oscillator. The bi-parabolic fit (dashed red) is excellent, and demonstrates a barrier of \(\frac{1}{2}kx_{1}^{2}=5k_{B}T_{0}\) in this example. \(x\) is normalized by its standard deviation \(\sigma_{0}\) at equilibrium in a single well. Let us finally point out that at high damping (overdamped case), the instantaneous thermalization allows one to sequence erasures without consequences on the thermodynamics, but faster erasure requires a huge energetic cost (to compensate the viscosity). That is why, to optimize the information processing speed and cost it is worth considering the very low damping regime. In this context, we detail in the following how the erasure cost is impacted by the removal of equilibration steps and by the repetition. In the light of previous findings, for fast erasures we expect that the temperature should increase continuously in average: it rises during the compression without having enough time to relax to \(T_{0}\) before the next protocol. The temperature increments could nevertheless saturate at one point, if the energy surplus gained at each compression is compensated by the heat exchanges with the bath. ## II Repeated erasures protocol and reliability criteria To explore the sustainability of repeated operations in a small amount of time, we perform 45 successive erasures with no step 1* [Relax], as plotted in Fig. 3(a). Figure 3: **(a) Protocol of 45 repeated erasures.** The [Merge] and [Translate] steps (duration \(\tau=4\,\)ms) and the [Recreate] one (duration \(\tau_{r}=2\,\)ms) of each erasure are respectively highlighted in red, green and white background. During step 1 switches occur in the double well potential, whereas during step 2 the cantilever is driven towards the target state in a single well. One example of trajectory \(x(t)\) is plotted in blue, it evolves at all times into the well centered in \(S(x-x_{0})x_{1}\) (orange), where \(S(\cdot)=\pm 1\) is the sign function and \(x_{0}(t)\) is the threshold imposed by the protocol: \(x_{0}=0\) for the double well \(U_{1}\) (step 1 and end of step 3), \(x_{0}=\pm 6\sigma_{0}\) for single well \(U_{2}\) targeting \(\mp X_{1}\) (step 2 and beginning of step 3). During the first \(280\,\)ms of this example, 22 erasures are performed successfully. Afterwards, the operation fails several times as the system energy is too high. **(b) Zoom on the 4 first erasures, all successful.** The cycle covers all combinations \((0,1)\to 0\) and \((0,1)\to 1\): reset to 0 for the first two, reset to 1 for the next two. Each erasure starts in the double well \(U_{1}^{0}\) (\(x_{0}=0\), \(x_{1}=X_{1}=5\sigma_{0}\)), merged into a single well during step 1 (\(x_{0}=0\), \(x_{1}\to 0\)), then driven towards the target state during step 2 (\(x_{0}=\pm 6\sigma_{0}\) depending on the target state, \(x_{1}\to X_{1}\)), and \(U_{1}^{0}\) is finally recreated during step 3. We evaluate the success of the erasure during the last \(1.5\,\)ms of step 3. **(c) Zoom on the first failure at \(280\,\)ms.** During the free evolution in the final double well \(x(t)\) escapes the target state (here state 0): the erasure fails. Figure 2: **Single erasure protocol.****(a) Schematic view.** Snippets of the potential energy during the erasure protocol. We start at equilibrium in a double well potential \(U_{1}(\mathbf{x},\mathbf{x}_{1}=\mathbf{X}_{1})\), then proceed with: step 1 [Merge] to merge the two wells together into a single one well centered in 0; step 1* [Relax] allowing the system to equilibrate in the single well; step 2 [Translate] to move the single well \(U_{2}(\mathbf{x},\mathbf{x}_{1})\) to the position \(-\mathbf{X}_{1}\) of state 0; finally step 3 [Recreate] to get the initial potential back by recreating the second well in position \(+\mathbf{X}_{1}\). **(b) Kinetic energy during a fast erasure.** Step 1 [Merge] in red background lasts \(\tau=5\,\)ms (with \(\mathbf{X}_{1}=5\), corresponding to \(\mathbf{v}_{1}=0.12\)) and results in a strong temperature rise visible on the kinetic energy profile: \(\langle K\rangle\) culminates at \(0.92\,\)k\({}_{\mathrm{B}}\)T\({}_{0}\), close to the adiabatic limit \(K_{a}=k_{B}T_{0}\)[16]. At the end of the compression step, the system thermalizes with the surrounding bath in \(\tau_{relax}\sim 20\,\)ms during step 1* [Relax] so that the kinetic energy relaxes to its equilibrium value \(K_{\mathrm{eq}}=\frac{1}{2}k_{B}T_{0}\). Then, the translational motion of duration \(\tau\) (step 2 [Translate] in green background) only produces tiny oscillations. The model without any tunable parameters (red) nicely matches the experimental curve (blue) averaged from 1000 trajectories and the simulation results for step 1 (purple) obtained from \(10^{5}\) simulated trajectories. The pattern is then the following: start with step 1 [Merge], duration \(\tau\); immediately follow with step 2 [Translate], same duration \(\tau\) (alternatively targeting state 0 or 1); and end by step 3 [Recreate], duration \(\tau_{r}=2\) ms, with a free evolution of 0.5 ms in the single well followed by 1.5 ms into \(U_{1}^{0}\) to evaluate the success of the erasure; finally cycle. As alluded to for step 2, to probe equiprobably all resetting configurations, we tackle the two procedures \((0,1)\to 0\) and \((0,1)\to 1\), that reset the memory to either state 0 or state 1 respectively. As we sequence the operations, the initial state of one erasure corresponds to the final state of the previous one: to cover equivalently the whole \((0,1)\) initial state space, we choose to cycle on 4 erasures. The choice of the final state has no impact on the thermodynamics because our erasing procedure is symmetric: any configuration therefore contributes evenly to the statistics. Fig. 3(b) shows a cycle of four successful operations, the first two erasing to state 0 and the last two to state 1. In contrast, we plot on Fig. 3(c) an erasure failing: the system ends up with more energy than the barrier \(\mathcal{B}\) so that the final state (state 0 here) is not secured. As a consequence, during the 1.5 ms free evolution in \(U_{1}^{0}\) of step 3 before the next repetition starts, the system switches between state 0 and state 1. This erasure is classified as a failure: if we wait for the system to relax afterwards, it will end randomly in state 0 or 1 instead of the prescribed state. When the procedure fails once, we do not consider all the subsequent erasures since the initial state is undetermined. Fig. 3(c) is a zoom on the first failure of the protocol plotted in Fig. 3(a). We see indeed the deflection excursion growing progressively, until the systems no longer ends in a secured final state after \(i=22\) erasures. We note \(N_{i}\) the number of trajectories ensuring a successful outcome of the erasure \(i\). We deduce from the \(N_{0}=2000\) protocols the average success rate at each repetition: \(R_{i}^{\mathrm{s}}=N_{i}/N_{0}\). When an erasure is a success we compute the stochastic work and heat, and deduce the average values from the \(N_{i}\) trajectories. ## III Experimental results The goal of the experiment is to explore the robustness of the memory to repeated erasures depending on the speed imposed to perform one operation. We compare the responses for \(\tau=6\), 4, 2 and 1 ms, tackling the high speed limit of our setup. It corresponds to \(\mathbf{v}_{1}=0.1\), 0.15, 0.3 and 0.6, so that the last dataset allows only one oscillation for each step. Let us point out that the total erasure duration is worth \(2\tau+\tau_{r}\) with \(\tau_{r}\) fixed to 2 ms. For different speeds we compute the success rate \(R_{i}^{\mathrm{s}}\) of the erasure \(i\), the probability density in position \(P(x,t)\), the average kinetic energy evolution \(\langle K\rangle\), and the average work \(\langle\mathcal{W}\rangle\) required for each successful erasure. Let us first tackle the success rate and the probability density plotted in Fig. 4. Without surprise, the faster the information is processed, the less reliable the operation becomes. Indeed for \(\tau=6\) ms and \(\tau=4\) ms the success rate after 45 repeated erasures stays above 70%; meanwhile for \(\tau=3\) ms and \(\tau=1\) ms it collapses after a few erasures and the probability to complete the whole protocol is null. These two driving speed regimes (\(\mathbf{v}_{1}<0.2\) called region C for Converging and \(\mathbf{v}_{1}\geq 0.2\) called region D for Diverging) are also visible on the probability density in Fig. 4(b). Within the speed region C (\(\tau=6\) ms and 4 ms) the trajectories remain mostly contained by the double well barrier height and the information isn't Figure 4: **(a) Success of repeated erasures for different operation speeds.** Success rate of the iteration \(i\) of the 45 repeated erasures: \(R_{i}^{\mathrm{s}}=N_{i}/N_{0}\), computed from \(N_{0}=2000\) procedures at \(\tau=6\) ms, \(\tau=4\) ms, \(\tau=3\) ms and \(\tau=1\) ms. An erasure is classified as a success as long as the cantilever stays in the desired final state during the 1.5 ms free evolution in \(U_{1}^{0}\) at the end of step 3. We distinguish the speed region C (\(\mathbf{v}_{1}<0.2\), corresponding here to \(\tau=4\) ms and 6 ms) resulting for the major part in a protocol success (\(R_{45}^{\mathrm{s}}>70\%\)), from the region D (\(\mathbf{v}_{1}>0.2\), corresponding to \(\tau=1\) ms and 3 ms) in which the memory fails to repeat successfully the operation (\(R_{45}^{\mathrm{s}}<2\%\)). **(b) Measured probability density \(P(x,t)\)** inferred from \(N_{0}=2000\) trajectories for different speeds. \(P(x,t)\) is normalized at each time \(t\). The blurring of the probability density is consistent with the success rate: when the excursion goes huge, the trajectories escape the driving and the information is lost. lost (\(R_{45}^{\rm s}>70\%\)). On the contrary, very fast procedures (speed region D, \(\tau=3\,\)ms and \(1\,\)ms) result in the blurring of \(P(x,t)\), because the oscillator overcomes more and more often the double well barrier: the reset systematically fails at the end of the protocol (\(R_{45}^{\rm s}<2\%\)). The success rate can be explained by the temperature profile of the memory visible through the average kinetic energy plotted in Fig. 5. During the first repetitions, the temperature nearly doubles at each compression, and decreases afterward without fully thermalizing. For \(\tau=6\,\)ms and \(\tau=4\,\)ms it finally stops increasing by step and reaches a permanent regime below the barrier allowing a secure encoding of the information. On the other hand, for \(\tau=3\,\)ms and \(\tau=1\,\)ms the kinetic energy skyrockets and exceeds the energy barrier. We recover through the temperature behavior the two speed regions identified when analyzing the success rate. When the erasure succeeds, it is also interesting to quantify the work required on average. Indeed at the same speed, since the memory is hotter after a repeated use, we expect the work to be higher than the one required for a single erasure studied in Ref. [11]. As we tackle the erasure work, we restrict the study to region C where there are enough successful operations to compute properly the erasure cost for the 45 iterations: the operation cost for speeds \(\tau=6\,\)ms and \(\tau=4\,\)ms is displayed in Fig. 6. It highlights that not only the failure rate increases with the speed, but also the work required to process the information. Indeed after a quick transient, the work reaches a plateau whose value grows with the speed of the process. We detail in the next sections first a simple model that helps understanding and predicting the energy behavior, and second a more complete description to provide semi-quantitative results. ## IV Simple model The goal of this section is to propose a very simple model to grasp the behavior of the memory in response to successive use, and in particular to understand the two speed regimes observed experimentally. Indeed within region D the kinetic energy widely exceeds the barrier, leading to the systematic failure of the protocol after several repetitions. On the other hand erasures in region C has a kinetic energy converging below the barrier and a good success rate. This behavior can be explained by the balance between the warming during the compres Figure 5: **Average kinetic energy during 45 successive erasures.** For speed region C (\(\tau=4\) and \(6\,\)ms, \(\mathbf{v}_{1}<0.2\)), \(\langle K\rangle\) starts from its equilibrium value (\(\frac{1}{2}k_{B}T_{0}\) in dashed line) and nearly doubles during the first successive adiabatic compressions. The thermalization afterward is only partial and insufficient to stabilize the temperature for the first iterations. Eventually the kinetic energy converges to a plateau after a couple of erasures; the higher the speed the higher the saturation value. On the other hand, for speed region D (\(\tau=1\) and \(2\,\)ms, \(\mathbf{v}_{1}>0.2\)) the kinetic energy strongly increases and overreaches the barrier height (dotted blue): the thermalization doesn’t balance the compression warming anymore. Moreover, if the operation fails, the system ends in the wrong well and takes an energy kick when the potential \(U_{1}^{0}\) is rebuilt. As a consequence, a runaway occurs because more failures result in energy peaks and energy rise leads to more failures. The simple model successfully predicts these two regimes with the indicator \(A\) (computed with Eq. 8 assuming \(Q=90\)): \(A<1\) in speed region C (Convergence to a plateau below \(\mathcal{B}\)) and \(A>1\) in speed region D (Divergence beyond \(\mathcal{B}\)). Figure 6: **Average work per erasure during 45 successive operations.**\(\langle\mathcal{W}\rangle\) of erasure \(i\) is inferred from the \(N_{i}\) successful trajectories, for the 2 erasure speeds in region C allowing enough successful erasures (\(\tau=4\,\)ms and \(\tau=6\,\)ms). After a couple of repetition the average work reaches a plateau depending on \(\tau\): \(\mathcal{W}_{\rm sat}(\tau=6\,\)ms\()=1.5\,\)knT\({}_{0}\), and \(\mathcal{W}_{\rm sat}(\tau=4\,\)ms\()=1.9\,\)knT\({}_{0}\). The model (dashed line) successfully predicts the converging behavior. It is in reasonable agreement with the experimental result considering the approximations made and the fact that near the region boundary it is very sensitive to the calibration parameters. The quality factor \(Q\) used for the model is the same as the one tuned to match the kinetic energy profile in Figs. 8. sion and the heat continuously released into the bath. Depending on the relative importance of this two opposite phenomena appears or not a saturation temperature allowing the two to compensate each-other. From the temperature rise perspective, the erasures of the repeated procedure are decomposed into the compression, step 1 lasting \(\tau\); and the thermalization, steps 2 and 3 lasting \(\tau+\tau_{r}\). We introduce the following notations (illustrated in Fig. 7): the maximum temperature of erasure \(i\) reached at the end of the step 1 is \(T_{i}=\alpha_{i}T_{0}\), and the temperature at the end of the thermalization is \(\tilde{T}_{i}\). The initial temperature is \(\tilde{T}_{0}=T_{0}\). To build the simple model we start with the energetic balance of the system: \[\frac{d\langle E\rangle}{dt}=\frac{d\langle\mathcal{W}\rangle}{dt}-\frac{d \langle\mathcal{Q}\rangle}{dt} \tag{1}\] Several assumptions and approximations justified by the high speed and quality factor are made to simplify the description: 1. During step \(i+1\) starting at temperature \(\tilde{T}_{i}\), the work expression in the adiabatic limit holds [16]: \(\mathcal{W}_{a}=k_{B}\tilde{T}_{i}\). 2. Deterministic contributions (\(K_{D}\) and \(U_{D}\)) are neglected (see _Methods_ M3 for their definition), hence step 2 involves no work. 3. The derivatives in Eq. 1 are taken at first order. 4. Equipartition holds at the end of each steps, so that \(\langle E\rangle=k_{B}T\). Hypotheses (ii) and (iv) allow us to simplify Eq. 1 during the thermalization into: \[\frac{dT}{dt}=\frac{1}{k_{B}}\frac{d\langle E\rangle}{dt}=-\frac{1}{k_{B}} \frac{d\langle\mathcal{Q}\rangle}{dt}=-\frac{\omega_{0}}{Q}(T(t)-T_{0}). \tag{2}\] The last equality of previous equation stems from the general expression of heat in underdamped stochastic thermodynamics as long there is no deterministic kinetic energy in the system [17]. From Eq. 2, we deduce that the temperature initially at \(T_{i}\) relaxes exponentially towards \(T_{0}\) during \(\tau+\tau_{r}\) (green segments in Fig. 7), so that: \[\tilde{T}_{i} =T_{0}+(T_{i}-T_{0})e^{-\frac{(r_{r}+\tau)\omega_{0}}{Q}} \tag{3}\] \[=(1-r)T_{0}+rT_{i},\text{ with }r=e^{-\frac{(r_{r}+\tau)\omega_{0}}{Q}}\] (4) \[=[1+r(\alpha_{i}-1)]T_{0}. \tag{5}\] We now address the erasures step 1 (red segments in Fig. 7) using hypotheses (i), (iii) and (iv) to rewrite the energy balance (Eq. 1) as: \[k_{B}\frac{T_{i+1}-\tilde{T}_{i}}{\tau}=\frac{k_{B}\tilde{T}_{i}}{\tau}-\frac {\omega_{0}}{Q}k_{B}(\tilde{T}_{i}-T_{0}). \tag{6}\] In this expression, we used as the relevant heat derivative its initial point (\(\frac{d\langle\mathcal{Q}\rangle}{dt}(t)\simeq k_{B}\frac{\omega_{0}}{Q}( \tilde{T}_{i}-T_{0})\)). Expressing all temperatures with \(\alpha_{i}\), we get \[\alpha_{i+1}=r(2-\frac{\omega_{0}\tau}{Q})(\alpha_{i}-1)+2 \tag{7}\] We recognize a geometric serie: \(\alpha_{i+1}=A\times\alpha_{i}+B\), with \(\alpha_{0}=1\), \(B=2-A\) and: \[A=e^{-\frac{(r_{r}+\tau)\omega_{0}}{Q}}(2-\frac{\omega_{0}\tau}{Q}). \tag{8}\] All in all the model, exhibits two regimes: if \(A<1\) the warming and thermalization compensates after some iteration, so that the temperature converges to \(T_{sat}=(1+\frac{1}{1-A})T_{0}\); and if \(A>1\), the heat exchange is inefficient to compensate the energy influx from the successive compressions and the temperature diverges. The parameter \(A\) controlling the convergence, decreases with \(\tau\) and increases with \(Q\): these dependences fit with the experimental observations. We apply the simple model (assuming \(Q=90\)) and compute \(A\) with Eq. 8 for the different experimental durations in Fig. 5: the model successfully predicts the booming of the energy in region D. As a conclusion to this section, this simple model includes many approximation but turns out to be enough to recover the speed region C and D corresponding to a converging or diverging evolution of the energy (respectively \(A<1\) and \(A>1\)). The frontier \(A=1\) corresponds to \(\tau=3.34\,\)ms which is again perfectly compatible with the experimental results. Nevertheless in the very fast and very slow limits, most of the assumptions may stop being relevant. In particular, the systems doesn't actually diverges when \(A>1\) as predicted by the model but reaches a very high plateau. Indeed, if the system's energy broadly exceeds the barrier height, the potential driving protocol impact on the system's behavior becomes negligible, therefore making the above model meaningless. In particular the peaks observed in the permanent kinetic energy profile for region D in Fig. 5 no Figure 7: **Schematic description of the simple model**. We decompose the protocol in successive steps 1 (red segments, duration \(\tau\)), followed by steps 2 and 3 (green segments, duration \(\tau_{r}=2\,\)ms\(+\)\(\tau\)). For each erasure \(i\) we call \(T_{i}\) the temperature after step 1 and \(\tilde{T}_{i}\) the temperature after the relaxation. After some repetitions the temperature can either converge and saturate to a permanent regime, or diverge and exceed the barrier. longer comes from the compression, but from the energy kicks given to the system when the barrier is restored to \(x_{0}=0\) if the cantilever ended up in the wrong well. ## V Quantitative model In this section we propose a more detailed and complete model designed to quantitatively predict the system behavior in the converging region C. Indeed now that we have identified the speed interval allowed to successfully process repeated erasures, the point is to quantitively estimate the corresponding energetic cost and temperature evolution. In all the following we restrict the study to speed region C, and consider only successful erasures: in particular the average experimental kinetic energy \(\langle K\rangle\) is now inferred from the successful operations only. At the basis of the quantitative description is the model developed in Ref [17] to describe Landauer's fast erasures called here SE (Single Erasure) Model. It has proven reliable to describe a single erasure starting at equilibrium and including an equilibration step 1* between step 1 and 2, as illustrated by the excellent agreement with the experimental data in Fig 2. We adapt the SE model by removing the equilibration step: while the thermal contribution relaxes from step 1, there are transient oscillations due to the translational motion deterministic contribution. Doing so we successfully describe the first erasure and obtain the final temperature \(\widetilde{T}_{1}\). The strategy is then to use the model with a different initial condition: the initial temperature is no more set to \(T_{0}\) but to \(\widetilde{T}_{1}\). All in all, the quantitative model of Repeated Erasure (RE model) consists in applying the SE model successively starting each time with the final temperature \(\widetilde{T}_{i}\) as initial temperature for the next iteration. Fig. 8 compare the RE model (red curve) to the experimental data (blue curve) for \(\tau=6\,\)ms and \(\tau=4\,\)ms. All parameters are taken from the experimental data (\(\omega_{0}\), \(\tau\), \(\tau_{r}\) and \(X_{1}\)) except from the quality factor that is being tuned within the interval \(80<Q<100\) to provide the best fit to the experimental curves. Indeed the RE model is quite sensitive to the value of \(Q\) near the divergence, and Figure 8: **Kinetic energy evolution for 45 repeated erasures**. The left (respectively right) panels correspond to a duration \(\tau=6\,\)ms (respectively \(\tau=4\,\)ms). **(a) Average kinetic energy.**\(\langle K\rangle\) (blue) is inferred from the \(N_{i}\) successful trajectories of the erasure \(i\) (as we are in speed region C, \(N_{i}\sim N_{0}\)), and plotted during the whole protocol. Initially at the equilibrium value \((\frac{1}{2}k_{B}T_{0})\), \(\langle K\rangle\) nearly doubles during the first 3 to 5 compressions without fully thermalizing in-between, and eventually reaches a plateau: around \(K_{sat}=1.3k_{B}T_{0}\) for \(\tau=6\,\)ms, and around \(K_{sat}=1.8k_{B}T_{0}\) for \(\tau=4\,\)ms. The quantitative model (red) is in very good agreement with the experimental results with no adjustable parameters except for a tiny adjustment of the quality factor. **(b) Saturation profile**. When the permanent regime is established, \(\langle K\rangle\) follows a repeated pattern every \(2\tau+\tau_{r}\): these similar profiles are superimposed in grey lines. The saturation curve \(\langle K_{sat}\rangle\) (blue) is the average of the permanent regime profiles of the last 40 operations. The system first continues to relax from \(1.1k_{B}T_{0}\) (left) or \(1.4k_{B}T_{0}\) (right) at the beginning of step 1 (transient oscillations appear due to the translational motion), until the two wells get close enough and the compression actually starts, resulting in the temperature rise. During step 2 (green background) the system thermalizes with again transient oscillations, and keep on relaxing during the final \(\tau_{r}=2\,\)ms rest. The quantitive model (red) nicely matches the experimental curves: it consists in the theoretical model of Landauer’s erasure (SE Model) [17] using as initial kinetic temperature the experimental value \(T_{sat}=2.2T_{0}\) (left) or \(2.8T_{0}\) (right) measured on the permanent regime profile. the uncertainty on the quality factor is not negligible: it may drift slightly during experimental runs or change in between them due to small vacuum drift. The RE model also computes the average work required for the repeated use of the memory: the prediction plotted in dashed lines on Fig. 6 is reasonable (taking the same parameters as the one for the kinetic energy profile). Hence, the operator can theoretically estimate the excess of work required to perform successive erasures compared to a single one, and the number of repetition before reaching a permanent regime. However, even though the RE model has proven effective, it has some limitations. The deterministic part of the kinetic energy and of the work is inferred from translational motions starting from equilibrium, whereas in reality the system is always out of equilibrium either during step 1 or step 2. Besides, the model is inefficient to predict the consequences of an operation failure on the energy divergence: it only describes successful erasures. Thanks to the theoretical knowledge of the temperature profile we are also able to approximate the success rate \(R_{i}^{s}\) of \(i\) successful repetitions of the operation. Indeed, the ratio \(\mathcal{B}/(k_{B}T)\) (\(\mathcal{B}\) being the barrier height) is all we need to compute the escape rate \(\Gamma\) in the final double well potential [20]: \[\Gamma=\omega_{0}\frac{k_{B}T}{\mathcal{B}}\frac{e^{-\mathcal{B}/(k_{B}T)}}{ \int_{0}^{\infty}d\epsilon\ e^{-\epsilon\mathcal{B}/(k_{B}T)}\left[\pi+2\sin^ {-1}\left(\epsilon^{-\frac{1}{2}}\right)\right]}. \tag{9}\] Note that in this expression, we extend the definition of the \(\sin^{-1}\) function to arguments greater than one, with \(\sin^{-1}(\epsilon)=\pi/2\) for \(\epsilon>1\). If we assume that the temperature during the \(1.5\,\mathrm{ms}\) final free evolution in \(U_{i}^{0}\) is being worth \(\tilde{T}_{i}\) (computed with the RE Model) we obtain the following success rate: \[R_{i}^{s}=\prod_{k=0}^{i-1}\big{[}1-\Gamma(\mathcal{B},\tilde{T}_{k})\tau_{r} \big{]}. \tag{10}\] The result plotted on Fig. 9 is qualitatively consistent with the experimental observations and quantify the consequence of the temperature rise on the success of the operation. Nevertheless, Eq. 9 accounts for the average escape time of a system at equilibrium in the initial well (at effective temperature \(T\)), while in reality there is a strong deterministic contribution just after step 2 that tends to push the system far from the barrier. This prediction of the reliability of erasure is thus quite conservative in general, but still provides a useful guideline for applications. ## VI Discussion and Conclusion Based on the previous studies of the energetic exchanges in an underdamped memory, we are able to grasp the consequences of its repeated use. Even though the low damping allows fast erasures at low energetic cost, the price to pay lies in the warming of the memory. As a consequence, if the memory is used several times straight after a previous operation without letting the system thermalize with its environment, the temperature rises by step. The thermal energy can then exceed the memory encoding barrier. The success of repeated operations therefore depends on the damping and the speed. On the first hand, the lower the damping, the longer the thermalization and the higher the compression warming: for a fixed speed, reducing the damping strengthens the temperature diverging behavior. On the other hand, the higher the speed, the higher the compression warming and the shorter the time allowed to thermalize: high speeds also favor the divergence. We developed an efficient tool (the simple model) to predict the divergence of the energy, and therefore deduce the speed region which ensures a good success rate. Moreover, a more complete model can be used (the RE model) to quantitively estimate the energy and work evolution profile in response to repeated uses, and in particular the permanent regime reached after a few iterations. Fig. 10 summarizes the predictions of the RTE model when the permanent regime is reached, with an hybrid map of energetic cost and operation reliability as a function of the two tunable parameters: quality factor \(Q\) and erasure speed \(\mathbf{v}_{1}\). This map includes overdamped systems as well, to infer what is the optimal quality factor to minimize the erasure cost while maintaining a high success rate (black areas corresponding to a success rate below 99%). The final result, which could be used as a guideline for applications, is that optimal quality factors are \(Q\sim 10-20\) for all speeds. Other protocols could be explored using the same theoretical approach, to further optimize erasure processes. It should be noted as Figure 9: **Theoretical prediction of the erasure success rate for different speeds.** Assuming \(Q=90\), we compute the escape rates \(\Gamma(\mathcal{B},\tilde{T}_{k})\) using for \(\tilde{T}_{k}\) the temperature theoretical profile (red in Fig. 8), and deduce from Eq. 10 the success rate \(R_{i}^{s}\) after \(i\) erasures for the different \(\tau\). Hence the model results in the probability of loosing the final information during the \(1.5\,\mathrm{ms}\) free evolution in the final potential. As expected \(R_{i}^{s}\) decreases with increasing speeds, and we identify region D in which the probability to successfully finish the whole protocol is zero. well that a quality factor tunable on the fly during the protocol could reconcile the best of both worlds: high \(Q\) during the compression to pay only the adiabatic erasure cost, followed by a low \(Q\) during thermalization to cut the relaxation time and restore the initial equilibrium before the next operation. As a conclusion, on a practical point of view, the underdamped regime thus appears to be an excellent choice to perform fast and repeated use of the memory at low cost. Indeed, the underdamped systems turns out to be quite robust to continuous information processing at high speed (only a few natural oscillation period per operations, here around 10 for the fastest reliable operations) at a stable and rather moderate cost (below \(2k_{B}T_{0}\)). Depending on the number of successive erasures one wants to perform and on the success rate required, the quality factor or the speed of the erasure have to be tuned to avoid divergences. ###### Acknowledgements. This work has been financially supported by the Agence Nationale de la Recherche through grant ANR-18-CE30-0013. We thank J. Pereda for the initial programming of the digital feedback loop creating the virtual potential. ## Methods ### Data availability The data that support the findings of this study will be openly available in Zenodo upon acceptance. ## M2 Underdamped stochastic thermodynamics We consider a Brownian system of mass \(m\) in a bath at temperature \(T_{0}\) characterized by its position \(x\) and speed \(v\). Its dynamic into a potential energy \(U(x)\) is described by the 1-dimension Langevin equation, \[m\ddot{x}+\gamma\dot{x}=-\frac{dU}{dx}+\gamma\sqrt{D}\xi(t).\] (M1) The friction coefficient \(\gamma\) of the environment, the bath temperature \(T_{0}\) and Boltzmann's constant \(k_{B}\) define the diffusion constant through the Einstein relation: \(D=k_{B}T_{0}/\gamma\). The thermal noise, \(\xi(t)\), is a \(\delta\)-correlated white Gaussian noise: \[\langle\xi(t)\xi(t+t^{\prime})\rangle=2\delta(t^{\prime}).\] (M2) We introduce the kinetic energy \(K=\frac{1}{2}m\dot{x}^{2}\). The equipartition gives the kinetic energy average value at equilibrium (as the potential does not depend on \(v\)): \[\langle K\rangle=\frac{1}{2}k_{B}T_{0}.\] (M3) As the total energy is worth \(E=U+K\), the energy balance equation writes: \[\frac{dK}{dt}+\frac{dU}{dt}=\frac{d\mathcal{W}}{dt}-\frac{d\mathcal{Q}}{dt},\] (M4) with \(\mathcal{W}\), the stochastic work defined by [13; 21; 22; 23; 24]: \[\frac{d\mathcal{W}}{dt}=\frac{\partial U}{\partial x_{1}}\dot{x}_{1},\] (M5) and \(\mathcal{Q}\) the stochastic heat defined by, \[\frac{d\mathcal{Q}}{dt} \equiv -\frac{\partial U}{\partial x}\dot{x}-\frac{dK}{dt},\] (M6) \[= \frac{\omega_{0}}{Q}(2\langle K\rangle-k_{B}T_{0}).\] (M7) Let us point out that the heat expression (Eq. 17) is completely general and doesn't depend on the potential shape or current transformations occurring in the system. It also highlights that for a large quality factor \(Q\), the heat exchanges with the thermal bath are reduced. Finally, at equilibrium when the equipartition theorem prescribes \(\langle K\rangle=\frac{1}{2}k_{B}T_{0}\), there are in average no heat exchanges, as expected. Figure 10: **Energetic cost and reliability of repeated erasures.** Both quantities are computed with the RE model in the permanent regime. The energetic cost is encoded by the colormap (red area corresponding to very consuming procedures and blue ones corresponding to frugal ones), and the shading gives the success rate of the operation (black area corresponding to a success rate below 99%). The optimal damping for sustainable and continuous 1-bit erasures is around \(Q\sim 10-20\) (white line, computed by the minimal work at each speed). ### Deterministic terms The trajectory \(x(t)\) in a moving well decomposes into the stochastic response to the thermal fluctuations, which vanishes on average, and the deterministic response: \(x=x_{th}+x_{D}\), with \(\langle x\rangle=x_{D}\). Similarly we define \(\langle v\rangle=\dot{x}_{D}\). \(x_{D}\) is the solution of the deterministic equation of motion: \[\ddot{x}_{D}+\frac{\omega_{0}}{Q}\dot{x}_{D}-\frac{1}{m}\frac{\partial U}{ \partial x}(x_{D})=0. \tag{101}\] In a single quadratic well with a driving \(x_{1}(t)\), Eq. 101 becomes: \[\ddot{x}_{D}+\frac{\omega_{0}}{Q}\dot{x}_{D}+\omega_{0}^{2}x_{D}=\omega_{0}^{2 }x_{1}(t). \tag{102}\] As detailed in Ref. [17], to best model the deterministic terms during the erasure protocol we express the deterministic work, kinetic and potential energies by: \[\frac{d\mathcal{W}_{D}}{dt}= -k(x_{D}-x_{1})\dot{x}_{1}\times\Pi(t), \tag{103a}\] \[K_{D}(t)= \frac{1}{2}m\dot{x}_{D}\times\Pi(t),\] (103b) \[U_{D}(t)= \frac{1}{2}k(x_{D}-x_{1})^{2}\times\Pi(t), \tag{103c}\] with \(\Pi(t)\) the probability that the cantilever remains in its initial well until time \(t\) given by: \[\Pi(t)=e^{-\int_{0}^{t}\Gamma(u)du}, \tag{104}\] where \(\Gamma\) is the escape rate expressed in Eq. 9. ## Appendix M Kinetic temperature We define the kinetic temperature \(T\) of the first deflection mode of the system through the velocity variance \(\sigma_{v}^{2}=\langle v^{2}\rangle-\langle v\rangle^{2}\): \[T=\frac{m}{k_{B}}\sigma_{v}^{2}. \tag{105}\] The above definition can be reframed using the average kinetic energy \(\langle K\rangle=\frac{1}{2}m\langle v^{2}\rangle\), after introducing the deterministic kinetic energy contribution, \(K_{D}\): \[T=\frac{2m}{k_{B}}(\langle K\rangle-K_{D}). \tag{106}\] ## Appendix M5 SE and RE models We present in this section the main steps of the SE model detailed and demonstrated in Ref. [17]. The first step of the SE model consists in obtaining a differential equation for the kinetic temperature evolution \(T(t)\) during the first step of a single erasure in a potential driving \(U_{1}(x,x_{1}(t))=\frac{1}{2}k(|x|-x_{1}(t))^{2}\). This differential equation is given by the time derivative of the energy balance equation 100: \[\frac{d\langle E\rangle}{dt}=\frac{\partial\langle E\rangle}{\partial T}\dot{ T}+\frac{\partial\langle E\rangle}{\partial x_{1}}\dot{x}_{1}=\frac{d\langle\mathcal{ Q}\rangle}{dt}+\frac{d\langle\mathcal{W}\rangle}{dt}. \tag{107}\] The second step consists in giving the expressions of all the terms involved in the above equation. Introducing \(\mathcal{V}=1+\text{erf}\left(\sqrt{\frac{k}{2k_{B}T}}x_{1}\right)\), we can write: \[\frac{d\langle\mathcal{Q}\rangle}{dt}= \frac{\omega_{0}}{Q}\big{(}2K_{D}+k_{B}T-k_{B}T_{0}\big{)} \tag{108a}\] \[\frac{d\langle\mathcal{W}\rangle}{dt}= \frac{d\mathcal{W}_{D}}{dt}-k_{B}T\frac{\partial\ln\mathcal{V}}{ \partial x_{1}}\dot{x}_{1}\] (108b) \[\langle E\rangle= K_{D}+U_{D}+k_{B}T+k_{B}T^{2}\frac{\partial\ln\mathcal{V}}{ \partial T} \tag{108c}\] where \(\mathcal{W}_{D}\), \(K_{D}\) and \(U_{D}\) are respectively the deterministic work, kinetic and potential energy given in Eqs. 106. Combining Eq. 107 and Eqs. 108, and knowing the driving \(x_{1}(t)\) we obtain a first order differential equation for the temperature \(T(t)\) that is numerically solvable. We can then straightforwardly deduce the work and heat. Let us also point out that this model also describes the relaxation process after the end of the driving [\(x_{1}(t)=0\)]. The RE model consists in repeating this procedure for each erasure but starting with updated initial conditions each time. Let us assume for example that the temperature after the i\({}^{\text{th}}\) erasure is \(\tilde{T}_{i}>T_{0}\). Then the RE model will compute the temperature after the (i+1)\({}^{\text{th}}\) erasure by applying the SE model with \(T(0)=\tilde{T}_{i}\) when solving the differential equation resulting from Eq. 107 and Eqs. 108.

2307.02326

Security Defect Detection via Code Review: A Study of the OpenStack and Qt Communities

Background: Despite the widespread use of automated security defect detection tools, software projects still contain many security defects that could result in serious damage. Such tools are largely context-insensitive and may not cover all possible scenarios in testing potential issues, which makes them susceptible to missing complex security defects. Hence, thorough detection entails a synergistic cooperation between these tools and human-intensive detection techniques, including code review. Code review is widely recognized as a crucial and effective practice for identifying security defects. Aim: This work aims to empirically investigate security defect detection through code review. Method: To this end, we conducted an empirical study by analyzing code review comments derived from four projects in the OpenStack and Qt communities. Through manually checking 20,995 review comments obtained by keyword-based search, we identified 614 comments as security-related. Results: Our results show that (1) security defects are not prevalently discussed in code review, (2) more than half of the reviewers provided explicit fixing strategies/solutions to help developers fix security defects, (3) developers tend to follow reviewers' suggestions and action the changes, (4) Not worth fixing the defect now and Disagreement between the developer and the reviewer are the main causes for not resolving security defects. Conclusions: Our research results demonstrate that (1) software security practices should combine manual code review with automated detection tools, achieving a more comprehensive coverage to identifying and addressing security defects, and (2) promoting appropriate standardization of practitioners' behaviors during code review remains necessary for enhancing software security.

Jiaxin Yu, Liming Fu, Peng Liang, Amjed Tahir, Mojtaba Shahin

2023-07-05T14:30:41Z

http://arxiv.org/abs/2307.02326v1

# Security Defect Detection via Code Review: A Study of the OpenStack and Qt Communities ###### Abstract _Background_: Despite the widespread use of automated security defect detection tools, software projects still contain many security defects that could result in serious damage. Such tools are largely context-insensitive and may not cover all possible scenarios in testing potential issues, which makes them susceptible to missing complex security defects. Hence, thorough detection entails a synergistic cooperation between these tools and human-intensive detection techniques, including code review. Code review is widely recognized as a crucial and effective practice for identifying security defects. _Aim:_ This work aims to empirically investigate security defect detection through code review. _Method:_ To this end, we conducted an empirical study by analyzing code review comments derived from four projects in the OpenStack and Qt communities. Through manually checking 20,995 review comments obtained by keyword-based search, we identified 614 comments as security-related. _Results:_ Our results show that (1) security defects are not previously discussed in code review, (2) more than half of the reviewers provided explicit fixing strategies/solutions to help developers fix security defects, (3) developers tend to follow reviewers' suggestions and action the changes, (4) _Not worth fixing the defect now_ and _Disagreement between the developer and the reviewer_ are the main causes for not resolving security defects. _Conclusions:_ Our research results demonstrate that (1) software security practices should combine manual code review with automated detection tools, achieving a more comprehensive coverage to identifying and addressing security defects, and (2) promoting appropriate standardization of practitioners' behaviors during code review remains necessary for enhancing software security. Code Review, Security Defect, OpenStack, Qt, Empirical Study + Footnote †: publication: pubid: 978-1-6654-5223-6/23/531.00 ©2023 IEEE ## I Introduction Security defects can have serious consequences, such as data breaches, intellectual property theft and disruption of services [1, 2]. Numerous studies have emphasized the significance of keeping software under control to reduce the risk of exploitation [3, 4, 5]. Nevertheless, the practice of leaving a large number of security defects unaddressed in the production environment for extended periods of time and only patching them after they have been released publicly [6], has a negative impact on software quality and leads to increased maintenance costs. Therefore, effectively minimizing the financial and reputational costs of security incidents by detecting security defects as early as possible remains the major focus for the stakeholders involved in software production. Many organizations are shifting security practices to earlier stages of software development, hoping to address security concerns before they become more difficult and expensive to fix [7]. Under this circumstance, code review is proven to be an effective method to identify and locate security defects early [8, 9]. Code review is a valuable practice of systematically and internally examining revisions before code is released to production to detect defects and ensure quality. Code review is one of the most important practices of modern software development [10]. Compared with security defect detection tools, code review participants are mostly project members who can take full account of the code context [11]; thus, they are in a position to identify security defects effectively. Several studies have focused on security defects detection in code review (e.g., [12, 13, 14, 15, 8]). Bosu _et al._ investigated the distribution and characteristics of security defects identified by code reviewers [8], while Paul _et al._ focused on the security defects that were missed during code review [14]. However, most of the research mainly concentrated on the identification of security defects, rather than delving into their resolution procedures. Specifically, little is known about the actions taken by practitioners and the challenges they face when resolving identified security defects in code review. Exploring these aspects could help increase the fixing rate of identified security defects during code review. To this end, this work **aims** to explore the resolution of security defects through the means of code review, thus contributing to develop a more comprehensive body of knowledge on security defect detection via code review. We first collected 432,585 review comments from four active projects of two widely known communities: OpenStack (Nova and Neutron) and Qt (Qt Base and Qt Creator). After a keyword-based search on these review comments, we manually analyzed 20,995 potential security-related comments, resulting in 614 comments that actually identified security defects. We then studied the types of security defects identified, how the practitioners treat the identified defects, and why some of them are finally unresolved in code review. Our **findings** show that: (1) security defects are not widely identified in code review; (2) when faced with security defects, most reviewers express their opinions on fixing them and provide specific solutions, which are generally agreed and adopted by developers; (3) _Disagreement between the developer and reviewer_ and _Not worth fixing the defect now_ are the most frequent causes of not resolving security defects. The **contributions** of this work are: (1) We highlight the importance of manual and context-sensitive security review of code, which may reveal security defects undetected by automated tools. (2) We complement the datasets of previous works on the types of security defects identified during code review. (3) We provide the best practices for practitioners' behaviour in modern code review for security defects detection. ## II Related Work ### _Security Defect Detection_ A body of research has focused on the current status of security defect detection across software ecosystems. Alfadel _et al._ discussed vulnerabilities propagation, discovery, and fixes in Python ecosystem [6]. It was found that most exposed security defects were not being fixed in a timely manner. A similar study of npm packages demonstrated that delays in fixing security defects were often caused by the fact that the fix was bundled with other features and did not receive the necessary prioritization [16]. Lin _et al._ investigated the security defect management in Debian and Fedora ecosystems [17], and found that over 50% of security defects fixes in Linux distributions can be integrated within one week. Our work differs from the aforementioned studies in that the security defects discussed in these works are publicly disclosed, while in our work we focused on security defects that practitioners may notice during their daily coding activities (but may not have been already disclosed). Security defects can be detected through automated approaches or manually. Tudela _et al._ utilized hybrid analysis to detect the OWASP Top Ten security vulnerabilities and discussed the performance of different tool combinations [18]. Singh _et al._ compared the difference in automated (belong to DAST) and manual approaches for penetration testing, indicating that humans can locate security defects missed by automated scanners [19]. Osterweil _et al._ formulated a framework using IAST to improve human-intensive approaches in security defect detection and proved its effectiveness [20]. Inspired by the above-mentioned studies, we were motivated to explore an effective human-intensive practice for detecting security defects, i.e., code review, and pave the way for further integrating automated tools into the code review process. ### _Security Defect Detection in Code Review_ Several studies have studied security defect detection in code review. For example, di Biase _et al._ explored the value of modern code review for system security and investigated the factors that can affect security testing based on the Chromium project [14]. Thompson _et al._ conducted a large-scale analysis of the dataset obtained from GitHub [9] and reaffirmed the crucial relationship between code review coverage and software security. There is a growing interest in improving the effectiveness of security code review. Paul _et al._ analyzed 18 attributes of a code review to explore factors that influence the identification of security defects, in order to pinpoint areas of concern and provide targeted measures [21]. Braz _et al._ analyzed the impact of two external assistance measures on the identification of security defects [22] and found that explicitly requiring practitioners to concentrate on security can greatly increase the probability of finding security defects, while the further provision of security checklists did not show better results. Some studies qualitatively analyzed the implementation of security defect detection in code review. Alfadel _et al._ investigated security-related reviews in npm packages [15] to analyze the proportion, types, and solutions of identified security defects in these reviews. In comparison, we targeted different data sources and provided a more in-depth analysis, which includes the causes for not resolving security defects and the actions of developers and reviewers when facing security defects in code review; therefore providing a holistic understanding of the current status of security code review. Motivated by these related works, we aim to bridge the knowledge gap with a view to inspire new research directions and enhance the effectiveness of detecting security defects. ## III Methodology ### _Research Questions_ The goal of this study is to examine the implementation of security defect detection in code review. Specially, we analyzed review comments to investigate how security defects are identified, discussed, and resolved by reviewers and developers. To achieve this goal, we formulated the following Research Questions (RQs): **RQ1:**_What types of security defects are identified in code reviews?_ Previous studies have explored the distribution of security defects found in code reviews [8, 14, 15, 23]. However, those studies have largely focused on specific systems and the types of security defects may vary in different systems, warranting additional research encompassing diverse projects to establish more general findings [14]. Driven by this, RQ1 investigates the frequency of each security defect type within the OpenStack and Qt communities, aiming to complement the findings from existing studies. **RQ2:**_How do developers and reviewers treat security defects identified in code reviews?_ Given that strict reviewing criteria were mostly abandoned in modern code review [24], it is necessary to establish a good understanding of the current practices employed by practitioners and how they influence the quality of security code review, so as to capture the undesirable behaviors and formulate corresponding suggestions for best practices. This RQ aims to explore concrete actions of developers and reviewers after security defects were identified. Answering this RQ helps to better understand the resolution process and the extent to which manual security defect detection is implemented in code review. In addition, the common solutions of each security defect type extracted from the changed source code can be used to support developers in addressing security defects in the future. This RQ is further decomposed into four sub-RQs: **RQ2.1:**_What actions do reviewers suggest to resolve security defects?_ **RQ2.2:**_What actions do developers take to resolve security defects?_ **RQ2.3:**_What is the relationship between the actions suggested by reviewers and those taken by developers?_ **RQ2.4:**_What are the common solutions to each security defect type identified in code reviews?_ **RQ3:**_What are the causes for developers not resolving the identified security defects?_ In some cases, security defects are identified by reviewers but not ultimately resolved by developers. However, little research has been conducted to understand the reasons behind these cases, which could shed light on potential obstacles developers encounter and help in facilitating the resolution of identified security defects. As a result, RQ3 explores potential causes of why some defects are not fixed, with the objective of filling this gap and providing valuable insights. ### _Data Collection_ The data collection, labelling, extraction, and analysis process is described below (an overview is shown in Fig. 1). #### Iii-B1 Projects Selection This study analyzes security defects in code reviews collected from four projects of two communities: Nova1 and Neutron2 from OpenStack3, and Qt Base4 and Qt Creator5 from Qt6. These two communities are selected based on the following two criteria [25]: 1) _Reviewing Policy_ - the community has established a strong review process, and 2) _Traceability_ - the review process of the community should be traceable. Footnote 1: [https://github.com/openstack/nova](https://github.com/openstack/nova) Footnote 2: [https://github.com/openstack/neutron](https://github.com/openstack/neutron) Footnote 3: [https://www.openstack.org/](https://www.openstack.org/) Footnote 4: [https://github.com/qt/qbase](https://github.com/qt/qbase) Footnote 5: [https://github.com/qt-creator/qt-creator](https://github.com/qt-creator/qt-creator) OpenStack is a platform that builds and manages public or private cloud, with a set of projects responsible for processing different core cloud computing services. Qt is a cross-platform application for creating GUI applications. We deemed these two communities to be appropriate for our study as they have a large number of code reviews, which are performed using a traceable code review tool - Gerrit7. Gerrit offers on-demand tracking of the review process [26]. The projects from the two communities have been widely used in previous code review studies (e.g., [27, 28, 29, 30]). Similar to Hirao _et al._[31], we selected two active projects from OpenStack (i.e., Nova and Neutron) and Qt (i.e., Qt Base and Qt Creator), which have the highest number of patches. Footnote 6: [https://www.qt.io/](https://www.qt.io/) #### Iii-B2 Review Comments Collection Using the RESTful API provided by Gerrit, we obtained a total of 432,585 review comments from the four projects (166,237 review comments from OpenStack and 266,348 from Qt) spanning from January 2017 to June 2022, the time when we started this work. Considering that our study aims to analyze the practices of developers and reviewers when dealing with security defects, any comments made by bots should be excluded. Hence, we filtered out the review comments of which the author is a bot account (i.e., "_Zuul_" in OpenStack and "_Qt Sanity Bot_" in Qt). We also removed review comments in files that do not correspond to any programming language or are clearly outside the scope of code review, by checking the filename extension (e.g., ".orig" and ".svg"). #### Iii-B3 Potential Security-related Comments Collection We employed a keyword-based search approach to identify security-related review comments We adopted the keyword set proposed in Paul _et al._'s work [21], as it is considered the most comprehensive keyword set in previous research, with the largest number of types and keywords. The set includes 103 keywords, which were classified into 11 security defect types and an extra _Common Keywords_ type, with each security defect type containing Common Weakness Enumerations (CWEs) [32] to clarify its definition. After thoroughly analyzing the keyword set proposed by Paul _et al._[21], we made the following adjustments to the set: First, we adapted parts of the types of security defect and corresponding keywords. For example, we split _Denial of Service (DoS)_ from the _Denial of Service (DoS)_ / _Crash_ type defined in Paul _et al._'s work [21], since we considered _DoS_ as one clear security defect type based on its definition in CWEs. The keywords relevant to _DoS_ were also separated and reclassified into the new _DoS_ type. Second, we collected differentiated keywords and security defect types from previous studies [14, 23] and extended the keyword set obtained from the last step. One additional security defect type was added (i.e., the _Command Injection_ type [23]). Moreover, another one additional security defect type was created since part of keywords from [14] could not be mapped into the existing keyword set (i.e., _Use After Free_ was created to include "_use-after-free_" and "_dynamic_" based on the definition of CWEs). 19 differentiated keywords collected from previous studies were assigned to specific types (including _Common Keywords_) according to their meanings, (e.g., adding "_crypto_" to the _Encrypt_ type). After that, the initial keyword set of our study was formulated and presented in Table I. We ultimately obtained 122 keywords, which were categorized into 15 security defect types and the _Common Keywords_ type. To explicitly illustrate our adjustments, the sources of each type are presented, and newly added keywords compared to the keywords from Paul et al.'s work [21] are emphasized in italics. Given that the effectiveness of the keyword-based approach heavily depends on the set of keywords used, we followed the approach proposed by Bosu _et al._[8] to refine the initial set of keywords, which includes the following steps: 1. build a corpus by searching for review comments that contain at least one keyword of our initial set of keywords (e.g., "_racy_", "_overflow_") in the review comments collected in Section III-B2. 2. perform tokenization to each document on the corpus. Considering code snippets contained in review comments, we also applied the identifier splitting rules in this progress (e.g., "_FlavorImageConflict_" becomes "_Flavor Image Conflict_", _security_group_ becomes "_security group_"). 3. remove stopwords, punctuations, and numbers from the corpus and convert all tokens into lowercase. 4. use SnowballStemmer from the NLTK toolkit [33] to obtain the stem of each token (e.g., "_merged_", "_merging_", and "_merges_" have the same token "_merg_"). 5. create a Document-Term matrix [34] from the corpus and identify the additional words that frequently co-occur with each of our initial keywords (co-occurrence probability of 0.05 in the same document, as also utilized in [8]). 6. manually analyze the additional words to determine whether to include them into the initial keyword set. No additional words were found that co-occurred with any one of the initial keywords. Therefore, we were of the opinion that the present keyword set is adequate for supporting keywords-based search and filtering. After that, a script was developed to search for code review comments that contain at least one of the keywords identified in Table I. All these steps led to 20,995 review comments from the four projects, which is called **potential security-related review comments**. ### _Manual Labelling_ The 20,995 potential security-related review comments obtained from the previous step may contain many false positives. Hence, we manually inspected the content of these comments, their corresponding discussions, and related source code to determine and label whether they are actually security-related. We defined the labelling criteria, i.e., the review comment should be clearly related to security and meet the definition of one of the CWEs [32] presented in Table I. Aimed at ensuring consistency and improving inter-rater reliability, a pilot labelling was independently conducted by the first and second authors on 200 potential security-related comments randomly selected from the Nova project. The labelling results were compared and the level of agreement between the two authors was measured using Cohen's Kappa coefficient test [35]. For review comments in which the judgements of two raters differ, they were reviewed, evaluated, and discussed with the third author until a consensus was reached. The calculated Cohen's Kappa coefficient is 0.87, thus indicating that the two authors reached a high level of agreement. The first author proceeded to label all the remaining potential security-related comments, and the review comments that the first author was unsure were discussed with the second author to reach a consensus. This process led to the identification of a total of 614 **security-related review comments** for further analysis and the distribution of data points across the four projects is presented in Table II: ### _Data Extraction and Analysis_ A set of data items (see Table III) was formulated and extracted from the contextual information of each of the 614 security-related comments, including their corresponding discussion thread and source code, to answer our RQs. #### Iii-D1 RQ1 We classified 614 security-related review comments into 15 security defect types predefined in Table I. Based on this table, for each review comment, we identified the CWE corresponding to the issue described in the comment, and categorized the comment under the security defect type to which that CWE belongs. As shown in the example below, the reviewer pointed out that the calculation of post+n may overflow and lead to undefined behavior, which is consistent with the description of CWE-109, that is "_The software performs a calculation that can produce an integer overflow or wraparound, when the logic assumes that the resulting value will always be larger than the original value_", hence is labelled as _Integer Overflow_. Fig. 1: An overview of our data acquisition, processing and analysis process #### Iv-A2 Rq2 We categorized the actions suggested by reviewers into three categories with reference to what was formulated by Tahir _et al._ in [36, 37]. 1. **Fix**: recommend fixing the security defect. 2. **Capture**: detect the security defect, but do not provide any further guidance. 3. **Ignore**: recommend ignoring the security defect. Confronted with review comments posted by reviewers, there are three possible behaviors for developers: 1. **Resolve**: The developer resolved the security defect identified by the reviewer. 2. **Not resolve**: The developer ignored the security defect identified by the reviewer. 3. **Unknown**: We are unable to determine the behavior of the developer. We defined _Unknown_ to describe the case that the developer responds to the reviewer with a promise to fix the security defect in the future, but we could not obtain specific resolution evidence from the source code due to the overwhelming amount of manual inspection of unlimited commits. An example of such a case is shown below: ``` Link:[http://alturl.com/8g2p9](http://alturl.com/8g2p9) Project:Nova Type:Bufferoverflow Developer:...Infuturepatchthataddsthe abilityto configuretheexecutortype,wewill needtodealwiththeissueyouraisehere. ``` We inspected the discussion and the follow-up submitted code to determine whether a security defect has been resolved. A security defect was considered resolved only when the situation meets the following three possible categories: 1. Code is modified in the subsequent patchsets by the developer to resolve the security defect before the code change is merged. 2. Developer mentioned clearly in the reply to comments that the security defect has been fixed in another code change. 3. The code change with the security defect was abandoned. As insecure code is not merged, it would not pose a harmful threat to the source code base. As shown in Fig. 2, the developer added an assert statement to check the buffer size in Line 70 of tst\(\_\)qlocalsocket.cpp in patchset 5 to fix the buffer overflow, thus we can confirm that the security defect identified in this review comment was resolved. Employing the open coding and constant comparative method [38], we used MAXQDA8 as the coding tool and extracted the solutions developers adopted from the specific code modification for fixing security defects in resolved instances, so as to investigate the common solutions of each security defect types. Footnote 8: [https://www.maxqda.com/](https://www.maxqda.com/) #### Iv-A3 Rq3 To further understand why unresolved security defects were ultimately ignored by practitioners, we also utilized the open coding and constant comparative method [38] to examine the discussions between developers and reviewers. For the purpose of minimizing bias, this data extraction was performed by the first author and verified by two other co-authors. Any conflicts were discussed and addressed by the three authors, using a negotiated agreement approach [39]. The complete extraction results in this step is available online [40]. ## IV Results ### _RQ1: Category of Security Defects Identified in Code Reviews_ As explained in Section III-C, 614 review comments were identified as security-related comments, which account for less than 1% of all comments in code reviews. As detailed in Table IV, the majority of security defects (539 out of 614, 87.8%) were identified by reviewers, which is considerably more than those raised by developers. Therefore this study is based on 539 security-related review comments that meet the former case. As described in Section III, we have predefined 15 types of security defects with their distribution (see Table V). On the whole, we found that _Race Condition_ is the most frequently identified type and was discussed in as many as 39.0% of instances. The second and third most frequently identified types are _Crash_ and _Resource Leak_, accounting for 22.8% and 10.9%, respectively. There are 41 (7.6%) review comments identified _Integer Overflow_, followed by _Improper Access_ with 31 (5.8%) instances. As can be seen in Table V, there are also nine types that were identified on rare occasions with proportions lower than 5%. Although _SQL Injection_ is a common network attack and listed as the top 10 web application security risks by the Open Web Application Security Project (OWASP) in the past 15 years [41], no instance of this type was found in this study. **RQ1 summary:** Security defects are not prevalently discussed in code review, with the proportion less than 1%. Of those security-related review comments, a considerable amount of review comments detected the security defects _race condition_ (39.0%), _crash_ (22.8%), and _resource leak_ (10.9%). There are also 210 (39.0%) cases where reviewers only identified security defects without indicating the next step that the developer should follow, which fall under the definition of _Capture_ type. Besides that, there were a few reviewers (39, 7.2%) who explicitly suggested _ignoring_ the identified security defects for various reasons, such as the issues not worth fixing. **RQ2.2:** We inspected the discussion and subsequent patchsets to determine whether a security defect was fixed finally. As shown in Table VII, developers chose to fix the identified security defect more often, accounting for 65.9%. The actions developers took to each security issue are presented in Table VIII. The overall result is that almost every type of security defect has a fix rate upwards of 50.0%, except for _Deadlock_, as low as 36.4%. As analyzed in RQ1, defects of type _Race Condition_, _Crash_, and _Resource Leak_ are the top three frequently identified security defects. As demonstrated in Table VIII, these types of security defect are also frequently addressed by developers in code reviews with fix rates of 64.3%, 71.5%, and 79.7%, respectively. In addition to the top three types of security defects, there are another 11 security defect types from "Integer Overflow" to "Format String", totalling 147, and the fixing rate of these 11 types is comparatively low, at 57.8% (85 out of 147). **RQ2.3:** The relationship between the action developers took and the action reviewers suggested is illustrated in Fig. 3. When reviewers provide a clear idea for fixing the identified security defects with specific solutions (_Fix with a specific solution_), the fix rate by developers reaches 81.3% (204 out of 251). When reviewers only point out that fixing is needed but do not offer any guidance (_Fix without a specific solution_), developers choose to address these defects in 61.5% (24 out of 39) of the cases. Furthermore, when reviewers indicate the existence of security defects without further instructions (_Capture_), only 59.5% (125 out of 210) of these issues are fixed. Based on our findings, it can be speculated that reviewers' suggestions that include guidance in code review, such as whether and how to resolve defects, are crucial to improving the overall fix rate of identified security defects. As shown in Fig. 3, for the instances in which the actions suggested by reviewers are the _Fix_ type, 78.6% (228 out of 290) of developers fixed the identified security defects. For the instances in which reviewers suggested ignoring the defects, nearly all (36 out of 39, 92.3%) developers ignored the defects. Overall, it can be concluded that the majority of developers tend to agree with reviewers' opinions when the reviewers express clear perspectives on defect handling. Hence, the participation and enthusiasm of reviewers are crucial for detecting security defects during code review. **RQ2.4:** The coding solutions adopted by developers to resolve different security defects are further investigated and presented in Table IX. In order to make the sample size large enough to ensure the credibility of the conclusions, we only selected the top three security defects based on their prevalence for analysis, i.e., _Race Conditions_, _Crash_, and _Resource Leak_. In terms of _Race Condition_, the most common approach adopted by developers is to **take thread-safety measures**. These measures include using thread-safe functions, such as atomic operations, the invokeMethod function, or synchronization functions that utilize signals and slots (e.g., QFutureWatcher in Qt). They also employed custom logic when working with resources, including measures such as adding locks, usage limitations, and updating before usage to ensure consistency. **Code refactoring** is also an important solution for _Race Condition_, with 33 instances. A few Fig. 3: The tremap of relationship between the action developers taken and the action reviewers suggested cases adopted **concurrency management**, which includes passing messages between threads and adding wait functions. Additionally, 7 developers solved the issue by **handling side effects**, which means dealing with the consequences of _Race Conditions_ indirectly, such as capturing exceptions. In the instances of _Crash_, there are five possible solutions. **Code refactoring** and **adding condition check** are the two main solutions adopted by developers to fix the _Crash_ defects. In 13 review comments, developers **captured exceptions by try/catch block** to avoid _Crash_. Furthermore, 6 developers **safely terminated execution in advance** to prevent damage caused by an abrupt _Crash_, and a specific example of this case is to add an assert statement to immediately trigger an exception and terminate the execution of the program, if a certain condition or constraint is not met. There are also 4 cases where developers **used safe functions** that can eliminate potential exceptions, thus improve the overall stability of the program and minimize the likelihood of crashing. Approximately half of _Resource Leak_ defects are fixed by **adding resource release functions**, where developers may explicitly close resources or prevent skipping of the deletion function through modification in code logic. 9 developers also **used resource-management techniques**, such as smart pointers, Resource Acquisition Is Initialization (RAII), or bridge technologies during fixing. Additionally, 8 developers **reduced resource allocation** to avoid leaks through converting to passing by reference, transferring resource ownership and so on. Only 4 cases involve **code refactoring** as a solution, while just 2 cases addressed the security defects through **handling side effects**, as previously mentioned. **RQ2 summary:** 53.8% of the reviewers indicated a need to fix the identified security defects after their detection, and most of them were willing to provide specific solutions for developers to fix the defects. From the developers' perspective, majority of developers tend to agree with reviewers' suggestions, and over half of the identified security defects were resolved by developers. ### _RQ3: Causes of Not Resolving Security Defects_ According to the aforementioned result of RQ2.2, there are 161 instances where the identified security defects were not resolved. By manually inspecting the discussion for each review comments, we excluded 64 (39.8%) review comments neither developers nor reviewers involved in these instances clearly indicate the causes for ignoring the identified security defects, leaving us with 97 instances (60.2%) for further analysis. The statistical results of the remaining instances can be found in Table X, and six causes were then identified. Nearly half of (44, 45.4%) unresolved security defects are because either developers or reviewers think it is _Not worth fixing the defect now_, which is the most common cause of not resolving the identified security defects. From the perspective of security defects, the identified security defects in these cases may be harmless and acceptable for developers, or the occurrence scenario of security defects are so tricky that they will not become system hazards under normal utilization. It may also be because that there are other security defects in the code that will have a greater impact, and those currently found are negligible comparatively. On the developer side, fixes might cost too much effort and require tons of changes. If existing solutions had other adverse effects on the system and were irreconcilable, developers would also choose to ignore the identified defects in light of the benefit of current code changes. In addition, some developers noted that the resolutions for identified security defects were not an immediate concern and could be considered in the future. Two examples corresponding to the above two situations are presented below, the cruxes has been emphasized in bold: ``` Link:[http://alturl.com/hm4o?](http://alturl.com/hm4o?) Project:Nova Developer:after discussing it on IRC [1], we went on a consensus that it's **acceptable** to remove the VIF from the metadata since the NIC on the VM already detached, even if the Neutron action could potentially fail. ``` ``` Link:[http://alturl.com/xcb6n](http://alturl.com/xcb6n) Project:QtBase Developer:I'llleave it as it is - otherwise I'll have to change the example too much and write tos of code obscuring the real example. ``` We attribute _Disagreement between the developer and the reviewer_ to be the reason why developers do not resolve the security defects in 33 review comments (34.0%). In these cases, some developers could not comprehensively understand reviewers' opinions, while others indicated that the identified security defects did not exist. Furthermore, some developers believed that fixing was unnecessary or the solution was unreasonable. In the following example, the developer objected to the reviewer's suggestion to control traffic by adding a security group, asserting that no modification was required. ``` Link:[http://alturl.com/9uwgv](http://alturl.com/9uwgv) Project:Neutron Review:isupset this requires security groups. Developer:Why we need this? Could you explain because I don't think we need anything here. ``` Due to the lack of knowledge or limitation by other system logic, 11.3% of identified security defects were ignored for the reason that practitioners _had no effective solution to thoroughly resolve the defects_, and below is an example of this case: ``` Link:[http://alturl.com/t5paz](http://alturl.com/t5paz) Project:QtCreator Review:...If you are not happy with a crash you can add a check against 0. This will avoid the crash here but I am pretty sure that it will crash sooner or later on a different location... ``` In 6.2% review comments, the reason for not resolving security defects is that the resolution is considered _out of the scope of the commit_. As shown in the example below, the identified security defect was historical and thus orthogonal with the feature of this commit. Accordingly, the developers reckoned that those defects should wait to be resolved in specific logic changes in the future, rather than now. ``` Link:[http://alturl.com/joasw](http://alturl.com/joasw) Project:Nova Developer:...I think that the multi-attach problem is orthogonal and should be investigated in another patch. ``` In addition, three occasional instances were found, in two (2.1%) of which the developers believed that it was _users' responsibility to make correct choices_ to guarantee the system running appropriately, and no any modification was conducted to the source code. While in the remaining one (1.0%), the developer clearly indicated that he/she _had no time to rework_ and left the reviewer to accept identified defects or directly abandon the whole change. ``` RQ3 summary:Generally speaking, 39.8% related instances did not provide the cause of failure to resolve. _Not worth fixing the defect now_ and _Disagreement between the developer and the reviewer_ are the main reasons of ignoring security defects. ``` ## V Implications Here we discuss several implications of the findings reported in this paper. **A two-step of detection mechanism is suggested to conduct security practices in software development.** Our study found that in the process of code review, the majority of reviewers provided useful suggestions to fix identified security defects, and developers usually agreed and adopted solutions suggested by reviewers. This indicates that reviewers' assessment of security defects is trustworthy for developers. Generally speaking, code review is effective in detecting and addressing security defects. Although various tools (e.g., SAST, DAST, IAST) have been used in modern code review to speed up the review process, these tools test only based on known scenarios and have limitations in test coverage, thus resulting in potential false positives [19]. Experienced and knowledgeable code reviewers, due to their deeper understanding of code context, can capture security defects which do not conform to known patterns and cannot be detected by tools. Therefore, automated tools and code review, as two significant approaches of security defect detection, need to complement each other. We recommend a two-step detection mechanism that combines the two approaches: tools to conduct scalable and fast security defect detection as the first check, and then the reviewers to conduct code review referring to the detection results of the tool. During the second step, the reviewers check the results generated by tools to provide developers with instructions for further action, and at the same time review the submitted code to find defects that the tool failed to detect. This mechanism not only improves efficiency, but also enhances the comprehensiveness of security defect detection. **The characteristics of the project can affect the type and quantity of security defects found in it.** We found that _XSS (Cross-Site Scripting)_ and _SQL Injection_ are less discussed during code review, which is consistent with the findings of Paul _et al._[21], but contrary to the results of di Biase _et al._[14], which demonstrated that XSS was a frequently identified security defect with a relatively higher number than other types. The projects used in this study (Nova, Neutron, Qt Base, and Qt Creator) and Paul _et al._'s work (Chromium OS) are the projects that provide infrastructure for higher-level applications to run on, with less direct interaction with users' inputs and outputs, while di Biase _et al._ selected Chromium, a Web browser that has multiple ways of directly interacting with users. One possible reason for this result is that the likelihood of potential input/output-related security defects in core components and projects may be low. This further confirms that project characteristics can influence the types and quantity of security defects that may exist in this project. **Reviewers need to pay more attention to high-risk code with the use of multi-threading or memory allocation.**_Race Condition_ and _Resource Leak_ related security defects are frequently identified in code review. These two defect types are also widely recognized as common defects in software development [42, 43]. Hence, we encourage code reviewers to conduct a rigorous inspection of code involving multi-threading and memory allocation during code review, as they can potentially introduce _Race Condition_ and _Resource Leak_ defects, making them more susceptible to security risks. **Appropriate standardization of practitioners' behaviors in code review is critical for better detection of security defects.** In modern code review, strict reviewing criteria are not mandated [44]. We found that some developers' and reviewers' actions result in ambiguity during the code review process. For example, some comments that identified security defects were neither responded nor had corresponding code modifications. Hence, code reviews may not foster a sufficient amount of discussion [45], increasing the time and effort of the development process and having a negative impact on software quality. Here are several specific recommendations regarding standardization: (1) For security defects that remain unresolved due to disagreement between developers and reviewers, reviewers could further assess the risk of the security defects. We found that the main reason for not resolving security defects is _Disagreements between the developer and the reviewer_ in which the developer did not agree with the reviewer's assessment, and thus decided not to fix the security defects identified. However, due to the different knowledge and experience, it is likely for the developer to merge risky security defects into the source code. Hence, we suggest that when there is a disagreement, reviewers should further assess the risk of identified security defects and communicate with developers if necessary. (2) It is preferable for developers to resolve identified security defects. However, when developers decide not to address a security defect (possibly due to risk assessment or cost-benefit considerations), they should provide clear reasons for this decision in the discussion. It was found that in 40% of the cases, the identified security defects were left unresolved, with no reasons provided. This negatively impacts adequate communication between reviewers and developers, making review details opaque and untraceable. Therefore, we recommend that when a security defect was decided to be left unresolved, sufficient justifications should be provided in the discussion to facilitate further handling of the unresolved security defects. (3) Unresolved security defects should be properly documented, and the developers who decide to fix them in the future should be clearly scheduled for resolution in subsequent stages. According to the results of RQ2.2, 29.9% of security defects were unresolved and merged into source codeDocumenting unresolved security defects in code review helps to effectively track and manage them. Clearly scheduling unresolved security defects that developers decide to fix in the future can ensure they are actually resolved in a timely manner, thus preventing them from causing damage to the system. Therefore, we encourage practitioners to document unresolved defects and schedule needed fixes. ## VI Threats to Validity **Internal Validity:** During the data processing phase, there are comments that were either generated by bots or related to non-review target files, which could influence the accuracy of the final results. We filtered these comments to mitigate bias. Furthermore, we employed a keyword-based search approach to obtain potential security-related comments, which can lead to missing security-related comments that do not contain the exact keywords. To reduce this bias, we collected all the keywords utilized in previous studies into the keyword list and refined the list according to the approach proposed by Bosu _et al._[8], ensuring a comprehensive set of keywords to cover all eligible review comments as much as possible. **External Validity:** We selected four projects from the OpenStack and Qt communities (two each) as the primary data source of our study. However, these projects may not fully represent the entire landscape of security defects across all software systems. This limitation poses a potential threat to the generalizability of our results. To address this concern, we compared and discussed with the previous studies that explored similar questions to supplement our own findings and reduce the risk of interpretation bias. **Construct Validity:** Since this study predefined the types of security defects and matched practical scenarios with security defect types through manual inspection, there is a potential cognitive bias arising from subjective judgments. To reduce this bias, we based the classification on the security defect types proposed in previous works [21] and clarified these security defects by CWEs, thus ensuring the concepts of each type are accurate, appropriate, and consistent throughout the entire research process. In addition, all the data labeling and extraction processes in this study were carried out manually, which introduces the possibility of subjective and potentially misleading conclusions. Therefore, during the data labelling phase, the first and second authors conducted a pilot data labelling independently and reached a consensus on labelling criteria through discussions. During the data extraction phase, while the first author performed the extraction work, the second and third authors reviewed the results to ensure the accuracy and comprehensiveness of the data extraction results. **Reliability:** We drafted a protocol outlining the detailed procedure before conducting our study. The protocol was reviewed and confirmed by all authors to ensure the clarity and repeatability of the method. We also made our full dataset available online for future replications [40]. ## VII Conclusions In this work, we investigated the security defects identified in code review comments. We analyzed the data from four open source projects of two large communities (OpenStack and Qt) that are known for their well-established code review practices. More specifically, we manually inspected 20,995 review comments obtained by keyword-based search and identified 614 security-related comments. We extracted the following data items from each comment: 1) the type of security defect, 2) the action taken by reviewers and developers, 3) reasons for not resolving identified defects from these comments. Our main results are: (1) security defects are not widely discussed in code reviews, and when discussed, _Race Condition_ and _Crash_ security defects are the most frequently identified types; (2) the majority of the reviewers express explicit fixing suggestions of the detected security defects and provide specific solutions. Most of the developers are willing to agree with reviewers' opinions and adopt their proposed solutions; (3) _Not worth fixing the defect now_ and _Disagreement between the developer and the reviewer_ are the main reasons for not resolving security defects.

2307.05449

On the hull and complementarity of one generator quasi-cyclic codes and four-circulant codes

We study one generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have two generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We prove results such as the hull dimension of a four-circulant code is even and one-dimensional hull for double-circulant codes, which are special one generator codes, is not possible when the alphabet size $q$ is congruent to 3 mod 4. We also characterize linear complementary pairs among both classes of codes. Computational results on the code families in consideration are provided as well.

Zohreh Aliabadi, Cem Güneri, Tekgül Kalaycı

2023-07-11T17:23:27Z

http://arxiv.org/abs/2307.05449v2

# On the hull and complementarity of one generator quasi-cyclic codes and four-circulant codes ###### Abstract. We study one generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have two generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We prove results such as the hull dimension of a four-circulant code is even and one dimensional hull for double-circulant codes, which are special one generator codes, is not possible when the alphabet size \(q\) is congruent to \(3\) mod \(4\). We also characterize linear complementary pairs among both classes of codes. Computational results on the code families in consideration are provided as well. Sabanci University, Faculty of Engineering and Natural Sciences, 34956 Istanbul, Turkey E-mail: {zaliabadi, cem.guneri, tekgulkalayci}@sabanciuniv.edu **Keywords** Hull of a code, linear complementary dual (LCD) code, linear complementary pair (LCP) of codes, quasi-cyclic code, double circulant code, four circulant code. **Mathematics Subject Classification** 94B05 94B15 ## 1. Introduction The hull of a linear code \(C\) is defined as \(C\cap C^{\perp}\), where \(C^{\perp}\) is the Euclidean dual code. The hull can also be defined with respect to other inner products. This concept was introduced by Assmus and Key in [1] and later found applications in various problems, such as determining permutation equivalence between codes ([18]) and construction of quantum error-correcting codes ([19]). The smallest possible hull dimension is \(0\) and codes having trivial hull are called linear complementary dual (LCD) codes. LCD codes were introduced by Massey in [16]. Note that the name LCD is justified, since \(C\oplus C^{\perp}=\mathbb{F}_{q}^{n}\) for an LCD code \(C\subseteq\mathbb{F}_{q}^{n}\). LCD codes is generalized to linear complementary pair (LCP) of codes, where a pair \((C,D)\) of linear codes in \(\mathbb{F}_{q}^{n}\) is called LCP of codes if \(C\oplus D=\mathbb{F}_{q}^{n}\). LCD and LCP of codes have drawn much attention in recent years due to their applications in cryptography in the context of side channel and fault injection attacks (see [2], [4], [5]). In this application, the security parameter of an LCP \((C,D)\) of codes is defined as \(\min\{d(C),d(D^{\perp})\}\). LCD and LCP of codes have been very actively studied and we refer to [6], [8], [12], [21] for some of the recent developments. The next smallest hull dimension is \(1\), which is also of interest. We refer to some of the recent contributions in the literature, where codes with hull dimension \(1\) are studied particularly ([7], [13], [19]). QC codes is one of the well-studied families in coding theory. The general theory of QC codes is laid out in [14, 15] and one generator QC codes are throgouhly studied in [17]. LCD and LCP of general QC codes are addressed in [12] and in [6], respectively. This article investigates the hull and complementarity of special classes of quasi-cyclic (QC) codes to obtain concrete results in terms of the polynomials in their generating elements. We study one generator QC codes and four-circulant (FC) codes, which are also QC codes but with two generators. A particular case of one generator QC codes, that is double-circulant (DC) codes, are also addressed. Section 2 provides the background material needed on the hull dimension of linear codes and on QC codes. In Section 3, we prove a formula for the hull dimension of one generator QC codes and also characterize LCP of one generator QC codes. For the special case of DC codes, we provide a necessary and sufficient condition for one hull dimension. Section 4 studies FC codes. Complementary dual FC codes were studied in [21]. Here, we state a formula for the hull dimension of FC codes, which shows that there exists no FC code with odd hull dimension. We also characterize LCP of FC codes. Computational results on the parameters of the investigated codes are presented throughout the article. ## 2. Preliminaries For a linear \([n,k]\) code \(C\) over a finite field \(\mathbb{F}_{q}\), the hull of \(C\) is defined as \[\operatorname{Hull}(C):=C\cap C^{\perp},\] where \(C^{\perp}\) denotes the dual of \(C\) with respect to Euclidean inner product. Let \(h(C)=\dim(\operatorname{Hull}(C))\) denote the hull dimension. If \(q\) is a square one can also define the Hermitian hull of \(C\) \[\operatorname{Hull}_{h}(C):=C\cap C^{\perp_{h}},\] where \(C^{\perp_{h}}\) is the dual with respect to Hermitian inner product. We denote the Hermitian hull dimension by \(h_{h}(C)=\dim(\operatorname{Hull}_{h}(C))\). If \(G\) denotes the \(k\times n\) generator matrix of \(C\), we have \[h(C)=k-\operatorname{rank}(GG^{T})\ ([11,\text{ Proposition 3.1}]). \tag{1}\] If we denote by \(\bar{G}\) the matrix obtained from \(G\) by raising all entries to power \(\sqrt{q}\), then the Hermitian hull dimension is given by \[h_{h}(C)=k-\text{rank}(G\bar{G}^{T})\ (\text{[\@@cite[cite]{[\@@bibref{}{H1}{}{}, Proposition 3.2]})}. \tag{2}\] The minimum hull dimension is \(0\), which amounts to \(C\cap C^{\perp}=\{0\}\) (equivalently \(C\oplus C^{\perp}=\mathbb{F}_{q}^{n}\)). In this case, \(C\) is called a linear complementary dual (LCD) code. A pair \((C,D)\) of linear codes of length \(n\) over \(\mathbb{F}_{q}\) is called a linear complementary pair (LCP) of codes if \(C\oplus D=\mathbb{F}_{q}^{n}\). It is clear that LCD codes is a special case of LCP of codes. Namely, \(C\) is LCD if and only if \((C,C^{\perp})\) is LCP of codes. The security parameter of LCP of codes \((C,D)\) is defined as \(\min\{d(C),d(D^{\perp})\}\). Note that for an LCD code \(C\), the security parameter is simply \(d(C)\). An \([n,k]\) linear code \(C\) over \(\mathbb{F}_{q}\) is called a quasi-cyclic (QC) code of index \(\ell\) if its codewords are invariant under shift by \(\ell\) units, and \(\ell\) is the smallest positive integer with this property. It is known that the index of a QC code is a divisor of its length, say \(n=m\ell\). Here, \(m\) is referred to as the co-index of \(C\). We refer to a QC code of index \(\ell\) as \(\ell\)-QC code for simplicity. It is clear that cyclic codes correspond to QC codes of index \(1\). Like cyclic codes, QC codes also have rich algebraic structure. Let us denote the space of \(m\times\ell\) arrays over \(\mathbb{F}_{q}\) by \(\mathbb{F}_{q}^{m\times\ell}\) and view an \(\ell\)-QC code of length \(m\ell\) as a subspace of this space. With this notation, \(C\) being index \(\ell\) amounts to codewords being closed under row shift. If we let \(R_{m}:=\mathbb{F}_{q}[x]/\langle x^{m}-1\rangle\), then the following map induces a one-to-one correspondence between \(\ell\)-QC codes in \(\mathbb{F}_{q}^{m\times\ell}\) and \(R_{m}\)-submodules of \(R_{m}^{\ell}\) ([14, Lemma 3.1]): \[\begin{array}{cccc}\phi:&\mathbb{F}_{q}^{m\ell}&\longrightarrow&R_{m}^{\ell }\\ &c=(c_{ij})&\longmapsto&(c_{0}(x),c_{1}(x),\ldots,c_{\ell-1}(x)),\end{array}\] where \[c_{j}(x):=\sum_{i=0}^{m-1}\!c_{ij}x^{i}=c_{0j}+c_{1j}x+c_{2j}x^{2}+\cdots+c_{ m-1,j}x^{m-1}\in R_{m}\] for each \(0\leq j\leq\ell-1\). **Throughout the manuscript, we assume that \(q\) and \(m\) are relatively prime.** With this assumption, we have the following factorization into distinct irreducible polynomials in \(\mathbb{F}_{q}[x]\): \[x^{m}-1=\prod_{i=1}^{s}g_{i}(x)\prod_{j=1}^{t}(h_{j}(x)h_{j}^{*}(x)). \tag{3}\] Here \(g_{i}(x)\) is self-reciprocal for \(1\leq i\leq s\) and \(h_{j}(x)\) and \(h_{j}^{*}(x)\) are reciprocal pairs for \(1\leq j\leq t\), where the reciprocal of a monic polynomial \(f(x)\) with non-zero constant term is defined as \[f^{*}(x)=f(0)^{-1}x^{\deg f}f(x^{-1}).\] By the Chinese Remainder Theorem (CRT), \(R^{\ell}_{m}\) decomposes as \[R^{\ell}_{m}=\left(\bigoplus_{i=1}^{s}\mathbb{G}^{\ell}_{i}\right)\bigoplus \left(\bigoplus_{j=1}^{t}\left(\mathbb{H}^{\prime}_{\ j}\bigoplus\mathbb{H}^{ \prime\ell}_{\ j}\right)\right),\] where for \(1\leq i\leq s\), \(\mathbb{G}_{i}=\mathbb{F}_{q}[x]/\langle g_{i}(x)\rangle\), and for \(1\leq j\leq t\), \(\mathbb{H}^{\prime}_{\ j}=\mathbb{F}_{q}[x]/\langle h_{j}(x)\rangle\) and \(\mathbb{H}^{\prime\prime}_{\ j}=\mathbb{F}_{q}[x]/\langle h_{j}^{*}(x)\rangle\). If \(\xi\) is a primitive \(m^{th}\) root of unity over \(\mathbb{F}_{q}\) and \(\xi^{u_{i}}\), \(\xi^{v_{j}}\) and \(\xi^{-v_{j}}\) are roots of \(g_{i}(x)\), \(h_{j}(x)\) and \(h_{j}^{*}(x)\), respectively, then we have \(\mathbb{G}_{i}\cong\mathbb{F}_{q}(\xi^{u_{i}})\), \(\mathbb{H}^{\prime}_{\ j}\cong\mathbb{F}_{q}(\xi^{v_{j}})\cong\mathbb{F}_{q}( \xi^{-v_{j}})\cong\mathbb{H}^{\prime\prime}_{\ j}\). Since the degree of a self-reciprocal polynomial is even, the degree of \(\mathbb{G}_{i}\) over \(\mathbb{F}_{q}\) is even for all \(i\), except the components corresponding to the self-reciprocal irreducible factors \((x\pm 1)\) of \(x^{m}-1\). Via the CRT decomposition of \(R^{\ell}_{m}\), an \(\ell\)-QC code \(C\) can be decomposed as \[C=\left(\bigoplus_{i=1}^{s}C_{i}\right)\bigoplus\left(\bigoplus_{j=1}^{t} \left(C^{\prime}_{j}\bigoplus C^{\prime\prime}_{j}\right)\right), \tag{4}\] where \(C_{i},C^{\prime}_{j},C^{\prime\prime}_{j}\) are linear codes of length \(\ell\) over the fields \(\mathbb{G}_{i},\mathbb{H}^{\prime}_{\ j},\mathbb{H}^{\prime\prime}_{\ j}\), respectively. These are called the constituents of \(C\). It is known that the dual code \(C^{\perp}\) is also \(\ell\)-QC code and it decomposes into constituents as \[C^{\perp}=\left(\bigoplus_{i=1}^{s}C_{i}^{\perp_{h}}\right)\bigoplus\left( \bigoplus_{j=1}^{t}\left(C^{\prime\prime}_{\ j}\bigoplus C^{\prime}_{\ j} \right)\right). \tag{5}\] We refer to [14, 15] for (4) and (5). Hence the hull dimension of the \(\ell\)-QC code \(C\) over \(\mathbb{F}_{q}\) is \[h(C)=\sum_{i=1}^{s}\deg g_{i}(x)\;h_{h}(C_{i})+\sum_{j=1}^{t}\deg h_{j}(x)[ \dim(C^{\prime}_{\ j}\cap C^{\prime\prime}_{\ j})+\dim(C^{\prime\prime}_{\ j} \cap C^{\prime}_{\ j})]. \tag{6}\] If \(C\) and \(D\) are \(\ell\)-QC codes of length \(m\ell\) over \(\mathbb{F}_{q}\) with constitutents \(C_{i},C^{\prime}_{j},C^{\prime\prime}_{j}\) and \(D_{i},D^{\prime}_{j},D^{\prime\prime},j\), respectively (cf. (4)), then \((C,D)\) is LCP of codes if and only if \[(C_{i},D_{i}),\,(C^{\prime}_{j},D^{\prime}_{j})\text{ and }(C^{\prime\prime} _{\ j},D^{\prime\prime}_{\ j})\text{ are LCP, for all }i,j\text{ ([\@@cite[cite]{[\@@bibref{}{LCP}{}{}]}).} \tag{7}\] As a consequence, \(C\) is LCD if and only if \[C_{i}\cap C_{i}^{\perp_{h}}=\{0\},\,C^{\prime}_{j}\cap C^{\prime\prime}_{\ j}=\{0\}\text{ and }C^{\prime\prime}_{j}\cap C^{\prime}_{\ j}=\{0\}\text{ for all }i,j\text{ ([\@@cite[cite]{[\@@bibref{}{LCP}{}{}]}, Theorem 3.1]).} \tag{8}\] ## 3. One-Generator QC Codes We continue with the notation and assumptions in Section 2. In particular, we assume \(\gcd(m,q)=1\). Let \(C=\langle(a_{1}(x),\ldots,a_{\ell}(x))\rangle\subset R_{m}^{\ell}\) be a 1-generator \(\ell\)-QC code. Constituents of \(C\) can be described as follows ([12, Equation 2.3]): \[C_{i} = Span_{\mathbb{G}_{i}}\{(a_{1}(\xi^{u_{i}}),\ldots,a_{\ell}(\xi^{ u_{i}}))\},\] \[C_{j}^{\prime} = Span_{\mathbb{H}_{j}^{\prime}}\{(a_{1}(\xi^{v_{j}}),\ldots,a_{ \ell}(\xi^{v_{j}}))\},\] \[{C^{\prime\prime}}_{j} = Span_{\mathbb{H}^{\prime\prime}}\{(a_{1}(\xi^{-v_{j}}),\ldots,a _{\ell}(\xi^{-v_{j}}))\}. \tag{9}\] The generator polynomial of \(C\) is defined by \[g(x):=\gcd(a_{1}(x),\ldots,a_{\ell}(x),x^{m}-1).\] The monic polynomial \(h(x)\) of the least degree, which satisfies \(h(x)a_{i}(x)=0\) for all \(1\leq i\leq\ell\), is called the parity check polynomial of \(C\). The polynomials \(g(x)\) and \(h(x)\) are unique, they satisfy the equation \(g(x)h(x)=x^{m}-1\) in \(\mathbb{F}_{q}[x]\) and \[\dim C=m-\deg g(x)=\deg h(x)\text{ (cf. \@@cite[cite]{[\@@bibref{}{Kor}{}{}]})}.\] An \([m\ell,k]_{q}\) 1-generator \(\ell\)-QC code is called maximal if \(k=m\). For a maximal 1-generator QC code, we clearly have \(g(x)=1\) and \(h(x)=x^{m}-1\). We start with describing the hull dimension of 1-generator QC codes. **Theorem 3.1**.: _Let \(C=\langle(a_{1}(x),\ldots,a_{\ell}(x))\rangle\) be a 1-generator \(\ell\)-QC code of length \(m\ell\) over \(\mathbb{F}_{q}\), whose parity check polynomial is \(h(x)\). Then the hull dimension of \(C\) is \(h(C)=\deg u(x)\), where_ \[u(x)=\gcd\left(\sum_{r=1}^{\ell}a_{r}(x)a_{r}(x^{m-1}),h(x)\right).\] Proof.: By (9), a constituent of \(C\) is either 0 or 1 dimensional over its field of definition. We analyze each constituent's contribution to the hull in three cases. Recall that the polynomials \(g_{i}(x),h_{j}(x),h_{j}^{*}(x)\) are irreducible factors of \(x^{m}-1\) (cf. (3)) and they correspond to the fields of definition of the constituents. On the other hand, the polynomials \(g(x)\) and \(h(x)\) stand for the generator and parity check polynomials of \(C\), respectively. **Case 1.** For any \(i\in\{1,\ldots,s\}\), \(C_{i}\cap C_{i}^{\perp_{h}}\neq\{0\}\) if and only if \(C_{i}\neq\{0\}\) and \(C_{i}\subseteq C_{i}^{\perp_{h}}\). Note that \(C_{i}\neq\{0\}\) if and only if \(g_{i}(x)\mid h(x)\). On the other hand, \(C_{i}\subseteq C_{i}^{\perp_{h}}\) if and only if \[\sum_{r=1}^{\ell}a_{r}(\xi^{u_{i}})a_{r}(\xi^{-u_{i}})=0.\] This is equivalent to the condition \[g_{i}(x)\mid\sum_{r=1}^{\ell}a_{r}(x)a_{r}(x^{m-1}).\] **Case 2.** For any \(j\in\{1,\ldots,t\}\), \({C^{\prime}}_{j}\cap{C^{\prime\prime}}_{j}^{\perp}\neq\{0\}\) if and only if \(C^{\prime}_{j}\neq\{0\}\) and \({C^{\prime}_{j}}\subseteq{C^{\prime\prime}}_{j}^{\perp}\). The first condition is equivalent to \(h_{j}(x)\mid h(x)\), whereas the second condition amounts to \[\sum_{r=1}^{\ell}a_{r}(\xi^{v_{j}})a_{r}(\xi^{-v_{j}})=0.\] This is equivalent to the condition \[h_{j}(x)\mid\sum_{r=1}^{\ell}a_{r}(x)a_{r}(x^{m-1}).\] **Case 3.** Arguing as in Case 2, we can see that \({C^{\prime\prime}}_{j}\cap{C^{\prime}}_{j}^{\perp}\neq\{0\}\) if and only if \(h_{j}^{*}(x)\mid h(x)\) and \(h_{j}^{*}(x)\mid\sum_{r=1}^{\ell}a_{r}(x)a_{r}(x^{m-1})\). Putting these together, we reach the result via (6). The following is an immediate consequence of Theorem 3.1. We note that the LCD characterization for a special class of maximal 1-generator 2-QC codes (namely, double circulant codes) was given in [12, Theorem 5.1]. Corollary 3.2 generalizes this result. **Corollary 3.2**.: _Let \(C=\langle(a_{1}(x),\ldots,a_{\ell}(x))\rangle\) be a 1-generator \(\ell\)-QC code of length \(m\ell\) over \(\mathbb{F}_{q}\), whose parity check polynomial is \(h(x)\). Then \(C\) is LCD if and only if_ \[\gcd\left(\sum_{r=1}^{\ell}a_{r}(x)a_{r}(x^{m-1}),h(x)\right)=1.\] Tables 1 and 2 illustrate binary and ternary maximal 1-generator 2-QC LCD codes \(\langle(a_{1}(x),a_{2}(x)\rangle\) of length \(2m\). The search is done by Magma [3] for random \(a_{1}(x),a_{2}(x)\) in \(R_{m}\) satisfying the condition in Theorem 3.1. In the tables \(d\) presents the best minimum distance we obtained from this type of QC codes and \(d^{*}\) represents optimal minimum distance of linear codes of length \(2m\) and dimension \(m\) ([9]). Yang and Massey showed that a cyclic code is LCD if and only if its generator polynomial is self-reciprocal ([20]). The next result shows that self-reciprocal generator polynomial is a necessary condition for an LCD 1-generator QC code. However it is not sufficient as shown in Example 3.4. **Proposition 3.3**.: _Let \(C=\langle(a_{1}(x),\ldots,a_{\ell}(x))\rangle\) be a 1-generator \(\ell\)-QC code with the generator polynomial \(g(x)\). If \(C\) is LCD then \(g(x)\) is self-reciprocal._ Proof.: Suppose \(g(x)\) is not self-reciprocal. Then there exists \(h_{j}(x)\) such that \(h_{j}(x)\mid g(x)\) but \(h_{j}^{*}(x)\nmid g(x)\) (i.e. \(h_{j}^{*}(x)\mid h(x)\)). Since \(h_{j}(x)\mid g(x)\), we have that \(h_{j}(x)\mid a_{r}(x)\), for all \(1\leq r\leq\ell\). Therefore \(h_{j}^{*}(x)\mid a_{r}(x^{m-1})\) for all \(r\). Hence \[h_{j}(x)\mid\gcd\left(\sum_{r=1}^{\ell}a_{r}(x)a_{r}(x^{m-1}),h(x)\right),\] which contradicts the assumption that \(C\) is LCD. **Example 3.4**.: Let \(C=\langle(x^{2}+x,x^{2}+1)\rangle\) be a binary 1-generator 2-QC code of length 6 (i.e. \(m=3\)). Note that \(g(x)=x+1\), \(h(x)=x^{2}+x+1\) and hence \(C\) is of dimension 2. The generator polynomial \(g(x)\) is self-reciprocal but it is easy to seee that \(h(C)=2\) (cf. Theorem 3.1). Therefore \(C\) is not LCD. Next, we study LCP of 1-generator QC codes. The following simple observation shows that LCP of 1-generator QC codes are rather constrained. \begin{table} \begin{tabular}{||c c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a_{1}(x)\) & \(a_{2}(x)\) \\ \hline \hline 3 & 2 & 3 & \(x+1\) & \(x^{2}+x+1\) \\ 5 & 3 & 4 & \(x^{3}+1\) & \(x^{2}+x+1\) \\ 7 & 4 & 4 & \(x^{2}+1\) & \(x^{3}+x+1\) \\ 9 & 5 & 6 & \(x^{5}+x+1\) & \(x^{5}+x^{2}+x+1\) \\ 11 & 6 & 7 & \(x^{4}+1\) & \(x^{8}+x^{7}+x^{6}+x^{2}+1\) \\ 13 & 7 & 7 & \(x^{5}+1\) & \(x^{11}+x^{9}+x^{6}+x^{3}+1\) \\ 15 & 7 & 8 & \(x^{6}+x^{2}+x+1\) & \(x^{5}+x+1\) \\ 17 & 8 & 8 & \(x^{6}+x^{4}+x+1\) & \(x^{5}+x^{4}+x^{3}+x+1\) \\ \hline \end{tabular} \end{table} Table 1. Binary maximal 1-generator 2-QC LCD Codes. \begin{table} \begin{tabular}{||c c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a_{1}(x)\) & \(a_{2}(x)\) \\ \hline \hline 4 & 4 & 4 & \(x+1\) & \(x+2\) \\ 5 & 4 & 5 & \(x+2\) & \(2x+2\) \\ 7 & 6 & 6 & \(2x^{6}+2x^{4}+2x^{3}+2x+1\) & \(2x^{4}+x+2\) \\ 8 & 6 & 6 & \(x^{3}+2x+2\) & \(x^{2}+2x+2\) \\ 10 & 6 & 7 & \(x^{3}+x+1\) & \(x^{2}+2x+1\) \\ 11 & 7 & 8 & \(x^{3}+2x+2\) & \(x^{3}+2x^{2}+2x+1\) \\ 13 & 7 & 8 & \(x^{3}+x^{2}+x+1\) & \(x^{4}+x^{2}+2x+2\) \\ 14 & 8 & 9 & \(x^{4}+x^{2}+x+2\) & \(x^{3}+2x^{2}+x+1\) \\ \hline \end{tabular} \end{table} Table 2. Ternary maximal 1-generator 2-QC LCD Codes. **Lemma 3.5**.: _If \((C,D)\) is LCP of 1-generator \(\ell\)-QC codes of length \(m\ell\), then \(\ell=2\) and both \(C\) and \(D\) are maximal._ Proof.: Since the pair is linear complementary, we have \(\dim(C)+\dim(D)=m\ell\). However, the maximal dimension for 1-generator QC codes is \(m\). Therefore, \(\ell=2\) and the dimension of each code is \(m\). The following result characterizes LCP of maximal 1-generator 2-QC codes. We note that this result was proved for double circulant codes in [6, Proposition 3.2]. **Proposition 3.6**.: _Let \(C=\langle(a_{1}(x),a_{2}(x))\rangle\) and \(D=\langle(b_{1}(x),b_{2}(x))\rangle\) be maximal 1-generator 2-QC codes. Then \((C,D)\) is LCP of codes if and only if_ \[\gcd(a_{1}(x)b_{2}(x)-a_{2}(x)b_{1}(x),x^{m}-1)=1.\] Proof.: Constituents of both codes, which are described in (9), lie in 2 dimensional spaces over certain extensions of \(\mathbb{F}_{q}\). Therefore by (7), \((C,D)\) is LCP of codes if and only if the following \(2\times 2\) matrices are of full rank for all \(i,j\): \[\left(\begin{array}{cc}a_{1}(\xi^{u_{i}})&a_{2}(\xi^{u_{i}})\\ b_{1}(\xi^{u_{i}})&b_{2}(\xi^{u_{i}})\end{array}\right)\ \ \left(\begin{array}{cc}a_{1}(\xi^{v_{j}})&a_{2}(\xi^{v_{j}})\\ b_{1}(\xi^{v_{j}})&b_{2}(\xi^{v_{j}})\end{array}\right)\ \ \left(\begin{array}{cc}a_{1}(\xi^{-v_{j}})&a_{2}(\xi^{-v_{j}})\\ b_{1}(\xi^{-v_{j}})&b_{2}(\xi^{-v_{j}})\end{array}\right)\] This is true if and only if no irreducible factor of \(x^{m}-1\) divide the polynomial \(a_{1}(x)b_{2}(x)-a_{2}(x)b_{1}(x)\). A 1-generator QC code of the form \(C=\langle(1,a(x))\rangle\subset R_{m}^{2}\) is called a double circulant (DC) code. A DC code is a maximal 1-generator QC code. We provide ternary LCP of DC codes with good security parameters in Table 3. Here, \(d\) represents the security parameter of the pair and \(d^{*}\) is the best minimum distance for ternary \([2m,m]\) linear codes ([9]). We conclude this section with further observations on DC codes. A formula for the hull dimension of DC codes follows from Theorem 3.1, which is \[h(C)=\deg\gcd(1+a(x)a(x^{m-1}),x^{m}-1).\] \begin{table} \begin{tabular}{||c c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a(x)\) & \(b(x)=-a(x^{m-1})\) \\ \hline \hline 4 & 4 & 4 & \(x^{3}+2x+1\) & \(x^{3}+2x+2\) \\ 5 & 4 & 5 & \(x^{4}+x+2\) & \(x^{4}+2x+1\) \\ 7 & 5 & 6 & \(x^{6}+x^{3}+x+1\) & \(2x^{6}+2x^{4}+2x+2\) \\ 8 & 6 & 6 & \(x^{7}+x^{3}+x^{2}+2x+2\) & \(x^{7}+2x^{6}+2x^{5}+2x+1\) \\ 10 & 7 & 7 & \(x^{9}+x^{5}+x^{4}+x^{2}+x+2\) & \(2x^{9}+2x^{8}+2x^{6}+2x^{5}+2x+1\) \\ 11 & 7 & 8 & \(2x^{10}+2x^{9}+2x^{8}+x^{5}+x^{2}+2\) & \(2x^{9}+2x^{6}+x^{3}+x^{2}+x+1\) \\ \hline \end{tabular} \end{table} Table 3. Ternary LCP of DC Codes. The next result characterizes the existence of DC codes of hull dimension \(1\), which is of interest for various applications (cf. Introduction), and it also provides a necessary condition for the existence of DC codes of odd hull dimension. The proof explicitly describes the DC codes of hull dimension \(1\) as well. **Theorem 3.7**.: _i. There exists a DC code of hull dimension one over \(\mathbb{F}_{q}\) if and only if \(q\equiv 1\) (mod 4) or \(q\) is even._ _ii. If there exists a DC code with odd hull dimension over \(\mathbb{F}_{q}\), then \(q\equiv 1\) (mod 4) or \(q\) is even._ Proof.: i. Let \(C=\langle(1,a(x))\rangle\subset R_{m}^{2}\). The only linear factors of \(x^{m}-1\) are \(x-1\) and \(x+1\), where the latter can only occur in the case of \(\mathbb{F}_{q}\) with odd characteristic and \(m\) is even. Therefore hull dimension \(1\) is only possible if there is a contribution to the hull only from one of these linear irreducible factors (cf. (6)). Let us denote the constituent corresponding to \(x-1\) by \(C_{1}\subset\mathbb{F}_{q}^{2}\), which is a \(1\)-dimensional space spanned by \((1,a(1))\). It is easy to observe that \(C_{1}^{\perp}=Span_{\mathbb{F}_{q}}\{(-a(1),1)\}\). Therefore \(h(C_{1})=1\) if and only if \(a(1)^{2}=-1\). This implies that \(q\equiv 1\) (mod 4) or \(q\) is even. For the converse, let us construct \(a(x)\) so that the resulting DC code has \(1\)-dimensional hull. In the case \(q\equiv 1\) (mod 4), let \(\alpha\in\mathbb{F}_{q}\setminus\{0\}\) such that \(\alpha^{2}=-1\) and set \(a(x)=x-(\alpha+1)\). Then, \[1+a(x)a(x^{m-1}) = 1+(x-(\alpha+1))(x^{m-1}-(\alpha+1))\] \[= (\alpha+1)(2-x-x^{m-1}).\] For an \(m^{th}\) root of unity \(\zeta\) to be a root of this polynomial, we have \[\zeta^{-1}+\zeta-2=0\iff\zeta^{2}-2\zeta+1=(\zeta-1)^{2}=0\iff\zeta=1.\] Hence \(\gcd{(1+a(x)a(x^{m-1}),x^{m}-1)}=x-1\) and \(h(C)=1\) by Theorem 3.1. For \(q\) even, let \(u(x)=(x^{m}-1)/(x-1)\) and let \(\beta:=u(1)\neq 0\). If we set \(a(x)=u(x)+(\beta+1)\) and \(v(x)=1+a(x)a(x^{m-1})\), we have \[v(1)=1+(u(1)+\beta+1)(u(1)+\beta+1)=1+1=0.\] On the other hand, if \(\zeta\neq 1\) is another \(m^{th}\) root of unity, we have \[v(\zeta)=1+(u(\zeta)+\beta+1)(u(\zeta^{-1})+\beta+1).\] Since \(u(\zeta)=u(\zeta^{-1})=0\), we obtain \[v(\zeta)=1+(\beta+1)^{2}=1+\beta^{2}+1=\beta^{2}\neq 0.\] Therefore, \(\gcd(1+a(x)a(x^{m-1}),x^{m}-1)=x-1\) and \(h(C)=1\) again. ii. All self-reciprocal irreducible factors \(g_{i}(x)\) of \(x^{m}-1\) (cf. (3)) other than \((x\mp 1)\) are of even degree. Therefore contribution to the hull dimension from the constituents corresponding to such \(g_{i}(x)\) is even (cf. (6)). For a pair of reciprocal irreducible factors \(h_{j}(x),h_{j}^{*}(x)\), the corresponding constituents of \(C\) are \[C^{\prime}_{j}=Span_{\mathbb{H}^{\prime}}\{(1,a(\xi^{v_{j}}))\}\ \ \text{and}\ \ C^{\prime\prime}_{j}=Span_{\mathbb{H}^{\prime\prime}}\{(1,a(\xi^{-v_{j}}))\}.\] Duals of these constituents are easily seen to be \[{C^{\prime}}^{\perp}_{j}=Span_{\mathbb{H}^{\prime}}\{(-a(\xi^{v_{j}}),1)\}\ \ \text{and}\ \ {C^{\prime\prime}}^{\perp}_{j}=Span_{\mathbb{H}^{\prime\prime}}\{(-a(\xi^{-v_{ j}}),1)\}.\] Therefore, \({C^{\prime}_{j}\cap{C^{\prime\prime}}^{\perp}_{j}\neq\{0\}}\) if and only if \(a(\xi^{v_{j}})a(\xi^{-v_{j}})=-1\). On the other hand, \({C^{\prime}}^{\perp}_{j}\cap{C^{\prime\prime}}_{j}\neq\{0\}\) if and only if \(a(\xi^{v_{j}})a(\xi^{-v_{j}})=-1\). Hence, these two intersections are either simultaneously \(0\) or they are both of dimension \(1\). Hence, the contribution of such pair of constituents to \(h(C)\) is also even (cf. (6)). Therefore an odd hull dimension can only be attained from a constituent corresponding to a linear factor of \(x^{m}-1\), which implies the conditions on \(q\) as in part i. Tables 4 and 5 present the best possible minimum distances for binary and quinary DC codes with hull dimension \(1\). Here \(d^{*}\) is the best known minimum distance for linear codes of length \(2m\) and dimension \(m\) ([9]), whereas \(d\) is the best possible minimum distance which can be obtained from a DC code \(C=\langle(1,a(x))\rangle\) of hull dimension \(1\). \begin{table} \begin{tabular}{||c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a(x)\) \\ \hline \(3\) & \(2\) & \(3\) & \(x^{2}+x+1\) \\ \(5\) & \(4\) & \(4\) & \(x^{4}+x^{2}+1\) \\ \(7\) & \(4\) & \(4\) & \(x^{6}+x^{3}+1\) \\ \(9\) & \(6\) & \(6\) & \(x^{8}+x^{7}+x^{5}+x^{3}+x^{2}\) \\ \(11\) & \(6\) & \(7\) & \(x^{10}+x^{8}+x^{5}+x^{3}+1\) \\ \(13\) & \(6\) & \(7\) & \(x^{12}+x^{4}+x^{3}+x+1\) \\ \(15\) & \(8\) & \(8\) & \(x^{14}+\cdots+x^{7}+x^{4}+x^{3}+x\) \\ \(17\) & \(8\) & \(8\) & \(x^{16}+\cdots+x^{11}+x^{5}+x^{3}+x+1\) \\ \hline \end{tabular} \end{table} Table 4. Binary DC Codes with hull dimension \(1\) The next example shows that the converse of part ii in Theorem 3.7 is not always true. **Example 3.8**.: Let \(q=4\) and \(m=9\). Then \[x^{9}-1=(x+1)(x+\alpha)(x+\alpha^{2})(x^{3}+\alpha)(x^{3}+\alpha^{2}),\] where \(\alpha\) is a primitive element of \(\mathbb{F}_{4}\). Note that \((x+\alpha),(x+\alpha^{2})\) and \((x^{3}+\alpha),(x^{3}+\alpha^{2})\) are reciprocal pairs. For the following choices of \(a(x)\), we have even hull dimension for the DC code \(\langle(1,a(x))\rangle\subset(\mathbb{F}_{4}[x]/\langle x^{9}-1\rangle)^{2}\): * \(a(x)=\alpha^{2}x^{8}+\alpha^{2}x^{7}+\alpha^{2}x^{6}+x^{3}+x+1\): \([18,9,7]_{4}\) DC code with hull dimension \(2\). * \(a(x)=x^{7}+x^{6}+x^{5}+\alpha x^{4}+\alpha^{2}x^{3}+\alpha^{2}x^{2}+\alpha x+ \alpha^{2}\): \([18,9,7]_{4}\) DC code with hull dimension \(6\). Let \(q=5\) and \(m=8\). Then \[x^{8}-1=(x+1)(x+2)(x+3)(x+4)(x^{2}+2)(x^{2}+3).\] Note that \((x+1),(x+4)\) are self-reciprocal and \((x+2),(x+3)\) and \((x^{2}+2),(x^{2}+3)\) are reciprocal to each other. For the following choices of \(a(x)\), we have even hull dimension for the DC code \(\langle(1,a(x))\rangle\subset(\mathbb{F}_{5}[x]/\langle x^{8}-1\rangle)^{2}\): * \(a(x)=4x^{7}+4x^{6}+x^{3}+4x^{2}+3x+2\): \([16,8,7]_{5}\) DC code with hull dimension \(2\). * \(a(x)=4x^{7}+4x^{6}+4x^{5}+2x^{3}+4\): \([16,8,6]_{5}\) DC code with hull dimension \(4\). ## 4. Four-Circulant Codes We now investigate a class of \(2\)-generator \(4\)-QC codes. The code \[C=\langle(1,0,a_{1}(x),a_{2}(x)),(0,1,-a_{2}(x^{m-1}),a_{1}(x^{m-1}))\rangle \subset R_{m}^{4}\] \begin{table} \begin{tabular}{||c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a(x)\) \\ \hline \hline 3 & 3 & 4 & \(3x^{2}+3x+1\) \\ 4 & 4 & 4 & \(x^{3}+x^{2}+3x+3\) \\ 6 & 6 & 6 & \(x^{5}+x^{3}+2x^{2}+2x+1\) \\ 7 & 6 & 6 & \(x^{4}+x^{3}+x^{2}+2x+3\) \\ 8 & 7 & 7 & \(x^{5}+2x^{4}+4x^{3}+2x^{2}+2x+2\) \\ 9 & 7 & 7 & \(x^{5}+x^{4}+x^{3}+2x^{2}+x+2\) \\ 11 & 8 & 8 & \(x^{6}+x^{5}+x^{4}+2x^{3}+x^{2}+4x+2\) \\ 12 & 8 & 8 & \(x^{7}+x^{6}+4x^{5}+2x^{4}+4x^{3}+4x^{2}+3x+4\) \\ \hline \end{tabular} \end{table} Table 5. Quinary DC Codes with hull dimension \(1\) is called a four-circulant (FC) code. By [12, Equation 2.3], the following matrices generate the 2-dimensional constituents \(C_{i},C^{\prime}_{j},C^{\prime\prime}_{j}\) of \(C\) (\(1\leq i\leq s\) and \(1\leq j\leq t\)): \[G_{i}=\begin{pmatrix}1&0&a_{1}(\xi^{u_{i}})&a_{2}(\xi^{u_{i}})\\ 0&1&-a_{2}(\xi^{-u_{i}})&a_{1}(\xi^{-u_{i}})\end{pmatrix}\ \ G^{\prime}_{j}= \begin{pmatrix}1&0&a_{1}(\xi^{v_{j}})&a_{2}(\xi^{v_{j}})\\ 0&1&-a_{2}(\xi^{-v_{j}})&a_{1}(\xi^{-v_{j}})\end{pmatrix}\] \[G^{\prime\prime}{}_{j}=\begin{pmatrix}1&0&a_{1}(\xi^{-v_{j}})&a_{2}(\xi^{-v_{ j}})\\ 0&1&-a_{2}(\xi^{v_{j}})&a_{1}(\xi^{v_{j}})\end{pmatrix} \tag{10}\] We first describe the hull dimension of FC codes. **Theorem 4.1**.: _Let \(C=\langle(1,0,a_{1}(x),a_{2}(x)),(0,1,-a_{2}(x^{m-1}),a_{1}(x^{m-1}))\rangle \subset R_{m}^{4}\) be a FC code. Then the hull dimension of \(C\) is \(h(C)=2\deg u(x)\), where_ \[u(x)=\gcd\bigl{(}1+a_{1}(x)a_{1}(x^{m-1})+a_{2}(x)a_{2}(x^{m-1}),x^{m}-1\bigr{)}.\] _In particular, a FC code of odd hull dimension does not exist over any finite field._ Proof.: By (2) and [10, Theorem 2.1], which generalizes (1), dimensions that contribute to the hull dimension \(h(C)\) of \(C\) are the following (cf. (6)): \[h_{h}(C_{i})=2-\mathrm{rank}(G_{i}\bar{G_{i}}^{T}),\ \dim(C^{\prime}_{j}\cap C^{ \prime\prime}_{j})=2-\mathrm{rank}(G^{\prime}_{j}G^{\prime\prime T}_{j})=2- \mathrm{rank}(G^{\prime\prime}_{j}G^{\prime T}_{j})=\dim(C^{\prime\prime}_{j} \cap C^{\prime\perp}_{j}). \tag{11}\] Let \[A(x):=1+a_{1}(x)a_{1}(x^{m-1})+a_{2}(x)a_{2}(x^{m-1}).\] Note that \[G_{i}\bar{G_{i}^{T}}=\left(\begin{array}{ccc}1&0&a_{1}(\xi^{u_{i}})&a_{2}( \xi^{u_{i}})\\ 0&1&-a_{2}(\xi^{-u_{i}})&a_{1}(\xi^{-u_{i}})\end{array}\right)\left(\begin{array} []{ccc}1&0\\ 0&1\\ a_{1}(\xi^{-u_{i}})&-a_{2}(\xi^{u_{i}})\\ a_{2}(\xi^{-u_{i}})&a_{1}(\xi^{u_{i}})\end{array}\right)=\left(\begin{array} []{ccc}A(\xi^{u_{i}})&0\\ 0&A(\xi^{u_{i}})\end{array}\right).\] On the other hand, \[G^{\prime}_{j}{G^{\prime\prime}_{j}}^{T}=\left(\begin{array}{ccc}1&0&a_{1}( \xi^{v_{j}})&a_{2}(\xi^{v_{j}})\\ 0&1&-a_{2}(\xi^{-v_{j}})&a_{1}(\xi^{-v_{j}})\end{array}\right)\left(\begin{array} []{ccc}1&0\\ 0&1\\ a_{1}(\xi^{-v_{j}})&-a_{2}(\xi^{v_{j}})\\ a_{2}(\xi^{-v_{j}})&a_{1}(\xi^{v_{j}})\end{array}\right)=\left(\begin{array} []{ccc}A(\xi^{v_{j}})&0\\ 0&A(\xi^{v_{j}})\end{array}\right).\] Hence we have (cf. (3)), \[\mathrm{rank}(G_{i}\bar{G_{i}^{T}})=\left\{\begin{array}{ll}0&\text{if }g_{i}(x)|A(x) \\ 2&\text{otherwise}\end{array}\right.,\ \ \mathrm{rank}(G^{\prime}_{j}{G^{\prime\prime}_{j}}^{T})= \mathrm{rank}(G^{\prime\prime}_{j}{G^{\prime\prime}_{j}}^{T})=\left\{ \begin{array}{ll}0&\text{if }h_{j}(x)|A(x)\\ 2&\text{otherwise}\end{array}\right..\] Irreducible factors \(h_{j}(x)\) and \(h_{j}^{*}(x)\) of \(x^{m}-1\) both divide \(A(x)\) or neither does, since \(A(x)\) is self-reciprocal. Combining these with (6) and (11), the result follows. An immediate consequence of Theorem 4.1 is the characterization of LCD FC codes. Although this analysis is carried out in [21, Section 3] and used, it is not explicitly stated. So, we state this result. **Corollary 4.2**.: _Let \(C=\langle(1,0,a_{1}(x),a_{2}(x)),(0,1,-a_{2}(x^{m-1}),a_{1}(x^{m-1}))\rangle \subset R_{m}^{4}\) be a FC code. Then \(C\) is LCD if and only if_ \[\gcd(1+a_{1}(x)a_{1}(x^{m-1})+a_{2}(x)a_{2}(x^{m-1}),x^{m}-1)=1.\] Tables 6 and 7 present the best possible distances of binary and ternary LCD FC codes. Meanings of \(d\) and \(d^{*}\) are analogous to previous tables. We finish by characterizing LCP of FC codes. **Theorem 4.3**.: _Let_ \[C = \langle(1,0,a_{1}(x),a_{2}(x)),(0,1,-a_{2}(x^{m-1}),a_{1}(x^{m-1})\rangle\] \[D = \langle(1,0,b_{1}(x),b_{2}(x)),(0,1,-b_{2}(x^{m-1}),b_{1}(x^{m-1})\rangle\] _be FC codes of length \(4m\) over \(\mathbb{F}_{q}\). Then, \((C,D)\) is LCP if and only if_ \[\gcd\left(\sum_{t=1}^{2}[(a_{t}(x)-b_{t}(x))(a_{t}(x^{m-1})-b_{t}(x^{m-1})],x^ {m}-1\right)=1.\] \begin{table} \begin{tabular}{||c c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a_{1}(x)\) & \(a_{2}(x)\) \\ \hline \hline 3 & 2 & 4 & \(x+1\) & \(x^{2}+x\) \\ 5 & 5 & 6 & \(x^{2}\) & \(x^{2}+x+1\) \\ 7 & 6 & 8 & \(x^{6}+x^{5}+x^{4}+x^{3}\) & \(x+1\) \\ 9 & 6 & 8 & \(x^{7}+x^{6}+x^{5}+x^{3}+x\) & \(x^{3}+x+1\) \\ 11 & 9 & 10 & \(x^{5}+x^{3}+x^{2}\) & \(x^{7}+x^{6}+x^{5}+x+1\) \\ 13 & 8 & 10 & \(x^{7}+x^{6}+x+1\) & \(x^{4}+x^{3}+x^{2}+1\) \\ \hline \end{tabular} \end{table} Table 6. Binary LCD FC codes. \begin{table} \begin{tabular}{||c c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a_{1}(x)\) & \(a_{2}(x)\) \\ \hline \hline 4 & 6 & 6 & \(2x^{3}+x^{2}+1\) & \(2x^{3}+1\) \\ 5 & 7 & 7 & \(x^{4}+2x^{2}+x+2\) & \(2x^{4}+2x^{2}+1\) \\ 7 & 8 & 9 & \(x^{6}+2x^{5}+x^{3}+x\) & \(2x^{5}+x^{4}+x^{3}+2\) \\ 8 & 9 & 10 & \(2x^{5}+x^{2}+1\) & \(x^{5}+x^{4}+x^{3}+2x+1\) \\ \hline \end{tabular} \end{table} Table 7. Ternary LCD FC codes. Proof.: We will denote the \(2\times 4\) matrices that generate the constituents of \(C\) by \(G_{C_{i}},G_{C^{\prime}_{j}},G_{C^{\prime\prime}_{j}}\). Likewise, we denote the corresponding matrices for \(D\) by \(G_{D_{i}},G_{D^{\prime}_{j}},G_{D^{\prime\prime}_{j}}\). The forms of these matrices are clear from the previous analysis and will also be evident in what follows. By (7), \((C,D)\) is LCP of codes if and only if the following matrices are of full rank for all \(i,j\): \[\begin{pmatrix}1&0&a_{1}(\xi^{u_{i}})&a_{2}(\xi^{u_{i}})\\ 0&1&-a_{2}(\xi^{-u_{i}})&a_{1}(\xi^{-u_{i}})\\ 1&0&b_{1}(\xi^{u_{i}})&b_{2}(\xi^{u_{i}})\\ 0&1&-b_{2}(\xi^{-u_{i}})&b_{1}(\xi^{-u_{i}})\end{pmatrix}\begin{pmatrix}1&0&a_ {1}(\xi^{v_{j}})&a_{2}(\xi^{v_{j}})\\ 0&1&-a_{2}(\xi^{-v_{j}})&a_{1}(\xi^{-v_{j}})\\ 1&0&b_{1}(\xi^{v_{j}})&b_{2}(\xi^{v_{j}})\\ 0&1&-b_{2}(\xi^{-v_{j}})&b_{1}(\xi^{-v_{j}})\end{pmatrix}\begin{pmatrix}1&0&a_ {1}(\xi^{-v_{j}})&a_{2}(\xi^{-v_{j}})\\ 0&1&-a_{2}(\xi^{-v_{j}})&a_{1}(\xi^{-v_{j}})\\ 1&0&b_{1}(\xi^{v_{j}})&b_{2}(\xi^{v_{j}})\\ 0&1&-b_{2}(\xi^{-v_{j}})&b_{1}(\xi^{-v_{j}})\end{pmatrix}\] By elementary row operations, the first matrix turns into \[\begin{pmatrix}1&0&a_{1}(\xi^{u_{i}})&a_{2}(\xi^{u_{i}})\\ 0&1&-a_{2}(\xi^{-u_{i}})&a_{1}(\xi^{-u_{i}})\\ 0&0&b_{1}(\xi^{u_{i}})-a_{1}(\xi^{u_{i}})&b_{2}(\xi^{u_{i}})-a_{2}(\xi^{u_{i} })\\ 0&0&-b_{2}(\xi^{-u_{i}})+a_{2}(\xi^{-u_{i}})&b_{1}(\xi^{-u_{i}})-a_{1}(\xi^{-u_ {i}})\end{pmatrix},\] which is of rank \(4\) if and only if the \(2\times 2\) minor in the lower right corner is nonzero. This is equivalent to demanding that the irreducible factor \(g_{i}(x)\) of \(x^{m}-1\) does not divide the polynomial \[[(a_{1}(x)-b_{1}(x))(a_{1}(x^{m-1})-b_{1}(x^{m-1})]+[(a_{2}(x)-b_{2}(x))(a_{2 }(x^{m-1})-b_{2}(x^{m-1})].\] The same analysis applied to the second and third matrices yield analogous consequences for the irreducible factors \(h_{j}(x)\) and \(h_{j}^{*}(x)\) of \(x^{m}-1\). Hence the result follows. Table 8 presents ternary LCP of FC codes with good security parameters. Here, \(d\) represents the best security parameter via exhaustive search for the corresponding \(m\) value and \(d^{*}\) is the best minimum distance for a \([4m,2m]\) ternary linear code. ## Acknowledgment T. Kalayci is supported by TUBITAK Project under Grant 120F309. \begin{table} \begin{tabular}{||c c c c c||} \hline \(m\) & \(d\) & \(d^{*}\) & \(a_{1}(x)\) & \(a_{2}(x)\) \\ \hline \hline 4 & 6 & 6 & \(2x^{3}+2x^{2}+x\) & \(x^{2}+1\) \\ 5 & 7 & 7 & \(x^{2}+2x+1\) & \(2x^{3}+x+1\) \\ 7 & 9 & 9 & \(x^{3}+2x^{2}+1\) & \(2x^{5}+2x^{3}+2x^{2}+x+1\) \\ 8 & 9 & 10 & \(x^{3}+x^{2}+x+2\) & \(x^{4}+x^{2}+2x+1\) \\ \hline \end{tabular} \end{table} Table 8. Ternary LCP of FC codes.

2310.09864

Vavilov-Cherenkov emission with a twist: a study of the final entangled state

We present a theoretical investigation of the Vavilov-Cherenkov (VC) radiation by a plane-wave or twisted electron. Special emphasis is put on the question whether and at what conditions the emitted VC photons can be twisted. For this aim we obtain a general expression in the coordinate and momentum representations for the quantum state of the final electron-photon system that is a result of the radiation process itself and does not depend on the properties of a detector. It is shown that this evolved state is an entangled state of an electron and a photon, and both particles can be twisted. A direct consequence of this result follows: if one uses a detector sensitive to the twisted electron (photon) with the definite projection of the total angular momentum (TAM), then the final photon (electron) also will be in the twisted state with a definite TAM projection. Further, we investigate the polarization properties of the final twisted photon in more general conditions than has been calculated before. Finally, we exploit a close similarity between the discussed VC radiation and the process of the equivalent photon emission in the Weizs\"acker-Williams method and find the corresponding final state.

A. D. Chaikovskaia, D. V. Karlovets, V. G. Serbo

2023-10-15T15:42:35Z

http://arxiv.org/abs/2310.09864v2

# Vavilov-Cherenkov emission with a twist: ###### Abstract The Vavilov-Cherenkov radiation by a plane-wave electron or a twisted electron is considered within quantum electrodynamics. A twisted electron has a definite projection of the total angular momentum (TAM) \(m=\pm 1/2\), \(\pm 3/2\),...on the direction of motion. An exact analytical expression in the coordinate and momentum representations is found for the _evolved wave function_ of the final bipartite system, which has arisen as a result of the radiation process itself and does not depend on the properties of a detector. It is shown that this evolved wave function is an entangled state of an electron and a photon, and both particles can be twisted. It provides an interesting possibility: if we use a detector sensitive to the twisted electron with the definite TAM projection, then the final photon also is automatically projected onto the twisted state. Approximations of soft photons as well as of ultra-relativistic electrons are considered. Besides, we point out a close similarity between the discussed problem and the problem of the evolved wave function for the emission of the virtual photons in the deep inelastic \(ep\)-scattering as well as for the emission of the equivalent photons in the Weizsacker-Williams method. ## I Introduction The Vavilov-Cherenkov (VC) radiation was discovered in 1934 [1] and very soon explained by Frank and Tamm [2] in the framework of classical electrodynamics. A few years later, Ginzburg [3] and Sokolov [4] gave the quantum derivation of this phenomenon and found quantum corrections to the classical Frank-Tamm result. Historical and contemporary reviews on the subject can be found in [5; 6; 7]. A renewed motivation for the study of VC radiation within quantum electrodynamics (QED) is brought by recent theoretical and experimental advances with the so-called _twisted_ particles, i.e. those carrying nonzero orbital angular momentum (OAM). The reviews [10; 11; 12] give an ample discussion on the properties of twisted electrons and photons and their experimental status. A QED description of VC radiation emitted by a twisted electron in the transparent medium has recently been considered in [8; 9]. There, the analytical expressions have been obtained for the spectral and spectral-angular distributions as well as for the polarization properties of the emitted radiation. In any quantum process the detection scheme plays a crucial role in the measurement of the final quantum state characteristics. In the previous studies of VC radiation the most common method is to perform calculations for the final states being detected in the form of plane waves both for the electron and the photon as in Refs. [3; 4; 8; 9]. Another approach [13; 14], based on the so-called generalized measurements, focuses on the entanglement between a pair of the final particles and implies in practice the usage of a certain post-selection protocol for the final electron only when the momentum of the electron is measured with a large uncertainty. In this approach, the _evolved_ state of the emitted photon appears. In the present work we aim to give a complementary approach that allows one to perform a _quantum tomography_ of the scattered radiation without the need to introduce detector states. In particular, we develop an exact analytical expression for the final system wave function in the coordinate and momentum representations that is _irrespective of the detector properties_. We use the well-established \(S\)-matrix theory of the evolved state that provides the wave function of the outgoing photon as it results from the scattering process itself. The method was also used recently in Ref. [15] for the description of the resonance scattering of twisted laser photons on the ultra-relativistic partially striped ions in the project of the Gamma Factory at the Large Hadron Collider. As a part of motivation for this study a few words on the somewhat natural relation between twisted photons and VC radiation are in order. The VC radiation has a very specific angular distribution of final photons of energy \(\omega\): they are concentrated in a narrow cone near the polar angle \[\theta_{\gamma}\approx\arccos\left(\frac{1}{vn(\omega)}\right), \tag{1}\] where \(v\) is the velocity of the emitting electron moving along the \(z\)-axis. Just the same feature is possessed by the wave function of a twisted photon, for which an _opening (or conical) angle_ is equal to \[\theta_{\gamma}=\arccos\left(\frac{k_{z}}{|\mathbf{k}|}\right)=\arccos\left( \frac{1}{vn(\omega)}\right), \tag{2}\] meaning that it is determined by the magnitude of the longitudinal momentum of the photon \(k_{z}=\omega/v\) and its energy \(\omega=|\mathbf{k}|/n(\omega)\). Second, VC radiation is linearly polarized in the scattering plane. As we show below, our result for the case of the low energy photons reproduces this observation. The paper is organized as follows. We start with some general formalism: introducing the notion of the evolved wave function of the final system, the basic notations and the standard expression for the amplitude of the VC process in Section II. Then, in Section III we perform an analysis for the case of an ordinary plane-wave initial electron and derive the evolved wave function of the quantum system in the coordinate and momentum representations that corresponds to the entangled state of an emitted photon and an outgoing electron. It is remarkable that a symmetrical and relatively simple wave function could be obtained. In Section IV we generalize the calculation for the case of the initial twisted electron represented as a proper superposition of the plane waves comprising a Bessel wave state. We discuss the impact of the achieved result and its possible implications in Section V. In conclusion we also point out a close similarity between the discussed problem and the problem of the evolved wave functions for the emission of a virtual photon in the deep inelastic \(ep\)-scattering and for the emission an equivalent photon in the Weizsacker-Williams method (see Refs. [16] and [17]). Through the paper we use the relativistic system of units \(\hbar=1\), \(c=1\) and \(\alpha=e^{2}/(\hbar c)\approx 1/137\), where \(e\) is the electron charge. ## II General formalism ### Definition of evolved state Let us start with emission of a photon by a charged particle (for definiteness, an electron), \[e\to e^{\prime}+\gamma, \tag{3}\] in the lowest order of the perturbation theory in QED. It can generate either VC radiation or transition radiation in medium, synchrotron radiation, undulator radiation in a given electromagnetic field, and so on. A quantum state of the final system as it evolves from the reaction irrespectively of the measurement protocol can be called _pre-selected_ or _evolved_ because no measurements have been done yet. An initial state \(|\mathrm{in}\rangle\) of the electron and an evolved two-particle state of the final system of the electron and the photon are connected via an evolution operator \(\hat{S}\)[16] \[\hat{S}=\mathrm{T}\exp\left\{-ie\int d^{4}x\,\hat{j}_{\mu}\hat{A}^{\mu}\right\} \tag{4}\] as follows: \[|e^{\prime},\gamma\rangle^{\mathrm{(ev)}}=\hat{S}\,|\mathrm{in}\rangle=\sum_{ f}|f\rangle\langle f|\hat{S}|\mathrm{in}\rangle, \tag{5}\] where we have expanded the unitary operator over a complete set of two-particle states (with no virtual particles on the tree-level) \[\hat{1}=\sum_{f}|f\rangle\langle f|=\sum_{f_{e}}\sum_{f_{\gamma}}|f_{e},f_{ \gamma}\rangle\langle f_{e},f_{\gamma}|. \tag{6}\] In particular, this can be the plane-wave states with the definite four-momenta \(p^{\prime}=(E^{\prime},\mathbf{p}^{\prime}),\ k=(\omega,\mathbf{k})\) and the helicities \(\lambda^{\prime}=\pm 1/2,\lambda_{\gamma}=\pm 1\) for \(e^{\prime}\) and \(\gamma\), respectively, so that \[\hat{1}=\sum_{\lambda^{\prime}\lambda_{\gamma}}\int\frac{d^{3}p^{\prime}}{(2 \pi)^{3}}\frac{d^{3}k}{(2\pi)^{3}}|\mathbf{p}^{\prime}\lambda^{\prime}, \mathbf{k}\lambda_{\gamma}\rangle\langle\mathbf{p}^{\prime}\lambda^{\prime}, \mathbf{k}\lambda_{\gamma}|. \tag{7}\] In this case, the average \[S^{(1)}_{fi}=\langle f_{e},f_{\gamma}|\hat{S}|\mathrm{in}\rangle=\langle \mathbf{p}^{\prime}\lambda^{\prime},\mathbf{k}\lambda_{\gamma}|\hat{S}| \mathrm{in}\rangle \tag{8}\] is a customary first-order matrix element with two final plane-wave states whose polarization properties are described by bispinor \(u_{\mathbf{p}^{\prime}\lambda^{\prime}}\) and four-vector \(e_{\mathbf{k}\lambda_{\gamma}}=(0,\mathbf{e}_{\mathbf{k}\lambda_{\gamma}})\). Let us first assume that no final particle is detected and discuss how one can define "the wave function" of the entangled evolved state. The field operators in the Heisenberg representation of the photon are expanded into series of the creation and annihilation operators of the plane-wave states \[\hat{\mathbf{A}}(x)=\sum_{\lambda_{\gamma}=\pm 1}\int\frac{d^{3}k}{(2 \pi)^{3}}\left(\mathbf{A}_{\mathbf{k}\lambda_{\gamma}}(x)\,\hat{c}_{\mathbf{k }\lambda_{\gamma}}+\mathrm{h.c.}\right), \tag{9}\] \[\mathbf{A}_{\mathbf{k}\lambda_{\gamma}}(x)=\frac{\sqrt{4\pi}\, \mathbf{e}_{\mathbf{k}\lambda_{\gamma}}}{\sqrt{2\omega}\,n}\,e^{-ikx}, \tag{10}\] where \(x=(t,{\bf r})\) and \(n=n(\omega)\) is the refraction index of medium. Analogously, for the electron we have \[\hat{\psi}(x)=\sum_{\lambda^{\prime}=\pm 1/2}\int\frac{d^{3}p^{ \prime}}{(2\pi)^{3}}\psi_{{\bf p}^{\prime}\lambda^{\prime}}(x)\hat{a}_{{\bf p}^ {\prime}\lambda^{\prime}}, \tag{11}\] \[\psi_{{\bf p}^{\prime}\lambda^{\prime}}(x)=\frac{u_{{\bf p}^{ \prime}\lambda^{\prime}}}{\sqrt{2E^{\prime}}}\,e^{-ip^{\prime}x}, \tag{12}\] where we have omitted the positron part. Now, following the standard interpretation [16], the two-particle evolved state in four-dimensional space-time looks as follows (recall Eq. (5)): \[\langle 0|\hat{\psi}(x_{e})\hat{\bf A}(x_{\gamma})|e^{\prime}, \gamma\rangle^{({\rm ev})} \tag{13}\] \[=\int\frac{d^{3}p^{\prime}}{(2\pi)^{3}}\frac{d^{3}k}{(2\pi)^{3}} \,\sum_{\lambda^{\prime}\lambda_{\gamma}}\frac{u_{{\bf p}^{\prime}\lambda^{ \prime}}}{\sqrt{2E^{\prime}}}\,e^{-ip^{\prime}x_{e}}\] \[\times\frac{\sqrt{4\pi}\,{\bf e}_{{\bf k}\lambda_{\gamma}}}{ \sqrt{2\omega}n}\,e^{-ikx_{\gamma}}S_{fi}^{(1)},\] with \(S_{fi}^{(1)}\) constructed following the Feynman rules, see Eq. (16) further. So the combination \[\sum_{\lambda^{\prime}\lambda_{\gamma}}u_{{\bf p}^{\prime}\lambda^{\prime}}\, {\bf e}_{{\bf k}\lambda_{\gamma}}\,S_{fi}^{(1)} \tag{14}\] can be called the wave function of the two-particle evolved state in the momentum representation. Clearly, it bears both the spinor and vectorial indices. Importantly, the space-time amplitude of the two-particle evolved state (13) is a functional of the customary plane-wave matrix element \(S_{fi}^{(1)}\). The case when _only one_ of the final particles is detected is considered in Refs. [13; 14]. ### Matrix element of the process We proceed with details of the VC radiation by an electron of mass \(m_{e}\) in a transparent nonmagnetic homogeneous medium with the refraction index \(n=n(\omega)\) within the lowest order of QED. This process looks like a decay of an electron (see Fig. 1) \[e(p,\lambda)\to e(p^{\prime},\lambda^{\prime})+\gamma(k,\lambda_{ \gamma}). \tag{15}\] where for definiteness we have indicated momenta and helicities of the particles. In the plane-wave amplitude below, the initial state is described by an electron plane wave \(u_{{\bf p}\lambda}\,e^{-ipx}\) with momentum \({\bf p}\), energy \(E=\sqrt{{\bf p}^{2}+m_{e}^{2}}\), and helicity \(\lambda=\pm 1/2\). The final state is described by a plane wave \(u_{{\bf p}^{\prime}\lambda^{\prime}}\,e^{-ip^{\prime}x}\) and a photon plane wave \({\bf e}_{{\bf k}\lambda_{\gamma}}\,e^{-ikx}\), where the photon frequency is \(\omega=|{\bf k}|/n\) and the helicity is \(\lambda_{\gamma}=\pm 1\). However, we bear in mind that we intend to use the amplitude calculated here for the process in which initial electron is not exclusively described by a plane wave, and its movement is not necessarily a propagation along a specific axis. Thus, in what follows we keep the spherical angles \(\theta,\,\varphi\) and \(\theta^{\prime},\,\varphi^{\prime}\) of the initial and final electrons and the spherical angles \(\theta_{\gamma},\,\varphi_{\gamma}\) of the final photon. An apparent dependance of the spinors \(u\equiv u_{{\bf p}\lambda}\) and \(u^{\prime}\equiv u_{{\bf p}^{\prime}\lambda^{\prime}}\) as well as the polarization vector \({\bf e}\equiv{\bf e}_{{\bf k}\lambda_{\gamma}}\) on the corresponding spherical angles can be given in terms of an expansion over the eigenstates of the spin operator \(\hat{s}_{z}\), \(\hat{s}^{\prime}_{z}\) and \(\hat{s}^{\prime}_{z}\). See the particularities in Appendix A. That representation is convenient when we discuss both the plane wave and twisted states. In the process discussed, the plane-wave matrix element reads \[S_{fi}^{(1)}=i(2\pi)^{4}\,N\,\delta(p^{\prime}+k-p)\,M_{fi},\] \[M_{fi}=M_{fi}(p,p^{\prime},k)=\sqrt{4\pi\alpha}\,\,\bar{u}^{ \prime}\,\gamma_{\mu}u\,(e^{\mu})^{*}, \tag{16}\] where the normalization factor is \(N=\sqrt{4\pi/(2E2E^{\prime}2\omega n^{2})}\) (here we set the factor representing the phase space volume to be equal to unity for brevity). We express the standard amplitude \(M_{fi}\) using Eq. (10) from Ref. [9]): \[M_{fi}=\sum_{\sigma=\pm 1/2}\,\sum_{\sigma,\gamma=\pm 1,\,0}e^{i \sigma(\varphi^{\prime}-\varphi)-i\sigma_{\gamma}(\varphi^{\prime}-\varphi_{ \gamma})} \tag{17}\] \[\times M_{\sigma\sigma_{\gamma}}^{\lambda\lambda^{\prime}\lambda_{ \gamma}}(E,\omega,\theta,\theta^{\prime},\theta_{\gamma}),\] where the dependence on the azimuthal angles \(\varphi,\varphi^{\prime},\varphi_{\gamma}\) is factorized and the coefficients \[M_{\sigma\sigma_{\gamma}}^{\lambda\lambda^{\prime}\lambda_{ \gamma}} = -\sqrt{4\pi\alpha}\,2\sigma\,(2\lambda\,E_{\lambda\lambda^{\prime}} \,d_{\sigma\lambda}^{(1/2)}(\theta)\] \[\times d_{\sigma-\sigma_{\gamma},\lambda^{\prime}}^{(1/2)}(\theta^{ \prime})\,d_{\sigma_{\gamma},\,\lambda_{\gamma}}^{(1)}(\theta_{\gamma})\,\left( \delta_{0,\,\sigma_{\gamma}}-\sqrt{2}\,\delta_{2\sigma,\sigma_{\gamma}}\right)\] do not depend on these angles. Here \[E_{\lambda\lambda^{\prime}} = \sqrt{(E-m_{e})(E^{\prime}+m_{e})}\] \[+ 2\lambda 2\lambda^{\prime}\sqrt{(E^{\prime}-m_{e})(E+m_{e})}\] and \(d_{MM^{\prime}}^{\ (J)}(\theta)\) are the small Wigner matrices [18]: \[d_{\sigma\lambda}^{(1/2)}(\theta) = \delta_{\sigma\lambda}\cos(\theta/2)-2\sigma\delta_{\sigma,-\lambda }\sin(\theta/2), \tag{20}\] \[d_{0,\lambda}^{(1)}(\theta_{\gamma}) = \frac{\lambda_{\gamma}}{\sqrt{2}}\,\sin\theta_{\gamma},\,\,\,d_{2 \sigma,\,\lambda_{\gamma}}^{(1)}(\theta_{\gamma})=\frac{1}{2}\,\left(1+2\sigma \lambda_{\gamma}\cos\theta_{\gamma}\right).\] It is useful to point out the following feature of the discussed process: the angle \(\theta_{kp}\) between vectors \({\bf k}\) and \({\bf p}\) is completely determined by the energies of the photon and the initial electron. Indeed, if we rewrite the equality \(E^{\prime}=E-\omega\) in the form \[(E^{\prime})^{2}={\bf p}^{2}+{\bf k}^{2}-2|{\bf p}||{\bf k}|\cos\theta_{kp}+m_{e} ^{2}=(E-\omega)^{2}, \tag{21}\] we get (cf. (1)) \[\cos\theta_{kp}=\frac{1}{vn}+\frac{\omega}{2E}\,\frac{n^{2}-1}{vn}. \tag{22}\] ## III Plane-wave initial electron ### Evolved state Let us suppose that the incoming electron has a definite momentum, directed along the \(z\)-axis, so that \(\theta=\varphi=0\), \(p=(E,0,0,|{\bf p}|)\) as depicted in the left panel of Fig. 2. Therefore, we immediately obtain from (22) the important equality \[\theta_{\gamma}=\theta_{kp}=\theta_{0}, \tag{23}\] which means that the VC radiation with a defined energy \(\omega\) is concentrated on the cone with the opening angle \(\theta_{0}\). In that case we deal with an electron that can be described standardly as a plane wave with \(\hat{j}_{z}=\hat{s}_{z}\) (see Appendix A). For the matrix element, this results in the reduction \(d_{\sigma\lambda}^{(1/2)}(\theta=0)=\delta_{\sigma\lambda}\) and, hence, we can lift both sums in Eq. (17) \[M_{fi}=M_{\lambda,0}^{\lambda\lambda^{\prime}\lambda\gamma}\,e^{i\lambda \varphi^{\prime}}+M_{\lambda,2\lambda}^{\lambda\lambda^{\prime}\lambda\gamma}\, e^{-i\lambda\varphi^{\prime}+i2\lambda\varphi\gamma}, \tag{24}\] where the new factorized amplitudes are \[M_{\lambda,0}^{\lambda\lambda^{\prime}\lambda\gamma} =-\sqrt{4\pi\alpha}E_{\lambda\lambda^{\prime}}\,d_{\lambda, \lambda^{\prime}}^{(1/2)}(\theta^{\prime})\,d_{0,\,\lambda_{\gamma}}^{(1)}( \theta_{\gamma}),\] \[M_{\lambda,2\lambda}^{\lambda\lambda^{\prime}\lambda\gamma} =+\sqrt{8\pi\alpha}E_{\lambda\lambda^{\prime}}\,d_{-\lambda, \lambda^{\prime}}^{(1/2)}(\theta^{\prime})\,d_{2\lambda,\,\lambda_{\gamma}}^{( 1)}(\theta_{\gamma}).\] The evolved state in the space-time representation, given by Eq. (13), defines the probability amplitude to detect the photon in a region of space-time centered in the point \(x_{\gamma}=(t_{\gamma},\mathbf{r}_{\gamma})\) while the electron is jointly detected in a region centered in the point \(x_{e}=(t_{e},\mathbf{r}_{e})\) (both the points may or may not coincide). First, we integrate over the three-momentum of the final electron and then integrate over the polar angle of the photon \(\theta_{\gamma}\) rendering it to the value defined by Eq. (22). This leads to the replacement \[d\Gamma= (2\pi)^{4}\delta(p^{\prime}+k-p)\,\frac{d^{3}p^{\prime}}{(2\pi)^ {3}}\frac{d^{3}k}{(2\pi)^{3}}\] \[\rightarrow \frac{(E-\omega)\omega n(\omega)}{vE}\,\frac{d(\omega n(\omega) )}{2\pi}\,\frac{d\varphi_{\gamma}}{2\pi}.\] When the dispersion is weak, \(|\frac{\omega}{n}\frac{dn}{d\omega}|\ll 1\), we can have \(d(\omega n(\omega))\approx n(\omega)d\omega\) and this approximation is used in some formulas below. The evolved state looks as follows: \[\Psi^{(pw)}_{{\bf p}\lambda}(x_{e},x_{\gamma}) \equiv \langle 0|\hat{\psi}(x_{e})\hat{\bf A}(x_{\gamma})|e^{\prime}, \gamma\rangle^{({\rm ev})}\] \[= \frac{i}{v(2E)^{3/2}}\int\frac{d(\omega n)}{n}\,e^{-i\omega t_{ \gamma}-i(E-\omega)t_{e}}\] \[\times \sum_{\lambda^{\prime}\lambda_{\gamma}}\int\frac{d\varphi_{\gamma }}{2\pi}\,u_{{\bf p}^{\prime}\lambda^{\prime}}\,e^{i({\bf p}-{\bf k})\cdot \mathbf{r}_{e}}\,\mathbf{e}_{{\bf k}\lambda,\gamma}\,e^{i{\bf k}\cdot\mathbf{r}_{\gamma}}M _{fi}.\] Here we have used the following four-vectors \[p^{\prime}=(E^{\prime},{\bf p}^{\prime})=(E-\omega,{\bf p}-{\bf k }), \tag{27}\] \[k=(\omega,k_{\perp}\cos\varphi_{\gamma},k_{\perp}\sin\varphi_{ \gamma},\omega n\cos\theta_{kp}),\] where \(k_{\perp}=\omega n\sin\theta_{kp}\) and \(\theta_{kp}=\theta_{kp}(E,\omega)\) is defined by Eq. (22). Moreover, in the used reference frame we have \({\bf p}^{\prime}_{\perp}=-{\bf k}_{\perp}\) and, therefore, only two points give contribution to the integral over \(\varphi_{\gamma}\): \[\varphi^{\prime}=\varphi_{\gamma}+\pi\,\,\,{\rm when}\,\,\,\varphi _{\gamma}\subset(0;\pi) \tag{28}\] \[{\rm or} \varphi^{\prime}=\varphi_{\gamma}-\pi\,\,\,{\rm when}\,\,\,\varphi _{\gamma}\subset(\pi;2\pi),\] the first option is presented in the right panel of Fig. 2, and the second is easy to imagine with \({\bf p}^{\prime}\) and \({\bf k}\) swapping places (\(\varphi_{\gamma}\) becoming greater than \(180^{\circ}\) with \(\varphi^{\prime}\) remaining in \((0;2\pi)\) domain). Therefore \[M_{fi}|_{{\bf p}^{\prime}_{\perp}=-{\bf k}_{\perp}}=e^{i\lambda(\varphi_{ \gamma}\pm\pi)}\left(M_{\lambda,0}^{\lambda\lambda^{\prime}\lambda_{\gamma}}-M _{\lambda,2\lambda}^{\lambda\lambda^{\prime}\lambda_{\gamma}}\right). \tag{29}\] Figure 2: The geometry of the VC process with the initial electron moving along the \(z\)-direction. Now, let us expand the momentum states of the final particles in Eq. (26) over the complete sets of the _twisted states_[11]: \[u_{{\bf p}^{\prime}\lambda^{\prime}}\,e^{-ip^{\prime}x_{e}}=\sum_{m ^{\prime}=-\infty}^{+\infty}i^{m^{\prime}}\,e^{-im^{\prime}\varphi^{\prime}}\psi _{p^{\prime}_{\perp}p^{\prime}_{z}m^{\prime}\lambda^{\prime}}(x_{e}), \tag{30}\] \[{\mathbf{e}}_{{\bf k}\lambda_{\gamma}}\,e^{-ikx_{\gamma}}=\sum_{m_{ \gamma}=-\infty}^{+\infty}i^{m_{\gamma}}\,e^{-im_{\gamma}\varphi_{\gamma}}{\bm {A}}_{k_{\perp}k_{z}m_{\gamma}\lambda_{\gamma}}(x_{\gamma}), \tag{31}\] where \(m^{\prime}\) is a half-integer, \(m_{\gamma}\) is an integer, and the functions \({\bf A}_{k_{\perp}k_{\sigma}m_{\gamma}\lambda_{\gamma}}(x_{\gamma})\) and \(\psi_{p^{\prime}_{\perp}p^{\prime}_{z}m^{\prime}\lambda^{\prime}}(x_{e})\) are defined in Appendix A. After this, the azimuthal integral in Eq. (26) yields \(\delta_{\lambda,m^{\prime}+m_{\gamma}}\) revealing the conservation of the angular momentum projection. The final result can be presented in the following way: \[\Psi^{(\rm pw)}_{{\bf p}\lambda}(x_{e},x_{\gamma})=\frac{i^{ \lambda+1}}{v(2E)^{3/2}}\sum_{\lambda^{\prime}\lambda_{\gamma}}\sum_{m^{\prime },m_{\gamma}=-\infty}^{+\infty}\int\frac{d(\omega n)}{n}\] \[(-1)^{m_{\gamma}}\left(M_{\lambda,0}^{\lambda\lambda^{\prime} \lambda_{\gamma}}-M_{\lambda,2\lambda}^{\lambda\lambda^{\prime}\lambda_{\gamma }}\right)\,\delta_{\lambda,m^{\prime}+m_{\gamma}}\] \[\times{\mathbf{A}}_{k_{\perp}k_{z}m_{\gamma}\lambda_{\gamma}}(x_{ \gamma})\,\psi_{p^{\prime}_{\perp}p^{\prime}_{z}m^{\prime}\lambda^{\prime}}(x_ {e}) \tag{32}\] where \(E^{\prime}=E-\omega\), \(p^{\prime}_{\perp}=k_{\perp}=\omega n\sin\theta_{kp},\,p^{\prime}_{z}=p-k_{z}\).The integration is performed over the region defined by the energy conservation law \(0<\omega<E-m_{e}\) and the condition \(0<\cos\theta_{kp}<1\). Let us take a closer look at Eq. (32): it contains the function \({\bf A}_{k_{\perp}k_{z}m_{\gamma}\lambda}(x_{\gamma})\), which describes a twisted photon with the corresponding total angular momentum (TAM) \(\hat{j}_{z}^{\gamma}\) equal to \(m_{\gamma}\) and certain values of \(k_{\perp}\), \(k_{z}\) and \(\lambda_{\gamma}\); there is also the function \(\psi_{p^{\prime}_{\perp}p^{\prime}_{z},\lambda-m_{\gamma},\lambda^{\prime}}(x _{e})\), which describes a twisted electron with \(\hat{j}_{z}^{\prime}\) equal \(\lambda-m_{\gamma}\), and certain values of \(p^{\prime}_{\perp}\), \(p^{\prime}_{z}\) and \(\lambda^{\prime}\). Therefore, the evolved wave function of the final system (32) as a whole describes an _entangled state_ of a twisted electron and twisted photon. If we define the TAM operator of the evolved state as a sum of TAM operators, \(\hat{J}_{z}=\hat{j}_{z}^{\prime}+\hat{j}_{z}^{\gamma}\), the function \(\Psi^{(\rm pw)}_{{\bf p}\lambda}(x_{e},x_{\gamma})\) is the eigenstate of \(\hat{J}_{z}\) with the eigenvalue \(\lambda\). This result is in accordance with the TAM conservation law \(\hat{j}_{z}^{\prime}+\hat{j}_{z}^{\gamma}=\hat{j}_{z}\), since the initial state in the considered case is an eigenfunction of the TAM operator \(\hat{j}_{z}=\hat{s}_{z}\) having the eigenvalue \(\lambda\). Alternatively, we can obtain the evolved wave function in the momentum representation in the form \[\Phi^{(\rm pw)}_{{\bf p}\lambda}({\bf p}^{\prime},{\bf k}) = \sum_{\lambda^{\prime}\lambda_{\gamma}}u_{{\bf p}^{\prime} \lambda^{\prime}}\,{\bf e}_{{\bf k}\lambda_{\gamma}}\,S^{(1)}_{fi}\] \[= i(2\pi)^{4}\delta(p^{\prime}+k-p)Ne^{i\lambda(\varphi_{\gamma} \pm\pi)}\] \[\sum_{\lambda^{\prime}\lambda_{\gamma}}u_{{\bf p}^{\prime}\lambda^ {\prime}}\,{\bf e}_{{\bf k}\lambda_{\gamma}}\,\left(M_{\lambda,0}^{\lambda \lambda^{\prime}\lambda_{\gamma}}-M_{\lambda,2\lambda}^{\lambda\lambda^{\prime} \lambda_{\gamma}}\right).\] The explicit expression for this helicity sum is given separately in Appendix B. Certainly, the evolved wavefunction (33) also is the eigenfunction of \(\hat{J}_{z}\) with the same eigenvalue \(\lambda\). ### Soft photon approximation In the commonly used detectors of the Cherenkov radiation the photon energy \(\omega\) is about several eV and the conditions \(\omega\ll m_{e}\) and \(\omega\ll E-m_{e}\) are satisfied. In this _soft photon approximation_ several simplifications to the calculation of the evolved wave function can be made. As \(E^{\prime}\approx E\), we get \(\delta_{\lambda^{\prime}\lambda}\) from Eq. (18). Eventually, with \({\bf p}^{\prime}\approx{\bf p}\) and \(\theta^{\prime}\) set to zero, only one term remains from the Wigner function multiplication and the expression for the scattering amplitude is \[M_{fi}=-\lambda_{\gamma}\sqrt{8\pi\alpha}\,e^{i\lambda(\varphi_{\gamma}\pm\pi)} \,vE\sin\theta_{0}\delta_{\lambda^{\prime}\lambda}, \tag{34}\] where \[\sin\theta_{0}=\frac{k_{\perp}}{|{\bf k}|}=\sqrt{1-\frac{1}{v^{2}n^{2}}}. \tag{35}\] The summation over \(\lambda^{\prime}\) and \(\lambda_{\gamma}\) in (33) is performed as detailed in Appendix B, and the resulting evolved wave function is greatly simplified when written in terms of the longitudinal photon polarization \({\bf e}_{\parallel}\) (see Eq. (111) in Appendix A) \[\Phi^{(\rm pw)}_{{\bf p}\lambda}({\bf p}^{\prime},\,{\bf k}) = i4\sqrt{\pi\alpha}(2\pi)^{4}\delta(p^{\prime}+k-p)\] \[\times NvE\,\sin\theta_{0}\,u_{{\bf p}^{\prime}\lambda}\,{\bf e}_{ \parallel}\,e^{i\lambda(\varphi_{\gamma}\pm\pi)}\] in the momentum representation and \[\Psi^{(\rm pw)}_{{\bf p}\lambda}(x_{e},x_{\gamma}) = i\,\sqrt{\frac{2\pi\alpha}{E}}\,u_{{\bf p}\lambda}\,e^{-ipx_{e}}\] \[\times\int\sin\theta_{0}\,{\bf A}_{k_{\perp},k_{z},0,\parallel}(x _{\gamma})\,d\omega\] in the coordinate representation, where the photon wave function with the longitudinal polarization is given in Eq. (104) and the region of integration over \(\omega\) is determined by the condition \(vn(\omega)>1\). The obtained result corresponds to the linear polarization in the plane of the vectors \({\bf p}\) and \({\bf k}\). This fact is well known from the first experiments of Cherenkov. This result also shows that the value \(m_{\gamma}=0\) is consistent with the conservation law for the \(z\)-projection of the system TAM, \(\lambda=\lambda^{\prime}+m_{\gamma}\), since in the approximations used, the helicity state and momentum of the final electron almost coincide with those of the initial electron, i. e. \(\lambda^{\prime}=\lambda,\,\,\,p^{\prime}=p\). ### Approximation of ultra-relativistic electrons The amplitude of the process could also be considered in the _approximation of ultra-relativistic electrons_, implying that \(E\gg m_{e}\) and \(E^{\prime}\gg m_{e}\): \[M_{\sigma\sigma\sigma_{\gamma}}^{\lambda\lambda^{\prime}\lambda_{ \gamma}} = -\sqrt{4\pi\alpha}\,8\sigma\lambda\delta_{\lambda\lambda^{\prime}} \sqrt{EE^{\prime}}\,d_{\sigma}^{(1/2)}(\theta)\] \[d_{\sigma-\sigma_{\gamma},\lambda}^{(1/2)}(\theta^{\prime})\,d_{ \sigma_{\gamma},\lambda}^{(1)}(\theta_{\gamma})\,\left(\delta_{0,\sigma_{ \gamma}}-\sqrt{2}\,\delta_{2\sigma,\sigma_{\gamma}}\right).\] In this limit, helicities of electrons are conserved and summation over \(\lambda^{\prime}\) becomes trivial due to the appearance of \(\delta_{\lambda\lambda^{\prime}}\). Indeed, using relations (29), we obtain \[M_{fi} = -\sqrt{8\pi\alpha EE^{\prime}}\,\delta_{\lambda\lambda^{\prime}}\,e^ {i\lambda(\varphi_{\gamma}\pm\pi)}\] \[\left[\lambda_{\gamma}\sin(\theta_{\gamma}-\tfrac{1}{2}\,\theta^ {\prime})-2\lambda\sin(\tfrac{1}{2}\,\theta^{\prime})\right].\] Substituting this expression into (33) and performing summation over \(\lambda_{\gamma}\) with the help of (111), we obtain the result in terms of the twisted photon states with the linear polarization for the evolved wave function in the momentum representation (see Appendix B)) \[\Phi^{(\text{pw})}_{\mathbf{p}\lambda}(\mathbf{p}^{\prime},\mathbf{ k}) = -4i\,(2\pi)^{4}\delta(p^{\prime}+k-p)\] \[\times N\,\sqrt{\pi\alpha EE^{\prime}}u_{\mathbf{p}^{\prime}\lambda}e^{ i\lambda(\varphi_{\gamma}\pm\pi)}\] \[\times \left[\mathbf{e}_{\parallel}\,\sin(\theta_{\gamma}-\tfrac{1}{2}\, \theta^{\prime})-i\,2\lambda\,\mathbf{e}_{\perp}\,\sin(\tfrac{1}{2}\,\theta ^{\prime})\right]\] and in the coordinate representation \[\Psi^{(\text{pw})}_{\mathbf{p}\lambda}(x_{e},x_{\gamma})=\frac{i^{ \lambda+1}}{v}\sqrt{\frac{2\pi\alpha}{E}}\sum_{m_{\gamma}}\int d\omega\sqrt{1- \omega/E}\,(-1)^{m_{\gamma}}\] \[\times\psi_{p^{\prime}_{\perp},p^{\prime}_{\perp},\lambda-m_{ \gamma},\lambda}(x_{e})\bigg{[}\mathbf{A}_{k_{\perp}k_{z}m_{\gamma},\parallel} (x_{\gamma})\sin(\theta_{\gamma}-\tfrac{1}{2}\theta^{\prime})\] \[-i\,2\lambda\mathbf{A}_{k_{\perp}k_{z}m_{\gamma},\perp}(x_{\gamma}) \sin(\tfrac{1}{2}\theta^{\prime})\bigg{]}\,. \tag{41}\] It is seen from this expression that the linear polarization in the plane of the vectors \(\mathbf{p}\) and \(\mathbf{k}\) is dominating in the region where \(\theta^{\prime}\ll\theta_{\gamma}\). Moreover, this expression coincides with the aforementioned soft photons regime when \(\omega\ll E\) is set. ## IV Twisted initial electron If the initial electron is in _the twisted state_, then its plane-wave function \(u\,e^{-ipx}\) is replaced by a superposition of the plane waves \[u_{\mathbf{p}\lambda}\,e^{-ipx}\rightarrow\int\frac{d\varphi}{2\pi}\,i^{-m} \,e^{im\varphi}\,u_{\mathbf{p}\lambda}\,e^{-ipx}. \tag{42}\] This is the stationary state (_the Bessel wave_) corresponding to a twisted electron with the longitudinal momentum \(p_{z}\), the absolute value of transverse momentum \(p_{\perp}\), the energy \(E=\sqrt{p_{\perp}^{2}+p_{z}^{2}+m_{e}^{2}}\), the projection of an electron TAM onto the \(z\)-axis equal to a half-integer number \(m\) and the helicity \(\lambda=\pm 1/2\). In this case, the evolved wave function of the final state has the form \[\Phi^{(\text{tw})}_{p_{\perp}p_{\perp}m\lambda}(\mathbf{p}^{\prime},\mathbf{ k}) = \int\frac{d\varphi}{2\pi}\,i^{-m}\,e^{im\varphi}\,\Phi^{(\text{pw})} _{\mathbf{p}\lambda}(\mathbf{p}^{\prime},\mathbf{k}) \tag{43}\] in the momentum representation and the similar expression in the coordinate representation. Note, that the function \(\Phi^{(\text{pw})}_{\mathbf{p}\lambda}(\mathbf{p}^{\prime},\mathbf{k})\) in the wave function of Eq. (43) depends now on \(M_{fi}\) in the form given by Eq. (17) and bears all three components of the vector \(\mathbf{p}=(p_{\perp}\cos\varphi,\,p_{\perp}\sin\varphi,\,p_{z})\) (as for example in Fig. 3), while we took the frame with \(z\)-directed \(\mathbf{p}=(0,\,0,\,|\mathbf{p}|)\) when deriving \(\Phi^{(\text{pw})}_{\mathbf{p}\lambda}(\mathbf{p}^{\prime},\mathbf{k})\) in Eq. (33). #### iv.0.1 Integration over the azimuth of initial particle To get the final state in either representation the integration over \(\varphi\) can be performed first. We must take into account that \(\cos\theta_{pk}\) generally depends on \(\varphi\) and also that the plane-wave integrand has some dependence on \(\varphi\) and \(\varphi^{\prime}\) - let us call it \(f(\varphi,\varphi^{\prime})\). The following integral arises \[I=\int_{0}^{2\pi}\frac{d\varphi}{2\pi}\delta\left(\cos\theta_{kp}-\cos\theta_{0 }\right)f(\varphi,\varphi^{\prime}), \tag{44}\] where \(\theta_{0}=\arccos\left[\frac{1}{vn}+\frac{\omega}{2E}\,\frac{n^{2}-1}{vn}\right]\) is the value determined by the conservation law (recall Eq. (22)). The integral is of the same type as the one studied in Ref. [9]. To calculate it we follow the same route with appropriate extension treating the appearance of \(\varphi^{\prime}\). It is straightforward to get the following equations for the angles between vectors \((\mathbf{k},\mathbf{p})\) or \((\mathbf{k},\mathbf{p}^{\prime})\) if the definitions \(\cos\theta_{kp}=\frac{\mathbf{k}\cdot\mathbf{p}}{|\mathbf{k}|}\frac{\mathbf{p }}{|\mathbf{p}|}\) and \(\cos\theta_{kp^{\prime}}=\frac{\mathbf{k}\cdot\mathbf{p}^{\prime}}{|\mathbf{k}| }\frac{\mathbf{p}^{\prime}}{|\mathbf{p}^{\prime}|}\) are written in spherical coordinates: \[\begin{split}&\cos\theta_{kp}=\cos\theta_{\gamma}\cos\theta+\sin \theta_{\gamma}\sin\theta\cos\delta,\\ &\cos\theta_{kp^{\prime}}=\cos\theta_{\gamma}\cos\theta^{\prime}+ \sin\theta_{\gamma}\sin\theta^{\prime}\cos\delta^{\prime},\\ &\delta=\pm(\varphi-\varphi_{\gamma}),\,\,\delta^{\prime}=\pm( \varphi^{\prime}-\varphi_{\gamma}).\end{split} \tag{45}\] Figure 3: The geometry in the process with initial twisted electron having non-zero \(p_{\perp}\). The lengths and directions of the vectors are illustrative but not exactly natural for the process. Further, since \(\cos\theta_{kp}\) is fixated by the delta function, \(\varphi\) could be expressed other way round with \(\delta\), while for \(\varphi^{\prime}\) there could be only one option as is evident from the geometrical construction akin to that on the right panel of Fig. 3. In the end, only two points give nonzero contribution to the integral (44): \(\varphi=\varphi_{\gamma}+\delta,\;\varphi^{\prime}=\varphi_{\gamma}+\delta^{\prime}\) and \(\varphi=\varphi_{\gamma}-\delta,\;\varphi^{\prime}=\varphi_{\gamma}-\delta^{ \prime}\) (see Fig. 3), where \[\delta = \arccos\left(\frac{\cos\theta_{0}-\cos\theta_{\gamma}\cos\theta} {\sin\theta_{\gamma}\sin\theta}\right), \tag{46}\] \[\delta^{\prime} = \arccos\left(\frac{\cos\theta_{kp^{\prime}}-\cos\theta_{\gamma} \cos\theta^{\prime}}{\sin\theta_{\gamma}\sin\theta^{\prime}}\right). \tag{47}\] The final expression is \[I=\frac{1}{2}\left[f(\varphi_{\gamma}+\delta,\varphi_{\gamma}+\delta^{\prime}) +f(\varphi_{\gamma}-\delta,\,\varphi_{\gamma}-\delta^{\prime})\right]F(\theta,\theta_{\gamma},\theta_{0}) \tag{48}\] where the function \(F(\theta,\theta_{\gamma},\theta_{0})\) reads \[F(\theta,\theta_{\gamma},\theta_{0})=\frac{1}{\pi\sin\theta_{ \gamma}\frac{1}{\sin\theta|\sin\delta|}} \tag{49}\] \[=\frac{1}{\pi}\;\left\{[\cos\theta_{\gamma}-\cos(\theta+\theta_{ 0})]\,[\cos(\theta-\theta_{0})-\cos\theta_{\gamma}]\right\}^{-1/2}\] #### iii.2.2 Momentum representation To calculate the evolved state of Eq. (43), we collect the azimuthal dependencies into \[f(\varphi,\varphi^{\prime})=i^{-m}e^{im\varphi-i\sigma^{\prime}\varphi^{ \prime}+i\sigma(\varphi^{\prime}-\varphi)-i\sigma_{\gamma}(\varphi^{\prime}- \varphi_{\gamma})}. \tag{50}\] and the resulting expression for (44) is \[I = i^{-m}e^{i(m-\sigma^{\prime})\varphi_{\gamma}}\] \[\times F(\theta,\theta_{\gamma},\theta_{0})\,\cos\left[(m-\sigma)\delta+ (\sigma-\sigma^{\prime}-\sigma_{\gamma})\delta^{\prime}\right],\] Then, the evolved wave function in the momentum representation is \[\Phi^{(\rm tw)}_{p_{\perp p_{\perp}}m\lambda}({\bf p}^{\prime},{ \bf k})=i^{1-m}(2\pi)^{4}\delta({\bf p}^{\prime}+{\bf k}-{\bf p})\] \[\times\frac{(E-\omega)N}{vE\omega n}F(\theta,\theta_{\gamma}, \theta_{0})\] \[\sum_{\lambda^{\prime}\lambda_{\gamma}}\sum_{\sigma\sigma^{\prime }\sigma_{\gamma}}e^{i(m-\sigma^{\prime})\varphi_{\gamma}}\,d^{(1/2)}_{\sigma^ {\prime}\lambda^{\prime}}(\theta^{\prime})M^{\lambda\lambda^{\prime}\lambda_{ \gamma}}_{\sigma\sigma_{\gamma}}(E,\omega,\theta,\theta^{\prime},\theta_{ \gamma})\] \[\times\cos\left[(m-\sigma)\delta+(\sigma-\sigma^{\prime}-\sigma_ {\gamma})\delta^{\prime}\right]{\bf e_{k}}_{\lambda\lambda}{U^{(\sigma^{ \prime})}}(E^{\prime},\lambda^{\prime}),\] where we give a full expression in terms of bispinors \(U^{(\sigma)}\) defined in Eq. (101) and \(M^{\lambda\lambda^{\prime}\lambda_{\gamma}}_{\sigma\sigma_{\gamma}}\) is the helicity amplitude from Eq. (18). #### iii.2.3 Two-particle wave function in coordinate representation Let us write down explicitly the definition of the evolved state in the coordinate representation with additional integration over \(\varphi\) signifying the vortex character of the incoming electron: \[\Psi^{(\rm tw)}_{p_{\perp p_{\perp}}m\lambda}(x_{e},x_{\gamma}) \equiv\langle 0|\hat{\psi}(x_{e})\hat{\bf A}(x_{\gamma})|e^{\prime},\gamma \rangle^{(\rm ev)}\] \[=\int\frac{d^{3}p^{\prime}}{(2\pi)^{3}}\frac{d^{3}k}{(2\pi)^{3}} \sum_{\lambda^{\prime}\lambda_{\gamma}}\frac{u_{{\bf p}^{\prime}\lambda^{ \prime}}}{\sqrt{2E^{\prime}}}\,e^{-ip^{\prime}x_{e}}\,\frac{\sqrt{4\pi}\,{\bf e _{k}}_{\lambda\gamma}}{\sqrt{2\omega n}}\,e^{-ikx_{\gamma}}\] \[\times\int\frac{d\varphi}{2\pi}i^{-m}e^{im\varphi}S^{(1)}_{fi}\] Using again the series expansions (30), (31) we collect all azimuthal exponents into \[f(\varphi,\varphi^{\prime})=i^{-m+m^{\prime}+m_{\gamma}}e^{im\varphi-im^{ \prime}\varphi^{\prime}-im_{\gamma}\varphi_{\gamma}+i\sigma(\varphi^{\prime}- \varphi)-i\sigma_{\gamma}(\varphi^{\prime}-\varphi_{\gamma})}. \tag{54}\] The integral (44) results in \[I = i^{-m+m^{\prime}+m_{\gamma}}e^{i(m-m^{\prime}-m_{\gamma})\varphi_ {\gamma}}\] \[\times \cos[(m-\sigma)\delta+(\sigma-m^{\prime}-\sigma_{\gamma})\delta^ {\prime}]F(\theta,\theta_{\gamma},\theta_{0}).\] The integration in the phase space could be performed with elimination of the \(d^{3}p^{\prime}\) integral, and we are left with \[d\Gamma\rightarrow\frac{(E-\omega)\omega n^{2}}{2\pi vE}\,\delta\left(\cos \theta_{kp}-\cos\theta_{0}\right)\frac{d(\omega n)}{n}\sin\theta_{\gamma}d \theta_{\gamma}\frac{d\varphi_{\gamma}}{2\pi} \tag{56}\] The dependence of the wave function on \(\varphi_{\gamma}\) is trivial and implies appearance of the Kronecker delta \(\delta_{m-m^{\prime}-m_{\gamma},0}\). Finally, the evolved wave-function can be expressed in two equivalent ways \[\Psi^{(\rm tw)}_{p_{\perp p_{\perp}}m\lambda}(x_{e},x_{\gamma})= \frac{i}{v(2E)^{3/2}}\,\sum_{m^{\prime}m_{\gamma}=-\infty}^{+\infty}\sum_{ \lambda^{\prime}\lambda^{\prime}}\sum_{\sigma\sigma_{\gamma}}\delta_{m,m^{ \prime}+m_{\gamma}}\] \[\int\frac{d(\omega n)}{n}d\theta_{\gamma}\sin\theta_{\gamma}\;\;F (\theta,\theta_{\gamma},\theta_{0})M^{\lambda\lambda^{\prime}\lambda_{\gamma}}_{ \sigma\sigma_{\gamma}}(E,\omega,\theta,\theta^{\prime},\theta_{\gamma})\] \[\qquad\qquad\qquad\qquad\times\mathbf{A}_{k_{\perp}k_{\perp}m_{\gamma} \lambda_{\gamma}}(x_{\gamma})\,\psi_{p^{\prime}_{\perp}p^{\prime}_{\perp}m^{ \prime}\lambda^{\prime}}(x_{e}) \tag{57}\] The further integration is performed over the region determined by the energy conservation law \(0<\omega<E-m_{e}\) and the condition (58) discussed below. It is seen from Eq. (III.2.3) as well as from (III.2.3) that the evolved wave function of the final system is an entangled state of two particles of different type - an electron and a photon, either of which can carry OAM. Note, also, that the evolved functions for the twisted initial electron has the same structure as the wave function (33) for the plane-wave initial electron except two important points: _(i)_\(\Phi^{(\rm pw)}_{{\bf p}\lambda}({\bf p}^{\prime},{\bf k})\) and \(\Psi^{(\rm pw)}_{{\bf p}\lambda}(x_{e},x_{\gamma})\) being the eigenfunctions of \(\hat{J}_{z}\) with the eigenvalue \(\lambda\) are replaced with \(\Phi^{(\rm tw)}_{p_{\perp}p_{\perp}m\lambda}({\bf p}^{\prime},{\bf k})\) and \(\Psi^{(\rm tw)}_{p_{\perp}p_{\perp}m\lambda}(x_{e},x_{\gamma})\), respectively, being the eigenfunctions of \(\hat{J}_{z}\) with the eigenvalue \(m\); _(ii)_ an additional function \(F(\theta,\theta_{\gamma},\theta_{0})\) appears. This new important function is the same as in Ref. [9] (see there the graphs for it) and it is non-zero only when the three theta angles satisfy the "triangle inequality" \[|\theta-\theta_{0}|<\theta_{\gamma}<\theta+\theta_{0}\,. \tag{58}\] Thus, the situation here differs in comparison with the standard VC radiation of the plane wave electron. Namely, the final photon is emitted not along the surface of the cone defined by the angle \(\theta_{0}\), but in the region between the two cones given by Eq. (58). It was proven in Ref. [9] that, though \(F(\theta,\theta_{\gamma},\theta_{0})\) diverges at the borders of the interval (58), this singularity can be integrated \[\int_{|\theta-\theta_{0}|}^{\theta+\theta_{0}}F(\theta,\theta_{\gamma},\theta_{ 0})\,\sin\theta_{\gamma}\,d\theta_{\gamma}=1. \tag{59}\] ### Soft photons approximation Once again, in the soft photon approximation, the conditions \(\omega\ll m_{e}\) and \(\omega\ll E-m_{e}\) are satisfied and the momenta and helicities of the initial and final electrons coincide. In this case we can simplify the corresponding wave-functions with the following relations \[\lambda^{\prime}=\lambda,\ \ \theta^{\prime}=\theta,\ \ \delta^{\prime}=\delta \tag{60}\] and perform the summation over \(\sigma\) and \(\sigma_{\gamma}\). Let us consider in detail this limit for the evolved wave-function in the coordinate representation. First, we need to study separately the coefficient in expression (57) \[C_{\lambda^{\prime}\lambda_{\gamma}m_{\gamma}} = \sum_{\sigma\sigma_{\gamma}}M_{\sigma\sigma_{\gamma}}^{\lambda \lambda^{\prime}\lambda_{\gamma}}(E,\omega,\theta,\theta^{\prime},\theta_{ \gamma})\] \[\times \cos[(m-\sigma)(\delta-\delta^{\prime})+(m_{\gamma}-\sigma_{ \gamma})\delta^{\prime}]\] \[= -\sqrt{8\pi\alpha}\,vE\,\delta_{\lambda\lambda^{\prime}}\,(A+B),\] \[A = 2\lambda\sqrt{2}\cos(m_{\gamma}\delta)\sum_{\sigma}2\sigma\left[ d_{\sigma\lambda}^{(1/2)}(\theta)\right]^{2}d_{0,\lambda_{\gamma}}^{(1)}(\theta_{ \gamma}),\] \[B = -4\lambda\sum_{\sigma}2\sigma d_{\sigma\lambda}^{(1/2)}(\theta)d_{ -\sigma,\lambda}^{(1/2)}(\theta)d_{2\sigma,\lambda_{\gamma}}^{(1)}(\theta_{ \gamma})\] \[\times \cos[(m_{\gamma}-2\sigma)\delta]\] Using definitions (20) for the Wigner matrices and the relation \[\cos[(m_{\gamma}-2\sigma)\delta]=\cos(m_{\gamma}\delta)\cos\delta+2\sigma\sin (m_{\gamma}\delta)\sin\delta, \tag{62}\] we find \[C_{\lambda^{\prime}\lambda_{\gamma}m_{\gamma}} = -\sqrt{8\pi\alpha}\,vE\,\delta_{\lambda\lambda^{\prime}}\,( \lambda_{\gamma}G_{1}+G_{2}), \tag{63}\] \[G_{1} = [\cos\theta\sin\theta_{\gamma}-\sin\theta\cos\theta_{\gamma}\cos \delta]\,\cos(m_{\gamma}\delta),\] \[G_{2} = -\sin\theta\sin\delta\sin(m_{\gamma}\delta).\] It is useful to note that Eq. (57) can be presented in another form by introducing the linear photon polarizations with the help of Eqs. (105): \[\Psi_{p_{\perp}p_{\perp}m\lambda}^{(\rm tw)}(x_{e},x_{\gamma})=i \sqrt{\frac{2\pi\alpha}{E}}\int\,d\omega\sin\theta_{\gamma}d\theta_{\gamma}F( \theta,\theta_{\gamma},\theta_{0})\] \[\sum_{m_{\gamma}}\left[G_{1}{\bf A}_{k_{\perp}k_{z}m_{\gamma}, \parallel}(x_{\gamma})-iG_{2}{\bf A}_{k_{\perp}k_{z}m_{\gamma},\perp}(x_{ \gamma})\right]\] \[\times\psi_{p_{\perp}p_{\perp}m-m_{\gamma}\lambda}(x_{e}) \tag{64}\] In the paraxial approximation we have \(\theta\ll 1\), \(|G_{2}|\ll|G_{1}|\) and the linear polarization in the scattering plane becomes dominant. Finally we note that at \(\theta\to 0\) and \(m\to\lambda\), the result (64) coincides with Eq. (37) up to factor \(i^{-\lambda}\) as it should be. To prove that, we must take into account that in the considered limit \(\theta_{0}\pm\theta\approx\theta_{0}\), therefore, we can replace \(\theta_{\gamma}\to\theta_{0}\) everywhere except the function \(F(\theta,\theta_{\gamma},\theta_{0})\) and perform the integration over \(\theta_{\gamma}\) in accordance with Eq. (59). Using further Eq. (101), we obtain that \[\psi_{p_{\perp}^{\prime}p_{\perp}^{\prime},m-m_{\gamma},\lambda^{ \prime}}(x_{e})|_{\theta^{\prime}\to 0}\to\delta_{m-m_{\gamma},\lambda}\,i^{- \lambda}\,U^{(\lambda)}(E,\lambda)\] \[\times e^{-i(Et_{e}-|{\bf p}|_{z_{e}})} \tag{65}\] and that \[C_{\lambda^{\prime}\lambda_{\gamma}m_{\gamma}}\to-\delta_{\lambda^{\prime} \lambda}\sqrt{2\pi\alpha}\,2vE\lambda_{\gamma}\,\sin\theta_{0}. \tag{66}\] As a result, we find \[\Psi_{p_{\perp}p_{\perp}m\lambda}^{(\rm tw)}(x_{e},x_{\gamma})\to i^{-\lambda} \Psi_{{\bf p}\lambda}^{(\rm pw)}(x_{e},x_{\gamma}), \tag{67}\] where the expression \(\Psi_{{\bf p}\lambda}^{(\rm pw)}(x_{e},x_{\gamma})\) is given by Eq. (37). ## V Discussion Through the paper we focused on the process of VC radiation. However, as a means to provide an unburdened version of the mathematics that was used, we also refer the reader to Appendix C. In previous sections we obtained the evolved wave function given by Eq. (32) for the process with initial electron having a definite momentum (being described by a plane wave), and by Eq. (57) when the initial electron is described by the Bessel wave. Our results show that the evolved two-particle state represents an entangled superposition of a photon and an electron and that this superposition can be expanded either into pairs of the plane-wave states or of the twisted states. The second choice is convenient when one of the particles is registered with a detector sensitive to the TAM projection (and insensitive to the momentum azimuthal angle). The evolved state of the second particle in this case will automatically be projected onto the twisted state with the definite TAM and only one term in the sums (32) or (57) will survive. Alternatively, when one measures the momentum azimuthal angle of one of the particles with a large error within the generalized measurement scheme (see [14]), the resultant state represents a wave packet - that is, a superposition of several TAM states. The second particle will, therefore, also be in a quantum state with a finite TAM dispersion (a bandwidth). The question in what processes twisted photons could be emitted is both theoretically and experimentally challenging. Let us briefly recall the known basic methods for the production of twisted photons. In paper [19] it was shown that when an electron is moving in a helical undulator, it emits the photons of the second harmonic in the twisted state. A little later it was shown in paper [20] that higher harmonics have the same property. Then in 2011, it was shown in papers [21], [22] and [23] that in the Compton back scattering of twisted laser photons by relativistic electrons, the final high-energy photon is also twisted in the main region of the emitted angles. The twisted photons with the energy 99 eV have been produced by utilizing a helical undulator at the synchrotron light source BESSY II [24]. In 2015-2017, the experiments carried out at BNL on the nonlinear Compton effect [25] were interpreted in [26] as an observation of the second harmonic which is twisted. In this case, the circularly polarized laser light plays role of the spiral undulator in the BESSY II experiments. A more general study [27] shows that twisted photons are emitted at the harmonics higher than the first one during the spiral motion of an electron. In this respect, the VC emission, specifically in the case of an initial plane-wave electron, is a new example of the generation of twisted photons. Recently, it was argued in Refs. [13; 14] that the use of generalized measurements is indeed an effective method for obtaining twisted photons. Our results follow up these works and give an interesting perspective for non-conventional measurement schemes. The method used here can also be applied to the problem of characterizing the final wave function in the process of radiation of an equivalent photon (EP) by high-energy charged particle. To clarify this point, let us consider the process of inelastic \(ep\)-scattering \[e(p)+p(P)\to e(p^{\prime})+X(P^{\prime}), \tag{68}\] where \(X\) is the final hadronic state with the total momentum \(P^{\prime}\). This process may be seen as two steps reaction: (_i_) an emission of the virtual photon (or EP) \(\gamma^{*}\) with momentum \(q=p-p^{\prime}\) and virtuality \(q^{2}<0\) by the initial electron; (_ii_) an absorption of this EP by proton with the production of the final hadronic state \(X\). The first step of the discussed process corresponds to the virtual process \[e(p)\to e(p^{\prime})+\gamma^{*}(q), \tag{69}\] which has a close similarity with the VC radiation. This is a problem we would like to address in a future work. ## VI Conclusions In this paper we explored the application of the evolved state formalism in the processes of VC emission by a plane wave and Bessel wave (i.e., carrying OAM) electron. This way we obtained the quantum mechanically complete description of the final entangled state of the photon and the electron independent of the detection scheme or the properties of a detector. We emphasize that the final system is an entangled state of two particles of different type, however, the obtained form of the wave-function is such that both particles contribute symmetrically. In addition, we considered the limiting cases of low-energy radiation and high-energy initial electron confirming that the evolved state reproduces correctly the expected behaviour. We also verify the results of paper [9] that the photonic part of the final state for the case of the twisted initial electron has the angular distribution and polarization which differ considerable from the ordinary VC radiation. ###### Acknowledgements. We are thankful to I. Ivanov for useful discussion. The studies in Sec. II are supported by the Russian Science Foundation (Project No. 21-42-04412; [https://rscf.ru/en/project/21-42-04412/](https://rscf.ru/en/project/21-42-04412/)). The studies in Sec. III are supported by the Government of the Russian Federation through the ITMO Fellowship and Professorship Program. The studies in Sec.IV are supported by the Russian Science Foundation (Project No. 23-62-10026; [https://rscf.ru/en/project/23-62-10026/](https://rscf.ru/en/project/23-62-10026/)). ## Appendix A Properties of twisted electrons and photons In this Appendix we collect some useful formulae related to properties of twisted electrons and photons (for more detail see reviews [10] and [11], respectively). ### Electrons The bispinor \(u_{{\bf p}^{\prime}\lambda^{\prime}}\) has the following evident dependence on the spherical angles \(\theta^{\prime}\) and \(\varphi^{\prime}\) (see Eq. (109) from [9]): \[u_{{\bf p}^{\prime}\lambda^{\prime}}=\sum_{\sigma^{\prime}=\pm 1/2}d_{\sigma^{ \prime}\lambda^{\prime}}^{(1/2)}(\theta^{\prime})\,U^{(\sigma^{\prime})}(E^{ \prime},\lambda^{\prime})\,e^{-i\sigma^{\prime}\varphi^{\prime}}, \tag{70}\] where the basis bispinors \(U^{(\sigma^{\prime})}(E^{\prime},\lambda^{\prime})\) are expressed as follows: \[U^{(\sigma^{\prime})}(E^{\prime},\lambda^{\prime})=\left(\begin{array}{c} \sqrt{E^{\prime}+m_{e}}\,w^{(\sigma^{\prime})}\\ 2\lambda^{\prime}\sqrt{E^{\prime}-m_{e}}\,w^{(\sigma^{\prime})}\end{array} \right), \tag{71}\] \[w^{(+1/2)}=\left(\begin{array}{c}1\\ 0\end{array}\right),\;\;w^{(-1/2)}=\left(\begin{array}{c}0\\ 1\end{array}\right)\,.\] They do not depend on the direction of \({\bf p}^{\prime}\) and are eigenstates of the spin projection operator \(\hat{s}^{\prime}_{z}\) with eigenvalues \(\sigma^{\prime}=\pm 1/2\). Note also that the expression \(u_{{\bf p}^{\prime}\lambda^{\prime}}\,e^{im^{\prime}\varphi^{\prime}}\) is the eigenfunction in the momentum representation of the TAM operator \(\hat{j}^{\prime}_{z}\) with the eigenvalue \(m^{\prime}:\) \[\hat{j}^{\prime}_{z}\,u_{{\bf p}^{\prime}\lambda^{\prime}}\,e^{im^{\prime} \varphi^{\prime}}=m^{\prime}\,u_{{\bf p}^{\prime}\lambda^{\prime}}\,e^{im^{ \prime}\varphi^{\prime}}. \tag{72}\] The function \[\psi_{p^{\prime}_{\perp}p^{\prime}_{z}m^{\prime}\lambda^{\prime}}(x) = \int_{0}^{2\pi}i^{-m^{\prime}}\,u_{{\bf p}^{\prime}\lambda^{\prime} }\,e^{im^{\prime}\varphi^{\prime}}\,e^{-ip^{\prime}x}\frac{d\varphi^{\prime}}{2\pi}\] \[= e^{-i(E^{\prime}t-p^{\prime}_{z}z)}\sum_{\sigma^{\prime}=\pm 1/2}i^ {-\sigma^{\prime}}d^{(1/2)}_{\sigma^{\prime}\lambda^{\prime}}(\theta^{\prime})\] \[\times J_{m^{\prime}-\sigma^{\prime}}(p^{\prime}_{\perp}r_{\perp})\,e^{ i(m^{\prime}-\sigma^{\prime})\varphi_{r}}\,U^{(\sigma^{\prime})}(E^{\prime}, \lambda^{\prime})\] corresponds to the twisted electron with longitudinal momentum \(p^{\prime}_{z}\), transverse momentum modulus \(p^{\prime}_{\perp}\), energy \(E^{\prime}=\sqrt{p^{\prime}_{\perp}+p^{\prime}_{z}+m^{2}_{e}}\), projection of the electron TAM onto the \(z\)-axis equal \(m^{\prime}\) and helicity \(\lambda^{\prime}=\pm 1/2\). In the paraxial approximation the above sum is dominated by the term with \(\sigma^{\prime}=\lambda^{\prime}\): \[\psi_{p^{\prime}_{\perp}p^{\prime}_{z}m^{\prime}\lambda^{\prime}} (x)\approx i^{-\lambda^{\prime}}\cos(\theta^{\prime}/2)\,J_{m^{\prime}-\lambda ^{\prime}}(p^{\prime}_{\perp}r_{\perp})\] \[e^{i(m^{\prime}-\lambda^{\prime})\varphi_{r}}\,U^{(\lambda^{ \prime})}(E^{\prime},\lambda^{\prime})\,e^{-i(E^{\prime}t-p^{\prime}_{z}z)}. \tag{10}\] Finally, in the limit \(\theta^{\prime}\to 0\), we obtain \[\psi_{p^{\prime}_{\perp}p^{\prime}_{z}m^{\prime}\lambda^{\prime}}(x)|_{\theta ^{\prime}\to 0}\rightarrow\delta_{m^{\prime}\lambda^{\prime}}\,i^{- \lambda^{\prime}}\,U^{(\lambda^{\prime})}(E^{\prime},\lambda^{\prime})\,e^{-i (E^{\prime}t-p^{\prime}_{z}z)}\,. \tag{11}\] i.e. in this limit and for \(m^{\prime}=\lambda^{\prime}\), the wave function of a twisted electron coincides with a plane wave along the \(z\) axis up to the phase factor \(i^{-\lambda^{\prime}}\). Similarly, the function \[\psi_{p_{\perp}p_{z}m\lambda}(x)=\int_{0}^{2\pi}i^{-m}\,u_{{\bf p}\lambda}\,e ^{im\varphi}\,e^{-ipx}\frac{d\varphi}{2\pi} \tag{12}\] corresponds to the initial twisted electron with longitudinal momentum \(p_{z}\), transverse momentum modulus \(p_{\perp}\), energy \(E=\sqrt{p^{\prime}_{\perp}+p^{\prime}_{z}+m^{2}_{e}}\), projection of the electron TAM onto the \(z\)-axis equal \(m\) and helicity \(\lambda=\pm 1/2\). In the limit \({\bf p}_{\perp}=\theta=0\), momentum \({\bf p}=(0,0,|{\bf p}|)\), the \(z\)-projection of the orbital angular momentum disappears because in this limit \(\hat{l}_{z}\propto\hat{\bf l}\cdot{\bf p}=0\), and the state helicity coincides with the \(z\)-projection of TAM. Indeed, if \(\theta\to 0\), we have \[\psi_{p_{\perp}p_{z}m\lambda}(x)|_{\theta\to 0}\rightarrow\delta_{m \lambda}\,i^{-\lambda}\,U^{(\lambda)}(E,\lambda)\,e^{-i(Et-p_{z}z)}\,. \tag{13}\] i. e. in this limit the wave function of the initial electron coincides (up to the phase factor \(i^{-\lambda}\)) with a plane wave along the \(z\) axis. Moreover, this plane wave has the same eigenvalue \(\lambda\) both for \(\hat{j}_{z}\) and helicity operators, since in this limit \(\hat{j}_{z}=\hat{s}_{z}\). ### Photons The evident dependence of the photon polarization vector on spherical angles \(\theta_{\gamma}\) and \(\varphi_{\gamma}\) reads (see detail in Ref. [28]): \[{\bf e}_{{\bf k}\lambda_{\gamma}}=\sum_{\sigma_{\gamma}=0,\pm 1}\,d^{(1)}_{ \sigma_{\gamma}\lambda_{\gamma}}(\theta_{\gamma})\,{\mathbf{\chi}}_{\sigma_{ \gamma}}\,e^{-i\sigma_{\gamma}\varphi_{\gamma}}, \tag{14}\] where the basis vectors \[{\mathbf{\chi}}_{0}=(0,\,0,\,1)\,,\,\,\,{\mathbf{\chi}}_{\pm 1}=\mp\frac{1}{\sqrt{2}} \,(1,\,\pm i,\,0) \tag{15}\] represent the eigenstates of the photon spin \(z\)-projection operator \(\hat{s}^{\gamma}_{z}\) with the eigenvalues \(\sigma_{\gamma}=0,\,\pm 1\). The function \[{\bf A}_{k_{\perp}k_{z}m\lambda_{\gamma}}(x) = \int_{0}^{2\pi}i^{-m}\,{\bf e}_{{\bf k}\lambda_{\gamma}}\,e^{im \varphi_{\gamma}}\,e^{-ikx}\frac{d\varphi_{\gamma}}{2\pi} \tag{16}\] \[= e^{-i(\omega t-k_{z}z)}\sum_{\sigma_{\gamma}=0;\pm 1}i^{-\sigma_{ \gamma}}d^{(1)}_{\sigma_{\gamma}\lambda_{\gamma}}(\theta_{\gamma})\] (17) \[\times J_{m-\sigma_{\gamma}}(k_{\perp}r_{\perp})\,e^{i(m-\sigma_{\gamma}) \varphi_{r}}\,{\mathbf{\chi}}_{\sigma_{\gamma}},\] where \(J_{n}(x)\) is the Bessel function of the first kind, corresponds to the twisted photon with longitudinal momentum \(k_{z}\), transverse momentum modulus \(k_{\perp}\), energy \(\omega=\sqrt{k_{\perp}^{2}+k_{z}^{2}}\,/n\), projection of the photon TAM onto the \(z\)-axis equals to the integer number \(m\) and helicity \(\lambda_{\gamma}=\pm 1\)[11]. This function is normalized by the condition \[\int{\bf A}^{*}_{k^{\prime}_{\perp}k^{\prime}_{z}m^{\prime} \lambda^{\prime}_{\gamma}}(x)\,{\bf A}_{k_{\perp}k_{z}m\lambda_{\gamma}}(x)\,d^{ 3}r\] \[= \frac{4\pi^{2}}{k_{\perp}}\,\delta(k^{\prime}_{\perp}-k_{\perp}) \delta_{m^{\prime}m}\,\delta(k^{\prime}_{z}-k_{z})\,\delta_{\lambda^{\prime}_{ \gamma}\lambda_{\gamma}}. \tag{18}\] Note also that the expression \({\bf e}_{{\bf k}\lambda_{\gamma}}\,e^{im_{\gamma}\varphi_{\gamma}}\) is the eigenfunction in the momentum representation of the TAM operator \(\hat{j}^{\gamma}_{z}\) with the eigenvalue \(m_{\gamma}\) : \[\hat{j}^{\gamma}_{z}\,{\bf e}_{{\bf k}\lambda_{\gamma}}\,e^{im_{\gamma}\varphi_{ \gamma}}=m_{\gamma}\,{\bf e}_{{\bf k}\lambda_{\gamma}}\,e^{im_{\gamma}\varphi_{ \gamma}} \tag{19}\] For small values of the conical angle \(\theta_{\gamma}\) (which corresponds to the so-called _paraxial approximation_) the sum (17) is dominated by the term with \(\sigma_{\gamma}=\lambda_{\gamma}\): \[{\bf A}_{k_{\perp}k_{z}m\lambda_{\gamma}}(x)\approx i^{-\lambda_{\gamma}}\,\cos^{2}(\theta_{\gamma}/2)\,J_{m-\lambda_{ \gamma}}(k_{\perp}r_{\perp})\] \[\times{\bf e}^{i(m-\lambda_{\gamma})\varphi_{r}}\,{\mathbf{\chi}}_{ \lambda_{\gamma}}\,{\bf e}^{-i(\omega t-k_{z}z)}. \tag{20}\] Therefore in this approximation, the \(z\)-projection \(m\) of the photon TAM is unambiguously made up of the spin angular momentum projection, approximately equal to \(\lambda_{\gamma}\), and the projection of the OAM, approximately equal to \(m-\lambda_{\gamma}\). Finally, in the limit \(\theta_{\gamma}\to 0\) (in this case, \(k_{\perp}\to 0\), \(k_{z}\to k=\omega n\), \(d^{1}_{\sigma\lambda_{\gamma}}(\theta_{\gamma})\rightarrow\delta_{\sigma \lambda_{\gamma}}\) and \(J_{m-\sigma}(k_{\perp}r_{\perp})\rightarrow\delta_{m\,\sigma}\)) we obtain \[{\bf A}_{k_{\perp}k_{z}m\lambda_{\gamma}}(x)|_{\theta_{\gamma}\to 0}\rightarrow\delta_{m \lambda_{\gamma}}\,i^{-\lambda_{\gamma}}\,{\mathbf{\chi}}_{\lambda_{\gamma}}\,{\bf e }^{-i(\omega t-k_{z}z)}, \tag{21}\] i. e. in this limit and for \(m=\lambda_{\gamma}\), the wave function of a twisted photon coincides with a plane wave along the \(z\) axis up to the phase factor \(i^{-\lambda_{\gamma}}\). In the momentum representation, the wave function of a twisted photon has a particularly simple form \[\tilde{\bf A}_{k_{\perp}k_{z}m\lambda_{\gamma}}({\bf K})=\ and it corresponds to plane waves concentrated on the cone with the polar angle \(\theta_{\gamma}=\arctan(k_{\perp}/k_{z})\). ### Photon polarizations To analyze the polarization of the photon, it is also convenient to introduce the following linear combinations of vectors \(\mathbf{e}_{\mathbf{k}\lambda_{\gamma}}\) with helicities \(\lambda_{\gamma}=\pm 1\): \[\mathbf{e}_{\parallel} = \frac{-1}{\sqrt{2}}\left(\mathbf{e}_{\mathbf{k},1}-\mathbf{e}_{ \mathbf{k},-1}\right)\] \[= \left(\cos\theta_{\gamma}\cos\varphi_{\gamma},\,\cos\theta_{ \gamma}\sin\varphi_{\gamma},\,-\sin\theta_{\gamma}\right),\] \[\mathbf{e}_{\perp} = \frac{i}{\sqrt{2}}\left(\mathbf{e}_{\mathbf{k},1}+\mathbf{e}_{ \mathbf{k},-1}\right)\] \[= \left(-\sin\varphi_{\gamma},\,\cos\varphi_{\gamma},\,0\right).\] It is easy to verify that these vectors are mutually orthogonal and orthogonal to the vector \(\mathbf{k}\). The vector \(\mathbf{e}_{\parallel}\) defines the longitudinal linear polarization (lying in the scattering plane given by the \(z\)-axis and the vector \(\mathbf{k}\)) and the vector \(\mathbf{e}_{\perp}\) - the linear polarization which is orthogonal to the scattering plane. A twisted photon state with either a longitudinal \(l=\parallel\) or an orthogonal \(l=\perp\) polarization looks similar to Eq. (30): \[\mathbf{A}_{k_{\perp}k_{z}ml}(x)=\int_{0}^{2\pi}i^{-m}\mathbf{e}_{l}\,e^{im \varphi_{\gamma}}\,e^{-ikx}\frac{d\varphi_{\gamma}}{2\pi}. \tag{31}\] The following relations are exploited in the paper: \[\sum_{\lambda_{\gamma}}\lambda_{\gamma}\mathbf{e}_{\mathbf{k}\lambda_{\gamma} }=-\sqrt{2}\,\mathbf{e}_{\parallel},\,\,\,\sum_{\lambda_{\gamma}}\mathbf{e}_{ \mathbf{k}\lambda_{\gamma}}=-i\sqrt{2}\,\mathbf{e}_{\perp}, \tag{32}\] and could be checked straightforwardly. ## Appendix B Summation over \(\lambda^{\prime}\) and \(\lambda_{\gamma}\) in Eq. (33) Here we calculate the sum \[\mathbf{S}=\sum_{\lambda^{\prime}\lambda_{\gamma}}u_{\mathbf{p}^{\prime} \lambda^{\prime}}\mathbf{e}_{\mathbf{k}\lambda_{\gamma}}\left(M_{\lambda,0}^{ \lambda\lambda^{\prime}\lambda_{\gamma}}-M_{\lambda,2\lambda}^{\lambda\lambda^ {\prime}\lambda_{\gamma}}\right), \tag{33}\] the expression in parentheses as in Eq. (29). First, using Eq. (32), we find the partial sums \[\sum_{\lambda_{\gamma}}\mathbf{e}_{\mathbf{k}\lambda_{\gamma}}d _{0\lambda_{\gamma}}^{(1)}(\theta_{\gamma}) = -\mathbf{e}_{\parallel}\sin\theta_{\gamma}, \tag{34}\] \[\sum_{\lambda_{\gamma}}\mathbf{e}_{\mathbf{k}\lambda_{\gamma}}d _{2\lambda,\lambda_{\gamma}}^{(1)}(\theta_{\gamma}) = -\mathbf{e}_{\parallel}2\lambda\cos\theta_{\gamma}-i\mathbf{e}_{ \perp}. \tag{35}\] Using these expression we obtain \[\mathbf{S} = \sqrt{4\pi\alpha}E_{\lambda\lambda}u_{\mathbf{p}^{\prime}\lambda }\left[\mathbf{e}_{\parallel}\sin(\theta_{\gamma}+\tfrac{1}{2}\,\theta^{ \prime})+i\mathbf{e}_{\perp}2\lambda\sin(\tfrac{1}{2}\,\theta^{\prime})\right] \tag{36}\] \[+ \sqrt{4\pi\alpha}E_{\lambda,-\lambda}u_{\mathbf{p}^{\prime},- \lambda}\bigg{[}\mathbf{e}_{\parallel}2\lambda\cos(\theta_{\gamma}+\tfrac{1}{ 2}\,\theta^{\prime})\] \[+ i\mathbf{e}_{\perp}\cos(\tfrac{1}{2}\,\theta^{\prime})\bigg{]},\] with \(E_{\lambda\lambda^{\prime}}\) defined in Eq. (19). In the limiting cases we have \[\mathbf{S}=4\sqrt{\pi\alpha}vEu_{\mathbf{p}^{\prime}\lambda}\mathbf{e}_{ \parallel}\sin\theta_{\gamma} \tag{37}\] for the soft-photon approximation and \[\mathbf{S}=4\sqrt{\pi\alpha EE^{\prime}}u_{\mathbf{p}^{\prime}\lambda}\left[ \mathbf{e}_{\parallel}\sin(\theta_{\gamma}+\tfrac{1}{2}\,\theta^{\prime})+i \mathbf{e}_{\perp}2\lambda\sin(\tfrac{1}{2}\,\theta^{\prime})\right] \tag{38}\] for the ultra-relativistic electron approximation. ## Appendix C Three scalar fields In this appendix we would like to use the developed formalism and in a simplified toy model of \(1\to 2\) process with three scalar particles. For definiteness, consider a process of a scalar particle with mass \(M\) and momentum \(p\) decaying into two scalar particles with smaller masses \(\mu^{\prime}\) and \(\mu^{\prime\prime}\) (\(\mu^{\prime}+\mu^{\prime\prime}\leq M\)) and momenta \(p^{\prime}\) and \(p^{\prime\prime}\). The tree level matrix element is given by \[S_{fi}^{(1)}=-i\lambda(2\pi)^{4}\,N\,\delta(p^{\prime}+p^{\prime\prime}-p), \tag{39}\] \(N=\frac{1}{\sqrt{2E}\sqrt{2E^{\prime}}\sqrt{2E^{\prime\prime}}}\), and should be inserted into the definition of the evolved wave function in coordinate representation \[\langle 0|\hat{\phi}(x^{\prime\prime})\hat{\phi}(x^{\prime})|\phi, \phi\rangle^{\rm(ev)} \tag{40}\] \[=\int\frac{d^{3}p^{\prime}}{(2\pi)^{3}}\frac{d^{3}p^{\prime\prime }}{(2\pi)^{3}}\,\frac{1}{\sqrt{2E^{\prime}}}\,e^{-ip^{\prime}x^{\prime}}\, \frac{1}{\sqrt{2E^{\prime\prime}}}\,e^{-ip^{\prime\prime}x^{\prime\prime}}\,S_ {fi}^{(1)}.\] Using delta function to eliminate the integral over \(p^{\prime\prime}\) leads to reduction \[\int d\Gamma = (2\pi)^{4}\int\delta(p^{\prime}+p^{\prime\prime}-p)\,\frac{d^{3}p^ {\prime}}{(2\pi)^{3}}\frac{d^{3}p^{\prime\prime}}{(2\pi)^{3}}\] \[\rightarrow \int\delta(E-E^{\prime}-E^{\prime\prime})|p^{\prime}|^{2}\sin \theta^{\prime}\frac{d|p^{\prime}|d\theta^{\prime}d\phi^{\prime}}{(2\pi)^{2}},\] and writing down the momenta conservation law \(\mathbf{p}^{\prime\prime}=\mathbf{p}-\mathbf{p}^{\prime}\) transforms the energy conservation \(\delta(E-E^{\prime}-E^{\prime\prime})\) into \[\delta(E-E^{\prime}-E^{\prime\prime})=\frac{E^{\prime\prime}}{|p^{\prime}||p|} \delta(\cos\theta_{pp^{\prime}}-\cos\theta_{0}),\] where \(\cos\theta_{0}=\frac{1}{vv^{\prime}}\left(1-\frac{M^{2}+\mu^{\prime\prime}{}^{2}- \mu^{\prime\prime}{}^{2}}{2EE^{\prime}}\right)\), \(|p|=vE\), \(|p^{\prime}|=v^{\prime}E^{\prime}\). In case the initial particle moves along the \(z\) direction, \(\cos\theta_{pp^{\prime}}=\cos\theta^{\prime}\) and the integral over \(\theta^{\prime}\) can be lifted imposing henceforth \(\theta^{\prime}=\theta_{0}\). After substituting series expansions in terms of cylindrical waves \[e^{-ip^{\prime}x^{\prime}}=\sum_{m^{\prime}=-\infty}^{+\infty}i^{m^{ \prime}}\,e^{-im^{\prime}\varphi^{\prime}}\phi_{p^{\prime}_{\perp}p^{\prime}_{ \perp}m^{\prime}}(x^{\prime}), \tag{41}\] \[e^{-ip^{\prime\prime}x^{\prime\prime}}=\sum_{m^{\prime\prime}=- \infty}^{+\infty}i^{m^{\prime\prime}}\,\,\,e^{-im^{\prime\prime}\varphi^{\prime \prime}}\phi_{p^{\prime\prime}_{\perp}p^{\prime}_{\perp}p^{\prime\prime}_{\perp}m^{ \prime\prime}}(x^{\prime\prime}),\] (42) \[\phi_{p_{\perp}p_{\perp}m}(x)=e^{-iEt}J_{m}(p_{\perp}r_{\perp})e^{i( \alpha\phi_{p^{\prime}}+k_{z}z)} \tag{43}\] into the evolved wave function, and considering that momenta conservation allows only for \(\varphi^{\prime\prime}=\varphi^{\prime}\pm\pi\) we can readily evaluate the remaining azimuthal integral in Eq. (25). Finally, we obtain a simple expression \[\langle 0|\hat{\phi}(x^{\prime\prime})\hat{\phi}(x^{\prime})|\phi, \phi\rangle^{\rm(ev)}=\frac{i\lambda}{4\pi v}\frac{1}{(2E)^{3/2}} \tag{27}\] \[\times\int\frac{p^{\prime}dp^{\prime}}{E^{\prime}}\,\sum_{m}(-1) ^{m}\phi_{p^{\prime}_{\perp}p^{\prime}_{\perp}m}(x^{\prime})\phi_{p^{\prime}_ {\perp},p_{z}-p^{\prime}_{z},-m}(x^{\prime\prime}).\] This could be generalized for the case of initial twisted particle with OAM \(m\) and manifest the conservation law \(m=m^{\prime}+m^{\prime\prime}\).

2305.03899

NL-CS Net: Deep Learning with Non-Local Prior for Image Compressive Sensing

Deep learning has been applied to compressive sensing (CS) of images successfully in recent years. However, existing network-based methods are often trained as the black box, in which the lack of prior knowledge is often the bottleneck for further performance improvement. To overcome this drawback, this paper proposes a novel CS method using non-local prior which combines the interpretability of the traditional optimization methods with the speed of network-based methods, called NL-CS Net. We unroll each phase from iteration of the augmented Lagrangian method solving non-local and sparse regularized optimization problem by a network. NL-CS Net is composed of the up-sampling module and the recovery module. In the up-sampling module, we use learnable up-sampling matrix instead of a predefined one. In the recovery module, patch-wise non-local network is employed to capture long-range feature correspondences. Important parameters involved (e.g. sampling matrix, nonlinear transforms, shrinkage thresholds, step size, $etc.$) are learned end-to-end, rather than hand-crafted. Furthermore, to facilitate practical implementation, orthogonal and binary constraints on the sampling matrix are simultaneously adopted. Extensive experiments on natural images and magnetic resonance imaging (MRI) demonstrate that the proposed method outperforms the state-of-the-art methods while maintaining great interpretability and speed.

Shuai Bian, Shouliang Qi, Chen Li, Yudong Yao, Yueyang Teng

2023-05-06T02:34:28Z

http://arxiv.org/abs/2305.03899v1

# NL-CS Net: Deep Learning with Non-Local Prior for Image Compressive Sensing ###### Abstract Deep learning has been applied to compressive sensing (CS) of images successfully in recent years. However, existing network-based methods are often trained as the black box, in which the lack of prior knowledge is often the bottleneck for further performance improvement. To overcome this drawback, this paper proposes a novel CS method using non-local prior which combines the interpretability of the traditional optimization methods with the speed of network-based methods, called NL-CS Net. We unroll each phase from iteration of the augmented Lagrangian method solving non-local and sparse regularized optimization problem by a network. NL-CS Net is composed of the up-sampling module and the recovery module. In the up-sampling module, we use learnable up-sampling matrix instead of a predefined one. In the recovery module, patch-wise non-local network is employed to capture long-range feature correspondences. Important parameters involved (e.g. sampling matrix, nonlinear transforms, shrinkage thresholds, step size, _etc._) are learned end-to-end, rather than hand-crafted. Furthermore, to facilitate practical implementation, orthogonal and binary constraints on the sampling matrix are simultaneously adopted. Extensive experiments on natural images and magnetic resonance imaging (MRI) demonstrate that the proposed method outperforms the state-of-the-art methods while maintaining great interpretability and speed. compressive sensing, image reconstruction, neural network, non-local prior ## 1 Introduction Compressed sensing (CS) theory has received a lot of attention in recent years. CS proves that when a signal is sparse in a certain domain, it can be recovered with high probability from much fewer measurements than the Nyquist sampling theorem [1, 2, 3, 4, 5]. The potential reduction in measurements is attractive for diverse practical applications, including but not limited to magnetic resonance imaging (MRI) [6], radar imaging [7] and sensor networks [8]. Over the past decades, a great deal of image CS reconstruction methods have been developed based on sparse representation model [9], which operates on the assumption that many images can be sparsely represented by a dictionary. The majority of those traditional methods use some structured sparsity as an image prior and then solve a sparsity-regularized optimization problem in an iterative fashion [10, 11]. Some elaborate structures were introduced into CS, like Gaussian scale mixtures model in wavelet domain [12]. In addition, non-local self-similarity of image is also introduced to enhance the CS performance [13, 14, 15]. For example, Metzler \(et\ al.\)[16] combined a Block Matching 3D (BM3D) denoiser into approximate message passing (AMP) framework to perform CS reconstruction. Zhang \(et\ al.\)[13] proposed the method combining sparse prior with non-local regularizers achieved well performance. Recently, some optimization-based methods have implemented adaptive sampling using alternating optimization techniques to jointly optimize the sampling matrix and CS recovery algorithms [9]. Despite the excellent interpretability of the above methods, they all require hundreds of iterations to produce decent results, which inevitably entails a heavy computational burden, in addition to the challenges posed by hand-craft transformations and associated hyper-parameters. Inspired by the successful applications of deep learning, several network-based CS reconstruction methods were developed to learn the inverse mapping from the CS measurement domain to original signal domain [17, 18, 19]. Mousavi \(et\ al.\)[20] applied a stacked denoising auto-encoder (SDA) to learn the statistical relationship from training data. However, the fully connected network used in SDA results in high computation cost. Kulkarni \(et\ al.\)[21] developed a method based on convolutional neural networks, called Recon-Net, to reconstruct the original image from the CS sampled image blocks. Yao \(et\ al.\)[22] used residual learning to further improve CS reconstruction. Sun \(et\ al.\)[23] propose a novel sub-pixel convolutional generative adversarial network (GAN) to learn compressed sensing reconstruction of images. To mitigate block effect in reconstruction, some models make use of full image areas for reconstruction [24, 25]. Meanwhile, for further improving the CS performance, some models are proposed to train the non-linear recovery operator to learn the optimal sampling pattern with recovery model [26, 27, 28]. The main advantage of the network-based methods is the reconstruction speed, as opposed to their optimization-based counterparts. However, the barrier to future performance improvement is their lack of the CS domain-specific insights intrinsic to optimization-based approaches. To overcome above shortcomings, researchers link optimization methods to networks, which make them interpretable. Specifically, these methods embed the solving process of traditional optimization-based methods into the forward operator of deep learning. For instance, Zhang \(et\ al.\)[29] proposed a deep network called ISTA-Net, which maps the popular Iterative Shrinkage Thresholding (ISTA) algorithm to network. It learns the sparse transform and soft threshold function via network. Based on ISTA-Net, Zhang \(et\ al.\)[30] proposes Opine-Net, which combines an efficient sampling module with ISTA-Net to achieve adaptive sampling and recovery. More recently, You \(et\ al.\)[31] improved ISTA-Net, which enables a single model to adapt for multiple sampling rates. Xiang \(et\ al.\)[32] proposed FISTA-Net for solving inverse problem, which is an accelerated version of ISTA. The Alternating Direction Method of Multipliers (ADMM) is proposed for the saddle point problem containing Lagrange multipliers that can not be solved directly by the ISTA algorithm. Drawing on the same idea, Yang \(et\ al.\)[33] proposed the ADMM-Net, which unfolds ADMM into network and applies it to CS-MRI. It employs a learnable transformation and the corresponding hyper-parameters in ADMM are learned from the network. Zhang \(et\ al.\)[34] extended the well-known AMP algorithm to propose AMP-Net. These models enjoy the interpretability with speed and tuning-free advantage. But the existing those approaches make little use of the non-local self-similarity prior which plays an important role in image reconstruction. There have been many previous methods for image reconstruction based on non-local prior. The non-local means (NLM) filter [35] is highly successful in the image denoising, where it produces a denoised image by calculating the weighted value of the current pixel and its neighbouring pixels. Inspired by NLM, several inverse problem frameworks incorporating non-local regularizer have been proposed [13, 14, 15]. For instance, Zhang \(et\ al.\)[13] combines the TV regularizer with the non-local regularizer, which is solved using the augmented Lagrangian method and captures non-local features of the image during the iterative process. However, the use of time-consuming NLM filters in the iterations undoubtedly introduces a costly computational complexity. Inspired by deep learning, some recent network-based approaches exploit non-local self-similarity. Liu \(et\ al.\)[36] proposed a network incorporated non-local operations into a recurrent neural network (RNN) for image restoration. Although non-local prior has been widely exploited by both optimization-based and network-based methods, few interpretable deep learning models have introduced this important prior. This paper combines merit of CS and non-local prior to propose a novel interpretable network, dubbed NL-CS Net. It composed of two parts: the up-sampling module and the recovery module. In the up-sampling phase, we adopted fully connection matrix to stimulate block-wise sampling and initial process. In the recovery phase, we maps the augmented Lagrangian method solving non-local regularized CS reconstruction model into the network, where the network consists of fixed number of phases, each of which corresponds to the one iteration. Rather than the traditional time-consuming NLM operation, the patch-wise non-local network is used to exploit global features. The hyperparameters involved in NL-CS Net (e.g. sampling matrix, step size, _etc._) are learned end-to-end, rather than being hand-crafted. Experimented results on natural images dataset and MRI dataset shows the feasibility and effectiveness of the proposed method compared with the existing methods. Figure 1: Illustration of recovery module in our proposed NL-CS Net. Specifically, NL-CS Net is composed of \(N_{p}\) phases, and each phase corresponds to one iteration. \(w\) module, \(u\) module and \(x\) module in \(N_{p}\) phase corresponds to the solution of three sub-problems. The bottom half of the figure 1 is illustration of up-sampling module and the PixelShuffle operation. ## 2 Related work The goal of CS is to reconstruct image from its CS measurement with high quality. Mathematically, given the original image \(u\in\mathbb{R}^{N}\), its CS measurements can be obtained by \(b=\Phi u\in\mathbb{R}^{M}\), where \(\Phi\in\mathbb{R}^{M\times N}\) denotes the sampling matrix and \(M\diagup N\) (\(M<<N\)) is commonly regarded as the CS sampling rate. Reconstructing \(u\) from \(b\) is typically ill-posed. Proposed NL-CS Net combines merit of CS and non-local prior, thus, we first review the traditional optimization-based algorithm to solve the non-local regularized model for CS. The traditional methods use a preset sampling matrix to recover \(u\) from the measured image \(b\), which is formulated as solving the following optimization problem: \[\min_{u}R(Du)\;\;s.t.\;\;b=\Phi u \tag{1}\] where \(D\) denotes the transform matrix and \(R\) is a regularizer, that imposes prior knowledge, such as sparsity and non-local self-similarity. More effective in suppressing staircase artifact and restoring the detail, optimization-based approaches, combined traditional sparse priors with non-local regularizer, have been proven to achieve superior performance [13]. \[\min_{u}\left\|Du\right\|_{1}+\alpha{\sum_{i}}\left(u_{i}-\sum_{j}W_{ij}u_{j} \right)^{2}s.t.\Phi u=b \tag{2}\] The \(W_{ij}\) is of the following form: \[W_{ij}=\left\{\begin{aligned} &\exp(\left\|u_{i}^{(k)}-u_{j}^{(k)} \right\|_{2}^{2}/h)/c\;\;if\;j\in s_{i}\\ & 0,\;\;\;\;\;otherwise\end{aligned}\right. \tag{3}\] where \(s_{i}\) is the set containing the neighbor of the pixel \(i\); (\(W_{ij}\)) represents the matrix form of NLM; \(\alpha\) is a hyper-parameter; \(h\) is a controlling factor; the superscript \(k\) indicates the number of iterations. In brief, for a given pixel, the NLM filter can be obtained by calculating a weighted average of the surrounding pixels within a search window. In order to solve Eq. (2), we equivalently transform Eq. (2) into the following problem through variable splitting technique. \[\begin{split}&\min_{\omega,u,x}\left\|\omega\right\|_{1}+\alpha \left\|x-Wx\right\|_{2}^{2}\\ & s.t.\;\Phi u=b,u=x,Du=\omega\end{split} \tag{4}\] where \(\omega\) and \(x\) are auxiliary variables. Thus, the corresponding augmented Lagrangian function for Eq. (4) is expressed as: \[L(\omega,u,x,v,\gamma,\lambda)= \left\|\omega\right\|_{1}+\alpha\left\|x-Wx\right\|_{2}^{2}\] \[-v^{T}(Du-\omega)+\frac{\beta}{2}\left\|Du-\omega\right\|_{2}^{2}\] \[-\gamma^{T}(u-x)+\frac{\theta}{2}\left\|u-x\right\|_{2}^{2}\] \[-\lambda^{T}(\Phi u-b)+\frac{\mu}{2}\left\|\Phi u-b\right\|_{2}^{2} \tag{5}\] where \(\theta\), \(\mu\) and \(\beta\) are regularization hyper-parameters; \(\lambda\), \(v\) and \(\gamma\) are the Lagrangian multipliers. In this case, the augmented Lagrangian method solves Eq. (5) by the folloing update rule: \[(\omega^{k+1},u^{k+1},x^{k+1})=\operatorname*{arg\,min}_{\omega,u,x}L(\omega,u,x,v,\gamma,\lambda) \tag{6}\] \[\left\{\begin{array}{l}v^{(k+1)}=v^{(k)}-\beta(Du^{(k+1)}-\omega^{(k+1)})\\ \gamma^{(k+1)}=\gamma^{(k)}-\theta(u^{(k+1)}-x^{(k+1)})\\ \lambda^{(k+1)}=\lambda^{(k)}-\mu(\Phi u^{(k+1)}-b)\end{array}\right. \tag{7}\] By applying the alternating direction method, Eq. (6) can be decomposed into three sub-problems in the following form: \[\omega^{(k+1)}= S\left(Du^{(k)}-\frac{v^{(k)}}{\beta},\frac{1}{\beta}\right) \tag{8}\] \[u^{(k+1)}= u^{(k)}-\varepsilon d\] (9) \[x^{(k+1)}= \frac{\theta(u^{(k+1)}-\frac{\gamma^{(k)}}{\beta})+2\alpha W(u^{ (k+1)}-\frac{\gamma^{(k)}}{\beta})}{\theta+2\alpha} \tag{10}\] where \(d=D^{T}(\beta Du^{(k)}-v^{(k)}-\beta\omega^{(k+1)})-\gamma^{(k)}+\theta(u^{(k )}-x^{(k)})+(\mu\Phi^{T}(\Phi u^{(k)}-\Phi b)-\lambda^{(k)})\). \(S(\cdot)\) is a nonlinear shrinkage function with the hyper-parameter \(1/\beta\), where \(S\left(y,z\right)=sign(y)max(|y|-\frac{1}{z},0)\). And \(\varepsilon\) is the step size of the gradient descent method. The overall algorithm flow is shown in Algorithm 1. ``` 1:\(\alpha\leftarrow\alpha+1\) 2:\(\beta\leftarrow\alpha+1\) 3:while\(\alpha\) is not converged 4:\(\beta\leftarrow\alpha+1\) 5:for\(i\in\{1,\ldots,k\}\)do 6:\(\alpha\leftarrow\beta+1\) 7:endwhile 8:\(\beta\leftarrow\alpha+1\) 9:endwhile 10:\(\beta\leftarrow\alpha+1\) [MISSING_PAGE_POST] 39:endwhile 39:end 39:endwhile 39:endend 30:endendendend 30:endendend 31:endendendend 31:endendendend 31:endendend 31:endendend 31:endend 31:endend 31:endendend 31:end 31:endend 31:end [MISSING_PAGE_POST] 31:endend 31:end 31:end 31:end 31:end 31:endend 31:endend 31:end 31:endend 31:end 31:end 31:endend 31:end a recovery module. In the up-sampling phase, we adopted a fully connection matrix to stimulate block-wise sampling and initial process. In the recovery phase, its backbone is designed by mapping the augmented Lagrangian method solving non-local regularized CS reconstruction model into network. The network consists of fixed number of phases, each of which corresponds to the one iteration. Hence, NL-CS Net is composed of \(\omega^{(k)}\), \(u^{(k)}\) and \(x^{(k)}\) modules and update Lagrange multiplier module corresponding to four sub-problem Eqs. (8), (9), (10) and (7) sequentially in the \(k\)-th iteration. We designed a novel model to replace soft-shrinkage function and allowed step size and transform matrix to be learned. The learnable patch-wise non-local method is used to exploit global features, rather than the traditional non-local means operation. The parameters involved in NL-CS Net (e.g. sampling matrix, step size, _etc._) are learned end-to-end, rather than being hand-crafted. ### Up-sampling module in NL-CS Net A warm start often leads to better result. The measured image \(b\) is compressive from the original image \(u\). We obviously use the sampling matrix \(\Phi\) to obtain \(b\) from \(u\) as \(b=\Phi u\). Notice that, in this section, we indiscriminately use \(u,b,w,x\) as one- or two-dimensional tensor according to actual demand. For example, in the formulation \(b=\Phi u\), \(b\) and \(u\) are one-dimensional, however, in a network, they are two-dimensional. Meanwhile, we can also obtain an approximate \(u\) from \(b\) as \(u=\Phi^{T}b\). In this module, \(\Phi\) will be leanable instead of pre-defined. It is well known that the linear transformation can be performed by a series of convolutional operators. Thus, we implement this operation by a convolutional layer and a PixelShuffle layer [37], specifically, adjusting the transpose of the sampling matrix \(\Phi\) to \(N\) filters with the same size \(1\times 1\times M\). With those filters, \(u=\Phi^{T}b\) is implemented through a \(1\times 1\) convolutional layer. PixelShuffle layer expands feature maps by reorganization between multiple channels, and we apply it to transform the tensor shape \(1\times 1\times\) N output into \(\sqrt{N}\times\sqrt{N}\times 1\). \[u^{0}=\text{PixelShuffle}\left(\Phi^{T}b\right) \tag{11}\] Obviously, \(b\) is one-dimensional and \(u^{0}\) is two-dimensional, and \(u^{0}\) can be inputed into an image-targeted network. ### \(\omega^{(k)}\), \(u^{(k)}\) and \(x^{(k)}\) module in NL-CS Net In the following, we consider that the above three sub-problem Eqs. (8), (9) and (10) in the \(k\)-th iteration, and we unfold them into three separate modules in \(k\)-th phase of NL-CS Net: \(\omega^{(k)}\) module, \(u^{(k)}\) module and \(x^{(k)}\) module. The \(\omega^{(k)}\) module corresponds to the Eq. (8) and is used to produce the output \(\omega^{(k+1)}\). The transform matrix \(D\) of traditional approach is to use a set of pre-trained filters. Here, we adopt a set of learnable filters to transform the image into the transform domain instead of the hand-crafted strategy. Note that it is hard to tune a well-designed threshold \(1/\beta\) in Eq. (8) which is necessary to recover the details of the image. Hence, we set \(\beta\) as learnable parameter. For efficiently solve the Eq. (8), we propose a flexible model for solve nonlinear transformation. In detail, the deep learning solution of the \(\omega^{(k)}\) sub-problem can be described as follows: \[\omega^{(k+1)}=F_{2}^{(k)}\left(RB_{2}^{(k)}\left(RB_{1}^{(k)}\left(F_{1}^{(k )}\left(E_{1}(u^{(k)})-\frac{v^{(k)}}{\beta}\right)\right)\right)\right) \tag{12}\] Here, \(E_{1}^{(k)}\) consists of size \(3\times 3\) convolutional layer, which corresponds to 32 filters and Rectified Linear Unit (ReLU). To extract the features of the image and reconstruction, Eq. (12) is composed of two convolutional layers (\(F_{1}^{(k)}\) and \(F_{2}^{(k)}\)) and two residual blocks (\(RB_{2}^{(k)}\) and \(RB_{1}^{(k)}\)). \(F_{1}^{(k)}\) and \(F_{2}^{(k)}\) denote size \(3\times 3\) convolutional layer which corresponds to 32 filters and the residual blocks contain two \(3\times 3\) convolutional layers which correspond to 32 filters and ReLU with skip connection from input to output. Corresponding to gradient descent-based Eq. (9) in the \(u^{(k)}\) module. We allow the step size to be learned in the network which is very different from the Figure 2: Illustration of patch-wise non-local network. We extract sliding local patches from input feature map. fixed step size of traditional methods. The \(u^{(k)}\) module is finally defined as: \[u^{(k+1)}= u^{(k)}-\varepsilon d\] \[d= E_{2}^{(k)}(\beta E_{1}^{(k)}(u^{k})-v^{(k)}-\beta\omega^{(k+1)})- \gamma^{(k)}+\theta(u^{(k)}-x^{(k)})\] \[+PixelShuffle[\Phi^{T}(\mu(\Phi\,u^{(k)}-\Phi\,u^{0})-\lambda^{(k) })] \tag{13}\] where \(E_{2}^{(k)}\)composed of \(3\times 3\) convolutional layer which corresponds to 32 filters and RELU. We use the \(x^{(k)}\) module to compute \(x^{(k+1)}\) according to Eq. (10) with input \(u^{(k+1)}\). For more efficient extraction of global features from images, the patch-wise non-local neural networks [38] is used. It constructed the long-range dependence between image patches and applied a learnable embedding function to make the matching process adaptive. We use the learnable non-local method \(NLM_{patch}()\) instead of traditional NLM, as shown in Figure 2. In \(NLM_{patch}()\), given the input feature map \(u^{(k+1)}\), we use three independently learnable weight matrices \(F_{Q}\),\(F_{K}\) and \(F_{V}\) as the embedding functions which is implemented as \(1\times 1\) convolution operation corresponds to 32 filters on the entire feature map. Instead of performing pixel-wise similarity computation in the embedded feature map directly like [39], a sliding window with a size of \(7\times 7\) and a step size of 4 is used to select the overlapping patches in the embedded feature map. After the patch extraction operation, we have three sets of patches with size \(N\times C\times W\times H\), so that our weight update strategy is to calculate the similarity between those patches. Next, we reshape the patch under the \(F_{Q}\) and \(F_{K}\) to a one-dimensional patch. \(M\) denoted the temporary results, which can be calculated as follows: \[M=\text{softmax}\left(F_{Q}^{T}\left(u^{(k+1)}-\frac{\gamma^{(k)}}{\beta} \right)F_{K}\left(u^{(k+1)}-\frac{\gamma^{(k)}}{\beta}\right)\right). \tag{14}\] In the next step, we calculate the dot product of \(F_{V}(r)\) and \(M\). Then, we recover these patches into the feature map of size \(C\times W\times H\) with using averaging to process the overlapping areas. Finally, we place the output tensor through a convolutional layer and set up a skip connection between it and the input. Combining the \(NLM_{patch}(u^{(k+1)}-\frac{\gamma^{(k)}}{\beta})\) with Eq.(10) yields the \(x^{(k)}\) module as follows: \[x^{(k+1)}=\frac{\theta(u^{(k+1)}-\frac{\gamma^{(k)}}{\beta})+2\alpha N\text{ LM}_{patch}\left(u^{(k+1)}-\frac{\gamma^{(k)}}{\beta}\right)}{\theta+2\alpha}. \tag{15}\] Finally, we update the Lagrangian multiplier at each phase, which is the same with Eq. (7). ### Total loss function We will show how to incorporate the two constraints with regarded to \(\Phi\) into NL-CS Net simultaneously, including the orthogonality constraint and the binary constraint [30]. For the orthogonal constraint \(\Phi\Phi^{T}=I\), where \(I\) is the identity matrix, the orthogonal loss term is defined as \(L_{orth}=\frac{1}{M^{2}}\left\|\Phi\Phi^{T}-I\right\|_{F}^{2}\), where \(\left\|\cdot\right\|_{F}^{2}\) stands for the Frobenius norm, and we add this directly into the loss function. To facilitate practical application, we restrict the value of the sampling matrix to 1 or 0. Binary(\(\cdot\)) performs the following operation on each element. \[Binary(z)\left\{\begin{array}{ll}1&if\;\;z\geq 0,\\ 0&if\;\;z<0.\end{array}\right. \tag{16}\] As previously described, we have successfully mapped the process of solving Eq. (2) to our NL-CS Net. The learnable parameters in NL-CS Net are defined in Table 1. Note that all those parameters are learned end-to-end rather than hand-craft. Recovery module are not shared parameter across phase by default, which is a significant difference from traditional optimization-based algorithms. Given a dataset \(\{u_{1},u_{2},u_{3},...,u_{N_{b}}\}\) where \(N_{b}\) is the number of image blocks and \(u_{i}\) represents the original image block, the output of the network through \(N_{p}\) phase is denoted as \(u_{i}^{(N_{p})}\). Our aim is to minimize the discrepancy between the network output \(u_{i}^{(N_{p})}\) and the original image \(u_{i}\) while satisfying the orthogonal constraint and the binary constraint. Hence the loss function of NL-CS Net is defined as follows: \[\min L_{total}=L_{\text{discrepency}}\;+\pi L_{\text{orth}}\] \[s.t. Binary(\Phi)\] \[where:L_{\text{discrepency}} =\frac{1}{NN_{b}}\sum_{i=1}^{N_{b}}\left\|u_{i}^{(N_{p})}-u_{i}\right\|\] \[L_{\text{orth}} =\frac{1}{M^{2}}\left\|\Phi\Phi^{T}-I\right\|_{F}^{2} \tag{17}\] \begin{table} \begin{tabular}{l l} \hline \hline \multicolumn{2}{c}{Leanable parameters} \\ \hline \(w\) module & \(RB_{1}\),\(RB_{2}\),\(F_{1}\) and \(F_{2}\) \\ \(u\) module & \(E_{1}\),\(E_{2}\), and \(\varepsilon\) \\ \(x\) module & \(F_{Q}\),\(F_{k}\) and \(F_{v}\) \\ Others & \(\Phi\),\(\alpha\),\(\beta\), and \(\mu\) \\ \hline \hline \end{tabular} \end{table} Table 1: leanable parameters. where \(\pi\) is set to be 0.001 by experience. ## 4 Experimental results We validate the proposed model on two tasks: the CS reconstruction of natrual images and MRI images. People are most often in contact with natural images, which is very important. MRI is a non-invasive and widely used imaging technique providing both functional and anatomical information for clinical diagnosis. But long scanning and waiting times may lead to motion artefacts and patient discomfort. MRI acceleration is one of the most successful applications of CS (CS-MRI), which can reconstructs high quality MR images from a few sampling data in k-space. To give quantitative criteria, Peak Signal to Noise Ratio (PSNR) is introduced to analyze the reconstruction performance. We use the Adam optimizer with the default learning rate set to 0.0001 and the batch size to 64. All the network were trained on a workstation configured with Intel Core i7-9700 CPU and RTX2080 GPU, and tested on a workstation configured with Intel Core i7-7820 CPU and GTX1060 GPU. ### Experiment on natural image The training set was standardized using train90 [21], which contains 90 natural images. They are constructed by 88,912 randomly cropped image blocks (each of size \(33\times 33\)). The corresponding measurement matrix is obtained from the training as opposed to fix it. The widely used benchmark datasets: Set11 [21] and BSD68 [40], which have 11 and 68 natural images, respective, were applied for testing. The reconstruction results are presented as the average PSNR of the test images. #### 4.1.1 Hyper-parameter selection: phase and epoch numbers To probe the appropriate number phase \(N_{p}\) for NL-CS Net, we set the phase number \(N_{p}\) from 1 to 15 to observe its performance, in the cases of 25% CS sampling rate reconstruction on Set11. As can be seen in Figure 2(a), PSNR rises gradually with the phase number. The curve is almost flat when \(N_{p}\geq 10\). To achieve a balance between performance and computational cost, in the following experiments, we set \(N_{p}=9\). Figure 2(b) further demonstrates the convergence process for three types of losses (i.e \(L_{discrepency}\), \(L_{orth}\) and \(L_{total}\)). We experimented with \(N_{p}=9\) at the sampling rate of 25% on Set11. The orthogonal constraint term gradually converges to zero which proves its suitability for NL-CS Net. Total loss achieves an acceptable result at about 120 epochs and converges at about 200 epochs. As below, we set epoch number to be 200 for an enough convergence. #### 4.1.2 Ablation studies To adequately demonstrate the advantage of combining non-local regularized terms, we designed ablation experiments. ISTA-NET provides a network form solution for the \(L_{1}\) norm regularized optimization problem without the non-local regularized terms. For a fair comparison, we trained NL-CS Net with the Gaussian random sampling matrix as ISTA-NET, using the same training set, and tested its performance on BSD68 and the CS sampling rate varies in \(\{1\%,4\%,10\%,25\%,50\%\}\). As expected from Table 2, NL-CS Net with both fixed and varible sampling matrix outperforms ISTA-net, which further demonstrates the reasonableness of our method. In addition, we observe that joint optimized sampling matrix and recovery operator in our method improves performance by 1.4 over the fixed sampling matrix. NL-CS Net introduces two types of constraints including orthogonality constraint and binary constraint. We observe the effect of these two constraints on the reconstruction performance in the case of CS sampling rate = 25% on \begin{table} \begin{tabular}{l l l l l l} \hline \hline & \multicolumn{5}{c}{**CS sampling rate (BSD68)**} \\ **Algorithm** & & & & & \\ & 50 \% & 25 \% & 10 \% & 4 \% & 1 \% & Avg \\ \hline ISTA-Net & 34.04 & 29.36 & 25.32 & 22.17 & 19.14 & 26.01 \\ NL-CS Net(fixed \(\Phi\) ) & 34.01 & 29.80 & 25.87 & 22.53 & 19.86 & 26.41 \\ **NL-CS Net** & **34.69** & **29.97** & **26.72** & **24.21** & **21.63** & **27.44** \\ \hline \hline \end{tabular} \end{table} Table 2: Ablation studies. The best performance is in bold. Figure 3: Phase number of NL-CS Net in the case of CS sampling rate = 25% in 3A. The 3B progression curves of loss (discrepency) and loss (orth) achieved by NL-CS Net in training with various epoch numbers in the case of CS sampling rate = 25% on Set11. \begin{table} \begin{tabular}{l l l l l} \hline \hline & \multicolumn{5}{c}{Different combinations of constraints of NL-CS Net} \\ \hline Binary constraint & ✓ & X & X & ✓ \\ Orthogonality constraint & X & ✓ & X & ✓ \\ **PSNR** & **29.92** & **29.95** & **29.85** & **29.97** \\ \hline \hline \end{tabular} \end{table} Table 3: The effect of different combinations on the reconstruction result. BSD68. It can be seen in Table 3 that orthogonality constraint and binary constraint acts as network regularization, which enhance the reconstruction performance. In Figure 4, we verify the effect of different constrain combinations on the convergence process, and it can be observed that all combinations converge to similar values at 200 epochs and the combination of orthogonality constraint and binary constraint achieves the best results. \begin{table} \begin{tabular}{l c c c c c c c} \hline \hline & \multicolumn{5}{c}{**CS sampling rate (Set11)**} & \multicolumn{2}{c}{**Time**} \\ **Algorithm** & & & & & & \multicolumn{1}{c}{Cpu/GPU} \\ & 50 \% & 25 \% & 10 \% & 4 \% & 1 \% & Avg & \\ \hline TVAL3 & 33.56 & 27.92 & 23.00 & 18.75 & 16.43 & 23.93 & 3.150 s/\(--\) \\ D-AMP & 35.93 & 28.47 & 22.64 & 18.40 & 5.20 & 22.13 & 51.21 s/\(--\) \\ IR-CNN & 36.23 & 30.07 & 24.02 & 17.56 & 7.78 & 23.13 & \(--\)/ 68.42 s \\ SDA & 28.95 & 25.34 & 22.65 & 20.12 & 17.29 & 22.87 & \(--\)/ 0.003 s \\ ReconNet & 31.50 & 25.60 & 24.28 & 20.63 & 17.29 & 23.86 & \(--\)/ 0.016 s \\ ISTA-Net & 37.74 & 31.53 & 25.80 & 21.23 & 17.30 & 26.72 & \(--\)/ 0.093 s \\ FISTA-Net & **37.85** & 31.66 & 25.98 & 21.20 & 17.34 & 26.81 & \(--\)/ 0.052 s \\ BCS & 34.61 & 29.98 & 26.04 & 23.19 & 19.15 & 26.59 & \(--\)/ 0.002 s \\ NL-CS Net & 37.29 & **32.25** & **27.53** & **24.04** & **19.60** & **28.13** & \(--\)/ 0.326 s \\ \hline \hline \end{tabular} \end{table} Table 4: PSNR performance comparisons on Set11 with different CS sampling rates. The best performance is in bold. Note that the last column is a run-time analysis of all the competing methods. Figure 4: The curves for each combination are based on the PSNR in the case of CS sampling rate = 25%. #### 4.1.3 Comparison with state-of-the-art methods We compare the proposed NL-CS Net with eight representative models, including TVAL3 [41], D-AMP [16], IR-CNN [42], SDA [20], Recon-Net [21], ISTA-Net [29], FISTA-Net [32] and BCS [26]. TVAL3, D-AMP and IR-CNN are the optimization-based methods; Recon-net, SDA and BCS are the network-based methods. ISTA-Net and FISTA-Net are interpretable Network. In particular, IR-CNN inserts the trained CNN denoiser into the Half Quadratic Splitting (HQS) optimization method, which is used to solve the inverse problem. Recon-Net use convolutional method to learning the inverse problem map and reconstruction. BCS learns the sampling matrix through the network. ISTA-Net and FISTA-Net are constructed by unfolding traditional optimization-based algorithms into deep learning. Table 4 shows the quantitative results of various CS algorithms on Set11. For the optimization-based methods including TVAL3, D-AMP and IR-CNN, we observe that they perform badly at extremely low CS sampling rates of 1%-4%, which has a large gap in performance with the other two categories of algorithms. Meanwhile, the proposed NL-CS Net outperforms the optimization-based methods at all the sampling rates. Specifically, NL-CS Net achieves on average 4.2 gain against the best-performing optimization-based method (TVAL3). In particular, the proposed NL-CS Net achieves a gain of 3.17, 11.82, 14.4, over TVAL3, D-AMP and IR-CNN respectively at extremely low 1% sampling rate. The network-based methods, including Recon-net, SDA and BCS, perform well at all sampling rates compared with the traditional methods. Still, at most sampling rates, NL-CS Net achieved the best results except that ISTA-Net and FISTA-Net obtain a minor advantage only with 50% of CS sampling rate. Compared to the two state-of-the-art interpretable networks ISTA-Net and FISTA-Net, the proposed NL-CS Net obtained a gain of 1.32 and 1.35 respectively on the average. In addition, compared to the optimization-based approaches, the proposed NL-CS Net substantially reduces the computation time. The reconstruction speed is approximately more than 10 times faster than that of D-AMP and IR-CNN. Compared to network-based approaches, NL-CS Net achieves decent speed with best performance. Figure 5: Average PSNR (dB) performance comparisons on BSD68. From left to right: original image, Recon-Net, ISTA-Net, FISTA-Net, BCS and NL-CS Net (ours). To further validate the generalizability of our NL-CS Net, we experimented several models that performed well on Set11, including ISTA-Net, FISTA-Net, BCS and ours on a larger dataset BSD68. In Table 5, it can be clearly observed that NL-CS Net outperforms the other algorithms at all sampling rates. It outperforms the second best algorithm by 0.72 in average PSNR, and by 0.39, 0.27, 0.52, 0.61 and 0.41 for different sampling rates from 1% to 50%, respectively. Figure 5 shows a visual comparison. As can be seen, NL-CS Net is capable of preserving more texture information and recovering richer structural detail due to the effective incorporation of the non-local prior. ### Cs-Mri We train and test on the brain and chest MRI images [33], in which the size of images is \(256\times 256\). For each dataset, we randomly take 100 images for training and 50 images for testing. In our experiments, we take \(\Phi=fZ\), where \(f\) is Fourier transform and \(Z\) is down sampling matrix. Our proposed NL-CS Net can be directly applied to CS-MRI reconstruction. Here we compare NL-CS Net with four classical CS-MRI methods: Zero-filling, TV [6], RecPF [43], PBDW [44] and UNet [45]. \begin{table} \begin{tabular}{l c c c c c c} \hline \hline & \multicolumn{5}{c}{**CS sampling rate (BSD68)**} \\ **Algorithm** & & & & & & \\ & 50 \% & 25 \% & 10 \% & 4 \% & 1 \% & Avg \\ \hline ISTA-Net & 34.04 & 29.36 & 25.32 & 22.17 & 19.14 & 26.01 \\ FISTA-Net & 34.28 & 29.45 & 25.38 & 22.31 & 19.35 & 26.16 \\ BCS & 33.18 & 29.18 & 26.07 & 23.94 & 21.24 & 26.72 \\ **NL-CS Net** & **34.69** & **29.97** & **26.72** & **24.21** & **21.63** & **27.44** \\ \hline \hline \end{tabular} \end{table} Table 5: PSNR (dB) performance comparisons on BSD68 with different CS sampling rates. Best performance is in bold. Figure 6: MRI reconstruction. From left to right: Zero-filling, RecPF, TV, PBDW,U-Net and NL-CS Net. It can be clearly observed in Table 6 that NL-CS Net outperforms the other algorithms at all sampling rates. It outperforms the second best algorithm by 0.64, 0.04, 0.03, 0.11 and 0.57 for different sampling rates from 10% to 50%, respectively. The visualization results are shown in Figure 6, it can be seen that NL-CS Net reconstructs the brain image better than other methods. More details of the brain texture are preserved and the edges are more clearly. ## 5 Conclusion Inspired by traditional optimization, we proposed a novel CS framework, dubbed NL-CS Net, with the incorporated learnable sampling matrix and non-local prior. The proposed NL-CS Net possesses well-defined interpretability, and make full use of the merits of both optimization-based and network-based CS methods. Extensive experiments show that NL-CS Net have state-of-art performance while maintaining great interpretability. For future work, one direction is to extend our proposed model to other image inverse problems, such as deconvolution and inpainting. Another one is to combine other iterative algorithms with deep learning. ## Acknowledgments This work was supported by the Natural Science Foundation of Liaoning Province (2022-MS-114). ## Declarations * Funding: Natural Science Foundation of Liaoning Province (2022-MS-114) * Conflict of interest/Competing interests: The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. * Availability of data and materials: We hereby declare that all data and materials used in this study are publicly available with no restrictions. The data used in this research has been made publicly available and can be accessed directly via [https://github.com/bianshuai001/NL-CS-Net](https://github.com/bianshuai001/NL-CS-Net). \begin{table} \begin{tabular}{l c c c c c} \hline \hline \multirow{2}{*}{**Algorithm**} & \multicolumn{5}{c}{**MRI**} \\ & 50 \% & 40 \% & 30 \% & 20 \% & 10 \% \\ \hline Zero-filling & 36.73 & 34.76 & 32.59 & 29.96 & 26.35 \\ TV & 41.69 & 40.00 & 37.99 & 35.20 & 30.90 \\ RecPF & 41.71 & 40.03 & 38.06 & 35.32 & 30.99 \\ PBDW & 41.81 & 40.21 & 38.60 & 36.08 & 31.45 \\ UNet & 42.20 & 40.29 & 37.53 & 35.25 & 31.86 \\ **NL-CS Net** & **42.38** & **40.32** & **38.63** & **36.12** & **32.09** \\ \hline \hline \end{tabular} \end{table} Table 6: Average PSNR on MRI reconstruction. Best performance in bold. * Code availability: We declare that the code used in this study is open-source and publicly available for unrestricted use. The code used in this research can be accessed via the link [https://github.com/bianshuai001/NL-CS-Net](https://github.com/bianshuai001/NL-CS-Net). Anyone can retrieve, download, and use the code for non-commercial purposes, subject to appropriate attribution of the source.

2309.02852

CelticGraph: Drawing Graphs as Celtic Knots and Links

Celtic knots are an ancient art form often attributed to Celtic cultures, used to decorate monuments and manuscripts, and to symbolise eternity and interconnectedness. This paper describes the framework CelticGraph to draw graphs as Celtic knots and links. The drawing process raises interesting combinatorial concepts in the theory of circuits in planar graphs. Further, CelticGraph uses a novel algorithm to represent edges as B\'ezier curves, aiming to show each link as a smooth curve with limited curvature.

Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber

2023-09-06T09:25:40Z

http://arxiv.org/abs/2309.02852v2

# CelticGraph: Drawing Graphs as Celtic Knots and Links ###### Abstract Celtic knots are an ancient art form often attributed to Celtic cultures, used to decorate monuments and manuscripts, and to symbolise eternity and interconnectedness. This paper describes the framework CelticGraph to draw graphs as Celtic knots and links. The drawing process raises interesting combinatorial concepts in the theory of circuits in planar graphs. Further, CelticGraph uses a novel algorithm to represent edges as Bezier curves, aiming to show each link as a smooth curve with limited curvature. Keywords:Celtic Art, Knot Theory, Interactive Interfaces ## 1 Introduction Celtic knots are an ancient art form often attributed to Celtic cultures. These elaborate designs (also called "endless knots") were used to decorate monuments and manuscripts, and they were often used to symbolise eternity and interconnectedness. Celtic knots are a well-known visual representation made up of a variety of interlaced knots, lines, and stylised graphical representations. The patterns often form continuous loops with no beginning or end (knot) or a set of such loops (links). In this paper we will use the Celtic knot visualisation metaphor to represent specific graphs in the form of "knot diagrams". We show how to draw a 4-regular planar graph6 as a knot/link diagram. This involves constructing certain circuits7 in the 4-regular planar graph. Further, we show how to route graph edges so that the underlying links are aesthetically pleasing. This involves some optimisation problems for cubic Bezier curves. We also provide an implementation of the presented methods as an add-on for Vanted[24]. This system allows to transform a graph into a knot (link) representation and to interactively change the layout of both, the graph as well as the knot. In addition, knots can be exported to the 3D renderer Blender[4] to allow for artistic 3D renderings of the knot. Figure 1 shows a 4-regular planar graph, its knot representation and a rendering of the knot. Footnote 6: Graphs used in this paper can contain multiple edges and loops (also called pseudographs or multigraphs). Footnote 7: For the formal definition of a circuit see Sect. 4 ## 2 Background This paper has its roots in three disciplines: Mathematical knot theory, Celtic cultural history, and graph drawing. We briefly review the relevant parts of these diverse fields in Sect. 2.1, 2.2, and 2.3. Further, in Sect. 2.4 we review relevant properties of Bezier curves, which are a key ingredient to CelticGraph. ### Knot theory The mathematical theory of knots and links investigates interlacing curves in three dimensions; this theory has a long and distinguished history in Mathematics [23]. The motivating problem of Knot Theory is _equivalence_: whether two knots can be deformed into each other. A common technique involves projecting the given curves from three dimensions into the plane; the resulting "knot diagram" is a 4-regular planar graph, with vertices at the points where the curve crosses itself (in the projection). For example, a picture of the _trefoil knot_ and its knot diagram are in Fig. 2. Properties of a knot or link may be deduced from the knot diagram, and the equivalence problem can sometimes be solved using knot diagrams. ### Celtic art Knot patterns ("Celtic knots") are often described as a characteristic ornament of so-called "Celtic art". In fact, since the epoch of the Waldalgesheim style (\(4^{\text{th}}/3^{\text{rd}}\) century BC), Celtic art (resp. ornamentation) is characterised by complex, often geometric patterns of interlinked, opposing or interwoven discs, loops and spirals. The floral models originate from Mediterranean art; in the Celtic context, they were deconstructed, abstracted, arranged partactically or intertwined [33, 36]. It is still unclear whether the import of Mediterranean ornamental models was accompanied by the adoption of their meaning. However, the selective reception of only certain motifs suggests rather an adaptation based on specific Celtic ideas, which we cannot reconstruct exactly due to a lack of written sources. In today's popular understanding, a special role in the transmission of actual or supposed "Celtic" art is attributed to the early medieval art of Ireland [28, 38]. However, such a restriction of Irish or insular art to exclusively Celtic origins would ignore the historical development of the insular-Celtic context in Ireland and the British Isles. The early medieval art of Ireland is partially rooted in indigenous Celtic traditions, but was also shaped by Late Antique Roman, Germanic and Anglo-Saxon, Viking and Mediterranean-Oriental models [17]. The knot and tendril patterns of the 7\({}^{\text{th}}\)/8\({}^{\text{th}}\) century can also be traced back to Mediterranean-Oriental manuscripts. Such patterns were subsequently used in Anglo-Saxon art, transmitted by braided ribbon ornaments and other patterns in the Germanic "Tierstil" (e. g. on Late Antique soldiers' belts). For example, the famous Tara Brooch created in Ireland in the late 7\({}^{\text{th}}\) or early 8\({}^{\text{th}}\) century features both native and Germanic a combination of corresponding motifs [39]. Also the knot patterns and braided/spiral ornaments described as typical "Celtic" such as in the Book of Kells [30] and other manuscripts can be linked to Germanic/Anglo-Saxon and late Roman traditions. The ornamentation today often perceived as "Celtic" is therefore less exclusive or typical "Celtic", but rather a result of diverse influences that reflect an equally complex historical-political development [29]. So it is not surprising that the so-called Celtic motifs often presented in tattoo studios of the 21st century, such as braided bands, are not of Celtic but Germanic origin [34]. Note that while "Celtic knots" are related to the mathematical theory of knots, the prime motivation of the two topics is different. For example, the _Bowen knot_[7], a commonly used decorative knot that appears in Celtic cultures, is uninteresting in the mathematical sense (it is clearly an "unknot"). ### Graph drawing as art Note that the purpose of CelticGraph is different from most Graph Drawing systems. Our aim is to produce decorative and artistically pleasing pictures of graphs, not to make pictures of graphs that effectively convey information and insight into data sets. Other examples of such kind of graph drawing approaches Figure 2: _(a) The trefoil knot and (b) its resulting “knot diagram”._ include the system by Devroye and Kruszewski to render images of botanical trees based on random binary trees [8], a system GDot-i for drawing graphs as dot paintings inspired by the dot painting style of Central Australia [11; 21], and research on bobbin laoverk [22]. Also related to our work are Lombardi graph drawings, artistic representations of graphs that contain edges represented as circular arcs and vertices represented with perfect angular resolution [10]. ### Bezier curves The Gestalt law of continuity [27] implies that humans are more likely to follow continuous and smooth lines rather than broken or jagged lines. To draw graphs as Celtic knots, certain circuits in the graph need to be drawn as smooth curves. Computer Graphics has developed many models for smooth curves; one of the simplest is a _Bezier curve_. A _cubic Bezier curve_ with control points \(p_{0},p_{1},p_{2},p_{3}\) is defined parametrically by: \[p(t)=(1-t)^{3}p_{0}+3(1-t)^{2}tp_{1}+3(1-t)t^{2}p_{2}+t^{3}p_{3}, \tag{1}\] for \(0\leq t\leq 1\). The following properties of cubic Bezier curves are well-known [16]: * The endpoints of the curve are the first and last control points, that is, \(p(0)=p_{0}\) and \(p(1)=p_{3}\). * Every point on the curve lies within the convex hull of its control points. * The line segments \((p_{0},p_{1})\) and \((p_{3},p_{2})\) are tangent to the curve at \(p_{0}\) and \(p_{3}\) respectively. We say \((p_{0},p_{1})\) and \((p_{3},p_{2})\) are _control tangents_ of the curve. * The curve is \(C^{k}\)_smooth_ for all \(k>0\), that is, all the derivatives are continuous. Drawing each edge of a graph as a cubic Bezier curve ensures smoothness in the edges, and can improve readability [41]. However, for CelticGraph we need certain _circuits_ in the graph to be smooth curves, so we need the curves representing certain incident edges to be _joined smoothly_. Suppose that \(p(t)\) and \(q(t)\) are two cubic Bezier curves that meet at a common endpoint. Then the curve formed by joining \(p(t)\) and \(q(t)\) is \(C^{1}\) smooth as long as the control tangents to each curve at the common endpoint form a straight line; see Fig.3. Mathematically, \(C^{1}\) smoothness is adequate. However, the infinitesimality of Mathematics sometimes does not model human perception well. For example, the Figure 3: _Two cubic Bézier curves with control points \(p_{0},p_{1},p_{2},p_{3}\) and \(q_{0},q_{1},q_{2},q_{3}\), meeting at the point \(p_{3}=q_{0}\). The control tangents are shown in black; note that the points \(p_{2},p_{3},q_{1}\) lie on a straight line and the join is \(C_{1}\) and visually smooth._ curve in Fig. 4 is mathematically smooth, but given a fixed-resolution screen and the limits of human perception, it appears to have a non-differentiable "kink". For this reason, it is desirable that the _curvature_[13] of each edge is not too large. Informally, the curvature \(\kappa(t)\) is the "sharpness" of the curve. More formally, \(\kappa(t)\) is the inverse of the radius of the largest circle that can sit on the curve at \(p(t)\) without crossing the curve. For a cubic Bezier curve \(p(t)=(x(t),y(t))\), the curvature at \(p(t)\) is given by [16]: \[\kappa(t)=\frac{|\dot{x}\ddot{y}-\ddot{x}\dot{y}|}{\left(\dot{x}^{2}+\dot{y}^{2 }\right)^{1.5}}, \tag{2}\] where \(\dot{f}\) denotes the derivative of \(f\) with respect to \(t\). Note that \(\kappa(t)\) is continuous except for values of \(t\) where both \(\dot{x}(t)\) and \(\dot{y}(t)\) are zero. For CelticGraph, we need \(C^{1}\) smooth curves with reasonably small curvature. ### Related Work #### 2.5.1 Knot diagrams as Lombardi graph drawings Closely related are Lombardi graph drawings which are graph drawings with circular-arc edges and perfect angular resolution [10]. Previous studies have demonstrated that a significant group of 4-regular planar graphs can be represented as plane Lombardi graph drawings [25]. However, there are certain restrictions. Notably, if a planar graph contains a loop, it cannot be depicted as a Lombardi drawing. In our approach, every 4-regular planar graph can be transformed in a knot (links). #### 2.5.2 Celtic knots by tiling and algorithmic design methods Celtic knots can be created using tiling and algorithmic design methods. George Bain introduced a formal method for creating Celtic knot patterns [2], which subsequently has been simplified to a three-grid system by Iain Bain [3, 18]. Klempien-Hinrichs and von Totth study the generation of Celtic knots using collage grammars [26]. And Even-Zohar et al. investigate sets of planar curves which yield diagrams for all knots [12]. None of those methods use graphs or are graph drawing approaches. #### 2.5.3 Drawing graphs with Bezier curve edges A number of network visualisation systems use Bezier curves as edges. These include yWorks[42], GraphViz[20], Vanted[24], Vizaj[37], and the framework proposed in [19]. In many cases, such systems allow the user to route the curves by adjusting control points, but few provide automatic computation of the curves. However, there are some Figure 4: _A cubic Bezier curve with a “kink”, i. e. a point of large curvature, near the middle. The curve is \(C^{1}\) smooth; but the kink, together with the limits of human perception and screen resolution, mean that the curve does not look smooth._ exceptions. For example, in the GraphViz system, Bezier curve edges are routed within polygons to avoid edge crossings [1]. Force-directed methods are also popular for computing control points of Bezier curve edges [6, 14, 15]. Brandes et al. present a similar method to the "cross" method in Sect. 5, applied to transport networks [5]. However, only [14] considers smoothness in more than one edge. None of those systems or approaches consider Celtic knots. ## 3 Overview of the CelticGraph process In this Section we outline CelticGraph, our framework for creating aesthetically pleasing pictures of 4-regular planar graphs as knots. The CelticGraph procedure is shown in Fig. 5; it has 5 steps: 1. Create a topological embedding \(G^{\prime}\) of the input 4-regular planar graph \(G\). 2. Create a planar straight-line drawing \(D\) of the plane graph \(G^{\prime}\). 3. Create a special circuit partition of \(G^{\prime}\), called a "threaded circuit partition". 4. Using the straight-line drawing \(D\) and the threaded circuit partition \(C\), create a drawing \(D^{\prime}\) of \(G\) with cubic Bezier curves as edges. 5. Render the drawing \(D^{\prime}\) as a knot, on the screen or with a 3D printer. The first two steps can be done using standard Graph Drawing methods [9]. Steps (c) and (d) are described in the following Sections, step (e) can be done using standard rendering methods. ## 4 Step (c): Finding the threaded circuit partition Here we define _threaded circuit partition_, a special kind of circuit partition of a plane graph, and show how to find it in linear time. A _circuit_ in a graph \(G\) is a list of distinct edges \((e_{0},e_{1},\ldots,e_{k-1})\) such that \(e_{i}\) and \(e_{i+1}\) share a vertex \(i=0,1,\ldots,k-1\) (here, and in the remainder of this paper, indices in a circuit of length \(k\) are taken modulo \(k\).) We can write the circuit as a list of vertices \((u_{0},u_{1},\ldots,u_{k-1})\) where \(e_{i}=(u_{i},u_{i+1})\). Note that a vertex can appear more than once in a circuit, but an edge cannot. A set \(C=\{c_{0},c_{1},\ldots,c_{h-1}\}\) of circuits in a graph \(G\) such that every edge of \(G\) is in Figure 5: _The CelticGraph process_ exactly one \(c_{j}\) is a _circuit partition_ for \(G\). Given a circuit partition, we can regard \(G\) as a directed graph by directing each edge so that each \(c_{i}\) is a directed circuit. A path \((\alpha,\beta,\gamma)\) of length two (that is, two edges \((\alpha,\beta)\) and \((\beta,\gamma)\)) in a 4-regular plane graph \(G\) is a _thread_ if edges \((\alpha,\beta)\) and \((\beta,\gamma)\) are not contiguous in the cyclic order of edges around \(\beta\). This means that there is an edge between \((\alpha,\beta)\) and \((\beta,\gamma)\) in both counterclockwise and clockwise directions in the circular order of edges around \(\beta\). We say that \(\beta\) is the _midpoint_ of the thread \((\alpha,\beta,\gamma)\). Note that each vertex in \(G\) is the midpoint of two threads; see Fig. 6(a). For every edge \((\alpha,\beta)\) in \(G\), there is a unique thread \((\alpha,\beta,\gamma)\); we say that the edge \((\beta,\gamma)\) is the _next edge after \((\alpha,\beta)\)_. For each vertex \(u_{j}\) on a circuit \(c=(u_{0},u_{1},\ldots,u_{k-1})\) with \(k>1\) there is a path \(p_{j}=(u_{j-1},u_{j},u_{j+1})\) of length two such that \(u_{j}\) is the midpoint of \(p_{j}\). In fact we can consider that the circuit \(c\) consists of \(k\) paths of length two. We say that the circuit \(c\) is _threaded_ if for each \(j\), the path \(p_{j}=(u_{j-1},u_{j},u_{j+1})\) is a thread. Note that in such a circuit, the edge \((u_{j},u_{j+1})\) is the (unique) next edge after \((u_{j-1},u_{j})\) for each \(j\). A circuit partition \(C=\{c_{0},c_{1},\ldots,c_{h-1}\}\) is _threaded_ if each circuit \(c_{j}\) is threaded. In the case that \(h=1\), a threaded circuit partition defines a _threaded Euler circuit_; see Fig. 6(b). An assignment \(\upsilon(p)\in\{-1,+1\}\) of an integer \(-1\) or \(+1\) to each thread \(p\) of a 4-regular plane graph \(G\) is an _under-over assignment_. Note that for each vertex \(\beta\) of \(G\), there are two threads \(p_{\beta}\) and \(p_{\beta}^{\prime}\) with midpoint \(\beta\). We say that an under-over assignment \(\upsilon\) is _consistent_ if \(\upsilon(p_{\beta})=-\upsilon(p_{\beta}^{\prime})\) for each vertex \(\beta\). An under-over assignment \(\upsilon\) is _alternating_ on the circuit \((p_{0},p_{1},\ldots,p_{k-1})\) if \(\upsilon(p_{i})=-\upsilon(p_{i+1})\) for each \(i\). An under-over assignment for a graph with a threaded circuit partition \(C\) is _alternating_ if it is alternating on each circuit in \(C\). Intuitively, a consistent under-over assignment designates which thread passes under or over which thread, and an alternating under-over assignment corresponds to an alternating knot or link [31]. The following theorem gives the essential properties of threaded circuit partitions that are essential for CelticGraph. Theorem 4.1: _Every 4-regular plane graph has a unique threaded circuit partition, and this threaded circuit partition has a consistent alternating under-over assignment. Further, this threaded circuit partition can be found in linear time._ Figure 6: _(a) Two threads, each with midpoint \(\beta\). (b) Plane 4-regular graph with a threaded Euler circuit \((0,1,2,3,4,0,5,6,3,7,1,5,8,4,7,2,6,8)\)._ Proof: The existence and uniqueness of the threaded circuit partition follows from the fact that every edge has a unique next edge. A simple linear-time algorithm to find the threaded circuit partition is to repeatedly choose an edge \(e\) that is not currently in a circuit, then repeatedly choose the next edge after \(e\) until we return to \(e\). We can direct every edge of a \(4\)-regular planar graph \(G\) so that each circuit in a given threaded circuit partition \(C\) is a directed circuit. This means that we can sensibly define the "left" and "right" faces of an edge. Since a \(4\)-regular plane graph is bridgeless [35], no face is both "left" and "right". Since the planar dual graph of a \(4\)-regular planar graph is bipartite [35], the faces can be coloured _green_ and _blue_, such that no two faces of the same colour share an edge, see Fig. 7. An immediate consequence is that the sequence of left faces to (directed) edges in a threaded circuit _alternate_ in colour. Now consider a thread \((\alpha,\beta,\gamma)\) in a (directed) threaded circuit in a threaded circuit partition. If the face to the left of \((\alpha,\beta)\) is green, then assign \(+1\) to the path \((\alpha,\beta,\gamma)\); otherwise assign \(-1\) to \((\alpha,\beta,\gamma)\). Note that the face to the left of \((\beta,\gamma)\) is the opposite colour of the face to the left of \((\alpha,\beta)\), and so the under-over assignment is alternating. Further it is consistent, since at each vertex there is precisely one incoming arc with a green face on the left, and precisely one incoming arc with a blue face on the left. #### 4.2.2 Threaded Euler circuits Celtic knots are sometimes called "endless knots", and can be used to symbolise eternity. For this reason, a threaded _Euler_ circuit is desirable; such a circuit gives a drawing of the graph as a knot rather than a link. Using the algorithms in the proof of Theorem 3.1, one can test whether a given plane graph has a threaded Euler circuit in linear time. Note that different topological embeddings of a given planar graph may have different threaded circuit partitions; see Fig. 8. It is clear that, in some cases, we can increase the Figure 7: _(a) Two threads: \((\alpha,\beta,\gamma)\) has under-over assignment \(+1\) (since the face to the left of \((\alpha,\beta)\) is green), and \((\alpha^{\prime},\beta,\gamma^{\prime})\) has under-over assignment \(-1\) (since the face to the left of \((\alpha^{\prime},\beta)\) is blue). (b) The faces of the graph are coloured according to its bipartition; note that each vertex has two incoming edges: one has a blue face to the left, the other has a green face to the left, and that the faces on the left of the threaded Euler circuit alternate in colour._ length of a threaded circuit by changing the embedding. It is tempting to try to find a method to adjust the embedding to get a threaded Euler circuit. However, it can be shown that changing the embedding cannot change the _number_ of threaded circuits in a threaded circuit partition; see Appendix 0.A. ## 5 Step (d): Smooth knot drawing with Bezier curves Step (d) takes a straight-line drawing \(D\) of the input graph \(G\), and replaces the straight-line edges by cubic Bezier curves in a way that ensures that each circuit in the threaded circuit partition found in step (c) is smooth. A central concept for the smooth drawing method is a "cross" \(\chi_{u}\) at each vertex \(u\). For each \(u\), \(\chi_{u}\) consists of 4 line segments called "arms". The four arms are all at right angles to each other, leading to a perfect angular resolution. Each arm of \(\chi_{u}\) has an endpoint at \(u\). This is illustrated in Fig. 9(a). Each edge \((u,v)\) then is drawn as a cubic Bezier curve with endpoints \(u\) and \(v\), and the control tangents of the curve are arms of the crosses \(\chi_{u}\) and \(\chi_{v}\) (illustrated in Fig. 9(b)). For this approach, we need to choose three parameters for each cross \(\chi_{u}\): 1. The mapping between the four arms of \(\chi_{u}\) and the four edges incident to \(u\) Figure 8: Two topological embeddings of a planar graph. In (a), the plane graph has a threaded circuit partition of 4 circuits, with two circuits of size 6 (in black) and two circuits of size 12 (in blue and orange). In (b), the plane graph still has 4 threaded circuits: the two of size 6 are unchanged, but the lengths of the blue and orange circuits are 14 and 10 respectively. Figure 9: (a) The 3-prism with a cross at each vertex. (b) Edges drawn as Bezier curves, using the arms of the crosses as control tangents. 2. The angle of orientation of the cross. 3. The length of each arm of the cross. These parameters are discussed in the next subsections. The methods described in Sect. 5.1 and 5.2 are analogous to the methods in [5]; Sect. 5.3 is not. ### The edge-arm mapping Suppose that \(u\) is a vertex in the straight-line drawing \(D\) of the input plane graph. We want to choose the mapping between the arms of the cross \(\chi_{u}\) and the edges incident with \(u\) so that the arms are approximately in line with the edges. Now suppose that the edges incident with \(u\) are \(e_{0},e_{1},e_{2},e_{3}\) in counterclockwise order around \(u\). For each \(i=0,1,2,3\) we choose an arm \(\alpha_{i}\) of the cross \(\chi_{u}\) corresponding to \(e_{i}\) so that the counterclockwise order of arms around \(u\) is the same as the order of edges around \(u\); that is, the counterclockwise order of arms is \(\alpha_{0},\alpha_{1},\alpha_{2},\alpha_{3}\). Note that this method separates multi-edges. ### The orientation of the cross To improve the alignment of the arms of the crosses with the edges, we rotate each cross. Suppose that the counterclockwise angle that edge \(e_{i}\) makes with the horizontal direction is \(\phi_{i}\). We want to rotate the cross by an angle \(\theta\) to align with the edges, as best as possible. This is illustrated in Fig. 10. Consider the sum of squares error in rotating by \(\theta\); this is: \[f(\theta)=\sum_{i=0}^{i=3}\left(\theta+\frac{i\pi}{2}-\phi_{i}\right)^{2}. \tag{3}\] To minimise \(f(\theta)\), we solve \(f^{\prime}(\theta)=0\) and choose the optimum value: \[\theta^{*}=\frac{1}{4}\left(\sum_{i=0}^{i=3}\phi_{i}\right)-\frac{3\pi}{4}. \tag{4}\] Figure 10: _A cross rotated by an angle of \(\theta\). Here the cross is in blue, the edges of the graph are in orange._ In Fig. 11, we show a graph with crosses oriented by this method. ### Arm length Note that the "apparent smoothness" of an edge depends on its curvature. We illustrate this with Fig. 12, which shows three Bezier curve drawings of the 3-prism. This graph has 3 threaded circuits, and we want to draw it so that each one of these threaded circuits appears as a smooth curve with limited curvature. In Fig. 12(a), the arms of the crosses are all very short, resulting in a Bezier curve drawing which is very close to a straight-line drawing. Each edge has low curvature in the middle and high curvature around the endpoints. The high curvature near their endpoints results in a lack of apparent smoothness where two Bezier curves join (at the vertices); it is difficult to discern the three threaded circuits. The arms of the crosses are longer in Fig. 12(b), resulting in better curvature at the endpoints. However, here each of the edges \((0,3),(1,4)\), and \((2,5)\) have two points of large curvature; this is undesirable. In Fig. 12(c), the arms of the crosses are longer still. Each of the edges \((0,3),(1,4)\), and \((2,5)\) again have two points of large curvature, but the edges \((3,4),(4,5)\), and \((5,3)\) are worse: each has a "kink" (a point of very high curvature, despite being \(C^{1}\)-smooth). Figure 11: A graph with crosses oriented to align with edges as much as possible before (a) and after (b) applying the algorithm, and shown in _Vanted (c)_. Figure 12: Three drawings of the 3-prism, differing in edge curvature. Next we describe three approaches to choosing the lengths of the arms of the crosses, aiming to give sufficiently small curvature. #### 4.1.1 Uniform arm lengths The curvature of the edge varies with lengths of the arms, and we want to ensure that the maximum curvature in each edge is not too large. The simplest approach is to use _uniform arm lengths_, that is, judiciously choose a global value \(\lambda\) and set the length of every arm length to \(\lambda\). The drawings of the 3-prism in Fig. 12 have uniform arm lengths: \(\lambda\) in Fig. 12(a) is quite small, in Fig. 12(c) it is relatively large, and (b) is in between. In fact, the problem with the uniform arm length approach is typified in Fig. 12: if \(\lambda\) is small, the curvature is high near the endpoints for all edges, and increasing \(\lambda\) increases the curvature away from the endpoints, especially in the shorter edges. There is no uniform value of \(\lambda\) that gives good curvature in both short and long edges. #### 4.1.2 Uniformly proportional arm lengths An approach that aims to overcome the problems of uniform arm length is to use _uniformly proportional arm lengths_: we judiciously choose a global value \(\alpha\), and then set the lengths of the two arms for edge \((u,v)\) to \(\alpha d(u,v)\), where \(d(u,v)\) is the Euclidean distance between \(u\) and \(v\). Fig. 13 shows typical results for the uniformly proportional approach. For \(\alpha=0.2\) the drawing is similar to Fig. 13(a), and has similar problems. But for values of \(\alpha\) near \(0.5\) (Fig. 13(b) and (c)), we have acceptable results; in particular, the shorter edges have acceptable curvature. #### 4.1.3 Optimal arm lengths A third approach is to choose the arm lengths at each end of an edge \((u,v)\) to minimise maximum curvature, as follows. Suppose \(\kappa(t,\lambda_{u},\lambda_{v})\) is the curvature of the edge \((u,v)\) at point \(t\) on the curve, when the arm lengths are \(\lambda_{u}\) and \(\lambda_{v}\) at \(u\) and \(v\) respectively. From Equation (2), we note that \[\frac{\partial}{\partial t}\kappa(t,\lambda_{u},\lambda_{v})=\left|\frac{ \dddot{x}\dot{y}-\dddot{y}\dot{x}}{(\dot{x}^{2}+\dot{y}^{2})^{1.5}}-\frac{ \ddot{x}\dot{y}-\ddot{y}\dot{x}}{3(\ddot{x}+\ddot{y})^{2.5}}\right| \tag{5}\] as long as \((\dot{x}^{2}+\dot{y}^{2})\neq 0\) and \(\ddot{x}\dot{y}\neq\ddot{y}\dot{x}\). Since both \(x\) and \(y\) are cubic functions of \(t\), equation (5) is not as complex as it seems, and it is straightforward (but Figure 13: _The uniformly proportional approach: (a) \(\alpha=0.2\); (b) \(\alpha=0.4\); (c) \(\alpha=0.6\)._ tedious, because of the edge cases) to maximise \(\kappa(t,\lambda_{u},\lambda_{v})\) over \(t\); that is, to find the maximum curvature \(\kappa^{*}(\lambda_{u},\lambda_{v})\): \[\kappa^{*}(\lambda_{u},\lambda_{v})=\max_{0\leq t\leq 1}\kappa(t,\lambda_{u}, \lambda_{v}).\] Now we want to choose the arm lengths \(\lambda_{u}\) and \(\lambda_{v}\) to minimise \(\kappa^{*}(\lambda_{u},\lambda_{v})\). Suppose that the unit vectors in the directions of the appropriate arms of \(\chi_{u}\) and \(\chi_{v}\) are \(\iota_{u}\) and \(\iota_{v}\) respectively. Note that we can express the internal control points \(p_{1}\) and \(p_{2}\) of the Bezier curve in terms of \(\lambda_{u}\) and \(\lambda_{v}\): \[p_{1}=(1-\lambda_{u})u+\lambda_{u}\iota_{u},\ \ p_{2}=(1-\lambda_{v})v+ \lambda_{v}\iota_{v}.\] In this way, \(\kappa^{*}(\lambda_{u},\lambda_{v})\) is linear in both \(\lambda_{u}\) and \(\lambda_{v}\) and finding a minimum point for \(\kappa^{*}(\lambda_{u},\lambda_{v})\) is straightforward. However, in some cases, an edge with globally minimum maximum curvature may not be desirable. In Fig. 14, for example, the curvature decreases as \(\lambda_{u}\) and \(\lambda_{v}\) increase; for large values of \(\lambda_{u}\) and \(\lambda_{v}\) the curvature is quite low. The problem is that these large values make the curve very long (it "balloons" out), which might also cause unintended edge crossings. For this reason, we choose an upper bounds \(\epsilon_{u}\) and \(\epsilon_{v}\) and take a minimum constrained by \(\lambda_{u}\leq\epsilon_{u}\) and \(\lambda_{v}\leq\epsilon_{v}\): \[\kappa^{*}_{\min}=\min_{0\leq\lambda_{u}\leq\epsilon_{u},0\leq \lambda_{v}\leq\epsilon_{v}}\kappa^{*}(\lambda_{u},\lambda_{v}).\] We have found that \(\epsilon_{u}=\epsilon_{v}=0.75d(u,v)\) gives good results, where \(d(u,v)\) is the distance between \(u\) and \(v\). Values of \(\lambda_{u}\) and \(\lambda_{v}\) that achieve the (constrained) minimum \(\kappa^{*}_{\min}\) are then used by the Bezier curves. In practice, using such optimal arm lengths gives better results than using uniformly proportional arm lengths. In some cases the difference is not significant, but in others the optimal edges appear to be much smoother. See Fig. 15 for examples. Figure 14: _“Ballooning” curves: as \(\lambda_{u}\) and \(\lambda_{v}\) increase, curvature falls but the curve becomes very long._ ## 6 CelticGraph implementation as a Vanted add-on and rendering CelticGraph has been implemented as an add-on of Vanted, a tool for interactive visualisation and analysis of networks. Figure 1 shows an example workflow; the first step is implemented as Vanted[24] add-on, the second is done by Blender [4]. Vanted allows a user to load or create 4-regular graphs, either by importing from files (e. g. a.gml file), by selecting from examples, or by creating a new graph by hand. The individual vertices of the graph are then mapped into the data structure of a cross, containing position and the rotation and control points of the to-be-generated Bezier curves. The graph is translated into a knot (link) using the methods for optimal cross rotation and arm length computation described in the previous sections. Vertex positions can be interactively changed, either by interacting with the underlying graph, or by interacting directly with the visualisation of the knot. Once a visualisation satisfies the expectation of the user, the Bezier curves can be exported for further use in Blender. We implemented a Python script and a geometry node tree in Blender which allows importing the information into Blender and rendering the knot (links), either using a set of predefined media or interactively; the script can also run as batch process with selected parameters and media. Figure 16 shows examples of Celtic knot renderings in different media such as in metal, in stone, with additional decoration and so on; knots can be also printed in 3D. More examples can be found in the gallery of our web page [http://celticknots.online](http://celticknots.online) which also provides the Vanted add-on, Blender file and a short manual. ## Acknowledgements Partly funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - Project-ID 251654672 - TRR 161. Figure 15: _Comparison of proportional arm length (blue) and optimal arm length (magenta): (a) Trefoil; (b) \(K_{4}\) knot; (c) 3-prism; (d) Love knot._ Figure 16: Examples of Celtic knot renderings in different media including a 3D printed version (mid left).

2305.15023

Cheap and Quick: Efficient Vision-Language Instruction Tuning for Large Language Models

Recently, growing interest has been aroused in extending the multimodal capability of large language models (LLMs), e.g., vision-language (VL) learning, which is regarded as the next milestone of artificial general intelligence. However, existing solutions are prohibitively expensive, which not only need to optimize excessive parameters, but also require another large-scale pre-training before VL instruction tuning. In this paper, we propose a novel and affordable solution for the effective VL adaption of LLMs, called Mixture-of-Modality Adaptation (MMA). Instead of using large neural networks to connect the image encoder and LLM, MMA adopts lightweight modules, i.e., adapters, to bridge the gap between LLMs and VL tasks, which also enables the joint optimization of the image and language models. Meanwhile, MMA is also equipped with a routing algorithm to help LLMs achieve an automatic shift between single- and multi-modal instructions without compromising their ability of natural language understanding. To validate MMA, we apply it to a recent LLM called LLaMA and term this formed large vision-language instructed model as LaVIN. To validate MMA and LaVIN, we conduct extensive experiments under two setups, namely multimodal science question answering and multimodal dialogue. The experimental results not only demonstrate the competitive performance and the superior training efficiency of LaVIN than existing multimodal LLMs, but also confirm its great potential as a general-purpose chatbot. More importantly, the actual expenditure of LaVIN is extremely cheap, e.g., only 1.4 training hours with 3.8M trainable parameters, greatly confirming the effectiveness of MMA. Our project is released at https://luogen1996.github.io/lavin.

Gen Luo, Yiyi Zhou, Tianhe Ren, Shengxin Chen, Xiaoshuai Sun, Rongrong Ji

2023-05-24T11:06:15Z

http://arxiv.org/abs/2305.15023v3

# Cheap and Quick: Efficient Vision-Language Instruction Tuning for Large Language Models ###### Abstract Recently, growing interest has been aroused in extending the multimodal capability of large language models (LLMs), _e.g._, vision-language (VL) learning, which is regarded as the next milestone of artificial general intelligence. However, existing solutions are prohibitively expensive, which not only need to optimize excessive parameters, but also require another large-scale pre-training before VL instruction tuning. In this paper, we propose a novel and affordable solution for the effective VL adaption of LLMs, called _Mixure-of-Modality Adaptation_ (MMA). Instead of using large neural networks to connect the image encoder and LLM, MMA adopts lightweight modules, _i.e._, adapters, to bridge the gap between LLMs and VL tasks, which also enables the joint optimization of the image and language models. Meanwhile, MMA is also equipped with a routing algorithm to help LLMs achieve an automatic shift between single- and multi-modal instructions without compromising their ability of natural language understanding. To validate MMA, we apply it to a recent LLM called LLaMA and term this formed _large vision-language **in**structed_ model as LaVIN. To validate MMA and LaVIN, we conduct extensive experiments under two setups, namely _multimodal science question answering_ and _multimodal dialogue_. The experimental results not only demonstrate the competitive performance and the superior training efficiency of LaVIN than existing multimodal LLMs, but also confirm its great potential as a general-purpose chatbot. More importantly, the actual expenditure of LaVIN is extremely cheap, _e.g._, only **1.4 training hours** with 3.8M trainable parameters, greatly confirming the effectiveness of MMA. Our project is released at [https://luogen1996.github.io/lavin](https://luogen1996.github.io/lavin). ## 1 Introduction In recent years, large language models (LLMs) [3; 31; 5; 46; 32] have continuously pushed the upper limit of natural language understanding with ever increasing parameter sizes and pre-training data scales. The introduction of _instruction tuning_[25; 26; 29] also enables LLMs to engage in human-like conversations and handle various natural language processing (NLP) tasks [24; 38; 39], approaching artificial general intelligence, _e.g._, GPT-3.5 [27]. The next milestone is often regarded to extend these LLMs with multimodal capabilities, _e.g._, vision-language (VL) learning, making LLMs applicable to more real-world application scenarios. Such a target has been recently realized by GPT-4 [28], which adopts a large-scale vision-language corpus to directly train a multimodal GPT. However, the training regime of GPT-4 [28] is prohibitively expensive, and recent endeavors [43, 44, 35, 15, 18, 1, 8, 49, 4] are still keen to efficient VL adaptions of LLMs. As shown in Fig. 1, the existing multimodal solutions for LLMs can be roughly divided into two main categories, _i.e.,_ the _expert system_ and the _modular training_ ones, respectively. In the expert system solution [43, 44, 35], LLMs usually serve as a manager to interpret different natural language instructions, and then call the corresponding vision models to handle the input image, _e.g.,_ image captioning [16], visual question answering [16] or text-to-image generation [33]. The advantage of this solution is that it does not require the re-training of LLMs and can make full use of existing vision models. However, the ensemble of LLMs and various vision models still exhibits significant redundancy in terms of computation and parameters, leading to excessive memory footprints. Meanwhile, the joint optimization of LLMs and vision models is still an obstacle. In this case, increasing attention has been paid to the modular training of LLMs [15, 18, 49, 13, 49]. As illustrated in Fig. 1, this paradigm often requires LLMs to deploy an additional neck branch to connect the visual encoders, and then performs another pre-training on numerous image-text pairs for cross-modal alignment. Afterwards, the neck branch and LLM are jointly tuned via VL instructions. Despite the effectiveness, the required VL pre-training is still expensive for a quick adaptation of LLMs. For instance, the pre-training of BLIP2 [15] consumes more than 100 GPU hours on 129 millions of image-text pairs. In addition, this paradigm often requires to update most parameters of LLM, limiting the efficiency of VL instruction tuning. For example, LLaVA-13B [18] fully fine-tunes the entire LLM during VL instruction tuning, resulting in significant increases in training time and intermediate storage overhead2. More importantly, these fine-tune schemes will inevitably undermine the NLP capabilities of LLMs due to the drastic changes in their parameter spaces. For instance, the existing multimodal LLMs, such as BLIP2 [15] and miniGPT4 [49], do not support text-only instructions, greatly hindering their applications. Footnote 2: The checkpoints are often stored during training, and each of them takes up 26GB for storage. In this paper, we propose a novel and efficient solution for vision-language instruction tuning, termed _Mixture-of-Modality Adaptation_ (MMA). Different from existing _modular training_ scheme [15, 18], MMA is an end-to-end optimization regime. By connecting the image encoder and LLM with lightweight adapters, MMA can jointly optimize the entire multimodal LLM via a small number of parameters, saving more than thousands times of storage overhead compared with existing solutions [18, 49, 15]. To obtain a quick shift between text-only and image-text instructions, MMA equips the inserted adapters with a routing scheme, which can dynamically choose the suitable adaptation path for the inputs of different modalities, thereby well preserving the NLP capability of LLMs. To validate MMA, we apply it to a recently proposed LLM called LLaMA [37], and term this new _large vision-language instructed_ model as LaVIN. With the help of MMA, LaVIN can achieve cheap and quick adaptations on VL tasks without the requirement of another large-scale pre-training. To validate LaVIN, we first conduct quantitative experiments on ScienceQA [21]. Experimental results show that LaVIN can achieve on-par performance with the advanced multimodal LLMs, _e.g.,_ LLaVA [18], while reducing up to 71.4% training time and 99.9% storage costs. Notably, fine-tuning Figure 1: Comparison of different multimodal adaptation schemes for LLMs. In the expert system, LLMs play a role of controller, while the ensemble of LLM and vision models is expensive in terms of computation and storage overhead. The modular training regime (b) requires an additional large neck branch and another large-scale pre-training for cross-modal alignment, which is inefficient in training and performs worse in previous NLP tasks. In contrast, the proposed Mixture-of-Modality Adaption (MMA) (c) is an end-to-end optimization scheme, which is cheap in training and superior in the automatic shift between text-only and image-text instructions. LaVIN on ScienceQA only takes _1.4 hours_ with 8 A100 GPUs, and the updated parameters are only _3.8M_. In addition, we also extend LaVIN to a multimodal chatbot via tuning on 52\(k\) text-only instructions [36] and 152\(k\) text-image pairs [18]. The qualitative comparisons show that LaVIN can accurately execute various types of human instructions, _e.g.,_ coding, math and image captioning, while yielding superior vision-language understanding than existing multimodal chatbots [49; 15; 44]. In summary, our contributions are three folds: * We present a novel and efficient solution for vision-language instruction tuning, namely Mixture-of-Modality Adaptation (MMA), which does not require the expensive VL pretraining and can maintain the NLP capabilities of LLMs. * Based on MMA, we propose a new multimodal LLM, namely LaVIN. Experimental results show the superior efficiency and competitive performance of LaVIN against existing multimodal LLMs, and also confirm its great potential as a general-purpose chatbot. * We release the source code and pre-trained checkpoints associated with this paper. We believe that our project can well facilitate the development of multimodal LLM. ## 2 Related Work ### Parameter-Efficient Transfer Learning Since large language models have ever-increasing parameter sizes, parameter-efficient transfer learning (PETL) [11; 17; 22; 12; 19; 10] has gained increasing attention to reduce training and storage overhead of LLMs. PETL aims to insert or fine-tune a small number of parameters into LLMs, thereby achieving the adaption on downstream tasks. In early efforts [11; 10], a small MLP network, known as Adapter [11], is inserted into LLMs to project their hidden features to the semantic spaces of downstream tasks. Based on Adapter, numerous PETL methods [17; 40; 22; 12; 19; 10] have been proposed to further enhance adaptation capabilities [17; 40; 22; 19; 10] and inference speed [12]. Among them, AdaMix [40] is a method relatively close to our MMA, which also includes a set of candidate adapters for downstream task routing. However, AdaMix is static and task-dependent, of which routing path is fixed after training. In contrast, our MMA is a dynamic method based on the input modality embeddings. Moreover, AdaMix is still an unimodal module and hard to adaptively adjust the adaptions of different modalities. Driven by the great success in NLP, PETL has also achieved significant progresses in large vision models [23; 2; 48], _e.g.,_ ViT [7] and CLIP [30]. Despite the effectiveness, PETL for multimodal LLMs still lacks explorations. A very recent PETL method [45] is proposed for multimodal LLMs, but its performance still lags behind full fine-tuning. ### Multimodal Instruction-following LLMs Instruction tuning [25; 26; 29; 41; 42] aims to fine-tune LLMs on natural language corpus describing diverse NLP tasks. This simple and effective method has been successfully applied to various well-known LLMs, such as InstructGPT [29] and FLAN-T5 [6], greatly improving their performance and generalization ability. Motivated by this success, numerous efforts have been devoted to constructing multimodal instruction-following LLMs. Existing works can be categorized into two groups, _e.g.,_ the expert systems [43; 44; 35] and modular training ones [15; 18; 49; 13; 49], respectively. The representative expert systems, such as Visual ChatGPT [43] and MMREACT [44], employ LLMs as the controller to invoke various vision models to accomplish the VL instructions. Despite the effectiveness, this heavy system also incurs non-negligible burdens in terms of storage and computation. Recently, modular training models [15; 18; 49; 13; 49] as proposed as more efficient alternatives. Among them, Flamingo [1] is the first large-scale multimodal LLM that pre-trains on numerous image-text pairs, which demonstrates strong zero-shot ability on diverse tasks. The following works, including BLIP-2 [15], FROMAGe [14], PaLM-E [8], KOSMOS-1 [13] and LLaVA [18], not only optimize the model architecture [15; 14; 8; 13] but also improve the quality of VL instruction data [18]. Despite their effectiveness, most multimodal LLMs require expensive training costs and perform worse on text-only instructions. ## 3 Method ### Mixture-of-Modality Adaptation In this paper, we propose a novel learning regime for the vision-language adaption of LLMs, which is called Mixture-of-Modality Adaptation (MMA). As shown in Fig. 2, MMA includes two novel designs, namely Mixture-of-Modality Adapter (MM-Adapter) and Mixture-of-Modality Training (MMT). Specifically, MM-Adapter extends LLMs with multimodal abilities via lightweight adapters, which also realizes the automatic shift between single- and multi-modal instructions. Afterwards, the entire multimodal LLM is jointly optimized via MMT, which is cheap in training time and storage. **Mixture-of-Modality Adapter (MM-Adapter).** As shown in Fig. 2, we connect the LLM with the image encoder with a set of lightweight adaptation modules. In the image encoder, these modules can be the common adapters [11; 23]. In the LLM, unimodal adaptation modules are inferior in handling single- and multi-modal instructions simultaneously. In particular, we first introduce a modality token \(t_{m}\in\mathbb{R}^{c}\) to indicate the input modality, which is defined by \[t_{m}=mE_{m}. \tag{1}\] Here, \(E_{m}\in\mathbb{R}^{2\times c}\) is the modality embedding. \(m\in\mathbb{R}^{2}\) is a one-hot vector to represent the input modality. Based on the modality token \(t_{m}\), MM-Adapter can dynamically adjust the adaptations for the input features \(Z\in\mathbb{R}^{n\times c}\). In practice, \(Z\) can be the single- or multi-modal features, which will be introduced in Sec 3.2. Thus, MM-Adapter can be defined by \[Z^{\prime}=Z+s\cdot\textit{router}\big{(}f_{a_{1}}(Z),f_{a_{2}}(Z);f_{w}(t_{m} )\big{)}. \tag{2}\] Here, \(f_{a_{1}}\) and \(f_{a_{2}}\) are RepAdapters [23] in our paper. \(s\) is the scale factor, and \(\textit{router}(\cdot)\) is a routing function to decide the routing path of two adapters. To further reduce the parameter costs, the downsampling projection of two adapters are shared. As shown in Fig. 3, the key to realize the dynamic adaptations lies in the design of the routing function \(\textit{router}(\cdot)\), which is formulated as \[\begin{split}\textit{router}\big{(}f_{a_{1}}(Z),f_{a_{2}}(Z) \big{)}=\hat{w}_{0}\cdot f_{a_{1}}(Z)+\hat{w}_{1}\cdot f_{a_{2}}(Z),\\ \text{where}\quad\hat{w}=f_{w}(t_{m})=\text{softmax}(\frac{t_{m }W_{m}+b_{m}}{\tau}).\end{split} \tag{3}\] Figure 3: Illustration of the Mixture-of-Modality Adapter (MMA). MMA can dynamically select the appropriate adapter according to the input modalities. Figure 2: The overview of the Mixture-of-Modality Adaptation (MMA) and the architecture of LaVIN. In LaVIN, the novel Mixture-of-Modality Adapters are employed to process the instructions of different modalities. During instruction tuning, LaVIN is optimized by Mixture of Modality Training (MMT) in an end-to-end manner. Here, \(W_{m}\in\mathbb{R}^{c\times 2}\) and \(b_{m}\in\mathbb{R}^{2}\) are the weight matrix and bias, respectively. \(\hat{w}\) denotes the routing weights, and \(\tau\) is the temperature of the softmax. Based on Eq. 2 and 3, MM-Adapter can select the best adaption path according to the modalities of input instructions. More importantly, the process of MM-Adapter only introduces a few of additional parameters, which is still efficient. In practice, MM-Adapter can be used as the unimodal adapter to improve the adaptation ability, thus we also apply it to the image encoder. **Mixture-of-Modality Training (MMT).** Based on MM-Adapter, the target of MMT is to freeze the large image encoder and LLM, and only fine-tune the inserted adapters. In this case, the entire multimodal LLM can be jointly optimized in an end-to-end manner. Specifically, the end-to-end optimization objective can be formulated by \[\arg\min\mathcal{L}(f_{\phi}(Z),R;\theta_{a}). \tag{4}\] Here, \(R\) and \(\mathcal{L}(\cdot)\) denote the ground-truth response [21] and the objective loss function, respectively. \(f_{\phi}\) is the LLM, and \(\theta_{a}\) denotes the adaptation parameters. \(I\in\mathbb{R}^{h\times w\times 3}\) and \(T\in\mathbb{R}^{l}\) denote the input image and text instruction, respectively. During training, we construct a mini training batch randomly sampled from text-only and text-image instructions. In this case, the overall training objective \(\mathcal{L}\) can be defined by \[\mathcal{L}=\sum_{i=1}^{m}\sum_{s=1}^{S+1}\log p(R_{s}^{i}|Z^{i},R_{0:s-1}^{i} ;\theta_{a}). \tag{5}\] Here, \(m\) denotes the batch size, and \(S\) is the length of the response. After MMT, the multimodal LLM can effectively execute the input instructions of different modalities. In our training scheme, the number of optimized parameters is still kept at a very small scale, _e.g._, 3\(\sim\)5M, which greatly reduces the training time and the storage cost. Compared to existing modular training paradigm, MMA does not require additional VL pre-training and can optimize the entire model end-to-end, further improving the training efficiency. ### Large Vision-language Instructed Model To validate MMA, we apply it to an LLM called LLaMA [37] and adopt CLIP-ViT [30] as the image encoder. Here, we term this new large vision-language instructed model as LaVIN. Given the input image \(I\in\mathbb{R}^{h\times w\times 3}\), we use the [cls] tokens from every fourth layer of ViT [7] as the visual feature, denoted as \(X\in\mathbb{R}^{n\times d}\). In the image encoder, we insert the adapters before the multi-head attention modules. We represent the text instruction with word embeddings, denoted as \(Y\in\mathbb{R}^{l\times c}\). Then, a simple visual adapter is used to transform the visual features to the same dimension with the LLM, which is defined by \[X^{\prime}=\sigma(XW_{d}+b_{d})W_{u}+b_{u}. \tag{6}\] Here, \(W_{d}\in\mathbb{R}^{d\times d_{h}}\) and \(W_{u}\in\mathbb{R}^{d_{h}\times c}\) denote the weight matrices, while \(W_{d}\in\mathbb{R}^{d_{h}}\) and \(b_{u}\in\mathbb{R}^{c}\) are the bias terms. \(\sigma\) is the SwiGLU activation function [34]. In practice, \(d_{h}\) is much smaller than \(d\) and \(c\), so the input of LLM can be defined by \[Z=\begin{cases}[t_{m},X^{\prime},Y]&\text{text-image},\\ [t_{m},Y]&\text{text only}.\end{cases} \tag{7}\] Here, \([\cdot]\) denotes the concatenation. Based on the multimodal input, LLM can predict the next token step by step, which can be formulated by \[p_{t}=\prod_{s=1}^{S+1}p(R_{s}|Z,R_{0:s-1};\theta_{l},\theta_{a}) \tag{8}\] Here, \(p_{t}\in\mathbb{R}^{m}\) denotes the probabilities of the predicted word and \(m\) is the length of the word embeddings. \(\theta_{l}\) and \(\theta_{a}\) denote the parameters of LLM and adaptation modules, respectively. Compared with previous works [15; 49; 18], the architecture of LaVIN is much simpler and more lightweight, which is also easier to optimize. For example, the visual neck of LaVIN is 6 times smaller than that of LLaVA [18], but the performance of two models is close. ## 4 Experiments ### Datasets and Metrics **ScienceQA.** ScienceQA [21] is the large-scale multimodal dataset for science question answering, which covers various domains, including 3 subjects, 26 topics, 127 categories and 379 skills. ScienceQA consists of text-only and text-image examples in three splits namely _train_, _val_ and _test_, with 12,726, 4,241 and 4,241 examples, respectively. We evaluate our model using average accuracy. **Alphaca-52k & LLaVA-158k.** Alphaca-52k [36] contains 52k text-only instruction-following data generated by GPT-3.5 [3]. LLaVA-158k [18] is a large-scale text-image instruction-following dataset, where the answer is automatically generated by GPT-4 [28]. Following LLaVA [18], GPT-4 is employed to evaluate the quality of the chatbot's responses, which will assign higher scores to superior responses within a range of 1 to 10. ### Implementation Details We employ the ViT-L/14 [7] of the pre-trained CLIP [30] as the image encoder. The visual features consist of six [cls] tokens extracted from every fourth layer of ViT-L/14. For LLM, LLaMA-7B [37] and LLaMA-13B [37] are used. The default dimension of the visual neck is set to 128. The dimension of MM-Adapter is 8, and the temperature is set to 10 for LaVIN-7B and 5 for LaVIN-13B. For text-only baseline, the image encoder is removed, and MM-Adapter is replaced with RepAdapter [23]. We adopt AdamW [20] as the optimizer, and train the model for 20 epochs with a cosine decay learning rate schedule. The batch size, learning rate and weight decay are set to 32, 9e-3 and 0.02, respectively. During the generation stage, the decoding uses _top-p_ sampling with a temperature of 0.1 and a _top-p_ value of 0.75, respectively. For the experiments of multimodal chatbot, all hyperparameters remain the same, except for the training epochs, which are reduced to 15. ### Experimental Results #### 4.3.1 Results on ScienceQA **Comparison with existing methods.** In Tab. 1, We first compare LaVIN with the state-of-the-art methods on ScienceQA. From this table, the first observation is that the few-shot LLMs, such as GPT-4, still perform worse than human, suggesting the great challenge of ScienceQA. In contrast, existing supervised methods [18; 45; 47] yield better results. In particular, MM-CoT\({}_{Large}\)[47] achieves the best performance, _e.g.,_ 91.68. However, MM-CoT mainly focuses on the multimodal chain-of-thought for language models, of which contribution is orthogonal to our approach. In particular, LLaVA [18] is an end-to-end multimodal LLM, which is more close to our work. The results show that LLaVA \begin{table} \begin{tabular}{l c|c c|c c|c c c|c c|c} \hline \multirow{2}{*}{Method} & \multirow{2}{*}{\#T-Param} & \multirow{2}{*}{LLM} & \multicolumn{3}{c|}{Subject} & \multicolumn{3}{c|}{Context Modality} & \multicolumn{3}{c|}{Grade} \\ & & & NAT & SOC & LAN & TXT & IMG & NO & G1-6 & G7-12 \\ \hline _Zero- \& few-shot methods_ & & & & & & & & & & \\ Human [21] & - & ✗ & 90.23 & 84.97 & 87.48 & 89.60 & 87.50 & 88.10 & 91.59 & 82.42 & 88.40 \\ GPT-3.5 [21] & - & ✓ & 74.64 & 69.74 & 76.00 & 74.44 & 67.28 & 77.42 & 76.80 & 68.89 & 73.97 \\ GPT-3.5 (CoT) [21] & - & ✓ & 75.44 & 70.87 & 78.09 & 74.68 & 67.43 & 79.93 & 78.23 & 69.68 & 75.17 \\ GPT-4 [28] & - & ✓ & 84.06 & 73.45 & 87.36 & 81.87 & 70.75 & 90.73 & 84.69 & 79.10 & 82.69 \\ \hline _Representative \& SoTA models_ & & & & & & & & & & \\ UnifiedQA [21] & 223M & ✗ & 71.00 & 76.04 & 78.91 & 66.42 & 66.53 & 81.81 & 77.06 & 68.82 & 74.11 \\ MM-CoT\({}_{Base}\)[47] & 223M & ✗ & 87.52 & 77.17 & 85.82 & 87.88 & 82.90 & 86.83 & 84.65 & 85.37 & 84.91 \\ MM-CoT\({}_{Large}\)[47] & 738M & ✗ & 95.91 & 82.00 & 90.82 & 95.26 & 88.80 & 92.89 & 92.44 & 90.31 & 91.68 \\ LLaVA [18] & 13B & ✓ & 90.36 & 95.95 & 88.00 & 89.49 & 88.00 & 90.66 & 90.93 & 90.90 & 90.92 \\ \hline _Parameter-efficient methods_ & & & & & & & & & & & \\ LLaMA-Adapter [45] & 1.8M & ✓ & 84.37 & 88.30 & 84.36 & 83.72 & 80.32 & 86.90 & 85.83 & 84.05 & 85.19 \\ LaVIN-7B (ours) & 3.8M & ✓ & 89.25 & 94.94 & 85.24 & 88.51 & 87.46 & 88.08 & 90.16 & 88.07 & 89.41 \\ LaVIN-13B (ours) & 5.4M & ✓ & **90.32** & 94.38 & 87.73 & **89.44** & **87.65** & 90.31 & 91.19 & 89.26 & 90.50 \\ LaVIN-13B(ours) & 5.4M & ✓ & 89.88 & **94.49** & **89.82** & 88.95 & **87.61** & **91.85** & **91.45** & **89.72** & **90.83** \\ \hline \end{tabular} \end{table} Table 1: Comparison on ScienceQA _test_ set. Question classes: NAT = natural science, SOC = social science, LAN = language science, TXT = text context, IMG = image context, NO = no context, G1-6 = grades 1-6, G7-12 = grades 7-12. \(\dagger\) denotes that LaVIN is trained with 40 epochs. #T-Params denotes that the number of trainable parameters. remains competitive performance against MM-CoT\({}_{Large}\)[47], especially in the category of SOC. Despite the effectiveness, its number of trainable parameters is still large, leading to higher training overhead. LLAMA-Adapter [45] adopts a parameter-efficient scheme to reduce the training overhead, but its performance still greatly lags behind LLAVA. Compared to these approaches, LaVIN achieves the better trade-offs between performance and training efficiency. For example, LaVIN-7B consumes a similar scale of trainable parameters as LLaMA-Adapter [45], while outperforming it by +4.22 gains. When scaling up to 13B, LaVIN can obtain more significant performance gains, _i.e._, +5.64. Compared to LLAVA, LaVIN-13B also achieves comparable performance and even performs better in some question classes, _e.g._, LAN and NO. Considering the much lower training costs than LLAVA, such competitive performance greatly confirms the efficiency and designs of LaVIN. In Tab. 3, we compare LaVIN with existing methods without VL pre-training. From this table, we observe that both LLAVA [18] and LLAMA-Adapter achieve the similar performance, _i.e._, 85.81 _vs._ 85.19. In particular, LLAVA [18] and LLAMA-Adapter [45] freeze the image backbone, and the entire multimodal LLM is not jointly optimized, which hinders the learning of visual content. Moreover, the adaptation module in LLaMA-Adapter does not consider the modality gap in the input instructions, greatly limiting its performance upper bound. In contrast, with the help of MMA, LaVIN significantly outperforms these approaches, _e.g._, +5.02 gains over LLaVA. These results validate the proposed MMA towards the effective and efficient VL adaption, and confirm the designs of LaVIN. **Ablation study.** To gain deep insights into MMA and LaVIN, we conduct comprehensive ablation studies in Tab. 2. From this table, we can see that each design of MMA and LaVIN greatly contributes to the final performance. As shown in Tab. 2, the mixture-of-modality training (MMT) brings the most significant gains, _e.g.,_ +4.69. In MMT, the joint training with the vision modality provides up to +3.67 performance gains for LaVIN. With the joint optimization of the image encoder and LLM, the performance of LaVIN further boosts from 86.32 to 87.34, suggesting the significance of the joint optimization for multimodal LLMs. With the help of MMT, LaVIN already surpasses the existing parameter-efficient method, _i.e._, LLAMA-Adapter. Additionally, the stronger image encoder, _i.e._, ViT-L/14, also improves the average accuracy by 0.99. An interesting observation is that a better image encoder provides noticeable performance gains for both image-based and text-based questions. When adopting MM-Adapter to LaVIN, we observe +1.08 gains on average accuracy. Such an improvement only requires extra 0.9M parameters, which is very lightweight. Meanwhile, the performance of LaVIN is significantly improved by MM-Adapter on more challenging metrics like G7-12, _i.e.,_ +2.51. After scaling up LLM to 13B, \begin{table} \begin{tabular}{l c c c c} \hline \hline Methods & \#T-Params & Memory & Time & \#Storage \\ \hline BLIP2 [15] & 188M & - & \textgreater{}200 hours & - \\ LLAVA [18] & 13B & OOM & N/A & N/A \\ LLAVA4 [18] & 13B & 36.8G & 7 hours & 26GB \\ LavinVIN-7B & 3.8M & 33.9G & 1.4 hours & 15M \\ LaVIN-13B & 5.4M & 55.9G & 2 hours & 20M \\ \hline \hline \end{tabular} \end{table} Table 4: Training costs of LaVIN and existing multimodal LLMs on ScienceQA. \(\ddagger\) denotes that GPU memory-saving techniques are used. “OOM” denotes out of GPU memory. For BLIP2, we only calculate its pre-training costs as a reference. All results are evaluated on 8 A100 GPUs. \begin{table} \begin{tabular}{l c c c c c c c c c c} \hline \hline Settings & \#T-Params & NAT & SOC & LAN & TXT & IMG & NO & G1-6 & G7-12 & Avg. \\ \hline Text Only & 1.8M & 82.86 & 82.56 & 82.28 & 81.23 & 75.81 & 86.06 & 83.26 & 81.54 & 82.65(-0.000) \\ + Vision Modality (MMT) & 2.4M & 85.97 & 90.66 & 83.55 & 84.90 & 83.59 & 86.41 & 88.14 & 83.06 & 86.32(-3.17) \\ + Joint Opt. (MMT) & 2.5M & 86.59 & 94.71 & 82.91 & 85.63 & 84.98 & 86.41 & 88.62 & 85.04 & 87.34(-4.69) \\ + Stronger Image Enc. & 2.9M & 88.01 & 94.94 & 83.64 & 87.15 & 86.81 & 87.04 & 89.87 & 85.56 & 88.33(-4.58) \\ + MM-Adapter & 3.8M & 89.25 & 94.94 & 85.24 & 88.51 & 87.46 & 88.08 & 90.16 & 88.07 & 89.41(-6.39) \\ + Larger LLM (13B) & 5.4M & 90.32 & 94.38 & 87.73 & 89.44 & 87.65 & 90.31 & 91.19 & 89.26 & 90.50(-7.58) \\ \hline \hline \end{tabular} \end{table} Table 2: Ablation studies on ScienceQA _test_ set. For the text-only baseline, we use the image caption to prompt the model. ViT-B/16 and LLAMA-7B are used as the default image encoder and LLM. “Joint Opt” denotes the joint optimization of image encoder and LLM. The Mixture-of-Modality Training (MMT) is ablated with the settings of “Vision Modality” and “Joint Opt.”. \begin{table} \begin{tabular}{l c c} \hline \hline Methods & \#T-Params & Accuracy \\ \hline LLAVA [18] & 13B & 85.81 \\ LLAMA-Adapter [45] & 1.8M & 85.19 \\ \hline LaVIN-7B & 3.8M & 89.41 (+4.22) \\ LaVIN-13B & 5.4M & **90.83** (+5.02) \\ \hline \hline \end{tabular} \end{table} Table 3: Results of LaVIN and existing multimodal LLMs without the pre-training stage. We report the average accuracy on ScienceQA _test_ set. the performance of LaVIN is further improved by + 1.09. Overall, these ablations well validate the significance of MMA in adapting multimodal LLM, and also confirm the effectiveness of LaVIN. In Fig. 4, we visualize the routing weights of LaVIN for text-only and text-image instruction inputs. From the figure, the first observation is that MM-Adapter effectively decouples the inference of different modalities into two set of adapters. As shown in Fig. 4, the inference path for text-image instruction input significantly differs from that of text-only instruction. Meanwhile, the learned routing weights are also very sharp, _i.e.,_ close to 0 or 1, suggesting that the model is very confident to its decision. From these two observations, we can find that the text-only and text-image instruction inputs actually have different requirements for their adaptations, thus common unimodal adapters are usually suboptimal to simultaneously adapt two modalities. This visualizations also confirm the effectiveness of MM-Adapter. **Comparison of training efficiency.** In Tab. 4, we compare the training expenditures of LaVIN, LLaVA [18] and BLIP2 [15]. The first observation is that the pre-training cost of BLIP2 is ac Figure 4: Visualization of the dynamic inference paths between two adapters in the last 10 layers of LaVIN-7B. The values in the box denote the routing weights. Given input instructions of different modalities, LaVIN can dynamically execute different inference paths based on the input modality embeddings. Figure 5: Comparison between LaVIN-13B and existing methods on single- and multi-modal instructions. The noteworthy aspects of the responses are highlighted in green, whereas the illogical portions are marked in red. More tasks and examples are given in appendix. tually expensive, which requires more than 200 hours. Meanwhile, LLaVA cannot be trained on common machines with the default training settings3. Thus, it requires some GPU memory-saving techniques [9] to avoid _out of memory_ (OOM). However, its training time and storage requirement are still significant. For example, it still takes up to 26GB space to store the updated parameters of the LLM. In contrast, LaVIN demonstrates superior training efficiency with the help of MMA. Compared to LLaVA, LaVIN-7B and LaVIN-13B reduce about 80% and 71.4% training time, respectively. In terms of GPU memory and storage cost, our approach can save more than 40% GPU memory and 99.9% disk storage. Overall, these results greatly confirm the training efficiency of MMA. Footnote 3: [https://github.com/haotian-liu/LLaVA](https://github.com/haotian-liu/LLaVA) #### 4.3.2 Multimodal Chatbot **Examples of different instruction-following tasks.** In Fig 5, we compare LaVIN with existing methods [45; 18] on single- and multi-modal instruction-following tasks, _e.g.,_ math, coding and image captioning. Compared to LLaVA [18] and LLaMA-Adapter [45], LaVIN achieves overall better responses across multiple tasks. In Fig.5 (a), LaVIN correctly answers the math problem with a result of 28.8, whereas LLaMA-Adapter [37] provides an incorrect answer. In example (d), LaVIN generates accurate code for the request of _"print prime numbers up to 100"_. In contrast, the code written by LLaMA-Adapter is to check prime numbers, which does not produce any output during execution. Meanwhile, LaVIN presents a clear and concise coding behavior, acting more like a professional programmer. In Fig 5 (e)-(g), LaVIN demonstrates remarkable visual reasoning ability Figure 6: Comparison of LaVIN-13B and existing multimodal LLMs in multi-turn conversations. GPT-4 assigns a score ranging from 1 to 10 to evaluate the quality of a response, with a higher score indicating superior performance. The noteworthy aspects of the responses are highlighted in green, whereas the illogical portions are marked in red. More examples are given in appendix. in accomplishing various multimodal tasks. In Fig.5 (e), LaVIN accurately answers the complex questions about the number of food containers in the image and provides a detailed description about the complex scene. The same observation can also be witnessed in Fig.5 (g), where LaVIN infers a correct reason for the wetness of the boy's clothes. Overall, these examples show the superior reasoning ability of LaVIN in executing single- and multi-modal instructions, while also confirming the significance of MMA in adapting LLMs to multi-modal tasks. **Examples of multimodal dialogue** In Fig. 6, we compare LaVIN with existing multimodal LLMs in multi-turn conversations, and use GPT4 [28] to evaluate the quality of their responses. From the results, we can see that LaVIN has higher GPT4 scores among all compared models, suggesting superior ability in multimodal dialogue. Meanwhile, we also observe different response styles of these multimodal LLMs. In particular, BLIP2 [15] tends to produce brief responses, which lack detailed explanations. In contrast, the responses of MiniGPT4 [49] are the longest among all models, but their content is often redundant and repetitive. Compared to them, LaVIN and LLaVA [18] can generate more accurate responses. Particularly, LaVIN performs better than the other methods, mainly due to its more logical and detailed descriptions. As illustrated in the first question, LaVIN not only provides the correct answer, but also explains the reason behind it. In the second question, LaVIN and LLaVA are required to judge whether the man will get wet, and LaVIN answers "yes" while LLaVA considers "no". It can be seen that the reason of LaVIN is more comprehensive, logical and persuasive than LLaVA, which considers the situation of _"the overhand may not provide the complete protection"_. Overall, these examples confirm that MMA equips LLMs with excellent multi-modal ability, requiring no pre-training on large-scale image-text data. ## 5 Limitations and Broader Impact We observe two primary limitations of LaVIN. Firstly, LaVIN may generate incorrect or fabricate responses, similar to existing multimodal LLMs. Secondly, LaVIN can not identify extremely fine-grained visual content, such as text characters. We believe that the recognition ability of LaVIN still has a large room to improve, which will be left in our future work. ## 6 Conclusions In this paper, we propose a novel and affordable solution for vision-language instruction tuning, namely Mixture-of-Modality Adaptation (MMA). Particularly, MMA is an end-to-end optimization regime, which connects the image encoder and LLM via lightweight adapters. With the help of MMA, the entire multimodal LLM can be jointly optimized via a small number of parameters, greatly reducing the training costs. Meanwhile, we also propose a novel routing algorithm in MMA, which can help the model automatically shifts the reasoning paths for single- and multi-modal instructions. Based on MMA, we develop a large vision-language instructed model called LaVIN, which demonstrates a superior reasoning ability than existing multimodal LLMs in various instruction-following tasks. **Acknowledgements.** This work was supported by National Key R&D Program of China (No.2022ZD0118201), the National Science Fund for Distinguished Young Scholars (No.62025603), the National Natural Science Foundation of China (No. U21B2037, No. U22B2051, No. 62176222, No. 62176223, No. 62176226, No. 62072386, No. 62072389, No. 62002305 and No. 62272401), and the Natural Science Foundation of Fujian Province of China (No.2021J01002, No.2022J06001). We thank Mingbao Lin for his valuable feedback.

2310.18969

Analyzing Vision Transformers for Image Classification in Class Embedding Space

Despite the growing use of transformer models in computer vision, a mechanistic understanding of these networks is still needed. This work introduces a method to reverse-engineer Vision Transformers trained to solve image classification tasks. Inspired by previous research in NLP, we demonstrate how the inner representations at any level of the hierarchy can be projected onto the learned class embedding space to uncover how these networks build categorical representations for their predictions. We use our framework to show how image tokens develop class-specific representations that depend on attention mechanisms and contextual information, and give insights on how self-attention and MLP layers differentially contribute to this categorical composition. We additionally demonstrate that this method (1) can be used to determine the parts of an image that would be important for detecting the class of interest, and (2) exhibits significant advantages over traditional linear probing approaches. Taken together, our results position our proposed framework as a powerful tool for mechanistic interpretability and explainability research.

Martina G. Vilas, Timothy Schaumlöffel, Gemma Roig

2023-10-29T10:25:23Z

http://arxiv.org/abs/2310.18969v1

# Analyzing Vision Transformers for Image Classification in Class Embedding Space ###### Abstract Despite the growing use of transformer models in computer vision, a mechanistic understanding of these networks is still needed. This work introduces a method to reverse-engineer Vision Transformers trained to solve image classification tasks. Inspired by previous research in NLP, we demonstrate how the inner representations at any level of the hierarchy can be projected onto the learned class embedding space to uncover how these networks build categorical representations for their predictions. We use our framework to show how image tokens develop class-specific representations that depend on attention mechanisms and contextual information, and give insights on how self-attention and MLP layers differentially contribute to this categorical composition. We additionally demonstrate that this method (1) can be used to determine the parts of an image that would be important for detecting the class of interest, and (2) exhibits significant advantages over traditional linear probing approaches. Taken together, our results position our proposed framework as a powerful tool for mechanistic interpretability and explainability research. ## 1 Introduction Transformer-based deep neural networks have become one of the most popular architectures in machine learning due to their remarkable performance and adaptability to multiple domains. Consequently, recent work has focused on reverse-engineering the inner mechanisms of these networks for better understanding and control of their predictions (e.g. [2; 7; 11; 12; 18]). Of these, a series of studies in the field of NLP [2; 7; 8; 11; 12] have shed light on the predictive mechanisms of large language transformers by projecting the hidden states and parameters of intermediate processing layers onto a vocabulary space using the pre-trained output embedding matrix. This approach has enabled the analysis in human-understandable terms of how next-word predictions are built internally, introducing a simple and efficient method for the mechanistic interpretability of NLP transformers. So far, to the best of our knowledge, no work has shown that a similar approach can be applied to reverse engineer Vision Transformers (ViTs) for image classification. We thus introduce a method to characterize the categorical building processes of these networks by projecting their intermediate representations and parameter matrices onto the class embedding space. Our framework quantifies how the inner representations increasingly align with the class prototype learned by the model (encoded by the class projection matrix), and uncovers the factors and mechanisms behind this alignment. In this work, we use our method to show that (1) image tokens increasingly align to class prototype representations, from early stages of the model; (2) factors such as attention mechanisms and contextual information have a role in this alignment; and (3) the categorical building process partly relies on key-value memory pair mechanisms differentially imparted by the self-attention and MLP layers. In addition, we discuss how to use this framework to identify the parts of an image that would be the most informative for building a class representation. Finally, we show that our method can characterize the emergence of class representations in image tokens more efficiently and accurately than the commonly used linear probing approach. ## 2 Related work Prior research has demonstrated that within ViT models, (1) the use of a linear probing approach in the hidden states of class tokens ([CLS]) in early layers enables the decoding of class representations [18], and (2) the image tokens in the final block contain class-identifiable information. By contrast, we introduce a methodological framework that adeptly extracts categorical information from image tokens early in the processing stages, and allows us to elucidate the underlying factors and mechanisms that facilitate the development of these class representations. We also demonstrate that, unlike our method, linear probes do not necessarily uncover the features relevant to the classification task. We use our framework to complement previous findings on the inner mechanisms of ViTs. Ghiasi et al. [13] and Raghu et al. [18] investigated how tokens preserve input spatial representations across the hierarchy. We instead analyzed how tokens increasingly represent the output classes. In addition, recent work has examined and compared the role of self-attention and MLP layers: Raghu et al. [18] quantified how residual connections are differentially influenced by these sub-modules, Bhojanapalli et al. [3] measured their distinctive importance in the model's performance by running perturbation studies, and Park and Kim [17] assessed their statistical properties. We supplemented these findings by carrying out a detailed analysis of how these sub-modules build class representations by exploiting mechanisms like key-value memory pair systems. Finally, previous studies [3; 13; 16] analyzed how the performance of ViT holds against multiple nuisance factors. We alternatively inspected if class representations in image tokens are _internally_ disrupted by context and attention perturbations. Besides work probing the inner mechanisms of ViTs, tools for providing human-interpretable explanations of the network's predictions in particular instances have been developed [6]. We introduce an explainability method that follows this line of work and uncovers the parts of an image that favor the formation of meaningful class representations, independently for any block. ## 3 Interpretation of vision transformers mechanisms in class embedding space ViT architecture.As introduced by Dosovitskiy et al. [9] and depicted in Fig. 1a, vanilla image-classification ViTs take as input a sequence of linear projections of equal-sized \(n\) image patches Figure 1: _Schematic of our framework._ **(a)** The hidden states of image tokens \(x_{n}\) in a block \(b\) are projected onto the class embedding space using the output embedding matrix **E. (b)** A key-value memory pair system in a self-attention layer. Key vectors \(k_{j}\) belong to different attention heads \(h_{f}\). The match between the hidden states \(x_{n}\) and the keys \(k_{j}\) is weighted by attention values to produce a memory coefficient. Value vectors \(v_{j}\) weighted by these memory coefficients are summed up and added to the residual stream. Adapted from Geva et al. [11]. with added position embeddings. We refer to these as image tokens \(\langle\mathbf{x}_{1},\dots,\mathbf{x}_{n}\rangle\) with \(\mathbf{x}\in\mathbb{R}^{d}\). The sequence also includes a special "class token" whose initial representation is learned during training, denoted [CLS]. Hence, we have \(S=\langle\mathbf{x}_{cls}^{0},\mathbf{x}_{1}^{0},\dots,\mathbf{x}_{n}^{0}\rangle\) as the input of ViT (see bottom of Fig. 0(a)). The sequence \(S\) is processed by a series of transformer blocks composed of interleaving multi-head self-attention (MHSA) and MLP layers, with residual connections between each of the layers (see Fig. 0(a) and appendix for details). The \(b^{\text{th}}\) block updates the inner representation (a.k.a. hidden state) \(\mathbf{x}_{i}^{b-1}\in\mathbb{R}^{d}\) of each token \(x_{i}\in S\) indexed by \(i\), eventually producing a new hidden state \(\mathbf{x}_{i}^{b}\). Given a set of classes \(C\) and a class embedding matrix \(\mathbf{E}\in\mathbb{R}^{|C|\times d}\) which is learned during training, the predicted class probabilities are obtained by projecting the output of the [CLS] token of the last block and applying a softmax: \(\mathbf{p}_{\text{cls}}=\text{softmax}(\mathbf{E}\cdot\mathbf{x}_{\text{ cls}}^{b_{n}})\) (see top of Fig. 0(a)). We assume each row of \(\mathbf{E}\) represents a _class prototype_ since they encode the patterns whose detection (via matrix multiplication with the [CLS] token) determines the probability of a class being present in the image. Activation space projection.To investigate how class representations emerge in ViT, we analyzed the alignment between the intermediate representations of the tokens with the class prototypes encoded by the final projection matrix \(\mathbf{E}\). The key insight is that we have \(\mathbf{x}_{i}^{b}\in\mathbb{R}^{d}\). Hence, we can obtain the prediction of the class distribution \(p_{i}^{b}\in\mathbb{R}^{|C|}\) for the intermediate representation of the \(i^{\text{th}}\) token in the output of the \(b^{\text{th}}\) block by computing \(\mathbf{p}_{i}^{b}=\mathbf{E}\cdot\mathbf{x}_{i}^{b}\) (see Fig. 0(a)). To quantify the alignment, we take inspiration from Brunner et al. [4] and adapt a measure of _identifiability_. Concretely, we evaluate how recoverable the correct class \(c_{j}\) of the \(j^{\text{th}}\) image is from the class projection of the \(i^{\text{th}}\) token using a measure of their _class identifiability_, \(r_{i}^{j}\), that we define as: \[r_{i}^{j}=1-\frac{\text{\emph{argwhere}}(\text{\emph{argsort}}(\mathbf{p_{i }})=c_{j})}{|C|} \tag{1}\] where _argsort_ sorts the logits assigned to each class from higher to lower, and _argwhere_ returns the index of the correct class in the sorted vector. We normalize and reverse \(r_{i}^{j}\) to obtain a score that ranges from 0 to 1, with 1 denoting that the correct class has the highest logits and 0 the lowest. _Comparison with NLP research_: The idea of projecting the intermediate token representations onto the class embedding space to uncover the inner mechanisms of ViT is based on previous work in NLP that takes a similar approach with autoregressive language transformers [2, 7, 8, 11, 12]. These models, trained to predict the next word of a sentence, include an output embedding matrix that translates the final hidden states of the network to a human-interpretable vocabulary space. Taking advantage of this component, Geva et al. [11] and [12] projected the outputs of intermediate MLP layers onto the vocabulary space to show that these sub-modules can be decomposed into a set of sub-mechanisms promoting human-interpretable concepts. In comparison to NLP models, ViTs are trained to predict the presence in an image of a more restricted set of classes. Therefore, the semantic insights obtained with the output embedding projection differ: in the case of NLP we can uncover linguistic anticipatory mechanisms, while in the case of ViT we can investigate how categorical representations are built. Parameter space projection and key-value memory pairs.Previous work [7, 11, 12] has demonstrated that the learned parameters of transformer architectures can also be projected onto the output embedding space for reverse engineering purposes. These studies further propose that the parameter matrices can be interpreted as systems implementing key-value memory pair mechanisms, to better understand the mappings between the inputs of a model and its predictions. As shown in Fig. 0(b), key-value memories are a set of \(j\) paired vectors \(M=\{(\mathbf{k}_{1},\mathbf{v}_{1}),\dots,(\mathbf{k}_{j},\mathbf{v}_{j})\}\) where the keys \(\mathbf{k}_{i}\) are used to quantify the presence of a set of patterns in the input, and the values \(\mathbf{v}_{i}\) represent how the input should be modified in response to the detection of such pattern. We next explain how this system could be implemented in the MLP and self-attention layers of ViT. An MLP layer in ViT consists of: \[\text{MLP}(\mathbf{X})=\text{GELU}(\mathbf{X}\mathbf{W}_{\text{inp}})\mathbf{ W}_{\text{out}} \tag{2}\] where \(\mathbf{X}\in\mathbb{R}^{n\times d}\) represents the \(n\)-token input, each token of dimension \(d\), and \(\mathbf{W}_{\text{inp}}\in\mathbb{R}^{d\times|M|}\) and \(\mathbf{W}_{\text{out}}\in\mathbb{R}^{|M|\times d}\) represent the parameter matrices. The main idea is that the columns of \(\mathbf{W}_{\text{inp}}\) and the rows of \(\mathbf{W}_{\text{out}}\) can be thought of as a set of key-value paired vectors, respectively. The result of the operation shown in blue in eq. 2 is a matrix of memory coefficients. Entry \(i,j\) in the matrix contains the coefficient resulting from the dot product of token \(i\) with key \(j\). This matrix is the dynamic component of the system and measures the presence of certain patterns in the hidden state. The matrix shown in red in eq. 2 (here we think of them as value vectors) encodes how the internal representations \(\mathbf{x}_{i}\) should change in response to the detection of such patterns. To modify the hidden states of the network, the weighted value vectors of all key-value memories are summed up and added to the residual (see top of Fig. 1b). In the case of the self-attention layers, the decomposition of the layer into keys and values is more complex. The core idea is as follows (see Fig. 1b). In transforming the hidden representation \(\mathbf{x}_{i}\) (row \(i\) in \(\mathbf{X}\)), the self-attention layers can be thought of as implementing a system of key-value memory pairs where the keys not only detect the presence of a certain pattern in \(\mathbf{x}_{i}\) but also in the hidden states of all other tokens \(\{\mathbf{x}_{j}:j\neq i\}\) in the sequence \(S\). The coefficient reflecting the match between a key and a token \(\mathbf{x}_{i}\) is weighted by the attention values between \(\mathbf{x}_{i}\) and all tokens in a self-attention head (including itself). Formally, \[\text{MHSA}(\mathbf{X})=\text{hconcat}\left[\mathbf{A}^{1}\mathbf{X}\mathbf{W }_{\text{V_{min}}}^{1},\ldots,\mathbf{A}^{f}\mathbf{X}\mathbf{W}_{\text{V_{ min}}}^{f},\right]\mathbf{W}_{\text{out}} \tag{3}\] where \(\mathbf{A}^{h}\in\mathbb{R}^{n\times n}\) are the attention weights of the \(h^{\text{th}}\) head with \(f\) being the number of heads, and \(\mathbf{W}_{\text{V_{min}}}^{h}\in\mathbb{R}^{d\times\frac{d}{f}}\). The result of \(\mathbf{A}^{h}\mathbf{X}\mathbf{W}_{\text{V_{min}}}^{h}\) for every \(h^{\text{th}}\) head is concatenated horizontally. The output of the horizontal concatenation is a matrix of dimensions \(n\times|M|\) with \(|M|=d\), which is then multiplied with the matrix \(\mathbf{W}_{\text{out}}\in\mathbb{R}^{|M|\times d}\) containing the value vectors. Of note, we can say that the matrices \(\mathbf{W}_{\text{V_{min}}}^{h}\) of every \(h^{\text{th}}\) attention head represent the key vectors of the system. _Comparison with NLP research:_ Autoregressive language transformers employ an input embedding matrix to convert a sequence of semantically meaningful elements within a vocabulary space into a sequence of machine-interpretable hidden states. These hidden states are subsequently processed by a series of transformer blocks, and the resulting output is used for prediction by projecting it back to the vocabulary space using an output embedding matrix. In many architectures, a single vocabulary-projection matrix functions as both the input and output embedding of the model, with the output embedding matrix essentially being the transpose of the input embedding matrix. Consequently, previous work in NLP examined how the keys and values of the memory system represent patterns that are translatable to a human-interpretable vocabulary [11; 12]. For example, in NLP transformers some keys in MLP layers have been reported to detect thematic patterns, such as a reference to TV shows [11]. In turn, the detection of a TV show "theme" was associated with a value vector that promotes related concepts in the vocabulary space (e.g. "episode", "season"). Unlike NLP transformer models, in ViT the mappings of the input embedding matrix (projecting from image patches to hidden states) differ from those of the output matrix (projecting from hidden states to class representations). Therefore, the keys of ViT may represent patterns that are interpretable in the image input space, while the value vectors may represent updates interpretable in the class embedding space. Furthermore, interpreting the keys of ViT is not as straightforward as in the NLP case. In autoregressive language transformers, the input space retains significance throughout the network's hierarchy since it aligns with the output prediction space. In ViTs, however, the input space is not relevant for later projections. Given that our work aims to understand how categorical representations are formed, we focus on analyzing the representations of the value vectors. We leave to future work the analysis of what the keys encode in human-interpretable terms. ## 4 Experimental design Vision Transformer models.We validate our approach using a variety of ViTs that differ in their patch size, layer depth, training dataset, and use of architectural modifications. 1 Specifically, we separately probed: 1) a vanilla ViT with 12 blocks and a patch size of 16 pre-trained using the ImageNet-21k dataset and fine-tuned on ImageNet-1k (ViT-B/16) [9]; 2) a variant with a bigger patch size of 32 (ViT-B/32) [9]; 3) a deeper version with 24 blocks (ViT-L/16) [9]; 4) a variant fine-tuned on the CIFAR100 dataset [14]; 5) a version pre-trained on an alternative Imagenet-21K dataset with higher-quality semantic labels (_MIIL_) [20]; 6) a modified architecture with a refinement module that aligns the intermediate representations of all tokens to class space (_Refinement_) [15]; and 7) an alternate version trained with Global Average Pooling (GAP) instead of the [CLS] token. Image dataset.For conducting our studies we used the ImageNet-S dataset [10], which consists of a sub-selection of images from ImageNet accompanied by semantic segmentation annotations. We analyzed the representations of 5 randomly sampled images of every class from the validation set. ## 5 Class representations in image tokens across the hierarchy During ViT's pre-training for image classification, the only token projected onto the class-embedding space is the [CLS] token from the last block. Thus, whether image tokens across the hierarchy can be translated to the class-embedding space remains an open question. In this section, we provide an affirmative answer. Class representations in image tokens.First, to establish whether the hidden representations of image tokens encode class-specific representations, we projected the hidden states of the image tokens \(\mathbf{X}\) from the last block onto the class-embedding space using the output embedding matrix \(\mathbf{E}\), by computing \(\mathbf{E}\cdot\mathbf{X}^{T}\). We then measured the model's _class identifiability rate_, which we quantified as the percentage of image tokens that contain a class identifiability score of 1. Similarly to Ghiasi et al. [13], we found that the identifiability rate of all ViTs was significantly higher than chance, and the rate was further influenced by the variant probed (see Table 1). We additionally measured the percentage of images that contain at least one image token with an identifiability score of 1 in the last block. We found that, for all variants tested on ImageNet-S, the percentage was significantly higher than in a model initialized with random weights, and higher than their corresponding top-1 accuracy scores in the classification task (see appendix). The latter finding implies that even misclassified samples retain information within some of their image tokens that correspond to the correct class. Evolution of class representations across the hierarchy.Second, to investigate if class prototype representations can be decoded from tokens at various stages of ViT's hierarchy, we projected the hidden states of every block onto the class embedding space and examined the evolution of their class identifiability scores. Fig. 2 shows that the mean class identifiability scores of both image and [CLS] tokens increased over blocks, for all ViT variants. Additionally, the results demonstrate that image tokens exhibited greater variability in their scores in comparison to [CLS] tokens (see variant-specific plots in the appendix). This observation suggests that the development of class representations varies among image tokens. After establishing that image tokens can be effectively translated to the class embedding space across different levels of the hierarchy, we proceed to showcase the applicability of our framework in examining some underlying factors contributing to the development of class representations. We exemplify this process using the simplest model variant, ViT-B/32. \begin{table} \begin{tabular}{c c c c c c c} \hline \hline ViT-B/32 & ViT-B/16 & ViT-L/16 & MIIL & CIFAR100 & Refinement & GAP \\ \hline 60.73 & 67.04 & 72.58 & 78.52 & 90.35 & 79.64 & 52.09 \\ \hline \hline \end{tabular} \end{table} Table 1: _Class identifiability rate (%) of image tokens in the last block._ Figure 2: _Evolution of class identifiability mean scores across normalized blocks._ The impact of attention mechanisms on the class representations of image tokens.To investigate whether image tokens need to incorporate information from other tokens via attention mechanisms to build a class-identifiable representation, we conducted perturbation experiments. For the hidden representation of every token \(i\) we set to 0 all attention weights from each image token \(\mathbf{x}_{i}\) to every other image token \(\{\mathbf{x}_{j}:j\neq i\}\). We found that the perturbations erased the class identifiability of image tokens in the last block (mean class identifiability decreased from 60.73% to 0.12%). The results suggest that image tokens cannot develop class-identifiable representations in isolation. In contrast, when removing the attention weights between the image tokens and the [CLS] token, the class identifiability rate of image tokens remained unchanged, implying that image tokens do not need to extract information from the [CLS] token to build a class representation. These results are aligned to those of Zhai et al. [21], who showed that ViTs trained without the [CLS] token can achieve similar performance to models that include it. The impact of context on the class representations of image tokens.Class-identifiable representations may emerge earlier and more strongly in image tokens that belong to portions of an image depicting the class (e.g., striped patterns in an image of a zebra). Leveraging the semantic segmentation labels from the ImageNet-S, we compared the identifiability rate of class-labeled and context-labeled image tokens. Our results confirmed our hypothesis, revealing earlier and more identifiable class representations in class- than context-labeled tokens (see Fig. 3a for ViT-B/32 and appendix for the other variants). However, in deeper blocks, both types of tokens exhibited high identifiability scores, indicating that class representations also emerged in image tokens that do not depict the class. This might be the result of context tokens extracting class-relevant information via attention mechanisms from class-labeled tokens, or it might stem from the class prototype representation incorporating information about the context commonly associated with the class. To further explore the extent to which class-labeled tokens are needed for context-labeled tokens to build a class representation, and vice-versa, we conducted a token-perturbation study in ViT-B/32. We removed either class- or context-labeled tokens from the input (after the addition of position embeddings), and measured the class-identifiability rates of the remaining image tokens in the last block. We found that in both cases the removal of information reduced to a certain extent the class identifiability scores. Concretely, the original identifiability rate of class-labeled tokens of 71.91% decreased to 44.70%, while that of context-labeled tokens decreased from 56.24% to 38.68%. On the one hand, these results suggest that class-labeled tokens need context for building more identifiable class representations. On the other hand, they show that context-labeled tokens can build class-identifiable representations without the classes themselves being depicted in the image, which suggests that ViTs have incorporated into their class prototypes contextual information. This latter finding is in line with previous studies showing that CNNs can identify a class based on context pixels only [5], leading to impoverished performance in out-of-distribution scenarios. ## 6 Mechanistic interpretability applications After establishing our ability to project ViT's internal representations onto the class embedding space to investigate the development of categorical representations, this section elaborates on how this framework can examine the involvement of self-attention and MLP layers in this process. Our findings indicate that both types of layers contribute to the building of class representations through key-value memory pair mechanisms. MLP layers leverage this system to produce strong categorical updates in late blocks that are highly predictive of the model's performance, while self-attention layers promote weaker yet more disseminated and compositional updates applied earlier in the hierarchy. Building of class representations.To investigate the extent to which self-attention and MLP layers help build categorical representations, we measured the _class similarity change rate_ induced by these sub-modules. Given a layer with input/output tokens and a class embedding matrix, we computed the proportion of output tokens whose correct class logits increase relative to the corresponding logits for input tokens, where all logits are obtained by projecting the tokens onto the class embedding space (see Fig. 1a). Concretely, we projected the output of each layer \(\mathbf{O}^{l}(\mathbf{X})\) onto the class embedding space by \(\mathbf{p}_{\text{out}}=\mathbf{E}\cdot\mathbf{O}^{l}(\mathbf{X})^{T}\), and compared it to the projection of the input itself \(\mathbf{p}_{\text{inp}}=\mathbf{E}\cdot\mathbf{X}^{T}\). We then quantified the proportion of tokens \(i\) where \(p_{\text{out}}^{i}>p_{\text{inp}}^{i}\). We found that, although the evolution of the class similarity change rate differed across ViT variants (see appendix and Fig. 3b for ViT-B/32), some general patterns can be observed. First, self-attention layers exhibited a higher-than-chance class similarity change rate during at least some processing stages. The increment was generally higher for the [CLS] tokens, which trivially need attention mechanisms for creating a class representation given that their initial input is identical across images. In contrast, the class similarity change of MLP layers peaked in the penultimate(ish) blocks (except for the GAP variant) but was otherwise below chance level. The next sections investigate the reasons behind these peaks. An open question from the previous experiment is how the class representations developed by the self-attention and MLP layers are incorporated into the residual stream. To measure this, we took inspiration from Geva et al. [11] and quantified the proportion of tokens whose top-1 prediction in the residual stream equaled that of the self-attention layer, that of the MLP layer, that of the residual stream before being processed by these layers, or neither of them (indicating that the residual stream has built a new composite prediction). We found that in early blocks the predictions of the residual stream were mostly compositional, integrating information from the self-attention and MLP layers but not being dominated by their outputs (see appendix and Fig. 3c for ViT-B/32). At later stages, the residuals incorporated more directly the predictions of the sub-modules. Results showed that the influence of self-attention layers peaked in the last block. In the MLP case, the highest values were found in block 11 (or in layers closer to the last block in the case of ViT-L/16). The exception of this latter pattern was ViT-B/16 trained with GAP, where MLP influenced the residual of the last block the most. This could be due to being the only variant where the final MLP layer can influence the classification output. In the other models, the previous to last MLP layers are those from which the [CLS] token can ultimately extract information for classification (through the self-attention layer in the last block). Categorical updates.To investigate how self-attention and MLP layers carry out categorical updates by promoting class-prototype representations, we projected their output parameter matrices (\(\mathbf{W}_{\text{out}}\) of eq. 2 and eq. 3) onto the class-embedding space, by computing \(\mathbf{P}_{W_{\text{out}}}=\mathbf{E}\cdot\mathbf{W}_{\text{out}}^{T}\). The rows of \(\mathbf{E}\) and \(\mathbf{W}_{\text{out}}\) were normalized to unit length to enable comparison across ViT variants. This projection measures the extent to which each row in the output parameter matrices reflects the classes encoded in the embedding space, and thus probes whether the value vectors of the key-value memory pair system have high correspondence with class prototype representations. We were interested in evaluating the extent to which class prototypes had at least one memory value in a given layer \(l\) that resembles their representation. Hence, we extracted the maximum value of each row in \(\mathbf{P}_{W_{\text{out}}}^{l}\) that denotes the highest similarity score obtained per class prototype in a given layer \(l\). We call this measure _class-value agreement score_. We found that, in deeper blocks, the class-value agreement scores of self-attention and MLP layers were significantly higher than those of a model initialized with random weights (Fig. 4a and appendix). This could be due to the model developing more complex and semantically meaningful keys at deeper stages. Results also showed that the peaks in MLP layers were higher than those of self-attention layers, indicating that MLP sub-modules promote stronger categorical updates. In addition, a manual inspection of the MLP layers containing high class-value agreement scores revealed that the value Figure 3: _Results for ViT-B/32._ **(a)** Class identifiability scores of class- and context-labeled tokens; **(b)** Class similarity change rate induced by self-attention and MLP layers; **(c)** Match between the top-1 predictions of the layers and the top-1 predictions of the residual stream. vectors may promote and cluster semantically similar and human-interpretable concepts (see appendix for examples). These patterns were observed across all variants except for ViT-GAP. Given that the later model averages the representations of the image tokens for the classification task, we hypothesize that in ViT-GAP categorical representations might be distributed across value vectors instead. Key-value memory pairs at inference time.To investigate if self-attention and MLP layers act as key-value memory pair systems at inference time, we measured how the keys that are most activated during the processing of a sample correspond to the value vectors that promote the representation of the correct class. Concretely, for each layer, we quantified the proportion of tokens where the 5 keys with the highest coefficients are associated with value vectors whose top-5 logits (obtained by the projection \(\mathbf{E}\cdot\mathbf{W}_{\text{out}}\)) indexed the correct class. We call this metric _key-value agreement rate_. As shown in Fig. 4b, in earlier blocks, the key-value agreement rates of self-attention layers were higher than those of MLP layers. The agreement rate of MLP layers peaked in the penultimate blocks, while self-attention layers peaked in the last blocks. The rates on these peaks were generally higher for self-attention layers. These findings indicate that, while self-attention layers promote weaker categorical representations (see previous section), the updates are carried out in more image tokens than in MLP layers. Of note, similarly to the class-value agreement score results, ViT-GAP exhibited a limited use of key-value memory pair systems. We further evaluated the influence of these mechanisms on the accuracy of the model, and compared the agreement rate of correctly classified vs. misclassified samples. We found that, for all variants excluding ViT-GAP, the agreement rates in the penultimate MLP layers of correctly classified samples were significantly higher (see appendix). In addition, in the majority of ViTs, a smaller yet significant difference was also found in the deeper self-attention layers. These findings suggest that the use of key-value memory pair mechanisms has a meaningful effect on the performance of the model. Compositionality of key-value memory pair mechanisms.The final output of a layer may combine the prediction of many key-value memory pairs, and predict a class distribution that is different from that of its most activating memories. Inspired by Geva et al. [11], we measured the compositionality of the key-value memory pair system by quantifying the number of instances where a layer's final predictions matched any of the predictions of the top-5 most activated memories for that instance. Results showed that for all variants except ViT-GAP, the penultimate MLP layers have low compositionality scores: between 50% and 70% of instances had a final prediction that matched the prediction of one of the most activated memories (see appendix). Self-attention layers also decreased their compositionality in the last blocks, but their scores were still higher than MLP layers: more than 70% of instances had a composite prediction (except for ViT-CIFAR, see appendix). ## 7 Explainability application In this section, we show that our framework can also be used to identify the parts of an image that would be the most important for detecting a class of interest, at each processing stage of ViT. Figure 4: _Key-value memory pair mechanisms._**(a)** Class-value agreement scores, which measure the extent to which the layers promote class prototype representations; **(b)** Key-value agreement rates, which quantify the proportion of tokens promoting the correct class using key-value memory pair systems. Having demonstrated that class representations develop gradually over the ViT hierarchy, and that image tokens differentially represent categorical information, we propose to use a gradient approach to quantify how much an image token of a given block would contribute to form a categorical representation in the [CLS] token. In detail, our explainability method can be applied as follows: 1. For the \(j^{\text{th}}\) image and the \(b^{\text{th}}\) block, project the hidden representation of the [CLS] token \(\mathbf{x}_{\text{cls}}^{b}\) onto the class embedding space, and compute the cross-entropy loss \(L_{\text{CE}}\) of the class of interest \(c_{j}\), such that \(\ell_{j}^{b}=L_{\text{CE}}(\mathbf{E}\cdot\mathbf{x}_{\text{cls}}^{b},c_{j})\). This projection quantifies how close is the representation of the [CLS] token to the prototype representation of the class of interest. 2. Compute the gradient of \(\ell_{j}^{b}\) with respect to the attention weights \(\mathbf{a}_{j}^{b}\) that the [CLS] tokens assigned to the image tokens in an attention head in the self-attention layer, such that \(\nabla\ell_{j}^{b}=-\partial\ell_{j}^{b}/\partial\mathbf{a}_{j}^{b}\). Since we are interested in how the image tokens decrease the cross-entropy loss, we negate the gradients. In simple terms, this step estimates the rate at which an image token would increase the correct class representation of the [CLS] token if more attention were allocated to it. The final output will consist of importance scores assigned to every image token of a block and attention head that can be visualized as a heatmap over the image (see Fig. 5a). Of note, the block- and attention-head-specific visualizations of our explainability framework differ from other widely used methods that generate global relevancy maps, for example by computing the gradients of the class logits at the final layer with respect to the input and/or aggregating the information propagated across layers up to the class embedding projection (see [6] for an overview). Instead, our method can visualize the categorical information contained in the image tokens independently for each block and attention head. This allows us to (1) better understand how categorical information is hierarchically built, and (2) characterize the importance of each block in building the class representations. In addition, our method is class-generalizable and can be used to identify the features that would lead to the assignment of different class labels (see Fig. 5). Thus, it can be used to uncover the parts of an image that produce an incorrect prediction or trigger different predictions in a multi-label classification task. Moreover, since our framework identifies the image tokens that would increase the categorical representations of the [CLS] token, its results can be compared to the actual attention weights assigned by this type of token, to shed light on what aspects of an image the network neglects or emphasizes in relation to the class-optimal ones. Besides providing block- and attention-head-specific visualizations, our framework can also be used to generate a traditional global relevancy map. Concretely, we can aggregate the gradients over the blocks and attention heads, by \(\sum_{b}\nabla\ell^{b}\), and obtain a final feature importance map that takes into account the relevance of each image token at every stage of processing (see Fig. 5b). The sum procedure also allows us to corroborate that we obtain a fair portrayal of the individual contribution of each block and attention head to the final class representation. To validate the quality of our global relevancy maps, we compared our approach with an established explainability method [6]. Testing ViT-B/32, we separately applied both methods and: (1) Quantified Figure 5: _Examples of feature importance visualization in ViT-B/32._ **(1)** Image example where the correct label is “Impala”, but the model predicts “Ibex”. **(2)** Image example with multiple labels. the importance of each image token; (2) Gradually removed the tokens with the least to most importance scores (negative perturbation test); (3) Gradually removed the tokens with the most to least importance (positive perturbation test); (4) Measured the accuracy of the model with each removal; (5) Computed the Area Under the Curve (AUC) of the final accuracies. Our results showed that our framework yields similar results to those of Chefer et al. [6] (see appendix), highlighting the adequacy of our approach. In addition, we found that we could maintain, and even improve, the accuracy of ViT-B/32 with the removal of up to 60% of the least important tokens. More generally, the AUC of our perturbed model was significantly higher (neg. perturbation) and lower (pos. perturbation) than that of a model whose token removal order was randomly determined. ## 8 Comparison with a linear probing approach Linear probing is a widely used interpretability tool that consists of training linear classifiers to uncover the features represented in the inner layers of a model. Similarly to the goals of our interpretability framework, to shed light on the relevant factors behind category-building processes in neural networks, linear probing is sometimes used to predict from internal layers the classes represented in the output projection matrix [1]. However, previous studies (e.g. [19]) have shown that this approach can highlight features that are not relevant to the model's task. In other words, a successful probing result can reflect the separability of feature representations that are ignored by the model in the class embedding space. In contrast, our framework directly quantifies how the inner representations of ViT increasingly align with the representations encoded in the class prototypes. To substantiate the disparity in insights derived from both methods, we conducted the following experiment. Reproducing the linear probing approach taken by Raghu et al. [18], we trained separate 10-shot linear classifiers on ImageNet-S for each token position and layer of a ViT-B/32. To test if the information learned with these probes sheds light on the categorical decisions taken by the network, we conducted negative and positive perturbation tests. Concretely, we quantified the class identifiability scores obtained from the linear probes for each token, gradually removed those with the least to most identifiable scores (for negative perturbation; vice-versa for positive perturbation), and measured the accuracy of the model with each removal. We compared these results with those of our framework's positive and negative perturbation experiments reported in the previous section. We found that even if linear probes could generally decode with better top-1 accuracy the classes in some of the inner layers, the obtained scores do not significantly predict the relevance of the image tokens in the categorical decision of the network (see appendix). Notably, when used for the same goals, our framework (1) is more time-efficient: it comprises a one-forward pass on validation images, while linear probes additionally involve a one-forward pass over the training images and the fitting of a linear classifier for every token position and layer; and (2) can be used in low-resource scenarios, where the training of additional models is difficult due to small datasets or reduced computing capabilities. ## 9 Conclusions With the increasing use of ViTs in the field of computer vision, it is necessary to build methods to understand their inner mechanisms and explain their predictions. Our work introduces an intuitive framework for such purposes that does not require optimization and provides interesting, human-interpretable insights into these networks. Concretely, we demonstrated how our method can extract class representations from the hidden states of image tokens across the hierarchy of ViT, providing insights into the category-building processes within these networks. Additionally, we used our framework to elucidate the distinct roles of self-attention and MLP layers in this process, revealing that they promote differential categorical updates that partly depend on key-value memory pair mechanisms. Lastly, we emphasized the utility of this method for explainability purposes, aiding in the identification of the most pertinent parts of an image for the detection of a class of interest. Limitations.This work only studies ViTs trained for image classification. Future work could investigate how to adapt our framework to examine the inner representations of models with other types of output embeddings. In addition, we did not explore how our approach might be used for model editing or performance improvement purposes. Some mechanistic interpretability insights gained in this work point to aspects of ViT that could be manipulated for these goals in future studies. Acknowledgments This project was partly funded by the German Research Foundation (DFG) - DFG Research Unit FOR 5368. We are grateful to access to the computing facilities of the Center for Scientific Computing at Goethe University, and of the Ernst Stringmann Institute for Neuroscience.

2306.00618

Effective Structured Prompting by Meta-Learning and Representative Verbalizer

Prompt tuning for pre-trained masked language models (MLM) has shown promising performance in natural language processing tasks with few labeled examples. It tunes a prompt for the downstream task, and a verbalizer is used to bridge the predicted token and label prediction. Due to the limited training data, prompt initialization is crucial for prompt tuning. Recently, MetaPrompting (Hou et al., 2022) uses meta-learning to learn a shared initialization for all task-specific prompts. However, a single initialization is insufficient to obtain good prompts for all tasks and samples when the tasks are complex. Moreover, MetaPrompting requires tuning the whole MLM, causing a heavy burden on computation and memory as the MLM is usually large. To address these issues, we use a prompt pool to extract more task knowledge and construct instance-dependent prompts via attention. We further propose a novel soft verbalizer (RepVerb) which constructs label embedding from feature embeddings directly. Combining meta-learning the prompt pool and RepVerb, we propose MetaPrompter for effective structured prompting. MetaPrompter is parameter-efficient as only the pool is required to be tuned. Experimental results demonstrate that MetaPrompter performs better than the recent state-of-the-arts and RepVerb outperforms existing soft verbalizers.

Weisen Jiang, Yu Zhang, James T. Kwok

2023-06-01T12:44:33Z

http://arxiv.org/abs/2306.00618v2

# Effective Structured Prompting ###### Abstract Prompt tuning for pre-trained masked language models (MLM) has shown promising performance in natural language processing tasks with few labeled examples. It tunes a _prompt_ for the downstream task, and a _verbalizer_ is used to bridge the predicted token and label prediction. Due to the limited training data, prompt initialization is crucial for prompt tuning. Recently, MetaPrompting (Hou et al., 2022) uses meta-learning to learn a shared initialization for all task-specific prompts. However, a single initialization is insufficient to obtain good prompts for all tasks and samples when the tasks are complex. Moreover, MetaPrompting requires tuning the whole MLM, causing a heavy burden on computation and memory as the MLM is usually large. To address these issues, we use a prompt pool to extract more task knowledge and construct instance-dependent prompts via attention. We further propose a novel soft verbalizer (RepVerb) which constructs label embedding from feature embeddings directly. Combining meta-learning the prompt pool and RepVerb, we propose MetaPrompter for effective structured prompting. MetaPrompter is parameter-efficient as only the pool is required to be tuned. Experimental results demonstrate that MetaPrompter performs better than the recent state-of-the-arts and RepVerb outperforms existing soft verbalizers. Machine Learning, RepVerb, MetaPrompting, MetaPrompter 2021). Recently, a number of approaches have been proposed to alleviate this problem (Lester et al., 2021; Li et al., 2022; Vu et al., 2022). In particular, MetaPrompting (Hou et al., 2022) is the state-of-the-art that uses _meta-learning_(Bengio et al., 1991; Thrun and Pratt, 1998; Finn et al., 2017) to learn a meta-initialization for all task-specific prompts. However, MetaPrompting suffers from three problems. (i) When the tasks are complex, it is challenging to obtain good prompts for all tasks and samples from a single meta-initialized prompt. (ii) MetaPrompting uses a hand-crafted verbalizer. However, selecting good label tokens for the hand-crafted verbalizer is labor-intensive and not scalable for a large label set. (iii) MetaPrompting requires expensive tuning the whole MLM. Figure 1 shows a large gap in meta-testing accuracies with and without MLM tuning (experimental details are in Section 4). In this paper, we use a pool of multiple prompts (Li et al., 2022; Wang et al., 2022; 2) to extract task knowledge from meta-training tasks, and then construct instance-dependent prompts as weighted combinations of all the prompts in the pool via attention (Vaswani et al., 2017). The attention's query vector is the instance's feature embedding. The prompt pool is the shared meta-knowledge and learned by the MAML algorithm (Finn et al., 2017). Specifically, given a task with a support set and a query set, the base learner takes the meta-parameter and the support set to build a task-specific prompt pool, then the meta-learner optimizes the meta-parameter on the query set. Meta-learning a prompt pool is more flexible than meta-learning only a single prompt initialization (as in MetaPrompting), and allows better adaptation of complex tasks. Moreover, as only the prompt pool is tuned, it is much more parameter-efficient than MetaPrompting (with \(1000\times\) fewer parameters). We also propose a novel soft verbalizer called _representative verbalizer_ (RepVerb), which constructs label embeddings by averaging feature embeddings of the corresponding training samples. Unlike manually-designed verbalizers, RepVerb does not incur human effort for label token selection. Moreover, as RepVerb does not require learning any additional parameters, empirical results in Section 4.2 demonstrate that RepVerb is more effective than the soft verbalizers in WARP (Hambardzumyan et al., 2021), DART (Zhang et al., 2022), ProtoVerb (Cui et al., 2022). Besides, the feature embedding learned by RepVerb is more discriminative. The whole procedure, which combines meta-learning the structured prompts and RepVerb, is called **MetaPrompter** in the sequel. Experiments are performed on six widely used classification data sets. Results demonstrate that RepVerb outperforms existing soft verbalizers, and is also beneficial to other prompt-based methods such as MetaPrompting. Moreover, MetaPrompter achieves better performance than the recent state-of-the-arts. Our contributions are summarized as follows: (i) We propose a parameter-efficient algorithm MetaPrompter for effective structured prompting. (ii) We propose a simple and effective soft verbalizer (RepVerb). (iii) Experimental results demonstrate the effectiveness and parameter-efficiency of MetaPrompter. ## 2 Preliminaries and Related Work ### _Prompt Learning_ Recently, it is common to use a pre-trained MLM \(\mathcal{M}(\cdot;\phi)\), with parameter \(\phi\), for various downstream tasks such as language understanding (Dong et al., 2019; Yang et al., 2019; Song et al., 2020), machine translation (Conneau and Lample, 2019; Guo et al., 2020), and text classification (Brown et al., 2020; Lester et al., 2021; Liu et al., 2022). Given a raw sentence represented as a sequence of \(n\) tokens \((x_{1},\dots,x_{n})\), the MLM takes \(\mathbf{x}=(\texttt{[CLS]},x_{1},\dots,x_{n},\texttt{[SEP]})\) as input (where [CLS] is the start token and [SEP] is the separator), and encodes it into a sequence of hidden representations \((\mathbf{h}_{\texttt{[CLS]}},\mathbf{h}_{1},\dots,\mathbf{h}_{n},\mathbf{h}_{ \texttt{[SEP]}})\). In standard fine-tuning (Howard and Ruder, 2018; Devlin et al., 2019), an extra classifier (e.g., a fully connected layer with softmax normalization) is added on top of \(\mathbf{h}_{\texttt{[CLS]}}\) to predict the label distribution. This classifier, together with \(\phi\), are tuned to maximize the probability of correct labels. As language models are large (e.g., \(175\) billion parameters in GPT-3 (Brown et al., 2020)), fine-tuning all parameters can cause a heavy burden on computation and memory. On the other hand, prompt learning (Brown et al., 2020; Shin et al., 2020; Ding et al., 2022) freezes the pre-trained model and formulates the downstream task as a cloze-style MLM problem. For example, in topic classification, "Topic is [MASK]" can be used as the prompt, where [MASK] is a special token for prediction. The _discrete_ tokens "Topic is" are also called anchor tokens. An input text \(\mathbf{x}\) is wrapped with the prompt and mapped to an input embedding sequence \((\mathcal{E}(\mathbf{x}),\mathcal{E}(\texttt{Topic}),\mathcal{E}(\texttt{is}), \mathcal{E}(\texttt{[MASK]}))\), where \(\mathcal{E}(\cdot)\) denotes the input embedding. Designing a suitable prompt requires domain expertise and a good understanding of the downstream tasks (Brown et al., 2020; Sanh et al., Figure 1: 5-way 5-shot classification meta-testing accuracy of MetaPrompting with or without MLM tuning on six data sets. 2022). Thus, manually-designed prompts are likely to be sub-optimal. Unlike discrete prompts, prompt tuning (Lester et al., 2021; Liu et al., 2021) uses a _continuous_ prompt \(\mathbf{\theta}\in\mathbb{R}^{L_{p}\times d_{i}}\) (of length \(L_{p}\)) to directly wrap the input embedding sequence as \((\mathcal{E}(\mathbf{x}),\mathbf{\theta},\mathcal{E}(\texttt{[MASK]}))\). This can be further combined with anchor tokens to form a _template_(Liu et al., 2021; Schick and Schutze, 2021; Ding et al., 2022): \[\tilde{\mathbf{x}}\equiv\mathbb{T}(\mathbf{x};\mathbf{\theta})\!\!=\!\!(\mathcal{E }(\mathbf{x}),\mathbf{\theta},\mathcal{E}(\texttt{Topic}),\mathcal{E}(\texttt{ is}),\mathcal{E}(\texttt{[MASK]})).\] The MLM then outputs the hidden embedding \(\mathbf{h}_{\texttt{[MASK]}}(\tilde{\mathbf{x}})\in\mathbb{R}^{d_{o}}\) of [MASK], and infers the token to be filled at the [MASK] position. A _verbalizer_(Lester et al., 2021; Ding et al., 2022; Hu et al., 2022) bridges the prediction at the [MASK] position and labels in prompt learning. Specifically, it is a _hard_ mapping from each label \(y\) to a set of label-relevant tokens \(\mathcal{V}_{y}\). For example, for \(y=\texttt{SPORTS}\), we can have \(\mathcal{V}_{y}=\{\texttt{sports},\,\texttt{football},\,\texttt{basketball}\}\). Prompt tuning then optimizes1\((\mathbf{\phi},\mathbf{\theta})\) by maximizing the label probability: Footnote 1: \(\mathbf{\phi}\) can be fixed for parameter-efficiency in prompt learning. \[\hat{\mathbb{P}}(y|\mathbf{x};\mathbf{\phi},\mathbf{\theta})\!=\!\frac{1}{|\mathcal{V }_{y}|}\!\!\sum_{w\in\mathcal{V}_{y}}\!\!\mathbb{P}_{\mathcal{M}}(\texttt{[MASK]} =\texttt{w}|\mathbb{T}(\mathbf{x};\mathbf{\theta})), \tag{1}\] where \(\mathbb{P}_{\mathcal{M}}(\texttt{[MASK]}|\mathbb{T}(\mathbf{x};\mathbf{\theta}))\) is the probability distribution over vocabulary as predicted by the MLM at the [MASK] position. The verbalizer is crucial to the performance of prompt learning (Lester et al., 2021; Ding et al., 2022). However, selecting label-relevant tokens requires intensive human labor. To address this problem, search-based methods (Schick et al., 2020; Shin et al., 2020; Gao et al., 2021) try to find label tokens automatically from the training data. However, searching in a _discrete_ space is computationally intensive (Schick et al., 2020; Shin et al., 2020; Gao et al., 2021), especially with a large number of labels or vocabulary. Some recent works (Hambardzumyan et al., 2021; Zhang et al., 2022; Cui et al., 2022) propose _soft_ verbalizers, which map each label to a _continuous_ embedding and predict the label distribution based on the similarities between feature embedding and label embeddings. WARP (Hambardzumyan et al., 2021) and DART (Zhang et al., 2022) obtain this label embedding by supervised learning, while ProtoVerb (Cui et al., 2022) uses contrastive learning (Chen et al., 2020; Tian et al., 2020). However, learning the embedding \(\mathbf{v}_{y}\in\mathbb{R}^{d_{o}}\) for each label \(y\) can be challenging in the few-shot learning setting (Gao et al., 2019; Bao et al., 2020; Han et al., 2021; Chen et al., 2022; Hou et al., 2022), as the number of samples per class is typically much smaller than \(d_{o}\) (e.g., \(d_{o}=768\) for BERT (Devlin et al., 2019)). ### Meta-Learning for Prompt Learning In meta-learning (Bengio et al., 1991; Thrun and Pratt, 1998), a collection \(\mathcal{T}\) of tasks are used to learn a shared meta-parameter. Each task \(\tau\in\mathcal{T}\) has a support set \(\mathcal{S}_{\tau}\) and a query set \(\mathcal{Q}_{\tau}\). Let \(\mathcal{Y}_{\tau}\) be the label set of \(\tau\). Typical meta-learning algorithms can be metric-based (Vinyals et al., 2016; Snell et al., 2017; Bertinetto et al., 2018; Lee et al., 2019), memory-based (Santoro et al., 2016; Munkhdalai and Yu, 2017), or optimization-based (Finn et al., 2017; Rajeswaran et al., 2019; Raghu et al., 2020; Ye et al., 2021; Jiang et al., 2021; Elsnerhag et al., 2022). In general, the optimization-based approach is preferred due to its simplicity and effectiveness. A representative algorithm is model-agnostic meta-learning (MAML) (Finn et al., 2017). As prompt tuning is sensitive to prompt initialization in few-shot tasks (Lester et al., 2021), meta-learning can be used to search for a good initialization. MetaPrompting (Hou et al., 2022) uses MAML to learn a meta-initialization for the task-specific prompts. At iteration \(t\), the base learner takes a task \(\tau\) and meta-parameter \((\mathbf{\phi}_{t-1},\mathbf{\theta}_{t-1})\), and builds a task-specific model \((\mathbf{\phi}_{t,J},\mathbf{\theta}_{t,J})\) by performing \(J\) gradient updates on the support set with step size \(\alpha\) and initialization \((\mathbf{\phi}_{t,0},\mathbf{\theta}_{t,0})\equiv(\mathbf{\phi}_{t-1},\mathbf{\theta}_{t-1})\): \[(\mathbf{\phi}_{t,j},\mathbf{\theta}_{t,j})=(\mathbf{\phi}_{t,j-1},\mathbf{\theta }_{\mathbf{x},j-1})\] \[+\alpha\nabla_{(\mathbf{\phi}_{t,j-1},\mathbf{\theta}_{\mathbf{x},j-1})} \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\! into a pool of multiple prompts, and constructs instance-dependent prompts by attention (Vaswani et al., 2017). ### Representative Verbalizer (RepVerb) Instead of explicitly learning an embedding \(\mathbf{v}_{y}\) for each label \(y\)(Hambardzumyan et al., 2021; Cui et al., 2022; Zhang et al., 2022), we propose the _Representative Verbalizer_ (RepVerb), which constructs \(\mathbf{v}_{y}\) from feature embeddings of the corresponding training samples (Algorithm 1). It does not require learning additional parameters, and is thus more effective on limited data as in few-shot learning. Specifically, let \(\mathcal{S}_{\tau,y}\) be the subset of samples in \(\mathcal{S}_{\tau}\) with label \(y\). For an input \(\mathbf{x}\), we wrap it with the template and feed \(\tilde{\mathbf{x}}\equiv\mathbb{T}(\mathbf{x};\mathbf{\theta})\) to the pre-trained MLM, and then obtain [MASK]'s embedding \(\mathbf{h}_{\texttt{[MASK]}}(\tilde{\mathbf{x}})\) as its feature embedding. Similar to ProtoNet (Snell et al., 2017), we propose to construct \(\mathbf{v}_{y}\) for each \(y\) by averaging the corresponding samples' feature embeddings, as: \[\mathbf{v}_{y}=\frac{1}{|\mathcal{S}_{\tau,y}|}\sum_{(\mathbf{x},y)\in \mathcal{S}_{\tau,y}}\mathbf{h}_{\texttt{[MASK]}}(\tilde{\mathbf{x}}). \tag{2}\] To predict the label of a given \(\mathbf{x}\), we measure the cosine similarity2 between \(\mathbf{h}_{\texttt{[MASK]}}(\tilde{\mathbf{x}})\) and each \(\mathbf{v}_{y}\) (\(y\in\mathcal{Y}_{\tau}\)): Footnote 2: Dissimilarity measures, such as the Euclidean distance, can also be used. \[\tilde{\mathbb{P}}(y|\mathbf{x};\mathbf{\phi},\mathbf{\theta})\!=\!\frac{\exp(\rho\cos (\mathbf{v}_{y},\mathbf{h}_{\texttt{[MASK]}}(\tilde{\mathbf{x}})))}{\sum_{y^ {\prime}\in\mathcal{Y}}\!\exp(\rho\cos(\mathbf{v}_{y^{\prime}},\mathbf{h}_{ \texttt{[MASK]}}(\tilde{\mathbf{x}})))}, \tag{3}\] where \(\rho>0\) is the temperature. When \(\rho\to\infty\), \(\tilde{\mathbb{P}}(y|\mathbf{x};\mathbf{\phi},\mathbf{\theta})\) becomes one-hot; whereas when \(\rho\to 0\), \(\tilde{\mathbb{P}}(y|\mathbf{x};\mathbf{\phi},\mathbf{\theta})\) becomes uniform. In the experiments, we set \(\rho=10\) as in Oreshkin et al. (2018). ### Meta Structured-Prompting In the following, we propose the use of MAML and attention mechanism (Vaswani et al., 2017) to meta-learn a prompt pool. While MetaPrompting uses task-specific prompts (Hou et al., 2022), we propose the construction of instance-specific prompts, which allows more flexibility. #### 3.2.1 Meta-Learn a Prompt Pool While MetaPrompting uses only a single initialization for the prompt, we propose to leverage a pool of prompts to extract more task knowledge, which is particularly effective when the tasks are complex and very different prompts may be needed. A prompt pool has \(K\) learnable prompts \(\{(\mathbf{k}_{i},\mathbf{\theta}_{i}):i=1,\ldots,K\}\), with key \(\mathbf{k}_{i}\in\mathbb{R}^{d_{o}}\) and value \(\mathbf{\theta}_{i}\in\mathbb{R}^{L_{p}\times d_{i}}\)(Li et al., 2022; Wang et al., 2022;b). Note that the size of the prompt pool is negligible compared with that of the MLM. For example, in our experiments, the MLM has \(109.52\times 10^{6}\) parameters, while the prompt pool has only \(55,296\). The prompt pool can be considered as shared meta-knowledge. Given an input \(\mathbf{x}\), the attention weights between \(\mathbf{x}\) and the \(K\) prompts are computed as \(\mathbf{a}=\mathrm{softmax}(\frac{\mathbf{K}\mathbf{q}_{\mathbf{x}}}{\sqrt{d_ {o}}})\), where \(\mathrm{softmax}(\cdot)\) is the softmax function, \(\mathbf{K}=[\mathbf{k}_{1}^{\top};\ldots;\mathbf{k}_{K}^{\top}]\), and \(\mathbf{q}_{\mathbf{x}}\in\mathbb{R}^{d_{o}}\) is the embedding of the [MASK] output by a pre-trained and frozen MLM with the wrapped input (e.g., (\(\mathbf{x}\). Topic is [MASK])) (Wang et al., 2022;b). Such a mapping from \(\mathbf{x}\) to \(\mathbf{q}_{\mathbf{x}}\) is called the query function \(q(\cdot)\). An instance-dependent prompt is then generated by weighted averaging over all the values (\(\mathbf{\theta}_{i}\)'s): \[\mathbf{\theta}_{\mathbf{x}}(\mathbf{K},\mathbf{\Theta})=\sum_{i=1}^{K}a_{i}\mathbf{ \theta}_{i}, \tag{4}\] where \(\mathbf{\Theta}=[\mathbf{\theta}_{1};\ldots;\mathbf{\theta}_{K}]\). While Wang et al. (2022;b) only select the top-\(N\) most similar prompts from the pool, in (4) all the prompts are used and updated simultaneously. The proposed procedure for meta-learning the prompt pool \((\mathbf{K},\mathbf{\Theta})\), which will be called MetaPrompter, is shown in Algorithm 2. The MAML algorithm (Finn et al., 2017) is used here, but other meta-learning algorithms (e.g., Reptile (Nichol et al., 2018), BMG (Flennerhag et al., 2022)) can also be used. At iteration \(t\), the base learner takes \((\mathbf{K}_{t-1},\mathbf{\Theta}_{t-1})\) and a task \(\tau\) to optimize for a task-specific prompt pool by gradient descent (steps 4-15). \((\mathbf{K}_{t-1},\mathbf{\Theta}_{t-1})\) is used as the initialization (step 4). For each inner iteration \(j\), \((\mathbf{K}_{t,j-1},\mathbf{\Theta}_{t,j-1})\) constructs the instance-dependent prompts \(\mathbf{\theta}_{\mathbf{x},j}(\mathbf{K}_{t,j-1},\mathbf{\Theta}_{t,j-1})\) in (4) (steps 7 and 8). Next, \(\mathbf{\theta}_{\mathbf{x},j}\) is used to predict the label probability with a combination of the hand-crafted verbalizer (step 9) and soft verbalizer (steps 11 and 12): \[\mathbb{P}(y|\mathbf{x};\mathbf{\theta}_{\mathbf{x},j})\!=\!(1-\lambda)\hat{\mathbb{ P}}(y|\mathbf{x};\mathbf{\theta}_{\mathbf{x},j})+\lambda\tilde{\mathbb{P}}(y| \mathbf{x};\mathbf{\theta}_{\mathbf{x},j}), \tag{5}\] where \(\lambda\in[0,1]\) (in the experiments, we set \(\lambda=0.5\)). Let \(\mathcal{L}(\mathcal{S}_{\tau};\mathbf{K}_{t,j-1},\mathbf{\Theta}_{t,j-1})=-\sum_{( \mathbf{x},y)\in\mathcal{S}_{\tau}}\log\mathbb{P}\left(y|\mathbf{x};\mathbf{\theta }_{\mathbf{x},j}\right)\) be the loss on \(\mathcal{S}_{\tau}\) (step 13). The base learner builds a task-specific prompt pool \((\mathbf{K}_{t,J},\mathbf{\Theta}_{t,J})\) by taking \(J\) gradient updates (\(j=1,\ldots,J\)) at step 14: \[(\mathbf{K}_{t,j}\mathbf{\Theta}_{t,j})\!\!=\!\!(\mathbf{K}_{t,j-1}\mathbf{ \Theta}_{t,j-1})\!\!-\!\!\alpha\nabla_{\!\mathbf{X}_{t,\mathbf{x}_{t},\mathbf{ x}_{t},\mathbf{\Theta}_{t-1}}}\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\! ## 4 Experiments ### Setup Following Chen et al. (2022), we perform few-shot classification on six popularly used data sets: (i) _20News_(Lang, 1995), which contains informal discourses from news discussion forums of \(20\) topics; (ii) _Amazon_(He & McAuley, 2016), which consists of customer reviews from \(24\) products. The task is to classify reviews into product categories; (iii) _HuffPost_(Misra, 2022), which contains news headlines of \(41\) topics published in the HuffPost between 2012 and 2018. These headlines are shorter and less grammatical than formal sentences, thus are more challenging for classification; (iv) _Reuters_(Lewis, 1997), which is a collection of Reuters newswire articles of \(31\) topics from \(1996\) to \(1997\); (v) _HWU64_(Liu et al., 2019), which is an intent classification data set containing user utterances of \(64\) intents; (vi) _Liu54_(Liu et al., 2019), which is an imbalanced intent classification data set of 54 classes collected on Amazon Mechanical Turk. We use the meta-training/meta-validation/meta-testing splits provided in Chen et al. (2022). A summary of the data sets is in Table 1. Following (Bao et al., 2020; Han et al., 2021; Chen et al., 2022; Hou et al., 2022), we perform experiments in the 5-way 1-shot and 5-way 5-shot settings with \(15\) query samples per class. The pre-trained BERT (_bert-base-uncased_) from HuggingFace (Wolf et al., 2020) is used as the pre-trained MLM as in (Chen et al., 2022; Hou et al., 2022). Experiments are run on a DGX station with \(8\) V100 \(32\)GB GPUs. The experiment is repeated three times with different random seeds. ### Evaluation on RepVerb First, we compare the performance of the proposed RepVerb with state-of-the-art soft verbalizers: (i) WARP (Hambardzumyan et al., 2021)3, and (ii) ProtoVerb (Cui et al., 2022). As the focus is on evaluating verbalizers, all methods use the same discrete prompt "Topic is [MASK]", and fine-tune all parameters for \(5\) steps with a learning rate of \(0.00005\) as in Cui et al. (2022). Footnote 3: Note that the verbalizer of WARP is the same as that of DART (Zhang et al., 2022). Its implementation is described in Appendix A. **Results**. Table 2 reports the meta-testing accuracies. As can be seen, RepVerb outperforms WARP and ProtoVerb on both the \(1\)-shot and \(5\)-shot settings. Figure 2 shows the t-SNE visualization of the embeddings (\(\textbf{h}_{\texttt{[MASK]}}(\textbf{x})\)'s) of \(100\) samples (**x**'s)4 and learned label embeddings (**v\({}_{y}\)'s) for a random 5-way 5-shot task from _Reuters_.5 As can be seen, the RepVerb embedding is more discriminative and compact than those of WARP and ProtoVerb. Moreover, by design, RepVerb's label embedding is consistent with the samples' feature embeddings, while those of WARP and ProtoVerb are not. Footnote 5: \(\text{-way}\times\) (5 support samples + 15 query samples) = 100. Footnote 5: Results on the other data sets are in Figure 7 of Appendix B. ### Evaluation on MetaPrompter We compare MetaPrompter with a variety of baselines. These include state-of-the-art prompt-based methods of (i) MetaPrompting (Hou et al., 2022), and its variants (ii) MetaPrompting+WARP / MetaPrompting+ProtoVerb / MetaPrompting+RepVerb, which combine MetaPrompting with the soft verbalizer of WARP / ProtoVerb / RepVerb, respectively. Moreover, we also compare with the non-prompt-based methods of: (iii) HATT (Gao et al., 2019), which meta-learns a prototypical network (Snell et al., 2017) with a hybrid attention mechanism; (iv) DS (Bao et al., 2020), which learns attention scores based on word frequency; (v) MLADA (Han et al., 2021), which uses an adversarial domain adaptation network to extract domain-invariant features during meta-training; and (vi) ContrastNet (Chen et al., 2022), which performs feature extraction by contrastive learning. For MetaPrompter, hyperparameters \(K\) and \(L_{p}\) are chosen from \(\{1,2,4,8,16,32,64\}\) using the meta-validation set. For the base learner, \(\alpha=0.1\), and \(J=5\) (resp. \(15\)) at meta-training (resp. meta-validation or meta-testing). We train the prompt pool for \(T=3,000\) iterations using the Adam optimizer (Kingma & Ba, 2015) with a learning rate of \(0.001\). To prevent overfitting, we evaluate the meta-validation performance every \(50\) iteration and choose the checkpoint with the best meta-validation performance for meta-testing. For the hand-crafted verbalizer used in (1), label tokens are obtained by tokenizing the class name and its synonyms as in (Hou et al., 2022; Hu et al., 2022). Following Lester et al. \begin{table} \begin{tabular}{c c c c} \hline \hline & \#classes & \#samples & \#tokens per sample \\ & (meta-train/valid/test) & & (mean \(\pm\) std) \\ \hline _20News_ & \(8/5/7\) & \(18,820\) & \(340\pm 151\) \\ _Amazon_ & \(10/5/9\) & \(24,000\) & \(140\pm 32\) \\ _HuffPost_ & \(20/5/16\) & \(36,900\) & \(11\pm 4\) \\ _Reuters_ & \(15/5/11\) & \(620\) & \(168\pm 136\) \\ _HWU64_ & \(23/16/25\) & \(11,036\) & \(7\pm 3\) \\ _Liu54_ & \(18/18/18\) & \(25,478\) & \(8\pm 4\) \\ \hline \hline \end{tabular} \end{table} Table 1: Statistics of the data sets. Figure 2: t-SNE visualization of [MASK]’s embeddings (crosses) and label embeddings (circles) for a 5-way 5-shot task randomly sampled from _Reuters_. (2021), prompts are initialized from input embeddings of randomly sampled label tokens for both MetaPrompting and MetaPrompter. **Results**. Table 3 shows the number of parameters and meta-testing accuracy in the \(5\)-shot setting. As can be seen, MetaPrompter is more accurate than both prompt-based and non-prompt-based baselines. Moreover, since MetaPrompter only tunes the prompt pool and keeps the language model frozen, it has much fewer meta-parameters than MetaPrompting and ContrastNet. Furthermore, MetaPrompting+RepVerb performs better than MetaPrompting+WARP and MetaPrompting+ProtoVerb, demonstrating that the proposed RepVerb is also beneficial to MetaPrompting. Table 4 shows the number of parameters and meta-testing accuracy in the \(5\)-way \(1\)-shot setting. As can be seen, the state-of-the-art prompt-based methods always achieve higher accuracies than the non-prompt-based ones. Furthermore, MetaPrompter performs the best on 5 of the 6 data sets. Besides, RepVerb is again useful to MetaPrompting on all six data sets. ### Visualization In this section, we visualize the meta-knowledge in the prompt pool learned from the 5-way 5-shot classification task on _Reuters_. Table 5 shows the nearest tokens to each of the \(K\) (\(=8\)) learned prompts. Figure 3 shows the average attention weights between the \(K\) prompts and meta-training \begin{table} \begin{tabular}{c c c c c c c c} \hline \hline & \#param (\(\times 10^{6}\)) & _20News_ & _Amazon_ & _HuffPost_ & _Reuters_ & _HWU64_ & _Liu54_ \\ \hline HATT\({}^{\dagger}\)(Gao et al., 2019) & \(0.07\) & \(44.20\) & \(49.10\) & \(41.10\) & \(43.20\) & - & - \\ DS\({}^{\dagger}\)(Bao et al., 2020) & \(1.73\) & \(52.10\) & \(62.60\) & \(43.00\) & \(81.80\) & - & - \\ MLADA\({}^{\dagger}\)(Han et al., 2021) & \(0.73\) & \(59.60\) & \(68.40\) & \(64.90\) & \(82.30\) & - & - \\ ContrastNet\({}^{\dagger}\)(Chen et al., 2022) & \(109.52\) & \(71.74\) & \(76.13\) & \(53.06\) & \(86.42\) & \(86.56\) & \(85.89\) \\ \hline MetaPrompting (Hou et al., 2022) & \(109.52\) & \(82.46\pm 0.50\) & \(76.92\pm 0.77\) & \(68.62\pm 0.56\) & \(92.56\pm 0.77\) & \(91.06\pm 0.41\) & \(87.79\pm 0.29\) \\ MetaPrompting +WARP & \(109.52\) & \(82.93\pm 0.39\) & \(78.27\pm 0.72\) & \(67.78\pm 0.41\) & \(94.74\pm 0.56\) & \(91.30\pm 0.35\) & \(88.69\pm 0.26\) \\ MetaPrompting+ProtoVerb & \(109.52\) & \(83.15\pm 0.41\) & \(78.19\pm 0.65\) & \(68.96\pm 0.52\) & \(95.26\pm 0.40\) & \(91.27\pm 0.63\) & \(90.05\pm 0.15\) \\ MetaPrompting+RepVerb & \(109.52\) & \(84.13\pm 0.30\) & \(78.59\pm 0.43\) & \(\mathbf{69.02}\pm 0.51\) & \(95.78\pm 0.33\) & \(91.32\pm 0.44\) & \(90.13\pm 0.20\) \\ MetaPrompter & \(0.06\) & \(\mathbf{84.62}\pm 0.29\) & \(\mathbf{79.05}\pm 0.21\) & \(67.12\pm 0.23\) & \(\mathbf{96.34}\pm 0.20\) & \(\mathbf{92.11}\pm 0.30\) & \(\mathbf{93.72}\pm 0.18\) \\ \hline \hline \end{tabular} \end{table} Table 4: Number of parameters and 5-way 1-shot Meta-testing classification accuracy. Results marked with \({}^{\dagger}\) are from Chen et al. (2022). \begin{table} \begin{tabular}{c c c c c c c c} \hline \hline & & _20News_ & _Amazon_ & _HuffPost_ & _Reuters_ & _HWU64_ & _Liu54_ \\ \hline \multirow{3}{*}{\(5\)-shot} & WARP (Hambardzumyan et al., 2021) & \(61.43\pm 0.15\) & \(59.53\pm 0.20\) & \(46.31\pm 0.31\) & \(68.67\pm 0.71\) & \(68.60\pm 0.40\) & \(73.11\pm 0.26\) \\ & ProtoVerb (Cui et al., 2022) & \(71.33\pm 0.11\) & \(71.74\pm 0.21\) & \(57.93\pm 0.17\) & \(80.93\pm 0.54\) & \(73.43\pm 0.51\) & \(76.19\pm 0.33\) \\ & RepVerb & \(\mathbf{78.81}\pm 0.08\) & \(\mathbf{77.56}\pm 0.16\) & \(\mathbf{61.90}\pm 0.08\) & \(\mathbf{88.33}\pm 0.40\) & \(\mathbf{78.37}\pm 0.49\) & \(\mathbf{82.14}\pm 0.23\) \\ \hline \multirow{3}{*}{\(1\)-shot} & WARP (Hambardzumyan et al., 2021) & \(49.87\pm 0.63\) & \(48.94\pm 0.34\) & \(38.21\pm 0.35\) & \(52.88\pm 0.67\) & \(53.20\pm 0.76\) & \(58.68\pm 0.64\) \\ & ProtoVerb (Cui et al., 2022) & \(54.13\pm 0.46\) & \(55.07\pm 0.27\) & \(41.40\pm 0.21\) & \(57.27\pm 0.73\) & \(55.17\pm 0.81\) & \(60.16\pm 0.37\) \\ & RepVerb & \(\mathbf{59.86}\pm 0.38\) & \(\mathbf{59.18}\pm 0.31\) & \(\mathbf{44.65}\pm 0.20\) & \(\mathbf{63.63}\pm 0.41\) & \(\mathbf{59.83}\pm 0.71\) & \(\mathbf{66.17}\pm 0.40\) \\ \hline \hline \end{tabular} \end{table} Table 2: Meta-testing accuracy of various verbalizers on 5-way few-shot classification. Figure 3: Distribution of attention weights on 5-way 5-shot classification of _Reuters_ (\(15\) topics). \begin{table} \begin{tabular}{c c c c c c c c} \hline \hline & \#param (\(\times 10^{6}\)) & _20News_ & _Amazon_ & _HuffPost_ & _Reuters_ & _HWU64_ & _Liu54_ \\ \hline HATT\({}^{\dagger}\)(Gao et al., 2019) & \(0.07\) & \(55.00\) & \(66.00\) & \(56.30\) & \(56.20\) & - & - \\ DS\({}^{\dagger}\)(Bao et al., 2020) & \(1.73\) & \(68.30\) & \(81.10\) & \(63.50\) & \(96.00\) & - & - \\ MLADA\({}^{\dagger}\)(Han et al., 2021) & \(0.73\) & \(77.80\) & \(86.00\) & \(64.90\) & \(96.70\) & - & - \\ ContrastNet\({}^{\dagger}\)(Chen et al., 2022) & \(109.52\) & \(71.74\) & \(85.17\) & \(65.32\) & \(95.33\) & \(92.57\) & \(93.72\) \\ \hline MetaPrompting (Hou et al., 2022) & \(109.52\) & \(85.67\pm 0.44\) & \(84.19\pm 0.30\) & \(72.85\pm 1.01\) & \(95.89\pm 0.23\) & \(93.86\pm 0.97\) & \(94.01\pm 0.26\) \\ MetaPrompting+WARP & \(109.52\) & \(85.81\pm 0.48\) & \(85.54\pm 0.20\) & \(71.71\pm 0.72\) & \(97.28\pm 0.30\) & \(93.99\pm 0.76\) & \(94.33\pm 0.27\) \\ MetaPrompting+ProtoVerb & \(109.52\) & \(86.18\pm 0.51\) & \(84.91\pm 0.38\) & \(73.11\pm 0.80\) & \(97.24\pm samples belonging to class (topic) \(y\): \[\frac{1}{|\mathcal{T}_{y}|}\sum_{\tau\in\mathcal{T}_{y}}\frac{1}{|\mathcal{S}_{ \tau,y}|}\sum_{(\mathbf{x},y)\in\mathcal{S}_{\tau,y}}\mathrm{softmax}\left(\frac {\mathbf{K}_{T,\mathcal{J}}\mathbf{q}_{\mathbf{x}}}{\sqrt{d_{o}}}\right),\] where \(\mathcal{T}_{y}\) is the subset of tasks in \(\mathcal{T}\) having class \(y\). As can be seen, samples from each target class prefer prompts whose tokens are related to that class. For example, samples from the topic _cocoa_ tend to use the 4th and 7th prompts (whose tokens are close to words like _cocoa_, _chocolate_ as can be seen from Table 5), while samples from the topic _coffee_ tend to use the 1st and 6th prompts (whose tokens are close to words like _coffee_ and _sugar_. Recall that the prompt pool has \(K\) learnable prompts \(\{(\mathbf{k}_{i},\mathbf{\theta}_{i}):i=1,\ldots,K\}\), with key \(\mathbf{k}_{i}\in\mathbb{R}^{d_{o}}\) and value \(\mathbf{\theta}_{i}\in\mathbb{R}^{L_{p}\times d_{i}}\). Let \(\mathbf{\theta}_{i}^{(j)}\) be the \(j\)th row of \(\mathbf{\theta}_{i}\). Moreover, let \(\frac{1}{|\mathcal{V}_{y}|}\sum_{\nu\in\mathcal{V}_{y}}\mathcal{E}(w)\) be the embedding of topic (class) \(y\), where \(\mathcal{V}_{y}\) is a set of tokens relevant to label \(y\) (obtained from Hou et al. (2022)), and \(\mathcal{E}(\cdot)\) is the input embedding. Figure 4 shows the cosine similarities between the learned prompt tokens \(\{\mathbf{\theta}_{i}^{(j)}:i=1,\ldots,K,j=1\ldots,L_{p}\}\) and topic embeddings. As can be seen, embedding of _cocoa_ is close to \(\mathbf{\theta}_{4}^{(1)}\) and \(\mathbf{\theta}_{7}^{(1)}\). Thus, samples from _cocoa_ prefer the 4th and 7th prompts (Figure 3). Similarly, embedding of _coffee_ is close to \(\mathbf{\theta}_{1}^{(8)}\) and \(\mathbf{\theta}_{6}^{(6)}\). Thus, samples from _coffee_ prefer the 1st and 6th prompts (Figure 3). ### Ablation Study In this section, we perform ablation study using the 5-way 5-shot setting in Section 4.3. #### 4.5.1 Effect of \(K\) Figure 5 shows the 5-way 5-shot meta-testing accuracy of MetaPrompter with varying \(K\). As \(K\) increases, the meta-testing accuracy increases as the expressive power of the prompt pool is enhanced. However, using a very large \(L_{p}\) is again unnecessary and the accuracy flattens. #### 4.5.3 Effect of Verbalizer Table 6 shows the number of parameters and meta-testing accuracy of MetaPrompter with hand-crafted verbalizer (used in (5)) and RepVerb. As can be seen, RepVerb is better than the hand-crafted verbalizer, and combining both yields the best result. \begin{table} \begin{tabular}{c c} \hline \hline prompt id & nearest tokens \\ \hline 1 & copper, steel, trading, gas, fx, aluminum, earn, coffee \\ 2 & gross, ship, index, money, gold, tin, iron, retail \\ 3 & product, cpi, industrial, acquisitions, jobs, supplying, orange, sugar \\ 4 & cocoa, production, grain, livestock, wholesale, cotton, bop, crude \\ 5 & oil, national, rubber, nat, interest, price, reserves, regional \\ 6 & nat, wholesale, sugar, golden, reserves, drinks, production, product \\ 7 & chocolate, sugar, cheat, orange, trade, fx, cash, acquiring \\ 8 & aluminum, livestock, cpc, tin, shops, wheat, petrol, supply \\ \hline \hline \end{tabular} \end{table} Table 5: Nearest tokens to the learned prompts for _Reuters_. Figure 4: Cosine similarities between learned prompt tokens and topic embeddings on 5-way 5-shot classification of _Reuters_. In the x-axis, \((i,j)\) stands for the \(j\)th row of \(\mathbf{\theta}_{i}\) (i.e., \(\mathbf{\theta}_{i}^{(j)}\)) #### 4.5.4 Integration with Other Meta-learning Algorithms While the MAML algorithm (Finn et al., 2017) is used in Algorithm 2, other meta-learning algorithms can also be used to learn the prompt pool in MetaPrompter or the meta-initialized prompt in MetaPrompting. In this experiment, we replace MAML with the state-of-the-art BMG (Flennerhag et al., 2022). Table 7 shows the meta-testing accuracy and number of parameters. As can be seen, MetaPrompter+BMG consistently outperforms MetaPrompting+BMG. ## 5 Conclusion In this paper, we proposed MetaPrompter, an effective and parameter-efficient algorithm for prompt tuning. It combines structured prompting and a novel verbalizer called RepVerb. A prompt pool structure is used to construct instance-dependent prompts by attention, while RepVerb builds label embedding by averaging feature embeddings of the corresponding training samples. The pool of prompts is meta-learned from the meta-training tasks. Experimental results demonstrate the effectiveness of the proposed MetaPrompter and RepVerb. One limitation is that MetaPrompter is based on meta-learning, and so requires the availability of a set of meta-training tasks. ## Acknowledgements This work was supported by NSFC key grant 62136005, NSFC general grant 62076118, and Shenzhen fundamental research program JCYJ20210324105000003. This research was supported in part by the Research Grants Council of the Hong Kong Special Administrative Region (Grant 16200021). \begin{table} \begin{tabular}{c c|c c c c c c} \hline \hline \multicolumn{2}{c|}{verbalizer} & \multicolumn{1}{c}{_20News_} & _Amazon_ & _HuffPost_ & _Reuters_ & _HWU64_ & _Liu54_ \\ \hline \hline \multirow{2}{*}{ \begin{tabular}{c} \(\check{\mathcal{V}}\) \\ \(\check{\mathcal{X}}\) \\ \(\check{\mathcal{X}}\) \\ \(\check{\mathcal{Y}}\) \\ \(\check{\mathcal{Y}}\) \\ \end{tabular} } & \(85.91\) & \(81.96\) & \(70.37\) & \(95.91\) & \(91.89\) & \(90.32\) \\ & \(87.12\) & \(86.05\) & \(72.63\) & \(96.69\) & \(95.25\) & \(93.35\) \\ & \(88.57\) & \(86.36\) & \(74.89\) & \(97.63\) & \(95.30\) & \(95.47\) \\ \hline \hline \end{tabular} \end{table} Table 6: 5-way 5-shot classification meta-testing accuracy of MetaPrompter with different verbalizers. \begin{table} \begin{tabular}{c c c c c c c c} \hline \hline & \#param (\(\times 10^{6}\)) & _20News_ & _Amazon_ & _HuffPost_ & _Reuters_ & _HWU64_ & _Liu54_ \\ \hline MetaPrompting+BMG & \(109.52\) & \(85.71\) & \(83.47\) & \(73.92\) & \(96.27\) & \(93.31\) & \(93.04\) \\ MetaPrompter+BMG & \(0.06\) & \(87.91\) & \(86.45\) & \(74.99\) & \(98.01\) & \(95.41\) & \(94.52\) \\ \hline \hline \end{tabular} \end{table} Table 7: 5-way 5-shot classification meta-testing accuracy by using BMG to learn the prompt pool. Figure 5: Effect of \(K\) (in log-scale) on 5-way 5-shot classification (\(L_{p}=8\)). Figure 6: Effect of \(L_{p}\) (in log-scale) on 5-way 5-shot classification (\(K=8\)).

2305.01056

From Organizations to Individuals: Psychoactive Substance Use By Professional Programmers

Psychoactive substances, which influence the brain to alter perceptions and moods, have the potential to have positive and negative effects on critical software engineering tasks. They are widely used in software, but that use is not well understood. We present the results of the first qualitative investigation of the experiences of, and challenges faced by, psychoactive substance users in professional software communities. We conduct a thematic analysis of hour-long interviews with 26 professional programmers who use psychoactive substances at work. Our results provide insight into individual motivations and impacts, including mental health and the relationships between various substances and productivity. Our findings elaborate on socialization effects, including soft skills, stigma, and remote work. The analysis also highlights implications for organizational policy, including positive and negative impacts on recruitment and retention. By exploring individual usage motivations, social and cultural ramifications, and organizational policy, we demonstrate how substance use can permeate all levels of software development.

Kaia Newman, Madeline Endres, Brittany Johnson, Westley Weimer

2023-05-01T19:44:00Z

http://arxiv.org/abs/2305.01056v1

# From Organizations to Individuals: Psychoactive Substance Use By Professional Programmers ###### Abstract Psychoactive substances, which influence the brain to alter perceptions and moods, have the potential to have positive and negative effects on critical software engineering tasks. They are widely used in software, but that use is not well understood. We present the results of the first qualitative investigation of the experiences of, and challenges faced by, psychoactive substance users in professional software communities. We conduct a thematic analysis of hour-long interviews with 26 professional programmers who use psychoactive substances at work. Our results provide insight into individual motivations and impacts, including mental health and the relationships between various substances and productivity. Our findings elaborate on socialization effects, including soft skills, stigma, and remote work. The analysis also highlights implications for organizational policy, including positive and negative impacts on recruitment and retention. By exploring individual usage motivations, social and cultural ramifications, and organizational policy, we demonstrate how substance use can permeate all levels of software development. software engineering, mental health, drug use, productivity, qualitative methods ## I Introduction Psychoactive substances, which influence the brain to alter behaviors, perceptions and moods, are widespread throughout the world [37]. They played a key role in the early history of computer science [23] and remain prevalent in software engineering to this day [9]. They can have significant positive and negative effects on attributes associated with programming, such as focus [29], productivity [21] and creativity [18, 30, 38], but also carry moral, social and legal concerns [31, 35]. Despite the risks and benefits, current uses of psychoactive substances by software engineers are not well understood. We desire a foundational understanding of the experiences and challenges faced by psychoactive substance users who are also software developers -- both to clarify the landscape and dispel uncertainty, but also to provide actionable insights for decision makers (e.g., for hiring, culture, and retention). We focus on substances such as prescription stimulants (e.g., Adderall), cannabis (e.g., marijuana), alcohol, mood disorder medications (e.g., Zoloft), and psychedelics (e.g., LSD). The legality of psychoactive drugs varies by locality and substance, with usage rates increasing for programmers with the rise of work-from-home policies [9, Sec. 5.2]. At the same time, developers are increasingly turning to prescription and recreational psychoactive drug use -- while working -- to alleviate health symptoms and improve productivity (Section VII). In this context, an effective investigation must (1) minimize preconceived biases and expectations surrounding this morally- and legally-sensitive topic, (2) speak to a broad range of professionals across organizations and levels of experience, (3) describe the lived experiences of users of psychoactive substances instead of the opinions of others about them, and (4) admit useful conclusions at multiple levels of modern software engineering. To the best of our knowledge, the closest related work either focuses on preconceived questions about one substance (e.g., [7, 9]) or addresses broad groups of developers, but not about substance use (e.g., [11]). We propose the first investigation of psychoactive substance users in modern software development, using qualitative methods to draw rigorous conclusions from a collection of semi-structured interviews of personal experiences. While there are numerous studies that have used qualitative research methods as a way to gauge and report on a broader range of developers' experiences and opinions [6, 10, 17, 19, 22, 34], this is the first qualitative study on psychoactive drug use in software development. Guided by archival data from a pre-survey of 799 programmers about general substance use, we designed research questions focusing on five themes: health, self-regulation, social interaction, company culture, and company policy. We conducted hour-long interviews of 26 experienced software developers, placing special care on ethical recruitment and confidentiality, with multiple independent annotators ultimately discovering over 170 relevant shared concepts. We distill those thematic findings and structure our presentation of them through three lenses: individual usage mo tivations, social and cultural ramifications, and organizational policy. Our findings shed light on mental health, programming enhancement, soft skills, remote work, drug policies, hiring and retention, and company culture -- and how they interact with the common, but not always spoken of, use of psychoactive substances. For example, at the organizational level, we find that for many substance users, anti-drug policies are unclear and ineffective; such policies are viewed as indicative of corporate culture and may have a negative impact on hiring and retention. We also discuss a direct mapping, based on our sample, between alcohol, cannabis and stimulants and positive and negative effects on software engineering tasks (e.g., brainstorming vs. debugging vs. meetings, etc.). The contributions of this paper are: 1. The first qualitative study of the personal experiences surrounding psychoactive substance use by professional programmers (\(n=26\)), based on a thematic analysis 2. An explanation of individual substance use motivations and impacts, such as mental health considerations as well as substance use and productivity (including per-substance and per-task breakdowns) 3. An explanation of socialization effects of substance use in software, such as the impact on soft skills, visible work use and stigma, and the effect of remote work 4. An explanation of organizational policy implications, including policy clarity and effectiveness and impacts on recruitment and retention (both positive and negative) This paper discusses the use of substances that are illegal or may be dangerous in some contexts. The authors neither endorse nor condemn this behavior. Rather, the goal is to understand, present, and qualitatively analyze the lived experiences of psychoactive substance users working with software. ## II Background and Related Work We now cover related work concerning psychoactive substance use (in general and software contexts), and software development and mental health. **General Psychoactive Substance Use:** A _psychoactive_ (or psychotropic) substance influences the brain or nervous system and thus behavior, mood, perception and thought [40]. Alcohol, caffeine, cannabis, LSD, and nicotine are examples of such substances. Additionally, many medications prescribed for mood disorders (such as depression or anxiety) are psychoactive. Different substances have different cognitive impacts: for example, alcohol suppresses nervous system activity while stimulants increase alertness and focus via dopamine in the brain [29]. Psychoactive drugs have a long history and have impacted multiple aspects of human culture, from recreation to war [37]. Prevalence of use and legality vary by substance and area [31, 35]. In this work we focus primarily on those substances that we find are likely to be used while programming (see Section III): cannabis, alcohol, prescription stimulants (e.g., Adderall, Ritalin), mood disorder medications (e.g., SSRIs, Wellbutrin), and psychedelics (e.g., LSD, microdosing). Notably, although officially psychoactive, we exclude caffeine due to its near-universal prevalence in software. **Psychoactive Substance use in Software:** Psychedelics, such as LSD, have been associated with early software development [23], with folk wisdom suggesting positive creativity benefits [38]. Similar creativity benefits have been suggested for alcohol [18], and micro-dosing [30]. As for explicit research on the intersection of psychoactive substances and software, the limited prior work focuses on individual substances. Endres _et al._ conducted a survey of cannabis use in programming, finding that a substantial proportion of their sample used cannabis while completing software tasks [9]. Darshan _et al._ linked alcohol and depression in a study of IT professionals in India [7]. Popular media have also reported that Silicon Valley culture includes using stimulants or other "smart drugs" (e.g., nootropics) to increase productivity [21]. However, to the best of our knowledge, no formal work has studied the intersection of psychoactive substance use as a whole in software. **Mental Health and Software Development:** The happiness of software developers has been correlated positively with their productivity and quality of their work [12, 20], supporting what is commonly referred to as the "happy-productive" thesis [36, 41]. Beyond this, the _un_happiness of software developers has been identified to have dozens of potential negative outcomes [13]. It remains in a company's best interest to prioritize the happiness of its employees for the best results. Unfortunately, a considerable stigma remains around discussing mental health or medication (e.g., [5, 15]) or neurodivergence issues [27], hindering constructive reform. ## III Pre-Study: Survey Results **Pre-Study Setup:** Endres _et al._ surveyed 803 students and full-time programmers, finding that 35% of their sample had programmed while using cannabis, that 18% do so at least once per month, the primary motivation being to enhance certain software development skills (e.g., brainstorming) rather than for pain relief [9]. That survey focused on cannabis alone rather than psychoactive substances in general (e.g., aspects like Adderall and ADHD were not directly included) and it primarily used pre-set questions rather than capturing distinct subjective experiences of users. However, Endres _et al._ provided additional archival data when requested, including data from 799 programmers who filled out a brief section related to the use of other (i.e., non-cannabis) substances. While it does not directly address our goal, this archival data provides a rich source of preliminary information to guide the construction of semi-structured interview questions and motivate the themes we explore. **Pre-Study Quantitative Results:** We first use this archival survey data to investigate the prevalence of substance use among developers. Participants were asked if they had used various psychoactive substances in the last year while completing software-related tasks. In that sample, 59% (473/799) of participants reported using a mind-altering substance while completing a software-related task in the last year. Alcohol (25%) and cannabis (24%) were the most common. The next most common two were tobacco (6%) and amphetamines (5%, including both recreational and prescribed stimulants). Perhaps counter to common stereotypes of software developers [23, 30], though the next most common, psychedelics use (including microdosing) was quite rare overall (2%). To guide our qualitative investigation of usage patterns, we also compare general use frequencies to those in software contexts. Differences in this ratio between substances give an indication of the "normalization" or "uniqueness" of a substance to software by its users. As a baseline, we find that 93% percent of developers who used caffeine in the last year also report using it while doing software tasks. By contrast, only 50% of alcohol users do so. These results align with our intuition, and for drugs perceived as "harder" or less socially acceptable, the percentages are even lower (e.g., 30% for cocaine and opioids, 22% for hallucinogens). Intriguingly, other than caffeine, the substance with the highest transfer to software is amphetamines at 70%, a transfer that is significantly higher than alcohol (\(p<0.01\)). These differences -- both between substances, but also between work use and general use -- motivate our qualitative investigation of such usage patterns and motivations. **Pre-Study Qualitative Results**. Although the study by Endres _et al._ was primarily quantitative [9], we were also able to examine prose results from a freeform question: "Do you have any comments regarding programming and the use of mind-altering substances?" Authors one, two, and four independently annotated participant responses to that question with their own codes and then met to discuss and agree upon the five most prominent themes. These themes are outlined in Table I. Although the data and analyses presented here were not previously reported by Endres _et al._[9], we claim no novelty regarding this data source and instead use it to guide the construction of our qualitative instruments. Informally, the pre-study gives confidence that we are pursuing the right questions. ## IV Main Study: Study Methodology Guided by the quantitative and qualitative results from the pre-study data, we developed five primary research questions: * What is the relationship between mental or physical health and the use of psychoactive substances in software working environments? * What are the use and self-regulation patterns developers follow when using mind-altering substances for completing software tasks? * How does substance use impact in-person and remote social aspects of software working environments? * How are different substances accepted or stigmatized in software workplaces? * How do company drug policies impact developers who use psychoactive substances? From these research questions we developed a semi-structured interview script. For the rest of the paper, we focus conducting and analyzing this interview with 26 software developers who use psychoactive substances while programming. **Participant Recruitment:** We conducted 26 interviews using the aforementioned protocol (see Section V for contextualization of our population). Participants had to be over the age of 18, work or have worked in a job that required developing software, and have significant first- or second-hand experience with using psychoactive substances at one of these jobs. We prioritized reaching participants with more years of experience in software, substantial experience with psychoactive substances, and diverse professional industries. Our decision to scope participants to those with direct experience of psychoactive substance use is a design choice as our research questions relate to software developers who use psychoactive substances. Additionally, our overall goal is not to collect a _random_ sample (indeed, there are ethical challenges to random samples of illegal activities), but to capture diverse opinions and experiences. We used a multi-pronged approach to recruit a spectrum of participants: physical posters, software-related mailing lists, word-of-mouth snowball sampling, and social media sites including Twitter and Reddit, as recommended for hard-to-reach populations [32]. More detail regarding our recruitment procedure (including specific subreddits used) is in our replication package. By the end of 26 interviews, we had reached saturation on our original research questions. It is standard practice in qualitative studies to stop collection when reaching or approaching saturation [22]. **Interview Protocol:** Each interview was _semi-structured_ and lasted one hour, a design that both permits us to answer research questions and allows for unexpected themes to arise naturally in conversation [26, 33, 39]. Generally, two researchers attended each interview: one asked most of the questions while the other took notes. The audio was recorded and later manually transcribed into text by the first two authors. Our full interview script is available in our replication package1 At a high level, the interview started by learning more about the interviewee's professional programming experiences and to verify they were eligible to participate. The interview progressed through a series of overall topics connected to our research questions: 1) Basic experience with psychoactive substances in software, 2) Mental and physical health (e.g., "Do you use substances to combat stress from work?"), 3) Social Impacts and Policy (e.g., "Do others at work know that you use substances during software tasks?"), 4) Self Regulation (e.g., "For which software tasks would you use a substance?"), and 5) Hypotheticals (e.g., "If you could change anything about software drug culture, what would it be?"). Footnote 1: Replication materials are available on Zenodo [28] or on GitHub at [https://github.com/CellCorgi/ICSE2023_Psychoactive](https://github.com/CellCorgi/ICSE2023_Psychoactive). We note this package does not include interview transcripts to protect the privacy of our participants. **Study Design Ethical Considerations - Data Availability:** We highlight three ethical issues in our study design: recruiting, confidentiality and informed consent. For _recruiting_, we did not require official emails or company names, and allowed interviews with the camera off (after pre-screening with it on to verify identity). We employed a particularly high standard of _confidentiality_, including not releasing the interview text (which may contain identifying information admitting retaliation) without a data sharing agreement (e.g., via additional IRB certification, etc.). Finally, we obtained IRB permission to waive written _informed consent_ (a paper trail linking the participant's real name to the research) in favor of oral informed consent. These steps are pragmatically necessary (e.g., so people feel comfortable speaking truths), but, more importantly, are ethically necessary (to protect participants). **Data Analysis Methodology:** To analyze the interviews, we used a two-pass approach for tagging and annotating our data with codes: a first pass using a dynamic initial code book and a second pass with the finalized code book, both using the qualitative analysis tool ATLAS.ti. Our initial and final code books (and supporting quotes) are in our replication package. In the first pass, each interview was coded using an initial code book derived from the interview outline. Two authors independently coded each transcript using this code book while also noting additional codes or themes encountered. Then, all authors met to merge findings. Using the union of codes and themes, three authors worked together to facilitate consensus on the emerging themes in the data and build a second, more robust code book. Independent codings of the same transcript were merged through group discussion rather than an automated process. The final code book consists of over 170 distinct codes organized into 10 groups. We do not formally calculate annotator inter-rater agreement of this first pass (see McDonald _et al._[25, Section 5.1] for a discussion of reasons for and against calculating inter-rater agreement for qualitative studies). However, we retroactively examined 352 quotations from our transcripts to get an approximate understanding of inter-rater agreement in our study. In this sub-sample, 78% matched a quote by the other code (same or overlapping quotes with the same codes). Of the remaining quotes, 23% were identified by both annotators but had at least one different code. Only 16% of quotations were unique to one annotator, indicating relatively high consensus. In a second pass, an author annotated each interview with the complete code book. When possible, this author was _not_ one of the authors responsible for the first pass. Thus, at least three authors analyzed the majority of the interviews. After coding and tagging the data, two of the authors independently organized the codes into larger themes surrounding substance use in software. With a help of a third author, these themes were merged and organized into the three main levels that we present in this paper: individual motivations for substance use (Section VII), socialization effects of substance use (Section VIII), and organizational impacts (Section IX). ## V Population Contextualization We now describe the demographics and programming experiences, and psychoactive substances used by our population to better contextualize and scope our findings. **Demographics:** Of our 26 participants, 16 are men, 9 are woman, and 1 is non-binary. Participants range in age from 20 to 44, with an average of 30. As for location, 19 are based in the United States, two in India, and one each in Australia, Bangladesh, Mexico, the Philippines, and South Africa. An additional two participants moved to the US mid-career (from Israel and India), leaving 17/26 participants with US-exclusive experiences. We discuss the US-bias in our population more in Section X. **Programming Experience:** All participants in our study have 1-20+ years of professional programming experience, with most having three or more years. The bulk (21/26) are current or former full-time software developers. The remaining five include one who owns and works at their own tech-related consulting company, one programming freelancer and student, one data analyst, and two computing-related Ph.D. students (both in the final stages of their degrees). Our participants work at companies with a wide array of sizes and industries: 5 at large software companies (e.g., FAANG, etc.), 9 at medium-sized software companies (1,000-3,000 employees), and 5 at smaller startups with under 500 employees. Additionally, 5 work in the financial sector, 2 work in the Health Care Sector, and 2 participants work at government contractors. Our replication package details participant experiences. ## VI Findings Overview and Substances Used The findings from our interviews provide insights regarding psychoactive substance use in software development. Table II outlines the various substances two or more participants have used while developing software. The high number of Cannabis and Alcohol users in our sample correspond to the trends in our pre-study (Section III), as do the smaller proportions of psyched contrast, however, the most common substance in our sample was prescription stimulants, which help increase focus and executive functioning. Commonly prescribed for various health conditions (see Section VII-A), they can also be used recreationally. We discuss this discrepancy further in Section X. Our findings suggest that use of these psychoactive substances has the potential to impact all levels of a developer's work life from the individual to the organization. In this section, we outline results across three levels of developer experiences: the Individual (Section VII), Social (Section VIII), and Organizational (Section IX) impacts of psychoactive substance use in software. Commonalities, such as Productivity and Work from Home, are discussed in each section. Additionally, we follow each included quote with a bracket noting the participant number (see our replication package for demographic details for each participant) and country location at time of the interview to better contextualize our findings. ## VII Individual Motivations and Impacts We start by focusing on the individual developer and their psychoactive substance use. We analyze reasons for, the personal effects of, and how and why programmers self-regulate their psychoactive substance use. Findings in this section address **RQ1** and individual aspects of **RQ2** (see Section IV). At a high level, we observed two primary motivations for psychoactive substance use while programming: to help alleviate symptoms from mental health conditions (e.g., depression or ADHD), or to enhance programming abilities (e.g., creativity or productivity). In contrast, we do not observe physical health or addiction issues to be primary motivators. While our findings suggest that, in practice, programming enhancement and mental health symptom alleviation may go hand in hand for many developers (especially in the use of prescribed substances such as stimulants), for clarity, we present substance use for mental health and for programming enhancement separately. We then conclude by detailing which substances our participants use for which software tasks. ### _Substance Use for Mental Health_ In our sample, mental health is a primary driver of psychoactive substance use when developing software: twenty of our participants reported using at least one substance prescribed by a psychiatric professional. **Mental Health: What Conditions?** The most common diagnosis in our sample is for _Attention-Deficit/Hyperactivity Disorder_ (ADHD), a neurodevelopmental condition marked by patterns of inattention (e.g., difficulty focusing), hyperactivity, and/or impulsivity. 15 participants have or are suspected by a psychiatrist to have ADHD. ADHD is often treated with prescription stimulants (e.g., Adderall) which improve focus and attention by increasing the amount of dopamine in the brain. In our sample, most participants using stimulants for ADHD were diagnosed with ADHD in part or in whole due to symptoms present during their software work, and generally cite positive impacts of stimulants on software work. Supporting neurodevelop programmers, such as those with ADHD or Autism Spectrum Disorder, is increasingly important and visible in software engineering [27]. We consider the connection between ADHD and stimulant medication in greater detail later in this section. Aside from ADHD medications, we also spoke with 11 participants who are prescribed mood disorder medications (e.g., SSRIs, Wellbutrin, etc.) for depression or anxiety. In contrast to stimulants, participants were more dismissive of the effects of these substance on software. They often described mood disorder medications as not impacting work directly, but instead as removing obstacles making it difficult, if not impossible, to work. For example, one participant with diagnosed depression said: _"I never related...antidepressants and software work, because for me antidepressants and just overall feelings [are] not related to coding at all. Of course, it affects my software work. If I do have depression, I cannot work"_ [P3, US]. **Symptons at Work:** Many of our participants reported that their work triggers their mental health disorders. In some cases, symptoms at work contributed (in whole or in part) to diagnosis and treatment. This pattern was particularly common in participants diagnosed with ADHD. Of the 15 participants prescribed medication for ADHD, 11 were diagnosed in adulthood or seeking diagnosis while working professionally in software development. For these participants, the impact of prescription stimulants on their software work is almost uniformly positive: _"Oh, it's been almost life-changing. It's been wonderful. I'm way more focused obviously, but I'm also way more productive. It's a lot. Even when there's distractions at hand, I am able to manage those distractions better. I'm able to focus on my tasks better. I'm able to complete things in a faster time-frame than I could before. And it makes me almost want to start working each day"_ [P5, US]. Because ADHD is always present from childhood, and most diagnoses are in adolescence [16], it is surprising that most of our participants were diagnosed in adulthood. While ADHD diagnoses are rising overall, this discrepancy points to something software-specific. We hypothesize that participants may have previously experienced mild symptoms that had not interfered with daily life, but that the rigors of modern software development (and company culture and organization) made the symptoms impossible to ignore or mitigate non-medically. ADHD is the primary mental health diagnosis driving substance use in our sample. The majority of those diagnosed cited their seeking diagnosis was at least in part due to symptoms present in their software work. Stimulants prescribed as a result of diagnosis are viewed to have a positive impact on their software development. ### _Substance Use for Programming Enhancement_ Aside from mental health support, participants also use psychoactive substance for programming ability enhancement. As described by one participant, _"I want to be better. You know? I see myself like an athlete. And for me, [psychoactive substances] are like performance enhancement drugs"_[13, US]. To contextualize the landscape of psychoactive substance use in software, we examine _which attributes_ of programming users seek to enhance. We identified four common attributes that are impacted through substance use: Creativity, Enjoyment, Work Quality, and Focus/Productivity. Table III contains an overview of our results on how each of these attributes interacts with alcohol, cannabis, or stimulant medications, the three most common substances used by our population. **Substance Use and Productivity:** All but one participant mentioned substance use for productivity enhancement. The substance most associated with productivity was stimulants. We did not explicitly ask about productivity. However, all 21 stimulant users stated that use increases their focus and productivity on certain software tasks. In fact, they often did so multiple times: increasing productivity and stimulants appeared together a total of 96 times in our data. While stimulant use was commonly cited as having a positive effect on productivity, also common was mention of perceived _decrease_ in productivity with cannabis use. This decrease in productivity was typically cited as a reason not to use cannabis for any given software task. Overall, however, our results indicate that enhancing productivity is a primary motivation for psychoactive substance use in software, a link that may speak to deeper threads of productivity culture in software culture as a whole. Touching on this culture, one stimulant user who works at a large FAANG-category company explained _"I think it is really generous of them to offer the mental health benefits...and kind of say...' Hey, you should take care of your mental health.'...[However,] the way the performance reviews work is, at the end of the year...you basically have to catalog everything you did [and] show that you did all of it. And it can be pretty intense and it's pretty common for people to say things like, 'Oh, I feel like I can't take [personal time off] because then I'll get behind on work"_[10, US]. **Other Attributes:** After productivity, creativity was most common (45 mentions): participants made numerous mentions of increased creativity and substance use, primarily with cannabis or psychedelics. Next was enjoyment (42 mentions), usually with cannabis or alcohol. Work quality was mentioned the least (34 times). When using substances for programming enhancement, increasing productivity is the most common goal, especially when it comes to using stimulants. Increasing creativity, work quality, or work enjoyment are cited less commonly, though when they are, it is usually in the context of alcohol, cannabis, or psychedelics. ### _Self-Regulation During Software Tasks_ Our findings suggest that developers may self-regulate substance use by software task. As seen in Table III, participants associate tasks that require focus (e.g., debugging) with stimulants and tasks that require creativity (e.g., brainstorming) with cannabis or psychedelics. This implies _a_) many developers are deliberate about _when_ in the software process they use various psychoactive substances, treating it like a _tool_, and _b_) policies that ban certain substances in all cases may preemptively remove that tool from a developer's toolbox. We consider these implications in greater detail in the discussion. **Debugging:** The software task most mentioned with psychoactive substance use was debugging. Seen as a focus-intense and detail-oriented task, 14 participants reported that stimulants in particular are helpful for debugging. As stated by one such participant, _"like when I'm debugging, sometimes you're all over the place, right? So there's a lot of things to keep in your mind at once...And I find that it's a lot harder for me to do that without Adderall"_[13, US]. **Brainstorming:** Participants find brainstorming to be enhanced primarily by cannabis or psychedelics. Both are viewed as ways to see things from a new perspective. For example, when faced with solving a problem that left several other senior engineers stumped, one participant discussed using MDMA (a hallucinogenic stimulant) to help brainstorm the solution. In this participant's opinion, _"there were huge boosts in creativity. I think it helped me big time in being in somewhat more of a naive state and let go of everything that people had told me about the problem and kind of look at it from like my own lens...I have the personal opinion that responsible usage of [MDMA] is actually in the best interests of the company. I mean, I solved the very, very hard problem that four other engineers had failed. And I used these drugs"_ [14, Australia]. Developers choose to use different substances for different software tasks (e.g, stimulants for debugging, but cannabis for brainstorming), evidence that developers self-regulate their substance use, informally using it analogously to other development tools. ## VIII Socialization Effects While psychoactive substance use motivations are personal, use impacts can spill over into a developer's social network, affecting relations with co-workers and managers. In this section, we analyze how psychoactive substance use impacts socialization and interpersonal relations in software workplaces. We focus on choosing when to use psychoactive substances ("soft" skills) and the stigma and visibility of substance use in software work environments. Findings in this section address social aspects of **RQ2**, **RQ3**, and **RQ4** (see Section IV). ### _Social Impacts on Drug Self-Regulation_ **Substances and "Soft" Skills:** Beyond individual technical skills, professional software development also requires significant interpersonal communication and interaction ("Soft" Skills) [1, 24]. Developers using substances for software tasks that require such soft skills often consider both their own performance and also the impact that use has on co-workers. Participants generally perceived soft skills to be _improved_ by substance use. Eight out of 10 stimulant users in our sample mentioning soft skills found that they helped with staying engaged and active in communication with other developers. As one stated, during long meetings _"[stimulants] allow me to become more engaged in what's going on instead of my mind drifting into...whatever I find more interesting, which is basically everything else at that point"_ [13, US]. Mood disorder medications were also beneficial for communication, helping developers lower anxiety around presentations or stand-up meetings. For cannabis, however, we observed more mixed opinions: two out of five cannabis users perceived a positive impact on soft skills (vs. three negative). On the positive side, for one participant, cannabis lowers his anxiety when he _"need[s] to do something like writing an email or talk to somebody about some urgent topic, it's easier for [him] to smoke and do it than do it sober"_ [12, US]. In contrast, when asked if her cannabis use differed between meetings and solo coding, another participant responded, _"oh, absolutely. When I'm in meetings or have to collaborate in any way, I'm always sober for those"_ [13, US], which suggests she does consider the impacts on co-workers when making substance use decisions. **Substance use and safety:** Some developers also consider the _risk_ to software users when choosing to use a psychoactive substance. Seven participants explicitly mentioned considering the safety of users should their code go into production, often contrasting between industries (e.g., game development vs. medical technology). As one participant explained, _"smoking weed in my office, I think that's not a problem as long as I'm not programming anything that's carrying risk. Like if it was a self-driving car perhaps,...where there's a lot of liability attached to it...or actually physically something could happen, that might be where the line is"_ [13, US]. This concern for risk, however, was not universal: one dissented, _"morally, I don't see any problem with any psychoactive substance use during coding...It's not like...driving under the influence. Coding can't really hurt anyone"_ [13, US]. Participants explicitly consider impacts on communication, collaboration, and software user safety when self-regulating psychoactive substance use. ### _Substance Use Visibility_ **Do developers disclose substance use?** Nineteen of our participants mentioned disclosing at least some of their substance use to others at work. However, the method, manner, and reception of that disclosure varies widely by substance and individual participant. We also asked if participants knew, or had heard of, others (e.g., co-workers or managers) using psychoactive substances in the workplace: seventeen participants reported knowing or hearing first-hand. Of the nine who had not, one had heard rumors and three had heard of use in non-programming contexts. Alcohol (12), cannabis (10) and psychoactive prescription medication (9) were the substances participants had most heard of others using while completing software tasks. Psychedelics (4) and all others (1) were not as commonly encountered. This is important because the contrast between what may be commonly used (i.e., stimulants, see Table II) and what people hear about (i.e., alcohol) suggests that open disclosure of some substances is not common in the corporate cultures of our participants. **Visible work use:** Fourteen participants reported observing developers use psychoactive substances together at work or work-sponsored functions with other developers. For most (9/14), the substance was alcohol at a company happy hour or later in the workday. For example, one participant, whose company handbook permits alcohol use in the office later in the afternoon, showed a picture of the company-stocked fridge where the _"bottom half is just different beers and wines"_ [P6, US]. Talking about the work culture at a start-up he worked for, another participant said, _"there were a lot of people who drank a lot, like quite frequently. And at a lot of team events people would definitely get really drank"_ [P10, US]. Taken together, these experiences point to a culture of alcohol acceptance at many software workplaces, an acceptance that can even go further into a potentially contentious cultural belief that alcohol can even improve programming. One participant captured this tension: _"It's really weird because people think that if you drink it's OK...a myth that people who write code can drink beer and write this code during the night and by the morning, it will be perfect. God, no. It will never be perfect code if you drink beer all night and try to write code"_ [P3, US]. Though stimulants were only mentioned by two participants in this context, it is notable that both started using stimulants in software because they saw a co-worker using it to improve focus and wanted the same benefits in their own work. One participant who works at a FAANG-category company described this experience: _"At least in my workplace, it's certainly not taboo to talk about Adderall...I actually learned about [a type of prescription stimulant] at the workplace from a friend who gave me ten strip and was like, 'hey, if you're having issues [focusing], have you tried Modafini?'_, and...so they just went into their desk and pulled me out of a blister pack of ten and said 'try it some time. Try it in the morning because it'll keep you up if you try too late.' And that's all the medical advice I got"_ [P9, US]. We note that in studies of other populations (e.g., college students, cf. [4]), misuse of stimulant medication (including sharing of prescription stimulants) is associated with a higher risk for adverse effects. Both participants in our sample went on to get prescriptions for stimulants from psychiatrists. However, this still highlights the interconnection between company productivity culture and substance use, as well as the potential risks of policies that discourage open discussions. **Substance use and remote work:** As most of our participants were working in software both before and during the COVID-19 pandemic, they experienced both in-person and also remote or hybrid environments. Overall, 12 responded that their substance use has _increased_ during the pandemic and only 1 reported a decrease. For eight of those reporting an increase, that increase was specifically cannabis or alcohol. The primary reasons reported for this were greater substance convenience and less worry about co-workers or superiors finding out. As one explained, _"You can't smoke weed at an office. And even if I could, it doesn't just feel like right to do it, like go downstairs to smoke some, and then come back. That simply doesn't work"_ [P21, Australia]. This is an important consideration as companies increasingly adopt post-pandemic work-from-home policies (e.g., to support neurodivergent programmers [8] or in Agile contexts [14]). Alcohol and prescription stimulants are more likely to be used and discussed than other psychoactive substances. Cannabis and psychedelics are more taboo. Both workplace productivity culture and work-from-home policies can be associated with _increases_ in substance use. ## IXOrganizational Policy While substance use is conventionally considered a personal or cultural topic, in our interviews, the ramifications in software also include corporate drug policies. Beyond the impacts on remote work discussed in Section VIII-B, we also analyze interactions between psychoactive substance use and organizational policy (**RQ5**, see Section IV). To do so, we first discuss participants' views of their companies' drug policies as well as the impacts of those policies on job hiring and retention. We conclude by discussing changes our participants desire for drug culture and policy in software as a whole. ### _Drug Policy in Software: General Experiences_ We first consider participants' general experiences with, and opinions on, drug policies at software work places. In our analysis, 25 of our participants spoke on software organization drug policies. We discuss three main sub-themes: the predominance of implicit messaging in software drug policies, participant experiences with drug tests, and the reported ineffectiveness of many software anti-drug policies. **Implicit drug policies:** For the majority of participants (15/26), drug policies at their current workplaces are either primarily implicit, do not exist, or are not consistent with visible developer behavior. Developers are split on if they would prefer a more explicit policy, with some worried that being more explicit would curtail or police their substance use. However, according to several participants, implicit messaging around drug policies can lead to the necessity to navigate nuance more than desired. As explained by one participant at an office with a de facto alcohol policy that is more permissive than the official one, _"there's just that tiny bit of like it could be used against me. You know. It's a lingering thought. I mean,...I don't think that that would be the case. But heaven forbid that there is a moment where...a group of us try to grab a beer from the fridge at four o'clock or 4:29, and they use that as opportunity for reprimand. Yeah. Past trauma. It's not related to current leadership, but yeah, the past"_ [P6, US]. In another example of how drug policies often require nuance to interpret, one participant at a FAANG-category company explained how company policies around prescription stimulants lead to potentially unexpected cultural impacts: _"So we have this health center on campus that's got doctors, nurses, lab on-site, pharmacy...And there are rumors about the place where if you just go in for an appointment and you talk about having focus problems, it's pretty known that they are easy for writing Adderall scripts. And then,...the pharmacy will waive your copay...The rumors about how easy it is to get an ADHD prescription and then also the implicit acknowledgment and waiving the copy if you fill it up at the company pharmacy... it sends an interesting message"_[P9, US]. **Experiences with drug tests:** The most common explicit anti-drug action in our data was drug testing: In our sample, only 38.5% (10/26) of participants had ever taken a drug test for a software-related job. While slightly higher, given the sample size, this percentage is not significantly different from the 29% reported by Endres _et al._[9]. However, due to the qualitative nature of our data, we are able to elaborate with more nuance: for all but two drug-tested participants, the drug-testing was limited to an initial screening test during hiring. For the two remaining participants, one only had to be tested before driving the company van. Thus, only one participant reported regularly receiving drug tests during their software job. An additional two participants also indicated that, while there was no regular testing, there was always a threat of random drug testing should their job performance suffer. Even though the actual number of tests taken by most participants is low, potential tests do lead to additional stress and frustration. For example, three participants indicated that the existence of a hiring drug test screening was not adequately communicated during the hiring process. As an example of this sentiment, one participant stated that this initial test _"kind of snuck up on me. So I actually moved from California to New York City, started on-boarding and then they gave me the test....if there was a problem with it, then that whole process of moving across the country and all of that, it would've been a huge problem"_. These experiences indicate that some software companies may benefit by being more explicit with their anti-drug policies during the hiring process itself. **Do anti-drug policies even work?** One of the most common themes expressed regarding software anti-drug policies is that they are _ineffective_. Eight participants indicated that they found all or part of their current company's anti-drug regulations to be ineffective. For example, several described bypassing initial drug screening requirements through temporarily abstaining from psychoactive substance use. The ineffectiveness of anti-drug policies seems to be _increased by remote work_: as one participant who works remotely for an international company states brusquely, _"Honestly, like is the company in Nottingham going to come piss test me in the U.S.? No. Totally ineffective"_[P12, US]. The observation that many substance users may view extant drug policies as ineffective and easy to circumvent has significant implications on drug policies in software. If current anti-drug policies are ineffective, companies may benefit from reevaluating the cost-benefit trade off they embody or more clearly communicating why they are present. For example, participants were more understanding if the drug test was a legal requirement the company could not control, _"it would be a positive signal to work culture to say like, "Hey, this, we're acknowledging that this may be a little prescriptive or archaic"_. If it's for legal reasons, I think people are very understanding of it"_[P6, US]. By contrast, policies that lean more to "security theater" may be both a poor use of company resources and a detriment to software culture. While the number of drug tests required by a software job is typically low, poor communication surrounding initial screening tests can still influence candidate decisions. At the same time, current software drug policies are often viewed as ineffective, a feeling mediated by remote work. These two results encourage revisiting the costs and benefits of anti-drug policies for software jobs. ### _Drug Policy Impacts: Hiring and Retention_ We also asked if a policy has or would impact the decision to work at a company. Overall, 11 out of 26 participants said an organization's policy around psychoactive substance use would or has influenced their decisions to work there. A further five indicated that it might impact their decisions, depending on how restrictive the policy was or how much they wanted that specific job. Together, for 16 out of 26 participants, a drug policy could impact job hiring or retention. As both the pre-study (see Section III) and also prior literature indicate that psychoactive substances use in software is widespread [9], this finding indicates that software company policy makers may want to consider carefully the ramifications of their organization's current drug policies on hiring and retention. **Why drug policies may hurt hiring and retention:** We now detail the most common elaborations on this sentiment: a belief that a policy would be too restrictive on behaviour (e.g., they would fail certain types of policies), and a belief that such policies are a negative indicator of a company's culture. For half of participants who answered yes or maybe (8/16), responses were contingent on how restrictive the policy was or their unwillingness to modify their substance use behaviors to comply. Generally, participants were opposed to random drug testing at software jobs or policies that banned prescribed medications (e.g., anything that would force long-term changes in substance usage patterns), but were more understanding of an initial drug test when hiring. In an indicative quote, one participant stated _"I wouldn't want random testing. Like I'm cool if you want to do the on hire testing, then sure, I can abstain [from cannabis] and bring my script for Adderall and be by the book"_[P9, US]. By contrast, three participants (two non-prescribed stimulant users and one cannabis user) expressed that even an initial drug screening would cause them not to apply to a job, noting unwillingness to change their substance use even in the short term (and thus believing they would fail any such test). Together, we find that more restrictive drug policies, especially those that admit the possibility of random testing, are more likely to cause substance-using programmers to not apply to work at a company. Some participants were also concerned by the cultural implications of anti-drug policies. For example, one participant stated that the existence of a drug policy was _"a huge deal breaker"_ and that they _"would not be comfortable working somewhere where they were going to...have that little trust in me"_ [20, US]. Similarly, a second developer also expressed that she thought drug policies at a software company would reflect negatively on the company culture, stating _"I don't know, in 2022?...I feel like certain things are indicators of how old-fashioned or inflexible a company's work culture is. And obviously that's not something I want, so I think [a drug policy] would definitely make me reconsider"_ [26, US]. Together, these results may indicate that the existence of anti-drug policies may make those developers who value trust, individuality, and progressive policies less likely to apply. **Why drug policies may _not_ hurt hiring and retention:** While the majority of participants indicated that a company drug policy could impact their decision to work at that company, a substantial number (10/26) indicated that it would not. However, only one participant expressed a willingness to permanently change their substance use while programming to adhere to a company policy, stating that _"it depends on the job...Say I'll get a job at Google, and Google will require this practice, then I'll quit smoking...I just like programming more than smoking"_ [3, US]. For other participants, their stances were always motivated by a belief the drug policy would not impact them, either because the substances they used would not be banned (e.g., they used only prescribed medications), they planned on keeping their substance use secret indefinitely regardless of the policy, or they thought any policy would be ineffective and thus not worth considering (see Section IX-A). As an indicative example, one participant who works at a startup in Silicon Valley connected their non-consideration of drug policies to remote work, stating _"with remote work they can't really tell. So [a drug policy] wouldn't really affect me"_ [4, US]. Overall, these results indicate that developer ambivalence toward drug policies stems from believing those polices have no impact, rather than believing those policies would substantively change their behavior. Over half of our participants (16/26) indicated that a drug policy has or could impact their decisions to work at a software job, primarily by how restrictive the policy is and what it indicates about company culture. Those participants who would not be influenced by a drug policy cited a belief in the ineffectiveness of the policy or a continued intention to keep their drug use secret, rather than a desire for, or agreement with, the policy itself. ### _Drug Use in Software: What should change?_ Finally, we asked participants what they think should change about drug culture or policy in software environments. Overall, 20 participants proposed at least one software-specific change they would like to see. In our analysis, we identified 10 different suggestions which are listed in Table IV, ordered by how many participants suggested each one. In the rest of this section, we discuss these suggestions in more detail: we first present suggestions that are policy-related, followed by those for software drug culture in general. Because drug policies and drug use impact work quality, socialization and culture, and hiring decisions, companies are likely to benefit from considering the feedback of those most impacted when they develop and evolve their policies. **How software drug policies should change:** On the policy side, participants suggested several changes for software work environments. A full list of these policy changes is in Table IV. However, here we emphasize two suggestions. First, three participants suggested that they would prefer to have policies embrace performance-based or behavior-based metrics, rather than banning or allowing specific substances in particular. As one participant notes, _"there are a lot of people who behave inappropriately at work even if they're sober, and there are people who work better on substances...So, policies should focus on behavior and not what substances you do or don't use"_ [20, US]. Second, three participants suggested that companies should make their policies more consistent; generally when making this suggestion, participants pointed out that while alcohol and caffeine are very accepted by software culture (e.g., corporate happy hours, office coffee machines, etc., see Section VIII-B), other substances that induce a similar level of impairment often are not. For example, one participant stated _"Sometimes you can see that people are just wired on caffeine. And that's widely accepted, right? So why don't we accept if a guy says, 'Hey, I want to come downstairs, smoke a joint and I'll be back and do great work?"_ [21, Australia]. **How software drug culture should change:** In addition to corporate policy, participants also gave suggestions for software company drug culture as a whole. The most requested change (13 participants) would be decreasing stigma toward psychoactive substance use in software. Eight participants called for decreasing the stigma around prescribed medications. For example, one notes, _"I would normalize if someone have trouble focusing...software engineering or debugging process is itself a mind-intensive task...I think it should be normalized if someone takes stress or antidepressants"_[P6, US and Bangladesh]. Other than decreasing stigma, eight participants would like programmers to be more open about psychoactive substance use in general. These comments point toward a more common modern perspective of embracing talking openly about that substance use, as well as other aspects of workforce diversity, as part of overall efforts to recruit and retain the best software engineers, regardless of background. Participants proposed 10 different categories of changes for software drug culture and policy. The most common cultural suggestion is to decrease the stigma regarding psychoactive substance use in software communities. On the policy side, participants suggested a range of changes from loosening anti-drug policies to even encouraging the use of recreational psychoactive substances while brainstorming or solving problems in software. ## X Threats to Validity and Limitations One potential threat to the validity of our study is the high proportion of stimulant users in our population compared to that in the pre-study (see Section III), thus potentially leading to an overemphasis on stimulant user experiences. The high proportion of stimulant users in our population may be explained in part by our recruitment methods (e.g., recruiting from the subreddit r/adderall). We note, however, as the focus of the archival data set used in the pre-study was on recreational rather than prescribed substances, it may also be that stimulant usage was under-reported in that data (a supposition supported by a cursory look at the archival data free-response questions). We leave it to future research to do a more in-depth exploration of stimulant usage in software. One limitation of our design relates to the population considered, which includes only users of psychoactive substances. As a result, the experiences described and themes identified may not generalize to non-users. We focus on users because drug use is often an inherently personal topic: experiences vary by what psychoactive substances are used, individual motivations for use [2], the industry a user is working in, the size of the company, and so on. The goal of this study is _not_ to make overarching statistical claims about the prevalence of certain substances and experiences regarding the use of them in software. Instead, we describe the experiences of developers using psychoactive substances in a way that admits conclusions at personal, interpersonal, and organizational levels. We leave it to future work to investigate the experiences and opinions of non-users. Another limitation of our study is that our sample is biased toward US-based participants (19/26 were working in the United States at the time of the interview, and 17 had exclusively US-based professional programming experiences). This is an especially important bias to consider when contextualizing our results due to the different legal and cultural statuses of substances worldwide. For example, many of our participants use prescription stimulants which are more commonly prescribed in the United States as compared to other countries [3]. We have included the locations of participants for quotes when relevant. However, we encourage future work to investigate psychoactive substance use in broader populations of programmers to better understand which findings (cf. [7]) are transferable to other countries and cultures not represented in our sample. ## XI Conclusion From alcohol to Adderall, from debugging to soft skills, from mental health to social stigma, from company culture to remote work, we find that psychoactive substance use pervades almost all aspects of modern software development. In a qualitative, thematic analysis of 26 hour-long interviews with professional programmers, we delve into the personal experiences of software engineers who use psychoactive substances. At the individual level, we find that **alleviating mental health symptoms** or **desired programming enhancement** are the primary motivations. In addition, a significant emphasis is placed on **productivity** (e.g., with stimulants seen as aiding debugging and cannabis and psychedelics aiding brainstorming). At the socialization level, participants describe a positive impact on **"soft" skills**, as well as **visible use at work** for many substances (and increased use under **work from home**). At the organizational level, there is widespread agreement that **anti-drug policies are unclear and ineffective**. Such policies are viewed as indicative of corporate culture and may have a **negative impact on hiring and retention**. To the best of our knowledge, this is the first qualitative study of modern software engineer experiences with psychoactive substances, and we hope it will encourage further transparent discussion of an important issue that impacts the health and happiness of many developers, as well as the productivity, culture, and hiring of organizations. ## Acknowledgements We acknowledge the partial support of the National Science Foundation (CCF 2211749) as well as the University of Michigan _Center for Academic Innovation_ and the University of Michigan _Chronic Pain & Fatigue Research Center_. We thank Zachary Karas for his aid in the manual transcription of several of our interviews. Additionally, we also extend our thanks to those who gave feedback on initial versions of this work for their advice on the contextualized and measured phrasing of our findings on this sensitive topic.

2303.13904

Multiorbital exciton formation in an organic semiconductor

Harnessing the optoelectronic response of organic semiconductors requires a thorough understanding of the fundamental light-matter interaction that is dominated by the excitation of correlated electron-hole pairs, i.e. excitons. The nature of these excitons would be fully captured by knowing the quantum-mechanical wavefunction, which, however, is difficult to access both theoretically and experimentally. Here, we use femtosecond photoemission orbital tomography in combination with many-body perturbation theory to gain access to exciton wavefunctions in organic semiconductors. We find that the coherent sum of multiple electron-hole pair contributions that typically make up a single exciton can be experimentally evidenced by photoelectron spectroscopy. For the prototypical organic semiconductor buckminsterfullerene (C$_{60}$), we show how to disentangle such multiorbital contributions and thereby access key properties of the exciton wavefunctions including localization, charge-transfer character, and ultrafast exciton formation and relaxation dynamics.

Wiebke Bennecke, Andreas Windischbacher, David Schmitt, Jan Philipp Bange, Ralf Hemm, Christian S. Kern, Gabriele D`Avino, Xavier Blase, Daniel Steil, Sabine Steil, Martin Aeschlimann, Benjamin Stadtmueller, Marcel Reutzel, Peter Puschnig, G. S. Matthijs Jansen, Stefan Mathias

2023-03-24T10:34:30Z

http://arxiv.org/abs/2303.13904v1

# Multiorbital exciton formation in an organic semiconductor ###### Abstract Harnessing the optoelectronic response of organic semiconductors requires a thorough understanding of the fundamental light-matter interaction that is dominated by the excitation of correlated electron-hole pairs, i.e. excitons. The nature of these excitons would be fully captured by knowing the quantum-mechanical wavefunction, which, however, is difficult to access both theoretically and experimentally. Here, we use femtosecond photoemission orbital tomography in combination with many-body perturbation theory to gain access to exciton wavefunctions in organic semiconductors. We find that the coherent sum of multiple electron-hole pair contributions that typically make up a single exciton can be experimentally evidenced by photoelectron spectroscopy. For the prototypical organic semiconductor buckminsterfullerene (C\({}_{60}\)), we show how to disentangle such multiorbital contributions and thereby access key properties of the exciton wavefunctions including localization, charge-transfer character, and ultrafast exciton formation and relaxation dynamics. Main Excitons, quasiparticles consisting of bound electron-hole pairs, are at the heart of the optoelectronic response of all organic semiconductors, and exciton formation and relaxation processes are largely responsible for energy conversion and light harvesting applications in these materials. At the atomic level, excitons are described by a two-particle correlated quantum-mechanical wavefunction that includes both the excited electron and the remaining hole. This wavefunction covers the complete shape of the exciton wave and thus provides access to a number of critical exciton properties such as the orbital character, the degree of (de)localization, the degree of charge separation, and whether this involves charge transfer between molecules. Consequently, in order to fully understand exciton dynamics and to exploit them in, e.g., an organic solar cell, an accurate and complete measurement of the exciton wavefunction would be ideal. Exemplary in this situation is the ongoing work to understand the optoelectronic response of C\({}_{60}\), a prototypical organic semiconductor that is commonly used in organic solar cells [1; 2; 3]. Here, a topic of research has been the optical absorption feature that occurs at 2.8 eV for multilayer and other aggregated structures of C\({}_{60}\)[4]. Interestingly, time- and angle-resolved photoelectron spectroscopy and optical absorption spectroscopy studies have indirectly found that this optical transition corresponds to the formation of charge-transfer excitons with significant electron-hole separation [5; 6; 7; 8; 9]. Although these hints are supported by time-dependent density functional theory calculations that show the importance of delocalized excitations in C\({}_{60}\) clusters [10; 11; 12], quantitative measurements of the exciton localization and charge separation have so far not been possible. Thus, the C\({}_{60}\) case highlights the need for a more direct experimental access to the wavefunctions of the electron-hole pair excitations. From an experimental point of view, our method of choice to access exciton wavefunctions is time-resolved photoemission orbital tomography (tr-POT, see Methods for the experimental realization used in this work) [13; 14; 15; 16]. In POT, the comparison with density functional theory calculations (DFT) provides a direct connection between photoemission data and the orbitals of the electrons. [13] The extension to the time-domain promises valuable access also to the spatial information of excited electrons. However, at least for organic semiconductors, it has not been explicitly considered that photoemission of excitons requires the break-up of the two-particle electron-hole pair and that only the photoemitted electron, but not the hole, is directly detected. In fact, it is not clear to what extent (tr-)POT can be reasonably used for the interpretation and analysis of such strongly interacting correlated quasiparticles. Here we address this open question and show how tr-POT can probe the exciton wavefunction in the example system of a C\({}_{60}\) multilayer. We employ our recently developed setup for photoelectron momentum microscopy [17; 18; 19] and use ultrashort laser pulses to optically excite bright excitons in C\({}_{60}\) thin films that were deposited on Cu(111) (measurement temperature T \(\approx\) 80 K; see Methods and Figure 1a). In Figure 1: Schematic overview of time-resolved photoemission orbital tomography of exciton states in C\({}_{60}\). **a, b**, a femtosecond optical pulse (blue pulse and blue arrow in (**a**) and (**b**), respectively) excites optically bright excitons in a C\({}_{60}\) film. The exciton electron-hole pairs are sketched in (**a**) as correlated particles (shaded blue-red areas) with a blue sphere for the hole and a red sphere for the electron. We probe the excitons in C\({}_{60}\) with extreme ultraviolet (EUV) pulses (purple pulse in (**a**), \(h\nu\) = 26.5 eV) that break up the electron-hole pairs and photoemit the corresponding electrons (red spheres), of which we detect the kinetic energies and the momentum emission patterns (yellow-green-colored disks in (**a**)). The optical excitation of excitons in C\({}_{60}\) is known to lead to the formation of a decay sequence of singlet exciton states with varying charge-transfer character [5; 6] (see (**b**), S\({}_{\mathrm{i}}\): \(\mathrm{i}^{\mathrm{th}}\) singlet excited state, S\({}_{0}\): ground state). We are able to measure these exciton dynamics and the corresponding orbital tomography momentum patterns by adjusting the temporal delay between the optical excitation and the EUV probe pulses. the time-resolved photoemission experiment, we detect the energy and momentum emission pattern of the photoemitted electrons, which were initially part of the bound electron-hole pairs, i.e. the excitons. Following the time-evolution of the photoelectron spectrum, we can observe how the optically excited states relax to energetically lower-lying dark exciton states with different localization and charge-transfer character [5; 6] (Figure 1b and data in Extended Fig. 6). In addition to the energy relaxation, we collect tr-POT data, and investigate in how far these patterns can be used to access real-space properties of the exciton wavefunctions. Specifically, we will address two questions: which orbitals contribute to the formation of the excitons and how this key information is imprinted in the energy- and momentum-resolved photoemission spectra. ## II Results & Discussion ### The exciton spectrum of buckminsterfullerene C\({}_{60}\) To lay the foundation for our study, we first discuss the theoretical electronic properties of the C\({}_{60}\) film. On top of a hybrid-functional DFT ground state calculation, we obtain the exciton spectrum by employing the many-body framework of \(GW\) and Bethe-Salpeter-Equation (\(GW\)+BSE) calculations (see Methods for full details). As shown in Fig. 2a, we model the C\({}_{60}\) low-temperature phase by the two symmetry-inequivalent C\({}_{60}\) dimers 1-2 and 1-4, respectively [20], which are properly embedded to account for polarization effects in the film. The calculated single-particle energy levels are shown in Fig. 2b, where we group the electron removal and electron addition energies into four bands, denoted as HOMO-1, HOMO, LUMO, and LUMO+1 according to the orbitals of the parent orbitals of an gas-phase C\({}_{60}\) molecule. These manifolds consist of 18, 10, 6, and 6 energy levels per dimer, respectively, originating from the \(g_{g}\)+\(h_{g}\), \(h_{u}\), \(t_{1u}\), and \(t_{1g}\) irreducible representations of the gas phase C\({}_{60}\) orbitals [21]. We emphasize that the calculated \(GW\) ionization levels of HOMO and HOMO-1 of 6.7 eV and 8.1 eV are in excellent agreement with experimental data for this C\({}_{60}\) film (see SI and Ref. [22]). Building upon the \(GW\) single-particle energies, we solve the Bethe-Salpeter equation and compute the energies \(\Omega_{m}\) of all correlated electron-hole pairs (excitons). The resulting absorption spectrum (bottom panel of Fig. 2c) agrees well with literature [4]. In addition, we obtain the weights \(X_{vc}^{(m)}\) on the specific electron-hole pairs that coherently contribute to the \(m^{\text{th}}\) exciton state, from which the exciton wavefunctions are constructed in the Tamm-Dancoff approximation as follows: \[\psi_{m}(\mathbf{r}_{h},\mathbf{r}_{e})=\sum_{v,c}X_{vc}^{(m)}\phi_{v}^{*}(\mathbf{r}_{h}) \chi_{c}(\mathbf{r}_{e}). \tag{1}\] This means that each exciton \(\psi_{m}\) with energy \(\Omega_{m}\) consists of a weighted coherent sum of multiple electron-hole-transitions \(\phi_{v}(\mathbf{r}_{h})\chi_{c}(\mathbf{r}_{e})\) each containing one electron orbital \(\chi_{c}\) and one hole orbital \(\phi_{v}\). To gain more insight into the character of the excitons \(\psi_{m}\), we qualitatively classify them according to the most dominant orbital contributions that are involved in the transitions. Figure 2: _Ab-initio_ calculation of the electronic structure and exciton spectrum of C\({}_{60}\) dimers in a crystalline multilayer sample. **a**, the unit cell for a monolayer of C\({}_{60}\), for which \(GW\)+BSE calculations for the dimers 1-2 and 1-4 were performed. **b**, electron addition/removal single-particle energies as retrieved from the self-consistent \(GW\) calculation. These energies directly provide \(\varepsilon_{v}\) in Eq. (2). **c**, results of the full \(GW\)+BSE calculation, showing as a function of the exciton energy \(\Omega\) from bottom to top: the calculated optical absorption, the exciton band assignment S\({}_{1}\) - S\({}_{4}\), and the relative contributions to the exciton wavefunctions of different electron-hole pair excitations \(\phi_{v}(\mathbf{r}_{h})\chi_{c}(\mathbf{r}_{e})\). Full details on the calculations are given in the Methods section. **d**, sketch of the composition of the exciton wavefunction of the S\({}_{1}\) - S\({}_{4}\) bands and their expected photoemission signatures based on Eq. (2). In order to visualize the contributing orbitals, blue holes and red electrons are assigned to the single-particle states as shown in (**b**). This is visualized in the four sub-panels above the absorption spectrum in Fig. 2c. For a given exciton energy \(\Omega_{m}\), the black bars in each sub-panel show the partial contribution \(|X_{v,c}^{(m)}|^{2}\) of characteristic electron-hole transitions \(\phi_{v}(\mathbf{r}_{h})\chi_{c}(\mathbf{r}_{e})\) to a given exciton \(\psi_{m}\). Looking at individual sub-panels, we see first that characteristic electron-hole transitions can belong to different excitons \(\psi_{m}\) that have very different exciton energies \(\Omega_{m}\). For example, the blue panel in Fig. 2c shows the contributions of HOMO\(\rightarrow\)LUMO (abbreviated H\(\rightarrow\)L) transitions as a function of exciton energy \(\Omega_{m}\), and we see that these transitions contribute to excitons that are spread in energy over a scale of more than 1 eV (from \(\Omega_{m}\)\(\approx\) 1.7 eV to 3 eV). This spread of H\(\rightarrow\)L contributions (and also H\(-\)n\(\rightarrow\)L\(+\)m contributions) is caused by the fact that there are already many orbital energies per dimer (cf. Fig. 2b) which combine to form excitons with different degrees of localization and delocalization of the electrons and holes on one or more molecules. We now focus on four exciton bands of the C\({}_{60}\) film, denoted as S\({}_{1}\) - S\({}_{4}\), which are centered around \(\Omega_{S1}\), \(\Omega_{S2}\), \(\Omega_{S3}\) and \(\Omega_{S4}\) at 1.9, 2.1, 2.8 and 3.6 eV, respectively (cf. Ref. [6]). It is important to emphasize that each exciton band S\({}_{1}\) - S\({}_{4}\) arises from many individual excitons \(\psi_{m}\) with similar exciton energies \(\Omega_{m}\) within the exciton band. Looking again at the sub-panels, we see that the S\({}_{1}\) and S\({}_{2}\) exciton bands are made up of excitons \(\psi_{m}\) that are almost exclusively composed of transitions from H\(\rightarrow\)L. On the other hand, the S\({}_{3}\) shows in addition to H\(\rightarrow\)L also significant contributions from H\(\rightarrow\)L\(+\)1 transitions (pink-dashed panel). The S\({}_{4}\) exciton band can be characterized as arising from H\(\rightarrow\)L\(+\)1 (pink-dashed panel) and H\(-\)1\(\rightarrow\)L (orange-dash-dotted panel) as well as transitions from the HOMO to several higher lying orbitals denoted as H\(\rightarrow\)L\(+\)n (yellow-dotted panel). We emphasize that although orbitals from several different \(GW\) energies contribute, e.g., to an exciton in the S\({}_{4}\) band, the exciton energy \(\Omega_{m}\) of each exciton \(\psi_{m}\) has a single well-defined value. ### Photoemission signatures of multiorbital contributions In the following, we investigate whether these theoretically predicted multiorbital characteristics of the excitons can also be probed experimentally. As will be shown below, time-resolved photoemission spectroscopy can indeed provide access not only to the dark exciton landscape [23; 24; 25; 26; 27], but also to the distinct orbital contributions of exciton states. A key step in extracting this information from the experimental data lies in a thorough compar ison with simulations that specifically consider the pump-probe photoemission process, a topic that has recently attracted increased attention [28; 29; 30; 31]. Here, we rely on the formalism of Kern _et al._[32], which is based on a common Fermi's golden rule approach to photoemission [33]. Assuming the exciton of Eq. (1) as the initial state and applying the plane-wave final state approximation of POT, the photoemission intensity of the exciton \(\psi_{m}\) is formulated as \[I_{m}(E_{\rm kin},\mathbf{k})\propto\left|\mathbf{A}\mathbf{k}\right|^{2}\sum_{v}\left| \sum_{c}X_{vc}^{(m)}\mathcal{F}\left[\chi_{c}\right]\left(\mathbf{k}\right)\right| ^{2}\times\delta\left(h\nu-E_{\rm kin}-\varepsilon_{v}+\Omega_{m}\right). \tag{2}\] Here \(\mathbf{A}\) is the vector potential of the incident light field, \(\mathcal{F}\) the Fourier transform, \(\mathbf{k}\) the photoelectron momentum, \(h\nu\) the probe photon energy, \(\varepsilon_{v}\) the \(v^{\rm th}\) ionization potential, \(\Omega_{m}\) the exciton energy, and \(E_{kin}\) the energy of the photoemitted electron. Note that \(\varepsilon_{v}\) directly indicates the final-state energy of the left-behind hole. In the context of our present study, delving into Eq. (2) leads to two striking consequences, which we discuss in the following. First, we illustrate the consequences of the multiorbital character of the exciton states on the photoelectron spectrum, and sketch in Fig. 2d the typical single-particle energy level diagrams for the HOMO and LUMO states and then indicate the contributing orbitals to the two-particle exciton state by blue holes and red electrons in these states, respectively. For the S\({}_{1}\) exciton band (left panel), we already found that the main orbital contributions to the band are of H\(\rightarrow\)L character (Fig. 2d, left, and cf. Fig. 2c, blue panel). To determine the kinetic energy of the photoelectrons originating from the exciton, we have to consider the correlated nature of the electron-hole pair. The energy conservation expressed by the delta function in Eq. 2 (see also Ref. [23] and [34]) requires that the kinetic energy of the photoelectron depends on the ionization energy of the involved HOMO hole state \(\varepsilon_{v}=\varepsilon_{H}\) and the correlated electron-hole pair energy \(\Omega\approx\Omega_{S_{1}}\). Therefore, we expect to measure a single photoelectron peak, as shown in the lower part of the left panel of Fig. 2d. In the case of the S\({}_{2}\) exciton the situation is similar, since the main orbital contributions are also of H\(\rightarrow\)L character. However, since the S\({}_{2}\) exciton band has a different energy \(\Omega_{S_{2}}\), the photoelectron peak is located at a different kinetic energy with respect to the S\({}_{1}\) peak. In the case of the S\({}_{3}\) exciton band, we find that in contrast to the S\({}_{1}\) and S\({}_{2}\) excitons not only H\(\rightarrow\)L, but also H\(\rightarrow\)L+1 transitions contribute (Fig. 2d, middle panel, and cf. Fig 2c, blue and pink-dashed panels, respectively). However, we still expect a single peak in the photoemission, because the same hole states are involved for both transitions (i.e., same \(\varepsilon_{v}=\varepsilon_{H}\) in the sum in Eq. 2), and all orbital contributions have the same exciton energy \(\approx\Omega_{S_{3}}\), even though transitions with electrons in energetically very different single-particle LUMO and LUMO+1 states contribute. With other words, and somewhat counter-intuitively, the single-particle energies of the electron orbitals (the LUMOs) contributing to the exciton do not enter the energy conservation term in Eq. 2, and thus do not affect the kinetic energy observed in the experiment. Finally, for the S\({}_{4}\) exciton band at \(\Omega_{S4}\) = 3.6 eV, we find three major contributions (Fig. 2d, right panel), where not only the electrons but also the holes are distributed over two energetically different levels, namely the HOMO (cf. pink-dashed and yellow-dotted panels in Fig. 2c,d) and the HOMO-1 (cf. orange-dash-dotted panels in Fig. 2c,d). Thus, there are two different final states available for the hole, each with a different binding energy. Consequently, the photoemission spectrum of S\({}_{4}\) is expected to exhibit a double-peak structure with intensity appearing \(\approx\) 3.6 eV above the HOMO kinetic energy \(E_{H}\), and \(\approx\) 3.6 eV above the HOMO-1 kinetic energy \(E_{H-1}\), as illustrated in the right-most panel of Fig. 2d. Relating this specifically to the single-particle picture of our \(GW\) calculations, the two peaks are predicted to have a separation of \(\varepsilon_{H-1}\) - \(\varepsilon_{H}\) = 8.1 - 6.7 = 1.4 eV. In addition, Eq. (2) now also provides the theoretical framework for interpreting momentum-resolved tr-POT data from excitons. Ground state POT can be easily understood in terms of the Fourier transform \(\mathcal{F}\) of single-particle orbitals. A naive extension to excitons might imply an incoherent, weighted sum of all LUMO orbitals \(\chi_{c}\) contributing to the exciton wavefunction. However, as Eq. (2) shows, such a simple picture proves insufficient. Instead, the momentum pattern of the exciton wavefunction is related to a coherent superposition of the electron orbitals \(\chi_{c}\) weighted by the electron-hole coupling coefficients \(X_{vc}^{(m)}\). The implications of this finding are sketched in the \(k_{x}\)-\(k_{y}\) plots in Fig. 2d and are most obvious for the S\({}_{3}\) band. Here, the exciton is composed of transitions with a common hole position, i.e., H\(\rightarrow\)L and H\(\rightarrow\)L+1, leading to a coherent superposition of all 12 electron orbitals from the LUMO and LUMO+1 in the momentum distribution. In summary, multiple hole contributions can be identified in a multi-peak structure in the photoemission spectrum, and multiple electron contributions will result in a coherent sum of the electron orbitals that can be identified in the corresponding energy-momentum patterns from tr-POT data. ### Disentangling multiorbital contributions experimentally These very strong predictions about multi-peaked photoemission spectra due to multi-orbital excitons can be directly verified in an experiment on C\({}_{60}\) by comparing spectra for resonant excitation of either the S\({}_{3}\) or the S\({}_{4}\) excitons (cf. Fig. 2). The corresponding experimental data are shown in Fig. 3a and 3c, respectively. Starting from the excitation of the S\({}_{3}\) exciton band with \(h\nu=2.9\) eV photon energy (which is sufficiently resonant to excite the manifold of exciton states that make up the S\({}_{3}\) band around \(\Omega_{S_{3}}=2.8\) eV), we can clearly identify the direct excitation (at 0 fs delay) of the exciton S\({}_{3}\) feature at an energy of E \(\approx\) 2.8 eV above the kinetic energy \(E_{H}\) of the HOMO level. Shortly after the excitation, additional photoemission intensity builds up at \(E-E_{H}\approx 2.0\) eV and \(\approx 1.7\) eV, which is known to be caused by relaxation to the S\({}_{2}\) and S\({}_{1}\) dark exciton states [6] and is in good agreement with the theoretically predicted energies of \(E-E_{H}\approx\) 2.1 eV and \(\approx\)1.9 eV. Changing now the pump photon energy to \(h\nu=3.6\) eV for direct excitation of the S\({}_{4}\) exciton band (Fig. 3c), two distinct peaks at \(\approx\) 3.6 eV above the HOMO and the HOMO-1 are expected from theory. While photoemission intensity at \(E-E_{H}\approx 3.6\) eV above the HOMO level is readily visible in Fig. 3c, the second feature at 3.6 eV above the HOMO-1 is expected at \(E-E_{H}\approx 2.2\) eV above the HOMO level (corresponding to \(E-E_{H-1}\)\(\approx\) 3.6 eV) and thus almost degenerate with the aforementioned S\({}_{2}\) dark exciton band at about \(E-E_{H}\approx 2.0\) eV, which appears after the optical excitation due to relaxation processes. Therefore, we need to pinpoint this second H\(-\)1\(\rightarrow\)L contribution to the S\({}_{4}\) exciton at the earliest time of the excitation. Indeed, a closer look around 0 fs delay shows additional photoemission intensity at about \(E-E_{H}\approx 2.2\) eV. Using difference maps (Fig. 3b) and direct comparisons of energy-distribution-curves at selected time-steps (Fig. 3d), we clearly find a double-peak structure corresponding to the energy difference of \(\approx\)1.4 eV of the HOMO and HOMO-1 levels. Thereby, we have shown that photoelectron spectroscopy, in contrast to other techniques (e.g., absorption spectroscopy), is indeed able to disentangle different orbital contributions of the excitons. In this way, we have validated the theoretically predicted multi-peak structure of the multiorbital exciton state that is implied by Eq. (2). We also see that the photoelectron energies in the spectrum turn out to be sensitive probes of the corresponding hole contributions of the correlated exciton states. We note that the signature of the S\({}_{3}\) excitons, even if not directly excited with the light pulse in this measurement, is still visible and moreover with significantly higher intensity than the multiorbital signals of the resonantly excited S\({}_{4}\) exciton band. This observation strongly suggests that there is a very fast relaxation from the S\({}_{4}\) exciton to the S\({}_{3}\) exciton, with relaxation times well below 50 fs (see Extended Fig. 6). ### Time-resolved photoemission orbital tomography of exciton wavefunctions Based on the excellent agreement between the experiment and the \(GW\)+BSE theoretical results, we are now ready to investigate to what extent the momentum patterns from tr-POT data of excitons in organic semiconductors contain information about the real-space spatial Figure 3: **a-d**, comparison of the time-resolved photoelectron spectra of multilayer C\({}_{60}\) for \(h\nu=2.9\) eV excitation and \(h\nu=3.6\) eV excitation ((**a**) and (**c**), respectively), both normalized and shifted in time to match the intensity of the S\({}_{3}\) signals (see Methods for full details on the data analysis). As can be seen in the difference (**b**), for \(h\nu=3.6\) eV pump we observe an enhancement of the photoemission yield around \(E-E_{H}\approx 3.6\) eV as well as around \(E-E_{H}\approx 2.2\) eV. We attribute this signal to the S\({}_{4}\) exciton band, which has hole contributions stemming from both the HOMO and the HOMO-1. To further quantify the signal of the S\({}_{4}\) exciton, (**d**) shows energy distribution curves for both measurements at early delays, showing the enhancement in the \(h\nu=3.6\) eV measurement. distribution of the exciton wavefunction. In the experiment, we once again excite the S\({}_{3}\) exciton band in the C\({}_{60}\) film with \(h\nu=2.9\) eV pump energy, and we now use femtosecond tr-POT to collect the momentum fingerprints of the directly excited S\({}_{3}\) excitons around 0 fs and the subsequently built-up dark S\({}_{2}\) and S\({}_{1}\) excitons that appear in the exciton relaxation cascade in the C\({}_{60}\) film (see Fig. 4a-c, where the momentum map of the lowest energy S\({}_{1}\) exciton band is plotted in (a), the S\({}_{2}\) in (b) and the highest energy S\({}_{3}\) exciton band in (c); see Extended Fig. 6 for time-resolved traces of the exciton formation and relaxation dynamics). We note that the collection of these data required integration times of up to 70 hours, and that a measurement of the comparatively low-intensity S\({}_{4}\) feature when excited with \(h\nu=3.6\) eV has not yet proved feasible. For the interpretation of the collected POT momentum maps from the S\({}_{1}\), S\({}_{2}\), and S\({}_{3}\) excitons, we also calculate the expected momentum fingerprints for the wavefunctions obtained from the \(GW\)+BSE calculation for both dimers, each rotated to all occurring orientations in the crystal. Finally, for the theoretical momentum maps, we sum up the photoelectron intensities of each electron-hole transition in an energy range of 200 meV centered on the exciton band. The results are shown in Fig. 4d-f below the experimental data for direct comparison. First, we observe that the experimental momentum maps of the S\({}_{1}\) and S\({}_{2}\) states are largely similar (Fig. 4a,b), showing six lobes centered at \(k_{\parallel}\approx 1.2\) A-1. These features, as well as the energy splitting between S\({}_{1}\) and S\({}_{2}\) (cf. Fig. 2c), are accurately reproduced by the \(GW\)+BSE prediction (Fig. 4d,e). Furthermore, also the \(GW\)+BSE calculation shows very similar momentum maps for S\({}_{1}\) and S\({}_{2}\), suggesting a similar spatial structure of the excitons. This is in contrast to a naive application of static POT to the unoccupied orbitals of the DFT ground state of C\({}_{60}\), which does show a similar momentum map for the LUMO, but cannot explain a kinetic energy difference in the photoemission signal, nor give any indication of differences in the corresponding exciton wavefunctions. With this agreement between experiment and theory, we now extract the spatial properties of the \(GW\)+BSE exciton wavefunctions. To visualize the degree of charge-transfer of these two-particle exciton wavefunctions \(\psi_{m}(\mathbf{r_{h}},\mathbf{r_{e}})\), we integrate the electron probability density over all possible hole positions \(\mathbf{r_{h}}\), considering only hole positions at one of the C\({}_{60}\) molecules in the dimer. This effectively fixes the hole contribution to a particular C\({}_{60}\) molecule (blue circles in Fig. 4g-i indicate the boundary of considered hole positions around one molecule, hole distribution not shown), and provides a probability density for the electronic part of the exciton wavefunction in the dimer, which we visualize by a yellow isosurface (see Fig. 4g-i). Obviously, in the case of S\({}_{1}\) and S\({}_{2}\) (Fig. 4g,h), when the hole position is restricted to one molecule of the dimer, the electronic part of the exciton wavefunction is localized at the same molecule of the dimer. Our calculations thus suggest that the S\({}_{1}\) and S\({}_{2}\) excitons are of Frenkel-like nature. Their energy difference originates from different excitation symmetries possible for the H\(\rightarrow\)L transition (namely \(t_{1g}\), \(t_{2g}\), and \(g_{g}\) for the S\({}_{1}\) and \(h_{g}\) for the S\({}_{2}\)). [12] In contrast to the S\({}_{1}\) and S\({}_{2}\) excitons, the momentum map of the S\({}_{3}\) band shows a much Figure 4: **a-f**, comparison of the (**a-c**) experimental momentum maps acquired for the three exciton bands observed in C\({}_{60}\) with the (**d-f**) predicted momentum maps retrieved from \(GW\)+BSE. Note that the center of the experimental maps could not be analyzed due to a space-charge-induced background signal in this region (gray area, see Methods). **g-i**, isosurfaces of the integrated electron probability density (yellow) within the 1-2 dimer for fixed hole positions on the bottom-left molecule (blue circle) of the dimer for the (**g**) S\({}_{1}\), the (**h**) S\({}_{2}\), and the (**i**) S\({}_{3}\) exciton bands. more star-shaped POT fingerprint in both theory and experiment (Fig. 4c,f). This is to be expected, since the electronic part of the S\({}_{3}\) excitons contains not only contributions from the LUMO orbital, but also contributions from the LUMO+1 orbital. Note, however, that we find the experimentally observed star-shaped pattern to be only partially reproduced by the \(GW\)+BSE calculation. An indication towards the cause of this discrepancy is found by considering the electron-hole separation of the excitons making up the S\({}_{3}\) band. Here, we find that the positions of the electron and the hole contributions are strongly anticorrelated (Fig. 4i), with the electron confined to the neighboring molecule of the dimer. In fact, the mean electron-hole separation is as large as 7.6 A, which is close to the core-to-core distance of the C\({}_{60}\) molecules. Although these theoretical results confirm the previously-reported charge-transfer nature of the S\({}_{3}\) excitons [5; 6], they also reflect the limitations of the C\({}_{60}\) dimer approach. Indeed, the dimer represents the minimal model to account for an intermolecular exciton delocalization effect, but it cannot fully account for dispersion effects [22] (cf. Extended Fig. 5), which are required for a quantitative comparison with experimental data. Besides the discrepancy in the S\({}_{3}\) momentum map, this could also be an explanation why the S\({}_{2}\) in the present work is of Frenkel-like nature, but could have charge-transfer character according to previous studies [5; 6]. However, future developments will certainly allow scaling up of the cluster size in the calculation, so that exciton wavefunctions with larger electron-hole separation can be accurately described. Most importantly, we find that the present dimer \(GW\)+BSE calculations are clearly suited to elucidate the multiorbital character of the excitons, which is an indispensable prerequisite for the correct interpretation of tr-POT data of excitons in organic semiconductors. ## III Conclusion In conclusion, we have shown how the energy- and momentum-resolved photoemission spectrum of excitons in an organic semiconductor depends on the multiorbital nature of these excitons. By extending POT to fully-interacting exciton states calculated in the framework of the Bethe-Salpeter equation, we found that the energy of the photoemitted electron of the exciton quasiparticle is determined by the position of the hole and the exciton energy in combination with the probe photon energy. This leads to the prediction of multiple peaks in the photoelectron spectrum, which we verify experimentally, and allows disentangling the differ ent orbital contributions, the wavefunction localization, and the charge-transfer character. Similarly, the momentum fingerprint provides access to the electron states that make up the exciton. Most importantly, we introduce time-resolved photoemission orbital tomography as a key technique for the study of exciton wavefunctions in organic semiconductors. ## IV Acknowledgements This work was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 432680300/SFB 1456, project B01 and 217133147/SFB 1073, projects B07 and B10. G.S.M.J. acknowledges financial support by the Alexander von Humboldt Foundation. A.W., C.S.K., and P.P acknowledge support from the Austrian Science Fund (FWF) project I 4145. The computational results presented were achieved using the Vienna Scientific Cluster (VSC) and the local high-performance resources of the University of Graz. R.H., M.A., and B.S. acknowledge financial support by the DFG - 268565370/TRR 173, projects B05 and A02. B.S. acknowledges further support by the Dynamics and Topology Center funded by the State of Rhineland-Palatinate. ## V Author contributions D.St., M.R., S.S., M.A., B.S., P.P., G.S.M.J. and S.M. conceived the research. W.B., D.Sch. and J.P.B. carried out the time-resolved momentum microscopy experiments. W.B. analyzed the data. W.B. and R.H. prepared the samples. A.W., C.S.K., G.D.A, X.B. and P.P. performed the calculations and analyzed the theoretical results. All authors discussed the results. G.S.M.J. and S.M. were responsible for the overall project direction and wrote the manuscript with contributions from all co-authors.

2306.08244

Clairaut slant Riemannian maps to Kähler manifolds

The aim of this article is to describe the idea of Clairaut slant Riemannian maps from Riemannian manifolds to K\"ahler manifolds. First, for the slant Riemannian map, we obtain the necessary and sufficient conditions for a curve to be a geodesic on the base manifold. Further, we find the necessary and sufficient conditions for the slant Riemannian map to be a Clairaut slant Riemannian map; for Clairaut slant Riemannian map to be totally geodesic; for the base manifold to be a locally product manifold. Further, we obtain the necessary and sufficient condition for the integrability of range of derivative map. Also, we investigate the harmonicity of Clairaut slant Riemannian map. Finally, we get two inequalities in terms of second fundamental form of a Clairaut slant Riemannian map and check the equality case.

Jyoti Yadav, Gauree Shanker, Murat Polat

2023-06-14T05:09:22Z

http://arxiv.org/abs/2306.08244v1

# Clairaut slant Riemannian maps to Kahler manifolds ###### Abstract The aim of this article is to describe the idea of Clairaut slant Riemannian maps from Riemannian manifolds to Kahler manifolds. First, for the slant Riemannian map, we obtain the necessary and sufficient conditions for a curve to be a geodesic on the base manifold. Further, we find the necessary and sufficient conditions for the slant Riemannian map to be a Clairaut slant Riemannian map; for Clairaut slant Riemannian map to be totally geodesic; for the base manifold to be a locally product manifold. Further, we obtain the necessary and sufficient condition for the integrability of range of derivative map. Also, we investigate the harmonicity of Clairaut slant Riemannian map. Finally, we get two inequalities in terms of second fundamental form of a Clairaut slant Riemannian map and check the equality case. **M. S. C. 2020:** 53B20, 53B35. **Keywords:** Kahler manifold, Clairaut submersion, Riemannian map, slant Riemannian map, Clairaut Riemannian map. ## 1 Introduction To understand the relation between the geometric structures of two Riemannian manifolds, smooth maps are helpful. Therefore there is a need to define more maps for comparing the geometric properties between two Riemannian manifolds. Riemannian submersions and isometric immersions are the two such types of basic maps. A smooth map \(\pi\) between Riemannian manifolds \((P,g_{P})\) and \((Q,g_{Q})\) is said to be an isometric immersion if the differential map \(\pi_{*}\) is one-one and satisfies the condition \(g_{Q}(\pi_{*}X,\pi_{*}Y)=g_{P}(X,Y)\) for \(X,Y\in\Gamma(TP)\). O'Neill [16] and Gray [10] addressed Riemannian submersion and O'Neill derived the fundamental equations for Riemannian submersion, which are helpful to study the geometry of Riemannian manifolds. A smooth map \(\pi\) between Riemannian manifolds \(P\) and \(Q\) is called a Riemannian submersion if \(\pi_{*}\) is surjective and it preserves the length of the horizontal vector field. In [7, 8], the geometry of Riemannian submersion was investigated. In [9], Fischer proposed the idea of Riemannian maps between Riemannian manifolds which are the generalizations of Riemannian submersions and isometric immersions. A notable characteristic of Riemannian maps is that Riemannian maps satisfy the generalized eikonal equation \(||\pi_{*}||^{2}=rank\pi\) which connects geometric optics and physical optics. Fischer also demonstrated how Riemannian maps can be used to build various quantum models of nature. The geometry of Riemannian maps were investigated in [18, 23, 25]. There are several kinds of submanifolds which depend on how a tangent bundle of a submanifold responds to the influence of the complex structure \(\mathrm{J}^{\prime}\) of the ambient manifold, namely, Kahler submanifolds, CR-submanifolds, totally real submanifolds, generic submanifolds, slant submanifolds, pointwise slant submanifolds, semi-slant submanifolds, and hemi-slant submanifolds. Chen [6] introduced the idea of slant submanifolds of an almost Hermitian manifold, and according to this idea, slant submanifolds include totally real and holomorphic submanifolds. In addition, Sahin [21] provided the concept of slant Riemannian map which is a generalization of slant immersions ( totally real immersions and holomorphic immersions), invariant Riemannian maps and anti-invariant Riemannian maps. The idea of Clairaut's relation comes from elementary differential geometry. According to Clairaut theorem, let \(\rho\) be the distance of the surface from the axis of rotation and let \(\theta\) be the angle between the meridian and velocity vector of the geodesic on the surface then \(\rho sin\theta\) is constant. Bishop [5] generalized this idea on submersion theory and introduced Clairaut submersion. A submersion \(\pi:P\to Q\) is said to be a Clairaut submersion if there is a function \(\rho:P\to R^{+}\) such that for every geodesic, making an angle \(\theta\) with the horizontal subspace then \(\rho sin\theta\) is constant. Further, Clairaut submersion has been studiedin [14] and in many other spaces viz. Lorentzian spaces, timelike and spacelike spaces [3, 11, 27, 26]. Since then, submersions have been defined on different aspects. A Clairaut submersion is a helpful tool for establishing decomposition theorems on Riemannian manifolds. Many submersions are based on the behavior of tangent bundle of ambient space and submanifolds. Watson [28] introduced the concept of almost Hermitian submersion. Sahin [22] introduced holomorphic Riemannian maps between almost Hermitian manifolds, which is a generalization of holomorphic submanifolds and holomorphic submersions. Additionally, the idea of a Riemannian map has been examined from different points of view viz. anti-invariant [19], semi-invariant [20], slant Riemannian maps [21] from a Riemannian manifold to a Kahler manifold. Further, conformal anti-invariant, semi-invariant Riemannian map from Riemannian manifold to Kahler manifold were introduced in [1, 2]. The Clairaut Riemannian maps were introduced in [24], [13] and [12]. Recently, Meena et. al have introduced Clairaut invariant [29], anti-invariant [30], and semi-invariant [17] Riemannian maps between Riemannian manifolds and Kahler manifolds. In this article, we discuss about Clairaut slant Riemannian maps. The paper is structured as follows: In section 2, we discuss several fundamental terms, definitions, and informations required for this paper. In section 3, we define Clairaut slant Riemannian map from a Riemannian manifold to a Kahler manifold. Further, we obtain a necessary and sufficient condition for a slant Riemannian map to be Clairaut. Additionally, we find a necessary and sufficient condition for the Clairaut slant Riemannian map to be totally geodesic. Next we find harmonicity of Clairaut slant Riemannian map. Along with this, we obtain inequalities of Clairaut slant Riemannian map and check the inequality case. Finally, we provide a non-trivial example for existence of such Clairaut slant Riemannian map. ## 2 Preliminaries Let \(\pi\) be a smooth map between two Riemannian manifolds \((P,g_{P})\) and \((Q,g_{Q})\) of dimension \(p,q\) respectively, such that \(rank\pi\leq\min\{p,q\}\). Let \(\mathcal{V}_{r}=ker\pi_{sr}\) at \(r\in P,\) stands for vertical distribution or kernel space of \(\pi_{*}\) and \(\mathcal{H}_{r}=(ker\pi_{sr})^{\perp}\) in \(T_{r}P\) is the orthogonal complementary space of \(\mathcal{V}_{r}\). Then the tangent space \(T_{r}P\) at \(r\in P\) has the decomposition, \[T_{r}P=(ker\pi_{*r})\oplus(ker\pi_{*r})^{\perp}=\mathcal{V}_{r}\oplus\mathcal{H }_{r}.\] Let the range of \(\pi_{*}\) be denoted by \(range\pi_{*r}\) at \(r\in P\), and \((range\pi_{sr})^{\perp}\) be the orthogonal complementary space of \(range\pi_{*r}\) in the tangent space \(T_{\pi(r)}Q\) of \(Q\) at \(\pi(r)\in Q\). Since \(rank\leq\min\{p,q\}\), this gives \((range\pi_{*r})^{\perp}\neq 0\). Thus, the tangent space \(T_{\pi(r)}Q\) of \(Q\) at \(\pi(r)\in Q\) has the following decomposition: \[T_{\pi(r)}Q=(range\pi_{*r})\oplus(range\pi_{*r})^{\perp}.\] Now, a smooth map \(\pi:(P,g_{P})\rightarrow(Q,g_{Q})\) is said to be a Riemannian map at \(r_{1}\in P\) if the horizontal restriction \(\pi_{r_{1}}^{h}:(ker\pi_{*r_{1}})^{\perp}\rightarrow(range\pi_{*r_{1}})\) is a linear isometry between the inner product spaces \(((ker\pi_{*r_{1}})^{\perp},g_{Q}(r_{1})|(ker\pi_{*r_{1}})^{\perp})\) and \(((range\pi_{*r_{1}},g_{Q}(r_{2})|(range\pi_{*r_{1}})),r_{2}=\pi(r_{1})\). In another words, \(\pi_{*}\) satisfies the equation \[g_{Q}(\pi_{*}X,\pi_{*}Y)=g_{P}(X,Y),\forall X,Y\in\Gamma(ker\pi_{*})^{\perp}. \tag{2.1}\] It is observed that Riemannian submersions and isometric immersions are particular case of Riemannian maps with \((range\pi_{*r})^{\perp}=0\) and \(ker\pi_{*r}=0\), respectively. For any vector field \(X\) on \(P\) and any section \(V\) of \((range\pi_{*})^{\perp}\), we define \(\nabla_{X}^{\perp}V\) as the orthogonal projection of \(\nabla_{X}^{Q}V\) on \((range\pi_{*})^{\perp}\). From now, we denote by \(\nabla^{Q}\) Levi-Civita connection for \((Q,g_{Q})\) and \(\nabla^{Q_{*}}\) pullback connection along \(\pi\). Next, suppose that \(\pi\) is a Riemannian map and define \(S_{V}\) as [23] \[\nabla_{\pi_{*}X}^{Q}V=-S_{V}\pi_{*}X+\nabla_{X}^{\pi\perp}V, \tag{2.2}\] where \(S_{V}\pi_{*}X\) is the tangential component and \(\nabla_{X}^{\pi\perp}V\) the orthogonal component of \(\nabla_{\pi_{*}X}^{Q}V\). It can be easily seen that \(\nabla_{\pi_{*}X}^{Q}V\) is obtained from the pullback connection of \(\nabla^{Q}\). Thus, at \(r\in P\), we have \(\nabla_{\pi_{*}X}^{Q}V(r)\in T_{\pi(r)}Q,S_{V}\pi_{*}X\in\pi_{*r}(T_{r}P)\) and \(\nabla_{X}^{\pi\perp}V\in(\pi_{*r}(T_{r}P))^{\perp}\). It follows that \(S_{V}\pi_{*}X\) is bilinear in \(V\) and \(\pi_{*}X\) and \(S_{V}\pi_{*}X\) at \(r\) depends only on \(V_{r}\) and \(\pi_{*r}X_{r}\). By direct computations, we obtain \[g_{Q}(S_{V}\pi_{*}X,\pi_{*}Y)=g_{Q}\big{(}V,(\nabla\pi_{*})(X,Y)\big{)}, \tag{2.3}\] for all X, Y\(\in\Gamma(ker\pi_{*})^{\perp}\)_and_\(V\in\Gamma(range\pi_{*})^{\perp}.\) Since \((\nabla\pi_{*})\) is symmetric, it follows that \(S_{V}\) is a symmetric linear transformation of \(range\pi_{*}\). Let \(\pi:(P,g_{P})\rightarrow(Q,g_{Q})\) be a smooth map between manifolds \((P,g_{P})\) and \((Q,g_{Q})\). The second fundamental form of \(\pi\) is the map [15] \[\nabla\pi_{*}:\Gamma(TP)\times\Gamma(TP)\rightarrow\Gamma_{\pi}(TQ)\] defined by \[(\nabla\pi_{*})(X,Y)=\nabla_{X}^{Q_{\pi}}\pi_{*}Y-\pi_{*}(\nabla_{X}^{P}Y), \tag{2.4}\] where \(\nabla^{P}\) is a linear connection on \(P\). For any \(X,Y\in\Gamma(ker\pi_{*})^{\perp}\), Sahin[19] showed that the second fundamental form \((\nabla\pi_{*})(X,Y)\) of a Riemannian map has no components in \(range\pi_{*}\). It means \[(\nabla\pi_{*})(X,Y)\in\Gamma(range\pi_{*})^{\perp}. \tag{2.5}\] Trace of second fundamental form \(\pi\) is called tension field [4]. It is denoted by \(\tau(\pi)\) and defined as \(\tau(\pi)=trace(\nabla\pi_{*})=\sum_{i=1}^{m}(\nabla\pi_{*})(e_{i},e_{i}).\) A map \(\pi\) is called a harmonic map [4] if it has a vanishing tension field, i.e., \(\tau(\pi)=0.\) The adjoint map *\(\pi_{*r}\) at \(r\in P\) of the map \(\pi\) is defined by \[g_{Q}(\pi_{*p}(X),W)=g_{P}(X,*\pi_{*r}(W)) \tag{2.6}\] for \(X\in T_{r}P\) and \(W\in T_{\pi(r)}Q\), where \(\pi_{*r}\) is the derivative of \(\pi\) at \(r\in P\). **Lemma 2.1**.: _[_20_]_ _Let \(\pi:(P,g_{P})\rightarrow(Q,g_{Q})\) be a Riemannian map between Riemannian manifolds. Then \(\pi\) is umbilical Riemannian map if and only if \((\nabla\pi_{*})(X,Y)=g_{P}(X,Y)H\) for all \(X,Y\in\Gamma(ker\pi_{*})^{\perp}\) and \(H\) is, nowhere zero, mean curvature vector field on \((range\pi_{*})^{\perp}\)._ Let \((P,g_{P})\) be an almost Hermitian manifold [31], then \(P\) admits a tensor \(J^{\prime}\) of type (1,1) such that \(J^{\prime 2}=-I\) and \[g_{P}(J^{\prime}X,J^{\prime}Y)=g_{P}(X,Y) \tag{2.7}\] for all \(X,Y\in\Gamma(TP).\) An almost Hermitian manifold \(P\) is called Kahler manifold if \[(\nabla_{X}J^{\prime})Y=0, \tag{2.8}\] for all \(X,Y\in\Gamma(TP)\), where \(\nabla\) is Levi-Civita connection on \(P\). **Definition 2.1**.: _[_21_]_ _Let \(\pi\) be a Riemannian map from a Riemannian manifold \((P,g_{P})\) to an almost Hermitian manifold \((Q,g_{Q},J^{\prime})\). If for any non-zero vector \(X\in\Gamma(ker\pi_{*})^{\perp}\), the angle \(\theta(X)\) between \(J^{\prime}\pi_{*}(X)\) and the space \(range\pi_{*}\) is a constant, i.e., it is independent of the choice of the point \(r\in P\) and choice of the tangent vector \(\pi_{*}(X)\) in \(range\pi_{*}\), then we say that \(\pi\) is a slant Riemannian map. In this case, the angle \(\theta\) is called the slant angle of the slant Riemannian map._ Let \(\pi\) be a Riemannian map from a Riemannian manifold \((P,g_{P})\) to an almost Hermitian manifold \((Q,g_{Q},J^{\prime})\). Then for \(\pi_{*}Y\in\Gamma(range\pi_{*}),Y\in\Gamma(ker\pi_{*})^{\perp}\), we have \[J^{\prime}\pi_{*}Y=\alpha\pi_{*}Y+\delta\pi_{*}Y, \tag{2.9}\] where \(\alpha\pi_{*}Y\in\Gamma(range\pi_{*})\) and \(\delta\pi_{*}Y\in\Gamma(range\pi_{*})^{\perp}\). Also for \(U\in\Gamma(range\pi_{*})^{\perp}\), we have \[J^{\prime}U=BU+CU, \tag{2.10}\] where \(BU\in\Gamma(range\pi_{*})\) and \(CU\in\Gamma(range\pi_{*})^{\perp}\). The idea of Clairaut Riemannian map is based on geodesic of surface of revolution. Sahin [24] defined Clairaut Riemannian map by using geodesics on total manifolds. A Riemannian map \(\pi:P\to Q\) between Riemannian manifolds \((P,g_{P})\) and \((Q,g_{Q})\) is called a Clairaut Riemannian map if there is a function \(s:P\to R^{+}\) such that for every geodesic, making angles \(\theta\) with the horizontal subspaces, \(ssin\theta\) is constant. Similarly, Clairaut Riemannian map has been defined by using geodesic on base manifold as follows. **Definition 2.2**.: _[_13_]_ _A Riemannian map \(\pi:(P,g_{P})\rightarrow(Q,g_{Q})\) between Riemannian manifolds is called Clairaut Riemannian map if there is a function \(s:Q\to R^{+}\) such that for every geodesic \(\eta\) on \(Q\), the function \((son)sin\omega(t)\) is constant, where \(\pi_{*}X\in\Gamma(range\pi_{*})\) and \(U\in\Gamma(range\pi_{*})^{\perp}\) are the vertical and horizontal components of \(\dot{\eta}(t)\), and \(\omega(t)\) is the angle between \(\dot{\eta}(t)\) and \(U\) for all t._ **Theorem 2.1**.: _[_13_]_ _Let \(\pi:(P,g_{P})\rightarrow(Q,g_{Q})\) be a Riemannian map between Riemannian manifolds such that \((range\pi_{*})^{\perp}\) is totally geodesic and \(range\pi_{*}\) is connected, and let \(\beta,\eta=\pi\alpha\beta\) be geodesics on \(P\) and \(Q,\) respectively.Then \(\pi\) is Clairaut Riemannian map with \(s=e^{f}\) if and only if any one of the following conditions holds:_ 1. \(S_{V}\pi_{*}X=-V(f)\pi_{*}X,\)__where \(\pi_{*}X\in\Gamma(range\pi_{*})\) and \(V\in\Gamma(range\pi_{*})^{\perp}\) are components of \(\dot{\eta}(t).\)__ 2. \(\pi\) is umbilical map, and has \(H=-\nabla^{Q}f\), where \(g\) is a smooth function on \(Q\) and \(H\) is the mean curvature vector field of \(range\pi_{*}.\)__ **Theorem 2.2**.: _[_21_]_ _Let \(\pi\) be a Riemannian map from a Riemannian manifold \((P,g_{P})\) to an almost Hermitian manifold \((Q,g_{Q},J^{\prime})\). Then \(\pi\) is a slant Riemannian map if and only if there exists a constant \(\lambda\in[-1,0]\) such that \(\alpha^{2}\pi_{*}(X)=-\lambda\pi_{*}(X)\) for \(X\in\Gamma((ker\pi_{*})^{\perp}).\) If \(\pi\) is a slant Riemannian map, then \(\lambda=-cos^{2}\theta\)._ ## 3 Clairaut slant Riemannian maps to Kahler manifolds In this section, we introduce the notion of Clairaut slant Riemannian map from a Riemannian manifold to a Kahler manifold. We investigate some characteristics of this map. **Definition 3.1**.: _A slant Riemannian map from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q})\) is called a Clairaut slant Riemannian map if it satisfies the definition 2.2._ Next, onward, we will consider the map \(\pi\) in which \((range\pi_{*})^{\perp}\) is totally geodesic. **Theorem 3.1**.: _Let \(\pi\) be a slant Riemannian map from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\). If \(\beta\) is a geodesic on \((P,g_{P})\), then the curve \(\eta=\pi\circ\beta\) is geodesic on \(Q\) if and only if_ \[\begin{split}& cos^{2}\theta\pi_{*}(\nabla_{X}^{P}X)+S_{\delta( \alpha\pi_{*}X)}\pi_{*}X-\pi_{*}(\nabla_{X}^{P}*\pi_{*}B(\delta\pi_{*}X))+S_{ C(\delta\pi_{*}X)}\pi_{*}X\\ &+cos^{2}\theta\nabla_{U}^{Q}\pi_{*}X-\nabla_{U}^{P}B(\delta\pi_ {*}X)-B(\nabla\pi_{*})(X,\pi_{*}BU)-\alpha(\nabla_{X}^{P}*\pi_{*}BU)\\ &+\alpha(S_{CU}\pi_{*}X)-B(\nabla_{X}^{\pi\perp}CU)-\alpha(\nabla _{U}^{\pi}BU)-B(\nabla_{U}^{\pi\perp}CU)=0\end{split} \tag{3.1}\] _and_ \[\begin{split}& cos^{2}\theta(\nabla\pi_{*})(X,X)-\nabla_{X}^{\pi \perp}\delta(\alpha\pi_{*}X)-(\nabla\pi_{*})(X,*\pi_{*}B(\delta\pi_{*}X))\\ &-\nabla_{X}^{\pi\perp}C(\delta\pi_{*}X)-\nabla_{U}^{\pi\perp} \delta(\pi_{*}X)-\nabla_{U}^{\pi\perp}C(\delta\pi_{*}X)-C(\nabla\pi_{*})(X,* \pi_{*}BU)\\ &+\delta(\nabla_{X}^{P}*\pi_{*}BU)-\delta\nabla_{U}^{Q}BU-C\nabla _{U}^{\pi\perp}CU-C\nabla_{X}^{\pi\perp}CU+\delta(S_{CU}\pi_{*}X)=0,\end{split} \tag{3.2}\] _where \(\pi_{*}X,U\) are the vertical and horizontal part of \(\dot{\eta}\) repectively,and \(\nabla^{Q}\) is the Levi-Civita connection on \(Q\) and \(\nabla^{\pi\perp}\) is a linear connection on \((range\pi_{*})^{\perp}\)._ Proof.: Let \(\beta\) is a geodesic on \(P\) and let \(\eta=\pi\circ\beta\) is a regular curve on \(Q\). Suppose \(\pi_{*}X,\)\(U\) are the vertical and horizontal components respectively, of \(\dot{\eta}(t)\). Since \(Q\) is Kahler manifold, we can write \[\nabla_{\dot{\eta}}^{Q}\dot{\eta}=-J^{\prime}\nabla_{\dot{\eta}}^{Q}J^{\prime} \dot{\eta}\] which implies \[\nabla^{Q}_{\dot{\eta}}\dot{\eta} = -J^{\prime}\nabla^{Q}_{\pi_{*}X+U}J^{\prime}(\pi_{*}X+U),\] \[= -J^{\prime}\nabla^{Q}_{\pi_{*}X}J^{\prime}\pi_{*}X-J^{\prime} \nabla^{Q}_{U}J^{\prime}\pi_{*}X-J^{\prime}\nabla^{Q}_{\pi_{*}X}J^{\prime}U-J^ {\prime}\nabla^{Q}_{U}J^{\prime}U.\] Making use of (2.8), (2.9) and (2.10) in above equation, we get \[\nabla^{Q}_{\dot{\eta}}\dot{\eta} =-\nabla^{Q}_{\pi_{*}X}\alpha^{2}\pi_{*}X-\nabla^{Q}_{\pi_{*}X} \delta(\alpha\pi_{*}X)-\nabla^{Q}_{\pi_{*}X}B(\delta\pi_{*}X)-\nabla^{Q}_{\pi_ {*}X}C(\delta\pi_{*}X)\] \[-\nabla^{Q}_{U}\alpha^{2}\pi_{*}X-\nabla^{Q}_{U}\delta(\alpha\pi _{*}X)-\nabla^{Q}_{U}B(\delta\pi_{*}X)-\nabla^{Q}_{U}C(\delta\pi_{*}X) \tag{3.3}\] \[-J^{\prime}\nabla^{Q}_{\pi_{*}X}BU-J^{\prime}\nabla^{Q}_{\pi_{*} X}CU-J^{\prime}\nabla^{Q}_{U}BU-J^{\prime}\nabla^{Q}_{U}CU.\] From (2.3) and (2.4), we get \[\nabla^{Q}_{\pi_{*}X}\pi_{*}X=(\nabla\pi_{*})(X,X)+\pi_{*}(\nabla^{P}_{X}X),\] \[\nabla^{Q}_{\pi_{*}X}\delta(\alpha\pi_{*}X)=-S_{\delta(\alpha\pi_{*}X)}\pi_{*} X+\nabla^{\perp}_{X}\delta(\alpha\pi_{*}X),\] \[\nabla^{Q}_{\pi_{*}X}B(\delta\pi_{*}X)=(\nabla\pi_{*})(X,*_{\pi_{*}}B(\delta \pi_{*}X))+\pi_{*}(\nabla_{X}*_{\pi_{*}}B(\delta\pi_{*}X)),\] \[\nabla^{Q}_{\pi_{*}X}C(\delta\pi_{*}X)=-S_{C(\delta\pi_{*}X)}\pi_{*}X+\nabla^{ \perp}_{X}C(\delta\pi_{*}X),\] \[\nabla^{Q}_{\pi_{*}X}CU=-S_{CU}\pi_{*}X+\nabla^{\pm}_{X}CU,\] \[\nabla^{Q}_{\pi_{*}X}BU=(\nabla\pi_{*})(X,*_{\pi_{*}}BU)+\pi_{*}(\nabla^{P}_{ X}*_{\pi_{*}}BU).\] Since \((range\pi_{*})^{\perp}\) is totally geodesic, \[\nabla^{Q}_{U}\delta(\alpha\pi_{*}X) =\nabla^{\perp}_{U}\delta(\alpha\pi_{*}X),\] \[\nabla^{Q}_{U}C(\delta\pi_{*}X) =\nabla^{Q\perp}_{U}C(\delta\pi_{*}X),\] \[\nabla^{Q}_{U}CU =\nabla^{\perp}_{U}CU.\] By metric compatibility, we have \[\nabla^{Q}_{U}B(\delta\pi_{*}X)\in\Gamma(range\pi_{*}),\] \[\nabla^{Q}_{U}BU\in\Gamma(range\pi_{*}),\] \[\nabla^{Q}_{U}\pi_{*}X\in\Gamma(range\pi_{*}).\] Making use of above terms in (3.3), we obtain \[\nabla^{Q}_{\dot{\eta}}\dot{\eta} =cos^{2}\theta(\nabla\pi_{*})(X,X)+cos^{2}\theta\pi_{*}(\nabla^{ P}_{X}X)+S_{\delta(\alpha\pi_{*}X)}\pi_{*}X \tag{3.4}\] \[-\nabla^{\pi\perp}_{X}\delta(\alpha\pi_{*}X)+cos^{2}\theta\nabla^ {Q}_{U}\pi_{*}X-\nabla^{\pi\perp}_{U}\delta(\alpha\pi_{*}X)\] \[-(\nabla\pi_{*})(X,*_{\pi_{*}}B(\delta\pi_{*}X))-\pi_{*}(\nabla^{ P}_{X}*_{\pi_{*}}B(\delta\pi_{*}X))+S_{C(\delta\pi_{*}X)}\pi_{*}X\] \[-\nabla^{\pi\perp}_{X}C(\delta\pi_{*}X)-\nabla^{Q}_{U}B(\delta\pi _{*}X)-\nabla^{\pi\perp}_{U}C(\delta\pi_{*}X)-B(\nabla\pi_{*})(X,*_{\pi_{*}}BU)\] \[-C(\nabla\pi_{*})(X,*_{\pi_{*}}BU)-\alpha\pi_{*}(\nabla^{P}_{X}*_ {\pi_{*}}BU)-\delta\pi_{*}(\nabla^{P}_{X}*_{\pi_{*}}BU)\] \[+\alpha(S_{CU}\pi_{*}X)+\delta(S_{CU}\pi_{*}X)-B(\nabla^{\pi\perp }_{X}CU)-C(\nabla^{\pi\perp}_{X}CU)\] \[-\alpha(\nabla^{Q}_{U}BU)-\delta(\nabla^{Q}_{U}BU)-B(\nabla^{Q}_{ U}BU)-C(\nabla^{\pi\perp}_{U}CU).\] Since \(\eta\) is geodesic on \(Q\) if and only if \(\nabla^{Q}_{\eta}\dot{\eta}=0\), this implies \[\begin{split}& cos^{2}\theta(\nabla\pi_{*})(X,X)+cos^{2}\theta\pi_{*}( \nabla^{P}_{X}X)+S_{\delta(\alpha\pi_{*}X)}\pi_{*}X-\nabla^{\pi\perp}_{X} \delta(\alpha\pi_{*}X)\\ &+cos^{2}\theta\nabla^{Q}_{U}\pi_{*}X-\nabla^{\mp\perp}_{U} \delta(\alpha\pi_{*}X)-(\nabla\pi_{*})(X,\pi_{*}B(\delta\pi_{*}X))\\ &-\pi_{*}(\nabla^{P}_{X}*_{\pi_{*}}B(\delta\pi_{*}X))+S_{C(\delta \pi_{*}X)}\pi_{*}X-\nabla^{\mp\perp}_{X}C(\delta\pi_{*}X)\\ &-\nabla^{Q}_{U}B(\delta\pi_{*}X)-\nabla^{\mp}_{U}C(\delta\pi_{* }X)-B(\nabla\pi_{*})(X,\pi_{*}BU)\\ &-C(\nabla\pi_{*})(X,*_{\pi_{*}}BU)-\alpha\pi_{*}(\nabla^{P}_{X} *_{\pi_{*}}BU)-\delta\pi_{*}(\nabla^{P}_{X}*_{\pi_{*}}BU)\\ &+\alpha(S_{CU}\pi_{*}X)+\delta(S_{CU}\pi_{*}X)-B(\nabla^{\mp \perp}_{X}CU)-C(\nabla^{\mp\perp}_{U}CU)\\ &-\alpha(\nabla^{Q}_{U}BU)-\delta(\nabla^{Q}_{U}BU)-B(\nabla^{ \perp}_{U}CU)-C(\nabla^{\mp\perp}_{U}CU)=0.\end{split} \tag{3.5}\] Taking vertical and horizontal part, we get (3.1) and (3.2). **Theorem 3.2**.: _Let \(\pi\) be a slant Riemannian map with connected fibers from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\). Then \(\pi\) is a Clairaut slant Riemannian map with \(s=e^{f}\) if and only if_ \[\begin{split}& B(\nabla\pi_{*})(X,*_{\pi_{*}}BU)+\alpha(\nabla^{P}_ {X}*_{\pi_{*}}BU)-\alpha(S_{CU}\pi_{*}X)+B(\nabla^{\pi\perp}_{X}CU)\\ &+\alpha(\nabla^{Q}_{U}BU)+B(\nabla^{\mp}_{U}CU)=\pi_{*}YU(f), \end{split} \tag{3.6}\] _where \(\pi_{*}X,U\) are the vertical and horizontal part of tangent vector field \(\dot{\eta}\) on \(Q\)._ Proof.: Let \(\eta\) be a geodesic on \(Q\) with constant speed \(k\) i.e., k = \(||\dot{\eta}||^{2}\). Let vertical and horizontal part of \(\dot{\eta}\) are \(\pi_{*}X,U,\) respectively. Then, we get \[g_{Q}(\pi_{*}X,\pi_{*}X)=ksin^{2}\omega(t) \tag{3.7}\] and \[g_{Q}(U,U)=kcos^{2}\omega(t), \tag{3.8}\] where \(\omega(t)\) is the angle between \(\dot{\eta}(t)\) and the horizontal space at \(\eta(t)\). Differentiating (3.7), we get \[\frac{d}{dt}g_{Q}(\pi_{*}X,\pi_{*}X)=2ksin\omega(t)cos\omega(t)\frac{d\omega}{ dt}\] which implies \[g_{Q}(\nabla_{\dot{\eta}}\pi_{*}X,\pi_{*}X)=ksin\omega(t)cos\omega(t)\frac{d \omega}{dt}.\] Since \[g_{Q}(\nabla_{\dot{\eta}}\pi_{*}X,\pi_{*}X)=g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{* }X+\nabla^{Q}_{U}\pi_{*}X,\pi_{*}X). \tag{3.9}\] Using (2.7) and (2.9) in above equation, we have \[\begin{split} g_{Q}(\nabla_{\dot{\eta}}\pi_{*}(X),\pi_{*}X)=& -g_{Q}(\nabla^{Q}_{\pi_{*}X}\alpha^{2}\pi_{*}X+\nabla^{Q}_{\pi_{*}X }\delta(\alpha\pi_{*}X)\\ &+\nabla^{Q}_{\pi_{*}X}B(\delta\pi_{*}X)+\nabla^{Q}_{\pi_{*}X}C( \delta\pi_{*}X)+\nabla^{Q}_{U}\alpha^{2}\pi_{*}X\\ &+\nabla^{Q}_{U}\delta(\alpha\pi_{*}X)+\nabla^{Q}_{U}B(\delta\pi_ {*}X)+\nabla^{Q}_{U}C(\delta\pi_{*}X),\pi_{*}X).\end{split} \tag{3.10}\] Making use of (2.3), (2.4) and Theorem 2.2 in (3.10), we obtain \[\begin{split} g_{Q}(\nabla_{\dot{\eta}}\pi_{*}(X),\pi_{*}X)=& g_{Q}(cos^{2}\theta\pi_{*}(\nabla_{X}^{P}X)+S_{\delta(\alpha\pi_{*}X)} \pi_{*}X\\ &-\pi_{*}(\nabla_{X}^{P}*_{\pi_{*}}B(\delta\pi_{*}X))+S_{C(\delta \pi_{*}X)}\pi_{*}X\\ &+cos^{2}\theta\nabla_{U}^{Q}\pi_{*}X-\nabla_{U}^{Q}B(\delta\pi_ {*}X),\pi_{*}X)\\ &=ksin\omega(t)cos\omega(t)\frac{d\omega}{dt}.\end{split} \tag{3.11}\] From (3.1), we get \[\begin{split}& g_{Q}(B(\nabla\pi_{*})(X,*_{\pi_{*}}BU)+\alpha( \nabla_{X}^{P}*_{\pi_{*}}BU)-\alpha(S_{CU}\pi_{*}X)+B(\nabla_{X}^{\pi\perp}CU) \\ &+\alpha(\nabla_{U}^{Q}BU)+B(\nabla_{U}^{\pi\perp}CU),\pi_{*}X)= ksin\omega(t)cos\omega(t)\frac{d\omega}{dt}.\end{split} \tag{3.12}\] Since \(\pi\) is a Clairaut Riemannian map with \(s=e^{f}\) if and only if \(\frac{d}{dt}(e^{f\sigma}sin\omega(t))=0\). Therefore, \[e^{f\sigma\eta}\frac{d}{dt}(f\sigma)sin\omega(t)+cos\omega(t)e^{f\sigma\eta} \frac{d\omega}{dt}=0, \tag{3.13}\] multiplying above equation with \(ksin\omega(t)\), we get \[e^{f\sigma\eta}(ksin^{2}\omega(t)\frac{d}{dt}f\sigma+ksin\omega(t)cos\omega(t )\frac{d\omega}{dt})=0.\] Since \(e^{f\sigma\eta}\) is a positive function, \[g_{Q}(\pi_{*}X,\pi_{*}Y)g_{Q}(gradf,\dot{\eta})=-ksin\omega(t)cos\omega(t) \frac{d\omega}{dt}.\] From 3.12, we get \[\begin{split}& g_{Q}(B(\nabla\pi_{*})(X,*_{\pi_{*}}BU)+\alpha( \nabla_{X}^{P}*_{\pi_{*}}BU)-\alpha(S_{CU}\pi_{*}X)+B(\nabla_{X}^{\pi\perp}CU) \\ &+\alpha(\nabla_{U}^{Q}BU)+B(\nabla_{U}^{\pi\perp}CU),\pi_{*}X) =-g_{Q}(\pi_{*}X,\pi_{*}Y)g_{Q}(gradf,\dot{\eta}).\end{split} \tag{3.14}\] This completes the proof. **Theorem 3.3**.: _Let \(\pi\) be a Clairaut slant Riemannian map from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\) with \(s=e^{f}\) such that \(\delta\) is parallel. Then \(f\) is constant on \(\delta(range\pi_{*})\)._ Proof.: Since \(\pi\) is Clairaut Riemannian map with \(s=e^{f}\), from (2.4), Lemma 2.1 and Theorem 2.1, we get \[\nabla_{X}^{Q_{*}}\pi_{*}Y-\pi_{*}(\nabla_{X}^{P}Y)=-g_{P}(X,Y)\nabla^{Q}f\ forX,Y\in\Gamma(ker\pi_{*})^{\perp}. \tag{3.15}\] Taking inner product of (3.15) with \(\delta\pi_{*}Z\), we get \[g_{Q}(\nabla_{X}^{Q_{*}}\pi_{*}Y-\pi_{*}(\nabla_{X}Y),\delta\pi_{*}Z)=-g_{P}(X, Y)g_{Q}(\nabla^{Q}f,\delta\pi_{*}Z).\] Thus, \[g_{Q}(\nabla^{Q_{\pi}}_{X}\pi_{*}Y,\delta\pi_{*}Z)=-g_{P}(X,Y)g_{Q}(\nabla^{Q}f, \delta\pi_{*}Z). \tag{3.16}\] Since \(\nabla^{Q}\) is the Levi-Civita connection of \(Q\) and \(\nabla^{Q_{\pi}}\) is the pullback connection of \(\nabla^{Q}\), therefore \(\nabla^{Q_{\pi}}\) is also Levi-Civita connection on \(Q\). Then using metric compatibility condition, we get \[-g_{Q}(\nabla^{Q_{\pi}}_{X}\delta\pi_{*}Z,\pi_{*}Y)=-g_{P}(X,Y)g_{Q}(\nabla^{Q }f,\delta\pi_{*}Z). \tag{3.17}\] Since \(\delta\) is parallel, \[g_{Q}(\delta\nabla^{Q_{\pi}}_{X}\pi_{*}Z,\pi_{*}Y)=g_{P}(X,Y)g_{Q}(\nabla^{Q} f,\delta\pi_{*}Z). \tag{3.18}\] It gives \[g_{P}(X,Y)g_{Q}(\nabla^{Q}f,\delta\pi_{*}Z)=0,\] which implies that \(\delta\pi_{*}Z(f)=0.\) This completes the proof. **Theorem 3.4**.: _Let \(\pi:(P,g_{P})\to(Q,g_{Q},J^{\prime})\) be a Clairaut slant Riemannian map with \(s=e^{f}\) from a Riemannian manifold \(P\) to a Kahler manifold \(Q\). Then \(\pi\) is totally geodesic if and only if the following conditions are satisfied:_ 1. \(ker\pi_{*}\) _is totally geodesic,_ 2. \((ker\pi_{*})^{\perp}\) _is totally geodesic,_ 3. \(cos^{2}\theta\pi_{*}(\nabla^{P}_{X}Y)-\nabla^{\pi\perp}_{X}\delta(\alpha\pi_{ *}Y)-B\nabla^{\pi\perp}_{X}\delta\pi_{*}Y-C\nabla^{\pi\perp}_{X}\delta\pi_{*} Y-\pi_{*}(\nabla^{P}_{X}Y)=0.\)__ Proof.: We know that \(\pi\) is totally geodesic if and only if \[(\nabla\pi_{*})(U,V) =0, \tag{3.19}\] \[(\nabla\pi_{*})(X,U) =0,\] (3.20) \[(\nabla\pi_{*})(X,Y) =0, \tag{3.21}\] for \(U,V\in\Gamma(ker\pi_{*})\) and \(X,Y\in\Gamma(ker\pi_{*})^{\perp}\). From (3.19) and (3.20), we get that fibers are totally geodesic, \((ker\pi_{*})^{\perp}\) is totally geodesic, respectively. From (3.21), we have \[(\nabla\pi_{*})(X,Y)=\nabla^{Q_{\pi}}_{X}\pi_{*}Y-\pi_{*}(\nabla^{P}_{X}Y). \tag{3.22}\] Using (2.8) and (2.9), we have \[(\nabla\pi_{*})(X,Y)=-J^{\prime}\nabla^{Q_{\pi}}_{X}(\alpha\pi_{*}Y)-J^{ \prime}\nabla^{Q_{\pi}}_{X}(\delta\pi_{*}Y)-\pi_{*}(\nabla^{P}_{X}Y).\] Making use of (2.8) and Theorem (2.2), we get \[(\nabla\pi_{*})(X,Y)=cos^{2}\theta\nabla^{Q_{\pi}}_{X}\pi_{*}Y-\nabla^{Q_{\pi }}_{X}\delta(\alpha\pi_{*}Y)-J^{\prime}\nabla^{Q_{\pi}}_{X}\delta\pi_{*}Y-\pi _{*}(\nabla^{P}_{X}Y).\] Applying (2.2) and (2.4) in above equation, we have \[\begin{split}(1-cos^{2}\theta)(\nabla\pi_{*})(X,Y)& =cos^{2}\theta\pi_{*}(\nabla^{P}_{X}Y)+S_{\delta(\alpha\pi_{*}Y) }\pi_{*}X-\nabla^{\pi\perp}_{X}\delta(\alpha\pi_{*}Y)\\ &+J^{\prime}(S_{\delta\pi_{*}Y}\pi_{*}X)-J^{\prime}\nabla^{\pi \perp}_{X}\delta\pi_{*}Y-\pi_{*}(\nabla^{P}_{X}Y).\end{split} \tag{3.23}\] Using (3.21), we get \[\begin{split}& cos^{2}\theta\pi_{*}(\nabla^{P}_{X}Y)+S_{\delta( \alpha\pi_{*}Y)}\pi_{*}X-\nabla^{\pi\perp}_{X}\delta(\alpha\pi_{*}Y)+J^{\prime }(S_{\delta\pi_{*}Y}\pi_{*}X)-J^{\prime}\nabla^{\pi\perp}_{X}\delta\pi_{*}Y\\ &-\pi_{*}(\nabla^{P}_{X}Y)=0.\end{split} \tag{3.24}\] From above equation and Theorem 2.1, we get \[\begin{split}& cos^{2}\theta\pi_{*}(\nabla^{P}_{X}Y)-\delta( \alpha\pi_{*}Y)(f)\pi_{*}X-\nabla^{\pi\perp}_{X}\delta(\alpha\pi_{*}Y)\\ &-J^{\prime}\delta\pi_{*}Y(f)\pi_{*}X-B\nabla^{\pi\perp}_{X} \delta\pi_{*}Y-C\nabla^{\pi\perp}_{X}\delta\pi_{*}Y-\pi_{*}(\nabla^{P}_{X}Y)= 0.\end{split} \tag{3.25}\] From Theorem (3.3) and (3.25), we get the required result. **Theorem 3.5**.: _Let \(\pi\) be a Clairaut slant Riemannian map from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\) with \(s=e^{f}\) such that \(\delta\) is parallel. Then \(Q\) is a locally product manifold of \(Q_{(range\pi_{*})}\times Q_{(range\pi_{*})^{\perp}}\) if and only if_ \[g_{Q}(\nabla^{\pi\perp}_{\pi_{*}X}\delta(\alpha\pi_{*}Y)+B\nabla^{\pi\perp}_{ \pi_{*}X}\delta\pi_{*}Y+C\nabla^{\pi\perp}_{\pi_{*}X}\delta\pi_{*}Y,U)=0 \tag{3.26}\] _for \(\pi_{*}X,\pi_{*}Y\in\Gamma(range\pi_{*})\) and \(U\in\Gamma(range\pi_{*})^{\perp}\)._ Proof.: Since \(Q\) is Kahler manifold, we have \[g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{*}Y,U)=g_{Q}(\nabla^{Q}_{\pi_{*}X}J^{\prime} \pi_{*}Y,J^{\prime}U) \tag{3.27}\] for \(\pi_{*}X,\pi_{*}Y\in\Gamma(range\pi_{*})\) and \(U\in\Gamma(range\pi_{*})^{\perp}\). Using (2.9) in (3.27), we get \[g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{*}Y,U)=-g_{Q}(\nabla^{Q}_{\pi_{*}X}\alpha^{2} \pi_{*}Y+\delta(\alpha\pi_{*}Y)+J^{\prime}\nabla^{Q}_{\pi_{*}X}\delta\pi_{*}Y,U). \tag{3.28}\] Using Theorem 2.2 and (2.3), we have \[\begin{split} g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{*}Y,U)=& cos^{2}\theta g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{*}Y,U)-g_{Q}(-S_{\delta( \alpha\pi_{*}Y)}\pi_{*}X\\ &+\nabla^{\pi\perp}_{\pi_{*}X}\delta(\alpha\pi_{*}Y)+J^{\prime}( -S_{\delta\pi_{*}Y}\pi_{*}X+\nabla^{\pi\perp}_{X}\delta\pi_{*}Y),U).\end{split} \tag{3.29}\] Using Theorem 2.1, we obtain \[\begin{split} sin^{2}\theta g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{*}Y,U )=&-g_{Q}(\delta(\alpha\pi_{*}Y)(f)\pi_{*}X+\nabla^{\pi\perp}_{ \pi_{*}X}\delta(\alpha\pi_{*}Y)\\ &+J^{\prime}(\delta\pi_{*}Y(f)\pi_{*}X+\nabla^{\pi\perp}_{X} \delta\pi_{*}Y),U).\end{split} \tag{3.30}\] From Theorem (3.3), we get the required result. **Theorem 3.6**.: _Let \(\pi\) be a Clairaut slant Riemannian map from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\) with \(s=e^{f}\). Then, \(range\pi_{*}\) is integrable if and only if_ \[\begin{split}& g_{Q}(\nabla^{\pi\perp}_{Y}\delta(\alpha\pi_{*}X)-g_ {P}(Y,*_{\pi_{*}}B(\delta\pi_{*}X))\nabla^{Q}f+\nabla^{\pi\perp}_{Y}C(\delta \pi_{*}X),U)\\ =& g_{Q}(\nabla^{\pi\perp}_{X}\delta(\alpha\pi_{*}Y)+ \nabla^{\pi\perp}_{X}C(\delta\pi_{*}Y)-g_{P}(X,*_{\pi_{*}}B(\delta\pi_{*}Y)) \nabla^{Q}f,U),\end{split} \tag{3.31}\] _where \(\pi_{*}X,\pi_{*}Y\in\Gamma(range\pi_{*})\) and \(U\in\Gamma(range\pi_{*})^{\perp}\)._ Proof.: For \(\pi_{*}X,\pi_{*}Y\in\Gamma(range\pi_{*})\) and \(U\in\Gamma(range\pi_{*})^{\perp}\), we have \[g_{Q}([\pi_{*}X,\pi_{*}Y],U)=g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{*}Y,U)-g_{Q}(\nabla^ {Q}_{\pi_{*}Y}\pi_{*}X,U). \tag{3.32}\] Making use of (2.7), (2.9) and (2.10), we have \[\begin{split} g_{Q}([\pi_{*}X,\pi_{*}Y],U)=&-g_{Q} (\nabla^{Q}_{\pi_{*}X}\alpha^{2}\pi_{*}Y+\nabla^{Q}_{\pi_{*}X}\delta(\alpha\pi_ {*}Y)+\nabla^{Q}_{\pi_{*}X}B(\delta\pi_{*}Y)\\ &+\nabla^{Q}_{\pi_{*}X}C(\delta\pi_{*}Y),U)+g_{Q}(\nabla^{Q}_{ \pi_{*}Y}\alpha^{2}\pi_{*}X\\ &+\nabla^{Q}_{\pi_{*}Y}\delta(\alpha\pi_{*}X)+\nabla^{Q}_{\pi_{ *}Y}B(\delta\pi_{*}X)+\nabla^{Q}_{\pi_{*}Y}C(\delta\pi_{*}X),U).\end{split} \tag{3.33}\] Using Theorem 2.2, we have \[\begin{split} g_{Q}([\pi_{*}X,\pi_{*}Y],U)=&-g_{Q} (-cos^{2}\theta\nabla^{Q}_{\pi_{*}X}\pi_{*}Y+\nabla^{Q}_{\pi_{*}X}\delta( \alpha\pi_{*}Y)\\ &+\nabla^{Q}_{\pi_{*}X}B(\delta\pi_{*}Y)+\nabla^{Q}_{\pi_{*}X}C( \delta\pi_{*}Y),U)\\ &+g_{Q}(-cos^{2}\theta\nabla^{Q}_{\pi_{*}Y}\pi_{*}X+\nabla^{Q}_{ \pi_{*}Y}\delta(\alpha\pi_{*}X)\\ &+\nabla^{Q}_{\pi_{*}Y}B(\delta\pi_{*}X)+\nabla^{Q}_{\pi_{*}Y}C( \delta\pi_{*}X),U).\end{split} \tag{3.34}\] Using (2.2) and (2.4), we get \[\begin{split}(1-cos^{2}\theta)g_{Q}(\nabla^{Q}_{\pi_{*}X}\pi_{*} Y-\nabla^{Q}_{\pi_{*}Y}\pi_{*}X,U)=&-g_{Q}(\nabla^{\pi\perp}_{X}\delta( \alpha\pi_{*}Y)\\ &+(\nabla\pi_{*})(X,*_{\pi_{*}}B(\delta\pi_{*}Y))\\ &+\nabla^{\pi\perp}_{X}C(\delta\pi_{*}Y),U)\\ &+g_{Q}(\nabla^{\pi\perp}_{Y}\delta(\alpha\pi_{*}X)\\ &+(\nabla\pi_{*})(Y,*_{\pi_{*}}B(\delta\pi_{*}X))\\ &+\nabla^{\pi\perp}_{Y}C(\delta\pi_{*}X),U).\end{split} \tag{3.35}\] Since \(\pi\) is Clairaut Riemannian map, by using Theorem 2.1, we get (3.31). This completes the proof. **Theorem 3.7**.: _[_13_]_ _Let \(\pi\) be a Clairaut Riemannian map with \(s=e^{f}\) between Riemannian manifolds \((P,g_{P})\) and \((Q,g_{Q},)\) such that \(ker\pi_{*}\) is minimal. Then, \(\pi\) is harmonic if and only if \(f\) is constant._ **Theorem 3.8**.: _Let \(\pi\) be Clairaut slant Riemannian map with \(s=e^{f}\) from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\) such that \(ker\pi_{*}\) is minimal. Then, \(\pi\) is harmonic if and only if_ \[\frac{\csc^{2}\theta}{q}trace\left\{-\nabla^{\pi\perp}_{X}\delta\alpha\pi_{*} X+\delta S_{\delta\pi_{*}X}\pi_{*}X-C\nabla^{\pi\perp}_{X}\delta\pi_{*}X\right\}=0,\] _where \(X\in\Gamma(ker\pi_{*})^{\perp}\)._ Proof.: Using 2.2 and the property \(J^{\prime 2}=-I\), we get \[(\nabla\pi_{*})(X,Y)=-J^{\prime}\nabla^{Q}_{X}J^{\prime}\pi_{*}Y-\pi_{*}( \nabla^{P}_{X}Y),\] for any \(X,Y\in\Gamma(ker\pi_{*})^{\perp}\). Using (2.9), (2.10), (2.2) and Theorem 2.2, we have \[(\nabla\pi_{*})(X,Y)=\cos^{2}\theta((\nabla\pi_{*})(X,Y)+\pi_{*}( \nabla_{X}^{P}Y))-\nabla_{X}^{Q_{*}}\delta\alpha\pi_{*}Y\\ +\alpha S_{\delta\pi_{*}Y}\pi_{*}X+\delta S_{\delta\pi_{*}Y}\pi_{ *}X-B\nabla_{X}^{\pi\perp}\delta\pi_{*}Y-C\nabla_{X}^{\pi\perp}\delta\pi_{*}Y -\pi_{*}(\nabla_{X}^{P}Y)\] which can be written as \[\sin^{2}\theta(\nabla\pi_{*})(X,Y)=-\sin^{2}\theta\pi_{*}(\nabla _{X}^{P}Y)+S_{\delta\alpha\pi_{*}Y}\pi_{*}X-\nabla_{X}^{\pi\perp}\delta\alpha \pi_{*}Y\\ +\alpha S_{\delta\pi_{*}Y}\pi_{*}X+\delta S_{\delta\pi_{*}Y}\pi_{ *}X-B\nabla_{X}^{\pi\perp}\delta\pi_{*}Y-C\nabla_{X}^{\pi\perp}\delta\pi_{*}Y. \tag{3.36}\] Taking \(X\) instead of \(Y\) in (3.36), we have \[\sin^{2}\theta(\nabla\pi_{*})(X,X)=-\sin^{2}\theta\pi_{*}(\nabla _{X}^{P}X)+S_{\delta\alpha\pi_{*}X}\pi_{*}X-\nabla_{X}^{\pi\perp}\delta\alpha \pi_{*}X\\ +\alpha S_{\delta\pi_{*}X}\pi_{*}X+\delta S_{\delta\pi_{*}X}\pi_{ *}X-B\nabla_{X}^{\pi\perp}\delta\pi_{*}X-C\nabla_{X}^{\pi\perp}\delta\pi_{*}X.\] Taking \(range\pi_{*}\) and \((range\pi_{*})^{\perp}\) components, we have \[(\nabla\pi_{*})(X,X)^{range\pi_{*}}=-\pi_{*}(\nabla_{X}^{P}X)+\csc^{2}\theta \left\{S_{\delta\alpha\pi_{*}X}\pi_{*}X+\alpha S_{\delta\pi_{*}X}\pi_{*}X-B \nabla_{X}^{\pi\perp}\delta\pi_{*}X\right\} \tag{3.37}\] and \[(\nabla\pi_{*})(X,X)^{(range\pi_{*})^{\perp}}=\csc^{2}\theta\left\{-\nabla_{ X}^{\pi\perp}\delta\alpha\pi_{*}X+\delta S_{\delta\pi_{*}X}\pi_{*}X-C\nabla_{X}^{ \pi\perp}\delta\pi_{*}X\right\}.\] We know that \(range\pi_{*}\) part of \((\nabla\pi_{*})(X,X)\) is equal to \(0\), i.e. \[\csc^{2}\theta(S_{\delta\alpha\pi_{*}X}\pi_{*}X+\alpha S_{\delta\pi_{*}X}\pi _{*}X-B\nabla_{X}^{\pi\perp}\delta\pi_{*}X)-\pi_{*}(\nabla_{X}^{P}X)=0.\] Therefore, \[(\nabla\pi_{*})(X,X)=\csc^{2}\theta\left\{-\nabla_{X}^{\pi\perp}\delta\alpha \pi_{*}X+\delta S_{\delta\pi_{*}X}\pi_{*}X-C\nabla_{X}^{\pi\perp}\delta\pi_{ *}X\right\}. \tag{3.38}\] Taking trace (3.38), we have \[\nabla^{Q}f=\frac{\csc^{2}\theta}{q}trace\left\{-\nabla_{X}^{\pi\perp}\delta \alpha\pi_{*}X+\delta S_{\delta\pi_{*}X}\pi_{*}X-C\nabla_{X}^{\pi\perp}\delta \pi_{*}X\right\}.\] Since \(\pi\) is a Clairaut slant Riemannian map with minimal fibers then proof follows by Theorem 3.7. Now, we obtain two inequalities in terms of \((\nabla\pi_{*})(X,Y)\) of Clairaut slant Riemannian map and check the equality case. **Theorem 3.9**.: _Let \(\pi\) be a Clairaut slant Riemannian map with \(s=e^{f}\) from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\). Then we have_ \[\sin^{4}\theta\left\|(\nabla\pi_{*})(X,Y)\right\|^{2} \geq \left\|S_{\delta\alpha\pi_{*}Y}\pi_{*}X\right\|^{2}+\left\|\nabla_ {X}^{\pi\perp}\delta\alpha\pi_{*}Y\right\|^{2}\] \[+\left\|B\nabla_{X}^{\pi\perp}\delta\pi_{*}Y\right\|^{2}+\left\|C \nabla_{X}^{\pi\perp}\delta\pi_{*}Y\right\|^{2}\] \[+2\left\{\begin{array}{c}-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X }^{P}Y),S_{\delta\alpha\pi_{*}Y}\pi_{*}X)-\sin^{2}\theta g_{Q}(\pi_{*}( \nabla_{X}^{P}Y),\alpha S_{\delta\pi_{*}Y}\pi_{*}X)\\ +\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y),B\nabla_{X}^{\pi\perp}\delta\pi_ {*}Y)+g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,\alpha S_{\delta\pi_{*}Y}\pi_{*}X )\\ -g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\pi\perp}\delta\pi_{*}Y)-g_ {Q}(\nabla_{X}^{\pi\perp}\delta\alpha\pi_{*}Y,S\delta\delta\pi_{*}Y\pi_{*}X)\\ +g_{Q}(\nabla_{X}^{\pi\perp}\delta\alpha\pi_{*}Y,C\nabla_{X}^{\pi\perp}\delta \pi_{*}Y)-g_{Q}(\alpha S_{\delta\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\pi\perp}\delta \pi_{*}Y)\\ -g_{Q}(\delta S_{\delta\pi_{*}Y}\pi_{*}X,C\nabla_{X}^{\pi\perp}\delta\pi_{*}Y) \end{array}\right\}\] _the inequality is satisfied if and only if \(\pi\) is a Clairaut slant Riemannian map. In the equality case, it takes the following form:_ \[\sin^{4}\theta\left\|(\nabla\pi_{*})(X,Y)\right\|^{2} = \left\|S_{\delta\alpha\pi_{*}Y}\pi_{*}X\right\|^{2}+\left\|\nabla _{X}^{\pm}\delta\alpha\pi_{*}Y\right\|^{2}+\left\|B\nabla_{X}^{\mp\perp} \delta\pi_{*}Y\right\|^{2}+\left\|C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y\right\|^ {2}\] \[+2\left\{\begin{array}{c}-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X }^{P}Y),S_{\delta\alpha\pi_{*}Y}\pi_{*}X)-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{ X}^{P}Y),\alpha S_{\delta\pi_{*}Y}\pi_{*}X)\\ +\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y),B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)+g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,\alpha S_{\delta\pi_{*}Y}\pi_ {*}X)\\ -g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta\pi_{*}Y)- g_{Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,\delta S_{\delta\pi_{*}Y}\pi_{*}X)\\ +g_{Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,C\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)-g_{Q}(\alpha S_{\delta\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)\\ -g_{Q}(\delta S_{\delta\pi_{*}Y}\pi_{*}X,C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y) \end{array}\right\}\] Proof.: By taking the product of (3.36) by itself, we obtain \[\sin^{4}\theta\left\|(\nabla\pi_{*})(X,Y)\right\|^{2} = \sin^{4}\theta\left\|\pi_{*}(\nabla_{X}^{P}Y)\right\|^{2}+\left\|S _{\delta\alpha\pi_{*}Y}\pi_{*}X\right\|^{2}+\left\|\nabla_{X}^{\mp\perp} \delta\alpha\pi_{*}Y\right\|^{2}\] \[+\left\|B\nabla_{X}^{\mp\perp}\delta\pi_{*}Y\right\|^{2}+\left\| C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y\right\|^{2}\] \[+2\left\{\begin{array}{c}-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{ X}^{P}Y),S_{\delta\alpha\pi_{*}Y}\pi_{*}X)-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{ X}^{P}Y),\alpha S_{\delta\pi_{*}Y}\pi_{*}X)\\ +\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y),B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)+g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,\alpha S_{\delta\pi_{*}Y}\pi_ {*}X)\\ -g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta\pi_{*}Y) -g_{Q}(\nabla_{X}^{\perp}\delta\alpha\pi_{*}Y,S_{\delta\pi_{*}Y}\pi_{*}X)\\ +g_{Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,C\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)-g_{Q}(\alpha S_{\delta\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)\\ -g_{Q}(\delta S_{\delta\pi_{*}Y}\pi_{*}X,C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y) \end{array}\right\}\] for any \(X,Y\in\Gamma(ker\pi_{*})^{\perp}.\) From (3.39), we get \[\sin^{4}\theta\left\|(\nabla\pi_{*})(X,Y)\right\|^{2} \geq \left\|S_{\delta\alpha\pi_{*}Y}\pi_{*}X\right\|^{2}+\left\|\nabla _{X}^{\mp\perp}\delta\alpha\pi_{*}Y\right\|^{2}+\left\|B\nabla_{X}^{\mp\perp} \delta\pi_{*}Y\right\|^{2}+\left\|C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y\right\|^ {2}\] \[+2\left\{\begin{array}{c}-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{ X}^{P}Y),S_{\delta\alpha\pi_{*}Y}\pi_{*}X)-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y), \alpha S_{\delta\pi_{*}Y}\pi_{*}X)\\ +\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y),B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)+g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,\alpha S_{\delta\pi_{*}Y} \pi_{*}X)\\ -g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta\pi_{*}Y)-g_ {Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,\delta S_{\delta\pi_{*}Y}\pi_{*}X )\\ +g_{Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,C\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)-g_{Q}(\alpha S_{\delta\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)\\ -g_{Q}(\delta S_{\delta\pi_{*}Y}\pi_{*}X,C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y) \end{array}\right\}\] The inequality is satisfied if and only if \(\pi\) is Clairaut slant Riemannian map. In the equality case, it takes the following form: \[\sin^{4}\theta\left\|(\nabla\pi_{*})(X,Y)\right\|^{2} = \left\|S_{\delta\alpha\pi_{*}Y}\pi_{*}X\right\|^{2}+\left\|\nabla _{X}^{\mp\perp}\delta\alpha\pi_{*}Y\right\|^{2}+\left\|B\nabla_{X}^{\mp\perp} \delta\pi_{*}Y\right\|^{2}+\left\|C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y\right\|^ {2}\] \[+2\left\{\begin{array}{c}-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{ X}^{P}Y),S_{\delta\alpha\pi_{*}Y}\pi_{*}X)-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y), \alpha S_{\delta\pi_{*}Y}\pi_{*}X)\\ +\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y),B\nabla_{X}^{\mp\perp}\delta\pi_{ *}Y)+g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,\alpha S_{\delta\pi_{*}Y}\pi_{*}X) \\ -g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta\pi_{*}Y)-g_ {Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,\delta S_{\delta\pi_{*}Y}\pi_{*}X )\\ +g_{Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,C\nabla_{X}^{\mp\perp}\delta\pi_{ *}Y)-g_{Q}(\alpha S_{\delta\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta\pi_{ *}Y)\\ -g_{Q}(\delta S_{\delta\pi_{*}Y}\pi_{*}X,C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y) \end{array}\right\}\] which completes the proof. **Theorem 3.10**.: _Let \(\pi\) be a Clairaut slant Riemannian map with \(s=e^{f}\) from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\) such that \(\pi\) is totally geodesic. Then we have_ \[\sin^{4}\theta\left\|\pi_{*}(\nabla_{X}^{P}Y)\right\|^{2}+\left\|S_{ \delta\alpha\pi_{*}Y}\pi_{*}X\right\|^{2}+\left\|\nabla_{X}^{\pm\perp}\delta \alpha\pi_{*}Y\right\|^{2}\] \[+\left\|B\nabla_{X}^{\pi\perp}\delta\pi_{*}Y\right\|^{2}+\left\|C \nabla_{X}^{\pm\perp}\delta\pi_{*}Y\right\|^{2}\] \[\leq 2\left\{\begin{array}{c}-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{ X}^{P}Y),S_{\delta\alpha\pi_{*}Y}\pi_{*}X)-\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y), \alpha S_{\delta\pi_{*}Y}\pi_{*}X)\\ +\sin^{2}\theta g_{Q}(\pi_{*}(\nabla_{X}^{P}Y),B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)+g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,\alpha S_{\delta\pi_{*}Y}\pi_ {*}X)\\ -g_{Q}(S_{\delta\alpha\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta\pi_{*}Y)- g_{Q}(\nabla_{X}^{\pm\perp}\delta\alpha\pi_{*}Y,\delta S_{\delta\pi_{*}Y}\pi_{*}X)\\ +g_{Q}(\nabla_{X}^{\mp\perp}\delta\alpha\pi_{*}Y,C\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)-g_{Q}(\alpha S_{\delta\pi_{*}Y}\pi_{*}X,B\nabla_{X}^{\mp\perp}\delta \pi_{*}Y)\\ -g_{Q}(\delta S_{\delta\pi_{*}Y}\pi_{*}X,C\nabla_{X}^{\mp\perp}\delta\pi_{*}Y) \end{array}\right\}\] _for all \(X,Y\in\Gamma(ker\pi_{*})^{\perp}\)._ Proof.: Taking into account of Theorem 3.4 in (3.39), we obtain (3.40). This completes the proof. **Example 3.1**.: _Let \(P=Q=\mathbb{R}^{4}\) be Euclidean spaces with Riemannian metrics defined as_ \[g_{P}=dx_{1}^{2}+dx_{2}^{2}+dx_{3}^{2}+dx_{4}^{2}\] _and_ \[g_{Q}=dy_{1}^{2}+dy_{2}^{2}+dy_{3}^{2}+dy_{4}^{2},\] _respectively._ _We take the complex structure \(J^{\prime}\) on \(Q\) as \(J^{\prime}(a,b,c,d)=(-c,-d,a,b)\). Then a basis of \(T_{r}P\) is \(\left\{e_{i}=\frac{\partial}{\partial x_{i}}\right\}\) for \(i\) = 1...4 and basis of \(T_{\pi(r)}Q\) is \(\left\{e_{j}^{\prime}=\frac{\partial}{\partial y_{j}}\right\}\) for \(j\) = 1...4. Now, we define a map \(\pi:(P,g_{P})\rightarrow(Q,g_{Q},J^{\prime})\) by_ \[\pi(x_{1},x_{2},x_{3},x_{4})=(\frac{x_{1}+x_{2}}{\sqrt{3}},\frac{x_{1}+x_{2}}{ \sqrt{6}},0,x_{4}).\] _Then, we have_ \[ker\pi_{*}=\{U_{1}=e_{1}-e_{2},U_{2}=e_{3}\}\] _and_ \[(ker\pi_{*})^{\perp}=\{X_{1}=e_{1}+e_{2},X_{2}=e_{4}\}.\] _Since, we have \(g_{P}(X_{i},X_{j})=g_{Q}(\pi_{*}(X_{i}),\pi_{*}(X_{j}))\) for i, \(j\) = 1, 2, 3, 4. Thus \(\pi\) is a Riemannian map and it can be easily seen that_ \[\pi_{*}(X_{1})=\frac{2}{\sqrt{3}}e_{1}^{\prime}+\frac{2}{\sqrt{6}}e_{2}^{ \prime}\] _and_ \[\pi_{*}(X_{2})=e_{4}^{\prime}.\] _Therefore_ \[range\pi_{*}=span\{U_{1}^{\prime}=\frac{2}{\sqrt{3}}e_{1}^{\prime}+\frac{2}{ \sqrt{6}}e_{1}^{\prime},U_{2}^{\prime}=e_{4}^{\prime}\}\] _and_ \[(range\pi_{*})^{\perp}=span\{X_{1}^{\prime}=\frac{2}{\sqrt{3}}e_{1}^{\prime}- \frac{2}{\sqrt{6}}e_{1}^{\prime},X_{2}^{\prime}=e_{3}^{\prime}\}.\] _Moreover, it is easy to see that \(\pi\) is a slant Riemannian map with slant angle \(cos^{-1}(\frac{1}{\sqrt{3}}).\) Now to show \(\pi\) is Clairaut Riemannian map we will find smooth function \(f\) on \(Q\) satisfying_ \[(\nabla\pi_{*})(X,X)=-g_{P}(X,X)\nabla^{Q}f\] _for all \(X\in\Gamma(ker\pi_{*})^{\perp}\). By using \((2.4)\), we obtain \((\nabla\pi_{*})(X,X)=0\) for \(X=a_{1}X_{1}+a_{2}X_{2},\) where \(a_{1},a_{2}\in\mathbb{R}.\) Also_ \[\nabla^{Q}f=\sum_{i,j=1}^{4}g_{Q}^{ij}\frac{\partial f}{\partial y_{i}}\frac{ \partial}{\partial y_{j}}\] \(\implies\nabla^{Q}f=0\) _for a constant function \(f\). Then it is easy to verify that_ \[(\nabla\pi_{*})(X,X)=-g_{P}(X,X)\nabla^{Q}f\] _for any vector field \(X\in\Gamma(ker\pi_{*})^{\perp}\) with a constant function \(f\). Thus \(\pi\) is Clairaut slant Riemannian map from a Riemannian manifold \((P,g_{P})\) to a Kahler manifold \((Q,g_{Q},J^{\prime})\)._ ## 4 Acknowledgment First author is grateful to the financial support provided by CSIR (Council of science and industrial research) Delhi, India. File no.[09/1051(12062)/2021-EMR-I]. The second author is thankful to the Department of Science and Technology(DST) Government of India for providing financial assistance in terms of FIST project(TPN-69301) vide the letter with Ref No.:(SR/FST/MS-1/2021/104). **Declarations** **Author's Contributions**: All authors contributed equally in this paper. All author read and approved the final manuscript. **Funding**: No funding **Availability of Data and Materials**: Not applicable. **Ethical Approval**: Not required **Competing Interests**: Not applicable **Conflict of Interest**: The authors declare that they have no competing interest as defined by Springer.

2304.06410

MIK2 is a candidate gene of the S-locus for sporophytic self-incompatibility (SSI) in chicory (Cichorium intybus, Asteraceae)

The Cichorium genus offers a unique opportunity to study the sporophytic self incompatibility (SSI) system, being composed of species characterized by highly efficient SI (C. intybus) and complete self compatibility (C. endivia). The chicory genome was used to map 7 previously identified SSI locus-associated markers. The region containing the S locus was restricted to an 4 M bp window on chromosome 5. Among the genes predicted in this region, MDIS1 INTERACTING RECEPTOR LIKE KINASE 2 (MIK2) was promising as a candidate for SSI. Its ortholog in Arabidopsis is involved in pollen stigma recognition reactions, and its protein structure is similar to that of S-receptor kinase (SRK), a key component of the SSI in the Brassica genus. The sequencing of MIK2 in chicory and endive accessions revealed two contrasting scenarios. In C. endivia, MIK2 was fully conserved even comparing different botanical varieties (smooth and curly). In C. intybus, 387 SNPs and 3 INDELs were identified when comparing accessions of different biotypes from the same botanical variety (radicchio). The SNP distribution throughout the gene was uneven, with hypervariable domains preferentially localized in the LRR-rich extracellular region, putatively identified as the receptor domain. The gene was hypothesized to be under positive selection, as the nonsynonymous mutations were more than double the synonymous ones (dN / dS = 2.17). An analogous situation was observed analyzing the first 500 bp of the MIK2 promoter: no SNPs were observed among the endive samples, whereas 44 SNPs and 6 INDELs were detected among the chicory samples. Further analyses are needed to confirm the role of MIK2 in SSI and to demonstrate whether the 23 species-specific nonsynonymous SNPs in the CDS and/or the species-specific 10 bp INDEL found in a CCAAT box region of the promoter are responsible for the contrasting sexual behaviors of the two species.

Fabio Palumbo, Samela Draga, Gabriele Magon, Giovanni Gabelli, Alessandro Vannozzi, Silvia Farinati, Francesco Scariolo, Margherita Lucchin, Gianni Barcaccia

2023-04-13T11:16:51Z

http://arxiv.org/abs/2304.06410v1

_MIK2_ is a candidate gene of the S-locus for sporophytic self-incompatibility (SSI) in chicory (_Cichorium intybus_, Asteraceae) ## Abstract The _Cichorium_ genus offers a unique opportunity to study the sporophytic self-incompatibility (SSI) system, being composed of species characterized by highly efficient SI (_C. intybus_) and complete self-compatibility (_C. endivia_). The chicory genome was used to map 7 previously identified SSI locus-associated markers. The region containing the S-locus was restricted to an \(\sim\)4 M bp window on chromosome 5. Among the genes predicted in this region, _MDIS1 INTERACTING RECEPTOR LIKE KINASE 2 (MIK2)_ was promising as a candidate for SSI. Its ortholog in Arabidopsis is involved in pollen-stigma recognition reactions, and its protein structure is similar to that of S-receptor kinase (SRK), a key component of the SSI in the _Brassica_ genus. The sequencing of _MIK2_ in chicory and endive accessions revealed two contrasting scenarios. In _C. endivia_, MIK2 was fully conserved even comparing different botanical varieties (smooth and curly). In _C. intybus_, 387 SNPs and 3 INDELs were identified when comparing accessions of different biotypes from the same botanical variety (radicchio). The SNP distribution throughout the gene was uneven, with hypervariable domains preferentially localized in the LRR-rich extracellular region, putatively identified as the receptor domain. The gene was hypothesized to be under positive selection, as the nonsynonymous mutations were more than double the synonymous ones (\(\mathrm{dN}\) / \(\mathrm{dS}\) = 2.17). An analogous situation was observed analyzing the first 500 bp of the _MIK2_ promoter: no SNPs were observed among the endive samples, whereas 44 SNPs and 6 INDELs were detected among the chicory samples. Further analyses are needed to confirm the role of MIK2 in SSI and to demonstrate whether the 23 species-specific nonsynonymous SNPs in the CDS and/or the species-specific 10 bp-INDEL found in a CCAAT box region of the promoter are responsible for the contrasting sexual behaviors of the two species. ## 1 Introduction Self-incompatibility (SI) is a peculiar evolutionary strategy aimed at producing and preserving high levels of genetic variability within a species, which prevents self-fertilization and thus inbreeding depression (de Nettancourt, 2001). SI is a common feature in flowering plants, occurring in approximately 40% of angiosperm species (Saumitou-Laprade et al., 2017). It results in the total or partial lack of germination of the pollen grain or development of the pollen tube due to specific interactions between pollen grain and stigma surface or transmitting tissue of the style (Ahmad et al., 2022). As far as is known, SI is prevalently controlled by a single multiallelic locus, the S-locus (Brom et al., 2020), and the combinations of the different allelic variants composing the locus define the S-haplotypes. SI occurs when the same S-haplotype is expressed by both male (pollen) and female (sigma or style) interacting tissues (Takayama and Isogai, 2005). There are two main types of SI: gametophytic SI (GSI) and sporophytic SI (SSI). In GSI, incompatible mating occurs when the S-locus carried by the haploid pollen (male gametophyte) matches either of the S loci present in the diploid style (female sporophyte). As a result, incompatible pollen germinates successfully on the stigma surface, penetrates the stigma, and grows into the style, but pollen tube growth is arrested through the transmitting tract toward the ovary (Broz and Bedinger, 2021). This kind of SI has been described in several plant families, including Fabaceae, Peaceae, Rosaceae, Plantaginaceae and Solanaceae (Watanabe et al., 2012). In contrast, SSI is common in the Brassicaceae, Convolvalaceae, Oleaceae and Asteraceae families (Alagna et al., 2019; Price et al., 2022) and is the result of a more complex mechanism. In this case, the behavior of the pollen is determined by the diploid S genotype of the pollen-producing plant (male sporophyte) so that diploid sporophytic expression of the S-locus allows dominance interactions to occur between male and female tissues (Novikova et al., 2023). Moreover, unlike GSI, pollen tube growth in incompatible mating is immediately arrested on the surface of the stigma. The molecular mechanisms underlying SSI have been extensively deepened in the Brassicaceae family (for a comprehensive review, see (Abhinandan et al., 2022)), whereas in the Asteraceae family, the SSI systems have been poorly investigated and are even less well understood. In this family, the _Cichorium_ genus offers a unique opportunity, being composed of two main groups: one characterized by a strong SSI behavior (_C. intybus_, _C. spinosum_, and _C. bottae_) and the other group containing all self-compatible species (_C. endivia_, _C. pumilum_, and _C. calvum_) (Lucchin et al., 2008). Most interestingly, a cladistic analysis conducted by Kiers et al. and based on the combined use of restriction fragment length polymorphisms (AFLP), trnL-trnF and ITS1/2 sequences indicated that the contrasting sexual behavior of these two groups seems to be strictly related to the phylogeny of the genus (Kiers et al., 1999). In _C. intybus_, SSI was first demonstrated by analyzing different combinations of crosses between Witloof chicory inbred lines (Eenink, 1981). SSI was also confirmed by crossing wild-type chicory plants with accessions of the Italian biotype Rosso di Chioggia (Varotto et al., 1995). It was observed that SSI in chicory induced a quick rejection process, which, after a few minutes, provokes the inhibition of pollen hydration or germination (Barcaccia et al., 2016). From a molecular point of view, Gonthier et al. (Gonthier et al., 2013) assigned the genetic determination of SI to a single S-locus located in LG2. Beyond this, the lack of a good-quality genome assembly has made the identification of putative S-loci extremely challenging. The recent release of the endive and chicory genomes (Fan et al., 2022), together with the availability of several S-locus-associated molecular markers developed in the last decade (Gonthier et al., 2013), represent a turning point in the study of SSI. Since SI hampers the production of inbred lines in several Italian biotypes of chicory, the identification of the S-locus is of pivotal importance for breeding programs. ## 2 Materials and Methods ### _In silico_ identification of SSI candidate genes The newly released reference genomes of chicory (_Cichorium intybus_) and endive (_Cichorium endivia_) were first retrieved from NCBI (JAKNSD0000000000 and JAKOPN000000000, respectively (Fan et al., 2022)). Two SSR markers, namely, sw2H09.2 and B131, and five AFLP-derived markers, all located within the same linkage group (LG2), were selected because of their association with the SSI locus in \(C\). _intybus_(Cadalen et al., 2010; Gonthier et al., 2013). The main features are reported in **Table 1**. These seven markers were mapped against the _C. intybus_ genome to identify the SSI locus-carrying chromosome corresponding to LG2 of Cadalen et al. (Cadalen et al., 2010) and, therefore, to narrow down the region containing the putative SI locus. Similarly, the same markers were also mapped against the _C. endivia_ genome for a chromosome-level comparison between the two _Cichorium_ species. Mapping analyses were performed using Geneious Prime 2022.2.1 software ([https://www.geneious.com](https://www.geneious.com)). All the predicted amino acid sequences included within the chromosome window carrying the SSI locus in chicory were annotated locally via BLASTp against the proteomes of _Arabidopsis thaliana_(Araport 11 (Cheng et al., 2017)) and _Lactuca sativa_(Last Salinas v11 (Reyes-chin-wo et al., 2017), as a model species of the Asteraceae family. The candidate gene selected after the abovementioned analyses (KAI3736590.1) was further investigated in order i) to identify any possible protein domain and/or functional site using PROSITE (Sigrist et al., 2010) at Expasy (Duvaud et al., 2021) and ii) to predict the topology of both alpha-helical and beta-barrel transmembrane domains by means of DeepTMHMM ([https://dtu.biolib.com/DeepTMHMM](https://dtu.biolib.com/DeepTMHMM)). The orthologs of the SSI-related candidate gene in chicory were also searched in endiv. ### _In vitro_ testing of the putative candidate determinant of SSI Fifteen samples from _C. intybus_ and _C. endivia_, representing the main cultivated biotypes traditionally available in the Veneto region (Italy), were used to evaluate the polymorphism rate of the putative SSI determinant. For _C. intybus_, 12 local biotypes of Radicchio, all belonging to the botanical var. _foliosum_, (i.e., 4 Rosso di Chioggia, 2 Variegato di Castelfranco, 2 Precoce di Treviso, 1 Tardivo di Treviso, 1 Verona Semilungo, 1 Variegato di Chioggia and 1 Rosa) were retrieved from the market. For _C. endivia_, we collected 2 samples from the botanical var. _latifolium_ (smooth endiv) and 1 sample from the botanical var. _crispum_ (curly endiv). Genomic DNA (gDNA) was isolated from 100 mg of fresh leaves using a DNAeasy Plant Mini Kit (Qiagen, Valencia, CA, USA) following the procedure provided by the manufacturer. The quality and quantity of the gDNA were assessed by agarose gel electrophoresis (1% agarose/1\(\times\) TAE gel containing 1\(\times\) SYBR Safe DNA Stain, Life Technologies, Carlsbad, CA, USA) and a NanoDrop 2000c UV-Vis spectrophotometer (Thermo Fisher Scientific Inc., Pittsburgh, PA, USA), respectively. \begin{table} \begin{tabular}{c c c c c} \hline \hline **Marker** & **NCBI** & **Distance from** & & \\ **name** & **accession** & **SSI locus2** & & **Forward Primer** & **Reverse Primer** \\ \hline sw2H09.21 & n.a. & \(\sim\)9 cM - downstream & GTGCCGGCTTCACGATTACGATTGA \\ B1311 & n.a. & \(\sim\)45 cM - downstream & CCGCTCTCTCACTCTC & GCTCGAAAATCGGTCTACA \\ TACG2942 & \(<\)1 cM - upstream & TCCCTCCTCATTGAGTCTGATGT & TGGAAATAATTGCGCATTCC \\ TACG2932 & GF112134.1 & \(<\)1 cM - upstream & TCCCTCCTCATGATGATGGT & TGGAAATAATTGCGCATTCC \\ AACC1342 & GF112135.1 & \(<\)1 cM - downstream & ACCCCCCAAAATTTCAGGTTTC & CAAAATAGCTTAGGTTAG \\ TAAA4403 & GF112136.1 & \(<\)1 cM - downstream & CAATGCGTGCCTTTTGTATG & CAACCAAATTCATCTTCTTCTCCTC \\ GGATT2182 & GF112137.1 & \(<\)1 cM - upstream & CAAGTCAGCCTCCCAAACAT & ATTCAGGTGAGGAGACAT \\ \hline \hline \end{tabular} \end{table} Table 1: Molecular markers cosegregating with the S-locus in _C. intybus_(Gonthier et al., 2013). sw2H09.21 and B1311 are microsatellite (SSR) regions, while the remaining are AFLP-derived markers. For each marker, the name, reference, putative distance from the SSI locus and primer sequence are indicated. Five primer pairs were designed to span the entire sequence of the candidate gene (3193 bp) previously selected. Primers were drawn using Geneious Prime 2022.2.1 in the most conserved regions between _C. intybus_ and _C. endivia_ to allow successful amplification of samples from both species (**Table 2**). Similarly, a further primer pair was synthesized to amplify the first 500 bp upstream of the start codon, allowing for a comparison between the putative promoter regions of the two species. In addition, from the same chromosomal region containing the SSI locus, we selected a second gene (KAI3736550.1) whose ortholog in Arabidopsis does not appear to be involved in pollen-stigma recognition. This gene was chosen as a control for a comparison between its polymorphism rate and that of the candidate gene. Additionally, in this case, two primer pairs were designed to cover its entire sequence and to allow successful amplification of samples from both _C. intybus_ and _C. endivia_ (**Table 2**). PCRs were performed using \(\sim\)30 ng of gDNA as a template, 10 \(\upmu\)L of MangoMix (Bioline, London, United Kingdom), 2 \(\upmu\)L of each primer (10 mM) and sterile water to a final volume of 20 \(\upmu\)L. A Veriti 96-Well Thermal Cycler (Applied Biosystems, Carlsbad, CA) was used to carry out the amplifications by setting the following conditions: initial denaturation at 95 \({}^{\circ}\)C for 5 min, followed by 35 cycles at 95 \({}^{\circ}\)C for 30 s, 59 \({}^{\circ}\)C for 30 s, and 72 \({}^{\circ}\)C for 90 s, and a final extension of 10 min at 72 \({}^{\circ}\)C. The quality of the PCR amplicons was assessed on a 1.5% (w/v) agarose gel stained with 1\(\times\) SYBR Safe DNA Gel Stain (Life Technologies). Amplicons were purified with ExoSap-IT (Applied Biosystems), sequenced through Sanger sequencing, analyzed and manually curated in Geneious 2022.2.1, assembled and finally deposited in GenBank (accession nos. OQ781894-OQ781923). ## 3 Results and Discussion ### Identification of _MIK2_ in _Cichorium_ species The mapping of the seven markers associated with the SSI locus (Gonthier et al., 2013) on the newly released reference genome of chicory allowed us to identify the correspondence between LG2 (Cadalen et al., 2010; Gonthier et al., 2013) and chromosome 5 (JAKNSD0000000000 (Fan et al., 2022)). Most importantly, this allowed us to narrow down the region containing the SSI locus to a window of \(\sim\)4 M bases, between \(\sim\)167,000 bp and \(\sim\)4,235,000 bp (**Figure 1A**). \begin{table} \begin{tabular}{c c c c c c c c} \hline \hline \multirow{2}{*}{**Gene**} & \multirow{2}{*}{**Region**} & \multirow{2}{*}{**Forward**} & \multicolumn{2}{c}{**Distance**} & \multirow{2}{*}{**Revers**} & \multirow{2}{*}{**Tm**} & **Distance** & **Amplified** \\ & & & & **Tm** & & **From** & **From** & **region** \\ & & **ATG** & & & & **ATG** & **length** \\ \hline \multirow{8}{*}{KAJ3736550.1} & Pront500 & **CCACTGAATTCTCACTGTAC** & 62.8 & -561 & **AGAAGGGCAGCTGAATTC** & 61.2 & 119 & 680 \\ \cline{1-1} \cline{2-7} & Part 1 & **CCACATAAAACTTCTCCAATTTG** & 61.6 & -82 & CAGGGATGGGGACAGAAGG & 65.1 & 976 & 1058 \\ \cline{1-1} \cline{2-7} & Part\_2 & **GGTAACTTGACAACCTCAG** & 63.4 & 624 & **GCCCTTCCAAATTATTATTATTAGAC** & 61.4 & 1684 & 1060 \\ \cline{1-1} \cline{2-7} & Part\_3 & **TGTGTGTGTGACCTGTAC** & 65.4 & 1340 & **CACCTTTCCCACTCCTCCT** & 65.3 & 2349 & 1009 \\ \cline{1-1} \cline{2-7} & Part\_4 & **CITGGAGGTCCCAATTCCA** & 64.9 & 1961 & **TAATGGGGGAGGCTG** & 65.2 & 2670 & 709 \\ \cline{1-1} \cline{2-7} & Part 5 & **AAAGGAGGAGGAGG** & 65.3 & 2329 & **AGAACCACACATATTTGCACACC** & 62.8 & 3280 & 951 \\ \cline{1-1} \cline{2-7} \cline{2-7} & Part\_1 & **CCACTACTACTCTCTGTGTTTATACT** & 60.9 & -62 & **GGTTTCCGGGAAAAGATC** & 64.6 & 796 & 858 \\ \cline{1-1} \cline{2-7} \cline{2-7} & Part\_2 & **GGCGGATTTTGTTGCTT & 65.0 & 618 & **TATCGTGTGCAAATATGCACTGC** & 62.1 & 1518 & 900 \\ \hline \hline \end{tabular} \end{table} Table 2: List of primer pairs used for the amplification of two genes in _C. intybus_ and _C. endivia_. KAI3736590.1 was selected as one of the possible determinants of the S-locus, and KAI3736550.1 was chosen from the same chromosomal region for a comparison between the polymorphism rates of the two loci. Due to the length of the two genes, five and two primer pairs (for the amplification of as many overlapping regions) were designed to cover their entire sequences. For the candidate gene, we also designed a primer pair to amplify the first 500 bp of the promoter region. For each primer pair, the sequence, temperature of melting (Tm), and distance from the start codon (ATG) are indicated. The primers used for Sanger sequencing are highlighted in bold. In parallel, three out of seven markers (namely, AACC134, sw2H09.21 and B1311) were also successfully mapped against the entire genome (JAKOPN0000000000), enabling us to establish the correspondence between chromosome 5 of chicory and chromosome 4 of entive. This corresponds to the observations made by Fan et al. based on the synteny analyses conducted between the two species (Fan et al., 2022). Additionally, complete collinearity was demonstrated in the order of these three markers within chromosome 4 of entive and chromosome 5 of chicory (**Figure 1A**). Figure 1: Narrowing down the chromosomal window containing the SSI locus and identification of a candidate gene. **(A)** Correspondence between LG2 of _Cichorium thybus_(Gonthier et al., 2013), chromosome 5 of _C. thybus_ and chromosome 4 of _C. endivia_(Fan et al., 2022). Seven molecular markers (B131 and swH09.2, TACG2942, TACG2932, AACC1342, TTAA4402, GGATT1282, in bold), originally identified by Gonthier et al. because of their association with the S-locus (in red), were mapped against the genome of chicory (JAKNSD000000000), and the SSI-locus was localized in a window of 4 M bases on chromosome 5 (red dotted line). Three out of seven markers were also successfully mapped against the entive genome (JAKOPN000000000), allowing us to identify the correspondence between chromosome 4 and chromosome 5 of chicory. Markers in italics represent other molecular markers identified by Gonthier et al. and associated with the SSI locus whose sequences are not available in NCBI. **(B)** Comparison between the region of \(\sim\)4 M bp located on the peripheral arm of chromosome 5 and containing the SSI locus in chicory (upper part) and the corresponding region (\(\sim\)1.8 M) in entive located on the peripheral arm of chromosome 4 (bottom part). Along with all the predicted genes available from Fan et al., (Fan et al., 2022), we highlighted i) the AACC134 marker that delimits the abovementioned chromosomal windows, ii) the newly identified candidate gene (_MIK2_) in chicory and its putative orthologous in entive, and iii) a control gene (and its putative orthologous in entive) coding for a putative protein kinase, chosen as a control for a comparison between its polymorphism rate and that of the candidate gene. According to the prediction made by Fan et al. (Fan et al., 2022), the \(\sim\)4 M chromosomal window of chicory encompassing the SSI locus contains 139 genes, generically named "protein coding genes" (**Figure 1B**). The resulting proteins were aligned against the proteomes of Arabidopsis and lettuce, and 114 were successfully annotated (**Supplementary Table 1**). A gene encoding a protein with accession number KAI3736590.1 (1,038 aa) was considered a candidate gene of the SSI region. This gene (3,193 bp) was located between 2,811,314 bp and 2,814,506 bp and was orthologous to AT4G08850.1 (_A. thaliana_, AtMIK2 1076 aa) and XP 023768237.1 (_L. sativa_, LsMIK2 1036 aa). Both gene loci are annotated as _MDIS1 INTERACTING RECEPTOR LIKE KINASE 2 (MIK2)_, and the newly identified gene in chicory was therefore designated _CiMIK2_. In Arabidopsis, the MIK2 protein, along with MALE DISCOVERER 1 (MDIS1), MDIS2, and MIK1, forms a cell-surface male receptor complex (tetraheteromer) that is highly expressed on the pollen tube. Most interestingly, this receptor complex was found to perceive the female gametophyte-secreted peptide LURE1, also known as a female attractant (Wang et al., 2016). Based on the topology and protein domain prediction, CiMIK2 was characterized by an extracellular region of 676 aa containing 12 leucine-rich repeats (LRRs), a transmembrane region (TM, 10 aa) and a cytoplasmic region (in the C-terminal region, 323 aa) containing a kinase domain. This latter finding was particularly remarkable since, in the few species fully characterized for the self-incompatibility (SSI) system (e.g., _Brassica oleracea_ and _B. campestris_), the female determinant of the SI locus is represented by a receptor kinase (SRK) (Tedder et al., 2011). In other plant species with SSIs, such as Convolvulaceae and Asteraceae, SRK-mediated self-recognition has been postulated (Hiscock et al., 2003). The ortholog of _CiMIK2_ was also detected in endive (_CeMIK2,_ 1038 aa and a coding gene of 3200 bp) in the terminal region of chromosome 4, confirming the collinearity between this chromosomal arm and the terminal region of chromosome 5 in chicory (**Figure 1B**). From the nucleotide alignment between _CiMIK2_ and _CeMIK2_, 116 positions out of a consensus sequence of 3200 bp were polymorphic, and 90 were nonsynonymous (90 amino acid changes out of 1038 positions, 8.67%). However, the distribution of the nonsynonymous positions throughout the sequence was nonuniform. In particular, the LRR-carrying extracellular region displayed a sequence identity between the two species equal to 89.35% and contained 72 of the 90 variable positions. In contrast, the cytoplasmic region was more conserved between chicory and endive, with a sequence identity of 95.80% and only 13 variable positions. The control gene (KAI3736550.1, 496 aa and a coding gene of 1491 bp), located between 1,578,317 bp and 1,579,807 bp and, therefore, in the same chromosomal window carrying the SSI-locus (**Figure 1B**), was used to compare its polymorphism rate with that of _MIK2_. KAI3736550.1 was orthologous to AT1G28390.1 (_A. thaliana_, 475 aa) and XP 023768237.1 (_L. sativa_, 497 aa). Both genes, generically annotated as "protein kinase superfamily protein", do not seem to be involved in pollen-sigma recognition reactions based on the literature. KAI3736550.1 was chosen as a control not only for its proximity to the candidate gene but also for the presence of a kinase domain, which makes it structurally similar to _MIK2_. The orthologous protein of KAI3736550.1 was also identified in endive (KAI3513740.1), as expected, in the terminal region of chromosome 4 (**Figure 1B**). From the protein alignment between KAI3736550.1 and KAI3513740.1, 5/496 positions were polymorphic. The polymorphism between the two abovementioned protein sequences (1.01%) was therefore eight times lower than that observed when comparing the ciMIK2 and ceMIK2 proteins (8.67%). ### Testing the polymorphism rate of _Mik2_ in chicory and endive accessions Loci governing SI are expected to experience negative frequency-dependent selection, a form of strong balancing selection where the relative fitness of a population increases as the frequency of each allelic variant decreases (Wright, 1939). In other words, low-frequency SI-related alleles benefit from a selective advantage over high-frequency alleles because they encounter their cognate allele only rarely, thereby enhancing cross-compatibility reactions. Consequently, in SI-related genes, substitutions affecting allelic specificity (i.e., nonsynonymous SNP, dN) are expected to enter a population more often than substitutions not affecting specificity (i.e., synonymous SNP, dS), leading to a positive dN/dS ratio (also known as o) (Castric and Vekemans, 2007). This has been demonstrated, for example, for the S-locus receptor kinase (_SRK_) of _B. oleracea_ and _B. rapa_(Sainudilin et al., 2005). In this study, we have addressed this issue by comparing the level of polymorphism of the newly identified candidate gene (_MIK2_) with that of the control gene, located in the same 4 M base window and encoding a putative protein kinase. For this, we successfully amplified and sequenced the full-length sequences encoding _MIK2_ and the protein kinase in 15 samples belonging to _C. intybus_ and _C. endvia_. Regarding the control gene, by multiple alignment of the full sequences of the 15 samples along with those extrapolated from the chicory (_C. intybus_ cultivar grasslands Puna) and entive (_C. endvia_ var. _crispum_) genomes, we detected 23 polymorphic sites over a full-length gene of 1,491 bp (98.46% of conserved nucleotides), with nearly 1 mutation every 64 nucleotides (**Supplementary Table 2**). Out of 23, 8 represented nonsynonymous mutations (highlighted as black blocks in **Figure 2A**) with a dN/dS of 0.53. This suggests that the gene is under negative (or purifying) selection. Figure 2: **(A)** Multiple alignment among the full CDSs of a putative kinase (used as control gene) sequenced in 12 chicory and 3 endive accessions. Along with the 15 newly obtained sequences, we also included the reference sequences extracted from the chicory and entive genomes (Fan et al., 2022). Sample 1 is the reference sequence extracted from the chicory genome (_C. intybus_ cultivar grasslands Puna). Samples from 2 to 13 are all Radicchio biotypes belonging to _C. intybus_ botanical var. _foliosum_ (from 2 to 5 Rosso di Chioggia, 6 Variegato di Chioggia, 7 and 8 Variegato di Castelfranco, 9 Rosa, 10 Verona Semilungo, 11 Treviso Tardivo, 12 and 13 Treviso Precoce). Samples 14 and 15 are accessions from _C. endvia_ botanical var. _crispum_ (the first one represents the reference sequence extracted from the entive genome), samples 16 and 17 are accessions from _C. endvia_ botanical var. _latifolium_. Only nonsynonymous SNPs are shown in the alignment (black blocks), while red blocks indicate species-specific nonsynonymous SNPs (i.e., conserved within species but variable between chicory and entive. Cellular localization prediction, protein domains and functional sites of the resulting amino acid sequence are reported on the consensus sequence and were predicted by DeepTMHMM ([https://dtu.biolib.com/DeepTMHMM](https://dtu.biolib.com/DeepTMHMM)) and PROSITE (Sigrist et al., 2010). **(B)** Multiple alignment among the full CDSs of _MIK2_, a candidate gene for the SI locus. Sample numbering, symbol legends and protein features are identical to those reported in Panel A. When analyzing these sequences separately for each species, we found 9 polymorphic sites between the 14 chicory samples (3 nonsynonymous) and no polymorphism among the 4 endive sequences. Finally, in the comparison between chicory and entive samples, 11 polymorphic positions (4 nonsynonymous, highlighted with red blocks in **Figure 2A**) discriminated the two species (i.e., they were conserved within each species but variable between them). Regarding the _MIK2_ gene, multiple alignment of the CDSs (i.e., excluding the intron region of 76 nucleotides) revealed an astonishing scenario. The entive samples were 100% identical (no SNP, **Supplementary Table 3**), although they belonged to different botanical varieties (i.e., 2 var. _latformolium_ and 2 var. _crispum_) and one of them (the one used for genome sequencing by Fan et al.) came from a geographical area (China) totally different from that of the other three (Italy). In contrast, from the nucleotide alignment of the 14 chicory samples, we detected 387 polymorphic positions and 3 INDELs over a CDS consensus sequence of 3114 bp (87.48% of conserved nucleotides). This indicates 1 mutation every 8 nucleotides, eight times higher than that observed for the control gene. This result is even more relevant if we consider that, unlike entive, all the chicory biotypes analyzed belonged to the same botanical variety (_foliosum_). Enormous variability was found even within the same biotype. For example, Rosso di Chioggia 2 and Rosso di Chioggia 3 differed in 170 polymorphic positions. Similarly, Variegato di Castelfranco 2 and Variegato di Castelfranco 3 were found to be distinguishable for 141 SNPs. None of the 387 SNPs were found to produce nonsense mutations, and the INDEL lengths were always multiples of 3 bp (no frameshift). However, the number of nonsynonymous SNPs (265, black blocks in **Figure 2B**) was more than double that of the synonymous counterpart (122). The dN/dS ratio of 2.17 strongly suggests the possibility that the gene is under positive selection, as widely demonstrated for the SI-related genes of several species (Donia et al., 2016; Claessen et al., 2019; Azibi et al., 2020). Additionally, as already observed in the preliminary analysis, the distribution of the nonsynonymous positions throughout the nucleotide sequence was uneven. The extracellular region (rich in LRRs) and the TM domain displayed the highest mutation rates (14.20 and 15.87 SNPs every 100 bases, respectively) and the highest dN/dS ratios (2.63 and 4.00, respectively). In species characterized by sporophytic or gametophytic SI, such as _Brassica_ spp. (Sato et al., 2002), _Raphanus sativus_(Okamoto et al., 2004) and _Arabidopsis hyrata_(Miege et al., 2001), genes encoding components of the S-locus have been shown to possess regions of extreme sequence polymorphism, known as hypervariable (HV) domains. For example, in _Brassica_ spp., the majority of sequence variation between SRKs lies within the extracellular domain. This HV region represents the receptor domain, which, by recognizing the male determinant, allows the stigma to discriminate between "self" and "nonself" pollen. The HV regions are therefore thought to be responsible for S-locus specificity (Ma et al., 2016). By functional and structural analogy, the extracellular part of ciMIK2 could represent one of the HV regions of the S-locus in chicory and the receptor region of the female determinant. In contrast, the cytoplasmic region (containing the kinase domain) was more conserved (dN/dS ratio of 1,08 and mutation rate of 8.76 SNPs every 100 bases). It should be noted that in the comparison between chicory and entive samples, 25 polymorphic positions (of which 23 nonsynonymous positions are highlighted as red blocks in **Figure 2B**) discriminated the two species (i.e., they were totally conserved within each species but variable between them). Of these, 19 (including 18 nonsynonymous) were located in the extracellular region. The molecular mechanism by which two phylogenetically related and interfertile species differentiated to such an extent, such that entive evolved strictly autogamous (self-compatible) while chicory evolved strictly allogamous (self-incompatible), is still completely unclear. However, it is highly probable that the S-locus evolved differently in the two species, giving rise to contrasting sexual behaviors. The results observed from the comparison between the _ciMIK2_ and _ceMIK2_ sequences are an outstanding starting point, but they are not sufficient to support the hypothesis that the 23 species-specific nonsynonymous SNPs are actually responsible for their mode of reproduction. Further studies are needed to understand whether the specific amino acid changes (especially the 18 identified in the receptor region) observed and conserved in the entire samples are actually responsible for alterations in protein folding and, possibly, in the receptor-male determinant interaction. The full sequence conservation observed between samples of different botanical varieties (_latifolium_ and _crispum_) and from different geographical areas (China and Italy), along with the lack of nonsense mutations would suggest that _MIK2_ retains its function in endive. Considering the importance of the promoter in gene transcription regulation, we further investigated the first 500 bases upstream of the ATG codon in a subset of three chicory and three endive samples to identify species-specific polymorphisms that could explain any possible transcription change in the _MIK2_ gene between the two species. Similar to what was observed for the coding sequence, we did not find any SNP (100% sequence identity) discriminating the promoter sequences of the three endive samples. In contrast, by comparing three chicory samples, we detected as many as 44 SNPs and 6 INDELs (**Supplementary Figure 1**). Finally, in the comparison between species, 13 SNPs and 3 INDELs discriminated the two species (i.e., they were totally conserved within each species but variable between them). Most interestingly, the longest INDEL (i.e., a 10 bp INDEL) was located in one of the three CCAATBOX1 elements predicted through enriched motif screening. CCAAT box regions are universally known to be essential for gene expression in eukaryotic cells, contributing to transcription by recruiting a complex of nuclear factors: NF-YA, NF-YB, and NF-YC (Mantovani, 1999). Mutations in the CAAT box can lead to loss of NF-Y binding and, consequently, to decreased transcriptional activity (Zhong et al., 2023). Further investigations are needed to elucidate whether this specific promoter sequence variation could actually affect _MIK2_ expression in the two species. The next few years should be exciting for SI research in the _Cichorium_ genus. Based on its chromosome location, the predicted protein structure, the role of its orthologs in Arabidopsis, and the impressive amount of nonsynonymous SNPs, we hypothesized that _MIK2_ may represent the female determinant of the SSI locus in _C. intybus_. To establish that _MIK2_ can act similarly to SRK in _Brassica_, the next major goal will be the functional characterization of this candidate gene to further corroborate its involvement in pollen-sigma recognition. In contrast, there are still no clues about the possible male counterpart (i.e., the male determinant). The full characterization of the S-locus will also enlighten the intricate phylogeny of the _Cichorium_ genus and, in particular, the mechanism that led two very similar, closely related and interfertile crop plant species (i.e., endive and chicory) to adopt contrasting sexual reproduction strategies with significant consequences on the genetic structure and evolution dynamics of populations. Conflict of Interest The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest. ## 5 Author Contributions FP and GB: conceptualization. FP: methodology. SD: formal analysis. GM: data analysis. FP, GM, and GG: writing--original draft preparation. FP, SD, GM, GG, AV, SF, FS, ML, GB: writing--review and editing. FP and GB: supervision and project administration. GB: funding acquisition. All authors have read and agreed to the published version of the manuscript. ## 6 Funding This study was performed within the Agritech National Research Center and received funding from the European Union Next-Generation EU (Piano Nazionale di Ripresa e Resilienza (PNRR)--Missione 4 Componente 2, Investimento 1.4--D.D. 1032 17/06/2022, CN00000022. Our study represents an original paper related to Spoke 1 "Plant, animal and microbial genetic resources and adaptation to climate changes". In particular, it is a baseline for the fulfilment of milestones within Task 1.3.5 titled "Genome-wide strategies for fast-forward molecular breeding aimed at the assessment of genetic distinctiveness, uniformity and stability (DUS) and identity of pre-commercial varieties". This manuscript reflects only the authors' views and opinions, and neither the European Union nor the European Commission can be considered responsible for them. ## 7 Data Availability Statement The original contributions presented in the study are included in the article, in the Supplementary Materials and in GenBank. Further inquiries can be directed to the corresponding author. ## 8 Supplementary Material The Supplementary Material for this article can be found at:

2307.09273

Low-ionization iron-rich Broad Absorption-Line Quasar SDSS J1652+2650: Physical conditions in the ejected gas from excited FeII and metastable HeI

We present high-resolution VLT/UVES spectroscopy and a detailed analysis of the unique Broad Absorption-Line system towards the quasar SDSS J165252.67+265001.96. This system exhibits low-ionization metal absorption lines from the ground states and excited energy levels of Fe II and Mn II, and the meta-stable 2^3S excited state of He I. The extended kinematics of the absorber encompasses three main clumps with velocity offsets of -5680, -4550, and -1770 km s$^{-1}$ from the quasar emission redshift, $z=0.3509\pm0.0003$, derived from [O II] emission. Each clump shows moderate partial covering of the background continuum source, $C_f \approx [0.53; 0.24; 0.81]$. We discuss the excitation mechanisms at play in the gas, which we use to constrain the distance of the clouds from the Active Galactic Nucleus (AGN) as well as the density, temperature, and typical sizes of the clouds. The number density is found to be $n_{\rm H} \sim 10^4\rm cm^{-3}$ and the temperature $T_e \sim 10^4\rm\,K$, with longitudinal cloudlet sizes of $\gtrsim0.01$ pc. Cloudy photo-ionization modelling of He I$^{*}$, which is also produced at the interface between the neutral and ionized phases, assuming the number densities derived from Fe II, constrains the ionization parameter to be $\log U \sim -3$. This corresponds to distances of a few 100 pc from the AGN. We discuss these results in the more general context of associated absorption-line systems and propose a connection between FeLoBALs and the recently-identified molecular-rich intrinsic absorbers. Studies of significant samples of FeLoBALs, even though rare per se, will soon be possible thanks to large dedicated surveys paired with high-resolution spectroscopic follow-ups.

Balashev S. A., Ledoux C., Noterdaeme P., Boissé P., Krogager J. K., López S., Telikova K. N

2023-07-18T14:10:08Z

http://arxiv.org/abs/2307.09273v2

Low-ionization iron-rich Broad Absorption-Line Quasar SDSS J 1652+2650: Physical conditions in the ejected gas from excited Fe ii and metastable He i+ ###### Abstract We present high-resolution VLT/UVES spectroscopy and a detailed analysis of the unique Broad Absorption-Line system towards the quasar SDSS J 165252.67+265001.96. This system exhibits low-ionization metal absorption lines from the ground states and excited energy levels of Fe ii and Mn ii, and the meta-stable \(2\,^{3}S\) excited state of He i. The extended kinematics of the absorber encompasses three main clumps with velocity offsets of \(-5680\), \(-4550\), and \(-1770\) km s\({}^{-1}\) from the quasar emission redshift, \(z=0.3509\pm 0.0003\), derived from [O ii] emission. Each clump shows moderate partial covering of the background continuum source, \(C_{f}\approx[0.53;0.24;0.81]\). We discuss the excitation mechanisms at play in the gas, which we use to constrain the distance of the clouds from the Active Galactic Nucleus (AGN) as well as the density, temperature, and typical sizes of the clouds. The number density is found to be \(n_{\rm H}\sim 10^{4}\) cm\({}^{-3}\) and the temperature \(T_{\rm e}\sim 10^{4}\) K, with longitudinal cloudite sizes of \(\gtrsim 0.01\) pc. Cloudy photo-ionization modelling of He i+, which is also produced at the interface between the neutral and ionized phases, assuming the number densities derived from Fe ii, constrains the ionization parameter to be \(\log U\sim-3\). This corresponds to distances of a few 100 pc from the AGN. We discuss these results in the more general context of associated absorption-line systems and propose a connection between FeLoBALs and the recently-identified molecular-rich intrinsic absorbers. Studies of significant samples of FeLoBALs, even though rare per se, will soon be possible thanks to large dedicated surveys paired with high-resolution spectroscopic follow-ups. keywords: quasars: absorption lines; quasars: individual: SDSS J 165252.67+265001.96, NVSS J 235953\(-\)124148; line: formation; galaxies: active. ## 1 Introduction A key characteristic of around 20% of optically-selected quasars is the occurrence of broad absorption-line (BAL) systems along the line-of-sight to the quasar (Tolea et al., 2002; Hewett and Foltz, 2003; Reichard et al., 2003; Knigge et al., 2008; Gibson et al., 2009). BAL systems are typically associated with highly-ionized metals, e.g., C iv and O vi, and their wide kinematic spreads, velocity offsets, and partial covering factors all indicate that they are produced by out-flowing gas. Observations of such outflows provide a direct test of quasar feedback models. One-tenth of BAL systems show associated wide Mg ii absorption (Trump et al., 2006) and are called low-ionization BALs (hereafter LoBALs). An even smaller fraction, totalling only \(\sim 0.3\)% of the global quasar population, in addition, exhibits Fe ii absorption and is hence called FeLoBALs. A qualifying feature of FeLoBALs is the detection of Fe ii in its various fine-structure energy levels of the lowest electronic states. These levels may be excited by collisions or UV pumping, and their relative abundance can provide robust estimates of critical physical parameters. Interestingly, the modelling of FeLoBALs indicates they contain some neutral gas and likely occur at the interface between the ionized and neutral media (Korista et al., 2008). Another feature of FeLoBALs, which was gradually recognised, is the presence of absorption lines corresponding to transitions from the first excited level of neutral helium, He i\({}^{\star}\)(Arav et al., 2001; Aoki et al., 2011; Leighly et al., 2011). This is observed in FeLoBALs but also more generally in LoBALs (Liu et al., 2015). These lines have also been detected in the host galaxies of a few GRBs (Fynbo et al., 2014). He i\({}^{\star}\) is predominately populated by recombination of He ii and the measured column densities of He i\({}^{\star}\) provide a measure of the total column density of the ionized medium. This can constrain the physical conditions in the outflowing gas and determine the total mass budget to draw a more complete physical picture of quasar activity. For example, rapid cooling followed by the phase transition and subsequent condensation in an outflowing medium can result in the escape of small chunks of the medium from the outflowing gas. Such cloudlets can precipitate back onto the central engine and sustain the formation of the broad-line region around the central powering source (Elvis, 2017). Because the incidence rate of FeLoBALs in quasars is low, only a small sample of such systems was found in the Sloan Digital Sky Survey (SDSS) database (e.g., Trump et al., 2006; Farrah et al., 2012; Choi et al., 2022). Most importantly, only about a dozen such systems was studied so far by means of high-resolution near-UV and visual spectroscopy, i.e.: Q 0059\(-\)2735 (Hazard et al., 1987; Wampler et al., 1995; Xu et al., 2021), Q 2359\(-\)1241 (Arav et al., 2001, 2008), FIRST 104459.6365605 (Becker et al., 2000; de Kool et al., 2001), FQOS 08404.3633 (Becker et al., 1997; de Kool et al., 2002b), FIRST J 121442.3+280329 (Becker et al., 2000; de Kool et al., 2002a), SDSS J 03000.56+004828.0 (Hall et al., 2003), SDSS J 0318\(-\)0600 (Dunn et al., 2010; Bautista et al., 2010), AKARI J 11757+5907 (Aoki et al., 2011), PG 1411+442 (Hamann et al., 2019), SDSS J 2357\(-\)0048 (Byun et al., 2022b), SDSS J 1439\(-\)0106 (Byun et al., 2022), SDSS J 0242+0049 (Byun et al., 2022c), SDSS J 1130+0411 (Walker et al., 2022), MR 231 (Boroson et al., 1991; Smith et al., 1995; Veilleux et al., 2016), and NGC 4151 (Crenshaw et al., 2000; Kraemer et al., 2001). Among these, only a few systems exhibit mild line saturation and overlapping, which allow one to resolve the fine-structure lines and therefore derive robust constraints on the gas physical conditions (Arav et al., 2008). Moreover, each previously-studied system appears to be fairly specific, i.e., FeLoBALs show a broad range of properties, which means any new observation and detailed analysis potentially bring new valuable clues to understanding the physics and environmental properties of AGN outflows. In this paper, we report the serendipitous discovery of a multi-clump FeLoBAL towards SDSS J 165252.67+265001.96, which we refer to in the following as J 1652+2650. We present high-quality VLT/UVES data of this quasar and the spectroscopic analysis of the absorption system and discuss the excitation mechanisms at play in the gas. Our goal is to infer the physical properties of FeLoBAL clouds and estimate their distance from the central engine. ## 2 Observations and Data Reduction We selected the bright quasar J 1652+2650 (\(B=18.2\); \(V=17.7\); \(z_{\rm em}=0.35\); Veron-Cetty & Veron, 2010) with the primary goal to search for CN, CH, and CH\({}^{+}\) molecules in absorption based on the detection of strong associated Na i lines at \(z\approx 0.33\) in the SDSS spectrum (Paris et al., 2018; Negrete et al., 2018), which is shown in Fig. 1. We observed the target in visitor mode on the night of July 27, 2019, with UVES, the Ultraviolet and Visual Echelle Spectrograph (Dekker et al., 2000) installed at the Nasymth-B focus of the ESO Very Large Telescope Unit-2, Kueyen. The total on-source integration time was four hours, subdivided evenly into three exposures taken in a row. The instrumental setup used Dichroic beam splitter #1 and positioning of the cross-dispersers at central wavelengths of 390 nm and 590 nm in the Blue and Red spectroscopic arms, respectively. In each arm, the slit widths were fixed to 1'' and CCD pixels were binned 2\(\times\)2. While observing, the weather conditions were excellent with clear sky transparency and a measured Differential Image Motion Monitor (Sarazin & Roddier, 1990) seeing of 0\(\farcs\)6. Despite a relatively high airmass (1.63-1.97), the source was recorded on the detectors with a spatial PSF trace of only 1\(\farcs\)1 FWHM in the Blue (1\(\farcs\)0 FWHM in the Red). The raw data from the telescope was reduced offline applying the recipes of the UVES pipeline v5.10.4 running on the ESO Reflex platform. During this process, the spectral format of the data was compared to a physical model of the instrument, to which a slight CCD rotation was applied (\(-0.05\arcdeg\) in the Blue; \(+0.05\arcdeg\) in the Red). ThAr reference frames acquired in the morning following the observations were used to derive wavelength-calibration solutions, which showed residuals of 1.53 mA RMS in the Blue (4.25 mA RMS in the Red). The object and sky spectra were extracted simultaneously and optimally, and cosmic-ray hits were removed efficiently using a \(\kappa\)-\(\sigma\) clipping factor of five. The wavelength scale was converted to the helio-vacuum rest frame. Individual 1D exposures were then scaled and combined together by weighing each pixel by itsSN. The SN/of the final science product is \(\sim 15\) per pixel at \(325<\lambda_{\rm obs}<455\) nm and \(\sim 32\) per pixel at \(490<\lambda_{\rm obs}<690\) nm. With a delivered resolving power of 50 000, the instrumental line-spread function is 6 km s\({}^{-1}\) FWHM. ## 3 Data Analysis ### Quasar spectrum and systemic redshift J 1652+2650 exhibits moderate reddening. Based on the SDSS spectrum, shown in Fig. 1, and using the Type I quasar template from Selsing et al. (2016), we followed a procedure similar to that employed by Balashev et al. (2017, 2019) and derived that \(A_{V}\approx 1.2\), assuming standard galactic extinction law (Fitzpatrick & Massa, 2007). This is quite large compared to intervening quasar absorbers, e.g., DLAs (Murphy & Bernet, 2016). We also note that this quasar shows iron-emission line complexes in the spectral regions around 4600 A and 5300 A in the quasar rest frame, that are enhanced by a factor of \(\sim 4\) relative to the fiducial quasar template (see Fig. 1). To determine the quasar emission redshift accurately, we followed the recommendations of Shen et al. (2016) that Ca ii and [O ii] should be considered the most reliable systemic-redshift indicators. In the case of J 1652+2650, the blue side of the Ca ii profile is affected by strong self-absorption, so we are left with [O ii], which according to Shen et al. (2016) is not significantly shifted relative to Ca ii. Based on a single-component Gaussian fit, we measured \(z_{\rm em}=0.3511(7)\) when considering the [O ii],\(\lambda 3727.092\) transition line alone, and \(z_{\rm em}=0.3506(7)\) when using the mean wavelength of the [O ii],\(\lambda 43727.092,3729.875 doublet. This translates into \(z_{\rm em}=0.3509\pm 0.0003\), which we consider as our most-accurate determination of the quasar systemic redshift. The H\(\beta\) emission line is observed at a redshift of \(z\approx 0.3494\), implying a velocity blue-shift of \(\Delta V\sim-330\) km s\({}^{-1}\) relative to [O ii]. This is consistent with the findings of Shen et al. (2016) using their own sample. ### Absorption-line system overview The FeLoBAL1 on the line-of-sight to J 1652+2650 consists of multiple prominent absorption lines from Mg ii, Ca ii, He i\({}^{\star}\) (i.e., the meta-stable excited state 2\({}^{3}\)S), Mg i, Fe ii, and Mn ii, all covered by the UVES spectrum. The system is composed of three main, kinematically-detached absorption-line complexes,2 i.e., at \(z_{\rm abs}=0.32531\) (\(\Delta V\approx-5680\) km s\({}^{-1}\)), 0.33043 (\(\Delta V\approx-4550\) km s\({}^{-1}\)), and 0.34292 (\(\Delta V\approx-1770\) km s\({}^{-1}\)), where the reddest and bluest clumps exhibit the strongest Mg ii and Ca ii absorption overall (see Fig. 2). In the following, we refer to these three complexes as \(A\), \(B\), and \(C\), in order of increasing redshift. Each complex has at least a few velocity components resolved by eye within its own profile. Weak absorption is also visible in Mg ii at \(z_{\rm abs}=0.3357\) (\(\Delta V\approx-3390\) km s\({}^{-1}\)), tentatively, also in Ca ii\(\lambda\)3934. Footnote 1: Based on Mg ii lines this system do not satisfy standard BAL definition Weymann et al. (1981), and should be attributed to the mini-BAL. However, C iv lines (that are typically used in BAL definition and usually indicate much wider profiles than Mg ii lines) out of the spectral range. Therefore, we will keep denaturation of this system as FeLoBAL, which is supported by example of Q 2359\(-\)1241(Arav et al., 2001), for which Mg ii lines indicate a similar width as in J 1652+2650, but HST observations confirm large width of C iv lines. Footnote 2: When selecting this quasar to search for intervening molecular absorption, we assumed the line-of-sight could intersect three galaxies (possibly located in a cluster hosting the quasar). It turns out that the gas is associated with the quasar active nucleus itself in spite of its low ionization. Fe ii,\(\lambda\lambda\)2586,2600 ground-state absorption lines as well as lines from the fine-structure energy levels of the two LS states 3d\({}^{6}\)4s \({}^{6}\)D (ground) and 3d\({}^{6}\)4s \({}^{4}\)D (second excited state, which is encompassing the Fe ii\({}^{98}\)-Fe ii\({}^{12}\) levels) are detected in this system (see Figs. 4, A2, A3, and A4). Transition lines from the first excited LS state 3d\({}^{7}\) \({}^{4}\)F (i.e., 5\({}^{\rm th}\) to 8\({}^{\rm th}\) excited levels above the ground state) are not covered by our spectrum, being located bluewards of the observed wavelength range. The Mn ii \(\lambda\lambda\lambda\)2576,2594,2606 triplet and Mn ii\({}^{\star}\) transition lines (i.e., \(\lambda\lambda\lambda\)2933,2940,2950) from the first excited level of Mn ii, with an excitation energy of 9473 cm\({}^{-1}\), are detected most clearly in the \(C\) (reddest) and \(A\) (bluest) clumps (see Fig. A5). Such transitions were detected before only in a few FeLoBALs (e.g., FBQS J 1151+3822; Lucy et al., 2014). Ca i\(\lambda\)4227 and CH\({}^{+}\lambda\lambda\)3958,4233 absorptions are not detected. Using the oscillator strengths of CH\({}^{+}\) lines from Weselak et al. (2009), we derive a 2\(\sigma\) upper limit on the column density of \(N({\rm CH}^{+})=10^{13}\) cm\({}^{-2}\) for each of the three complexes. We detect possible Na i emission lines in both the UVES and SDSS spectra. All absorption lines in the UVES spectrum were identified, except a weak line at \(\lambda_{\rm obs}=5341\) A, which has a similarly wide profile as the FeLoBAL lines. Searching an identification in the NIST database at the different BAL sub-redshifts did not provide any satisfactory solution, therefore it has likely spurious nature. ratio of the Mg ii doublet is expected to be \(\tau_{1}/\tau_{2}=f_{1}\lambda_{1}/f_{2}\lambda_{2}\approx 2\) (where \(f_{i}\) and \(\lambda_{i}\) are the line oscillator strengths and wavelengths, respectively), unless the lines are not fully saturated. One can see in Fig. 3 that in our case \(\tau_{1}/\tau_{2}\) is close to unity along the entire profiles, which, together with _seemingly_ saturated profiles, is evidence for partial flux covering. In the case of fully-saturated line profiles, partial covering factors (\(C_{f}\)) can be roughly determined as \(C_{f}\approx 1-e^{-\tau_{1}}\). Therefore, a value of \(\tau_{1}/\tau_{2}\) close to unity even in the line wings (where the optical depths \(\tau_{1,2}<1\)) indicates that partial covering is likely changing through the profile, which may additionally complicate line-profile fitting. Using the flux residuals observed at the bottom of the profiles (where \(\tau_{1}/\tau_{2}\approx 1\)), we derive upper limits on \(C_{f}\) of \(\sim 0.82\), \(0.68\), and \(0.96\), in complexes \(A\), \(B\), and \(C\), respectively. We also note that the Mg ii\(\lambda\lambda 2796,2803\) lines are not blended with each other, with the exception of the far wings of Mg ii\(\lambda 2803\) and Mg ii\(\lambda 2796\) in complexes \(A\) and \(B\), respectively. In addition, the velocity differences between complexes \(A\), \(B\), and \(C\), and the weaker complex at \(z\approx 0.3357\), do not correspond to any of the strong high-ionization line-doublet splitting, i.e., Si iv, C iv, N v, nor O vi. Therefore, line locking (see, e.g., Bowler et al., 2014) is not clearly present in this system. ### Voigt-profile fitting of Ca ii, Mg i, He i\({}^{\star}\), Fe ii, and Mn ii We performed simultaneous fits to Ca ii, Mg i, He i\({}^{\star}\), Fe ii and Mn ii absorption lines using multiple-component Voigt profiles. While even Ca ii\(\lambda\lambda 3934,3969\), Mg i\(\lambda 2852\), and He i\({}^{\star}\) (\(\lambda\lambda 2945,3188,3889\)) lines are located in spectral regions of high S/N, the weakness of some of the velocity components prevents us from fitting the lines individually. Additionally, Fe ii and Mn ii lines are significantly blended with each other, not only between components of a given complex (\(A\), \(B\), or \(C\)) but also between components pertaining to different complexes. Therefore, to obtain internally consistent fits, we tied the Doppler parameters in each component assuming them to be equal for each species. This implicitly assumes that turbulent broadening dominates over thermal broadening (micro-turbulence assumption), which is reasonable for the wide (FWHM \(>15\) km s\({}^{-1}\)) profiles of this system. As we mentioned, absorption lines from Fe ii and Mn ii in the UVES spectrum display a high degree of mutual blending and complexity, therefore, in order to remove possible degeneracies, we assumed that the Fe ii levels are populated by collision with electrons (as argued for the majority of previously-studied FeLoB-ALs (Korista et al., 2008; Dunn et al., 2010; Bautista et al., 2010; Byun et al., 2022). This assumption also minimizes the number of independent variables in the analysis. Thus, for each velocity component, the column densities of Fe ii levels are set by the total Fe ii column density, the electron density, and the temperature. The data for the strengths of collisions with electrons were taken from the CHIANTI 9.0.1 database (Dere et al., 2019) and the atomic data from the NIST database. We did not find any data for the collisional excitation of Mn ii levels. Therefore, we could not consider its exci Figure 2: Portions of the normalized UVES spectrum showing the kinematics of Mg ii (upper panel), Ca ii H and K, and He i\({}^{\star}\)\(\lambda 3889\) (lower panel) in the FeLoBAL towards J 1652+2650. The Mg ii absorption-line complex at \(z\approx 0.3357\) is much weaker than complexes \(A\), \(B\), and \(C\), and therefore is not included in the following Voigt-profile fitting analysis. In both panels, the top axis shows the velocity of the strongest transition, i.e., Mg ii\(\lambda 2796\) (upper panel) or Ca ii\(\lambda 3934\) (lower panel), relative to the quasar systemic redshift. tation together with Fe ii and hence we derived the column densities of the Mn ii and Mn ii\({}^{\star}\) levels, independently from Fe ii. The atomic data for He i\({}^{\star}\) and Ca ii were taken from Drake & Morton (2007) and Safronova & Safronova (2011), respectively. For lines from excited levels of Fe ii and Mn ii, we used the data from Nave & Johansson (2013), Schnabel et al. (2004), and Kling & Griesmann (2000), respectively. For other species, we used the atomic data compiled by Morton (2003). Similar to the analysis of Mg ii lines in Sect. 3.3, the apparent optical depth of the Ca ii (as well as Fe ii) lines indicates partial covering. Therefore, we need to include partial covering in the line-profile fitting procedure and for this we used the simple model proposed by Barlow & Sargent (1997; see also Balashev et al., 2011). Within this model, it is assumed that the velocity components with non-unity covering factors spatially overlap. If it were not the case, this would introduce additional covering factors to describe mutual overlapping (see, e.g., the discussion in Ishita et al., 2021). When many components are intertwined in wavelength space, this requires a significant increase in the number of independent variables for the analysis (up to the factorial of \(n\), where \(n\) is the total number of components). This complicates the analysis and makes the derived results ambiguous. Therefore, we made no attempt here to include mutual covering in the fitting procedure but rather tied the covering factors of all the components within the same complex (i.e., \(A\), \(B\), or \(C\)) to be the same. The model employed here therefore can only provide coarse estimates of the covering factors. The likelihood function was constructed using visually-identified regions of the spectrum that are associated with the lines to be fitted assuming a normal distribution of the pixel uncertainties. To obtain the posterior probability functions on the fit parameters (i.e., column densities, redshifts, Doppler parameters, and covering factors), we used a Bayesian approach with affine-invariant sampler (Goodman & Weare, 2010). We used flat priors on redshifts, Doppler parameters, covering factors, and logarithms of column densities. For the electron temperature (which is relevant for lines from the excited Fe ii levels), we used a Gaussian prior of \(\log T_{e}=4.2\pm 0.5\), corresponding to the typical electron temperatures of a fully-ionized medium, where excited Fe ii levels are highly populated (e.g., Korista et al., 2008). The sampling was performed on the cluster running \(\approx 100\) processes in parallel (using several hundred walkers) which typically took a few days until convergence. While this approach allows us to constrain the full shape of the posterior distribution function for each parameter, in the following we report the fit results in a standard way. The point and interval estimates correspond to the maximum posterior probability and the 0.683 credible intervals obtained from 1D marginalized posterior distribution functions. The results of Voigt-profile fitting are given in Table 1 and the modeled line profiles are briefly shown in Fig. 4, and fully displayed in Figs. A1, A2, A3, A4, and A5. The derived Doppler parameters span a wide range, from several up to two hundred \(\mathrm{km\,s}^{-1}\). The largest Doppler parameters found here should however be considered as upper limits only due to our inability to unambiguously resolve the line profiles in individual components owing to insufficient spectrum quality and few available transitions. While the column-density ratios between components are not drastically varied some trends likely appear. For example, the components in complex \(A\) have a much larger Ca ii-to-Mg i column-density ratio than the components in complexes \(B\) or \(C\). This likely indicates that the physical conditions vary from one complex to the other. Alternatively, this may indicate that the species under study are not co-spatial, which would weaken the assumption of identical Doppler parameters and location in velocity space for the considered species. Therefore, the derived uncertainties on the column densities should be considered with caution as they only describe uncertainties in a statistical sense. In complexes \(A\), \(B\), and \(C\), the covering factors, \(C_{f}\), are measured to be \(0.53^{+0.01}_{-0.01}\), \(0.24^{+0.01}_{-0.01}\), and \(0.81^{+0.01}_{-0.01}\), respectively, where again the quoted uncertainties should be considered with caution given the assumptions discussed above. The covering factors are mainly constrained by the Ca ii and Fe ii lines since the He i\({}^{\star}\) and Mn ii lines are weak (and hence are less sensitive to partial covering) and Mg i exhibits a single line. Therefore, the Mg i column densities reported in Table 1 are only reliable if the Mg i-bearing gas is co-spatial with Ca ii. One should also note Figure 3: _Top to Bottom_: Mg ii in absorption-line complexes \(A\), \(B\), and \(C\), at \(z_{\mathrm{abs}}=0.32531\), \(0.33043\), and \(0.34292\), respectively. _Upper insets in each panel_: Apparent optical-depth ratio of the Mg ii doublet. The regions where the lines are not apparently blended are highlighted in colour (blue, green, or red). The dashed and dotted horizontal lines correspond to the ratio expected in the cases of complete line saturation (\(\tau_{1}/\tau_{2}=1\)) and optically-thin lines (\(\tau_{1}/\tau_{2}=2\)), respectively. that the covering factors derived here are smaller than those found for Mg ii in Sect. 3.3. This indicates that the spatial extent of the Mg ii-bearing gas is larger than that of Ca ii and Fe ii. In Fig. 5, we plot the physical parameters derived using the lines from excited levels of Fe ii for velocity complexes \(A\), \(B\), and \(C\). We found that the electron densities in different components lie in the range \(n_{e}\approx[10^{2};10^{5}]\) cm\({}^{-3}\), which is expected given the detection of highly-excited levels (with energies \(\lesssim 10^{4}\) cm\({}^{-1}\)). Interestingly, the electron densities in complex \(A\) are found to be systematically higher than in \(B\) or \(C\). This suggests that complex \(A\) is located closer to the central engine in a harsher environment, which in turn is in agreement with the assumption that these complexes are produced in a decelerated-wind medium. We however note, that the line profiles are quite complex and therefore exact velocity decomposition is quite complicated in this system and hence our solution is not necessary to be unique. The electron temperature is found to be in the wide range \(T_{\rm e}\approx 10^{3.5}-10^{4.5}\) K, close to the observationally motivated chosen priors. This is not surprising since collisional population is less sensitive to the temperature than to the number density itself. Using the inferred electron densities (representing the number density, since the excited Fe ii originates from ionized gas (see, e.g., Korista et al., 2008), and the total column density of Fe ii one can derive the longitudinal extent of the absorbing clouds associated with each component, which we found to also span a wide range. When inferring this value, one should take into account the Fe gas abundances. If we assume a solar Fe ii abundance, we get characteristic values of about \(10^{15}\) and \(10^{15.5}\) cm for complexes \(A\) and \(B\), respectively, and a wide range of values for complex \(C\). These values should be considered as lower limits only, since neither the metallicity nor the Fe depletion, nor the Fe ii ionization correction, are known. Indeed, the depletion of Fe is much less than \(<1\) and a very sensitive function of metallicity, and Fe ii can be a subdominant form of Fe, even where excited Fe ii levels are populated (see, e.g., Korista et al., 2008). The ratio of Mn ii\({}^{\star}\) to Mn ii column densities was found to be around \(0.1-0.3\), similar to Fe ii, where complex \(A\) exhibits slightly higher excitation than Figure 4: _Left to Right:_ Voigt-profile fits to selected Ca ii, He ii\({}^{\star}\), Mg i, Mn ii, and Fe ii absorption lines in complexes \(A\) (Left), \(B\) (Middle), and \(C\) (Right), at \(z_{\rm abs}=0.3253\), \(0.3304\), and \(0.3429\), respectively, towards J 1652+2650. The coloured stripes show a 0.683 credible interval of the line profiles sampled from posterior probability distributions of fitting parameters. The yellow represents the total line profile, while the blue, green, and red lines indicate individual components from complexes \(A\), \(B\), and \(C\), respectively. The vertical lines show the positions of each component. Horizontal dashed lines and their surrounding grey areas indicate the extent of partial covering determined by fitting each clump independently with its own covering factor. The spectrum was rebinned to 0.1 Å scale for presentation purposes. Note the different y-axis scaling in each column. The original spectrum and all absorption-line profiles are displayed in Figs. A1, A2, A3, A4, and A5. complex \(C\) (Mn n\({}^{\bullet}\) is very unconstrained in complex \(B\)). If fitted individually, the covering factors derived here for each complex were found to be consistent between Ca ii and Fe ii, which indicates that Fe ii and Ca ii-bearing clouds likely have similar spatial extents. #### 3.4.1 On the possibility of UV pumping We tried to model the excitation of the observed Fe ii levels by UV pumping instead of collisions with electrons since the UV flux can be very high for gas in the vicinity of the central engine. To do this, we used the data of transition probabilities from the NIST database to calculate the excitation through UV pumping. We note that UV pumping can easily be incorporated into the fit only in the optically-thin regime (corresponding to \(\log N(\mathrm{Fe\,{\textsc{ii}}})\lesssim 13\)), which is not the case for most components. Therefore, a complex multiple-zone excitation model should be implemented that takes into account radiative transfer fully, since the UV excitation at some position depends on the line profiles, and therefore on the excitation balance at the regions closer to the radiation source. This implementation however is impractical for such a complex line-profile fitting as we have towards J 1652+2650. However, we can draw qualitative conclusions from the following two limiting cases: the optically-thin limit, or assuming constant dilution of the excitation using typically-observed column densities. In the optically-thin case, we found that UV pumping does not provide satisfactory fits, since it cannot reproduce the observed excitation of the Fe ii levels as well as collisional excitation can do. To qualitatively illustrate this, we plot in Fig. 6 the excitation of Fe ii levels as a function of electron density and UV field. The UV field is expressed in terms of distance to the central engine estimated from the observed \(r\)-band J 1652+2650 magnitude of 17.0 assuming a typical quasar spectral shape. One can see that the Fe ii excitation described by typically-estimated electron densities (for example, at \(n_{e}\approx 10^{4}\,\mathrm{cm}^{-3}\), which are shown by a dashed line in each panel of Fig. 6), corresponds to roughly a factor of two difference in distance (hence a factor of four difference in UV flux) that is needed to describe the fine-structure levels of the ground term (\(3\mathrm{d}^{6}4\mathrm{s}^{6}\mathrm{D}\), representing excited levels from 1\({}^{\mathrm{th}}\) to 4\({}^{\mathrm{th}}\)) and the second excited (\(3\mathrm{d}^{6}4\mathrm{s}^{4}\mathrm{D}\), representing excited levels from 9\({}^{\mathrm{th}}\) to 12\({}^{\mathrm{th}}\)) Fe ii term. From this diagram, one can see that if the excitation is described by UV pumping the absorbing gas must be located a few tens of parsec away from the central engine. However, if UV pumping dominates the excitation of the Fe ii levels, this results in very large values of the ionization parameter, \(\log U\gtrsim-1\), that is difficult to reconcile with the survival of Fe ii and other associated low-ionization species (e.g. Ca ii and Na i). Additionally, the observed column density of He i\({}^{\bullet}\) indicates \(\log U\approx-3\) for dense gas, which is discussed later in Sect. 4. All this indicates that UV pumping is unlikely to be the dominant excitation process at play in the gas. Using calculations in the optically-thick regime and assuming \(\log N(\mathrm{Fe\,{\textsc{ii}}})=14\) we found less disagreement in the UV fluxes required to populate the low and high Fe ii levels. However, the optically-thick case implies smaller distances to the central engine and hence even higher ionization parameters, in comparison to the optically-thin case. ## 4 Photo-ionization model We modelled the abundance of He i\({}^{\bullet}\) to estimate the physical conditions of the gas associated with this small-detached narrow/low-ionization BAL towards J 1652+2650. As discussed by, e.g., Arav et al. (2001) and Korista et al. (2008), the meta-stable \(2\,{}^{3}S\) level of He i\({}^{\bullet}\) is mostly populated through He ii recombination and depopulated by radiative transition and collisional de-excitation. Therefore, He i\({}^{\bullet}\) predominantly originates from a layer of ionized gas where helium is in the form of He ii and \(n_{e}\approx n_{\mathrm{H}}\), and the He i\({}^{\bullet}\) column density is sensitive to the number density and ionizing flux. In that sense, He i\({}^{\star}\) is an exceptional diagnostic of the physical conditions, almost independent of metallicity and depletion, unlike other metals. This is particularly relevant for the FeLoBAL under study since we can measure neither the abundance of H i nor the total abundance of any metal (i.e., only the singly-ionized state of each species is constrained), hence we have neither a measurement of metallicity nor metal depletion in this system. This limitation is also an is Figure 5: Comparison of physical parameters in velocity complexes \(A\), \(B\), and \(C\) (in blue, green, and red, respectively) towards J 1652+2650. The values are taken from Table 1, except \(\mathrm{[Fe/H]}\), which is the Fe gas-phase abundance relative to the solar. For presentation purposes, we only show the values that are reasonably well-constrained. In the lower panel, larger values of \(C_{f}\) correspond to larger covering factors. sue for most of the previously studied FeLoBAL systems, and the assumption of a particular metallicity value can significantly affect the physical conditions derived from the photo-ionization modelling (e.g., Byun et al.2022b). We used the latest public version of the Cloudy software package C17.02 (Ferland et al.2017) to model a slab of gas in the vicinity of the AGN. Our basic setup is a cloud of constant density that is illuminated on one side by a strong UV field with a typical AGN spectrum. We assumed a metallicity of 0.3 solar3, a characteristic value for such clouds, but we also checked that the exact metallicity value has little impact on the derived He i\({}^{\star}\) column densities. Temperature balance was calculated self-consistently. As a stopping criterion, we used a total Fe ii column density of \(10^{15}\,\rm cm^{-2}\) corresponding to the higher end of Fe ii column densities observed within the FeLoBAL components. Footnote 3: We took solar relative abundances of the metals, i.e. we did not use any depletion factor. While in the most known FeLoBALs the metallicity is found to be around solar value (e.g. Arav et al.2001; Aoki et al.2011; Byun et al.2022b), our chosen value 0.3 mimics possible Fe depletion, which typically large (up to 2 dex) at solar metallicity. We ran a grid of photo-ionization models by varying two main parameters: the number density and the ionization parameter, within the ranges of \(\log[1;6]\) and \(\log[-4;0]\), respectively. Fig. 7 shows the constraints on each parameter derived from the comparison of the modelled He i\({}^{\star}\) column density with the fiducial value of \(13.7\pm 0.1\), typical of high column-density components. One can see that the modelling provides estimates on the number of ionizing photons of \(\log(Un_{\rm H})\approx 0.5\) for \(\log n_{\rm H}\lesssim 4\), and \(\log U\approx-3\) for \(\log n_{\rm H}\gtrsim 4\). The latter solution to preferred value by the excitation of Fe ii, which provides an independent constraint on \(\log n_{\rm H}\approx 4\). Since the excited Fe ii levels predominately arise from the ionized medium (as they are excited by collision with electrons; see also Korista et al.2008), this suggests that \(n_{\rm e}\approx n_{\rm H}\) and hence likely, the He i\({}^{\star}\) abundance provides an estimate of \(\log U\sim-3\). While the exact value of \(\log U\) for each component depends on the observed He i\({}^{\star}\) column density, we refrain from using the latter because with such a modelling we cannot be confident regarding constrained Fe ii column densities, as mutual covering may impact the derived column densities. We also checked that the Cloudy modelling roughly reproduces the Ca ii, Mg i, and Mn ii column densities. However, as we mentioned above, using the abundance of these species is limited due to unconstrained total metallicities and depletion patterns. ## 5 Discussion ### Case of FeLoBAL towards Q 2359\(-\)1241 One of the most comprehensive studies so far of a FeLoBAL by means of high-resolution spectroscopy concerns Q 2359\(-\)1241 (Arav et al.2001). A broad and deep VLT/UVES spectrum of this quasar allowed Arav et al.(2008) to detect Fe ii lines up to the 8\({}^{\rm th}\) excited level (excitation energy of 7955 cm\({}^{-1}\)) above the ground state, and to constrain the physical conditions in the associated medium (Korista et al.2008). A sophisticated fitting model was used, describing partial covering of the source by the absorbing clouds based on a power-law distribution (see Arav et al.2008). In our present study, we used a model of uniform partial covering instead, \begin{table} \begin{tabular}{l c c c c c c c c c c c} \hline \hline \multicolumn{1}{c}{ Comp.} & z & \(\Delta v^{\dagger}\) & b & \(\log n\) & \(\log T\) & \(\log N_{\rm tot}({\rm Fe\textsc{ ii}})\) & \(\log N({\rm CaII})\) & \(\log N({\rm CaII})\) & \(\log N({\rm CaII})\) & \(\log N({\rm CaII})\) & \(\log N({\rm CaII})\) \\ & & [km s\({}^{-1}\)] & [km s\({}^{-1}\)] & [cm\({}^{-2}\)] & [K] & & & & & & & & \\ \hline \(A\), 1 & 0.324862(\({}^{+23}_{-15}\)) & -5778 & \(46^{+1}_{-5}\) & \(<2.9\) & \(>4.0\) & \(13.44^{+0.23}_{-0.24}\) & \(<10.6\) & \(13.48^{+0.08}_{-0.04}\) & \(<11.1\) & \(<11.3\) & \(<11.9\) & 0.531\({}^{+0.012}_{-0.008}\) \\ \(A\), 2 & 0.325195(\({}^{+14}_{-30}\)) & -5704 & \(43^{+1.8}_{-2.6}\) & \(4.28^{+0.11}_{-0.14}\) & \(3.9^{+0.1}_{-0.1}\) & \(14.60^{+0.05}_{-0.07}\) & \(12.90^{+0.05}_{-0.08}\) & \(13.90^{+0.04}_{-0.05}\) & \(12.39^{+0.07}_{-0.05}\) & \(13.26^{+0.07}_{-0.08}\) & \(12.33^{+0.13}_{-0.04}\) & \({}^{*}\) \\ \(A\), 3 & 0.3253100(\({}^{+30}_{-30}\)) & -5674 & \(290.0^{+1.2}_{-1.2}\) & \(>4.8\) & \(3.7^{+0.1}_{-0.1}\) & \(14.27^{+0.12}_{-0.12}\) & \(13.18^{+0.04}_{-0.08}\) & \(13.59^{+0.09}_{-0.04}\) & \(12.29^{+0.09}_{-0.06}\) & \(13.04^{+0.18}_{-0.18}\) & \(12.57^{+0.06}_{-0.06}\) & \({}^{*}\) \\ \(A\), 4 & 0.325432(\({}^{+17}_{-17}\)) & -5651 & \(181^{+7}_{-7}\) & \(4.55^{+0.08}_{-0.07}\) & \(4.4^{+0.2}_{-0.2}\) & \(14.69^{+0.02}_{-0.03}\) & \(13.54^{+0.09}_{-0.01}\) & \(13.59^{+0.04}_{-0.04}\) & \(12.57^{+0.04}_{-0.04}\) & \(13.23^{+0.14}_{-0.14}\) & \(12.56^{+0.11}_{-0.21}\) & \({}^{*}\) \\ \hline \(B\), 5 & 0.329670(\({}^{+30}_{-40}\)) & -4710 & \(125^{+14}_{-6}\) & \(3.7^{+0.3}_{-0.3}\) & \(3.9^{+0.3}_{-0.2}\) & \(14.91^{+0.10}_{-0.15}\) & \(12.97^{+0.06}_{-0.06}\) & \(13.55^{+0.07}_{-0.07}\) & \(12.83^{+0.05}_{-0.06}\) & \(13.29^{+0.10}_{-0.19}\) & \(12.89^{+0.10}_{-0.12}\) & \(0.235^{+0.011}_{-0.02}\) \\ \(B\), 6 & 0.330355(\({}^{+21}_{-21}\)) & -4559 & \(27^{+4}_{-4}\) & \(<2.1\) & \(>3.9\) & \(15.5^{+0.4}_{-0.5}\) & \(12.72^{+0.11}_{-0.15}\) & \(13.41^{+0.11}_{-0.16}\) & \(<12.1\) & \(<12.9\) & \(12.36^{+0.17}_{-0.23}\) & \( which is dictated by the observation of complex mutually-blended absorption-line profiles. In the case of Q 2359\(-\)1241, the line velocity structure is simpler, with only a few visually-distinct velocity components, and the lines are not significantly saturated. This allows one to independently constrain the column density in each Fe ii level and for each component, and then describe the population of Fe ii levels to constrain the excitation mechanisms. Additionally, due to its higher redshift, the FeLoBAL towards Q 2359\(-\)1241 allows one to constrain the column density of intermediate Fe ii levels with energies between 1872\(-\)3117 cm\({}^{-1}\) (corresponding to the a\({}^{4}\)F term of the 3d\({}^{7}\) configuration). We found that these levels are important to disentangle between radiative pumping and collisions with electrons. Certainly, such an independent determination of Fe ii column densities is more robust than tightening them assuming a dominant excitation mechanism, as we did for J 1652+2650. Therefore, we endeavoured to test our procedure by also fitting the FeLoBAL towards Q 2359\(-\)1241 using the spectrum taken from the SQUAD database (Murphy et al., 2019). To fit the Fe ii lines, we used an eight-component fit, out of which four components exhibit higher excitation and are mutually blended, and four components show a low level of excitation with only the first few excited levels above the ground state detected Bautista et al. (2010). We used the same Doppler parameters for all of the Fe ii levels in a given component. We added an independent covering factor to each component, yet tying the covering factor to be equal in two closely-associated weak components at \(z=0.8611\). The quasar continuum was re-constructed locally by interpolating the spectrum free from absorption features. We note that the continuum placement may be important for weak lines since the line profiles are fairly broad. The line-fitting procedure we used is the same as described for J 1652+2650 (see Sects. 3.4). The fitting results are listed in Table 2 and the modelled line profiles are shown in the Appendix, in Figs. A6 to A10. In comparison to the study of Arav et al. (2008) and Korista et al. (2008), we were able to identify a larger number of Fe ii levels, up to the 12th excited level of Fe ii (excitation energy of \(\sim\)8850 cm\({}^{-1}\)) above the ground state. We used the measured population of the Fe ii levels to constrain the physical conditions in the absorbing medium. We used the same model as for J 1652+2650, where we considered the competition between collisions (with electrons) and radiative excitation (by UV pumping). In Figs. 8 and 9, we show the excitation diagrams of the different Fe ii levels together with the constrained region of the parameter space of physical conditions, i.e., electron density, \(n_{\rm e}\), and UV field strength. As in Sect. 3.4.1, the UV field is expressed in terms of distance to the central engine as estimated from the \(r\)-band Q 2359\(-\)1241 magnitude of \(\sim 17.0\) assuming a typical quasar spectral shape (Selsing et al., 2016). The 2D posterior parameter distributions were obtained using the likelihood function assumed to be a product of individual likelihoods of the comparison between the modelled and measured Fe ii\({}^{4}\)/Fe ii ratios4. We also assumed Figure 6: Excitation of Fe ii levels as a function of electron density, \(n_{\rm e}\), and distance to the central engine, \(d\). The latter is calculated from the measured photometric flux of J 1652+2650 assuming a typical quasar spectral shape. Calculations were performed in the optically-thin limit, hence any constraint on the distance that can be obtained if UV pumping dominates the Fe ii excitation must be considered as an upper limit. Additionally, we plot lines of constant ionizing parameter, \(U\), calculated by scaling the UV flux and assuming bluewards of the Lyman limit an AGN spectrum with power-law shape with index \(-\)1.2. One can see that, for UV pumping to dominate the excitation of Fe ii levels, the ionizing parameter must be larger than 0.01. flat priors on \(\log n_{e}\) and \(\log d\) emulating a wide prior distribution for these two parameters. In Figs. 8 and 9, one can see that in the components that have a large enough number of measured Fe ii levels, the excitation is better reproduced by the model of collisions with electrons only, and therefore these components provide robust constraints on the electron density. For the components at \(\Delta v=-1325\), \(-1299\), and \(-1298\) km s\({}^{-1}\), we found \(n_{e}\) to be in the range between \(5\times 10^{3}\) and \(3\times 10^{4}\) cm\({}^{-3}\). For the other components, the constrained posterior does not indicate a preferable source of excitation leaving the physical conditions poorly constrained over a wide range. However, for the weaker and most-redshifted components at \(\Delta v>-1200\) km s\({}^{-1}\), the excitation of the Fe ii levels is less and if it were dominated by collisions this would result in a significantly lower electron density, \(\log n_{e}\sim 3.5\), than for the main components. In the three bluest components, where \(n_{e}\) is robustly measured, we can get an upper limit on the ionization parameter which was found to be \(\log U\lesssim-3\), \(-1.5\), and \(-2.5\) for the components at \(\Delta v=-1325\), \(-1299\), and \(-1298\) km s\({}^{-1}\), respectively. These values are reasonably consistent with the constraint of \(\log U\sim-2.4\) obtained from photo-ionization modelling of this system by Korista et al. (2008). It is also in line with the characteristic values we obtained in Sects. 3 and 4 in the case of the FeLoBAL towards J 1652+2650. In comparison with Korista et al. (2008) and Bautista et al. (2010), we derived significantly higher column densities for Fe ii levels in all components (except at \(-992\) km s\({}^{-1}\)) and total column density as well, which is dominated by the velocity components at \(-1325\) and \(-1299\) km s\({}^{-1}\). This discrepancy is explained by the small covering factors of these two components, which allow the lines to be significantly saturated. However, the relative excitation of the Fe ii levels even in these saturated components remains similar. Furthermore, the two central (in terms of apparent optical depth) components at \(-1298\) and \(-1256\) km s\({}^{-1}\) indicate an excitation structure consistent with the results of Korista et al. (2008). We \begin{table} \begin{tabular}{l c c c c c c c c} \hline \hline Comp. & \#1 & \#2 & \#3 & \#4 & \#5 & \#6 & \#7 & \#8 \\ \hline \(z_{\rm abs}\) & \(0.859761(^{+10}_{-16})\) & \(0.859922(^{+7}_{-7})\) & \(0.8599318(^{+14}_{-9})\) & \(0.860189(^{+6}_{-5})\) & \(0.861056(^{+11}_{-6})\) & \(0.861127(^{+26}_{-15})\) & \(0.8618265(^{+17}_{-7})\) & \(0.8626427(^{+13}_{-10})\) \\ \(\Delta v^{\dagger}\) [km s\({}^{-1}\)] & \(-1325\) & \(-1299\) & \(-1298\) & \(-1256\) & \(-1117\) & \(-1105\) & \(-992\) & \(-861\) \\ \(b\) [km s\({}^{-1}\)] & \(85.3^{+3.4}_{-1.9}\) & \(47.5^{+2.0}_{-1.8}\) & \(13.5^{+0.3}_{-0.3}\) & \(15.9^{+1.0}_{-1.2}\) & \(7.5^{+3.2}_{-1.5}\) & \(20.1^{+2.5}_{-3.1}\) & \(5.7^{+0.4}_{-0.4}\) & \(7.5^{+0.3}_{-0.3}\) \\ \hline \(\log N\)(Fe ii,g.s) & \(15.39^{+0.12}_{-0.06}\) & \(14.39^{+0.07}_{-0.04}\) & \(13.63^{+0.03}_{-0.03}\) & \(13.40^{+0.09}_{-0.17}\) & \(13.45^{+0.18}_{-0.18}\) & \(13.58^{+0.13}_{-0.17}\) & \(13.01^{+0.07}_{-0.10}\) & \(13.24^{+0.05}_{-0.04}\) \\ \(\log N\)(Fe ii,j1) & \(14.76^{+0.06}_{-0.07}\) & \(13.91^{+0.07}_{-0.05}\) & \(13.21^{+0.04}_{-0.04}\) & \(13.01^{+0.13}_{-0.15}\) & \(12.53^{+0.17}_{-0.25}\) & \(12.56^{+0.26}_{-0.55}\) & \(12.01^{+0.12}_{-0.12}\) & \(12.48^{+0.03}_{-0.06}\) \\ \(\log N\)(Fe ii,j2) & \(14.50^{+0.06}_{-0.07}\) & \(13.78^{+0.06}_{-0.09}\) & \(13.10^{+0.04}_{-0.04}\) & \(12.81^{+0.14}_{-0.14}\) & \(12.63^{+0.23}_{-0.29}\) & \(12.60^{+0.25}_{-0.58}\) & \(11.68^{+0.27}_{-0.39}\) & \(12.12^{+0.09}_{-0.09}\) \\ \(\log N\)(Fe ii,j3) & \(14.64^{+0.05}_{-0.18}\) & \(13.43^{+0.10}_{-0.05}\) & \(12.97^{+0.04}_{-0.03}\) & \(12.73^{+0.10}_{-0.13}\) & \(12.40^{+0.21}_{-0.42}\) & \(12.48^{+0.21}_{-0.96}\) & \(11.55^{+0.26}_{-0.33}\) & \(12.20^{+0.06}_{-0.09}\) \\ \(\log N\)(Fe ii,j4) & \(14.25^{+0.06}_{-0.08}\) & \(13.13^{+0.13}_{-0.14}\) & \(12.67^{+0.07}_{-0.03}\) & \(<12.5\) & \(<12.2\) & \(<11.2\) & \(<11.7\) & \(<11.5\) \\ \(\log N\)(Fe ii,j5) & \(15.33^{+0.10}_{-0.08}\) & \(14.26^{+0.10}_{-0.08}\) & \(13.70^{+0.08}_{-0.04}\) & \(13.22^{+0.32}_{-0.33}\) & \(<13.5\) & \(<13.7\) & \(12.64^{+0.19}_{-0.30}\) & \(<12.6\) \\ \(\log N\)(Fe ii,j6) & \(14.92^{+0.09}_{-0.09}\) & \(<13.5\) & \(13.29^{+0.07}_{-0.09}\) & \(<13.0\) &... &... &... &... \\ \(\log N\)(Fe ii,j7) & \(14.63^{+0.20}_{-0.16}\) & \(13.93^{+0.19}_{-0.31}\) & \(<13.1\) & \(<12.8\) &... &... &... &... \\ \(\log N\)(Fe ii,j8) & \(14.88^{+0.08}_{-0.11}\) & \(<12.8\) & \(<13.0\) & \(<12.2\) &... &... &... &... \\ \(\log N\)(Fe ii,j9) & \(14.02^{+0.12}_{-0.08}\) & \(<12.8\) & \(12.55^{+0.85}_{-0.05}\) & \(12.51^{+0.20}_{-0.30}\) &... &... &... &... \\ \(\log N\)(Fe ii,j10) & \(14.20^{+0.08}_{-0.06}\) & \(12.99^{+0.16}_{-0.12}\) & \(12.16^{+0.09}_{-0.12}\) & \(<11.8\) &... &... &... &... \\ \(\log N\)(Fe ii,j11) & \(13.75^{+0.12}_{-0.15}\) & \(<12.2\) & \(12.00^{+0.09}_{-0.15}\) & \(<11.3\) &... &... &... &... \\ \(\log N\)(Fe ii,j12) & \(13.46^{+0.09}_{-0.11}\) & \(<12.3\) & \(11.50^{+0.24}_{-0.54}\) & \(12.87^{+0.30}_{-0.44}\) &... ## 6 Discussion Figure 8: _Left panels_: Excitation diagrams of Fe ii levels in the FeLoBAL towards Q 2359 –1241. The y-axes indicate the ratio of the measured column density divided by statistical weight of i-th level to the ground level, while the x-axes provide the energy of the levels. The text in the upper part of each panel indicates the level terms. Each panel corresponds to a given velocity component as indicated in a green box on top of the panel. _Right panels_: Constrained physical conditions using the excitation of the Fe ii levels shown in the left panels. The solid and dashed lines correspond to the 1\(\sigma\) and 2\(\sigma\) confidence intervals of the 2D posterior probability function, respectively. The violet and red curves on the top x-axis and right y-axis, respectively, show the 1D marginalized probability functions. The red and violet hatched regions below them indicate the approximate solutions where the population of the levels is dominated by collisions or radiative excitation, respectively. For illustrative purposes, the corresponding regions of the excitation diagrams are shown in the left panels using the same colours and hatch code. Figure 9: Continuation of Fig. 8. note that determining the exact profile decomposition is not trivial in such systems. We attempted to increase the number of fitted velocity components in Fe ii lines but obtained more or less similar results, as additional components turned out to be weak if any. Moreover, the systematic uncertainty is most likely dominated by our choice of partial covering model, which is uniform with no mutual intersection (see Sect. 3.4). In terms of number density, we obtained similar results as Korista et al. (2008) who reported that \(\log n_{\rm H}\sim 4.4\pm 0.1\) considering total Fe ii column densities only and a smaller number of energy levels than we do. Overall, our approach (multi-component model with a uniform covering factor) provides well-consistent results with those from earlier works, especially for derived physical quantity. While FeLoBALs in most cases are quite complicated for spectral analysis, such systems as one towards Q 2359\(-\)1241 provide an important example and testbed for the assumptions (e.g. collisionally-dominated excitation) that can ease the analysis of more complex objects. ### Similarities and differences between FeLoBALs Previous studies indicate a wide range of physical conditions in FeLoBALs (and other intrinsic Fe ii absorbers) with some kind of bimodal distribution, where part of the population is located at mild distances of \(\sim 0.1-10\) kpc and has number densities of \(<10^{5}\) cm\({}^{-3}\), while the second part shows more extreme properties with number densities \(>10^{8}\) cm\({}^{-3}\) and distances to the nuclei down to \(\sim 1\) pc. This may be in line with state-of-the-art models of AGN outflows formation (Faucher-Giguere and Quataert, 2012; Costa et al., 2020), where the wind is a complex phenomenon that is driven by different mechanisms at different scales. It can be launched in the close vicinity of the accretion disk by radiative pressure and at a much larger distance by shocks, produced either by a wind from the accretion disk or the jet (e.g. Proga et al., 2000; Costa et al., 2020). On the other hand, we note that ionization parameters around \(-1..-3\) have been found for almost all detected FeLoBALs, while one would expect a wider range of values. This can be a selection effect, where such values of the ionization parameter are favourable for FeLoBAL observation. However, since \(U\propto n^{-1}d^{-2}\) the observed bimodality can be an artefact of improper constraints on the physical conditions from the modelling. Indeed, the modelling of FeLoBALs is quite complex and ambiguous, and there are many factors that cannot be resolved using line-of-sight observations. FeLoBALs always exhibit a multi-component structure, which makes the derivation of the physical conditions a difficult task, since several solutions are possible. A typical question arising from the photo-ionization modelling setup is what is the relative position in physical space of the "gaseous clouds" associated with each component? This impacts both the column density estimation, due to unknown mutual partial covering, and ionization properties, since the closest to AGN clouds will shield the farthest located ones. A relevant example of this situation is the FeLoBAL towards J 104459.6+365605, where Fe ii excitation and simplistic photo-ionization modelling suggest relatively low number densities, \(\log n_{\rm e}<4\), and a distance of \(\sim 700\) pc, while more sophisticated wind models (Everett et al., 2002), which take shielding effects into account, yield number densities \(10^{4}\) times higher, and a distance of \(\sim 4\) pc. We note however that in the latter model, the excitation of Fe ii levels is expected to be much higher than what is observed. In that sense, the usage of the excited fine-structure levels and He i* may provide less degenerated constraints than the relative abundances of the ions, the latter is also suffering from complications due to the unknown metallicity and depletion pattern (see discussion in Sect. 4). ### Relation between FeLoBALs and other intrinsic absorbers It is worth mentioning that a recently-identified class of associated quasar absorbers bearing H\({}_{2}\) molecules exhibits distances to the AGN of \(\sim 1-10\) kpc (Noterdaeme et al., 2019, 2021, 2023), slightly higher, but comparable to what is derived for FeLoBALs. Interestingly, while the medium in such systems is neutral (and even at the H i-H\({}_{2}\) transition), in contrast with FeLoBALs which arise in the ionized phase or at the boundary of the ionization front (e.g., Korista et al., 2008), they exhibit number densities of \(\gtrsim 10^{4}\) cm\({}^{-3}\), similar to FeLoBALs. In the case of H\({}_{2}\)-bearing systems, such number densities are required for H\({}_{2}\) to survive in the vicinity of the AGN (Noterdaeme et al., 2019) as the radiation fields are greatly enhanced. While in the case of J 1652+2650 we were not able to get constraints on the H\({}_{2}\) column density since the lines are out of the range of the spectrum, there is no H\({}_{2}\) detection in other FeLoBAL so far. Additionally, presented Cloudy modelling (given in Sect. 4) suggests that the column densities and ionization parameter are not enough in FeLoBAL towards J 1652+2650 to expect the presence of the H\({}_{2}\) in such kind of medium. Therefore, the difference between FeLoBALs and H\({}_{2}\)-bearing systems may be related to the lower ionization parameters of the latter (akin to higher lower incident UV flux, or to their larger distances), which makes it possible for H\({}_{2}\) to survive or imply reasonable timescales to form H\({}_{2}\). To elaborate on this we ran a grid of Cloudy models to see how the conditions for the presence of H\({}_{2}\) and excited Fe ii levels compared in the physical parameter space. We considered an isobaric model of the medium with 0.3 metallicity relative to solar (we additionally scaled the Fe abundance by 0.3 to emulate typical depletion at such metallicity) exposed by the AGN-shaped radiation field and regular cosmic ray ionization rate, \(2\times 10^{-16}\) s\({}^{-1}\) (for atomic hydrogen). We varied the ionization parameter and thermal pressure in ranges \(\log U=-6..0\) (with 0.2 dex step) and \(P_{\rm th}=10^{5}\).\(10^{10}\) [K cm\({}^{-3}\)] (with 0.5 dex step), respectively. We stopped the calculations either when the total H\({}_{2}\) or Fe ii column densities reached characteristic values of \(\log N({\rm H_{2}})=20\) or \(\log N({\rm Fe\,{\textsc{ii}}})=15\), respectively. The obtained contours of Fe ii excitation and the total H\({}_{2}\) column density are shown in Fig. 10. One can see that indeed, large H\({}_{2}\) column densities are found mostly outside the region of the parameter space where Fe ii is highly excited, i.e. \(\log{\rm Fe\,{\textsc{ii}}}^{*}/{\rm Fe\,{\textsc{ii}}}>-1\) (which is typical for the observed FeLoBAL systems), except only for the very high thermal pressures, \(P_{\rm th}\gtrsim 10^{9}\) K cm\({}^{-3}\) and low ionization parameters \(\log U\lesssim-4\). The presence of H\({}_{2}\) is mostly limited by the distances to the AGN, which in the case of J 1652+2650 corresponds to the values of several hundreds of pc\({}^{5}\). In turn, the values measured Fe ii*/Fe ii coupled with the constrained ionization parameter \(\log U\sim-3\) points to a low molecular fraction. We note that this modelling is indicative only, and one needs to be careful when comparing the measured excitation of the Fe ii levels with the modelled one in this simulation. Indeed, in this particular modelling case, we stopped at a relatively large total Fe ii column density, at which we may include a significant part of the neutral medium, where Fe ii excitation is not so high as in the ionized shell. The region in \(({\rm U},P_{\rm th})\) parameter space where H\({}_{2}\) is present in copious amount is adjacent to the region where Fe ii is reasonably excited (e.g. \(\log N({\rm Fe\,{\textsc{ii}}}^{*})/N({\rm Fe\,{\textsc{ii}}})>-1\)). That indicate that we may witness the appearance of a global natural sequence among associated absorbers. The behaviour of this sequence is probably coupled with hydrodynamics processes in the outflowing gas, which set the thermal pressures and the sizes of the clumps and their dependence on the distance. Likely, a part of this sequence was observationally noticed by Fathivavsari (2020), regarding Coronographic (Finley et al., 2013) and Ghostly (Fathivavsari et al., 2017) DLAs, which also exhibit high excitation of fine-structure levels6, but that do not show Fe ii\({}^{\star}\). The physical connection between these different classes of absorbers seems to be evident, with FeLoBALs representing predominantly gas at the ionization front, Coronographic and Ghostly DLAs being predominantly neutral, and associated H\({}_{2}\)-bearing absorbers tracing the H i-to-H\({}_{2}\) transition. Importantly, both the ionization and photo-dissociation fronts are controlled by the ratio of UV flux to number density, i.e., the ionization parameter, while the appearance of a certain class of absorber also depends on the ambient thermal pressure and the total column density of the medium. In that sense, it will be important to observe and study systems of intermediate classes, displaying mixed properties. The search for such rare systems will be supported by the upcoming next-generation wide-field spectroscopic surveys such as 4MOST (Krogager et al., 2023), DESI (Chaussidon et al., 2023), and WEAVE (Jin et al., 2023). Footnote 6: There are examples of similar associated systems with fine-structure excitation observed in the past, e.g., (Hamann et al., 2001). ## 6 Summary In this paper, we presented an analysis of the serendipitously-identified FeLoBAL system at z=0.3509 towards J 1652+2650 performed using a high-resolution UVES spectrum. The main aim was to derive constraints on the physical conditions in the absorbing medium located near the AGN central engine. The absorption system consists of three kinematically-detached absorption complexes spanning -1700 to -5700 km s\({}^{-1}\) relative to the QSO redshift. We detected lines profiles of Mg ii, Mg i, Ca ii, He i\({}^{\star}\), Mn ii and Fe ii. For, the latter species we detected lines from the various fine-structure levels of the ground and second excited electronic states, with energies up to \(\sim 8850\) cm\({}^{-1}\). The lines indicate a partial coverage of the continuum emission source, with a covering factor in the range from 0.98 to 0.2. A relatively simple kinematic structure (in comparison to the majority of known FeLoBALs) and an intermediate saturation allow us to perform joint multi-component Voigt profile fitting of the aforementioned species (except Mg ii) to derive column densities in the simplistic homogeneous partial coverage assumption. Using an additional assumption during the fit, that excitation of Fe ii levels dominated by the collisions with electrons, we obtained the constraints on the electron density in the medium to be \(\sim 10^{4}\) cm\({}^{-3}\) with \(\sim 1\) dex dispersion. We also detected the lines from the first excited level of Mn ii and constrained Mn ii\({}^{\star}\)/Mn ii column density ratios to be in the range from 0.1 to 0.5 across velocity components. However, the lack of collisional coefficients data for Mn ii did not allow us to use Mn ii excitation to infer the physical condition in the medium. Among the other elements detected in this FeLoBAL, He i\({}^{\star}\) is most important since it allows obtaining constraints on the combination of ionization parameter and number density, even without measurement of the hydrogen column density, metallicity and depletion pattern, which is the case of J 1652+2650. We used Cloudy code to model the characteristic column densities of He i\({}^{\star}\) and obtained a value of the ionization parameter \(\log U\sim-3\) assuming the number density derived from Fe ii. Such values are typically measured in FeLoBAL systems, which likely represents the similarity among them, while line profiles in FeLoBALs can be drastically different. With the estimate of the UV flux from J 1652+2650, this translates to a constraint on the distance between the absorbing medium and the continuum source of \(\sim 100\) pc. We also discuss the connection of FeLoBAL systems with other types of intrinsic absorbers, including Coronographic and recently identified proximate H\({}_{2}\)-bearing DLAs. The latter indicates a similar value of the number densities as measured in FeLoBAL, \(\gtrsim 10^{4}\) cm\({}^{-3}\). Using Cloudy modelling we showed that the FeLoBAL and H\({}_{2}\)-bearing proximate systems located in the adjacent regions in the parameter space, representing the main global characteristics of the medium: thermal pressure and ionization parameter (or the number density and the distance to the AGN, which are mutually interconnected to them). This indicates a global natural sequence among associated absorbers, where FeLoBALs represent predominantly gas at the ionization front, Coronographic DLAs are predominantly neutral, and associated H\({}_{2}\)-bearing absorbers trace the H i-to-H\({}_{2}\) transition. This likely will be comprehensively explored with upcoming next-generation wide-field spectroscopic surveys. This shall greatly enhance our understanding of AGN feedback and cool-gas flows from the AGN central engine. Figure 10: Constraints on the ionization parameter and thermal pressure from a grid of Cloudy photo-ionization models (for setup, see text). The violet colour gradient and dashed contours show the excitation of Fe ii, defined as \(\log N\left(\mathrm{Fe}\,\mathrm{ii}\right)/N\left(\mathrm{Fe}\,\mathrm{ii}\right)\). The characteristic range of Fe ii excitation observed in J 1652+2650 is shown by the hatched region. The red solid contours indicate the total H\({}_{2}\) column density, marked by values of \(\log N\left(\mathrm{H}_{2}\right)\). The blue dotted contours show the distance to the central engine calculated using the parameters of J 1652+2650. ## Data Availability The data published in this paper is available through Open Access via the ESO scientific archive, and in the SQUAD database (Murphy et al., 2019). The reduced and co-added spectra can be shared upon request to the corresponding author. ## Acknowledgements We thank the anonymous referee for constructive report, that significantly improved the paper. SAB acknowledges the hospitality and support from the Office for Science of the European Southern Observatory in Chile during a visit when this project was initiated. SAB and KNT were supported by RSF grant 23-12-00166. S.L. acknowledges support by FONDECYT grant 1231187.

2308.08930

Point-aware Interaction and CNN-induced Refinement Network for RGB-D Salient Object Detection

By integrating complementary information from RGB image and depth map, the ability of salient object detection (SOD) for complex and challenging scenes can be improved. In recent years, the important role of Convolutional Neural Networks (CNNs) in feature extraction and cross-modality interaction has been fully explored, but it is still insufficient in modeling global long-range dependencies of self-modality and cross-modality. To this end, we introduce CNNs-assisted Transformer architecture and propose a novel RGB-D SOD network with Point-aware Interaction and CNN-induced Refinement (PICR-Net). On the one hand, considering the prior correlation between RGB modality and depth modality, an attention-triggered cross-modality point-aware interaction (CmPI) module is designed to explore the feature interaction of different modalities with positional constraints. On the other hand, in order to alleviate the block effect and detail destruction problems brought by the Transformer naturally, we design a CNN-induced refinement (CNNR) unit for content refinement and supplementation. Extensive experiments on five RGB-D SOD datasets show that the proposed network achieves competitive results in both quantitative and qualitative comparisons.

Runmin Cong, Hongyu Liu, Chen Zhang, Wei Zhang, Feng Zheng, Ran Song, Sam Kwong

2023-08-17T11:57:49Z

http://arxiv.org/abs/2308.08930v1

# Point-aware Interaction and CNN-induced Refinement Network for RGB-D Salient Object Detection ###### Abstract. By integrating complementary information from RGB image and depth map, the ability of salient object detection (SOD) for complex and challenging scenes can be improved. In recent years, the important role of Convolutional Neural Networks (CNNs) in feature extraction and cross-modality interaction has been fully explored, but it is still insufficient in modeling global long-range dependencies of self-modality and cross-modality. To this end, we introduce CNNs-assisted Transformer architecture and propose a novel RGB-D SOD network with Point-aware Interaction and CNN-induced Refinement (PTCR-Net). On the one hand, considering the prior correlation between RGB modality and depth modality, an attention-triggered cross-modality point-aware interaction (CmPI) module is designed to explore the feature interaction of different modalities with positional constraints. On the other hand, in order to alleviate the block effect and detail destruction problems brought by the Transformer naturally, we design a CNN-induced refinement (CNNR) unit for content refinement and supplementation. Extensive experiments on five RGB-D SOD datasets show that the proposed network achieves competitive results in both quantitative and qualitative comparisons. Our code is publicly available at: _[https://github.com/rmcong/PTCR-Net_ACMM23_](https://github.com/rmcong/PTCR-Net_ACMM23_). salient object detection, RGB-D images, CNNs-assisted Transformer architecture, point-aware interaction + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: Footnote †: thanks: [ + Footnote †: [ local perception ability of the convolutional operation, the saliency results perform better in describing some local details (such as boundaries), but may be incomplete, such as the result of MVSalNet (Wang et al., 2017) in the first image of Figure 1. For the pure Transformer structure, since the Transformer can capture long-range dependencies, the integrity of the detection results is improved to a certain extent, but the patch-dividing operation may destroy the quality of details, induce block effects, and even introduce additional false detections, such as the result of VST (Wang et al., 2017) in Figure 1. The Transformer-assisted CNNs structure introduces the Transformer to assist CNNs for global context modeling, which can alleviate the shortcomings of the above single scheme by combining the two. However, in the process of decoding layer by layer, the convolution operation will gradually dilute the global information obtained by Transformer, so this scheme will still lead to the missing or false detection, such as the result of TriTransNet (Wang et al., 2017) in Figure 1. Therefore, in this paper, we rethink the relationship between Transformer and CNNs and propose a CNNs-assisted Transformer network architecture. Specifically, we utilize Transformer to complete most of the encoding and decoding process, and design a pluggable CNN-induced refinement (CNNR) unit to achieve content refinement at the end of the network. In this way, the Transformer and CNNs can be fully utilized without interfering with each other, thereby gaining global and detail perception capabilities and generating accurate and high-quality saliency map. For the cross-modality feature interaction issue, traditional feature interaction mechanism has raised great attention from computer vision and pattern recognition, even with successful achievements when the modality correspondance message is missing (Wang et al., 2017; Wang et al., 2017). Under the context of Transformer-based models, the cross-attention scheme (Wang et al., 2017; Wang et al., 2017) is a commonly used method. For example, the cross-modality interaction in vision-language task calculates similarities between different modalities by alternating queries and keys from vision and language modalities. Likewise, the cross-attention mechanism can also be directly applied to the RGB-D SOD task to model the relation between RGB and depth features, but there are two main challenges. First, unlike the relation between image and language, RGB image and depth map only have clear correlations in the features of the corresponding positions, so the above cross-attention approach is somewhat blind and redundant. Second, since the computational complexity is quadratically proportional to the size of the feature map, this undifferentiated all-in-one calculation will bring unnecessary computational burden. To address the above two issues, we propose a cross-modality point-aware interaction (CmPI) module, which simplifies the modeling process of cross-modality interactions by grouping corresponding point features from different modalities. In this way, the interaction of RGB and depth features is constrained to the same position, making it more directional and reducing the computational complexity to a linear level. In addition, we also introduce global saliency guidance vectors in CmPI to emphasize global constraint while conducting cross-modality interaction, making the interaction more comprehensive. Specifically, a two-step attention operation with well-designed mask constraints is used to achieve above cross-modality and global-local relation modeling process. In general, our paper makes three major contributions: * To take full advantage of both Transformer and CNNs, we propose a new CNNs-assisted Transformer architecture to achieve RGB-D SOD, denoted as PIGR-Net, which wins competitive performance against 16 the state-of-the-art methods on five widely-used datasets. * Considering the priori correlation between RGB modality and depth modality, we propose a cross-modality point-aware interaction module that dynamically fuses the feature representations of different modalities under global guidance and location constraint. * To alleviate the block effect and detail destruction problems caused by the Transformer architecture, we design a pluggable CNN-induced refinement unit at the end of the network to achieve content refinement and detail supplement. ## 2. Related Work In early days, the traditional RGB-D SOD methods (Chen et al., 2017; Chen et al., 2018; Wang et al., 2017) rely on hand-crafted features and have very limited performance. In recent years, thanks to the powerful feature representation ability of deep learning, a large number of learning-based RGB-D SOD models have been proposed. Before the launch of Vision Transformer in 2020 (Wang et al., 2017), the RGB-D SOD task still uses CNNs as the mainstream architecture, and various models (Chen et al., 2018; Chen et al., 2018; Wang et al., 2017; Wang et al., 2017; Wang et al., 2017; Wang et al., 2017; Wang et al., 2017; Wang et al., 2017) have been proposed in terms of cross-modality interaction, depth quality perception, and lightweight design, _etc._ For example, Zhang _et al._(Zhang et al., 2017) designed a cross-modality discrepant interaction strategy to achieve efficient integration in the RGB-D SOD task. Cong _et al._(Cheng et al., 2018) considered the quality of depth map in the RGB-D SOD task, and proposed a depth potentiality-aware gated attention network to address the negative influence of the low-quality depth map. Chen _et al._(Chen et al., 2018) stacked 3-D convolutional layers as encoder to achieve RGB-D SOD, which can fuse the cross-modality features effectively without dedicated or sophisticated module. Huang _et al._(Huang et al., 2019) performed cross-modal feature fusion only on one certain level of features rather than on all of the levels to form a lightweight model. As the Transformer shines in the computer vision field, some pure Transformer or a combination of Transformer and CNNs have emerged. Liu _et al._(Liu et al., 2017) designed a pure Transformer architecture for RGB-D SOD task from a new perspective of sequence-to-sequence modeling, in which the cross-attention are used for cross-modality interaction. Song _et al._(Song et al., 2018) fully used self-attention Figure 1. Visual comparison of representative networks with different architectures, where MVSalNet (Wang et al., 2017), VST (Wang et al., 2017) and TriTransNet (Wang et al., 2017) are the pure CNNs, pure Transformer, and Transformer-assisted CNNs architectures, respectively. and cross-attention for interaction between appearance features and geometric features in the RGB-D SOD task. Liu _et al_. (Liu et al., 2018) embedded the Transformer after the CNNs to model the long-range dependencies between convolutional features and achieve fusion at the same time. However, these existing pure CNNs or pure Transformer solutions also have some problems. For example, the CNNs-based methods are somewhat inferior in the ability to acquire global information to accurately locate salient objects, while the Transformer-based solutions are computationally intensive and susceptible to block effects. Although some methods using hybrid structure following Transformer-assisted CNNs architecture can alleviate the above concerns to some extent, the multi-layer convolutions during decoding can dilute the global information acquired by Transformers and affect the prediction performance. We should reconsider the role of Transformers and CNNs in the network, make full use of their respective advantages, and explore effective ways of cross-modality interaction. So we try to use a CNNs-assisted Transformer architecture to model global context and local details, and propose a point-aware interaction mechanism under location constraints to make cross-modality interaction more efficient and targeted. ## 3. Proposed Method ### Network Overview As shown in Figure 2, the proposed network follows an encoder-decoder structure as a whole. The top and bottom branches are the feature encoders for RGB image and depth map respectively, both of which adopt the shared-weight Swin-Transformer model (Liu et al., 2018), while the middle branch is the bottom-up decoding process. In each decoding stage, the cross-modality representation is firstly obtained by modeling the interaction relation at the same location of different modalities through the CmPI module. Thereafter, we use the Swin-Transformer-based decoding blocks to model the long-range dependencies of cross-modality features during decoding from a global perspective. Specifically, the cross-modality features \(f_{rd}^{i}\) generated by the CmPI module and the upsampled output features \(f_{decoder}^{i+1\uparrow}\) of the previous decoding stage (if any) are fed into two cascaded Swin-Transformer blocks to model the global relation: \[\begin{split}& f_{decoder}^{i}=\\ &\left(\begin{array}{l}Exp\left(ST\left[f_{rd}^{i}\right]\right),i=4\\ Exp\left(ST\left(Linear\left(cat\left(f_{rd}^{i}\right.f_{decoder}^{i+1 \uparrow}\right)\right)\right)\right),i=\{1,2,3\}\end{array}\right.,\end{split} \tag{1}\] Figure 2. The overall framework of the proposed PIGR-Net. First, RGB image and depth image are fed to a dual-stream encoder to extract corresponding multi-level features \(\{f_{r}^{i}\}_{i=1}^{4}\) and \(\{f_{d}^{i}\}_{i=1}^{4}\). Subsequently, the features of the same layer are multi-dimensionally interacted through cross-modality point-aware interaction module, where the previously output saliency map \(S_{i+1}\) is used to extract global guidance information. At the end of the network, the CNNR unit provides convolutional features with higher resolution and more detail from the pre-trained VGG16 model to refine and output the final high-quality saliency map \(S_{out}\). where \(cat\) means the concatenation operation in the feature dimension, \(Linear\) is the linear layer, \(ST\) represents two Swin-Transformer blocks, and \(Exp\) is the operation that converts features back to spatial resolution. Finally, at the end of the decoder, a pluggable CNNR unit is proposed to address the problems of block effect and detail destruction under the Transformer architecture at a low cost, and generate the final saliency map \(S_{out}\). ### Cross-modality Point-aware Interaction Module After extracting the multi-level encoding features of RGB modality and depth modality, how to achieve comprehensive interaction is an important issue that needs to be focused on in the encoding stage. The existing cross-modality interaction scheme under the Transformer architecture usually models the relation among all positions of two modalities. But as we all know, there is a corresponding relation between the RGB image and depth map itself, that is, the two modalities have a clear relation only at the corresponding position. As such, there is computational redundancy if the relation between all pixels of different modalities is modeled, and unnecessary noise may also be introduced due to this forced association modeling. Considering these, proceeding from reality of cross-modality modeling in RGB-D SOD task, we introduce the position constraint factors and propose a cross-modality point-aware interaction scheme, the core of which is to explore the interaction relation of different modality features at the same location through the multi-head attention. Compared with the direct combination of feature vectors, the multi-head parallel attention allows dynamic interaction of cross-modality features in different embedding spaces, enabling adaptive adjustment of the involvement of two modality features in different scenes. Moreover, in order to guide this interaction process from a global perspective and perceive the role of the current location in the overall feature map, we also add global saliency guidance vectors to the interaction process. Figure 3 depicts the most critical cross-modality point-aware Relation Modeling (RM) in the CmPI module. Let the point feature vectors corresponding to any location \((x,y)\) on the features of the RGB modality and depth modality be denoted as \(f_{r}^{i}(x,y)\in\mathbb{R}^{1\times c}\) and \(f_{d}^{i}(x,y)\in\mathbb{R}^{1\times c}\), where \(c\) is the embedding dimension. First, in order to provide a global guidance for the interaction process at each location, the saliency guidance vectors of two modalities are generated by using the upsampled side-output saliency map \(S_{i+1}^{\uparrow}\) decoded from the previous level, shared by all locations at the current scale in the computational process: \[g_{r}^{i}=MAP\left(f_{r}^{i},S_{i+1}^{\uparrow}\right),g_{d}^{i}=MAP\left(f_{ d}^{i},S_{i+1}^{\uparrow}\right), \tag{2}\] where \(MAP\) represents the masked average pooling (Zhou et al., 2017), and \(S_{i+1}^{\uparrow}\) is used as a weighting mask. Then, the RGB/depth features at location \((x,y)\) and the RGB/depth saliency guidance vectors together form a point-wise feature group \(Group^{i}(x,y)\in\mathbb{R}^{4\times d}\) with more comprehensive representation: \[Group^{i}(x,y)=Stack\left(f_{r}^{i}(x,y),f_{d}^{i}(x,y),g_{r}^{i},g_{d}^{i} \right), \tag{3}\] where \(Stack\) means to stitch features together into a new dimension. Afterwards, the interaction between point feature groups is performed by a relation modeling operation: \[\{\tilde{f}_{r}^{i}(x,y),\tilde{f}_{d}^{i}(x,y)\}=RM_{(x,y)}\left(Group^{i}(x,y)\right)\left[:2\right], \tag{4}\] where \(RM_{(x,y)}\) is the relation modeling operation between RGB and depth modalities at position \((x,y)\), which can be defined as: \[RM_{(x,y)}\left(f_{r}^{i},f_{d}^{i}\right)=Linear\left(cat\left(h_{1},\dots,h _{n}\right)\right), \tag{5}\] where \(\left\{h_{j}\right\}_{j=1}^{n}\) represent the attention output results of different heads, _i.e._, different feature spaces. The relation modeling operation is similar to the multi-head attention mechanism (Zhou et al., 2017), but there are also obvious differences: On the one hand, not all features within the feature group need to be interacted, such as between the guidance vector and features of different modalities (_i.e._, \(f_{r}^{i}(x,y)\) and \(g_{d}^{i}\), \(f_{d}^{i}(x,y)\) and \(g_{r}^{i}\)). Because they are in different scales and from different modalities, forcing interactions can have negative effects instead. Therefore, we introduce a carefully designed mask in attention operation to suppress such negative interactions. On the other hand, after the attention interactions within the feature group, the global vector is updated by other cross-modality global vectors as well as self-modality local vectors. To make better use of this information and emphasize the role of global-local guidance, we also perform a second-step global-local interaction in the self-modality using a new mask constraint. The above process can be expressed by the following formula: \[h_{j}=Attention\left(Attention\left(Group_{j}^{i}(x,y),M_{1}\right),M_{2} \right). \tag{6}\] In the first-step attention calculation, \(M_{1}\) is set to an anti-angle matrix with the value of -100.0, which allows the negative effects of the depth guidance vector on the RGB features and the RGB guidance vector on the depth features to be weaken during the interaction. Afterwards, the second-step attention operation follows, in which the global-local interaction within the self-modality is performed by setting \(M_{2}\) as the value in Figure 3, thereby strengthening the guidance of the global vectors on the local representation in the same modality. Specifically, the attention operation with the mask is performed as follows: \[Attention\left(Group_{j}^{i}(x,y),M\right)=softmax\left(\frac{Q_{j}K_{j}^{T}}{ \sqrt{d}}+M\right)V_{j}, \tag{7}\] where \(Q_{j}\), \(K_{j}\) and \(V_{j}\) are all generated by linear mapping from \(Group_{j}^{i}(x,y)\), and \(j\) is the index of the attention head. After the above process, the information of the two modalities can be fully interacted under the guidance of the saliency guidance vector, and finally the two features are combined by a linear layer as the final cross-modality features: \[f_{rd}^{i}(x,y)=Linear\left(cat\left(MLP\left(f_{r}^{i}(x,y)\right),MLP \left(f_{d}^{i}(x,y)\right)\right)\right), \tag{8}\] where \(MLP\) is the multi-layer perceptron. ### CNN-induced Refinement Unit At the output of the Transformer decoder, the main body of the salient object is basically determined, but due to the patch-dividing in the Transformer structure, the obtained saliency map may have problems of block effect and detail destruction. To this end, we propose a pluggable CNN-induced refinement unit at the end of the decoder. This is mainly inspired by the advantages of the CNNs in processing local details. Moreover, the feature resolution at this stage is larger, and the convolution operation is more reasonable in terms of the number of parameters and computational cost. Because the main purpose of this step is detail content refinement, there is no need to introduce the complete encoder-decoder network of CNNs, only the shallow features of the first two layers with rich texture details in VGG16 (Wang et al., 2017) are enough, denoted as \(V_{224}\) and \(V_{112}\). First, the decoder features \(f^{1}_{decoder}\) from the last Transformer layer are converted to pixel level and upsampled to same resolution as \(V_{112}\) in preparation for the following refinement: \[T_{112}=up\left(Basceconv\left(Exp\left(f^{1}_{decoder}\right)\right)\right), \tag{9}\] where \(Basceconv\) consists of a \(3\times 3\) convolution layer as well as a ReLu activation function following, and \(up\) represents upsampling operation. Thereafter, \(V_{224}\) and \(V_{112}\) are used for further recovery of resolution. Considering that simply using concatenation to fuse features can not effectively capture the detail information embedded in certain channels, we use the channel attention (Wang et al., 2017) to discover those important channels with detail information while preserving the main body of salient objects for adaptive fusion. The progressive refinement process can be expressed as follows: \[T_{224}=up\left(Basceconv\left(CA\left(cat\left(T_{112},V_{112}\right)\right) \right)\right), \tag{10}\] \[S_{out}=Basceconv\left(CA\left(cat\left(T_{224},V_{224}\right)\right)\right), \tag{11}\] where \(CA\) denotes the channel attention operation with residual connection, and \(S_{out}\) is the final saliency map. In the way, the fine-grained information from convolution can be supplemented for more accurate saliency map. ### Loss Function In order to obtain high quality saliency map with clear boundaries, the proposed entire network is supervised by a mixture of losses, including the commonly used binary cross-entropy loss, the SSIM loss for measuring structural similarity, and the intersection over union loss, of which combination is denoted as \(\ell_{base}\). The total loss of the network is defined as: \[\ell_{total}=\sum_{i=1}^{4}\frac{1}{2^{i}}\ell_{base}\left(S_{i},G_{i}\right)+ \ell_{base}\left(S_{out},G\right), \tag{12}\] \[\ell_{base}\left(S,G\right)=\ell_{bce}\left(S,G\right)+\ell_{ssim}\left(S,G \right)+\ell_{iou}\left(S,G\right), \tag{13}\] where \(G\) denotes the corresponding ground truth, and \(G_{i}\) is the side-output supervision, which is obtained by downsampling \(G\) to a suitable size. Note that the loss functions of the side outputs set smaller weights to guide the training process. ## 4. Experiments ### Datasets and Evaluation metrics Five widely used RGB-D SOD benchmark datasets are employed to evaluate the performance of our PCIR-Net. The NLPR dataset (Wang et al., 2017) is obtained by Kinect camera, which contains 1000 pairs of RGB images and depth maps from indoor and outdoor sences. Following (Wang et al., 2017; Wang et al., 2017), we adopt 2985 image pairs as our training data, including 1485 samples from NJU2K dataset, 700 samples from NLPR dataset, and 800 samples from DUT dataset. All the remaining images in these training datasets, as well as LFSD (Wang et al., 2017) and STERE1000 (Wang et al., 2017) datasets are used for testing. We adopt three commonly used metrics in SOD task to quantitatively evaluate the performance. F-measure (Wang et al., 2017) indicates the weighted harmonic average of precision and recall by comparing the binary saliency map with ground truth. MAE score (Beng et al., 2017) calculates the difference pixel by pixel. S-measure (Wang et al., 2017) evaluates the object-aware (\(S_{o}\)) and region-aware structural (\(S_{r}\)) similarity between the predicted saliency map and ground truth. Figure 3. The cross-modality point-aware RM in the CmPI module, where the RGB and depth features at the same spatial location and the global saliency guidance vectors from both modalities are interacted sufficiently and efficiently. ### Implementation Details The proposed network is implemented by the Pytorch and the Mind-Sore Lite tool1, and uses a single NVIDIA GeForce RTX 3090 GPU for acceleration. All the training and testing samples are resized to the size of \(224\times 224\) specified by Swin-Transformer. In addition, all depth maps are normalized and duplicated into three channels to fit the input size. Random flips and rotations are also used for data augmentation. During training, the encoder is initialized by parameters pre-trained on ImageNet. The Adam algorithm is used to optimize the proposed network with the batch size of 32. The initial learning rate is set to \(10^{-4}\), and a stepwise decay strategy is adopted, and every 40 epoch decays to one-fifth of the previous one. The entire training process contains 90 epochs. \begin{table} \begin{tabular}{c|c|c c c|c c c c|c c c c|c c c} \hline \hline \multirow{2}{*}{Method} & \multirow{2}{*}{PublYear} & \multicolumn{3}{c|}{**DUT-test**} & \multicolumn{3}{c|}{**LFSD**} & \multicolumn{3}{c|}{**NJU2K-test**} & \multicolumn{3}{c|}{**NLPR-test**} & \multicolumn{3}{c}{**STERE1000**} \\ \cline{3-14} & & \(MAE\downarrow\) & \(F_{B}\uparrow\) & \(S_{a}\uparrow\) & \(MAE\downarrow\) & \(F_{B}\uparrow\) & \(S_{a}\uparrow\) & \(MAE\downarrow\) & \(F_{B}\uparrow\) & \(S_{a}\uparrow\) & \(MAE\downarrow\) & \(F_{B}\uparrow\) & \(S_{a}\uparrow\) & \(MAE\downarrow\) & \(F_{B}\uparrow\) & \(S_{a}\uparrow\) \\ \hline DSAAF [(43)] & CVPR’21 & 0.030 & 0.930 & 0.922 & 0.055 & 0.889 & 0.883 & 0.040 & 0.907 & 0.904 & 0.024 & 0.906 & 0.919 & 0.036 & 0.907 & 0.905 \\ DCF [(24)] & CVPR’21 & 0.029 & 0.933 & 0.928 & 0.072 & 0.859 & 0.853 & 0.039 & 0.907 & 0.904 & 0.024 & 0.912 & 0.924 & 0.036 & 0.907 & 0.908 \\ DFM-Net [(55)] & MM’21 & 0.037 & 0.916 & 0.913 & 0.072 & 0.864 & 0.865 & 0.043 & 0.913 & 0.907 & 0.026 & 0.905 & 0.923 & 0.045 & 0.893 & 0.898 \\ BTS-Net [(56)] & ICME’21 & 0.048 & 0.889 & 0.894 & 0.071 & 0.868 & 0.865 & 0.035 & 0.927 & 0.925 & 0.023 & 0.917 & 0.931 & 0.038 & 0.910 & 0.913 \\ TriTransNet [(35)] & MM’21 & 0.025 & 0.944 & 0.933 & 0.066 & 0.870 & 0.866 & 0.030 & 0.926 & 0.919 & 0.021 & 0.921 & 0.929 & 0.033 & 0.911 & 0.908 \\ VST [(33)] & ICCV’21 & 0.024 & 0.947 & **0.943** & 0.054 & 0.892 & **0.890** & 0.035 & 0.919 & 0.922 & 0.023 & 0.917 & 0.932 & 0.038 & 0.907 & 0.913 \\ SP-Net [(59)] & ICCV’21 & 0.047 & 0.894 & 0.890 & 0.068 & 0.867 & 0.860 & **0.029** & 0.928 & 0.925 & 0.022 & 0.914 & 0.926 & 0.037 & 0.906 & 0.907 \\ CDNet [(26)] & TIP’21 & 0.029 & 0.934 & 0.930 & 0.061 & 0.879 & 0.877 & 0.036 & 0.918 & 0.918 & 0.023 & 0.919 & 0.929 & 0.038 & 0.907 & 0.909 \\ HANet [(31)] & TIP’21 & 0.034 & 0.927 & 0.919 & 0.072 & 0.862 & 0.859 & 0.038 & 0.910 & 0.910 & 0.025 & 0.905 & 0.921 & 0.038 & 0.909 & 0.909 \\ SPSN [(28)] & ECCV’22 & - & - & - & - & - & - & 0.032 & 0.920 & 0.918 & 0.023 & 0.910 & 0.923 & 0.035 & 0.900 & 0.907 \\ MVSalNet [(57)] & ECCV’22 & 0.034 & 0.924 & 0.916 & 0.073 & 0.861 & 0.858 & 0.036 & 0.914 & 0.912 & 0.022 & 0.921 & 0.930 & 0.036 & 0.911 & 0.913 \\ CCAFNet [(60)] & TMM’22 & 0.036 & 0.915 & 0.905 & 0.087 & 0.832 & 0.827 & 0.037 & 0.911 & 0.910 & 0.026 & 0.909 & 0.922 & 0.044 & 0.887 & 0.891 \\ RD3D [(1)] & TNN’22 & 0.029 & 0.936 & 0.931 & 0.074 & 0.854 & 0.858 & 0.037 & 0.914 & 0.915 & 0.022 & 0.916 & 0.930 & 0.037 & 0.906 & 0.911 \\ CIRNet [(8)] & TIP’22 & 0.029 & 0.938 & 0.932 & 0.068 & 0.883 & 0.875 & 0.035 & 0.928 & 0.925 & 0.022 & 0.921 & 0.933 & 0.039 & 0.913 & 0.916 \\ DCMF [(45)] & TIP’22 & 0.034 & 0.930 & 0.928 & 0.069 & 0.874 & 0.877 & 0.046 & 0.910 & 0.909 & 0.029 & 0.903 & 0.922 & 0.043 & 0.906 & 0.910 \\ JL-DCF [(18)] & TPAMI’22 & 0.039 & 0.916 & 0.913 & 0.071 & 0.862 & 0.863 & 0.040 & 0.913 & 0.911 & 0.023 & 0.917 & 0.926 & 0.039 & 0.907 & 0.911 \\ \hline OURS & - & **0.020** & **0.951** & **0.943** & **0.053** & **0.894** & 0.888 & **0.029** & **0.931** & **0.927** & **0.019** & **0.928** & **0.935** & **0.031** & **0.920** & **0.921** \\ \hline \hline \end{tabular} \end{table} Table 1. Quantitative comparison results in terms of S-measure (\(S_{a}\)), max F-measure (\(F_{\beta}\)) and MAE score on five benchmark datasets. \(\uparrow\)\(\)\(\&\) denote higher and lower is better, respectively. Bold number on each line represents the best performance. Figure 4. Visual comparisons between our PICK-Net and SOTA methods under different challenging scenes, such as small objects (_i.e._, a, c and d), multiple objects (_i.e._, c), low contrast (_i.e._, d and f), low-quality depth map (_i.e._, b and e), and uneven lighting (_i.e._, g). ### Comparisons with the State-of-the-arts To prove the effectiveness of our proposed PIGR-Net, we compare with 16 state-of-the-art models, including DSA\({}^{2}\)F (Wang et al., 2018), DCF (Wang et al., 2018), DFM-Net (Wang et al., 2018), TriTransNet (Wang et al., 2018), PTS-Net (Wang et al., 2018), VST (Wang et al., 2018), SDNet (Wang et al., 2018), CDNet (Wang et al., 2018), HANet (Wang et al., 2018), CCAFNet (Wang et al., 2018), RD3D (Chen et al., 2018), JL-DCF (Chen et al., 2018), SPSN (Wang et al., 2018), MVSalNet (Wang et al., 2018), CIRNet (Wang et al., 2018) and DCMF (Wang et al., 2018). Among these, VST (Wang et al., 2018) is a pure Transformer architecture, TriTransNet (Wang et al., 2018) is a Transformer-assisted CNNs architecture, and the rest are pure CNNs-based architectures. For a fair comparison, we utilize the saliency maps provided by the authors or obtained from official testing codes for evaluation. #### 4.3.1. Quantitative evaluation Table 1 intuitively shows the quantitative results of the proposed PIGR-Net on five widely used datasets, where the best performance is marked in bold. Our proposed method outperforms all comparison methods on these five datasets, except for the S-measure on the LFSD dataset. For example, compared with the second best method, the percentage gains of MAE score reach 16.7%, 1.9%, 9.5%, and 6.1% on the DUT-test, LFSD, NLPR-test, and STERE1000 datasets, respectively. Similar gains can be observed in other metrics. Inference speed has always been a key factor restricting the development and application of deep learning models(Wang et al., 2018). So we also evaluate the inference speed of our PIGR-Net and other typical SOTA models including Transformer-based model VST (Wang et al., 2018), TriTransNet (Wang et al., 2018) and advanced CNNs-based model SP-Net (Wang et al., 2018). As shown in Table 2, our model achieves better performance while also having an advantage in inference speed. However, our model has not yet achieved real-time efficiency, which is also a research point for further improving the inference speed of the Transformer-based model in the future. #### 4.3.2. Qualitative comparison Figure 4 provides some visualization results of different methods, including challenging scenarios with small objects (_i.e._, a, c and d), multiple objects (_i.e._, c), low contrast (_i.e._, d and f), low-quality depth map (_i.e._, b and e), and uneven lighting (_i.e._, g). As can be seen, our method not only accurately detects salient objects in those challenging scenarios, but also obtains better completeness and local details. It is worth noting that Transformer-based models (_i.e._, VST, TriTransNet, and our PIGR-Net) are able to model global dependencies and therefore tend to outperform the rest of the CNNs-based networks in terms of salient object localization. In addition, thanks to the well-designed cross-modality interaction, our network can fully extract information from the other modality to achieve accurate and complete prediction when the quality of the depth map is relatively poor (_e.g._, Figure 4(a) and (e)) or there is light and shadow interference in RGB image (_e.g._, Figure 4(g)). At the same time, because the CNNR unit provides more fine-grained detail information, compared with other methods, our method has more advantages in boundary accuracy and detail description (_e.g._, Figure 4(c), (d) and (g)). Both quantitative and qualitative experiments above demonstrate the effectiveness of our proposed method. ### Ablation Studies We conduct ablation experiments on the NJU2K-test and NLPR-test dataset to verify the role of each module in the proposed PIGR-Net. #### 4.4.1. Effectiveness of general structure First, in order to verify the role of the CmPI module, we design the following substitution experiments: * FULL (id 0) means our proposed full model PIGR-Net. * w/ addition (id 1), w/ multiplication (id 2) and w/ concatenation (id 3) respectively indicate that the CmPI module is replaced by element-level addition, multiplication, and concatenation operations to achieve interaction between RGB and depth features. * w/ cross-attention (id 4) means using traditional cross-attention (Wang et al., 2018) operation to replace RM in the CmPI module. As shown in Table 3, our designed CmPI module achieves better performance than other simple interaction strategies. Also, comparing id 0 and id 4, it can be found that our full model with CmPI module achieves better performance, and also outperforms cross-attention which brings more computational burden. Figure 5 provides some visualization results of different ablation studies. From the second image, it can be seen that low-quality depth map can negatively impact interactions using cross-attention, leading to object omission. In contrast, our method still detects salient objects accurately and completely. Besides, in order to verify the effectiveness of the Transformer-based decoder with CNNR unit, we design the following stripping experiments: * w/o TD (id 5) replaces Transformer-based decoder with equal number of convolution layers for saliency decoding. * w/o CNNR (id 6) removes the CNNR unit at the end of the decoder. As in Table 3, after the replacement for Transformer-based decoder, the F-measure scores on two datasets are decreased by 1.1% and 1.3%, respectively, demonstrating that using CNNs to complete decoding will dilute the global information extracted by the Transformer and reduce the performance. In addition, it can be found \begin{table} \begin{tabular}{c|c|c c|c c c} \hline \hline \multirow{2}{*}{Method} & \multirow{2}{*}{Speed (975)} & \multicolumn{3}{c|}{**NIP2K-test**} & \multicolumn{3}{c}{**NLPR-test**} \\ \cline{3-7} & & \(MAE\) & \(F_{B}\) & \(S_{M}\) & \(MAE\) & \(F_{B}\) & \(S_{M}\) \\ \hline TriTransNet & 16.38 & 0.030 & 0.926 & 0.919 & 0.021 & 0.921 & 0.929 \\ VST & 15.74 & 0.053 & 0.919 & 0.922 & 0.829 & 0.917 & 0.922 \\ SP-Net & 13.10 & **0.029** & 0.928 & 0.925 & 0.022 & 0.914 & 0.926 \\ \hline Ours & **21.29** & **0.029** & **0.931** & **0.927** & **0.019** & **0.928** & **0.935** \\ \hline \hline \end{tabular} \end{table} Table 2. Inference speed of our PIGR-Net and some typical SOTA methods. Black bold fonts indicate the best performance \begin{table} \begin{tabular}{c|c c c c c c} \hline \hline \multirow{2}{*}{Method} & \multirow{2}{*}{ID} & \multicolumn{3}{c|}{**NIP2K-test**} & \multicolumn{3}{c}{**NLPR-test**} \\ \cline{3-7} & & \(MAE\) & \(F_{B}\) & \(S_{M}\) & \(MAE\) & \(F_{B}\) & \(S_{M}\) \\ \hline FULL & 0 & **0.029** & **0.931** & **0.927** & **0.019** & **0.928** & **0.935** \\ \hline w/ addition & 1 & 0.038 & 0.907 & 0.909 & 0.023 & 0.914 & 0.925 \\ w/ multiplication & 2 & 0.035 & 0.918 & 0.916 & 0.022 & 0.918 & 0.927 \\ w/ concatenation & 3 & 0.033 & 0.921 & 0.918 & 0.024 & 0.912 & 0.925 \\ w/ cross-attention & 4 & 0.031 & 0.925 & 0.922 & **0.019** & 0.924 & 0.933 \\ \hline w/o TD & 5 & 0.034 & 0.921 & 0.919 & 0.022 & 0.916 & 0.928 \\ w/o CNNR & 6 & 0.031 & 0.925 & 0.923 & 0.820 & 0.923 & 0.933 \\ \hline \hline \end{tabular} \end{table} Table 3. Quantitative ablation evaluation of general structure. Black bold fonts indicate the best performance. in Figure 5 that CNNR unit contributes to the improvement of the boundary quality and the clarity of the saliency maps, which is also supported by the quantitative results. #### 4.4.2. Effectiveness of design detail Moreover, to verify the effectiveness of the detailed design of the CmPI module, we design the following experiments: * w/o RM (id 7) removes the key component RM in the CmPI module. * w/ single-step (id 8) means only keeping the first attention operation in RM, that is to say, the second-step attention calculation is removed. * w/o \(M_{1}\&M_{2}\) (id 9) removes the mask constraint in the calculation Eq. (6) of RM, that is, the \(M_{1}\) and \(M_{2}\) are removed. In addition, w/o \(M_{1}\) (id 10) and w/o \(M_{2}\) (id 11) represent the removal of only \(M_{1}\) and \(M_{2}\) respectively. * w/o \(g_{r/d}\) (id 12) removes the global guidance vector \(g_{r}\) and \(g_{d}\) in RM. * Win_3 (id 13) and Win_5 (id 14) mean that the window size for attention interaction in RM is adjusted from 1(point-aware) to 3 and 5, respectively. * \(1\times 1\) convolution (id 15) replaces RM with \(1\times 1\) convolution which is also point-aware operation. The related results are reported in Table 4. Overall, all ablation validations are inferior to our FULL model design. Specifically, if the entire RM module is removed, the performance loss is very obvious, as show in the result of id 7. In addition, the self-modality global-local guidance in the second-step attention (as shown in the result of id 8) and the suppression of negative interactions in RM (as shown in the result of id 9, 10 and 11) are both very necessary and effective. For the guidance vectors \(g_{r}\) and \(g_{d}\), after removing them, the performance drops, which also leads to worse object integrity as shown in Figure 6. For the interaction range of attention operations, enlarging the window size (3 or 5) does not obviously improve performance due to the strong correlation of positions, but brings exponential computational cost. We directly use \(1\times 1\) convolution to replace the CmPI module (for a fair comparison, guidance vectors are also introduced by expansion and concatenation), as shown in id 15 of Table 4. All metrics are reduced on both datasets, indicating that CmPI can achieve more comprehensive interaction than \(1\times 1\) convolution. ## 5. Conclusion Considering the respective characteristics and advantages of Transformer and CNNs, we propose a network named PICR-Net to achieve RGB-D SOD, where the network follows encoder-decoder architecture based on Transformer as a whole, and adds a pluggable CNNR unit at the end for detail refinement. Moreover, compared with the traditional cross-attention, our proposed CmPI module considers the prior correlation between RGB and depth modalities, enabling more effective cross-modality interaction by introducing spatial constraints and global saliency guidance. The comprehensive experiments demonstrate that our network achieves competitive performance against 16 state-of-the-art methods on five benchmark datasets. ###### Acknowledgements. This work was supported in part by National Natural Science Foundation of China under Grant 61991411, in part by the Taishan Scholar Project of Shandong Province under Grant tsqn202306079, in part by Project for Self-Developed Innovation Team of Jinan City under Grant 2021GXRC038, in part by the National Natural Science Foundation of China under Grant 62002014, in part by the Hong Kong Innovation and Technology Commission (InnoHK Project CIDDA), in part by the Hong Kong GRF-RGC General Research Fund under Grant 11203820 (CityU 9042598), in part by Young Elite Scientist Sponsorship Program by the China Association for Science and Technology under Grant 2020QNRC001, and in part by CAAI-Huawei MindSpore Open Fund. \begin{table} \begin{tabular}{c|c|c c c|c c c} \hline \multirow{2}{*}{Method} & \multirow{2}{*}{ID} & \multicolumn{3}{c|}{**NUTEX-test**} & \multicolumn{3}{c}{**NILPR-test**} \\ \cline{3-8} & & \(MAE\) & \(F_{B}\) & \(S_{M}\) & \(MAE\) & \(F_{B}\) & \(S_{M}\) \\ \hline FULL & 0 & **0.029** & **0.931** & **0.927** & **0.019** & **0.928** & **0.935** \\ \hline w/o RM & 7 & 0.035 & 0.914 & 0.916 & 0.023 & 0.919 & 0.928 \\ w/ single-step & 8 & 0.030 & 0.930 & 0.926 & 0.020 & 0.925 & 0.932 \\ w/o \(M_{2}\) & 9 & 0.022 & 0.923 & 0.921 & 0.021 & 0.921 & 0.929 \\ w/o \(M_{1}\) & 10 & 0.031 & 0.923 & 0.923 & 0.020 & 0.924 & 0.933 \\ w/o \(M_{2}\) & 11 & 0.030 & 0.927 & 0.925 & 0.020 & 0.923 & 0.932 \\ w/o \(g_{r/d}\) & 12 & 0.030 & 0.926 & 0.924 & **0.019** & 0.924 & 0.934 \\ Win_3 & 13 & **0.029** & 0.930 & **0.927** & 0.020 & 0.926 & 0.934 \\ Win_5 & 14 & **0.029** & 0.929 & 0.926 & 0.020 & 0.924 & 0.932 \\ \(1\times 1\) convolution & 15 & 0.031 & 0.926 & 0.922 & 0.020 & 0.924 & 0.932 \\ \hline \end{tabular} \end{table} Table 4. Quantitative ablation evaluation of detailed design in CmPI. Black bold fonts indicate the best performance Figure 5. Visual comparisons of different ablation studies. Figure 6. Qualitative comparisons of ablation studies on design detail in CmPI.

2305.07427

Ab-initio investigation of the physical properties of BaAgAs Dirac semimetal and its possible thermo-mechanical and optoelectronic applications

BaAgAs is a ternary Dirac semimetal which can be tuned across a number of topological orders. In this study we have investigated the bulk physical properties of BaAgAs using density functional theory based computations. Most of the results presented in this work are novel. The optimized structural parameters are in good agreement with previous results. The elastic constants indicate that BaAgAs is mechanically stable and brittle in nature. The compound is moderately hard and possesses fair degree of machinability. There is significant mechanical/elastic anisotropy in BaAgAs. The Debye temperature of the compound is medium and the phonon thermal conductivity and melting temperature are moderate as well. The bonding character is mixed with notable covalent contribution. The electronic band structure calculations reveal clear semimetallic behavior with a Dirac node at the Fermi level. BaAgAs has a small ellipsoidal Fermi surface centered at the G-point of the Brillouin zone. The phonon dispersion curves show dynamical stability. There is a clear phonon band gap between the acoustic and the optical branches. The energy dependent optical constants conform to the band structure calculations. The compound is an efficient absorber of the ultraviolet light and has potential to be used as an anti-reflection coating. Optical anisotropy of BaAgAs is moderate. The computed repulsive Coulomb pseudopotential is low indicating that the electronic correlations in this compound are not strong.

A. S. M. Muhasin Reza, S. H. Naqib

2023-05-12T12:50:21Z

http://arxiv.org/abs/2305.07427v1

**Ab-initio investigation of the physical properties of BaAgAs Dirac semimetal** ###### Abstract BaAgAs is a ternary Dirac semimetal which can be tuned across a number of topological orders. In this study we have investigated the bulk physical properties of BaAgAs using density functional theory based computations. Most of the results presented in this work are novel. The optimized structural parameters are in good agreement with previous results. The elastic constants indicate that BaAgAs is mechanically stable and brittle in nature. The compound is moderately hard and possesses fair degree of machinability. There is significant mechanical/elastic anisotropy in BaAgAs. The Debye temperature of the compound is medium and the phonon thermal conductivity and melting temperature are moderate as well. The bonding character is mixed with notable covalent contribution. The electronic band structure calculations reveal clear semimetallic behavior with a Dirac node at the Fermi level. BaAgAs has a small ellipsoidal Fermi surface centered at the G-point of the Brillouin zone. The phonon dispersion curves show dynamical stability. There is a clear phonon band gap between the acoustic and the optical branches. The energy dependent optical constants conform to the band structure calculations. The compound is an efficient absorber of the ultraviolet light and has potential to be used as an anti-reflection coating. Optical anisotropy of BaAgAs is moderate. The computed repulsive Coulomb pseudopotential is low indicating that the electronic correlations in this compound are not strong. **Keywords:** Density functional theory; Dirac semimetal; Elastic properties; Thermal properties; Optoelectronic properties ## 1 Introduction Experimental and theoretical studies of topological semimetals have become a major branch in the condensed matter physics research. These compounds are characterized by semimetallic electronic band structures with non-trivial band crossings which are protected by symmetries. Topological semimetals, with Dirac, Weyl, Nodal lines bulk band topological signatures [1, 2, 3, 4, 5, 6, 7, 8, 9]. Recently, a hexagonal ternary compound BaAgAs has been characterized experimentally [10] which crystallizes in the space group P6\({}_{3}\)/mmc (No.194) [11, 12]. First-principles calculations suggested that BaAgAs is a Dirac semimetal (DSM) with a pair of Dirac points lying on the C\({}_{3}\) rotation axis. Moreover potassium doping in BaAgAs can transform the system into a triple-point semimetallic (TPSM) state [11, 12, 13, 14]. A few other compounds having the same class of BaAgAs were also experimentally synthesized earlier, e.g., BaAgBi, SrCuBi, and SrAgBi. These compounds also show perfect DSM phase at ambient conditions [11, 12]. There is significant interest in DSM compounds because of their high charge carrier mobility, low carrier concentration, large magnetoresistance (MR) and chiral anomaly-induced negative MR. All these features are useful in electronics and spintronics device applications. In topological semimetals, specific states of electrons are topologically protected and are free from environmental perturbation. According to first-principles calculations, when the spin-orbit coupling (SOC) is ignored, the electronic band structure of BaAgAs hosts a broken-symmetry-driven topological state [15]. In contrast, when the SOC is incorporated, the nodal crossings become protected by the double point group representations at k points along the C\({}_{3}\) axis [10]. As far as the structure of BaAgAs in concerned, the planar mono-hexagonal layer is loosely occupied by the Ba atoms, while the planar honeycomb lattice is constructed by two different hexagonal sublattices that are occupied by the Ag and As atoms, alternately. For thermal transport studies, a low Gruneisen parameter is suggested by the phonon calculations. The BaAgAs compound with high lattice symmetry attains low thermal lattice conductivity due to the heavy element Ba in planar mono-hexagonal layer and large mass fluctuations in the Ag-As planar honeycomb sublattices [16]. The electronic properties of topological semimetals, like the gapless band structure can be used in photo detectors [17, 18, 19]. Fermi arc states for spintronics and structural materials [20, 21] and qubits [22, 23] and for nanoscale device applications in nanostructures. In recent studies the electronic band structure and magneto-transport properties of BaAgAs have been studied in some details [24, 25]. To the best of our knowledge, there are no available experimental or theoretical studies on the bulk elastic, mechanical, acoustic, bonding, optical, lattice dynamical and thermo-mechanical properties of BaAgAs yet. All these unexplored bulk properties are important to understand this compound better and to unlock its potential for applications in engineering and optoelectronic sectors. We aim to fill the significant research gap existing for this topological semimetal. We have calculated the elastic constants and moduli for the optimized crystal structure of BaAgAs. The important mechanical performance indicators like hardness and machinability index have been evaluated. The elastic/mechanical anisotropy parameters are estimated. The nature of chemical bonding has been reported. The electronic band structure and the Fermi surface topology have been revisited. The phonon dispersion curves have been calculated and the optical properties have been explored in details. Some thermo-mechanical parameters, pertinent to applications of BaAgAs are computed. Most of the results presented in this study are entirely novel. The rest of the paper has been arranged as follows. The computational methodology is described in Section 2. The results of the calculations are presented and discussed in Section 3. Section 4 consists of the conclusions of this work. ## 2 Computational scheme In this work all the calculations are performed by using the plane wave pseudopotential density functional theory (DFT) method as contained in the CAmbridge Serial Total Energy Package (CASTEP) [26, 27, 28]. The exchange-correlation terms are incorporated in the total energy by using the local density approximation (LDA) with the functional CA-PZ. The ground state of the crystalline solid is found from the solution of the Kohn-Sham equation [27]. For reliable results, selection of the atomic core pseudopotential is important. The pseudopotential gives the residual attractive interaction between an electron and an ion after taking into account the effective repulsion that arises from the exclusion principle demanding that valence states are orthogonal to the core electronic states. The on-the-fly generated (OTFG) ultrasoft pseudopotential has been used in the calculations [26, 27, 28]. The Broyden-Fletcher-Goldfarb-Shanno (BFGS) optimization method has been adopted to find out the ground state crystal structure. We have also used the density mixing [29]. The following valence electron orbitals are considered for Ba, Ag and As atoms, respectively: Ba [6s\({}^{2}\)6p\({}^{6}\)], Ag [4d\({}^{10}\)5s\({}^{1}\)] and As [4s\({}^{2}\)4p\({}^{3}\)]. The \(\Gamma\)-centered k-points have been considered in the reciprocal space (Brillouin zone). The convergence criteria for structure optimization and energy calculations were set to ultrafine quality with the k-points mesh of size 15\(\times\)15\(\times\)7 in the Monkhorst-Pack grid scheme [30] has been used for the sampling of the first Brilloun zone (BZ) of the hexagonal unit cell of BaAgAs. A plane wave basis with a cut off energy of 500 eV is used to expand the eigenfunctions of the valence and nearly valence electrons. Geometry optimization has been performed using self-consistent convergence limits of 5\(\times\)10\({}^{6}\) eV/atom for the energy, 0.01 eV/A for the maximum force, 0.02 GPa for the maximum stress and 5\(\times\)10\({}^{-4}\) A for maximum atomic displacement. The optical properties of BaAgAs have been evaluated using the electronic band structure for the optimum crystal structure. Further details regarding calculations of the optical parameters' spectra can be found in Refs. [26-28]. The single crystal elastic constants are obtained using the stress-strain method contained in the CASTEP. Thermal parameters have been studied with the help of various elastic constants and moduli. The phonon dispersion calculations are carried out using the perturbative linear response theory. In the electronic band structure calculations, we have not included the spin-orbit coupling (SOC). From a number of previous studies, we have found that the bulk physical properties of topological semimetals are fairly insensitive to the SOC, particularly for compounds where SOC are not very strong [31-34]. Inclusion of the SOC affects mainly the surface electronic states and some of the bulk electronic bands get splitted in energy. Previous electronic band structures for BaAgAs with and without SOC show that the energy splitting of the electronic bands are not that significant [10]. The chemical bonding natures of BaAgAs have been explored via the Mulliken population analysis (MPA) and the Hirshfeld population analysis (HPA). The details regarding MPA and HPA can be found elsewhere [26-28]. ## 3 Results and analysis ### Structural properties As mentioned earlier, the crystal structure of BaAgAs is hexagonal with space group P6\({}_{3}\)/mmc (No. 194). The schematic crystal structure of BaAgAs is shown in Figure 1. It is clear from the crystal structure that BaAgAs consists of alternative layers of Ba and AgAs along the c-axis. There are two AgAs layers in one unit cell. The AgAs layers form triangular lattices and are sandwiched between trigonal Ba layers along the c-axis [10,12]. The unit cell consists of six atoms in which there are two Ba atoms, two Ag atoms and two As atoms. The atomic positions and lattice parameters of the crystal are fully relaxed starting with the experimental values found in earlier studies (Table 1). The optimized lattice constants a (= b) and c obtained using the LDA calculations along with experimental lattice constants and other theoretical values are listed in Table 1. The positions of atoms in BaAgAs are as follows: Ba atoms are placed at the positions (0, 0, 0), the Ag atoms are at (1/3, 2/3, 3/4) and the As atoms are at (1/3, 2/3, 1/4) [10,12]. It is observed that the present values are close to the experimental ones [12,25]. Since optimization of the crystal geometry is one of the most crucial part in any ab-initio investigation, fair agreement between the computed and experimental lattice constants imply that the results obtained in this study are reliable [12,15,25]. It is seen from Table 1 that there are some scatter in the values of the lattice parameters obtained by different groups. As far as theoretical values are concerned, this is due to the use of different exchange-correlation functionals and/or computational set-ups. Generally, LDA underestimates the lattice constants due to overbinding of the atoms [26]. It is also instructive to note that the experimental values are often obtained at room temperature while the theoretical values are for the optimized crystal structure in the ground state (zero degree Kelvin). ### Elastic properties #### 3.2.1 The stiffness constants The mechanical properties of crystalline solids are determined by the single crystal elastic constants (C\({}_{\mathrm{ij}}\)). The possible mechanical applications of solids are limited by their elastic behavior. The elastic constants are connected with the structural features and atomic bonding characteristics of materials. The elastic constants also determine the mechanical stability of a solid. The bulk elastic behavior is understood from the polycrystalline elastic moduli. The compound under study is hexagonal and therefore, it has five independent elastic constants: C\({}_{11}\), C\({}_{12}\), C\({}_{13}\), C\({}_{33}\), and C\({}_{44}\). The \begin{table} \begin{tabular}{|c|c|c|c|c|} \hline Compound & a = b (Å) & c (Å) & c/a & Volume V\({}_{0}\)(Å)* & Ref. \\ \hline \multirow{6}{*}{BaAgAs} & 4.377 & 7.939 & 1.813 & 131.72 & [25]\({}^{\mathrm{lheo.}}\) \\ \cline{2-5} & 4.450 & 8.040 & 1.806 & 137.90 & [25]\({}^{\mathrm{exp.}}\) \\ \cline{2-5} & 4.561 & 8.419 & 1.845 & 151.67 & [15]\({}^{\mathrm{lheo.}}\) \\ \cline{2-5} & 4.521 & 8.281 & 1.832 & 147.02 & [15]\({}^{\mathrm{exp.}}\) \\ \cline{2-5} & 4.496 & 8.828 & 1.963 & 158.41 & [12]\({}^{\mathrm{exp}}\) \\ \cline{2-5} & 4.484 & 8.819 & 1.967 & 153.65 & This work \\ \hline \multicolumn{5}{l}{*Unit cell volume = (abc)sin60\({}^{0}\)} \\ \end{tabular} \end{table} Table 1: Calculated lattice constants a (= b) and c, c/a ratio, and equilibrium cell volume of hexagonal BaAgAs. Figure 1: Schematic crystal structure of BaAgAs. The crystallographic directions are shown and different atoms are presented in different colors. elastic constant C\({}_{66}\) is not independent as it can be expressed as: C\({}_{66}=\frac{\text{C}_{11}-\text{C}_{12}}{2}\). The mechanical stability conditions of a hexagonal crystal system are as follows [36, 37]. \[\text{C}_{11}>0;\,\text{C}_{11}>\text{C}_{12};\,\text{C}_{44}>0;\,\text{(C}_{11 }+\text{C}_{12})\text{C}_{33}\text{ - }2\text{(C}_{13})^{2}>0 \tag{1}\] All these conditions are satisfied by the computed C\({}_{\text{ij}}\)s of BaAgAs, and hence the compound under study is expected to be mechanically stable. We have also calculated the tetragonal shear modulus, given by, (C\({}_{11}\) - C\({}_{12}\))/2, for BaAgAs. The tetragonal shear modulus corresponds to a specific phonon vibration mode and is thus directional in nature. A positive value of this parameter indicates dynamical stability. Among the five independent elastic constants, C\({}_{11}\) and C\({}_{33}\) are the measures of stiffness along the a- and c-axes of the crystal, respectively. From Table 2 it is seen that C\({}_{11}>\) C\({}_{33}\), so the atomic bonding is much stronger along the a-axis than that along the c-axis of BaAgAs. Since both the elastic constants C\({}_{11}\) and C\({}_{33}\) are significantly larger than C\({}_{44}\), the linear compression along the crystallographic a- and c-axes is rather difficult in comparison with the shear deformation. The other three shear related elastic constants have values close to C\({}_{44}\). The elastic constant C\({}_{44}\) is linked to the hardness of a crystal and machinability index [38, 39]. Since no reported values of C\({}_{\text{ij}}\) are available for BaAgAs, we have compared the computed results with those of another isostructural Dirac semimetal BaAgP in Table 2. It is seen that all the elastic constants of BaAgAs are larger than those of BaAgP. Therefore, we expect that BaAgAs is harder than BaAgP. #### 3.2.2 Elastic moduli and parameters To calculate the polycrystalline elastic moduli B (bulk modulus), G (shear modulus), Y (Young's modulus), we have used the Voigt-Reuss-Hill formalism [41, 42, 43]. Further information on the widely used equations connecting the elastic moduli to the single crystal elastic constants can found elsewhere [44, 45, 46]. The results obtained are listed in Table 3. Smaller value of G compared to B (Table 3) indicates that the mechanical stability of BaAgAs will be controlled by the shear modulus. From the ratio between tensile stress and strain we get the Young's modulus, which is the measurement of the resistance (stiffness) of an elastic solid to a change in its length and provides with a measure of thermal shock resistance. There are other useful bulk elastic parameters, e.g., the Pugh's ratio (k), Poisson's ratio (\(\sigma\)), and the machinability index (\(\mu_{\text{M}}\)). All these parameters can be calculated using the following expressions: \[\text{k}=\frac{\text{B}}{\text{G}} \tag{2}\] \[\sigma=\frac{3\text{B}-2\text{G}}{6\text{B}+2\text{G}}\] (3) \[\mu_{\text{M}}=\frac{\text{B}}{\text{C}_{44}} \tag{4}\] \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|} \hline Compound & C\({}_{11}\) (= C\({}_{22}\)) & C\({}_{12}\) & C\({}_{13}\) (= C\({}_{23}\)) & C\({}_{33}\) & C\({}_{44}\) (= C\({}_{55}\)) & C\({}_{66}\) & Ref. \\ \hline BaAgAs & 131.86 & 43.61 & 35.08 & 76.35 & 33.87 & 44.12 & This work \\ \hline BaAgP & 115.80 & 31.10 & 22.80 & 71.30 & 30.40 & 42.30 & [40] \\ \hline \end{tabular} \end{table} Table 2: The calculated elastic constants, C\({}_{\text{ij}}\) (GPa), of BaAgAs in the ground state. The bulk modulus B shows the resistance to fracture and shear modulus G represents resistance to plastic deformation. The macro hardness (H\({}_{macro}\)) and the micro hardness (H\({}_{micro}\)) parameters of BaAgAs are also calculated using the following formulae [47, 48]: \[\mathrm{H}_{macro}=2[(\frac{G}{B})^{2}G]^{0.585}-3 \tag{5}\] \[\mathrm{H}_{micro}=\frac{(1-2S)Y}{6(1+S)} \tag{6}\] The Cauchy pressure, C\({}_{\mathrm{p}}\), is another important elastic parameter closely related to the bonding character and brittleness/ductility of crystalline solids. For hexagonal systems, C\({}_{\mathrm{p}}\)= (C\({}_{12}\) - C\({}_{44}\)). The computed elastic moduli and other elastic parameters are summarized in Table 3 below. In the absence of prior elastic data for BaAgAs, we have compared the values with those of BaAgP. The machinability index measures the level of plasticity and dry lubricity of a solid [49-51]. It also gives indication about the ease with which a solid can be cut into desired shapes. The machinability index of BaAgAs is high, comparable to many ternary MAX and MAB phase compounds which are promising materials for engineering structural applications [52-55]. This implies that the compound under consideration is machinable and has significant dry lubricity. Both the macro and micro hardness are moderate suggesting that the overall bonding strength in BaAgAs is not very strong. The Pugh's ratio determines the failure modes of materials. Solids having a Pugh's ratio greater than 1.75 are ductile in nature. If the Pugh's ratio is below this value, then the material is predicted to be brittle in nature [56]. The obtained value of Pugh's ratio of BaAgAs is 1.65 which is less than 1.75. Therefore, BaAgAs should show brittleness. The nature of bonding can be guessed from the value of the Poisson's ratio. The central force interactions dominate in solids when the value of Poisson's ratio lies between 0.25 to 0.50. For BaAgAs, the value of Poisson's ratio is 0.25 meaning that the chemical bonding has central force nature. Moreover, for a purely covalent crystal the value of Poisson's ratio is around 0.10 and for a crystal with dominant ionic/metallic bonding, the value of Poisson's ratio is around 0.33 [57]. Therefore, we expect some contribution of ionic/metallic bondings in BaAgAs. The value of the Poisson's ratio can also be used to determine brittleness/ductility. If \(\sigma\) is less than the critical value 0.26, then a material is predicted to be brittle; it will be ductile otherwise. The computed Poisson's ratio is 0.25 for BaAgAs indicating the brittle nature [58]. The Cauchy pressure can also be used to separate the materials into brittle or ductile category where the critical value of C\({}_{\mathrm{p}}\) is zero [59]. The obtained value of C\({}_{\mathrm{p}}\) of BaAgAs is positive; signifying that it is our material is ductile in nature. This contradicts the findings from the Pugh's ratio and the Poisson's ratio. The contradiction can arise from quantum many-body interactions among the atoms which are omitted in the formalism for Cauchy pressure and can lead to sign problem in solids which are situated at the borderline of ductile/brittle behavior. According \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|c|c|c|} \hline Compound & B & G & Y & \(\mu_{\mathrm{m}}\) & H\({}_{macro}\) & H\({}_{micro}\) & k & \(\sigma\) & C\({}_{\mathrm{p}}\) & Ref. \\ \hline BaAgAs & 60.64 & 36.72 & 91.65 & 1.79 & 6.05 & 6.16 & 1.65 & 0.25 & 9.74 & This work \\ \hline BaAgP & 49.20 & 35.00 & 85.00 & 1.62 & - & - & 1.41 & 0.21 & 0.70 & [40] \\ \hline \end{tabular} \end{table} Table 3: The computed bulk modulus B (GPa), shear modulus G (GPa), Young’s modulus Y (GPa), machinability index \(\mu_{\mathrm{M}}\), macro hardness H\({}_{macro}\) (GPa), micro hardness, H\({}_{micro}\) (GPa), Pugh’s ratio k (= B/G), Poisson’s ratio \(\sigma\) and the Cauchy pressure C\({}_{\mathrm{p}}\) (GPa) of BaAgAs. to Pettifor's rule [60], materials with positive Cauchy pressure have metallic bonds. Negative Cauchy pressure, on the other hand, suggests that the presence of angular bondings. The results presented in Table 3 are novel and therefore, no comparison with any other reported values can be made. Elastic moduli of BaAgAs are larger than those of BaAgP. BaAgAs is more machinable than the BaAgP compound. Both the compounds are expected to be moderately brittle in nature. #### 3.2.3 Elastic anisotropy Most of the crystalline solids are elastically anisotropic. Elastic/mechanical anisotropy depends on the atomic arrangements within the unit cell. Elastic anisotropy is connected to many important mechanical properties of solids which are related to their practical applications [21]. The elastic anisotropy of BaAgAs has been studied by means of different anisotropy indices. The Zener anisotropy factor (A) has been calculated using the relation [61]. \[\mathrm{A}=\frac{2\mathit{C}_{44}}{(\mathit{C}_{11}-\mathit{C}_{12})} \tag{7}\] This parameter quantifies the level of anisotropy in the elastic constants in a single crystal. For an isotropic crystal, \(\mathrm{A}=1\). Deviation from unity gives the measure of anisotropy. For BaAgAs, \(\mathrm{A}=0.76\), indicating that the compound is anisotropic. The shear anisotropy factors measure the anisotropy in bonding strengths among atoms situated in different crystal planes. There are three different shear anisotropy factors for hexagonal crystal. These factors can be computed from the following equations [61, 62]: \[\mathrm{A}_{1}=\ \frac{(\mathit{C}_{11}+\mathit{C}_{12}+2\mathit{C}_{33}-4 \mathit{C}_{13})}{6\mathit{C}_{44}} \tag{8}\] for \(\{100\}\) shear planes between \(<\)011\(>\) and \(<\)010\(>\) directions. \[\mathrm{A}_{2}=\frac{2\mathit{C}_{44}}{\mathit{C}_{11}-\mathit{C}_{12}} \tag{9}\] for \(\{010\}\) shear planes between \(<\) 101\(>\) and \(<\)001\(>\) directions. \[\mathrm{A}_{3}=\frac{\mathit{C}_{11}+\mathit{C}_{12}+2\mathit{C}_{33}-4 \mathit{C}_{13}}{3(\mathit{C}_{11}-\mathit{C}_{12})} \tag{10}\] for \(\{001\}\) shear planes between \(<\)110\(>\) and \(<\)010\(>\) directions. These factors, \(\mathrm{A}_{i}\) (\(\mathrm{i}=1\), \(2\), \(3\)), have the unit value for shear-isotropic crystals. Departure from unity quantifies the level of anisotropy in the shape changing deformation due to shearing stresses on different crystal planes. Calculated values are disclosed in Table 4. The directional bulk modulus along the a-direction and c-direction can be estimated by using the following relations [62]: \[\mathrm{B}_{\mathrm{a}}=\alpha\frac{\mathit{dP}}{\mathit{da}}= \ \frac{\mathit{L}}{(2+\mathit{a})} \tag{11}\] \[\mathrm{B}_{\mathrm{c}}=\ \alpha\frac{\mathit{dP}}{\mathit{dc}}= \frac{\mathit{B}_{\mathrm{a}}}{\mathit{a}}\] (12) \[\mathrm{where,}\ \ \Lambda=2(\mathrm{C}_{11}+\mathrm{C}_{12})+4 \mathrm{C}_{13}\alpha+\mathrm{C}_{33}\alpha^{2}\] (13) \[\mathrm{and}\ \ \ \alpha=\frac{(\mathit{C}_{11}+\mathit{C}_{12}-2 \mathit{C}_{13})}{(\mathit{C}_{33}+\mathit{C}_{13})} \tag{14}\] The linear compressibility along the a-axis (\(\gamma_{\rm a}\)) and c-axis (\(\gamma_{\rm c}\)) can be calculated using the following relations [62]: \[\gamma_{\rm a} = -\frac{1}{a}\left(\frac{\partial a}{\partial p}\right)=\frac{\left( \rm C_{33}-\rm C_{13}\right)}{\rm C_{33}(\rm C_{11}+\rm C_{12})-\rm 2C_{13}^{2}} \tag{15}\] \[\gamma_{\rm c} = -\frac{1}{c}\left(\frac{\partial c}{\partial p}\right)=\frac{\left( \rm C_{11}+\rm C_{12}-\rm 2C_{13}\right)}{\rm C_{33}(\rm C_{11}+\rm C_{12})-\rm 2C_{13}^{2}} \tag{16}\] The calculated values of \(\gamma_{\rm a}\) and \(\gamma_{\rm c}\) for BaAgAs are 3.77 \(\times\) 10\({}^{-3}\) GPa\({}^{\mbox{\scriptsize-1}}\) and 9.62 \(\times\) 10\({}^{-3}\) GPa\({}^{\mbox{\scriptsize-1}}\), respectively. These values indicate that the compressibility along the c-axis is more than double that of along a-axis. This is a clear indication that the atomic bonding strengths are much weaker along the c-axis. The ratio of the two linear compressibility coefficients along the a- and c- axes of hexagonal crystals, \(\frac{c_{\rm c}}{c_{\rm a}}\) is another useful parameter to understand the in-plane and out-of-plane anisotropy in the bonding strengths [61, 62]: \[\frac{c_{\rm c}}{c_{\rm a}}=\frac{\left(\rm c_{11}+\rm c_{12}-\rm 2c_{13} \right)}{\left(\rm c_{33}-\rm c_{13}\right)} \tag{17}\] All these anisotropy factors are evaluated and listed in Table 4. It should be noted that \(\rm B_{a}=\rm B_{c}\) for isotropic crystals and and \(\frac{c_{\rm c}}{c_{\rm a}}=1\), for the same. In the absence of any prior work on the elastic anisotropy of BaAgAs, we have presented some anisotropy results for isostructural BaAgP Dirac semimetal in Table 4 for comparison. Table 4 reveals that the shear anisotropy is significant in BaAgAs. The anisotropy in the bulk moduli is moderate. The level of elastic anisotropy in BaAgAs and BaAgP are roughly similar. ### Electronic Properties #### 3.4.1 Electronic band structure Electronic band structure is one of the most important aspects of materials which control all the electronic and optical properties. It also gives information regarding atomic bonding in a crystal and stability of a material [63]. The bulk electronic band structure as a function of energy (E-E\({}_{\rm F}\)) along the high symmetry directions in the Brillouin zone (BZ) is calculated in the ground state and is shown in Figure 2. The Fermi level (E\({}_{\rm F}\)) is indicated by the horizontal broken line which has been set at zero eV. The compound is semi-metallic due to weak crossing of the energy band of the Fermi level around the G-point. This weak crossing implies that the compound has small Fermi sheet centered at the G-point. The Dirac node touching the Fermi level at the G-point (along the K \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|c|c|c|} \hline Compound & A & A\({}_{1}\) & A\({}_{2}\) & A\({}_{3}\) & B\({}_{\rm a}\) & B\({}_{\rm c}\) & \(\gamma_{\rm a}\) & \(\gamma_{\rm c}\) & Ref. \\ \hline BaAgAs & 0.76 & 0.92 & 0.76 & 0.70 & 187.34 & 198.24 & 3.77 & 9.62 & 2.55 & This work \\ \hline BaAgP & 0.71 & - & - & - & - & - & 5.14 & 10.74 & 2.08 & [40] \\ \hline \end{tabular} \end{table} Table 4: Zener anisotropy factor (A), Shear anisotropy factors (A\({}_{1}\), A\({}_{2}\) and A\({}_{3}\)), directional bulk moduli (B\({}_{\rm a}\), B\({}_{\rm c}\) in GPa), linear compressibility coefficients (\(\gamma_{\rm a}\), \(\gamma_{\rm c}\) in 10\({}^{-3}\) GPa\({}^{\mbox{\scriptsize-1}}\)) and ratio of the linear compressibility coefficients \(\frac{c_{\rm c}}{c_{\rm a}}\) of BaAgAs. G-M line) conforms the topological electronic state. The conduction bands show both electron- and hole-like energy dispersions. The bands close to the Fermi level are due to the Ba-5s, Ag-4s, Ag-4p and As-4s, As-4p electronic orbitals. #### 3.4.2 Electronic energy density of states (DOS) The electronic energy density of states (DOS) is defined as the number of available electronic states per unit energy per unit volume. It is related to the first derivative of the energy dispersion curves E(k) or band structures with respect to momentum (k). DOS is inversely proportional to this derivative, i.e., the DOS is small where the derivative is large and vice versa. On the other hand, the effective mass of electrons or holes is directly proportional to the inverse of the second derivative of E(k). Large number of charge transport, optoelectronic, and magnetic properties of materials are directly determined by the DOS close to the Fermi energy. In this section, the total and partial densities of states (PDOS and TDOS, respectively) of BaAgAs are calculated from the electronic band structure results. The PDOS and TDOS plots are given in Fig. 3. The vertical broken line indicates the Fermi level. The non-zero value of TDOS at the Fermi level confirms that BaAgAs will exhibit metallic electrical conductivity. To investigate the contribution of each atom to the TDOS of BaAgAs, we have shown the PDOS of electrons in Ba, Ag and As atoms separately. The TDOS value at the Fermi level is 0.667 states/eV-formula unit. This small value of the TDOS suggests semimetallic character of BaAgAs. The large peaks in the TDOS in the valence band centered at -1.47 eV and at 3.94 eV in the conduction band are principally responsible for the charge transport and optoelectronic properties of BaAgAs. These two peaks are due to the Ag-4s, Ag-4d, As-4p and Ba-4d electronic states. The overall contribution of the electronic states of the As atom in the energy range shown in Fig. 3 is quite small. The Fermi Figure 2: Electronic band structure of BaAgAs in the ground state. The dashed horizontal line marks the Fermi energy (set to 0 eV). level is located quite close to the pseudogap separating the bonding and the antibonding peaks. This suggests that BaAgAs has high structural stability. One can estimate the degree of electronic correlation in BaAgAs using the TDOS at the Fermi level, N(E\({}_{\rm F}\)). The repulsive Coulomb pseudopotential, V\({}_{\rm c}\), is a measure of the electronic correlation which is related to N(E\({}_{\rm F}\)) as follows [64]. \[{\rm V_{c}=0.26N(E_{F})/[1+N(E_{F})]} \tag{18}\] The calculated value of V\({}_{\rm c}\) turns out to be 0.104. This shows that electronic correlation is not strong in BaAgAs. #### 3.4.3 Electronic charge density distribution The charge distribution around each atom in the crystal is very important to understand the bonding nature. In this section we have studied the electronic charge density distribution in different crystal planes of BaAgAs. The electronic charge density distribution of BaAgAs in the (111) and (001) planes are given in Fig. 4. The color scale shown on the right hand side of the panels represents the total electron density. The blue color indicates the high charge (electron) density and the red color indicates the low charge (electron) density. The charge density maps show mixed character of chemical bondings. In the (111) plane, there is significant directional accumulation of electronic charge in the Ag atom. The same behavior is found for the As atom in the (001) plane. The charged contours around the Ag and As atoms are not completely circular, indicating that both ionic and covalent contributions are present. There is charge depletion in between As and Ag atoms in the (001) plane. The charge distribution around the Ba atom located in between the As and Ag atoms Figure 3: Total and partial electronic densities of states (TDOS and PDOS) of BaAgAs in the ground state. are severely distorted and shows strong directionality in the (001) plane. Similar distortion is also seen for the Ba atom in the (111) plane. The charge accumulation in between the As and Ag atoms in the (111) plane are indicative of weak covalent bonding. From the charge density maps of BaAgAs in both the planes, we can see that Ag and As atoms have high electron density compared to the Ba atoms. The low charge concentration for the Ba atoms implies that the uniform background charges (the red region) probably come primarily from the Ba electrons in the conduction band. #### 3.4.4 Fermi surface The Fermi surface of BaAgAs is shown in Fig. 5. From the band structure of BaAgAs we have found just one band crossing the Fermi level. This band contributes to the single sections of the Fermi surface centered on the G-point in the reciprocal lattice. Weak crossing leads to a small Fermi surface and implies that the electrical and electronic thermal conductivity of the Dirac semimetal BaAgAs should be quite low. The Fermi sheet enclosing the central ellipsoid has electronic character. The shape of the ellipsoid suggests that the energy dispersion is much stronger in the ab-plane compared to that along the c-axis. This in turn implies that there is anisotropy in the effective mass of the electrons traveling in the ab-plane and perpendicular to the ab-plane. Figure 4: The electronic charge density distribution map for BaAgAs in the (a) (111) and (b) (001) planes. The color scale on the left quantifies the amount of charge (in unit of electronic charge). ### Phonon dynamics and acoustic properties #### 3.5.1 Phonon dispersion curves and phonon density of states The characteristics of phonons are important for the understanding of physical properties of crystalline materials. Phonons are the energy quanta of lattice vibrations. Large number of electrical, thermal, elastic, and lattice dynamical properties of crystalline solids are dependent on the phonon spectrum. The phonon spectrum is determined by the crystal symmetry, stiffness constants and mass of the constituent atoms [65, 66, 67]. The electron-phonon interaction function is directly related to the phonon density of states (DOS). From phonon dispersion spectra (PDS) we can determine the structural stability, indication of possible structural phase transition and thermal properties of a solid. By using the linear perturbative approach [28], we have calculated the phonon dispersion spectra (PDS) and phonon density of states (PHDOS) of BaAgAs compound along the high symmetry directions of the first Brillouin zone which have been shown in Fig. 6. Since all the phonon modes within the first BZ are positive for BaAgAs, the compound is dynamically stable. The speed of propagation of an acoustic phonon, which is also the sound speed in the lattice, is given by the slope of the acoustic dispersion relation, \(\tilde{\omega}\omega/\tilde{\omega}\)k. At low values of k (i.e. in the long wavelength limit), the dispersion relation is almost linear, independent of the phonon frequency. This behavior does not hold at large values of k, i.e. for short wavelengths. These short wavelength phonon modes are generally the optical modes. Figure 5: Fermi Surface of BaAgAs. The symmetry directions in the Brillouin zone are shown. The acoustic and optical branches of BaAgAs are separated by a frequency gap. The lower branches in phonon dispersion spectra are the acoustic branches and the upper branches represent the optical branches. The acoustic branches are created for in-phase movements of the atoms of the lattice about their equilibrium positions. The acoustic modes at G-point have zero frequency. It is a sign of dynamical stability of the studied compound. The optical properties of crystals are mainly controlled by the optical branches [68]. The high PHDOS regions for the acoustic branches at low phonon frequencies contribute significantly in the thermal transport. We have calculated the total density of phonon states (the right panel of Fig. 6). The PHDOS can be divided into three regions: acoustic modes lower optical modes and upper optical modes. The heavy Ag atoms mainly contribute to the acoustic phonon modes. Lower optical modes contain the contribution of all the atoms. But only the As atom contributes to the upper optical modes. This is expected because As atom is lighter than other atoms. Optical phonons are out-of-phase movements of the atoms in the lattice, one atom moving to the left, and its neighbor to the right. This can only happen if the lattice basis consists of two or more atoms. These modes are called optical because in ionic solids, fluctuations in atomic displacement create an electrical polarization that couples to the electromagnetic field. Thus, these vibrational modes can be excited by infrared radiation. The highest energy phonon dispersion branches of BaAgAs are due to the vibration of light As atoms in the crystal. It is observed that the PHDOS is quite high around the frequency of 5.35 THz in the optical region (Fig. 6). These phonons are expected to play significant role in determining the optical properties of BaAgAs. Figure 6: Calculated (a) phonon dispersion spectra and the (b) PHDOS for BaAgAs compound at zero pressure. #### Acoustic properties The sound velocity through a material is very important parameter to determine the thermal and electrical behaviors. The average sound velocity in solids, \(\mathrm{v_{m}}\), is related to the shear modulus (G) and bulk modulus (B). The \(\mathrm{v_{m}}\) is given by the harmonic mean of the average longitudinal and transverse sound velocities, \(\mathrm{v_{i}}\) and \(\mathrm{v_{t}}\), respectively. The relevant relations are given below [58]: \[\mathrm{v_{m}}=[\frac{1}{3}(\frac{1}{\mathrm{v}^{3}}+\frac{2}{ \mathrm{v}^{3}})]^{1/3} \tag{19}\] \[\mathrm{v_{l}}=[\frac{3B+4G}{3r}]^{1/2}\] (20) \[\mathrm{and}\ \mathrm{v_{t}}=[\frac{G}{r}]^{1/2} \tag{21}\] Table 7 exhibits the calculated crystal density of and the acoustic velocities in BaAgAs. The sound velocities in BaAgAs are significantly higher than those in BaAgP. The high sound velocity in BaAgAs results from lower crystal density and higher crystal stiffness of this particular Dirac semimetal. Higher sound velocity in BaAgAs implies that the phonon thermal conductivity of this compound should be higher than that of BaAgP. ### Thermal properties #### Debye temperature Debye temperature is one of the most prominent thermo-physical parameter of a material. It is related to phonon thermal conductivity, heat capacity, melting temperature, superconducting transition temperature, and electrical conductivity of solids. There are several methods for calculating the Debye temperature, \(\mathrm{\theta_{D}}\). Among them, the suggested by Anderson [69] is straightforward and gives reliable estimation of the Debye temperature. The relevant expression is shown below: \[\mathrm{\theta_{D}}=\frac{h}{k_{B}}[(\frac{3n}{4\rho})\frac{N_{A}r}{M}]^{1/3} \mathrm{v_{m}} \tag{22}\] In this equation, h is the Planck's constant and \(\mathrm{k_{B}}\) is the Boltzmann constant, n refers to the number of atoms in a molecule, \(\mathrm{N_{A}}\) is the Avogadro's number, \(\mathrm{\rho}\) is the mass density, M is the molecular mass and \(\mathrm{v_{m}}\) is the average velocity of sound within the crystalline solid. The calculated Debye temperature is given in Table 8. The Debye temperature of BaAgAs is moderate, 365.53 K. Thus the phonon thermal conductivity of this compound is expected to moderate as well. #### 3.6.2 The melting temperature The melting temperature (T\({}_{\rm m}\)) is another necessary parameter for a material which is used to be at elevated temperatures. The melting temperature is related to the bonding strength and cohesive energy of the crystal. These parameters also determine the elastic constants and moduli. Fine et al. [70] developed a formula for calculating the melting temperature of crystals using the single crystal elastic constants as follows: \[{\rm T_{m}=354+1.5(2C_{11}+C_{33})} \tag{23}\] The calculated melting temperature of BaAgAs is listed in Table 8. The melting temperature of 864.10 K of BaAgAs is consistent with its moderate Debye temperature, hardness and various elastic moduli. #### 3.6.3 Thermal conductivity Thermal conductivity is also an important indicator of a material for thermal transport coefficient that gives the measure of the efficiency of heat transfer by a material. This parameter is depends on temperature. In a weak semimetal like BaAgAs, the thermal conductivity should be dominated by the phonon contributions. The minimum phonon thermal conductivity (K\({}_{\rm min}\)) is the limiting value of the thermal conductivity at higher temperature when the phonon contribution to the thermal conductivity (K\({}_{\rm ph}\)) reaches its minimum value and becomes independent of temperature. Based on the Debye model, Clarke deduced the formula to calculate the minimum thermal conductivity (K\({}_{\rm min}^{\rm Clarke}\)) using the following equation [71]. \[{\rm K_{min}^{\rm Clarke}=k_{\rm B}v_{\rm m}[\frac{n^{\prime}N_{A}}{M}]^{2/3}} \tag{24}\] The minimum phonon thermal conductivity can also be estimated employing the Cahill formalism where the phonon spectrum has been considered within the Einstein model. The Cahill formula [72] for the minimum thermal conductivity is given below: \[K_{min}^{cahill}=\stackrel{{ k_{B}}}{{=2.48}}n^{\frac{2}{3}}(v_{l}+2v_{t}) \tag{25}\] The calculated minimum thermal conductivities are tabulated below (Table 8). The minimum thermal conductivity of BaAgAs is very low, comparable to many prospective thermal barrier coating (TBC) materials [73, 74]. The temperature dependent phonon thermal conductivity of BaAgAs can also be estimated using the formalism developed by Slack [75]. The Slack formula for temperature dependent phonon thermal conductivity or lattice thermal conductivity is as follows: \[{\rm K_{ph}(T)=A[\frac{M_{\rm av}g\frac{Q^{2}_{\rm m}}{g}d}{N^{2/3}T}]} \tag{26}\] In this relation, M\({}_{\rm av}\) is the average atomic mass (Kg/mol) in the molecule, \(\delta\) denotes the cubic root of average atomic volume, N denotes the number of atoms present in unit cell, and \(\gamma\) denotes the Gruneisen constant calculated using the poison's ratio (\(\sigma\)). A is a parameter (in W-mol/Kg/m\({}^{2}\)/K\({}^{3}\)) depending on \(\gamma\) which is calculated from [76]: \[A(\gamma)=\stackrel{{ 5.720}}{{2}\cdot[10-\frac{0.514}{g}\cdot\frac{0.224}{ g}]} \tag{27}\] The anharmonic effect of a solid is determined by the Gruneisen parameter. The Gruneisen parameter \(\gamma\) is an important quantity in the thermodynamics and lattice dynamics because it is related with bulk modulus, heat capacity, thermal expansion coefficient and volume of the solid. A high value of the Gruneisen parameter implies high level of anharmonicity. The Gruneisen parameter can be evaluated from the Poisson's ratio of a solid as follows [77]: \[\gamma=\frac{3[1+5]}{2[2-35]} \tag{28}\] For crystalline materials the values of \(\gamma\) is usually found in the range of 0.80 - 3.50 [77, 78]. The calculated value of \(\gamma\) of BaAgAs is 1.49 which is well within the established range. The value is in the medium range which implies the medium level of anharmonic effects in BaAgAs. All the thermo-physical parameters calculated in this section are summarized in Table 8 below. For comparison, some of the relevant results for the isostructural Dirac semimetal BaAgP are also tabulated. Both Debye temperature and the melting point of BaAgP are lower than those of BaAgAs, in complete consistency with the elastic, hardness, and bonding characteristics. ### Bond population analysis The Mulliken bond populations are calculated to explore the bonding nature (ionic, covalent and metallic) of BaAgAs. We have also performed the Hirshfeld population analysis (HPA). The calculated values of atomic populations and the other relevant parameters are given in Table 9. Low value of the charge spilling parameter indicates that the results of Mulliken population analysis (MPA) are of good quality. It is seen from Table 9 that in BaAgAs, electrons are transferred from As and Ba to Ag. It is an indication of ionic bonds. The electron transfer can be attributed to the difference in the electron affinities of As, Ag, and Ba. On the other hand, non-zero effective valence charge implies that there are some covalent contributions as well. The effective valences in the Mulliken population analysis (MPA) and the Hirshfeld population analysis HPA are different. This is expected since MPA depends on the basis sets used to approximate the wave functions of the orbitals while the HPA is independent of the basis sets [28, 79, 80]. Both MPA and HPA suggest mixed bonding - ionic and covalent, in the BaAgAs. \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|c|} \hline Compound & \(\theta_{\text{D}}\) (K) & \multicolumn{2}{|c|}{K\({}_{\text{min}}\) (W/m-K)} & \(\gamma\) & K\({}_{\text{ph}}\) (W/m-K) & T\({}_{\text{m}}\) (K) & Ref. \\ \cline{3-8} & & K\({}_{\text{min}}^{\text{Clark}}\) & K\({}_{\text{min}}^{\text{Cahill}}\) & & & & \\ \hline BaAgAs & 365.53 & 0.709 & 0.776 & 1.49 & 9.27 & 864.10 & This work \\ \hline BaAgP & 255.00 & – & – & – & – & 807.91* & [40] \\ \hline \multicolumn{8}{l}{*Calculated from the elastic constants.} \\ \end{tabular} \end{table} Table 8: The Debye temperature \(\theta_{\text{D}}\), minimum thermal conductivity K\({}_{\text{min}}\), Grüneisen parameter \(\gamma\), lattice/phonon thermal conductivity K\({}_{\text{ph}}\) at 300 K and the melting temperature T\({}_{\text{m}}\) of BaAgAs compound. ### Optical properties We have also computed the energy/frequency dependent optical parameters of BaAgAs to explore the possible opportunity of its use in the optoelectronic device sector. In this section, we have calculated the optical properties such as absorption coefficient, dielectric constant, photoconductivity, refractive index, reflectivity and loss function in the photon energy range up to 15 eV with two different electric field polarization directions of [100] and [001]. The methodology for optical calculations is detailed in Refs. [28, 81]. A Gaussian smearing of 0.5 eV, a Drude energy 0.05 eV and an unscreened plasma energy of 5 eV were used to calculate the optical parameters as a function of incident photon energy. The Drude term takes care of the intraband electronic transitions due to the absorption of low energy photons. All the computed optical parameters are shown in Fig. 7 below. The real part of dielectric function, \(\varepsilon_{1}(\omega)\), is shown in Fig. 7a. The spectra of \(\varepsilon_{1}\) start from negative value with a peak around \(\sim\)1.6 eV and cross the zero line at around 10.8 eV. This is a typical metallic behavior where no band gap exists. Fig. 7a also shows the imaginary part of the dielectric function, \(\varepsilon_{2}(\omega)\). This parameter is related to the photon absorption characteristics of BaAgAs. The position of the peaks and the spectral weight in \(\varepsilon_{2}(\omega)\) are controlled by the electronic energy density of states of the energy levels involved in the optical transition of electrons and the matrix elements of the transition between the two states involved. Sharp peaks in the imaginary part are found at 2.00 eV for [100] and at 2.6 eV for [001] polarization directions of the incident electric field vector. For both polarizations \(\varepsilon_{2}\) gradually decreases with increasing energy and finally goes to zero at \(\sim\) 11.2 eV. There is significant optical anisotropy in the real part of the dielectric function with respect to the polarization states of the electric field. The level of anisotropy is much lower in the imaginary part. The real part of refractive index, n(\(\omega\)), and the imaginary part, k(\(\omega\)), are shown in Fig. 7b. The low energy value of n(\(\omega\)) was found to be high in the infrared and visible region. This real part measures the group velocity of electromagnetic wave in the solid. The imaginary part, known as the extinction coefficient, determines the attenuation of light as it travels through the material. From Fig. 7b, we observe that infrared light is highly attenuated by BaAgAs. Both the real and imaginary \begin{table} \begin{tabular}{|c|c|c|c|c|c|c|c|c|c|c|} \hline \multirow{2}{*}{\begin{tabular}{c} Charge \\ Spilling \\ (\%) \\ \end{tabular} } & \multirow{2}{*}{\begin{tabular}{c} Atomic \\ species \\ \end{tabular} } & \multicolumn{3}{c|}{Multiken atomic population - orbitals} & \multicolumn{1}{c|}{\begin{tabular}{c} Mulliken \\ charge \\ \end{tabular} } & \multicolumn{1}{c|}{\begin{tabular}{c} Formal \\ ionic \\ (Mulliken) \\ \end{tabular} } & \multicolumn{1}{c|}{\begin{tabular}{c} Effective \\ charge \\ \end{tabular} } & \multicolumn{1}{c|}{\begin{tabular}{c} Hirshfeld \\ charge \\ \end{tabular} } & \multicolumn{1}{c|}{ \begin{tabular}{c} Effective \\ valence \\ (Hirshfeld) \\ \end{tabular} } \\ \hline \multirow{6}{*}{0.77} & As & -0.33 & 4.23 & 0.00 & 0.00 & 3.90 & 1.10 & -3 & 1.90 & -0.23 & 2.77 \\ \cline{2-11} & As & -0.33 & 4.23 & 0.00 & 0.00 & 3.90 & 1.10 & -3 & 1.90 & -0.23 & 2.77 \\ \cline{2-11} & Ag & 1.54 & 0.43 & 9.84 & 0.00 & 11.81 & -0.81 & +1 & 0.19 & 0.16 & 0.84 \\ \cline{2-11} & Ag & 1.54 & 0.43 & 9.84 & 0.00 & 11.81 & -0.81 & +1 & 0.19 & 0.16 & 0.84 \\ \cline{2-11} & Ba & 3.09 & 6.06 & 1.13 & 0.00 & 10.28 & -0.28 & +2 & 1.72 & 0.07 & 1.93 \\ \cline{2-11} & Ba & 3.09 & 6.06 & 1.13 & 0.00 & 10.28 & -0.28 & +2 & 1.72 & 0.07 & 1.93 \\ \hline \end{tabular} \end{table} Table 9: Charge Spilling parameter (%), orbital charge (electron), atomic Milliken charge (electron), effective valance (Mulliken & Hirshfeld) (electron) of BaAgAs. parts of the refractive index decrease monotonically at high energies in the ultraviolet (UV) region of the electromagnetic spectrum and finally become almost flat \(\sim\)11 eV. The optical anisotropy is quite low up to 11 eV. The variation of absorption coefficients \(\alpha(\omega)\), as a function of photon energy, are depicted in Fig. 7c. Finite values of \(\alpha(\omega)\), for both the polarizations at very low energy supports the metallic state of BaAgAs. The absorption coefficient is quite high in the energy range 5 to 10 eV in the UV region. This suggests that BaAgAs is a good absorber of ultraviolet radiation. There is significant optical anisotropy in optical absorption in the energy range from 5 eV to 10 eV. The photoconductivity is another important parameter for optoelectronic device applications. Optical conductivity as a function of photon energy is presented in Fig. 7d. The low energy photoconductivity reaffirms the metallic character of BaAgAs. There is optical anisotropy in \(\sigma(\omega)\). Sharp peaks of real part are found at 2.00 eV for [100] and at 2.5 eV for [001] polarization directions of the incident electric field vector. The reflectivity, as a function of incident photon energy, is given in Fig. 7e. The reflectivity is higher in the visible region for the [100] polarization. The reflectivity initially decreases in the near-infrared region then increases gradually and becomes almost non-selective in the energy range 3 eV to 11 eV. R(\(\omega\)) decreases sharply at around 12 eV close to the plasma peak. Reflectivity remains below 40% for electromagnetic radiation with [001] polarization in the visible range. Thus, for this particular polarization, BaAgAs can be used as an anti-reflection material. The calculated energy loss spectrum is shown in Fig. 7f. The energy loss function helps one to understand the screened plasma excitation created by swift charges inside the material. The loss function, L(\(\omega\)), shows peak at the characteristic plasma oscillation energy. The position of the peak marks the energy at which the reflectivity and absorption coefficient falls sharply. Above the plasma energy, the system becomes transparent to the incident photons and the optical features become similar to those of insulators. For BaAgAs, the plasma peaks are located at \(\sim\)11 eV for both electric field polarizations along the [100] and [001] directions. ## 4 Conclusions Employing the DFT based first-principles calculations we have explored the elastic, bonding, lattice dynamic, electronic, thermo-physical and optical properties of BaAgAs compound. Most of the reported results are novel. The compound is found to be elastically and stable with brittle features. It is machinable and elastically anisotropic. The phonon dispersion curves confirm dynamical stability of the crystal structure. There are ionic and covalent bondings in BaAgAs. Compared to another isostructural Dirac semimetal BaAgP the bonding strengths and anisotropy level of BaAgAs are higher. The hardness and Debye temperature of BaAsAg are moderate. The phonon thermal conductivity of BaAgAs is low. The electronic band structure shows clear semimetallic character with Dirac point touching the Fermi level. The electronic energy density of states is low. The calculated value of the repulsive Coulomb pseudopotential indicates that BaAgAs has weak electronic correlations. The Fermi surface is an ellipsoid of small size. The optical parameters of BaAgAs have been studied in detail. The compound under study possesses optical anisotropy. BaAgAs is a good absorber of ultraviolet light and reflects visible radiation. The compound is a poor reflector of light. Overall, the optical properties exhibit weak metallic character and are consistent with the electronic band structure calculations. Figure 7: The (a) real and imaginary parts of dielectric function [\(\varepsilon_{1}(\omega)\) and \(\varepsilon_{2}(\omega)\)], (b) real and imaginary parts of the refractive index [n(\(\omega\)) and k(\(\omega\))], (c) absorption coefficient [\(\alpha(\omega)\)], (d) optical conductivity [ \(\sigma(\omega)\)], (e) reflectivity [R(\(\omega\))], and (f) loss function [L(\(\omega\))] of BaAgAs for the [100] and [001] electric field polarization directions. ## Acknowledgements S. H. N. acknowledges the research grant (1151/5/52/RU/Science-07/19-20) from the Faculty of Science, University of Rajshahi, Bangladesh, which partly supported this work. A. S. M. M. R. is thankful to the University Grant Commission (UGC), Dhaka, Bangladesh which gave him the Fellowship to conduct this research. ## Data availability The data sets generated and/or analyzed in this study are available from the corresponding author on reasonable request. ## Declaration of interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. ## CRediT authorship contribution statement ### A.S.M. Muhasin Reza Formal analysis, Methodology, Writing-original draft. **S.H. Naqib**: Supervision, Formal analysis, Conceptualization, Project administration, Writing-review & editing.

2306.11715

Multi-Fidelity Active Learning with GFlowNets

In the last decades, the capacity to generate large amounts of data in science and engineering applications has been growing steadily. Meanwhile, machine learning has progressed to become a suitable tool to process and utilise the available data. Nonetheless, many relevant scientific and engineering problems present challenges where current machine learning methods cannot yet efficiently leverage the available data and resources. For example, in scientific discovery, we are often faced with the problem of exploring very large, structured and high-dimensional spaces. Moreover, the high fidelity, black-box objective function is often very expensive to evaluate. Progress in machine learning methods that can efficiently tackle such challenges would help accelerate currently crucial areas such as drug and materials discovery. In this paper, we propose a multi-fidelity active learning algorithm with GFlowNets as a sampler, to efficiently discover diverse, high-scoring candidates where multiple approximations of the black-box function are available at lower fidelity and cost. Our evaluation on molecular discovery tasks shows that multi-fidelity active learning with GFlowNets can discover high-scoring candidates at a fraction of the budget of its single-fidelity counterpart while maintaining diversity, unlike RL-based alternatives. These results open new avenues for multi-fidelity active learning to accelerate scientific discovery and engineering design.

Alex Hernandez-Garcia, Nikita Saxena, Moksh Jain, Cheng-Hao Liu, Yoshua Bengio

2023-06-20T17:43:42Z

http://arxiv.org/abs/2306.11715v2

# Multi-Fidelity Active Learning with GFlowNets ###### Abstract In the last decades, the capacity to generate large amounts of data in science and engineering applications has been growing steadily. Meanwhile, the progress in machine learning has turned it into a suitable tool to process and utilise the available data. Nonetheless, many relevant scientific and engineering problems present challenges where current machine learning methods cannot yet efficiently leverage the available data and resources. For example, in scientific discovery, we are often faced with the problem of exploring very large, high-dimensional spaces, where querying a high fidelity, black-box objective function is very expensive. Progress in machine learning methods that can efficiently tackle such problems would help accelerate currently crucial areas such as drug and materials discovery. In this paper, we propose the use of GFlowNets for multi-fidelity active learning, where multiple approximations of the black-box function are available at lower fidelity and cost. GFlowNets are recently proposed methods for amortised probabilistic inference that have proven efficient for exploring large, high-dimensional spaces and can hence be practical in the multi-fidelity setting too. Here, we describe our algorithm for multi-fidelity active learning with GFlowNets and evaluate its performance in both well-studied synthetic tasks and practically relevant applications of molecular discovery. Our results show that multi-fidelity active learning with GFlowNets can efficiently leverage the availability of multiple oracles with different costs and fidelities to accelerate scientific discovery and engineering design. ## 1 Introduction The current most pressing challenges for humanity, such as the climate crisis and the threat of pandemics or antibiotic resistance could be tackled, at least in part, with new scientific discoveries. By way of illustration, materials discovery can play an important role in improving the energy efficiency of energy production and storage; and reducing the costs and duration for drug discovery has the potential to more effectively and rapidly mitigate the consequences of new diseases. In recent years, researchers in materials science, biochemistry and other fields have increasingly adopted machine learning as a tool as it holds the promise to drastically accelerate scientific discovery [9; 74; 5; 15]. Although machine learning has already made a positive impact in scientific discovery applications [62; 31], unleashing its full potential will require improving the current algorithms [2]. For example, typical tasks in potentially impactful applications in materials and drug discovery require exploring combinatorially large, high-dimensional spaces [52; 8], where only small, noisy data sets are available, and obtaining new annotations computationally or experimentally is very expensive. Such scenarios present serious challenges even for the most advanced current machine learning methods. In the search for a useful discovery, we typically define a quantitative proxy for usefulness, which we can view as a black-box function. One promising avenue for improvement is developing methods that more efficiently leverage the availability of multiple approximations of the target black-box function at lower fidelity but much lower cost than the highest fidelity oracle [12; 17]. For example, the most accurate estimation of the properties of materials and molecules is only typically obtained via synthesis and characterisation in a laboratory. However, this is only feasible for a small number of promising candidates. Approximate quantum mechanics simulations of a larger amount of chemical compounds can be performed via Density Functional Theory (DFT) [46; 57]. However, DFT is still computationally too expensive for high-throughput exploration of large search spaces. Thus, large-scale exploration can only be achieved through cheaper but less accurate oracles. Nonetheless, solely relying on low-fidelity approximations is clearly suboptimal. Ideally, such tasks would be best tackled by methods that can efficiently and adaptively distribute the available computational budget between the multiple oracles depending on the already acquired information. Figure 1: Graphic summary of our proposed algorithm for multi-fidelity active learning with GFlowNets. Given a set of \(M\) multi-fidelity oracles \(f_{1},\ldots,f_{M}\) (center left) with costs \(\lambda<\ldots<\lambda_{M}\), respectively, we can construct a data set \(\mathcal{D}\) (top left) with annotations from the various oracles. We use this data set to fit a multi-fidelity surrogate model (center) of the posterior \(p(f_{m}(x)|x,m,\mathcal{D})\), for instance with Gaussian Processes. The surrogate model is used to calculate the values of a multi-fidelity acquisition function—max-value entropy search (MES) in our experiments—and we train GFlowNet with (a transformation of) the acquisition function as reward. GFlowNet (center right) is trained to sample both an object \(x\) and the fidelity \(m\) proportionally to the reward function. Once GFlowNet is trained, we can sample \(N\) tuples \((x,m)\) and select the top \(B\) according to the acquisition function (bottom left). Finally, we annotate each new candidate with the corresponding oracle, add them to the data set and repeat the process. The detailed algorithm is provided in Algorithm 1. The past decade has seen significant progress in multi-fidelity Bayesian optimisation (BO) [22; 59], including methods that leverage the potential of deep neural networks [41]. Although highly relevant for scientific discovery, standard BO is not perfectly suited for some of the challenges in materials and drug discovery tasks. First and foremost, BO's ultimate goal is to find the optimum of an expensive black-box function. However, even the highest fidelity oracles in such problems are underspecified with respect to the actual, relevant, downstream applications. Therefore, it is imperative to develop methods that, instead of "simply" finding the optimum, discover a set of diverse, high-scoring candidates. Recently, generative flow networks (GFlowNets) [6] have demonstrated their capacity to find diverse candidates through discrete probabilistic modelling, with particularly promising results when embedded in an active learning loop [26]. Here, we propose to extend the applicability of GFlowNets for multi-fidelity active learning. In this paper, we present an algorithm for multi-fidelity active learning with GFlowNets, depicted in Fig. 1. We provide empirical results in two synthetic benchmark tasks and four practically relevant tasks for biological sequence design and molecular modelling. As a main result, we demonstrate that multi-fidelity active learning with GFlowNets discovers diverse, high-scoring samples when multiple oracles with different fidelities and costs are available, with lower computational cost than its single-fidelity counterpart. ## 2 Related Work Our work can be framed within the broad field of active learning (AL), a class of machine learning methods whose goal is to learn an efficient data sampling scheme to accelerate training [56]. For the bulk of the literature in AL, the goal is to train an accurate model \(h(x)\) of an unknown target function \(f(x)\), as in classical supervised learning. However, in certain scientific discovery problems, which is the motivation of our work, a desirable goal is often to discover multiple, diverse candidates \(x\) with high values of \(f(x)\). The reason is that the ultimate usefulness of a discovery is extremely expensive to quantify and we always rely on more or less accurate approximations. Since we generally have the option to consider more than one candidate solution, it is safer to generate a set of diverse and apparently good solutions, instead of focusing on the single global optimum of the wrong function. This distinctive goal is closely connected to related research areas such as Bayesian optimisation [22] and active search [23]. Bayesian optimisation (BO) is an approach grounded in Bayesian inference for the problem of optimising a black-box objective function \(f(x)\) that is expensive to evaluate. In contrast to the problem we address in this paper, standard BO typically considers continuous domains and works best in relatively low-dimensional spaces [21]. Nonetheless, in recent years, approaches for BO with structured data [16] and high-dimensional domains [24] have been proposed in the literature. The main difference between BO and the problem we tackle in this paper is that we are interested in finding multiple, diverse samples with high value of \(f\) and not only the optimum. This goal, as well as the discrete nature of the search space, is shared with active search, a variant of active learning in which the task is to efficiently find multiple samples of a valuable (binary) class from a discrete domain \(\mathcal{X}\)[23]. This objective was already considered in the early 2000s by Warmuth et al. for drug discovery [66], and more formally analysed in later work [30; 29]. A recent branch of research in stochastic optimisation that considers diversity is so-called Quality-Diversity [11], which typically uses evolutionary algorithms that perform search in the latent space. All these and other problems such as multi-armed bandits [54] and the general framework of experimental design [10] all share the objective of optimising or exploring an expensive black-box function. Formal connections between some of these areas have been established in the literature [60; 20; 27; 18]. Multi-fidelity methods have been proposed in most of these related areas of research. An early survey on multi-fidelity methods for Bayesian optimisation was compiled by Peherstorfer et al. [48], and research on the subject has continued since [50; 59], with the proposal of specific acquisition functions [63] and the use of deep neural networks to improve the modelling [41]. Interestingly, the literature on multi-fidelity active learning [40] is scarcer than on Bayesian optimisation. Recently, works on multi-fidelity active search have also appeared in the literature [45]. Finally, multi-fidelity methods have recently started to be applied in scientific discovery problems [12; 17]. However, the literature is still scarce probably because most approaches do not tackle the specific needs in scientific discovery, such as the need for diverse samples. Here, we aim addressing this need with the use of GFlowNets [6; 28] for multi-fidelity active learning. ## 3 Method In this section, we first briefly introduce the necessary background on GFlowNets and active learning. Then, we describe the proposed algorithm for multi-fidelity active learning with GFlowNets. ### Background GFlowNetsGenerative Flow Networks [GFlowNets; 6; 7] are amortised samplers designed for sampling from discrete high-dimensional distributions. Given a space of compositional objects \(\mathcal{X}\) and a non-negative reward function \(R(x)\), GFlowNets are designed to learn a stochastic policy \(\pi\) that generates \(x\in\mathcal{X}\) with a probability proportional to the reward, that is \(\pi(x)\propto R(x)\). This distinctive property induces sampling diverse, high-reward objects, which is a desirable property for scientific discovery, among other applications [27]. The objects \(x\in\mathcal{X}\) are constructed sequentially by sampling transitions \(s_{t}{\rightarrow}s_{t+1}\in\mathbb{A}\) between partially constructed objects (states) \(s\in\mathcal{S}\), which includes a unique empty state \(s_{0}\). The stochastic forward policy is typically parameterised by a neural network \(P_{F}(s_{t+1}|s_{t};\theta)\), where \(\theta\) denotes the learnable parameters, which models the distribution over transitions \(s_{t}{\rightarrow}s_{t+1}\) from the current state \(s_{t}\) to the next state \(s_{t+1}\). The backward transitions are parameterised too and denoted \(P_{B}(s_{t}|s_{t+1};\theta)\). The probability \(\pi(x)\) of generating an object \(x\) is given by \(P_{F}\) and its sequential application: \[\pi(x)=\sum_{\tau:s_{|\tau|-1}\to x\in\tau}\prod_{t=0}^{|\tau|-1}P_{F}(s_{t+ 1}|s_{t};\theta),\] which sums over all trajectories \(\tau\) with terminating state \(x\), where \(\tau=(s_{0}\to s_{1}\ldots\to s_{|\tau|})\) is a complete trajectory. To learn the parameters \(\theta\) such that \(\pi(x)\propto R(x)\) we use the trajectory balance learning objective [42] \[\mathcal{L}_{TB}(\tau;\theta)=\left(\log\frac{Z_{\theta}\prod_{t=0}^{n}P_{F}(s _{t+1}|s_{t};\theta)}{R(x)\prod_{t=1}^{n}P_{B}(s_{t}|s_{t+1};\theta)}\right)^ {2}, \tag{1}\] where \(Z_{\theta}\) is an approximation of the partition function \(\sum_{x\in\mathcal{X}}R(x)\) that is learned. The GFlowNet learning objective supports training from off-policy trajectories, so during training the trajectories are typically sampled from a mixture of the current policy with a uniform random policy. The reward is also tempered to make the policy focus on the modes. Active LearningIn its simplest formulation, the active learning problem that we consider is as follows: we start with an initial data set \(\mathcal{D}=\{(x_{i},f(x_{i}))\}\) of samples \(x\in\mathcal{X}\) and their evaluations by an expensive, black-box objective function (oracle) \(f:\mathcal{X}\rightarrow\mathbb{R}\), which we use to train a surrogate model \(h(x)\). A GFlowNet can then be trained to learn a generative policy \(\pi_{\theta}(x)\) using \(h(x)\) as reward function, that is \(R(x)=h(x)\). Optionally, we can instead train a probabilistic surrogate \(p(f|\mathcal{D})\) and use as reward the output of an acquisition function \(\alpha(x,p(f|\mathcal{D}))\) that considers the epistemic uncertainty of the surrogate model, as typically done in Bayesian optimisation. Finally, we use the policy \(\pi(x)\) to generate a batch of samples to be evaluated by the oracle \(f\), we add them to our data set and repeat the process a number of active learning rounds. While much of the active learning literature [56] has focused on so-called _pool-based_ active learning, where the learner selects samples from a pool of unlabelled data, we here consider the scenario of _de novo query synthesis_, where samples are selected from the entire object space \(\mathcal{X}\). This scenario is particularly suited for scientific discovery [34; 69; 71; 38]. The ultimate goal pursued in active learning applications is also heterogeneous. Often, the goal is the same as in classical supervised machine learning: to train an accurate (surrogate) model \(h(x)\) of the unknown target function \(f(x)\). For some problems in scientific discovery, we are usually not interested in the accuracy in the entire input space \(\mathcal{X}\), but rather in discovering new, diverse objects with high values of \(f\). This is connected to other related problems such as Bayesian optimisation [22], active search [23] or experimental design [10], as reviewed in Section 2. ### Multi-Fidelity Active Learning We now consider the following active learning problem with multiple oracles of different fidelities. Our ultimate goal is to generate a batch of \(K\) samples \(x\in\mathcal{X}\) according to the following desiderata: * The samples obtain a high value when evaluated by the objective function \(f:\mathcal{X}\rightarrow\mathbb{R}^{+}\). * The samples in the batch should be distinct and diverse, that is cover distinct high-valued regions of \(f\). Furthermore, we are constrained by a computational budget \(\Lambda\) that limits our capacity to evaluate \(f\). While \(f\) is extremely expensive to evaluate, we have access to a discrete set of surrogate functions (oracles) \(\{f_{m}\}_{1\leq m\leq M}:\mathcal{X}\rightarrow\mathbb{R}^{+}\), where \(m\) represents the fidelity index and each oracle has an associated cost \(\lambda_{m}\). We assume \(f_{M}=f\) because there may be even more accurate oracles for the true usefulness but we do not have access to them, which means that even when measured by \(f=f_{M}\), diversity remains an important objective. We also assume, without loss of generality, that the larger \(m\), the higher the fidelity and that \(\lambda_{1}<\lambda_{2}<\ldots<\lambda_{M}\). This scenario resembles many practically relevant problems in scientific discovery, where the objective function \(f_{M}\) is indicative but not a perfect proxy of the true usefulness of objects \(x\)--hence we want diversity--yet it is extremely expensive to evaluate--hence cheaper, approximate models are used in practice. In multi-fidelity active learning--as well as in multi-fidelity Bayesian optimisation--the iterative sampling scheme consists of not only selecting the next object \(x\) (or batch of objects) to evaluate, but also the level of fidelity \(m\), such that the procedure is cost-effective. Our algorithm, MF-GFN, detailed in Algorithm 1, proceeds as follows: An active learning round \(j\) starts with a data set of annotated samples \(\mathcal{D}_{j}=\{(x_{i},f_{m}(x_{i}),m_{i})\}_{1\leq m\leq M}\). The data set is used to fit a probabilistic _multi-fidelity surrogate_ model \(h(x,m)\) of the posterior \(p(f_{m}(x)|x,m,\mathcal{D})\). We use Gaussian Processes [53], as is common in Bayesian optimisation, to model the posterior, such that the model \(h\) predicts the conditional Gaussian distribution of \(f_{m}(x)\) given \((x,m)\) and the existing data set \(\mathcal{D}\). We implement a multi-fidelity GP kernel by combining a Matern kernel evaluated on \(x\) with a linear downsampling kernel over \(m\)[68]. In the higher dimensional problems, we use Deep Kernel Learning [67] to increase the expressivity of the surrogate models. The candidate \(x\) is modelled with the deep kernel while the fidelity \(m\) is modelled with the same linear downsampling kernel. The output of the surrogate model is then used to compute the value of a _multi-fidelity acquisition function_\(\alpha(x,m)\). In our experiments, we use the multi-fidelity version [63] of max-value entropy search (MES) [65], which is an information-theoretic acquisition function widely used in Bayesian optimisation. MES aims to maximise the mutual information between the value of the queried \(x\) and the maximum value attained by the objective function, \(f^{\star}\). The multi-fidelity variant is designed to select the candidate \(x\) and the fidelity \(m\) that maximise the mutual information between \(f^{\star}_{M}\) and the oracle at fidelity \(m\), \(f_{m}\), weighted by the cost of the oracle: \[\alpha(x,m)=\frac{1}{\lambda_{m}}I(f^{\star}_{M};f_{m}|\mathcal{D}_{j}). \tag{2}\] We provide further details about the acquisition function in Appendix A.3. A multi-fidelity acquisition function can be regarded as a cost-adjusted utility function. Therefore, in order to carry out a cost-aware search, we seek to sample diverse objects with high value of the acquisition function. In this paper, we propose to use a GFlowNet as a generative model trained for this purpose (see further details below in Section 3.3). An active learning round terminates by generating \(N\) objects from the sampler (here the GFlowNet policy \(\pi\)) and forming a batch with the best \(B\) objects, according to \(\alpha\). Note that \(N\gg B\), since sampling from a GFlowNet is relatively inexpensive. The selected objects are annotated by the corresponding oracles and incorporated into the data set, such that \(\mathcal{D}_{j+1}=\mathcal{D}_{j}\cup\{(x_{1},f_{m}(x_{1}),m_{1}),\ldots(x_{B},f_{m}(x_{B}),m_{B})\}\). ### Multi-Fidelity GFlowNets In order to use GFlowNets in the multi-fidelity active learning loop described above, we propose to make the GFlowNet sample the fidelity \(m\) for each object \(x\in\mathcal{X}\) in addition to \(x\) itself. Formally, given a baseline GFlowNet with state and transition spaces \(\mathcal{S}\) and \(\mathbb{A}\), we augment the state space with a new dimension for the fidelity \(\mathcal{M}^{\prime}=\{0,1,2,\ldots,M\}\) (including \(m=0\), which corresponds to unset fidelity), such that the augmented, multi-fidelity space is \(\mathcal{S}_{\mathcal{M}^{\prime}}=\mathcal{S}\cup\mathcal{M}^{\prime}\). The set of allowed transitions \(\mathbb{A}_{M}\) is augmented such that a fidelity \(m>0\) of a trajectory must be selected once, and only once, from any intermediate state. Intuitively, allowing the selection of the fidelity at any step in the trajectory should give flexibility for better generalisation. At the end, finished trajectories are the concatenation of an object \(x\) and the fidelity \(m\), that is \((x,m)\in\mathcal{X}_{\mathcal{M}}=\mathcal{X}\cup\mathcal{M}\). In summary, the proposed approach enables to jointly learn the policy that samples objects in a potentially very large, high-dimensional space, together with the level of fidelity, that maximise a given multi-fidelity acquisition function as reward. ## 4 Empirical Evaluation In this section, we describe the evaluation metrics and experiments performed to assess the validity and performance of our proposed approach of multi-fidelity active learning with GFlowNets. Overall, the purpose of this empirical evaluation is to answer the following questions: * **Question 1**: Is our multi-fidelity active learning approach able to find high-scoring, diverse samples at lower cost than active learning with a single oracle? * **Question 2**: Does our proposed multi-fidelity GFlowNet, which learns to sample fidelities together with objects \((x,m)\), provide any advantage over sampling only objects \(x\)? In Section 4.1 we describe the metrics proposed to evaluate the performance our proposed method, as well as the baselines, which we describe in Section 4.2. In Section 4.3, we present results on synthetic tasks typically used in the multi-fidelity BO and active learning literature. In Section 4.4, we present results on more practically relevant tasks for scientific discovery, such as the design of DNA sequences and anti-microbial peptides. ### Metrics One core motivation in the conception of GFlowNets, as reported in the original paper [6], was the goal of sampling diverse objects with high-score, according to a reward function. * Mean score, as per the highest fidelity oracle \(f_{M}\), of the top-\(K\) samples. * Mean pairwise similarity within the top-\(K\) samples. Furthermore, since here we are interested in the cost effectiveness of the active learning process, in this section we will evaluate the above metrics as a function of the cost accumulated in querying the multi-fidelity oracles. It is important to note that the multi-fidelity approach is not aimed at achieving _better_ mean top-\(K\) scores than a single-fidelity active learning counterpart, but rather _the same_ mean top-\(K\) scores _with a smaller budget_. ### Baselines In order to evaluate our approach, and to shed light on the questions stated above, we consider the following baselines: * **GFlowNet with highest fidelity (SF-GFN):**GFlowNet based active learning approach from [26] with the highest fidelity oracle to establish a benchmark for performance without considering the cost-accuracy trade-offs. * **GFlowNet with random fidelities (Random fid. GFN ):**Variant of SF-GFN where the candidates are generated with the GFlowNet but the fidelities are picked randomly and a multi-fidelity acquisition function is used, to investigate the benefit of deciding the fidelity with GFlowNets. * **Random candidates and fidelities (Random):**Quasi-random approach where the candidates and fidelities are picked randomly and the top \((x,m)\) pairs scored by the acquisition function are queried. * **Multi-fidelity PPO (MF-PPO):**Instantiation of multi-fidelity Bayesian optimisation where the acquisition function is optimised using proximal policy optimisation [PPO 55]. ### Synthetic Tasks As an initial assessment of MF-GFNs, we consider two synthetic functions--Branin and Hartmann--widely used in the single- and multi-fidelity Bayesian optimisation literature [50; 59; 32; 41; 19]. BraninWe consider an active learning problem in a two-dimensional space where the target function \(f_{M}\) is the Branin function, as modified in [58] and implemented in botorch[3]. We simulate three levels of fidelity, including the true function. The lower-fidelity oracles, the costs of the oracles (0.01, 0.1, 1.0) as well as the number of points queried in the initial training set were adopted from [41]. We provide further details about the task in Appendix B.1. In order to consider a discrete design space, we map the domain to a discrete \(100\times 100\) grid. We model this grid with a GFlowNet as in [6; 42]: starting from the origin \((0,0)\), for any state \(s=(x_{1},x_{2})\), the action space consists of the choice between the exit action or the dimension to increment by \(1\), provided the next state is in the limits of the grid. Fig. 1(a) illustrates the results for this task. We observe that MF-GFN is able to reach the minimum of the Branin function with a smaller budget than the single-fidelity counterpart and the baselines. HartmannNext, we consider the 6-dimensional Hartmann function as objective \(f_{M}\) on a hyper-grid domain. As with Branin, we consider three oracles, adopting the lower-fidelity oracles and the set of costs (0.125, 0.25, 1.0) from [59]. We discretize the domain into a six-dimensional hyper-grid of length 10, yielding \(10^{6}\) possible candidate points. The results for the task are illustrated in Fig. 1(b), which indicate that multi-fidelity active learning with GFlowNets (MF-GFN) offers an advantage over single-fidelity active learning (SF-GFN) as well as some of the other baselines in this higher-dimensional synthetic problem as well. Note that while MF-PPO performs better in this task, as shown in the next experiments, MF-PPO tends to collapse to single modes of the function in more complex high-dimensional scenarios. ### Benchmark Tasks While the synthetic tasks are insightful and convenient for analysis, to obtain a more solid assessment of the performance of MF-GFN, we evaluate it, together with the other baselines, on more complex, structured design spaces of practical relevance. We present results on a variety of tasks including DNA aptamers (Section 4.4.1), anti-microbial peptides (Section 4.4.2) and small molecules (Section 4.4.3). #### 4.4.1 DNA Aptumers DNA aptamers are single-stranded nucleotide sequences with multiple applications in polymer design due to their specificity and affinity as sensors in crowded biochemical environments [73, 14, 70, 33]. DNA sequences are represented as strings of nucleobases A, C, T or G. In our experiments, we consider fixed-length sequences of 30 bases and design a GFlowNet environment where the action space \(\mathbb{A}\) consists of the choice of base to append to the sequence, starting from an empty sequence. This yields a design space of size \(|\mathcal{X}|=4^{30}\) (ignoring the selection of fidelity in MF-GFN). As the optimisation objective \(f_{M}\) (highest fidelity) we used the free energy of the secondary structure as calculated by NUPACK [72]. As a lower fidelity oracle, we trained a transformer model on 1 million randomly sampled sequences annotated with \(f_{M}\), and assigned it a cost \(100\times\) smaller than the highest-fidelity oracle. Further details about the task are discussed in Appendix B.3. The main results on the DNA aptamers task are presented in Fig. 2(a). We observe that on this task MF-GFN outperforms all other baselines in terms cost efficiency. For instance, MF-GFN achieves the best mean top-\(K\) energy achieved by its single-fidelity counterpart with just about \(20\)\(\%\) of the Figure 3: Results on the DNA aptamers and AMP tasks. The curves indicate the mean score \(f_{M}\) within the top-100 and top-50 samples (for DNA and AMP, respectively) computed at the end of each active learning round and plotted as a function of the budget used. The colour of the markers indicates the diversity within the batch (darker colour of the circular markers indicating more diversity), computed as the average sequence identity (see Appendix C). In both the DNA and AMP tasks, MF-GFN outperforms all baselines in terms of cost efficiency, while obtaining great diversity in the final batch of top-\(K\) candidates. Figure 2: Results on the synthetic tasks—Branin and Hartmann functions. The curves indicate the mean score \(f_{M}\) within the top-50 and top-10 samples (for Branin and Hartmann, respectively) computed at the end of each active learning round and plotted as a function of the budget used. The random baseline is omitted from this plot to facilitate the visualisation since the results were significantly worse in these tasks. We observe that MF-GFN clearly outperforms the single-fidelity counterpart (SF-GFN) and slightly improves upon the GFlowNet baseline that samples random fidelities. On Hartmann, MF-PPO initially outperforms the other methods. budget. It is also more efficient than GFlowNet with random fidelities and MF-PPO. Crucially, we also see that MF-GFN maintains a high level of diversity, even after converging to topK reward. On the contrary, MF-PPO is not able to discover diverse samples, as is expected based on prior work [26]. #### 4.4.2 Antimicrobial Peptides Antimicrobial peptides are short protein sequences which possess antimicrobial properties. As proteins, these are sequences of amino-acids--a vocabulary of 20 along with a special stop token. We consider variable-length protein sequences with up to 50 residues. We use data from DBAASP [51] containing antimicrobial activity labels, which is split into two sets - one used for training the oracle and one as the initial data set in the active learning loop, following [26]. To establish the multi-fidelity setting, we train different models with different capacities and with different subsets of the data. The details about these oracles along with additional details about the task are discussed in Appendix B.4. The results in Fig. 3b indicate that even in this task MF-GFN outperforms all other baselines in terms of cost-efficiency. It reaches the same maximum mean top-\(K\) score as the random baselines with \(10\times\) less budget and almost \(100\times\) less budget than SF-GFN. In this task, MF-PPO did not achieve comparable results. Crucially, the diversity of the final batch found by MF-GFN stayed high, satisfying this important criterion in the motivation of this method. #### 4.4.3 Small Molecules Molecules are clouds of interacting electrons (and nuclei) described by a set of quantum mechanical descriptions, or properties. These properties dictate their chemical behaviours and applications. Numerous approximations of these quantum mechanical properties have been developed with different methods at different fidelities, with the famous example of Jacob's ladder in density functional theory [49]. To demonstrate the capability of MF-GFlowNet to function in the setting of quantum chemistry, we consider two proof-of-concept tasks in molecular electronic potentials: maximisation of adiabatic electron affinity (EA) and (negative) adiabatic ionisation potential (IP). These electronic potentials dictate the molecular redox chemistry, and are key quantities in organic semiconductors, photoredex catalysis, or organometallic synthesis. We employed three oracles that correlate with experimental results as approximations of the scoring function, by uses of varying levels of geometry optimisation to obtain approximations to the adiabatic geometries, followed by the calculation of IP or EA with semi-empirical quantum chemistry XTB (see Appendix) [44]. These three oracles had costs of 1, 3 and 7 (respectively), proportional to their computational running demands. We designed the GFlowNet state space by using sequences of SELFIES tokens [36] (maximum of 64) to represent molecules, starting from an empty sequence; every action consists of appending a new token to the sequence. The realistic configuration and practical relevance of these tasks allow us to draw stronger conclusions about the usefulness of multi-fidelity active learning with GFlowNets in scientific discovery applications. As in the other tasks evaluated, we here also found MF-GFN to achieve better cost efficiency at finding high-score top-\(K\) molecules (Fig. 4), especially for ionization potentials (Fig. 4a). By clustering the generated molecules, we find that MF-GFN captures as many modes as random generation, far exceeding that of MF-PPO. Indeed, while MF-PPO seems to outperform MF-GFN in the task of electron affinity (Fig. 4b), all generated molecules were from a few clusters, which is of much less utility for chemists. ### Understanding the Impact of Oracle Costs As discussed in Section 3.2, a multi-fidelity acquisition function like the one we use (defined in Eq. (2)) is a cost cost-adjusted utility function. Consequently, the cost of each oracle plays a crucial role in the utility of acquiring each candidate. In our tasks with small molecules (Section 4.4.3), for instance, we used oracles with costs proportional to their computational demands and observed that multi-fidelity active learning largely outperforms single-fidelity active learning. However, depending on the costs of the oracles, the advantage of multi-fidelity methods can diminish significantly. In order to analyse the impact of the oracle costs on the performance of MF-GFN, we run several experiments on the DNA task (Section 4.4.1), which consists of two oracles, with a variety of oracle costs. In particular, besides the costs used in the experiments presented in Section 4.4.1, with costs \((0.2,20)\) for the lowest and highest fidelity oracles, we run experiments with costs \((1,20)\) and \((10,20)\). The results, presented in Fig. 5, indeed confirm that the advantage of MF-GFN over SF-GFN decreases as the cost of the lowest-fidelity oracle becomes closer to the cost of the highest-fidelity oracle. However, it is remarkable that even with a ratio of costs as small as \(1:2\), MG-GFN still outperforms not only SF-GFN but also MF-PPO in terms of cost effectiveness, without diversity being negatively impacted. It is important to note that in practical scenarios of scientific discovery, the cost of lower fidelity oracles is typically orders of magnitude smaller than the cost of the most accurate oracles, since the latter correspond to wet-lab experiments or expensive computer simulations. Figure 4: Comparative results on the molecular discovery tasks: (a) ionisation potential (IP), (b) electron affinity (EA). These visualisations are analogous to those in Fig. 3. The diversity of molecules is computed as the average pairwise Tanimoto distance (see Appendix C). Results illustrate the generally faster convergence of MF-GFN to discover a diverse set of molecules with desirable values of the target property. Figure 5: Analysis of the impact of the oracle costs on the performance of MG-GFN on the DNA task. We observe that the advantage over SF-GFN and MF-PPO (0.2, 20) decreases as the cost of the lower fidelity oracle becomes closer to the cost of the highest fidelity oracle. Nonetheless, even with a cost ratio of \(1:2\) MF-GFN displays remarkable performance with respect to other methods. Conclusions, Limitations and Future Work In this paper, we present MF-GFN, the first application of GFlowNets for multi-fidelity active learning. Inspired by the encouraging results of GFlowNets in (single-fidelity) active learning for biological sequence design [26] as a method to discover diverse, high-scoring candidates, we propose MF-GFN to sample the candidates as well as the fidelity at which the candidate is to be evaluated, when multiple oracles are available with different fidelities and costs. We evaluate the proposed MF-GFN approach in both synthetic tasks commonly used in the multi-fidelity Bayesian optimisation literature and benchmark tasks of practical relevance, such as DNA aptamer generation, antimicrobial peptide design and molecular modelling. Through comparisons with previously proposed methods as well as with variants of our method designed to understand the contributions of different components, we conclude that multi-fidelity active learning with GFlowNets not only outperforms its single-fidelity active learning counterpart in terms of cost effectiveness and diversity of sampled candidates, but it also offers an advantage over other multi-fidelity methods due to its ability to learn a stochastic policy to jointly sample objects and the fidelity of the oracle to be used to evaluate them. Broader ImpactOur work is motivated by pressing challenges to sustainability and public health, and we envision applications of our approach to drug discovery and materials discovery. However, as with all work on these topics, there is a potential risk of dual use of the technology by nefarious actors [64]. Limitations and Future WorkAside from the molecular modelling tasks, our empirical evaluations in this paper involved simulated oracles with relatively arbitrary costs. Therefore, future work should evaluate MF-GFN with practical oracles and sets of costs that reflect their computational or financial demands. Furthermore, we believe a promising avenue that we have not explored in this paper is the application of MF-GFN in more complex, structured design spaces, such as hybrid (discrete and continuous) domains [39], as well as multi-fidelity, multi-objective problems [28]. ## Code availability The code of the multi-fidelity active learning algorithm presented in this paper is open source and is available on github.com/nikita-0209/mf-al-gfn. ## Acknowledgements We thank Manh-Bao Nguyen for his contribution to the early discussions about this project. The research was enabled in part by computational resources provided by the Digital Research Alliance of Canada ([https://alliancecan.ca/en](https://alliancecan.ca/en)) and Mila ([https://mila.quebec](https://mila.quebec)). We thank Mila's IDT team for their support. We also acknowledge funding from CIFAR, IVADO, NSERC, Intel, Samsung, IBM, Genentech, Microsoft. ## Author contributions Alex Hernandez-Garcia (AHG) conceived the algorithm, implemented the GFlowNet code and drafted the manuscript. Nikita Saxena (NS) adapted the GFlowNet code to the multi-fidelity setting, implemented the multi-fidelity active learning code and carried out the experiments. The experiments were designed by Moksh Jain (MJ), NS and AHG. Cheng-Hao Liu (CHL) designed the experiments with small molecules and the diversity metrics. Yoshua Bengio (YB) guided the project. All authors contributed to writing the manuscript and analysing the results.

2309.01383

LoRA-like Calibration for Multimodal Deception Detection using ATSFace Data

Recently, deception detection on human videos is an eye-catching techniques and can serve lots applications. AI model in this domain demonstrates the high accuracy, but AI tends to be a non-interpretable black box. We introduce an attention-aware neural network addressing challenges inherent in video data and deception dynamics. This model, through its continuous assessment of visual, audio, and text features, pinpoints deceptive cues. We employ a multimodal fusion strategy that enhances accuracy; our approach yields a 92\% accuracy rate on a real-life trial dataset. Most important of all, the model indicates the attention focus in the videos, providing valuable insights on deception cues. Hence, our method adeptly detects deceit and elucidates the underlying process. We further enriched our study with an experiment involving students answering questions either truthfully or deceitfully, resulting in a new dataset of 309 video clips, named ATSFace. Using this, we also introduced a calibration method, which is inspired by Low-Rank Adaptation (LoRA), to refine individual-based deception detection accuracy.

Shun-Wen Hsiao, Cheng-Yuan Sun

2023-09-04T06:22:25Z

http://arxiv.org/abs/2309.01383v1

# LoRA-like Calibration for Multimodal Deception Detection using ATSFace Data ###### Abstract Recently, deception detection on human videos is an eye-catching techniques and can serve lots applications. AI model in this domain demonstrates the high accuracy, but AI tends to be a non-interpretable black box. We introduce an attention-aware neural network addressing challenges inherent in video data and deception dynamics. This model, through its continuous assessment of visual, audio, and text features, pinpoints deceptive cues. We employ a multimodal fusion strategy that enhances accuracy; our approach yields a 92% accuracy rate on a real-life trial dataset. Most important of all, the model indicates the attention focus in the videos, providing valuable insights on deception cues. Hence, our method adopts detects deceit and elucidates the underlying process. We further enriched our study with an experiment involving students answering questions either truthfully or deceitfully, resulting in a new dataset of 309 video clips, named ATSFace. Using this, we also introduced a calibration method, which is inspired by Low-Rank Adaptation (LoRA), to refine individual-based deception detection accuracy. multimodal, deception detection, attention mechanism, ensemble, calibration ## I Introduction Deception detection plays a crucial role in various domains, including court trials, job interviews, criminal investigations, and financial evaluations. Traditionally, trained experts would analyze an individual's micro-expressions, verbal characteristics, and transcriptions to determine the probability of deceitful behavior. However, recent advancements in artificial intelligence have led to the development of intelligent systems that are capable of acting as expert deception detectors. These systems have demonstrated remarkable accuracy rates, with some achieving up to 96.14% on real-life trials dataset [1]. Such advances have the potential to greatly enhance the efficiency and effectiveness of deception detection in various settings, leading to better outcomes for all involved parties. Nonetheless, videos contain a vast amount of information in each frame or second, presenting a significant challenge due to the high-dimensional nature of the data and the distinct representations of visual and audio modalities. However, recent advancements in the field of multimodal fusion have led to the development of more sophisticated and accurate models for integrating information from diverse modalities. This progress has enabled the exploration of new applications in various domains, including robotics, human-computer interaction, and multimedia content analysis. As a result, multimodal fusion has become a crucial aspect of modern machine learning and has the potential to impact various fields by enabling more robust and accurate decision-making systems. Aside from the aforementioned challenges, there are several other obstacles when analyzing video data. First, video data often come in varying lengths, which makes it difficult for models with fixed-size inputs to process the information effectively. Moreover, videos can contain a vast range of emotions, gestures, and expressions that are challenging to capture accurately. Additionally, variability in camera angles, lighting, and other environmental factors can cause significant differences in the video's quality, making it difficult to extract relevant information for deception detection. Furthermore, video data can come in various formats, resolutions, and compression levels, which may affect the quality and consistency of the data. Analyzing video data requires preprocessing and normalization steps to address these variations and ensure that the data is suitable for analysis. However, a significant limitation of these AI-based deception detection models is that they work as a "black box". In other words, while the AI model can determine whether an individual is being deceptive or truthful, it often fails to provide a clear explanation or reasoning behind its judgment. This lack of interpretability poses a challenge for analysts to understand the factors that contribute to the AI model's decision-making process in deception detection. Consequently, there is a growing demand for more transparent and explainable AI models that can not only accurately detect deception but also offer insights into the underlying reasons for their assessments. Deception can be viewed as a complex "process", suggesting that an interviewee is not necessarily lying throughout the entire conversation. This perspective highlights the dynamic nature of deception, where individuals may switch between truthfulness and dishonesty depending on the context, their intentions, and the information being discussed. Consequently, our model must continuously evaluate both the current information and past context to determine the final outcome. To address these challenges, we propose a recurrent neural network that incorporates an attention mechanism across multiple resources. In our study, we introduce an attention-aware neural net work designed to identify the most crucial aspects of visual, audio, and transcription data for deception detection. We present an attention mechanism designed to continuously assess facial, voice, and textual information, identifying specific moments in video, audio, and text data that reveal signs of deception. Moreover, we embrace a multimodal approach by incorporating an ensemble mechanism following multiple models with distinct features, allowing for collaborative inference of the results. This strategy enables different models to offer varying perspectives for more accurate and comprehensive deception detection. In addition, we introduced a calibration method, which is inspired by Low-Rank Adaptation (LoRA) [2], to refine individual-based deception detection accuracy. The design rationale is that we notice different individuals may reveal different characteristics while lying, and it might be difficult map all individuals into a single latent space. Therefore, we introduce an extra neural network for each one to re-map the data into a single latent space. Most important of all, we conducted an experiment with university students who were instructed to answer general questions about their school life and financial matters truthfully, as well as to create fictitious narratives on various personal topics. The resulting dataset, which we have named ATSFace, comprises 309 videos, evenly distributed between deceptive and truthful clips. This dataset was supplemented with detailed transcripts, generated through an automatic speech recognition system. Further details about the experiment and our approach to data collection and processing are presented in Section 4. In our experiments, our proposed model demonstrates a remarkable 92.00% accuracy rate when applied to a court trial dataset and 79.57% accuracy rate on our own dataset. This performance is comparable to other research efforts that utilize the same dataset and feature extraction methods. As anticipated, our multimodal ensemble model yields superior results compared to unimodal approaches, emphasizing the benefits of fusing diverse sources of information in deception detection. Furthermore, our model is designed to provide valuable insights for analysts by simultaneously outputting attention weights for each moment during the analysis. This feature enables analysts to identify specific time intervals that may contain critical cues related to deception. This combination of high accuracy and interpretability makes our model a powerful tool for both detecting deception and understanding its underlying dynamics in various contexts. ## II Related Work Over the past few years, the field of deception detection has experienced rapid advancements. In 2015, a novel public dataset was introduced for deception detection, derived from real-life trial video data [3]. This dataset comprises 121 video clips, encompassing both verbal and non-verbal features. In their initial work with the dataset, the researchers focused on investigating the potential of non-verbal features (i.e., micro-expression) for deception detection. By employing machine learning algorithms such as Decision Tree (DT) and Random Forest (RF), they could classify deceptive behavior with an accuracy of 75% with verbal and non-verbal features. Subsequently, reference [4] proposed a fully-connected layer-based model for automated deception detection. This model incorporated audio features using the openSMILE library, visual features through a 3D-CNN model, and text features via Text CNN. They implemented both early fusion and late fusion, discovering that the early fusion model performed better, achieving deception prediction accuracy of up to 96%. Since this development, multimodal research has been extensively applied to court trial datasets. In [5], they utilized Improved Dense Trajectory (IDT) to extract visual features by computing local feature correspondences in sequential frames. They applied Mel-frequency Cepstral Coefficients (MFCCs) with Gaussian Mixture Model (GMM) for audio features, and Global Vectors for Word Representation (Glove) for transcription features. Additionally, they trained a linear kernel SVM to detect micro-expression as another feature for classification. After feature encoding, they tested several classification algorithms, including SVM, DT, RF, Adaboost, etc. In [1], they employed 3D-CNN, openSMILE, and Text-CNN to process visual, audio, and textual features independently. Then, a simple fully-connected neural network was trained to reduce the dimension. In the fusion part, they tried different fusion methods to map the feature vectors into a joint space. After their experiments, they used the Hadamard product on feature vectors, concatenated the resulting vector with micro-expression labels, and finally input it into a hidden layer with ReLU activation for classification. Ultimately, their approach achieved an accuracy rate close to 96%. In contrast to previous works, reference [6] initially employed CNNs followed by an LSTM network on both visual and audio feature extraction. Additionally, they implemented an attention mechanism on visual cues in each frame, highlighting deception-related cues. Then, they concatenated the feature vectors and applied a non-linear activation function. For deception classification, they utilized Large Margin Nearest Neighbor (LMNN) [7], a metric learning approach in k-Nearest Neighbor (kNN) classification. In [8], they addressed data scarcity in the dataset by leveraging meta-learning and adversarial learning techniques. They primarily focused on visual frame sequences during feature extraction and employed ResNet50 [9] as the backbone model to process facial expressions and body motions represented by optical flow maps. They introduced a cross-stream fusion architecture for these two features in their paper. By combining these methods, they trained an end-to-end deception detection model, achieving an accuracy of about 96% using only visual features. When audio and textual features were incorporated, the accuracy increased to 97%. More recently, reference [10] adopted the state-of-the-art AffWildNet model [11], consisting of CNN and GRU layers, to extract facial affect features. Additionally, they used OpenFace, openSMILE, and Linguistic Inquiry and Word Count (LIWC) to extract visual, audio, and textual features, respectively. After feature extraction, they developed an SVM model for unimodal analysis and an Adaboost model for ensembling. In contrast to the aforementioned studies, [12] utilized the OpenPose library to extract hand gesture features, offering a unique approach to deception detection. ## III Method Our model is composed of various components: (1) extracting multimodal features such as visual, audio, and transcription; (2) models based on these extracted features for the purpose of deception classification, as shown in Fig. 1. (3) an attention mechanism to interpret visual, audio, and transcription features; and (4) an additional LoRA-like calibration network for improving individual deception detection accuracy. ### _Multimodal Feature Extraction_ #### Iii-A1 Visual Features The extraction of visual features in our approach involves two main steps: detecting faces and converting them into vector representations. We employ RetinaFace [13] for face detection, which is a state-of-the-art facial detection algorithm that excels in detecting faces with high accuracy, even under challenging conditions such as small, blurry, or partially blocked faces. Subsequently, we utilize a pretrained FaceNet [14] model as the backbone, which leverages the Inception architecture, enabling it to learn a mapping of face images directly to a compact Euclidean space. As such, it enables us to transform detected faces into 128-dimensional vectors. Considering the variable lengths of videos and the differing number of frames, which complicates LSTM training, we opt to extract features at _k_-frame intervals. This approach helps to generate a consistent representation of visual features while maintaining the essential information required for effective LSTM training. #### Iii-A2 Audio Features We employ MFCCs as our audio feature, which are a widely-used feature extraction technique in the field of speech and audio signal processing. They provide a compact representation of audio signals by capturing the spectral characteristics of the sound. MFCCs are derived from the cepstral analysis, which is a process that transforms the frequency domain of the audio signal into a time-like domain, focusing on the spectral shape rather than its amplitude. Similar to the challenge faced with visual features, training an LSTM directly on MFCCs with variable lengths can be difficult. To achieve this, we compute the mean of MFCCs per \(t\) second, which not only reduces the length of the MFCCs representation but also enables the LSTM to be trained more effectively. This condensed representation maintains the essential information while allowing the LSTM to learn temporal patterns and relationships within the audio features more efficiently. #### Iii-A3 Transcript Features For the text transcription of each video, we employ a tokenizer as an encoding step, which is then passed through a language model. For English transcripts, we segment the text sentence by sentence, and each sentence is subsequently processed through the pretrained fastText [15], generating a 100-dimensional vector per sentence. For Chinese transcripts, we employ the Chinese BERT tokenizer to process the text word by word. These vectors are then fed into Chinese BERT, pretrained by CKIP Lab, which generates a 768-dimensional vector for each word. ### _Network Architecture_ After feature extraction, we implement multimodal fusion for the following prediction. In this section, we design two architectures: (1) late fusion (decision-level) and (2) multi-head cross-attention. Figure 1 provides an overview of our approach. Since the variable length of video data, we utilize Bidirectional LSTM (BiLSTM) as the primary model architecture. BiLSTM can effectively capture both past and future contexts of an input sequence, enabling the model to handle long-term dependencies better. Furthermore, because deception is a "process", we design an attention layer to capture the most informative features. The attention layer can help the model focus on specific moments of the video that reveal the deception cue. We will now provide a detailed description of each component. #### Iii-B1 Unimodal The unimodal models comprise three main components: BiLSTM layers, an attention layer, and fully-connected layers. For each modality, we denote the extracted features as \(x_{i}=\{x_{i}^{m}:1\leq i\leq N\},m\in\{V,A,T\}\), where \(m\) stands for visual, audio, or transcription feature. These features are initially processed through the BiLSTM layers, resulting in a sequence of hidden state vectors, \(v_{i}\). The final hidden state vector, \(v_{i}\), is formed by concatenating two vectors, which are computed by the forward and backward LSTM, as shown in the following equations. \[\begin{split}\overrightarrow{v_{i}}&=\overrightarrow{LSTM }(x_{i})\\ \overleftarrow{v_{i}}&=\overleftarrow{LSTM}(x_{i}) \\ v_{i}&=[\overrightarrow{v_{i}},\overleftarrow{v_{i }}]\end{split} \tag{1}\] To gain insights into the deception detection mechanism of our model, we investigate the attention mechanism applied to visual, audio, and transcription features. Rather than focusing on the local feature details, we direct our attention to the frames of the videos. As aforementioned, we position the attention layer after the BiLSTM layer. For comparative analysis of the attention mechanism, we employ two distinct attention methods, namely, simple attention and scaled dot-product attention. During the attention calculation process, we compute attention scores and context vectors, providing a comprehensive understanding of the machine's decision-making process in deception detection. Simple Attention LayerThe simple attention layer operates without the need for query, key, and value components typically utilized in an attention mechanism. In our model, we employ a weight matrix denoted by \(W\in\mathbb{R}^{d_{model}\times 1}\) and a bias vector represented as \(b\in\mathbb{R}^{N\times 1}\) to determine the relevance of each component in the input sequence. The calculation process for the attention mechanism consists of the following equations: First, we compute the hidden representation \(h_{i}\) as follows: \[h_{i}=\tanh(v_{i}\cdot W)+b \tag{2}\] Next, we determine the attention scores \(\alpha_{i}\) using the softmax function: \[\alpha_{i}=\frac{exp(h_{i})}{\sum_{i}exp(h_{i})} \tag{3}\] Finally, we calculate the context vector \(c\) as follows: \[c=\sum_{i}v_{i}*\alpha_{i} \tag{4}\] where \(v_{i}\) stands for the output of the BiLSTM layers. The attention score for each frame \(i\) is symbolized by \(\alpha_{i}\), with \(\alpha\in\mathbb{R}^{N\times 1}\). This 1-dimensional vector allows for the straightforward identification of the frames that the model focuses on. The context vector serves as the output of the attention layer and the input for the subsequent fully-connected layer. This process allows the model to weigh the importance of different moments in the input data when making decisions for deception detection. The output of the fully connected layers is passed through a 2-dimensional softmax function, which produces the final predictions. Scaled Dot-Product AttentionIn contrast to the simple attention layer, the scaled dot-product attention incorporates query \(Q\), key \(K\), and value \(V\) components. The function is defined as follows: \[Attention(Q,K,V)=softmax(\frac{QK^{T}}{\sqrt{d_{k}}})V \tag{5}\] In this function, the query and the key are the BiLSTM output \(v_{i}\). Then, the dot-product of the query and the key is scaled by the square root of the dimension of the key \(d_{k}\). This value is then passed through the softmax function to obtain the weights on the value elements. By performing this operation, the model generates a weighted sum and the attention score, which are \(N\times d_{model}\) and \(N\times N\) dimensions respectively. As with the simple attention layer, to feed the output of the attention layer into the subsequent fully-connected layers, we employ a global max pooling operation, ultimately leading to the final deception detection prediction after the softmax operation. By leveraging these two attention mechanisms, we can effectively account for the varying importance of different moments in the input data. Consequently, our model is able to make well-informed decisions for deception detection, facilitating a robust understanding of its decision-making process. #### Iii-B2 Late Fusion The late fusion approach aims to create an integrated system that leverages the unique strengths of unimodal models for visual, audio, and transcription features. We initially build these models separately. Following this, an ensemble mechanism can effectively combine the insights obtained from the three models to yield the final result. We utilize the voting mechanism to achieve this fusion. The voting mechanism represents the straightforward way of ensemble techniques. Each unimodal model independently Fig. 1: Overview of our framework. evaluates the input data and generates its prediction. These individual predictions are then aggregated, and the final decision is made based on the majority rule, i.e., the outcome that receives the most votes from the three models is selected. This mechanism requires no additional training, as it merely collects and analyses the results of the existing models. It operates under the assumption that the majority of models will make the correct decision. #### Iii-B3 Cross-Attention Fusion To further explore the relationship between visual and audio features, we employ a cross-attention mechanism facilitated by scaled dot-product attention. As illustrated in Fig. 2, visual and audio features are initially processed through distinct BiLSTM layers as described in Equation 1, which produce hidden state vectors \(v^{V}\) and \(v^{A}\). In the cross-attention process, we use \(v^{V}\) as the query and \(v^{A}\) as the key and value, inputting them into the scaled dot-product attention of the visual part, denoted as \(CA_{V}\). Conversely, for the audio component, we generate \(CA_{A}\) using the set \(v^{A},v^{V},v^{V}\). Subsequently, we apply a residual connection [9] and layer normalization [16]. The transcription model mirrors the process mentioned above. Finally, we feed these vectors into fully-connected layers to generate the ultimate prediction. ### _LoRA-like Calibration_ When a person tells a lie, the facial expression, voice, and words expressed can differ significantly based on the individual's characteristics. In previous experiments, we aimed for a generalization model, training it based on the lying behaviors common to most individuals. However, to understand the uniqueness of each person's deception cues, we take a subset of individuals from our dataset, train our model using the clips of the remaining individuals, and then test the model on the subset. We extract the output of the visual model's attention layer for all clips and plot these as latent vectors, as demonstrated in Fig. 3. Here, we observe that the extracted vectors tend to cluster together by the individual, but these clusters cannot be accurately classified by the base model. Therefore, we introduce LoRA structure to enhance the model's performance in individual deception detection. Reference [2] presented the Low-Rank Adaptation (LoRA) method. This approach freezes pre-trained model weights and incorporates trainable matrices into each layer of the Transformer architecture. During training, the LoRA method indirectly trains specific dense layers in the neural network by optimizing the rank decomposition matrices, reflecting changes in these dense layers during adaptation. Consequently, LoRA enhances training efficiency and minimizes the number of required parameters. In order to adapt the model to these new people in our dataset, we design a LoRA-like model, as shown in Fig. 4. As mentioned, we construct a new model composed of two BiLSTM layers, a scaled dot-product attention layer, a pooling layer, and multiple dense layers. These layers' weights are then frozen as pretrained weights, and we add a new BiLSTM layer, a time-distributed dense layer, and a pooling layer after the second BiLSTM layer of the pretrained model. Ultimately, we combine the outputs of the two pooling layers and pass them through the dense layers for classification. Unlike fine-tuning the base model, the introduction of the LoRA technique can prevent the original training data from being influenced by the new data since the weights of the base model remain unchanged. The LoRA-like model linearly transforms only the new data, folding them at points in the latent space so that the pretrained dense layers can achieve accurate classification. Fig. 3: Latent Space. Blue: Truthful; Red: Deceptive; Green circle: New people Fig. 2: Cross-Attention Architecture. ## IV Evaluation ### _Dataset_ In deception detection research, the most commonly used existing dataset is the real-life trial video data in [3]. However, this dataset presents certain limitations, particularly its limited size and inconsistent recording quality. In our study, we create a new dataset, called ATSFace1, by experimenting with a multimodal approach to deception detection, which is described as follows. Footnote 1: GitHub link: [https://github.com/dclay0324/ATSFace](https://github.com/dclay0324/ATSFace) #### Iv-A1 Data Collection The primary participants for this experiment are university students. Initially, they are posed with general questions about school life and finance, to which they are instructed to respond truthfully. Subsequently, they are asked to select a topic from a list that includes their major, club experiences, internships, travel experiences, and personal hobies. Participants are instructed to create a fictitious narrative about the selected topic, detailing events or experiences they have never actually experienced. Finally, the participants are asked to choose another topic and provide an honest narrative. As shown in Fig. 5, we present the proportion of subjects chosen by the participants. The following is the example questions of major topic: 1. What major are you currently studying? What are the primary courses you are taking in this major? 2. Among these courses, which one is your favorite, and why? 3. Can you describe the content and key learning points of your favorite course? 4. Can you describe the teaching style of the professor of this course and his or her grading criteria? 5. What would you tell an incoming freshman who asked you for advice on studying in the major? For the experiment, we employed an iPhone 14 Pro for recording in a 1080p HD/30fps format, with the device positioned upright. Participants were instructed to stay seated and respond to the moderator's questions in Chinese for the entire experiment duration. Figure 6 exhibits screenshots showcasing various facial expressions captured from the video clips, demonstrating behaviors such as head movements, scowling, and upward eye gazes, among others. The final dataset derived from the experiment consists of 309 videos, of which 147 are deceptive and 162 are truthful clips. The average duration of these videos is 23.32 seconds, ranging from 10.53 to 49.73 seconds. The average lengths for deceptive and truthful clips are 23.33 seconds and 23.30 seconds, respectively. The distributions of the video length are shown in Fig. 7. We try to make the distribution of the two labels as exact as possible so that the model is not affected by the length of the videos during training and testing. The data consists of 23 unique male and 13 unique female speakers. Table I presents transcripts of sample deceptive and truthful statements from the dataset. We employ CapCut, an automatic speech recognition (ASR) system for transcription. We retain the filler and repeated words to preserve the originality of the text. The final collection of transcriptions comprises 35,069 words, including 1,403 unique words, averaging 113 words per transcript. #### Iv-A2 Real-Life Trial We also use the real-life trial video data in [3] for evaluating our models. This dataset consists of 121 video clips, including 61 deceptive and 60 truthful trial clips. In this dataset, the videos have several fps from 10 to 30. Then, the videos are variable in length, ranging from 4.5 to 81.5 seconds, and the average length is 28 seconds. We split the dataset into two subsets, training (80%) and testing (20%), and we perform 10-fold cross-validation. ### _Implementation Details_ #### Iv-B1 Max Padding Length The intervals for visual feature extraction are set to capture 5 frames per second, ensuring a consistent temporal representation across different videos, irrespective of their original frame rates. For instance, if the frame rate is 30, we select every sixth frame. In the case of audio feature extraction, we compute the mean MFCCs every \(t=0.2\) second to align with the visual features' interval. In the process of visual feature extraction, there are instances where we cannot detect a clear face in certain frames in the real-life trials dataset. To address this issue, we pad the frame with the previously detected face and continue to do so until the next face is detected. After extraction, we pad all three modalities' features to the maximum feature length. Fig. 4: LoRA-like Architecture Fig. 5: Proportion of Subjects #### Iv-C2 Model Training and Parameters In the real-life trials dataset, we set the BiLSTM layer units to 64 and 32 for both visual and audio models, and to 32 for the textual model. For the dense layers, we use 64, 16, and 8 units for the visual and textual models, 32, 16, and 8 units for the audio model, and 256, 64, and 16 units for the stacking and cross-attention model. The number of epochs is set to 20 for the visual model, 30 for the audio and textual models, and 15 for the stacking and cross-attention models. In our ATSFace dataset, the settings differ slightly: the BiLSTM layer units are set to 64 and 32 for the visual and audio models, and to 128 and 64 for the textual model. The dense layer units for all three unimodal models are uniformly set to 64, 16, and 8, and for the stacking and cross-attention model, they are set to 256, 64, and 16. The number of epochs is 40 for the visual and audio models, 30 for the textual model, and 20 for the stacking and cross-attention model. For all models, the batch size is 32. Finally, we employ the Adam algorithm as our optimizer. #### Iv-C3 Learning Rate Scheduler We apply a learning rate scheduler to adjust the learning rate during training. The learning rate remains constant for the first \(N\) epochs. After the \(N\) epoch, the learning rate decreases exponentially with a decay factor of 0.1 for each subsequent epoch. This decay scheme is formally expressed by the following equation: \[lr_{new}=\begin{cases}lr_{old},&\text{if }n<N\\ lr_{old}\times e^{-0.1},&\text{otherwise}\end{cases} \tag{6}\] where \(lr_{new}\) is the updated learning rate, \(lr_{old}\) is the previous learning rate, and \(n\) denotes the current training epoch. The learning rate is multiplied by \(e^{-0.1}\) after the \(N\) epoch to gradually reduce the step size, promoting model convergence in the optimization landscape. In the real-life trials dataset, we set the number of epochs \(N\) to 10 for the visual model, 20 for the audio model, 25 for the text model, and 10 for both the stacking and cross-attention model. In our ATSFace dataset, we adjust \(N\) to 20 for the visual and textual model, 30 for the audio model, and 10 for both the stacking and cross-attention model. Fig. 6: Sample Screenshots of Videos Fig. 7: Distribution of Video Length ### _Experiment_ #### Iv-C1 Results on Real-life Trials Dataset The experiment results are presented in Table II. In the unimodal section, it can be seen that the visual model implementing two attention methods achieves the highest accuracy at 88.80%, although the scaled dot-product attention method boasts a higher F1-score. For the audio and textual models, both perform well with simple attention. In the multimodal fusion section, the voting mechanism reaches the highest accuracy at 92.00% with an F1-score of 91.90%. Table III showcases a comparative analysis between our models and the approach proposed in the referenced research, specifically focusing on studies that employ the same feature extraction methods as ours on this real-life trials dataset. Notably, we draw a comparison with the study by Karimi et al. [6], which like our research, implements an LSTM model. This comparison serves as a benchmark, affirming the validity and competitiveness of our model relative to the existing state-of-the-art approaches in deception detection. #### Iv-C2 Results on ATSFace Dataset The experiment results on our own dataset are shown in Table IV. It is evident that our model demonstrates effectively in classifying deceptive and truthful clips when utilizing visual and textual features. These results indicate the substantial potential of our model to discriminate between truthful and deceptive instances based on visual cues and text content. However, the performance of our model decreases significantly when applied to the audio features of our dataset, indicating lower effectiveness in distinguishing deception based on audio cues. ### _Visual Interpretability_ In order to display the attention results, we extract the variable \(\alpha_{i}\), representing the attention score within the video. This variable allows us to understand the moments the model considers pivotal for deception detection. As depicted in Fig. 8, the video is 34 seconds long, labeled as 'deceptive'. We sample one frame for every 6 frames, resulting in a rate of 5 frames per second, and yielding a total of 169 frames. Our goal is to identify which frames the AI model deems most critical in determining deception. Frames with the top \(k\) attention scores are highlighted with a red rectangle around the face. Notably, during these moments, the interviewee shakes her head and compresses her lips, suggesting the AI model views these expressions as deceptive cues. Given that the video comprises 169 frames, attention scores drop sharply after frame 170, indicating the model recognizes the insignificance of padding values. ### _LoRA-like Calibration_ In our experiments, we select a subset of 6 individuals, each with more than 5 lying and truthful clips, amounting to 65 clips in total, denoted as \(S_{\mathcal{L}}\). We train the base model with the remaining 244 clips, which we divide into a training set (80%) and a testing set (20%), referred to as \(S_{\mathcal{R}}\) and \(S_{\mathcal{T}}\). After training, we plot the latent vectors of \(S_{\mathcal{L}}\) and \(S_{\mathcal{R}}\), as shown in Fig. 3. For \(S_{\mathcal{L}}\), we calibrate the LoRA-like model by individuals, using 2 deceptive clips and 2 truthful clips for model training, with the remaining clips serving as a testing set. The accuracy on the testing clips for all 6 individuals was 48.78%. We employ an early stopping mechanism during the training of the LoRA-like model, halting the process when training accuracy reached 100.0%. After training, the accuracy on the testing clips for all 6 individuals increases to 87.80%. Figure 9 displays the confusion matrices for each individual, as derived from the two models. The effectiveness of the linear transformation is evident. Fig. 8: Attention score on video ## V Conclusion * We propose an attention-aware recurrent neural network model architecture for deception detection, which effectively processes time-sequence video data, including visual, audio, and textual modalities. This model achieves remarkable accuracy in unimodal tasks. * Our model adopts a multimodal fusion mechanism, enhancing detection accuracy and comprehensiveness by integrating diverse modalities. The multimodal approach outperforms unimodal methods, underscoring the advantages of incorporating multiple information sources. * Our work introduces a new dataset, comprising 309 videos of university students' truthful and deceptive responses to various topics, supplemented with detailed automatic speech recognition transcripts. This dataset, with its clear recording of facial expressions and sounds, facilitates more accurate analysis. * We design a LoRA-like model to calibrate our base model to individual characteristics. This strategy effectively improved our model's performance on a subset of individuals. The model preserved the base model's integrity, demonstrating its effectiveness in individualized deception detection.

2302.04189

Physical Layer Security in Near-Field Communications

A near-field secure transmission framework is proposed. Employing the hybrid beamforming architecture, a multi-antenna base station (BS) transmits confidential information to a multi-antenna legitimate user (U) against a multi-antenna eavesdropper (E) in the near field. A two-stage algorithm is proposed to maximize the near-field secrecy capacity. Based on the fully-digital beamformers obtained in the first stage, the optimal analog beamformers and baseband digital beamformers can be alternatingly derived in the closed-form expressions in the second stage. Numerical results demonstrate that in contrast to the far-field secure communication relying on the angular disparity, the near-field secure communication mainly relies on the distance disparity between U and E.

Zheng Zhang, Yuanwei Liu, Zhaolin Wang, Xidong Mu, Jian Chen

2023-02-08T16:57:30Z

http://arxiv.org/abs/2302.04189v3

# Physical Layer Security in Near-Field Communications ###### Abstract A near-field secure transmission framework is proposed. Employing the hybrid beamforming architecture, a multi-antenna base station (BS) transmits confidential information to a multi-antenna legitimate user (U) against a multi-antenna eavesdropper (E) in the near field. A two-stage algorithm is proposed to maximize the near-field secrecy capacity. Based on the fully-digital beamformers obtained in the first stage, the optimal analog beamformers and baseband digital beamformers can be alternatingly derived in the closed-form expressions in the second stage. Numerical results demonstrate that in contrast to the far-field secure communication relying on the _angular disparity_, the near-field secure communication mainly relies on the _distance disparity_ between U and E. Beam focusing, near-field communications, physical layer security. ## I Introduction To fulfill the growing demands for the ubiquitous connectivity of the sixth generation (6G) wireless communications, tremendous efforts have been devoted to devising emerging technologies, e.g., millimeter wave (mmWave), terahertz (THz), and ultra-massive multiple-input-multiple-output (UMM-MIMO) [1]. However, all these key enablers rely on the employment of large-scale antennas and high frequencies, which inevitably causes wireless communications to be operated in the near-field region. In contrast to the conventional _planar-wave_ channel model of far-field scenarios, electromagnetic (EM) propagation is accurately characterized by the _spherical-wave_ channel model [2, 3] in near-field communications. The unique spherical-wave propagation model contains both the direction and distance information of the receiver, which makes array radiation patterns focus on a specific point (i.e., _beam focusing_) of the free space. Thus, near-field communications can utilize the new dimension of distance to achieve more precise signal enhancement and interference management for wireless networks, which has drawn a wide range of attention recently [4, 5, 6]. Due to the broadcast characteristics of wireless channels, the transmitted signal is exposed to vulnerable environments and is easily wiretapped by the malicious eavesdropper (E). As a complement to cryptography, physical layer security (PLS) is proposed to safeguard private information from eavesdropping [7]. PLS is capable of exploiting the physical characteristics of wireless channels, e.g., interference, fading, noise, directivity, and disparity, without introducing complicated secret key generation and management. Nevertheless, most works for PLS mainly focused on the planar-wave channel model of the far field [8, 9, 10], which restricts the security gains that arise from spatial beamforming. As shown in Fig. 1(a), the conventional secrecy _beam steering_ schemes generally utilize the angular dimension to provide security in far-field communications. However, when the E is located in the near-field region, e.g., between the base station (BS) and the legitimate user (U), the eavesdropping channels are highly correlated with legitimate channels in the angular domain, which cannot be efficiently distinguished by the far-field planar-wave channel model. Fortunately, there has been a preliminary study that exploits the distance dimension contained in the spherical-wave channel to secure wireless communications [11]. However, the dedicated secrecy beam focusing strategy for the MIMO network still lacks investigation. Meanwhile, near-field MIMO communications are usually accompanied by extremely large-scale antenna arrays, the fully-digital beamforming structure imposes huge hardware overheads on the network. Therefore, it becomes essential to develop the secrecy beam focusing scheme for MIMO networks with acceptable overheads, which motivates this work. We propose a near-field secure transmission framework. The secure beam focusing is exploited at the BS to convey the confidential information to a near-field U in the presence of an E located between the U and the BS, as shown in Fig. 1(b). The hybrid beamforming architecture is employed at the BS to reduce the radio frequency (RF) chain overhead. A secrecy capacity maximization problem is formulated subject to the analog phase-shift constraints and the baseband digital transmit power budget. A two-stage algorithm is developed to efficiently solve the resulting non-convex problem. Based on the fully-digital beamformers optimized in the first stage, the optimal analog precoders and baseband digital beamformers are alternatingly derived in closed-form expressions. Numerical results demonstrate the convergence of the proposed two-stage algorithm. It also reveals that: 1) the proposed hybrid beamforming scheme can achieve comparable performance to the fully-digital strategy; and 2) the secrecy performance in the near-field systems relies on the distance from the E to the reference point of the U, irrespective of the angle with respect to the BS. Fig. 1: Comparison of secure transmission in far-field and near-field networks. ## II System Model and Problem Formulation ### _System Model_ As shown in Fig. 1(b), we consider a near-field MIMO communication system, which consists of a BS, an U and a potential E. The uniform linear array (ULA) is adopted for all the nodes, where the BS is equipped with \(M\) antennas, the U is equipped with \(M_{\rm U}\) antennas, and the E is equipped with \(M_{\rm E}\) antennas. The antenna aperture at the BS is assumed to be \(D\). The BS operates in the high frequency band (e.g., mmWave or THz), and tries to send the confidential signal to the U in presence of the E. Both U and E are located in near-field region. The distance between the BS and U/E is assumed to be shorter than Rayleigh distance \(d_{\rm R}=\frac{2(D_{1}+D_{2})^{2}}{\lambda}\) (\(\lambda\) is the wavelength, \(D_{1}\) is the antenna aperture of the BS and \(D_{2}\) is the antenna aperture of U). Thus, the transmitted wavefronts follow the spherical propagation. We consider a challenging secure communication scenario, where the E is located in the same direction of the U but closer to the BS than the U. To resist the wiretapping of the E, the BS exploits the beam focusing to enhance the received signal strength at the U while suppressing the information leakage to the E. In the near-field systems with large number of antennas, the fully-digital beamforming architecture imposes high hardware costs as it requires each antenna to be equipped with a dedicated RF chain. As a result, the hybrid beamforming architecture at the BS is considered [12]. To elaborate, a phase-shift based analog precoder is installed between \(M_{\rm R}\) (\(M_{\rm R}<M\)) RF chains and the transmit antenna array, where each output of RF chain is send to all the transmit antennas to form the directional spatial beamformers. Then, \(K\) data streams are transmitted to the \(M\) transmit antennas via \(M_{\rm R}\) RF chains, which are subject to \(K\leq M_{\rm R}\leq M\). As a result, the transmitted signal at the BS can be expressed as \[{\bf s}={\bf P}{\bf W}{\bf x}, \tag{1}\] where \({\bf P}\in\mathbb{C}^{M\times M_{\rm R}}\) denotes the analog precoding matrix, \({\bf W}\in\mathbb{C}^{M_{\rm R}\times K}\) denotes the digital baseband beamforming matrix, and \({\bf x}\in\mathbb{C}^{K\times 1}\) (\(\mathbb{E}({\bf x}{\bf x}^{H})={\bf I}_{K}\)) denotes the data intended for U. Note that the \(i\)-th row and the \(j\)-th column element of \({\bf P}\) satisfies \[p_{i,j}\in{\cal P}\triangleq\big{\{}e^{j\theta}|\vartheta\in(0,2\pi]\big{\}}, \tag{2}\] where \(\vartheta\) represents the phase shift manipulation of \(p_{i,j}\). With this process, the received signal at U and E are given by \[{\bf y}_{\rm U}={\bf H}_{{\rm B},{\rm U}}{\bf s}+{\bf n}_{\rm U}, \tag{3}\] \[{\bf y}_{\rm E}={\bf H}_{{\rm B},{\rm E}}{\bf s}+{\bf n}_{\rm E}, \tag{4}\] where \({\bf H}_{{\rm B},{\rm U}}\in\mathbb{C}^{M_{\rm U}\times M}\) and \({\bf H}_{{\rm B},{\rm E}}\in\mathbb{C}^{M_{\rm E}\times M}\) denote the equivalent channels from the BS to U and E, \({\bf n}_{\rm U}\sim{\cal C}{\cal N}(0,\sigma^{2}{\bf I}_{M_{\rm U}})\) and \({\bf n}_{\rm E}\sim{\cal C}{\cal N}(0,\sigma^{2}{\bf I}_{M_{\rm E}})\) denote the additive white Gaussian noise (AWGN) at the U and E, respectively. Accordingly, the mutual information between the BS and U/E is given by \[C_{\rm U}=\log_{2}\text{det}\left({\bf I}_{M_{\rm U}}+\sigma^{ -2}{\bf H}_{{\rm B},{\rm U}}{\bf P}{\bf W}{\bf W}^{H}{\bf P}^{H}{\bf H}_{{\rm B },{\rm U}}^{H}\right), \tag{5}\] \[C_{\rm E}=\log_{2}\text{det}\left({\bf I}_{M_{\rm E}}+\sigma^{ -2}{\bf H}_{{\rm B},{\rm E}}{\bf P}{\bf W}{\bf W}^{H}{\bf P}^{H}{\bf H}_{{\rm B },{\rm E}}^{H}\right). \tag{6}\] Following the information-theoretic PLS [7], the secrecy performance can be characterized by the secrecy capacity, which is defined as the positive difference between the legitimate mutual information and the eavesdropping mutual information, i.e., \(C_{\rm s}=[C_{\rm U}-C_{\rm E}]^{+}\), where \([x]^{+}=\max\{x,0\}\)[9]. ### _Near-Field Channel Model_ For the near-field system, we assume that the coordinate of the midpoint of the BS antenna is \((0,0,0)\). Thus, the \(m\)-th antenna of the BS can be denoted as \((0,\tilde{m}d,0)\), where \(\tilde{m}=m-\frac{M-1}{2}\) and \(d\) denotes the antenna pitch. Similarly, the coordinates of the \(m_{\rm U}\)-th antenna at the U and the \(m_{\rm E}\)-th antenna at the E can be denoted as \((x_{\rm U},y_{\rm U}+\tilde{m}_{\rm U}d,0)\) and \((x_{\rm E},y_{\rm E}+\tilde{m}_{\rm E}d,0)\), where \(\tilde{m}_{\rm U}=m_{\rm U}-\frac{M_{\rm U}-1}{2}\) and \(\tilde{m}_{\rm E}=m_{\rm E}-\frac{M_{\rm R}-1}{2}\). Accordingly, line-of-sight (LoS) near-field channel between the BS and U can be modeled as [6] \[{\bf H}_{{\rm B},{\rm U}}(d,\theta)=\left[{\bf h}_{{\rm B},{\rm U },1},\cdots,{\bf h}_{{\rm B},{\rm U},M_{\rm U}}\right]^{T}, \tag{7}\] where \({\bf h}_{{\rm B},{\rm U},m_{\rm U}}=(1/\sqrt{M})\left[g_{m_{\rm U},1}e^{-j \frac{2\pi\varepsilon}{\varepsilon}(d_{m_{\rm U},1}-d_{m_{\rm U}})},\cdots,\right.\)\(\left.g_{m_{\rm U},M}e^{-j\frac{2\pi\varepsilon}{\varepsilon}(d_{m_{\rm U},M}-d_{m_{\rm U}})} \right]^{T}\). Note that \(|g_{m_{\rm U},m}|=\frac{c}{4\pi fd_{m_{\rm U}}}\) denotes the free-space large-scale path loss between the \(m\)-th array of the BS and the \(m_{\rm U}\)-th antenna of the U, \(d_{m_{\rm U}}\) denotes the reference distance from \((0,0,0)\) to \((x_{\rm U},y_{\rm U}+\tilde{m}_{\rm U}d,0)\), and the distance between the \(m\)-th array of the BS and the \(m_{\rm U}\)-th antenna of the U is given by \[d_{m_{\rm U},m} =\sqrt{x_{\rm U}^{2}+[\tilde{m}d-(y_{\rm U}+\tilde{m}_{\rm U}d)] ^{2}},\] \[=\sqrt{d_{m_{\rm U}}^{2}+(\tilde{m}d)^{2}-2\tilde{m}dd_{m_{\rm U}} \sin\theta_{m_{\rm U}}}, \tag{8}\] where \(\theta_{m_{\rm U}}\) denotes the azimuth angle of the \(m_{\rm U}\)-th antenna of the U with respect to \((0,0,0)\). In the same way, the near-field wiretapping channel \({\bf H}_{{\rm B},{\rm E}}(d,\theta)\) can be obtained. For simplicity, we neglect \((d,\theta)\) in \({\bf H}_{{\rm B},{\rm U}}(d,\theta)\) and \({\bf H}_{{\rm B},{\rm E}}(d,\theta)\) in the following. Note that in contrast to existing works on far-field secure communications [8, 9, 10], where the secrecy capacity is significantly degraded by the highly angular correlation between \({\bf H}_{{\rm B},{\rm U}}\) and \({\bf H}_{{\rm B},{\rm E}}\). The spherical-wave channels in the near-field communications contain the extra distance information, which helps to distinguish \({\bf H}_{{\rm B},{\rm U}}\) and \({\bf H}_{{\rm B},{\rm E}}\), and further secures the legitimate transmission. ### _Problem Formulation_ In this letter, we aim to maximize the secrecy capacity subject to the analog phase-shift constraints and the transmit power budget of the baseband digital beamformers. The problem formulation is given by \[\max_{{\bf P},{\bf W}} C_{\rm s}\] (9a) s.t. \[\|\tilde{\bf W}\|_{\rm F}^{2}\leq P_{\text{max}}, \tag{9b}\] \[p_{i,j}\in{\cal P},1\leq i\leq M,\quad 1\leq j\leq M_{\rm R}, \tag{9c}\] where \(\tilde{\bf W}\triangleq{\bf P}{\bf W}\), and \(P_{\text{max}}\) denotes the maximal transmit power at the BS. ## III Secure Beam Focusing Design In this section, we investigate the secure beam focusing of the considered near-field system. A two-stage algorithm is developed to optimize the hybrid beamformers. In particular, the block coordinate descent (BCD) approach is employed to design the fully-digital beamformers in the first stage. Then, the analog phase shifts and digital baseband precoders are alternately derived in closed-form expressions. ### _Stage-I: Fully-Digital Beamformer Design_ To provide a performance upper bound for the proposed hybrid architecture, we concentrate on the fully-digital beamformer design in the first stage, where the analog phase-shift constraints is neglected and only the transmit power budget is considered. Accordingly, the problem (9) is reformulated as \[\max_{\mathbf{W}_{\text{FD}}} C_{\text{s}}\] (10a) s.t. \[\text{Tr}(\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H})\leq P _{\text{max}}. \tag{10b}\] For notational convenience, we enable \(\mathbf{\tilde{H}}_{\text{B},\text{U}}=\sigma^{-1}\mathbf{H}_{\text{B},\text{U}}\) and \(\mathbf{\tilde{H}}_{\text{B},\text{E}}=\sigma^{-1}\mathbf{H}_{\text{B},\text{E}}\). Thus, the objective function (10a) can be expressed as \(C_{\text{s}}=\log_{2}\text{det}(\mathbf{I}_{M_{\text{E}}}+\mathbf{\tilde{H}} _{\text{B},\text{U}}\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H}\mathbf{ \tilde{H}}_{\text{B},\text{U}}^{H})-\log_{2}\text{det}(\mathbf{I}_{M_{\text{E} }}+\mathbf{\tilde{H}}_{\text{B},\text{E}}\mathbf{W}_{\text{FD}}\mathbf{W}_{ \text{FD}}^{H}\mathbf{\tilde{H}}_{\text{B},\text{E}}^{H})\). Note that the problem (10) is challenging to solve due to the intractable Shannon capacity expression in objective function (10a) and the quadratical power constraint (10b). To efficiently tackle this problem, the BCD method is adopted to iteratively solve the problem. **Lemma 1**: _Define a matrix function \(\mathbb{F}(\mathbf{U},\mathbf{W})\triangleq(\mathbf{I}-\mathbf{U}^{H}\mathbf{ H}\mathbf{W})(\mathbf{I}-\mathbf{U}^{H}\mathbf{H}\mathbf{W})^{H}+\mathbf{U}^{H} \mathbf{U}\), the following equalities hold._ _1) The positive definite matrix \(\mathbf{V}=(\mathbb{F}(\mathbf{U},\mathbf{W}))^{-1}\) satisfies_ \[\log\text{det}(\mathbf{I}+\mathbf{H}\mathbf{W}\mathbf{W}^{H}\mathbf{ H}^{H})= \max_{\mathbf{V}\succ\mathbf{0},\mathbf{U}}\log\text{det}(\mathbf{V})-\] \[\text{Tr}(\mathbf{V}\mathbb{F}(\mathbf{U},\mathbf{W}))+m, \tag{11}\] _where \(\mathbf{U}=(\mathbf{I}+\mathbf{H}\mathbf{W}\mathbf{W}^{H}\mathbf{H}^{H})^{-1} \mathbf{H}\mathbf{W}\)._ _2) For any positive definite matrix \(\mathbf{E}\in\mathbb{C}^{m\times m}\), we have_ \[-\log\text{det}(\mathbf{E})=\max_{\mathbf{V}\succ\mathbf{0}}\log\text{det}( \mathbf{V})-\text{Tr}(\mathbf{V}\mathbf{E})+m, \tag{12}\] _where \(\mathbf{V}=\mathbf{E}^{-1}\)._ Proof:: Please see the proof in [10, Lemma 4.1]. By substituting \(\mathbf{H}=\mathbf{\tilde{H}}_{\text{B},\text{E}}\), \(\mathbf{W}=\mathbf{W}_{\text{FD}}\) into (11) and \(\mathbf{E}=\mathbf{I}_{M_{\text{E}}}+\mathbf{\tilde{H}}_{\text{B},\text{E}} \mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H}\mathbf{\tilde{H}}_{\text{B}, \text{E}}^{H}\) into (12), the problem (10) can be reformulated as \[\max_{\mathbf{W}_{\text{FD}},\mathbf{V}\succ\mathbf{0},\mathbf{ V}\succeq\mathbf{0},\mathbf{U}} \;\log\text{det}(\mathbf{V}_{\text{U}})-\text{Tr}(\mathbf{V}_{\text{U}} \mathbb{F}_{\text{U}}(\mathbf{U},\mathbf{W}_{\text{FD}}))+K\] \[+\log\text{det}(\mathbf{V}_{\text{E}})-\text{Tr}(\mathbf{V}_{ \text{E}}(\mathbf{I}_{M_{\text{E}}}+\mathbf{\tilde{H}}_{\text{B},\text{E}} \mathbf{W}_{\text{FD}}^{H}\mathbf{\tilde{H}}_{\text{B},\text{E}}^{H}))+M_{ \text{E}} \tag{13a}\] \[\text{s.t.}\quad\text{Tr}(\mathbf{W}_{\text{FD}}\mathbf{W}_{ \text{FD}}^{H})\leq P_{\text{max}}, \tag{13b}\] where \(\{\mathbf{U},\mathbf{V}_{\text{U}},\mathbf{V}_{\text{E}}\}\) are the introduced auxiliary variables, and \(\mathbb{F}_{\text{U}}(\mathbf{U},\mathbf{W}_{\text{FD}})\triangleq(\mathbf{I} -\mathbf{U}^{H}\mathbf{\tilde{H}}_{\text{B},\text{U}}\mathbf{W}_{\text{FD}}) (\mathbf{I}-\mathbf{U}^{H}\mathbf{\tilde{H}}_{\text{B},\text{U}}\mathbf{W}_{ \text{FD}})^{H}+\mathbf{U}^{H}\mathbf{U}\). In the following, we solve the problem (13) iteratively by employing the BCD approach. To elaborate, the optimization variables are divided into three blocks, i.e., \(\{\mathbf{U}\}\), \(\{\mathbf{V}_{\text{U}},\mathbf{V}_{\text{E}}\}\) and \(\{\mathbf{W}_{\text{FD}}\}\). In each iteration, we optimize the optimization variables in one block while remaining the other blocks constant. #### Iii-A1 Subproblem with respect to \(\{\mathbf{U}\}\) By fixing \(\{\mathbf{V}_{\text{U}},\mathbf{V}_{\text{E}}\}\) and \(\{\mathbf{W}_{\text{FD}}\}\), the problem (13) is reduced to \(\min_{\mathbf{U}}\;\text{Tr}(\mathbf{V}_{\text{U}}\mathbb{F}_{\text{U}}( \mathbf{U},\mathbf{W}_{\text{FD}}))\). According to Lemma 1, the optimal solution of \(\mathbf{U}\) can be derived in the following expression. \[\mathbf{U}^{*}=(\mathbf{I}_{M_{\text{U}}}+\mathbf{\tilde{H}}_{ \text{B},\text{U}}\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H}\mathbf{ \tilde{H}}_{\text{B},\text{U}}^{H})^{-1}\mathbf{\tilde{H}}_{\text{B},\text{U}} \mathbf{W}_{\text{FD}}. \tag{14}\] #### Iii-A2 Subproblem with respect to \(\{\mathbf{V}_{U},\mathbf{V}_{E}\}\) With fixed \(\{\mathbf{U}\}\) and \(\{\mathbf{W}_{\text{FD}}\}\), the problem (13) is reduced to two separate subproblems, i.e., \(\max_{\mathbf{V}_{\text{U}}}\;\log\text{det}(\mathbf{V}_{\text{U}})-\text{Tr}( \mathbf{V}_{\text{U}}\succeq\mathbf{0}\mathbb{F}_{\text{U}}(\mathbf{U}, \mathbf{W}_{\text{FD}}))\) and \(\max_{\mathbf{V}_{\text{E}}\succeq\mathbf{0}}\;\log\text{det}(\mathbf{V}_{ \text{E}})-\text{Tr}(\mathbf{V}_{\text{E}}(\mathbf{I}_{M_{\text{E}}}+\mathbf{ \tilde{H}}_{\text{B},\text{E}}\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H} \mathbf{\tilde{H}}_{\text{B},\text{E}}^{H}))\). With condition for the equal sign to hold, we can derive the optimal solution of \(\{\mathbf{V}_{\text{U}},\mathbf{V}_{\text{E}}\}\), which is given by \[\mathbf{V}_{\text{U}}^{*}\!=\!\left((\mathbf{I}\!-\!\mathbf{U}^{H}\mathbf{\tilde{H}} _{\text{B},\text{U}}\mathbf{W}_{\text{FD}})(\mathbf{I}\!-\!\mathbf{U}^{H} \mathbf{\tilde{H}}_{\text{B},\text{U}}\mathbf{W}_{\text{FD}})H^{+}\!\mathbf{U}^{H} \mathbf{U}^{H}\mathbf{U}\right)^{\!-1}, \tag{15}\] \[\mathbf{V}_{\text{E}}^{*}=\left(\mathbf{I}_{M_{\text{E}}}+\mathbf{\tilde{H}}_{ \text{B},\text{E}}\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H}\mathbf{ \tilde{H}}_{\text{B},\text{E}}^{H}\right)^{-1}. \tag{16}\] #### Iii-A3 Subproblem with respect to \(\{\mathbf{W}_{\text{FD}}\}\) Solving problem (13) for \(\mathbf{W}_{\text{FD}}\) with given \(\{\mathbf{U}\}\) and \(\{\mathbf{V}_{\text{U}},\mathbf{V}_{\text{E}}\}\) is equivalent to the following subproblem. \[\min_{\mathbf{W}_{\text{FD}}} \text{Tr}(\mathbf{V}_{\text{U}}\mathbb{F}_{\text{U}}(\mathbf{U}, \mathbf{W}_{\text{FD}}))+\] \[\text{Tr}(\mathbf{V}_{\text{E}}(\mathbf{I}_{M_{\text{E}}}+\mathbf{ \tilde{H}}_{\text{B},\text{E}}\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H} \mathbf{\tilde{H}}_{\text{B},\text{E}}^{H}))\] (17a) s.t. \[\text{Tr}(\mathbf{W}_{\text{FD ### _Stage-II: Hybrid Beamformer Design_ In this subsection, we focus on the design of the hybrid beamformers. To approximately maximize the secrecy mutual information between the BS and U [15], we project the optimized \(\mathbf{W}_{\text{FD}}\) to the set of hybrid beamformers to obtain the near-optimal analog phase shifters and baseband precoders. The hybrid beamformer design problem is given by \[\min_{\mathbf{P},\mathbf{W}} \|\mathbf{W}_{\text{FD}}-\mathbf{P}\mathbf{W}\|_{\text{F}}^{2}\] (21a) s.t. \[p_{i,j}\in\mathcal{P},1\leq i\leq M,\quad 1\leq j\leq M_{\text{R}}. \tag{21b}\] Notably, problem (21) is a highly coupled quadratic problem, so we consider adopting the alternating optimization (AO) framework to iteratively optimize the digital baseband precoder and the analog phase shifters. #### Iii-B1 Digital Baseband Precoder Design With the fixed \(\mathbf{P}\), the problem (21) is reduced to \(\min_{\mathbf{W}}\|\mathbf{W}_{\text{FD}}-\mathbf{P}\mathbf{W}\|_{\text{F}}^{2}\), which can be optimally solved by adopting the first-order optimality condition. As such, the optimal \(\mathbf{W}\) is given by \[\mathbf{W}^{*}=(\mathbf{P}^{H}\mathbf{P})^{-1}\mathbf{P}^{H}\mathbf{W}_{\text {FD}}. \tag{22}\] #### Iii-B2 Analog Phase Shifter Design With the fixed \(\mathbf{W}\), the problem (21) can be reduced as \[\min_{\mathbf{P}} \text{Tr}(\mathbf{P}^{H}\mathbf{P}\mathbf{X})-2\Re(\text{Tr}( \mathbf{P}\mathbf{Y}))\] (23a) s.t. \[p_{i,j}\in\mathcal{P},1\leq i\leq M,\quad 1\leq j\leq M_{\text{R}}, \tag{23b}\] where \(\mathbf{X}=\mathbf{W}\mathbf{W}^{H}\) and \(\mathbf{Y}=\mathbf{W}_{\text{FD}}\mathbf{W}^{H}\). Since the variable \(p_{i,j}\) are separable in the unit-modulus constraint (23b), the problem (23) can be efficiently tackled by the BCD method, which iteratively optimizes each entry of \(\mathbf{P}\) while fixing the remaining elements. Consequently, the subproblem with respect to \(p_{i,j}\) is given by \[\max_{|p_{i,j}|=1} \Re(z_{i,j}p_{i,j}), \tag{24a}\] where \(z_{i,j}\) is a complex coefficient determined by the elements of \(\mathbf{P}\) except for \(p_{i,j}\). Under the unit-modulus constraint, the optimal \(p_{i,j}\) can be derived as follows. \[p_{i,j}^{*}=\frac{z_{i,j}}{|z_{i,j}|}, \tag{25}\] where \(z_{i,j}=\mathbf{Y}_{[j,j]}-(\mathbf{\tilde{X}}_{[i,j]}-p_{i,j}\mathbf{X}_{[j, j]})\) and \(\mathbf{\tilde{X}}=\mathbf{P}\mathbf{X}\). Afterwards, by alternatingly updating \(\mathbf{W}\) and \(p_{i,j}\), the digital baseband precoders and analog phase shifters can be determined. ``` 1:Initialize initial \(\mu_{\text{lower}}\) and \(\mu_{\text{upper}}\). Set a convergence accuracy \(\epsilon_{3}\). 2:repeat 3:\(\mu=\frac{\mu_{\text{lower}}+\mu_{\text{lower}}}{2}\). 4:update \(\mathbf{W}_{\text{FD}}\) according to (20). 5:if\(\text{Tr}(\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H})\leq P_{\text{max}}\) 6:\(\mu_{\text{lower}}=\mu\), 7:else 8:\(\mu_{\text{upper}}=\mu\), 9:endif 10:until the \(|\text{Tr}(\mathbf{W}_{\text{FD}}\mathbf{W}_{\text{FD}}^{H})-P_{\text{max}}| \leq\epsilon_{3}\). ``` **Algorithm 2** Bisection algorithm. ### _Overall Algorithm_ The proposed two-stage algorithm is summarized in **Algorithm 1**. For the BCD loop in **Algorithm 1**, since the optimal solutions \(\{\mathbf{U}\}\) and \(\{\mathbf{V}_{\text{U}},\mathbf{V}_{\text{E}}\}\) and the Karush-Kuhn-Tucker (KKT) point solution \(\{\mathbf{W}_{\text{FD}}\}\) are guaranteed in steps 3, 4 and 5, we readily have the following inequality \[C_{\text{s}}(\mathbf{U}^{n},\mathbf{V}_{\text{U}}^{n},\mathbf{V}_ {\text{E}}^{n},\mathbf{W}_{\text{FD}}^{n})\geq C_{\text{s}}(\mathbf{U}^{n+1}, \mathbf{V}_{\text{U}}^{n},\mathbf{V}_{\text{E}}^{n},\mathbf{W}_{\text{FD}}^{n})\geq\] \[C_{\text{s}}(\mathbf{U}^{n+1},\mathbf{V}_{\text{U}}^{n+1}, \mathbf{V}_{\text{E}}^{n+1},\mathbf{W}_{\text{FD}}^{n})\geq\] \[C_{\text{s}}(\mathbf{U}^{n+1},\mathbf{V}_{\text{U}}^{n+1}, \mathbf{V}_{\text{E}}^{n+1},\mathbf{W}_{\text{FD}}^{n+1}), \tag{26}\] which proves the convergence of the generated sequence \(\{C_{\text{s}}^{n},\cdots,C_{\text{s}}^{n+m},\cdots\}\) with \(C_{\text{s}}^{n}=C_{\text{s}}(\mathbf{U}^{n},\mathbf{V}_{\text{U}}^{n},\mathbf{ V}_{\text{E}}^{n},\mathbf{W}_{\text{FD}}^{n})\). Furthermore, by checking the KKT conditions, it is readily know that the accumulation point \(\bar{C}_{\text{s}}\) of the sequence \(\{C_{\text{s}}^{n},\cdots,C_{\text{s}}^{n+m},\cdots\}\) is the KKT solution of the original problem [10, Proposition 4.2]. In the same way, we can prove that the AO alternating iteration converges to at least the stationary point solution of the problem (21). Since all the subproblems are solved by the closed-form solutions, so the proposed two-stage algorithm is complexity-efficient. The main complexity of the proposed two-stage algorithm relies on the eigen-decomposition operation and inverse matrix operation, the whole complexity is given by \(\mathcal{O}\Big{(}l_{1}(K^{3}+M_{\text{R}}^{3}+(l_{\text{B}}+1)M^{3})+l_{2}K^{3} \Big{)}\)[14], where \(l_{1}\), \(l_{\text{B}}\) and \(l_{2}\) denote the number of iterations of the BCD loop, the Bisection algorithm, and the AO loop. ## IV Numerical Results This section provides the numerical results to validate the effectiveness of the proposed scheme. The linear topology is considered for the simulations, where the midpoint of the BS antenna is located in (0,0,0) meter (m), while midpoints of the antennas of U and E are respectively located 15 m and 5 m from the coordinate (0,0,0) m with the azimuth angle of \(45^{\circ}\). All the ULA are positioned along the y-axis. Unless otherwise specified, the default parameters are set as \(f=28\) GHz, \(d=\frac{2}{2}\), \(M=256\), \(M_{\text{U}}=8\), \(M_{\text{E}}=8\), \(M_{\text{R}}=4\), \(K=2\), \(\sigma^{2}=-105\) dBm, \(\epsilon_{1}=10^{-4}\) and \(\epsilon_{2}=\epsilon_{3}=10^{-6}\). The numerical results are averaged from 100 independent Monte-Carlo experiments. Fig. 2(a) depicts the convergence performance of **Algorithm 1**, where the beam similarity in objective function (21a) is represented as \(D_{\text{E}}\triangleq\|\mathbf{W}_{\text{FD}}-\mathbf{P}\mathbf{W}\|_{\text{F}}^{2}\). As can be seen, both the BCD loop and the AO loop in the proposed two-stage algorithm can monotonically converge the stationary point solutions within the finite iterations, which demonstrates the effectiveness of the proposed scheme. It can be also observed that the optimized hybrid beamformers can achieve the comparable performance to the fully-digital beamformers. This result can be expected since for each subproblem, the optimal analog phase shifters and baseband digital precoders are alternatingly derived in closed-form expressions in the AO loop. Fig. 2(b) illustrates the secrecy performance of the proposed algorithm, where the baseline scheme is under the default parameters. It is observed that decreasing transmit antennas or increasing E's antennas degrades the secrecy performance of the system. It is because that decreasing the transmit antennas reduces the spatial degrees-of-freedom (DoFs) that the BS can exploit, and meanwhile, increasing the antennas of E enhance the E's reception ability. Both of them narrow the gap between the legitimate channel capacity and the eavesdropping channel capacity, thus deteriorating the secrecy performance. We can also see that the secrecy capacity increases with the increasing \(d\). It is due to the fact that increasing \(d\) improves the antenna aperture, which leads to a large near-field region and enhance the angular/distance resolution of the beam focusing. In Fig. 3(a), we present the secrecy capacity versus the location of E. It can be seen that in the far-field communication, when the E is positioned in the same direction as the U, perfectly secure transmission only occurs when the eavesdropping links suffers worse channel conditions than the legitimate links. However, in the near-field communication, the perfectly secure transmission is always guaranteed, except when the E has the same position as the U. This is because that in the far-field communication, the secrecy performance is mainly dependent on the angular disparity between the U and the E with respect to the BS as the reference point. While in the near-field communication, the secrecy performance mainly relies on the distance disparity of the E with respect to the reference point of the U. To further illustrate the impact of beam focusing in near-field communications, Fig. 3(b) plots the normalized signal power spectrum over the free-space location. As can be observed, the optimized beamformers can directionally enhance the signal power at the direction of \(45^{\circ}\). Meanwhile, we can also see that at a distance of 10 m, i.e. at the position of E, the signal is fully suppressed, while at a distance of 20 m, the signal power is significantly strengthened. This result demonstrates that the proposed secure beam focusing scheme can precisely enhance the signal strength at a specific point of free space without significant energy/information leakage on the incident pathes. ## V Conclusion A novel secure near-field framework was proposed. A two-stage algorithm was developed to maximize the secrecy capacity of the U via jointly optimizing unit-modulus phase shifters and baseband digital beamformers. Numerical results were present to unveil that the secrecy performance of near-field communications is primarily relevant to the relative distance of the E with respect to the U.

2305.00348

Modality-invariant Visual Odometry for Embodied Vision

Effectively localizing an agent in a realistic, noisy setting is crucial for many embodied vision tasks. Visual Odometry (VO) is a practical substitute for unreliable GPS and compass sensors, especially in indoor environments. While SLAM-based methods show a solid performance without large data requirements, they are less flexible and robust w.r.t. to noise and changes in the sensor suite compared to learning-based approaches. Recent deep VO models, however, limit themselves to a fixed set of input modalities, e.g., RGB and depth, while training on millions of samples. When sensors fail, sensor suites change, or modalities are intentionally looped out due to available resources, e.g., power consumption, the models fail catastrophically. Furthermore, training these models from scratch is even more expensive without simulator access or suitable existing models that can be fine-tuned. While such scenarios get mostly ignored in simulation, they commonly hinder a model's reusability in real-world applications. We propose a Transformer-based modality-invariant VO approach that can deal with diverse or changing sensor suites of navigation agents. Our model outperforms previous methods while training on only a fraction of the data. We hope this method opens the door to a broader range of real-world applications that can benefit from flexible and learned VO models.

Marius Memmel, Roman Bachmann, Amir Zamir

2023-04-29T21:47:12Z

http://arxiv.org/abs/2305.00348v1

# Modality-invariant Visual Odometry for Embodied Vision ###### Abstract Effectively localizing an agent in a realistic, noisy setting is crucial for many embodied vision tasks. Visual Odometry (VO) is a practical substitute for unreliable GPS and compass sensors, especially in indoor environments. While SLAM-based methods show a solid performance without large data requirements, they are less flexible and robust w.r.t. to noise and changes in the sensor suite compared to learning-based approaches. Recent deep VO models, however, limit themselves to a fixed set of input modalities separate models in memory, relying on active sensors, or using only the highest rate modality is simply infeasible for high-speed and real-world systems. Finally, a changing sensor suite represents an extreme case of sensor failure where access to a modality is lost during test-time. These points demonstrate the usefulness of a certain level of modality invariance in a VO framework. Those scenarios decrease the robustness of SLAM-based approaches [32] and limit the transferability of models trained on RGB-D to systems with only a subset or different sensors. We introduce _"optional" modalities_ as an umbrella term to describe settings where input modalities may be of limited availability at test-time. Figure 1 visualizes a typical indoor navigation pipeline, but introduces uncertainty about modality availability (_i.e_. at test-time, only a subset of all modalities might be available). While previous approaches completely neglect such scenarios, we argue that explicitly accounting for "optional" modalities already _during training_ of VO models allows for better reusability on platforms with different sensor suites and trading-off costly or unreliable sensors during test-time. Recent methods [12, 64] use Convolution Neural Network (ConvNet) architectures that assume a constant channel size of the input, which makes it hard to deal with multiple "optional" modalities. In contrast, Transformers [51] are much more amenable to variable-sized inputs, facilitating the training of models that can optionally accept one or multiple modalities [4]. Transformers are known to require large amounts of data for training from scratch. Our model's data requirements are significantly reduced by incorporating various biases: We utilize multi-modal pre-training [4, 17, 30], which not only provides better initializations but also improves performance when only a subset of modalities are accessible during test-time [4]. Additionally, we propose a token-based action prior. The action taken by the agent has shown to be beneficial for learning VO [35, 64] and primes the model towards the task-relevant image regions. We introduce the Visual Odometry Transformer (VOT), a novel modality-agnostic framework for VO based on the Transformer architecture. Multi-modal pre-training and an action prior drastically reduce the data required to train the architecture. Furthermore, we propose explicit modality-invariance training. By dropping modalities during training, a single VOT matches the performance of separate unimodal approaches. This allows for traversing different sensors during test-time and maintaining performance in the absence of some training modalities. We evaluate our method on point-goal navigation in the _Habitat Challenge 2021_[1] and show that VOT outperforms previous methods [35] with training on only 5% of the data. Beyond this simple demonstration, we stress that our framework is modality-agnostic and not limited to RGB-D input or discrete action spaces and can be adapted to various modalities, _e.g_., point clouds, surface normals, gyroscopes, accelerators, compass, etc. To the best of our knowledge, VOT is the first widely applicable modality-invariant Transformer-based VO approach and opens up exciting new applications of deep VO in both simulated and real-world applications. We make our code available at github.com/memmelma/VO-Transformer. ## 2 Related Work **SLAM- vs Learning-based Navigation:** Simultaneous Localization and Mapping (SLAM) approaches decompose the navigation task into the components of mapping, localization, planning, and control [49]. These methods rely on explicit visual feature extraction and, therefore, fail in realistic settings with noisy observations [64], while learning-based methods are more robust to noise, ambiguous observations, and limited sensor suites [27, 32]. However, learning-based methods require an order of magnitude more data, _e.g_., available through simulation [40]. To deal with the large data requirements, SLAM- and learning-based methods can be combined [5, 8, 11, 63, 14, 8]. **Visual Odometry for Realistic Indoor Navigation:** While most VO methods estimate an agent's pose change from more than two frames [52, 53] or optical flow [66], subsequent frames in indoor environments share almost no overlap and contain many occlusions due to the large displacement caused by the discrete action space [64]. Datta _et al_. [12] propose to estimate the pose change from consecutive frames via a ConvNet architecture and decouple learning the VO from the task-specific navigation policy to allow for retraining modules when dynamics change or the actuation experiences noise. Zhao _et al_. [64] improve the model's robustness to observation and actuation noise through geometric invariance losses [54], separate models for moving and turning, pre-process observations, and introduce dropout [44]. Finally, Partsev _et al_. [35] explore the need for explicit map building in autonomous indoor navigation. They apply train- and test-time augmentations and concatenate an action embedding similar to Zhao _et al_. [64] to the extracted visual features. A trend is to exploit simulators to gather large datasets (1M [64], 5M [35]). While this is a reasonable progression, it is infeasible to re-train the VO model whenever dynamics or sensor configurations change. **Multi-modal Representation Learning:** The availability of multi-modal or pseudo-labeled [4] data [13, 16, 34, 38, 59, 65], _e.g_., depth, video, and audio, makes it possible to learn feature-rich representations over multiple modalities. Together with Transformer's [51] ability to process a token sequence of arbitrary length, this leads to general-purpose architectures that can handle various modalities [23] like video, images, and audio [30] or single-view 3D geometry [17]. In particular, Multi-modal Multi-task Masked Autoencoder (MultiMAE) [4] is a multi-modal pre-training strategy that performs masked autoencoding [19] with RGB, Depth, and Semantic Segmenation(SemSeg). We show that fine-tuning a pre-trained MultiMAE model can significantly increase VO performance using only 5% of the training data amount of previous methods [35]. ## 3 Proposed Method ### Preliminaries In the realistic PointGoal Navigation task [2], an agent spawns at a random position in an unseen environment and is given a random goal location relative to its starting position. At each time step \(t\) of an episode, the agent perceives its environment through observations \(\mathbf{o}_{t}\) and executes an action \(a_{t}\) from a set of discrete actions (move fwd\(0.25m\), turn left and right by \(30^{\circ}\)). The stop action indicates the agent's confidence in having reached the goal. Because the relative goal position \(\mathbf{g}_{t}\) is defined at the beginning of each episode, it has to be updated throughout the episode as the actions change the agent's position and orientation. Following [12, 64], we update \(\mathbf{g}_{t}\) through an estimate of the agent's coordinate transformation. With access to GPS+Compass, computing this transformation is trivial. However, since those sensors are unavailable, we estimate the transformation from the agent's subsequent observations \(\mathbf{o}_{t},\mathbf{o}_{t+1}\) and update the estimated relative goal position \(\widehat{\mathbf{g}}_{t}\). When taking an action \(a_{t}\), the agent's coordinate system \(C_{t}\) transforms into \(C_{t+1}\). Because the agent can only navigate planarly in the indoor scene, we discard the 3rd dimension for simplicity. We define the estimated transformation as \(\widehat{\mathbf{H}}\in SE(2)\), with \(SE(2)\) being the group of rigid transformations in a 2D plane and parameterize it by the estimated rotation angle \(\widehat{\beta}\in\mathbb{R}\) and estimated translation vector \(\widehat{\mathbf{\xi}}\in\mathbb{R}^{2}\): \[\widehat{\mathbf{H}}=\begin{bmatrix}\widehat{R}&\widehat{\mathbf{\xi}}\\ 0&1\end{bmatrix},\quad\widehat{R}=\begin{bmatrix}\cos(\widehat{\beta})&-\sin( \widehat{\beta})\\ \sin(\widehat{\beta})&\cos(\widehat{\beta})\end{bmatrix}\in SO(2). \tag{1}\] We then learn a VO model \(f_{\phi}\) with parameters \(\phi\) predicting \(\widehat{\beta},\widehat{\mathbf{\xi}}\) from observations \(\mathbf{o}_{t},\mathbf{o}_{t+1}\): \(\widehat{\beta},\widehat{\mathbf{\xi}}=f_{\phi}(\mathbf{o}_{t},\mathbf{o}_{t+1})\) Finally, we transform \(\widehat{\mathbf{g}}_{t}\) in coordinate system \(C_{t}\) to the new agent coordinate system \(C_{t+1}\) by \(\widehat{\mathbf{g}}_{t+1}=\widehat{\mathbf{H}}\cdot\widehat{\mathbf{g}}_{t}\). ### Visual Odometry Transformer **Model Architecture:** When facing "optional" modalities, it is not yet clear how systems should react. Options range from constructing an alternative input, _e.g._, noise [29], to falling back on a model trained without the missing modalities, to training the network with placeholder inputs [31]. Besides these, recent approaches depend on a fixed set of modalities during train- and test-time due to their ConvNet-based backbone. Transformer-based architectures can process a variable number of input tokens and can be explicitly trained to accept fewer modalities during test-time while observing multiple modalities throughout training [4, 51]. Furthermore, the Transformer's global receptive field could be beneficial for VO, which often gets solved with correspondence or feature matching techniques [41]. We, therefore, propose the Visual Odometry Transformer (VOT), a multi-modal Transformer-based architecture for VO. **Visual Odometry Estimation:** To estimate the VO parameters, we pass the encoded Action Token (\([ACT]\)) token to a prediction head. We use a two-layer Multi-layer Perceptron (MLP) with learnable parameters \(\psi\) composed into \(\mathbf{W_{0}}\in\mathbb{R}^{d\times d_{h}},\mathbf{b}_{0}\in\mathbb{R}^{d_{h}}\), and \(\mathbf{W_{1}}\in\mathbb{R}^{d_{h}\times 3},\mathbf{b}_{1}\in\mathbb{R}^{3}\) Figure 2: The Visual Odometry Transformer architecture for RGB-D input. Image patches are turned into tokens through modality-specific linear projections \(\blacksquare\) before a fixed positional embedding is added to them. We pass an action token that embeds the action \(\blacksquare\) taken by the agent as we find it acts as a strong prior on the VO problem. An MLP-head \(\blacksquare\) then estimates the VO parameters \(\widehat{\beta},\widehat{\mathbf{\xi}}\), i.e., translation and rotation of the agent, from the output token. By randomly dropping either RGB or Depth during training, the Transformer backbone \(\blacksquare\) becomes modality-agnostic, allowing it to deal with a subset of these input modalities during test-time without losing performance. When more modalities are available during training, other modality-specific linear projections can be added to process the additional information. with token dimensions \(d=768\), and hidden dimensions \(d_{h}=d/2\). A Gaussian Error Linear Unit (GELU) [21] acts as the non-linearity between the two layers. The VO model can then be defined as a function \(f_{\phi,\psi}(\mathbf{o}_{t},\mathbf{o}_{t+1},a_{t})\) taking as input the action \(a_{t}\) and the observations \(\mathbf{o}_{t},\mathbf{o}_{t+1}\) corresponding to either RGB, Depth, or RGB-D and predicting the VO parameters \(\widehat{\beta},\widehat{\mathbf{\xi}}\). Simplifying the backbone as \(b_{\phi}(\mathbf{o}_{t},\mathbf{o}_{t+1},a_{t})\) that returns extracted visual features \(\mathbf{v}_{t\to t+1}\in\mathbb{R}^{1\times d}\), and governed by parameters \(\phi\), the resulting model is: \[b_{\phi}(\mathbf{o}_{t},\mathbf{o}_{t+1},a_{t}) =\mathbf{v}_{t\to t+1} \tag{2}\] \[\mathrm{MLP}_{\psi}(\mathbf{v}) =\mathrm{GELU}(\mathbf{v}\mathbf{W_{0}}+\mathbf{b}_{0})\mathbf{W_{1}}+\mathbf{b}_{1}\] \[f_{\phi,\psi}(\mathbf{o}_{t},\mathbf{o}_{t+1},a_{t}) =\mathrm{MLP}_{\psi}(b_{\phi}(\mathbf{o}_{t},\mathbf{o}_{t+1},a_{t}))= \widehat{\beta},\widehat{\mathbf{\xi}}\] **Action Prior:** The action \(a_{t}\) taken by the agent to get from \(\mathbf{o}_{t}\) to \(\mathbf{o}_{t+1}\) is a powerful prior on the VO parameters. To provide this information to the model, we embed the action using an embedding layer [36]. This layer acts as a learnable lookup for each action, mapping it to a fixed-size embedding. With the embedding size equal to the token dimensions, we can create an \([ACT]\) and pass the information directly to the model (_cf_. Figure 2). In contrast to [35, 64], we pass the token directly to the encoder instead of concatenating it to the extracted features. This practice conditions the visual feature extraction on the action and helps ignore irrelevant parts of the image. Note that this approach is not limited to discrete actions but tokens could represent continuous sensor readings like accelerometers, gyroscopes, and compasses, allowing for flexible deployment, _e.g_., in smartphones or autonomous vehicles [43]. **Explicit Modality-invariance Training:** Explicitly training the model to be invariant to its input modalities is one way of dealing with missing sensory information during test-time. To enforce this property, we drop modalities during training to simulate missing modalities during test-time. Furthermore, this procedure can improve training on less informative modalities by bootstrapping model performance with more informative ones. For example, RGB is more prone to overfitting than Depth because the model can latch onto spurious image statistics, _e.g_. textures. Training on RGB-only would likely cause the model to latch onto those and converge to local minima, not generalizing well to unseen scenes. By increasing the amount of Depth observations seen during training, the model learns to relate both modalities, acting as regularization. We model this notion as a multinomial distribution over modality combinations (here: RGB, Depth, RGB-D) with equal probability. For each batch, we draw a sample from the distribution to determine on which combination to train. ## 4 Experimental Evaluation ### Setup **Simulation:** We use the AI Habitat (Habitat) simulator for data collection and model evaluation, following the Habitat PointNav Challenge 2020 [1] specifications. The guidelines define an action space of fwd (move forward \(0.25m\)), left (turn left by \(30^{\circ}\)), right (turn right by \(30^{\circ}\)), and stop (indicate the agent reached its goal), and include a sensor suite of RGB-D camera, and GPS+Compass (not used in the realistic PointGoal navigation task). The RGB observations get returned into a \([0,255]\) range while the Depth map is scaled to \([0,10]\). Both sensors are subject to noise, _i.e_., noisy actuations [33] and observations [10]. Furthermore, collision dynamics prevent _sliding_, a behavior that allows the agent to slide along walls on collision. Cosmetic changes bring the simulation closer to the LoCoBot [18], a low-cost robotic platform with an agent radius of \(0.18m\) and height of \(0.88m\). An optical sensor resolution of \(341\times 192\) (width \(\times\) height) emulates an Azure Kinect camera. An episode is successful if the agent calls stop in a radius two times its own, _i.e_., \(0.36m\), around the point goal and does so in \(T=500\) total number of time steps. By specification, the 3D scenes loaded into Habitat are from the Gibson [57] dataset, more precisely Gibson-4+ [40], a subset of 72 scenes with the highest quality. The validation set contains 14 scenes, which are not part of the training set. **Dataset:** For training VOT, we collect a training- and a validation dataset. Each set consists of samples containing the ground truth translation \(\mathbf{\xi}\) and rotation parameters \(\beta\) retrieved from a perfect GPS+Compass sensor, observations \(\mathbf{o}_{t},\mathbf{o}_{t+1}\), and taken action \(a_{t}\). We keep samples where the agent collides with its environment as the transformations strongly differ from standard behavior [64]. The collection procedure follows Zhao _et al_. [64] and is performed as: 1) initialize the Habitat simulator and load a scene from the dataset, 2) place the agent at a random location within the environment with a random orientation, 3) sample a navigable PointGoal the agent should navigate to, 4) compute the shortest path and let the agent follow it, and 5) randomly sample data points along the trajectory. We collect \(250\,\mathrm{k}\) observation-transformation pairs from the training and \(25\,\mathrm{k}\) from the validation scenes of Gibson-4+, which is significantly less than comparable methods (\(1\,\mathrm{M}\)[64], \(5\,\mathrm{M}\)[35]). Furthermore, we apply data augmentation during training to the left and right actions by horizontally flipping the observations and computing the inverse transformation. **Loss Function:** Our loss function is the \(L2\)-norm between the ground truth VO parameters and their estimated counterparts. We further add the geometric invariance losses \(\mathcal{L}_{inv}\) proposed by Zhao _et al_. [64] and use the Adam [26] optimizer (\(\beta_{1}=0.9,\beta_{2}=0.999,\epsilon=1e^{-8}\)) to minimize the resulting loss function \(\mathcal{L}=\|\mathbf{\xi}-\widehat{\mathbf{\xi}}\|_{2}^{2}+\|\beta-\widehat{\beta}\|_ {2}^{2}+\mathcal{L}_{inv}\). **Pre-training:** Pre-training is a well-known practice to deal with the large data requirements of Vision Transformers (ViTs) [14, 60], especially in a VO setting where data is scarce [14, 25, 45]. We use the pre-trained MultiMAE (RGB + Depth + SemSeg) made publicly available by Bachmann [3]. Since SemSeg is unavailable in our setting, we discard the corresponding projection layers. **Training Details:** We follow prior work [12, 35, 64] and train our navigation policy and VO model separately before jointly evaluating them on the validation set. In contrast to [12, 64], we do not fine-tune the navigation policy on the trained VO models as it has shown minimal navigation performance gains in [64] and was abandoned in [35]. We train all models, including baselines, for 100 epochs with 10 warm-up epochs that increase the learning rate linearly from \(0.0\) to \(2e^{-4}\), and evaluate the checkpoints with the lowest validation error. We further find gradient norm clipping [62] (max gradient norm of \(1.0\)) to stabilize the training of VOT but to hurt the performance of the ConvNet baselines. The training was done with a batch size of 128 on an NVIDIA V100-SXM4-40GB GPU with automatic mixed-precision enabled in PyTorch [36] to reduce memory footprint and speed up training. Our backbone is a ViT-B [14] with a patch size of \(16\times 16\) and 12 encoder blocks with 12 Multi-head Attention (MHA) heads each, and token dimensions 768. To encode the input into tokens, we use a 2D sine-cosine positional embedding and separate linear projection layers for each modality. Note that if additional modalities are available, our model can be extended by adding additional linear input projections or fine-tuning existing ones [4]. Finally, we pass all available tokens to the model and resize each observation to \(160\times 80\times c\) (width \(\times\) height \(\times\) channels c) and concatenate modalities along their height to \(160\times 160\times c\) to reduce computation. We keep a running mean and variance to normalize RGB and Depth to zero mean and unit variance. **Evaluation Metrics:** Anderson [2] propose the Success weighted by (normalized inverse) Path Length (SPL) to evaluate agents in a PointGoal or ObjectGoal navigation setting. A crucial component of this metric is the success of an episode (success \(S=1\), failure \(S=0\)). With \(l\) the shortest path distance from the starting position and \(p\) the length of the path taken by the agent, the SPL over \(N\) episodes is defined as \(\text{SPL}=\frac{1}{N}\sum_{i=0}^{N-1}S^{(i)}\frac{l^{(i)}}{\max(p^{(i)},l^{( i)})}\). \begin{table} \begin{tabular}{l c c c c c} \hline \hline Method & Drop & \(S\uparrow\) & SPL\(\uparrow\) & SSPL\(\uparrow\) & \(d_{g}\downarrow\) \\ \hline VOT RGB & – & 59.3 & 45.4 & 66.7 & 66.2 \\ VOT Depth & – & 93.3 & 71.7 & 72.0 & 38.0 \\ \hline [12] & – & 64.5 & 48.9 & 65.4 & 85.3 \\ VOT & – & 88.2 & 67.9 & 71.3 & 42.1 \\ VOT w/ _inv._ & – & **92.6** & **70.6** & **71.3** & **40.7** \\ \hline [12] & RGB & 0.0 & 0.0 & 5.4 & 398.7 \\ VOT & RGB & 75.9 & 58.5 & 69.9 & 59.5 \\ VOT w/ _inv._ & RGB & **91.0** & **69.4** & **71.2** & **37.0** \\ \hline [12] & Depth & 0.0 & 0.0 & 5.4 & 398.7 \\ VOT & Depth & 26.1 & 20.0 & 58.7 & 148.1 \\ VOT w/ _inv._ & Depth & **60.9** & **47.2** & **67.7** & **72.1** \\ \hline \hline \end{tabular} \end{table} Table 1: Results for dropping modalities during test-time. Training a VOT to be modality-invariant (_w/ inv._) leads to no performance drop in comparison to a VOT trained on a single modality (VOT RGB, VOT Depth). This shows that a single VOT _w/ inv._ can replace multiple modality-dependent counterparts. Previous approaches [12, 35, 64] become inapplicable, converging to a Blind behavior. Metrics reported as \(e^{-2}\). **Bold** indicates best results. Figure 3: Top-down map of the agent navigating the _Cantwell_ scene [58] from start () to goal (). The plot shows the shortest path (), the path taken by the agent (), and the “imaginary” path the agent took,, its VO estimate (). We evaluate the model without RGB or Depth (_Drop_) to determine performance when modalities are missing. As expected, the VOT relies heavily on both modalities, causing the estimation to drift when either RGB or Depth is unavailable (top row). The localization error accumulates over the course of the trajectory and causes the true and imaginary path to diverge, resulting in failure to complete the episodes. Training a VOT to be modality-invariant (VOT w/ inv._) removes those reliances and leads to success even when modalities are missing (bottom row). While SPL depends on the success of an episode, [12] propose the Soft Success Path Length (SSPL) that provides a more holistic view of the agent's navigation performance. The authors replace the binary success \(S\) of an episode with a soft value consisting of the ratio between the (geodesic) distances to target upon start \(d_{init}\) and termination of an episode \(d_{g}\). The resulting metric is then \(\text{SSPL}=\frac{1}{N}\sum_{i=0}^{N-1}\left(1-d_{g}^{(i)}/d_{init}^{(i)} \right)\frac{t^{(i)}}{\max\left(p^{(i)},l^{(i)}\right)}\) The closer the agent gets to the goal, the higher the SSPL, even if the episode is unsuccessful. This softening allows distinguishing agents that fail to complete a single or multiple episodes but move significantly close to the goal from ones that move away from it. Without access to GPS+Compass, SSPL becomes significantly more important as an agent might call stop prematurely due to inaccurate localization. We report the SPL, SSPL, success \(S\), and (geodesic) distance to goal on termination \(d_{g}\) on the validation scenes of Gibson-4+ with decimals truncated. **Navigation Policy:** Similar to prior work [12, 64, 35], we replace the GPS+Compass with our VO model to estimate the relative goal position, which serves as the input to a pre-trained navigation policy. We use the same pre-trained policy as Zhao _et al_. [64] for our experiments, which was trained using a goal position updated by ground truth localization. The policy architecture consists of a Long Short-Term Memory (LSTM) [22] with two recurrent layers that process 1) a 512-dimensional encoding of the agent's observations \(\mathbf{o_{t}}\) (here: Depth), 2) a 32-dimensional embedding of the previous action, and 3) a 32-dimensional embedding of the updated relative goal position. The observation encoding gets obtained by passing the observations \(\mathbf{o}_{t}\) through a ResNet-18 [20] backbone, flattening the resulting feature map to dimensionality 2052, and projecting it to dimensionality 512 with a fully-connected layer. Finally, the output of the LSTM is fed through another fully-connected layer to produce a distribution over the action space and a value function estimate. The policy was trained using DDPO [55], a distributed version of Proximal Policy Optimization (PPO) [42]. ### Dealing With Optional Modalities We evaluate the models' robustness to missing modalities by randomly dropping access to one of the training modalities. This setup probes VOT for dependencies on the input modalities, which directly influence the downstream performance under limited access. In case of sensor malfunctioning, _e.g_., only a single modality might be available, a ConvNet's failure is predetermined as it requires a fixed-size input. If not given, the system converges to a Blind behavior, exemplified in Table 1. Limiting access to modalities reveals VOT's dependency on Depth. Dropping RGB barely decreases performance, while dropping Depth causes the localization to fail more drastically. Comparing the true agent localization and its "imaginary", _i.e_., VO estimate, it becomes clear why. Figure 3 shows how the errors accumulate, causing the true location to drift away from the estimate. While the effect is less drastic when dropping RGB, the agent still fails to reach the goal. Training VOT with the proposed invariance training (_w/ im._), _i.e_., sampling RGB for 20%, Depth for 30%, and RGB-D for 50% of the training batches, eliminates this shortcoming. Removing RGB now only decreases the success rate by \(1.6\%\), while removing Depth also leads to a stronger performance. This observation suggests that RGB is less informative for the VO task than Depth. Especially when navigating narrow passages, RGB might consist of uniform observations, _e.g_., textureless surfaces like walls, making it hard to infer the displacement, unlike Depth which would still provide sufficient geometric information (_cf_. Figure 3). However, this information asymmetry only leads to a decline in the metrics that are sensitive to subtle inconsistencies in the localization, _i.e_., \(S\), and SPL. Inspecting the SSPL, the drop of \(-3.5\) is less drastic. Explicit modality-invariance training keeps VOT-B (RGB-D) Figure 4: Absolute difference between ground truth translations \(\mathbf{\xi_{x}},\mathbf{\xi_{x}}\) and rotation angle \(\mathbf{\beta}\) to their estimated counterparts \(\widehat{\cdot}\). We compare _Zhao et al_. [64] (Table 2, 2) to the VOT (Table 2, 13). Our model estimates fwd translation along the \(z\)-axis (_middle_), left, right along \(z\)-, \(x\)-axis (_left_, _middle_), and the turning angle \(\beta\) (_right_) more accurately than the baseline. We successfully capture the displacements caused by the noisy actuation with an average error (over both axis \(x\), \(z\)) of \(0.25\,\mathrm{cm}\) (fwd), \(0.7\,\mathrm{cm}\) (right), and \(0.65\,\mathrm{cm}\) (left). from exploiting this asymmetry and matches the performance of VOT-B (RGB) when Depth is dropped during test-time Tab. 1. ### Quantitative Results We compare our approach to Zhao [64] in terms of downstream navigation performance,, the VO model as GPS+Compass replacement for a learned navigation agent. We use the same publicly available navigation policy for both approaches and the published VO models of the baseline [64]. Using only 25% of the training data, VOT improves performance by \(S+12.3\), SPL\(+9.7\), SSPL\(+2.0\) (_cf_. Table 2 15) and \(S+7.2\), SPL\(+5.7\), SSPL\(+1.3\) (_cf_. Table 2 16). When training the baseline on our smaller data set (_cf_. Table 2 2, unified, ResNet-50), this improvement increases to \(S+29.8\), SPL\(+22.8\), SSPL\(+6.6\) (_cf_. Table 2 15) and \(S+23.7\), SPL\(+19.0\), SSPL\(+5.9\) (_cf_. Table 2 16). To capture the raw VO performance detached from the indoor navigation task, we inspect the absolute prediction error in Figure 4. We differentiate between translation \(\mathbf{\xi}\) in \(x\)- and \(y\)- direction (\(\xi_{x}\), \(\xi_{y}\)), and taken action. VOT is accurate up to \(0.36\,\mathrm{cm}\) (fwd), \(1.04\,\mathrm{cm}\) (right), \(1.05\,\mathrm{cm}\) (left) in \(x\)- direction and \(0.20\,\mathrm{cm}\) (fwd), \(0.41\,\mathrm{cm}\) (right), \(0.38\,\mathrm{cm}\) (left) in \(z\)-direction. Note how the baseline struggles to capture \(\xi_{z}\), corresponding to the forward-moving direction \(z\) when taking the fwd action. Given the results in Table 2, we advise using VOT trained on Depth-only when access is assumed, as the difference to using GPS+Compass is a mere \(S-4.5\), SPL\(-3.1\), SSPL\(-1.1\). When "optional" modalities are needed,, they are expected to change during test-time, invariance training should be used. Trained on RGB-D, this setup also reaches GPS+Compass like performance with differences of only \(S-5.2\), SPL\(-4.2\), SSPL\(-1.8\). ### Ablation Study We identify the impact of different input modalities and model design choices in our ablation study (_cf_. Table 2). Without observations, the Blind VO model cannot update the goal position. This means the agent can only act without goal-related feedback, resulting in a \(0\%\) success rate. Extending the model with our proposed \([ACT]\) token allows it to surpass the Blind performance. Able to up \begin{table} \begin{tabular}{c c c c c c c c c c} \hline \hline & Method & Observations & Pre-train & \([ACT]\) & \(S\uparrow\) & SPL\(\uparrow\) & SSPL\(\uparrow\) & \(d_{g}\downarrow\) & \(\mathcal{L}_{train}\downarrow\) & \(\mathcal{L}_{val}\downarrow\) \\ \hline \hline 1 & [64] (separate) & RGB-D & & 22.4 & 13.8 & 31.5 & 305.3 & 0.125 & 0.186 \\ 2 & [64] (unified) & RGB-D & \(\mathbf{\check{\mathbf{\nu}}}\) & 64.5 & 48.9 & 65.4 & 85.3 & 0.264 & 0.420 \\ \hline \hline 3 & Blind & – & & 0.0 & 0.0 & 5.4 & 398.7 & 48.770 & 47.258 \\ 4 & VOT-B & RGB & & 27.1 & 21.2 & 57.7 & 177.0 & 0.735 & 1.075 \\ 5 & VOT-B & Depth & & 43.2 & 32.0 & 59.3 & 122.5 & **0.441** & **0.644** \\ 6 & VOT-B & RGB-D & & **47.3** & **36.3** & **61.2** & **119.7** & 1.256 & 1.698 \\ \hline 7 & Blind & – & \(\mathbf{\check{\mathbf{\nu}}}\) & 13.3 & 10.0 & 46.3 & 251.8 & 1.637 & 1.641 \\ 8 & VOT-B & RGB & \(\mathbf{\check{\mathbf{\nu}}}\) & 42.0 & 32.3 & 62.7 & 107.0 & 0.043 & 0.571 \\ 9 & VOT-B & Depth & \(\mathbf{\check{\mathbf{\nu}}}\) & **76.1** & **58.8** & **69.2** & **60.7** & **0.017** & **0.113** \\ 10 & VOT-B & RGB-D & \(\mathbf{\check{\mathbf{\nu}}}\) & 72.1 & 55.6 & 68.5 & 64.4 & 0.019 & 0.129 \\ \hline \hline 11 & VOT-B & RGB & \(\mathbf{\check{\mathbf{\nu}}}\) & 54.5 & 41.3 & 65.2 & 69.9 & 0.056 & 0.347 \\ 12 & VOT-B & Depth & \(\mathbf{\check{\mathbf{\nu}}}\) & 83.2 & 63.4 & 69.1 & **49.9** & 0.079 & 0.205 \\ 13 & VOT-B & RGB-D & \(\mathbf{\check{\mathbf{\nu}}}\) & **85.7** & **65.7** & **69.7** & 56.1 & **0.021** & **0.060** \\ \hline 14 & VOT-B & RGB & \(\mathbf{\check{\mathbf{\nu}}}\) & 59.3 & 45.4 & 66.7 & 66.2 & 0.003 & 0.280 \\ 15 & VOT-B & Depth & \(\mathbf{\check{\mathbf{\nu}}}\) & **93.3** & **71.7** & **72.0** & **38.0** & **0.004** & **0.044** \\ 16 & VOT-B & RGB-D & \(\mathbf{\check{\mathbf{\nu}}}\) & 88.2 & 67.9 & 71.3 & 42.1 & 0.004 & 0.051 \\ \hline \hline 17 & VOT-B _w/ inv._ & RGB-D & \(\mathbf{\check{\mathbf{\nu}}}\) & \(\mathbf{\check{\mathbf{\nu}}}\) & **92.6** & **70.6** & **71.3** & **40.7** & **0.008** & **0.094** \\ \hline \hline \end{tabular} \end{table} Table 2: Ablation study of architecture design and input modalities. We further investigate pre-training with MultiMAE [4] in models 11-14. Losses \(\mathcal{L}\), Success \(S\), SPL, SSPL, and \(d_{g}\) reported as \(e^{-2}\). **Bold** indicates best results. \begin{table} \begin{tabular}{c c c c c} \hline \hline Rank & Participant team & S & SPL & SSPL & \(d_{g}\) \\ \hline 1 & **MultiModalVO (VOT)** (ours) & 93 & 74 & 77 & 21 \\ 2 & VO for Realistic PointGoal [35] & 94 & 74 & 76 & 21 \\ 3 & inspir.ai robotics & 91 & 70 & 71 & 70 \\ 4 & VO2021 [64] & 78 & 59 & 69 & 53 \\ & Differentiable SLAM-net [24] & 65 & 47 & 60 & 174 \\ \hline \hline \end{tabular} \end{table} Table 3: **Habitat Challenge 2021.** Results for the Point Nav Test-Standard Phase (test-std split) retrieved on 05-Nov-2022. date the relative goal position, the agent reaches an SSPL of \(46.3\), but due to the actuation noise, it calls stop correctly only \(13.3\%\) of the time. Access to RGB or Depth allows the VO model to adjust to those unpredictable displacements. While the RGB and Depth observations correlate with the \([ACT]\) token, they also contain information about the noisy actuation. Vice versa, \([ACT]\) disambiguates corner cases where the visual observations do not provide explicit information about the underlying action. For instance, a fwd action colliding with a wall might be hard to distinguish from a noisy left turning less than \(30^{\circ}\)[64]. Our results show that MultiMAE pre-training provides useful multi-modal features for VO that fine-tuned outperform the ConvNet baselines. In addition, these features are complementary to the \([ACT]\) prior, together achieving state-of-the-art results. We conclude that the \([ACT]\) prior biases the model towards the mean of the corresponding transformation, while the pre-training supports the learning of the additive actuation noise. Training separate models for each modality reveals that Depth is a more informative modality than RGB for VO. We assume this to be a direct result of its geometric properties, _i.e_., the 3D structure of the scene. We find that training VOT on noisy RGB even hurts the localization. The model overfits the visual appearance of the scenes and is unable to generalize to unseen ones. In turn, Depth does not suffer from this issue as it only contains geometric information. ### Action-conditioned Feature Extraction We show what image regions the model attends to by visualizing the attention maps of the last MHA-layer (_cf_. Table 216) corresponding to the \([ACT]\) token in Figure 5. To reduce the dimensionality of the visualization, we fuse the heads' weights via the \(max\) operator and align the attention maps with the input images. We normalize the maps to show the full range of the color scheme. We find that passing different actions to VOT primes it to attend to meaningful regions in the image. When passed turning actions left or right, VOT focuses on regions present at both time steps. This makes intuitive sense, as a turning action of \(30^{\circ}\) strongly displaces visual features or even pushes them out of the agent's field of view. A similar behavior emerges for a fwd action which leads to more attention on the center regions, _e.g_., the walls and the end of a hallway (_cf_. Figure 4(b)). These results are particularly interesting as the model has no prior knowledge about the VO task but learns something about its underlying structure. ### Habitat Challenge 2021 PointNav We compare our approach (_cf_. Table 216) to several baselines submitted to the _Habitat Challenge 2021_ benchmark in Table 3. Using the same navigation policy as Partsey _et al_. [35], VOT achieves the highest SSPL and on par SPL and \(d_{g}\) training on only 5% of the data. These results clearly show that reusability doesn't come with a price of lower performance and that scaling data requirements doesn't seem to be the answer to solving deep VO. ### Limitations In our work, we separate the VO model from the navigation policy and only focus on the modality-invariance of the former, neglecting that the navigation policy expects Depth as input [12, 35, 64]. Designing policies to be modality-invariant is subject to future research. Assuming an accurate sensor failure detection when dropping modalities, additionally, is an idealized setup. Furthermore, our experiments in the Habitat's simulator limit the available modalities to RGB-D. Even though SemSeg has shown to be beneficial for some VO applications [37, 50], there is no specific sensor for it. However, SemSeg could be estimated from RGB. While our experiments focus on discrete actions and RGB-D, our architecture could be adapted to continuous actions and other sensor types. However, training might become more difficult due to a lack of pre-trained weights. ## 5 Conclusions We present Visual Odometry Transformers for learned Visual Odometry. Through multi-modal pre-training and action-conditioned feature extraction, our method is sample efficient and outperforms current methods trained on an order of magnitude more data. With its modality-agnostic design and modality-invariance training, a single model can deal with different sensor suites during training and can trade-off subsets of those during test-time. Figure 5: Attention maps of the last attention layer of VOT (_cf_. Table 213). Brighter color indicates higher (\(\blacksquare\)) and darker color lower (\(\blacksquare\)) weighting of the image patch. The VOT learns to focus on regions present in both time steps \(t,t+1\), _i.e_., outer image regions for turning left, and center regions for moving fwd. Artifacts of the Gibson dataset get ignored (_cf_. Figure 4(b)).

2310.04398

Analysis and Algorithmic Construction of Self-Assembled DNA Complexes

DNA self-assembly is an important tool that has a wide range of applications such as building nanostructures, the transport of target virotherapies, and nano-circuitry. Tools from graph theory can be used to encode the biological process of DNA self-assembly. The principle component of this process is to examine collections of branched junction molecules, called pots, and study the types of structures that can be constructed. We restrict our attention to pots which contain one set of complementary cohesive-ends, i.e. a single bond-edge type, and we identify the types and sizes of structures that can be built from such a pot. In particular, we show a dependence between the order of graphs in the output of the pot and the number of arms on the corresponding tiles. Furthermore, we provide two algorithms which will construct complete complexes for a pot with a single bond-edge type.

Cory Johnson, Andrew Lavengood-Ryan

2023-10-06T17:43:20Z

http://arxiv.org/abs/2310.04398v1

# Analysis and Algorithmic Construction of Self-Assembled DNA Complexes ###### Abstract DNA self-assembly is an important tool that has a wide range of applications such as building nanostructures, the transport of target virotherapies, and nano-circuitry. Tools from graph theory can be used to encode the biological process of DNA self-assembly. The principle component of this process is to examine collections of branched junction molecules, called pots, and study the types of structures that can be constructed. We restrict our attention to pots which contain one set of complementary cohesive-ends, i.e. a single bond-edge type, and we identify the types and sizes of structures that can be built from such a pot. In particular, we show a dependence between the order of graphs in the output of the pot and the number of arms on the corresponding tiles. Furthermore, we provide two algorithms which will construct complete complexes for a pot with a single bond-edge type. keywords: graph theory, graph algorithms, DNA self-assembly, flexible tile model + Footnote †: journal: Journal of the American Statistical Association ## 1 Introduction DNA self-assembly is a vital experimental process that is being utilized in labs across the country. The use of DNA self-assembly as a bottom-up technology for creating target nanostructures was introduced in Seeman's laboratory in the 1980s [13]. The process relies on the complementary nature of nucleotides that comprise the structure of DNA. DNA self-assembly has applications ranging from the construction of nanostructures to experimental virotherapies [5; 14]. Graphs are natural mathematical models for DNA self-assembled structures and we use a combination of graph theoretic and algebraic tools to optimize the assembly process. The nature of the nucleotide base pairing allows DNA to be configured into a variety of shapes, such as hairpins, cubes, and other non-traditional structures [2; 7; 10; 15; 18]. The nature of the nucleotide base pairing may also be utilized to build larger structures [2; 15; 18]. Two models of the assembly process emerge: a model which utilizes rigid tiles [16; 17; 11], and the other using flexible tiles [9; 12]. We study the flexible tile model which has been used to construct structures such as the cube and truncated octahedron [2; 15; 18]. A detailed description of the graph theoretic model of flexible tile DNA self-assembly can be found in [1; 4; 5]. In the DNA self-assembly process, target structures are built from _branched junction molecules_, which are asterisk-shaped molecules whose arms consist of strands of DNA. The end of each arm contains unsatisfied nucleotide bases creating a _cohesive-end_. Each cohesive-end will bond with a complementary cohesive-end from another arm via Watson-Crick base pairing. We will formalize this process in Section 2. Rather than referring to the precise nature of a cohesive-end (such as the exact nucleotide configuration), we use single alphabet letters to distinguish between cohesive-ends of different types. For example, \(a\) and \(b\) denote two non-compatible cohesive-ends, but cohesive-end \(a\) will bond with cohesive-end \(\hat{a}\). We use the term _bond-edge type_ to refer to a pair of complementary cohesive-ends. A collection of branched junction molecules used in the self-assembly process is called a pot. Previous research has investigated questions arising from determining the most efficient pot given a target complete complex [1; 4; 5]. We study the inverse question: given a pot, what are the complete complexes that can be assembled? In [1], it was shown that determining if a given pot will realize a graph of a given order is NP-hard. Thus, we restrict our attention to specialized cases; in particular, we study the case where the pot contains one bond-edge type. At this time we reserve our attention to three open questions: 1. What are the sizes of the DNA complexes that can be realized by a specific pot? 2. What types and what distributions of branched junction molecules does a pot use in realizing a target DNA complex? 3. Exactly what types of DNA complexes do we expect a pot to realize? (e.g. disconnected or connected complexes) Section 2 formalizes the graph theoretic model of the DNA self-assembly process. Section 3 is a collection of our results related to the three questions above, with Section 4 providing algorithms for producing connected graphs. We end in Section 5 with some insight into future directions. ## 2 Encoding DNA Complexes using Graph Theory The following graph theoretic model of DNA self-assembly is consistent with [1; 4; 5; 8]. Relevant definitions are copied here for the reader. A graph \(G\) consists of a set \(V=V(G)\) of vertices and a set \(E=E(G)\) of 2-element subsets of \(V\), called edges. Note that we allow for \(G\) to be a multigraph. A DNA complex is composed of \(k\)-armed branched junction molecules, which are asterisk-shaped molecules with \(k\) arms of strands of DNA. Two arms can bond only if they have complementary base pairings. See Figure 1 for an example of a branched junction molecule along with an example of Definition 1. Definition 1 translates the biological process of self-assembly into a combinatorial representation. **Definition 1**.: Consider a \(k\)-armed branched junction molecule. 1. A \(k\)-armed branched junction molecule is modeled by a _tile_. A tile is a vertex with \(k\) half-edges representing the _cohesive-ends_ (or arms) of the molecule \(a,b,c,\dots\). We will denote complementary cohesive-ends with \(\hat{a},\hat{b},\hat{c},\dots\). 2. A _bond-edge type_ is a classification of the cohesive-ends of tiles (without regard to hatted and unhatted letters). For example, \(a\) and \(\hat{a}\) will bond to form bond-edge type \(a\). 3. We denote tile types by \(t_{j}\), where \(t_{j}=\{a_{1}^{e_{1}},\hat{a}_{1}^{e_{2}},\dots,a_{k}^{e_{2k-1}},\hat{a}_{k}^{e_ {2k}},\dots\}\). The exponent on \(a_{i}\) indicates the quantity of cohesive-ends of type \(a_{i}\) present on the tile. 4. A _pot_ is a collection of distinct tile types such that for any cohesive-end type that appears on any tile in the pot, its complement also appears on some tile in the pot. We denote a pot by \(P\). 5. It is our convention to think of bonded arms (that is, where cohesive-end \(a_{i}\) has been matched with cohesive-end \(\hat{a_{i}}\)) as edges on a graph, and we think of the bond-edge type as providing direction and compatibility of edges. Unhatted cohesive-ends will denote half-edges directed away from the vertex, and hatted cohesive-ends will denote a half-edge directed toward the vertex. When cohesive-ends are matched, this will result in a directed edge pointing away from the tile that had an unhatted cohesive end and toward the vertex that had a hatted cohesive end. **Definition 2**.: [4] An _assembling pot_\(P_{\lambda}(G)\) for a graph \(G\) with assembly design \(\lambda\) is the multiset of tiles \(t_{v}\) where \(t_{v}\) is associated to vertex \(v\in V(G)\). Note that it is possible that tile \(t_{u}=t_{v}\) even if \(u\neq v\). If we view a vertex \(v\) as its set of half-edges and a tile as a multiset of labels, then the labeling \(\lambda\) can be used to map vertices to tiles by \(\lambda:V\to P_{\lambda}(G)\) such that \(\lambda(v)=t_{v}\). **Definition 3**.: We say that a graph \(G\) is _realized_ by a pot \(P\) if there exists a map \(f:\{v_{*}\}\to P\) from the set of vertices with half-edges to the tile types with the following properties: 1. If \(v_{*}\mapsto t\), then there is an associated one-to-one correspondence between the cohesive ends of \(t\) and the half-edges of \(v\). 2. If \(\{u,v\}\in E(G)\), then the two half-edges of \(\{u,v\}\) are assigned complementary cohesive ends. The following result from [5] provides a foundation for the work presented in Section 3. Let \(P=\{t_{1},\ldots,t_{p}\}\) be a pot with \(p\) tile types, and define \(A_{i,j}\) to be the number of cohesive ends of type \(a_{i}\) on tile \(t_{j}\) and \(\hat{A}_{i,j}\) to be the number of cohesive ends of type \(\hat{a}_{i}\) on tile \(t_{j}\). Suppose a target Figure 1: A branched junction molecule and its associated tile representation. graph \(G\) of order \(n\) is realized by \(P\) using \(R_{j}\) tiles of type \(j\). Since we consider only complete complexes, we have the following equations: \[\sum_{j}R_{j}=n\text{ and }\sum_{j}R_{j}(A_{i,j}-\hat{A}_{i,j})=0\qquad\text{ for all }i. \tag{1}\] Define \(z_{i,j}=A_{i,j}-\hat{A}_{i,j}\) and \(r_{j}\) to be the proportion of tile-type \(t_{j}\) used in the construction of \(G\). Then the equations in Equation 1 become \[\sum_{j}r_{j}=1\text{ and }\sum_{j}r_{j}z_{i,j}=0\qquad\text{for all }i. \tag{2}\] The equations in Equation 2 naturally define a matrix associated to \(P\). **Definition 4**.: Let \(P=\{t_{1},t_{2},\ldots,t_{p}\}\) be a pot. Then the _construction matrix_ of \(P\) is given by \[M_{P}=\begin{array}{ccccc}t_{1}&t_{2}&\cdots&t_{p}\\ a_{1}&z_{1,1}&z_{1,2}&\cdots&z_{1,p}\\ a_{2}&z_{2,1}&z_{2,2}&\cdots&z_{2,p}\\ \vdots&\vdots&\ddots&\vdots\\ z_{m,1}&z_{m,2}&\cdots&z_{m,p}\\ 1&1&\cdots&1&1\end{array}\Bigg{]}.\] In general, there are infinitely many solutions to the system of equations defined by \(M_{P}\), so it is desirable to concisely express these solutions. However, we only consider those solutions in \((\mathbb{Q}\cap[0,1])^{p}\). That is, vectors whose entries are rational numbers between \(0\) and \(1\). **Definition 5**.: The solution space of \(M_{P}\) is called the spectrum of \(P\), and is denoted by \(\mathcal{S}(P)\). The following lemma from [5] indicates when a solution to the construction matrix will realize a graph of a particular order. **Lemma 1**.: _[_5_]_ _Let \(P=\{t_{1},\ldots,t_{p}\}\). If \(\langle r_{1},\ldots,r_{p}\rangle\in\mathcal{S}(P)\), and there exists an \(n\in\mathbb{Z}_{\geq 0}\) such that \(nr_{j}\in\mathbb{Z}_{\geq 0}\) for all \(j\), then there is a graph of order \(n\) such that \(G\in\mathcal{O}(P)\) using \(nr_{j}\) tiles of type \(t_{j}\). Let \(m_{P}\) denote the smallest order of a graph in \(\mathcal{O}(P)\)._ We will focus exclusively on pots with one bond-edge type, meaning \(M_{P}\) will be a \(2\times p\) matrix. The following example demonstrates there may be more than one graph in the output of a pot \(P\) with the same order. **Example 1**.: Consider the pot \(P=\{t_{1}=\{a^{3}\},,t_{2}=\{\hat{a}^{3}\},t_{3}=\{\hat{a}\}\}\). The construction matrix is \[M_{P}=\begin{bmatrix}3&-3&-1\\ 1&1&1\end{bmatrix}.\] To determine \(\mathcal{S}(P)\), row-reduce \(M_{P}\) to obtain \[\text{rref}(M_{P})=\begin{bmatrix}1&0&\frac{1}{3}\\ 0&1&\frac{\epsilon}{3}\end{bmatrix}\begin{array}{c}\frac{1}{7}\\ \frac{1}{2}\end{bmatrix}.\] Thus we have \[\mathcal{S}(P)=\left\{\frac{1}{6k}\left\langle 3k-2z,3k-4z,6z\right\rangle\mid k \in\mathbb{Z}^{+},z\in\mathbb{Q}\cap\left[0,\frac{3k}{4}\right]\right\},\] and P realizes, for example, two nonisomorphic graphs of order 4. ## 3 Pots with a 1-Armed Tile Since complementary cohesive-ends bond together, a tile type of the form \(t=\{a^{j},\hat{a}^{k}\}\) may form loops, leaving unmatched cohesive-ends either of the form \(a^{j-k}\) or \(\hat{a}^{k-j}\) depending on the magnitude of \(j\) and \(k\). For this paper, we only consider multigraphs without loops so we study tile types with only one cohesive-end type; that is, we restrict ourselves to the pot of tiles of the form \(P_{1}=\{t_{1}=\{a^{e_{1}}\},t_{2}=\{\hat{a}^{e_{2}}\},t_{3}=\{\hat{a}\},\ldots\}\) for some \(e_{1}>0\) and \(e_{2}>1\). The 1-armed tile \(\{\hat{a}\}\) ensures that \(P\) will always realize a complete complex. In all but Theorem 3, we assume \(e_{1}\geq e_{2}\). Note that all of the results here can be stated identically for \(P_{1}^{\prime}=\{\{a^{e_{1}}\},\{\hat{a}^{e_{2}}\},\{\hat{a}\},\ldots\}\) where \(e_{1}<e_{2}\) by swapping the roles of \(a\) and \(\hat{a}\). The pot \(P_{1}\) has corresponding construction matrix \[M_{P_{1}}=\begin{bmatrix}e_{1}&-e_{2}&-1&\cdots&0\\ 1&1&1&\cdots&1\end{bmatrix}.\] Unless otherwise specified, for the remainder of the paper we reserve the notation \(P\) for the pot \(P=\{t_{1}=\{a^{e_{1}}\},t_{2}=\{\hat{a}^{e_{2}}\},t_{3}=\{\hat{a}\}\}\) because \(\mathcal{O}(P)\subseteq\mathcal{O}(P_{1})\). That is, any graph realized by \(P\) will also be realized by the pot \(P_{1}\). These simplifications are necessary since determining if a graph of order \(n\) is realized by a pot is known to be NP-hard in general [1]. The spectrum of \(P\) is described in Lemma 2. Figure 2: A branched junction molecule and its associated tile representation. **Lemma 2**.: _Consider the pot \(P\) with the associated construction matrix_ \[M_{P}=\begin{bmatrix}e_{1}&-e_{2}&-1&0\\ 1&1&1&1\end{bmatrix}. \tag{3}\] _Then_ \[\mathcal{S}(P)=\left\{\frac{1}{k(e_{1}+e_{2})}\left\langle ke_{2}-(e_{2}-1)z, ke_{1}-(e_{1}+1)z,(e_{1}+e_{2})z\right\rangle\mid k\in\mathbb{Z}_{\geq 0},z\in \mathbb{Q}\cap\left[0,\frac{ke_{1}}{e_{1}+1}\right]\right\}.\] Proof.: Row-reduce \(M_{P}\) to obtain \[\text{rref}(M_{P})=\begin{bmatrix}1&0&\frac{e_{2}-1}{e_{1}+e_{2}}&\frac{e_{2}} {e_{1}+e_{2}}\\ 0&1&\frac{e_{1}+1}{e_{1}+e_{2}}&\frac{e_{1}}{e_{1}+e_{2}}\end{bmatrix}. \tag{4}\] From Equation 4, we have \[x =\frac{1}{e_{1}+e_{2}}[e_{2}-(e_{2}-1)z], \tag{5}\] \[y =\frac{1}{e_{1}+e_{2}}[e_{1}-(e_{1}+1)z],\] (6) \[z =\frac{1}{e_{1}+e_{2}}[(e_{1}+e_{2})z]. \tag{7}\] Equations 5, 6 and 7 yield the desired result. We now turn our attention to the set of graphs in the output of \(P\). The following examples demonstrate three types of graphs that are realized by \(P\) for any \(e_{1}\) and \(e_{2}\). **Example 2**.: The Division Algorithm guarantees there exist unique integers \(q\) and \(r\) such that \(e_{1}=e_{2}q+r\) where \(0\leq r<e_{2}\). The pot \(P\) realizes a graph of order \(q+r+1\). Proof.: Set \(z=\frac{r}{q+r+1}\) and \(k=1\). We will use the substitution \(e_{1}=e_{2}q+r\) in strategic places in this proof. Then by Lemma 2 we have the particular solution \[\frac{1}{e_{1}+e_{2}}\left\langle e_{2}-(e_{2}-1)\left(\frac{r}{ q+r+1}\right),e_{1}-(e_{1}+1)\left(\frac{r}{q+r+1}\right),(e_{1}+e_{2})\left( \frac{r}{q+r+1}\right)\right\rangle\] \[=\frac{1}{e_{1}+e_{2}}\left\langle\frac{e_{2}q+e_{2}r+e_{2}-e_{2 }r+r}{q+r+1},\frac{e_{1}q+e_{1}r+e_{1}-e_{1}r-r}{q+r+1},\frac{(e_{1}+e_{2})r}{ q+r+1}\right\rangle\] \[=\frac{1}{e_{1}+e_{2}}\left\langle\frac{e_{2}q+r+e_{2}}{q+r+1}, \frac{e_{1}q+e_{1}-r}{q+r+1},\frac{(e_{1}+e_{2})r}{q+r+1}\right\rangle\] \[=\frac{1}{e_{1}+e_{2}}\left\langle\frac{e_{1}+e_{2}}{q+r+1}, \frac{e_{1}q+e_{2}q+r-r}{q+r+1},\frac{(e_{1}+e_{2})r}{q+r+1}\right\rangle\] \[=\left\langle\frac{1}{q+r+1},\frac{q}{q+r+1},\frac{r}{q+r+1} \right\rangle.\] By Lemma 1, the graph of order \(q+r+1\) has tile distribution \((1,q,r)\). **Example 3**.: The pot \(P\) realizes a graph of order \(1+e_{1}\). Proof.: Set \(z=\frac{e_{1}}{1+e_{1}}\) and \(k=1\). Then by Lemma 2, we have the particular solution \[\frac{1}{e_{1}+e_{2}}\left\langle e_{2}-(e_{2}-1)\left(\frac{e_{1} }{1+e_{1}}\right),e_{1}-(e_{1}+1)\left(\frac{e_{1}}{1+e_{1}}\right),(e_{1}+e_{ 2})\left(\frac{e_{1}}{1+e_{1}}\right)\right\rangle\] \[=\frac{1}{e_{1}+e_{2}}\left\langle e_{2}-\frac{e_{1}(e_{2}-1)}{1+ e_{1}},e_{1}-e_{1},\frac{e_{1}(e_{1}+e_{2})}{1+e_{1}}\right\rangle\] \[=\left\langle\frac{e_{2}(1+e_{1})-e_{1}(e_{2}-1)}{(e_{1}+e_{2})(1 +e_{1})},0,\frac{e_{1}}{1+e_{1}}\right\rangle\] \[=\left\langle\frac{e_{2}+e_{1}e_{2}-e_{1}e_{2}+e_{1}}{(e_{1}+e_{ 2})(1+e_{1})},0,\frac{e_{1}}{1+e_{1}}\right\rangle\] \[=\left\langle\frac{1}{1+e_{1}},0,\frac{e_{1}}{1+e_{1}}\right\rangle.\] By Lemma 1, the graph of order \(1+e_{1}\) can be realized with tile distribution \((1,0,e_{1})\). **Example 4**.: The pot \(P\) realizes a graph of order \(e_{1}+e_{2}\). Proof.: Set \(z=0\) and \(k=1\). Then by Lemma 2, we have the particular solution \(\frac{1}{e_{1}+e_{2}}\left\langle e_{2},e_{1},0\right\rangle\) and by Lemma 1, a graph of order \(e_{1}+e_{2}\) can be realized with tile distribution \((e_{2},e_{1},0)\). **Example 5**.: Let \(P=\{\{a^{9}\},\{\hat{a}^{6}\},\{\hat{a}\}\}\). Then, according to Examples 2, 3, and 4, \(P\) will realize graphs of order \(5\), \(10\), and \(15\), respectively. Examples of each of these graphs is provided in Figures 3 and 4. ### Connections Between \(e_{1}\), \(e_{2}\), and \(\mathcal{O}(P)\) In this section, we demonstrate how certain relationships between \(e_{1}\) and \(e_{2}\) will determine the orders of the graphs in \(\mathcal{O}(P)\). In particular, We show that if \(G\in\mathcal{O}(P)\), then the order of \(G\) is dependent upon \(\gcd(e_{1}+1,-e_{2}+1)\). The most straightforward case is presented in our first theorem which states the conditions in which \(P\) will realize graphs of orders that are multiples of \(\gcd(e_{1}+1,-e_{2}+1)\). **Theorem 1**.: _For the pot \(P\), if \(\text{gcd}(e_{1}+1,-e_{2}+1)=d\neq 1\), then \(P\) realizes a graph of order \(n\) if and only if \(n=kd\) where \(k\in\mathbb{Z}_{\geq 0}\) and \(n\geq m_{P}\)._ Proof.: From Equation 3, we have the system of equations \[\left\{\begin{array}{l}e_{1}x-e_{2}y-z=0,\\ x+y+z=n,\end{array}\right. \tag{8}\] where \(x,y,z\in\mathbb{Z}_{\geq 0}\). Adding these equations, we obtain \[(e_{1}+1)x+(-e_{2}+1)y=n. \tag{9}\] This is a linear Diophantine equation in two variables and since \(\gcd(e_{1}+1,-e_{2}+1)=d\neq 1\), a solution to this equation exists if and only if \(n=kd\), which establishes the desired result. **Corollary 1**.: _Let \(P\) be a pot where \(e_{1}\) is odd and \(e_{1}=e_{2}\). Then \(P\) realizes a graph for all orders \(n\) where \(n\in 2\mathbb{Z}_{\geq 0}\)._ Proof.: From Theorem 1, it is sufficient to notice that since \(e_{1}\) is odd and \(e_{1}=e_{2}\), \(\gcd(e_{1}+1,-e_{1}+1)=2\). Hence all graphs realized by \(P\) must have order \(2k\) for \(k\in\mathbb{Z}_{\geq 0}\). **Example 6**.: Let \(P=\{\{a^{3}\},\{\hat{a}^{3}\},\{\hat{a}\}\}\). Then by Corollary 1, \(P\) realizes a graph of every even order. Two distinct connected graphs are provided below: the graph of minimal order \(2\), and a graph of order \(6\). The case when \(e_{1}=e_{2}\) is even is not as immediate since \(gcd(e_{1}+1,-e_{1}+1)=1\). We provide a motivating example in which \(gcd(e_{1}+1,-e_{2}+1)=1\). **Example 7**.: Consider the pot \(P=\{\{a^{6}\},\{\hat{a}^{4}\},\{\hat{a}\}\}\). The associated construction matrix is \[M_{P}=\begin{bmatrix}6&-4&-1&0\\ 1&1&1&1\end{bmatrix}\] and \(\mathcal{S}(P)=\{\frac{1}{10k}\langle 4k-3z,6k-7z,10z\rangle\mid k\in\mathbb{Z}_{ \geq 0},z\in\mathbb{Q}\cap[0,\frac{6k}{7}]\}\). When \(k=1\) and \(z=\frac{1}{2}\) we obtain a graph of order \(4\) with tile distribution \((1,1,2)\), which is a graph of minimal order in \(\mathcal{O}(P)\) (see Figure 6). Notice that from Equation 9, there is an associated linear Diophantine equation \(7x-3y=n\). Software can be used to verify that the pot \(P\) does not realize a graph of every order; i.e. the results of Theorem 1 do not generalize when \(gcd(e_{1}+1,-e_{2}+1)=1\). There are some important observations from Example 7. It appears \(P\) realizes a graph for all orders \(n\), except when \(n=1,2,3,6\). Notice the smallest order graph realized by \(P\) is order \(4\), but \(P\) does not realize a graph of order \(5\). Theorem 2 generalizes the idea that there is some lower bound after which \(P\) will realize a graph of any order and this lower bound may not be the order of the smallest graph realized by \(P\). **Definition 6**.: Let \(S_{P}=\{n\mid n+k\text{ is the order of some }G\in\mathcal{O}(P)\text{ for every }k\in\mathbb{N}\}\). The _lower density bound_ of \(P\) is \(\zeta=\min(S_{P})\). That is, the lower density bound \(\zeta\) is the smallest order for which \(P\) realizes a graph of every order larger than \(\zeta\). In general, it is difficult to predict \(\zeta\) for \(P\). However, Theorem 2 provides a lower bound that is close to \(\zeta\). **Theorem 2**.: _Consider the pot \(P\) where gcd\((e_{1}+1,-e_{2}+1)=1\). Then \(P\) realizes a graph for every order \(n\) with \(n\geq\text{max}\Big{\{}\frac{(e_{1}+1)(e_{1}+e_{2})}{e_{1}},\frac{(e_{2}-1)(e_ {1}+e_{2})}{e_{2}}\Big{\}}\)._ Proof.: From Equation 9, \(P\) realizes a graph \(G\) of order \(n\) if and only if \((e_{1}+1)x+(-e_{2}+1)y=n\) for some \(x\) and \(y\). Solving for \(y\) and defining \(y=f(x)\) gives the function \[f(x)=\frac{n-(e_{1}+1)x}{-e_{2}+1}.\] Since we only consider nonnegative solutions \((x,f(x))\) to Equation 9 (i.e. \(x\geq 0\) and \(y=f(x)\geq 0\)), then we will find upper bounds for \(x\) and \(f(x)\) to guarantee that a solution exists. The key observation is to notice \(z=n-(x+f(x))\) from Equation 8. Thus, substituting for \(f(x)\) we have \[z=\frac{-e_{2}n+(e_{1}+e_{2})x}{-e_{2}+1}.\] To find the upper bound on \(x\) and \(f(x)\), we determine the value for which \(z=0\). When \(z\geq 0\), we have \(x\leq\frac{e_{2}n}{e_{1}+e_{2}}\). This provides the bounds \[\left\{\begin{array}{l}0\leq x\leq\frac{e_{2}n}{e_{1}+e_{2}},\\ 0\leq f(x)\leq f\left(\frac{e_{2}n}{e_{1}+e_{2}}\right)=\frac{e_{1}n}{e_{1}+e_ {2}}.\end{array}\right.\] The slope of \(f(x)\) is \(\frac{e_{1}+1}{e_{2}-1}\). Let \((x_{1},f(x_{1}))=\min\{(x,f(x))\in\mathbb{Z}^{2}\mid x\geq e_{2}-1\text{ and }f(x)\geq e_{1}+1\}\). The slope of \(f(x)\) guarantees \[\left\{\begin{array}{l}0\leq x_{1}-(e_{2}-1)<e_{2}-1,\\ 0\leq f(x_{1})-(e_{1}+1)<e_{1}+1,\end{array}\right.\] with \((x_{1}-(e_{2}-1),f(x_{1})-(e_{1}+1))\in\mathbb{Z}^{2}\). Thus an integer point is guaranteed if the inequalities \[\left\{\begin{array}{l}e_{2}-1\leq\frac{e_{2}n}{e_{1}+e_{2}},\\ e_{1}+1\leq\frac{e_{1}n}{e_{1}+e_{2}},\end{array}\right.\] are both satisfied (see Figure 7). Thus, by solving both inequalities for \(n\), we conclude that \(P\) realizes a graph for every \(n\) with \(n\geq\max\Big{\{}\frac{(e_{1}+1)(e_{1}+e_{2})}{e_{1}},\frac{(e_{2}-1)(e_{1}+e_ {2})}{e_{2}}\Big{\}}\). **Remark 1**.: _We denote the lower bound derived in Theorem 2 by \(\eta\). That is,_ \[\eta=\text{max}\left\{\frac{(e_{1}+1)(e_{1}+e_{2})}{e_{1}},\frac{(e_{2}-1)(e_{1}+ e_{2})}{e_{2}}\right\}.\] Despite the fact that \(\zeta\leq\eta\), there are only finitely many orders to check for a pot \(P\) to determine the value of \(\zeta\). That is, one need only check all orders for \(m_{P}\leq n\leq\eta\), which can be done using software. ### Connected and Disconnected Graphs Knowing orders of the graphs that can be realized by \(P\) allows us to address the next research question related to the types of graphs realized by \(P\). The following theorem demonstrates when an arbitrary pot realizes a disconnected graph. Notice that the theorem below is applicable to any pot of tiles with any number of bond-edge types. **Theorem 3**.: _The pot \(P_{j}=\{t_{1},t_{2},\ldots,t_{j}\}\) realizes a disconnected graph \(G\) of order \(n\) if and only if for at least one tile distribution \((R_{1},\ldots,R_{j})\) associated to \(G\),_ \[(R_{1},\ldots,R_{j})=\sum_{i=1}^{m}(R_{1i},\ldots,R_{ji}),\] _where each \(j\)-tuple \((R_{1i},\ldots,R_{ji})\) is a tile distribution of \(P_{j}\) that realizes a graph of order less than \(n\)._ Figure 7: The purple rightmost vertical line and upper horizontal line represent the bounds on \(x\) and \(f(x)\), respectively, while the black lines represent \(y=e_{1}+1\) and \(x=e_{2}-1\). The green line with positive slope is the function \(f(x)\). Proof.: Suppose \(P_{j}\) realizes a disconnected graph \(G\) of order \(n\) and let \((R_{1},\ldots,R_{j})\) be the tile distribution which realizes \(G\). Then the graph \(G\) is a union of disjoint subgraphs; that is, \[G=\bigcup_{i=1}^{m}H_{i} \tag{10}\] where \(V(H_{i})\cap V(H_{j})=\varnothing\) for \(i\neq j\). Since each \(H_{i}\) is a graph, and hence a complete complex, there must be some tile distribution, namely \((R_{1i},\ldots,R_{ji})\), that realizes \(H_{i}\). Further, since each \(H_{i}\subset G\), it follows that \(R_{ki}\leq R_{k}\) for all \(1\leq k\leq j\). Thus we translate Equation 10 into the language of tile distributions to arrive at \[(R_{1},\ldots,R_{j})=\sum_{i=1}^{m}(R_{1i},\ldots,R_{ji}).\] Conversely, suppose \(P_{j}\) realizes graphs \(H_{i}\) with corresponding tile distributions \((R_{1i},\ldots,R_{ji})\) such that \[(R_{1},\ldots,R_{j})=\sum_{i=1}^{m}(R_{1i},\ldots,R_{ji})\text{ and }R_{1}+R_{2}+ \cdots+R_{j}=n,\] then it follows immediately that \(P_{j}\) realizes a disconnected graph of order \(n\) with tile distribution \((R_{1},\ldots,R_{j})\). Theorem 3 provides the conditions under which the pot \(P=\{\{a^{e_{1}}\},\{\hat{a}^{e_{2}}\},\{\hat{a}\}\}\) will realize disconnected graphs as shown by the following two corollaries. **Corollary 2**.: _Let \(\text{gcd}(e_{1}+1,-e_{2}+1)=d\neq 1\). The pot \(P\) realizes a disconnected graph of order \(n\) if and only if_ \[n=n_{1}+n_{2}+\cdots+n_{\ell}\] _where \(n_{i}=k_{i}d\) for some \(k_{i}\in\mathbb{Z}_{\geq 0}\) and \(n_{i}\geq m_{P}\)._ Proof.: The proof is immediate from Theorem 1 and Theorem 3. **Corollary 3**.: _For the pot \(P\), if \(\text{gcd}(e_{1}+1,-e_{2}+1)=1\) and \(n=n_{1}+n_{2}+\cdots+n_{\ell}\) where each \(n_{i}\geq\zeta\), then \(P\) realizes a disconnected graph of order \(n\)._ Proof.: The proof is immediate from Definition 6 and Theorem 3. **Example 8**.: Consider the pot \(P=\{\{a^{7}\},\{\hat{a}^{4}\},\{\hat{a}\}\}\). From computational software, it appears that \(\zeta=7\); that is, \(P\) realizes a graph of every order greater than or equal to order \(7\). Thus, \(P\) will realize a disconnected graph of order \(15\) in which one component is a subgraph of order \(7\) and the other component is a subgraph of order \(8\). However, \(P\) will also realize a disconnected graph of order \(12\) (See Figure 8). This shows that the converse of Corollary 3 is not necessarily true. Given a tile distribution \((R_{1},R_{2},R_{3})\) for the pot \(P\), the following theorem establishes a relationship between \(R_{1}\) and \(R_{2}\) that indicates when any graph realized by \(P\) is necessarily disconnected. **Theorem 4**.: _Let \(G\in\mathcal{O}(P)\) and let \((R_{1},R_{2},R_{3})\) be a tile distribution that constructs \(G\). If \(1+R_{2}(e_{2}-1)<R_{1}\), then \(G\) is disconnected._ Proof.: Suppose \(G\in\mathcal{O}(P)\) where \(G=H_{1}\cup H_{2}\) and \(H_{1}\cap H_{2}=\emptyset\). We will show that despite maximizing the number of vertices of tile-type \(t_{1}\) in \(H_{1}\), the subgraph \(H_{2}\) will be nonempty (i.e. \(G\) is disconnected). If \(H_{2}\) is empty, then \(H_{1}\) must contain \(R_{2}\) vertices of tile type \(t_{2}\). To maximize the number of vertices of tile-type \(t_{1}\), \(H_{1}\) must be acylic; i.e. \(H_{1}\) is a tree. Consider the subgraph of \(H_{1}\) whose vertex set is only vertices of tile-types \(t_{1}\) and \(t_{2}\); call this subgraph \(H_{1}^{\prime}\). Since there are \(R_{2}\) vertices of tile-type \(t_{2}\), there must be \(e_{2}R_{2}\) edges and \(e_{2}R_{2}+1\) vertices in \(H_{1}^{\prime}\). Thus, there can be at most \(e_{2}R_{2}+1-R_{2}\) vertices of tile-type \(t_{1}\) in \(H_{1}^{\prime}\) and hence, in \(H_{1}\). If \(1+R_{2}(e_{2}-1)<R_{1}\), then \(V(H_{2})\) must contain vertices labeled with tile-type \(t_{1}\). Therefore, \(G\) will be disconnected. The question of when connected graphs are realized by \(P\) remains open at the time of writing. The algorithms in Section 4 provide a partial answer to this question. ## 4 Connected Graph Algorithms Section 3 establishes the conditions under which a pot of the form \(P=\{\{a^{e_{1}}\},\{\hat{a}^{e_{2}}\},\{\hat{a}\}\}\) realizes a connected or disconnected graph. In this section, we provide two algorithms which will construct a connected graph from \(P\). Theorem 4 suggests a connected graph may exist if \(1+R_{2}(e_{2}-1)\geq R_{1}\) and the desired order for a graph satisfies Theorem 1 or 2; the algorithms that follow rely on this inequality. ### Path Algorithm If \(1+R_{2}(e_{2}-1)\geq R_{1}\), then the following algorithm will output a connected graph. Note that the algorithm has been written based upon the assumption that \(R_{1}\geq R_{2}\). If \(R_{1}<R_{2}\), then the roles of \(R_{1}\) and \(R_{2}\), and \(t_{1}\) and \(t_{2}\) can be swapped in steps 1, 2, and 3 in order to produce a connected graph. **Input:** A pot \(P=\{t_{1}=\{a^{e_{1}}\},t_{2}=\{\hat{a}^{e_{2}}\},t_{3}=\{\hat{a}\}\}\) with corresponding tile distribution \((R_{1},R_{2},R_{3})\) **Output:** A labeled connected graph of order \(R_{1}+R_{2}+R_{3}\) 1. Form a path graph on \(2R_{2}-1\) vertices where the vertices are labeled as in Figure 9. That is, let \[\lambda(v_{k})=\left\{\begin{array}{l}t_{2}\text{ if }k\text{ odd}\\ t_{1}\text{ if }k\text{ even},\end{array}\right.\] where \(k\in\{1,\ldots,2R_{2}-1\}\). 2. If \(R_{1}-(R_{2}-1)<e_{2}-1\), then attach one half-edge from each of the remaining \(R_{1}-(R_{2}-1)\) copies of \(t_{1}\) to vertex \(v_{1}\). Go to step 4. Else, attach one half-edge from each of \(e_{2}-1\) copies of \(t_{1}\) to vertex \(v_{1}\). Set \(\texttt{counter}=R_{1}-(R_{2}-1)-(e_{2}-1)\). 3. If \(\texttt{counter}<e_{2}-2\), then attach one half-edge from each of the remaining \(\texttt{counter}\) copies of \(t_{1}\) to vertex \(v_{3}\). Else, attach one half-edge from each of \(e_{2}-2\) copies of \(t_{1}\) to vertex \(v_{3}\). Update \(\texttt{counter}=\texttt{counter}-(e_{2}-2)\). Continue in this way sequentially for vertices \(v_{5}\), \(v_{7},\ldots\) until \(\texttt{counter}=0\). Note if \(\texttt{counter}>0\) at the end of the sequence (i.e. at vertex \(v_{2R_{2}-1}\)) it may be necessary to attach one half-edge from \(e_{2}-1\) copies of \(t_{1}\) to vertex \(v_{2R_{2}-1}\). 4. Attach any unpaired half-edges from the \(t_{2}\) tile types to any unpaired half-edges from the \(t_{1}\) tile types. 5. Attach each \(t_{3}\) to an unpaired half-edge from \(t_{1}\). Proof.: Let \(G\) be a graph constructed by Algorithm 4.1. We note that by construction, \(R_{2}\) vertices are labeled \(t_{2}\) in Step 1. At the end of Step 3, \(R_{1}\) vertices are labeled \(t_{1}\) and at the end of Step 5, \(R_{3}\) vertices are labeled \(t_{3}\). Thus, the graph constructed is realized by \(P\). We next prove that \(G\) is a connected graph by showing there are no unmatched half-edges by the end of the algorithm. In the multiset \(P_{\lambda}(G)\), there are \(e_{1}R_{1}\) total half-edges labeled \(a\) associated to tile type \(t_{1}\). In Step 1 of the algorithm, there are \(2(R_{2}-1)\) half-edges labeled \(a\) that are joined to half-edges labeled \(\hat{a}\), and in Steps 2 and 3, there are an additional \(R_{1}-(R_{2}-1)\) half-edges labeled \(a\) joined to half-edges labeled \(\hat{a}\). At the end of Step 3, there are \(e_{1}R_{1}-2(R_{2}-1)-(R_{1}-(R_{2}-1))=(e_{1}-1)R_{1}-R_{2}+1\) half-edges labeled \(a\) that are unmatched. In \(P_{\lambda}(G)\), there are \(e_{2}R_{2}\) total half-edges labeled \(\hat{a}\) associated to tile type \(t_{2}\). In Step 1, \(2+2(R_{2}-2)\) half-edges labeled \(\hat{a}\) are joined to half-edges labeled \(a\). In Steps 2 and 3, \(R_{1}-(R_{2}-1)\) half-edges labeled \(\hat{a}\) are joined to half-edges labeled \(a\). Thus, at the end of Step 3, there are \(e_{2}R_{2}-(2+2(R_{2}-2))-(R_{1}-(R_{2}-1)=(e_{2}-1)R_{2}-R_{1}+1\) half-edges labeled \(\hat{a}\) that are unmatched. Note that \[(e_{1}-1)R_{1}-R_{2}+1-((e_{2}-1)R_{2}-R_{1}+1)=e_{1}R_{1}-e_{2}R_{2}.\] Figure 9: Graph after step 1 of Algorithm 4.1 including unmatched half-edges on \(t_{1}\) and \(t_{2}\) Since \(e_{1}>e_{2}\) and \(R_{1}\geq R_{2}\), then \(e_{1}R_{1}-e_{2}R_{2}>0\). That is, there must be more unmatched half-edges labeled \(a\) than \(\hat{a}\) at the end of Step 3. This ensures that all unmatched half-edges labeled \(\hat{a}\) will be joined to half-edges labeled \(a\) in Step 4. There will be exactly \(e_{1}R_{1}-e_{2}R_{2}\) unmatched half-edges labeled \(a\) at the end of Step 4. Since \(e_{1}R_{1}-e_{2}R_{2}=R_{3}\) by Equation 8, then Step 5 guarantees all remaining half-edges can be matched to a vertex labeled \(t_{3}\). Thus, there are no unmatched half-edges by the end of the algorithm. **Theorem 5**.: _If \(1+R_{2}(e_{2}-1)\geq R_{1}\), then there exists a connected graph \(G\in\mathcal{O}(P)\)._ The proof of this theorem is immediate from Algorithm 4.1. **Example 9**.: Consider \(P=\{\{a^{4}\},\{\hat{a}^{3}\},\{\hat{a}\}\}\). \(P\) realizes a graph of order \(29\) with a tile distribution of \((7,3,19)\). The output of Algorithm 4.1 is shown in Figure 10. ### Cycle Algorithm Ring structures naturally occur in many biological systems [3; 6]. For this reason, we have created an algorithm to construct a connected graph from a cycle graph. The limitation that occurs is that this algorithm only works when \(R_{1}\leq R_{2}\). **Input:** A pot of the form \(P=\{t_{1}=\{a^{e_{1}}\},t_{2}=\{\hat{a}^{e_{2}}\},t_{3}=\{\hat{a}\}\}\) with corresponding tile distribution \(R_{1},R_{2},R_{3}\). **Output:** A labeled connected graph of order \(R_{1}+R_{2}+R_{3}\). 1. Form a cycle graph on \(2R_{1}\) vertices. Alternate the labels on the vertices for \(t_{1}\) and \(t_{2}\). That is, choose a vertex to be \(v_{1}\), then set \(\lambda(v_{2k-1})=t_{1}\) and \(\lambda(v_{2k})=t_{2}\) for \(k\in\{1,\ldots,R_{1}\}\). See Figure 11. Figure 10: A graph of order \(29\) constructed using Algorithm 4.1 2. Attach \(\lfloor\frac{e_{2}-2}{2}\rfloor\) half-edges from \(v_{2k}\) to \(v_{2k-1}\) and attach \(\lceil\frac{e_{2}-2}{2}\rceil\) half-edges from \(v_{2k}\) to \(v_{2k+1}\) for each \(k\in\{1,\ldots,R_{1}\}\). Due to the cyclic subgraph from step 1, we note \(v_{1}=v_{2k+1}\) for this process. 3. If \(R_{2}-R_{1}<e_{1}-e_{2}\), then attach the remaining \(R_{2}-R_{1}\) copies of \(t_{2}\) to the half-edges of \(t_{1}\) on \(v_{1}\) using exactly one half-edge for each copy of \(t_{2}\). Go to step 5. Else, attach \(e_{1}-e_{2}\) copies of \(t_{2}\) to the half-edges of \(t_{1}\) on \(v_{1}\) using exactly one half-edge of each copy of \(t_{2}\). Update \(\texttt{counter}=R_{2}-R_{1}-(e_{1}-e_{2})\) 4. If \(\texttt{counter}<e_{1}-e_{2}\), then attach \(\texttt{counter}\) copies of \(t_{2}\) to the half-edges of \(t_{1}\) on \(v_{3}\) using exactly one half-edge of each copy of \(t_{2}\). Else, attach \(e_{1}-e_{2}\) copies of \(t_{2}\) to the half-edges of \(t_{1}\) on \(v_{3}\) using exactly one half-edge for each copy of \(t_{2}\). Update \(\texttt{counter}=\texttt{counter}-(e_{1}-e_{2})\). Continue in this way sequentially for vertices \(v_{5},v_{7},\ldots\) until \(\texttt{counter}=0\). 5. If \(R_{1}\neq R_{2}\), attach \((R_{2}-R_{1})(e_{2}-1)\) unmatched half-edges from the vertices labeled with \(t_{1}\) to the unmatched half-edges of the vertices labeled with \(t_{2}\). Else, move to step 6. 6. Attach \(R_{1}(e_{1}-e_{2})-e_{2}(R_{2}-R_{1})\) half-edges labeled \(a\) from vertices labeled with \(t_{1}\) to \(R_{3}\) vertices labeled with \(t_{3}\). Proof.: Form the graph \(G\) with the labeling prescribed by Step 1 of Algorithm 4.2. Our aim is to show that all the remaining tiles can be attached to the vertices in \(G\). After steps 1 and 2, there are \(e_{1}-\left(\lfloor\frac{e_{2}-2}{2}\rfloor+\lceil\frac{e_{2}-2}{2}\rceil \right)-2=e_{1}-(e_{2}-2)-2=e_{1}-e_{2}\) unpaired half-edges on _each_ vertex labeled \(t_{1}\). Thus, there is a total of \(R_{1}(e_{1}-e_{2})\) unmatched \(a\)'s. Additionally, all tiles of type \(t_{1}\) and \(R_{1}\) tiles of type \(t_{2}\) have been used to label the vertices of \(G\), and all of the arms of the tiles of type \(t_{2}\) in \(G\) have been matched. We must ensure there are sufficiently many unmatched edges labeled \(a\) for the remaining tiles of type \(t_{2}\), which is equivalent to showing \(R_{2}-R_{1}<R_{1}(e_{1}-e_{2})\). This can be shown using the substitution \(e_{1}R_{1}=e_{2}R_{2}+R_{3}\) from Equation 8 as follows: Figure 11: Graph after step 1 of Algorithm 4.2 including unmatched half-edges on \(t_{1}\) and \(t_{2}\) \[R_{1}(e_{1}-e_{2}) =e_{1}R_{1}-e_{2}R_{1}\] \[=R_{3}+e_{2}R_{2}-e_{2}R_{1}\] \[=R_{3}+e_{2}(R_{2}-R_{1})\] \[\geq e_{2}(R_{2}-R_{1})\] \[>R_{2}-R_{1}.\] After step 5, the tiles of type \(t_{2}\) that were added in steps 3 and 4 have \((R_{2}-R_{1})(e_{2}-1)\) unmatched half-edges. To ensure each half-edge can be matched to a free half-edge on a tile of type \(t_{1}\), we must show \((R_{2}-R_{1})(e_{2}-1)\leq R_{1}(e_{1}-e_{2})-(R_{2}-R_{1})\). Using the substitution \(e_{1}R_{1}-e_{2}R_{2}=R_{3}\), we have: \[R_{1}(e_{1}-e_{2})-(R_{2}-R_{1}) =e_{1}R_{1}-e_{2}R_{1}-R_{2}+R_{1}\] \[=e_{1}R_{1}-e_{2}R_{1}-e_{2}R_{2}+e_{2}R_{2}-R_{2}+R_{1}\] \[=e_{1}R_{1}-e_{2}R_{2}+(e_{2}R_{2}-R_{2}-e_{2}R_{1}+R_{1})\] \[=R_{3}+(R_{2}-R_{1})(e_{2}-1)\] \[\geq(R_{2}-R_{1})(e_{2}-1).\] With all of the arms from tiles of type \(t_{2}\) matched, we finally need to check that there are exactly the number of unmatched half-edges on tiles of type \(t_{1}\) as there are tiles of type \(t_{3}\). That is, we need to show \(R_{3}=R_{1}(e_{1}-e_{2})-e_{2}(R_{2}-R_{1})\): \[R_{1}(e_{1}-e_{2})-e_{2}(R_{2}-R_{1}) =e_{1}R_{1}-e_{2}R_{1}-e_{2}R_{2}+e_{2}R_{1}\] \[=e_{1}R_{1}-e_{2}R_{2}\] \[=R_{3}.\] Thus, \(G\) is a connected graph and \(G\in\mathcal{O}(P)\) using tile distribution \((R_{1},R_{2},R_{3})\). **Example 10**.: Consider \(P=\{\{a^{6}\},\{\hat{a}^{4}\},\{\hat{a}\}\}\). Then \(P\) realizes a graph of order \(19\) with a tile distribution of \((7,10,2)\). The output of Algorithm 4.2 is shown in Figure 12. ## 5 Conclusion We have shown that, given a pot of tiles with one bond-edge type and a 1-armed tile, we can determine the orders of the complete complexes that can be realized by the pot. To a lesser extent, we can also characterize whether these complete complexes will be disconnected or connected complexes. At the time of writing, the entire case involving a pot with one bond-edge type (i.e. a \(2\times p\) construction matrix) is close to being completely understood. Three primary questions remain to be explored: 1. What is a formula for \(\zeta\) in terms of \(e_{1}\) and \(e_{2}\)? 2. Does there exist a pot where \(\zeta=\eta\)? 3. Do these results extend to pots of the form \(P=\{\{a^{e_{1}}\},\{\hat{a}^{e_{2}}\},\{\hat{a}^{e_{3}}\}\}\) where \(1<e_{3}<e_{2}\)? Although the first question remains open, our results provide a lower bound which is "close" to \(\zeta\). This means that, for any pot \(P\) satisfying the relatively prime condition, there are only finitely many orders to check between the order of the minimal graph of \(P\) and the corresponding \(\eta\). With the third question, we have some indication that the results in this paper extend to pots that do not possess a 1-armed tile, but more research is needed in this area. Considering the conditions that occur when \(\gcd(e_{1}+1,-e_{2}+1)=d\neq 1\), it would be reasonable to start in this setting rather than the relatively prime setting. The difficulty of determining which graphs \(G\) are in \(\mathcal{O}(P)\) increases dramatically when moving from pots with one bond-edge type to pots with two bond-edge types. Preliminary research suggests the results here do not necessarily generalize to the two bond-edge type case. Figure 12: A graph of order 19 constructed using Algorithm 4.2

2306.01506

BabySLM: language-acquisition-friendly benchmark of self-supervised spoken language models

Self-supervised techniques for learning speech representations have been shown to develop linguistic competence from exposure to speech without the need for human labels. In order to fully realize the potential of these approaches and further our understanding of how infants learn language, simulations must closely emulate real-life situations by training on developmentally plausible corpora and benchmarking against appropriate test sets. To this end, we propose a language-acquisition-friendly benchmark to probe spoken language models at the lexical and syntactic levels, both of which are compatible with the vocabulary typical of children's language experiences. This paper introduces the benchmark and summarizes a range of experiments showing its usefulness. In addition, we highlight two exciting challenges that need to be addressed for further progress: bridging the gap between text and speech and between clean speech and in-the-wild speech.

Marvin Lavechin, Yaya Sy, Hadrien Titeux, María Andrea Cruz Blandón, Okko Räsänen, Hervé Bredin, Emmanuel Dupoux, Alejandrina Cristia

2023-06-02T12:54:38Z

http://arxiv.org/abs/2306.01506v2

# BabySLM: language-acquisition-friendly benchmark ###### Abstract Self-supervised techniques for learning speech representations have been shown to develop linguistic competence from exposure to speech without the need for human labels. In order to fully realize the potential of these approaches and further our understanding of how infants learn language, simulations must closely emulate real-life situations by training on developmentally plausible corpora and benchmarking against appropriate test sets. To this end, we propose a language-acquisition-friendly benchmark to probe spoken language models at the lexical and syntactic levels, both of which are compatible with the vocabulary typical of children's language experiences. This paper introduces the benchmark and summarizes a range of experiments showing its usefulness. In addition, we highlight two exciting challenges that need to be addressed for further progress: bridging the gap between text and speech and between clean speech and in-the-wild speech. Marvin Lavechin\({}^{1,2}\), Yaya Sy\({}^{1}\), Hadrien Titeux\({}^{1}\), Maria Andrea Cruz Blandon\({}^{3}\), Okko Rasanen\({}^{3}\), Herve Bredin\({}^{4}\), Emmanuel Dupoux\({}^{1,2,5}\), Alejandrina Cristia\({}^{1}\)\({}^{1}\)LSCP, ENS, EHESS, CNRS, PSL University, Paris, France \({}^{2}\)Meta AI Research, France \({}^{3}\)Unit of Computing Sciences, Tampere University, Finland \({}^{4}\)IRIT, CNRS, Toulouse, France \({}^{5}\)Cognitive Machine Learning Team, INRIA, France marvinlavechin@gmail.com **Index Terms**: spoken language modeling, language acquisition, self-supervised learning, child language ## 1 Introduction and related work Machine learning for Natural Language Processing (NLP) has led to models that develop linguistic competence from exposure to written or spoken language. On text, Language Models (LMs) now achieve impressive performance on a wide variety of natural language understanding tasks [1]. More recently, speech-based LMs have also shown impressive linguistic competence on lexical or grammatical acceptability judgment tasks [2, 3], or spoken language generation [4, 5]. Since these models develop linguistic competence without the need for human labels, they promise to advance our understanding of how infants learn language [6, 7, 8]. However, if we want to maximize the impact of the evidence obtained from LMs, it is essential to ensure that our simulations closely emulate real-life situations - as advocated for syntactic acquisition in text-based LMs in [8, 9]. How can we do so? First, we should match the _quantity_ of data available to young infants. Although large differences exist across cultures [10] and socioeconomic contexts [11], current estimates of yearly speech input vary between \(300\) and \(1,000\) hours for American English-learning children [6, 12]. This means that by age 3, American English-learning children would have been exposed to approximately 3,000 hours of speech - for those who received the most speech input. Yet, by then, infants know many words and already engage in simple conversations [13]. Second, we should match the _quality_ of data available to young infants. Contrary to LMs, infants do not learn language by scraping the entire web or through exposure to a large quantity of audiobooks. Instead, infants' input is speech - not text -, and it contains a relatively small vocabulary arranged in simple and short sentences, sometimes overlapping across speakers and laced with various background noises [7, 14]. Evaluating LMs trained on quantitatively and qualitatively plausible corpora requires the creation of adapted benchmarks, but none exists for speech-based LMs - see [9] or the BabyLM challenge [15] for text-based LMs. Current benchmarks using zero-shot probing tasks, although inspired by human psycholinguistics (e.g., spot-the-word or grammatical acceptability judgment tasks), have been designed for models trained on audiobooks [2]. As a result, these benchmarks use a large vocabulary specific to books (including words like 'rhapsodize', 'zirconium', or 'tercentenary') and probe syntactically complex sentences that are vanishingly rare even in spontaneous adult-adult conversation. Here, we propose _BabySLM_, the first language-acquisition-friendly benchmark to probe speech-based LMs at the lexical and syntactic levels, both of which are compatible with the vocabulary typical of children's language experiences. Our benchmark relies on zero-shot behavioral probing of LMs [2] and considers a spot-the-word task at the lexical level and a grammatical acceptability judgment task at the syntactic level. To show the utility of our benchmark, we first use it to evaluate text-based and speech-based LMs trained on developmentally plausible training sets. The text-based LM is a long short-term memory (LSTM) trained on phonemes or words. The speech-based LM is the low-budget baseline used in the ZeroSpeech 2021 challenge on unsupervised representation learning of spoken language [2]. Both systems are trained on Providence [16], a dataset of spontaneous parent-child interactions. The comparison between text-based and speech-based LMs shows an important gap that future work should address. Next, _BabySLM_ enables us to compare the performance of speech-based LMs when trained on \(1,000\) hours of speech extracted from 1) audiobooks, a source of training data commonly used [17, 18]; or 2) child-centered long-form recordings acquired via child-worn microphones as people go about their everyday activities [19]. Our results reveal that speech-based LMs are overly sensitive to the differences between clean speech and in-the-wild speech. ## 2 Methods ### Metrics #### 2.1.1 Lexical evaluation: the spot-the-word task **General principle.** In the lexical task, the system is presented with minimal pairs of an existing word and a pseudo-word that is phonologically plausible but does not actually exist [2, 20] (examples in Table 1). The system gets a score of \(1\) if it returns a higher probability for the former, and \(0\) otherwise. Contrary to [2], we generate multiple pseudo-words per word. Scores are first averaged across pseudo-words to yield per-word accuracy, which are then averaged across all words to yield a measure of _lexical accuracy_. **Task generation.** We first listed all words in the American English CHILD Language Data Exchange System (CHILDES) database [21]. This database contains human-annotated transcripts of various child-centered situations (play sessions, storytelling, etc.), making it a valuable source of vocabulary in real children's input. After excluding items not found in either the Celex [22] or CMU dictionary [23] (e.g., mispronounced, incorrectly annotated or made-up words: 'insetosaurus', 'hihippopotamus'), we obtained \(28,000\) word types. Pseudo-words were produced using the Wuggy pipeline [24], which generates, for a given word, a list of candidate pseudo-words matched for syllabic and phonotactic structure. We applied the same post-processing steps used in [2]. Contrary to [2], to ensure that there is no bias from phone-based unigrams or bigrams, we balanced the count of pseudo-words that had higher (or lower) phonemes unigram and bigram probabilities compared to those computed for the actual word. If a given word had only pseudo-words with higher (or lower) unigram or bigram possibilities, it was discarded from the evaluation set. The resulting \(>90,000\) minimal pairs across \(18,000\) words were each synthesized using Google Text-To-Speech (TTS) system using \(10\) voices (\(5\) males, \(5\) females). #### 2.1.2 Syntactic evaluation: grammatical acceptability **General principle.** In the syntactic task, the system is presented with minimal pairs of grammatical and ungrammatical sentences across six syntactic phenomena [2, 9] (examples in Table 2), giving the system a score of \(1\) when it assigns a higher probability to the former, and \(0\) otherwise. We average scores within each syntactic phenomenon, then across phenomena to obtain our measure of _syntactic accuracy_. **Task generation.** We generated templates for each of the six syntactic phenomena explored. For instance, for the noun-verb agreement phenomenon, we used templates such as "The <noun1> <3rd" person verb> <noun2>" versus "The <noun1> <1st" person verb> <noun2>". Contrary to [2], we restricted this benchmark to simple syntactic phenomena and short sentences which better reflect the type of input children are exposed to. We filled the templates using high-frequency words from CHILDES [21]. For instance, selected animate nouns include words like'mom', 'girl', or 'cat'; selected adjectives include words like 'good', 'little', or 'big'; and selected verbs include words like'see', 'know', or 'need'. The resulting \(10,800\) minimal pairs were each synthesized using Google TTS system using the same \(10\) voices (\(5\) males, \(5\) females). #### 2.1.3 Development and test split For both our lexical and syntactic evaluation sets, we randomly selected one male and one female voice for the development set and the \(8\) remaining ones for the test. We randomly selected \(20\,\%\) of the lexical and syntactic minimal pairs for the development set and the remaining \(80\,\%\) for the test. ### Training sets We built a first training set by extracting human-annotated speech utterances from Providence [16], a publicly available corpus containing transcribed recordings of six American children during spontaneous interactions with their parents. Available utterance-level timestamps were refined with a pretrained voice activity detection (VAD) system [25]. We converted human orthographic transcripts into phonetic transcripts using [26]. This procedure resulted in \(128\) hours of highly naturalistic infant-parent interactions in audio, orthographic, and phonetic form, allowing us to compare LMs trained on speech, phonemes, or words. We built a second training set by extracting \(1,024\) hours of adult speech utterances - using the same VAD system [25] - from SEEDLingS [19], a corpus of child-centered long-form recordings collected in \(61\) American English families. This training set enables us to train speech-based LMs in maximally plausible conditions, i.e., directly on what infants hear. ### Models **STELA (speech-based).** STELA is a speech-based LM originally proposed in [2, 27]. It comprises an acoustic model that learns discrete representations of the audio and a language \begin{table} \begin{tabular}{c l l l l l} \hline \hline \multicolumn{1}{c}{\multirow{2}{*}{**Word**}} & \multicolumn{2}{c}{**Pseudo-words**} & \multicolumn{2}{c}{**Pseudo-words**} \\ & **Phon.** & **Orth.** & **Word** & **Phon.** & **Orth.** \\ \hline \multirow{4}{*}{\begin{tabular}{} \end{tabular} } & l\(\circ\)l\(\circ\)l\(\circ\)o & lello & & \(\circ\)r \(\circ\)l\(\circ\)s & thaynks \\ & p\(\circ\)l\(\circ\)o & pello & & \(\circ\) \(\circ\) \(\circ\) \(\circ\) \(\circ\) \(\circ\) & thaanks \\ & s\(\circ\)l\(\circ\)o & s\(\circ\)l\(\circ\)o & sero & \(\circ\)l\(\circ\)s & \(\circ\)l\(\circ\)s \& is \\ h\(\circ\)l\(\circ\)o & d\(\circ\)l\(\circ\)o & dello & \(\circ\)r \(\circ\)l\(\circ\)s & \(\circ\)l\(\circ\)s & \(\circ\)l\(\circ\)s \& \\ & s\(\circ\)l\(\circ\)o & s\(\circ\)l\(\circ\)o & sello & & \(\circ\)r \(\circ\)l\(\circ\)s \& \\ & & d\(\circ\)l\(\circ\)o & dello & \(\circ\)r \(\circ\)l\(\circ\)s & \(\circ\)l\(\circ\)s \& \\ & s\(\circ\)l\(\circ\)o & sello & & & \(\circ\)r \(\circ\)l\(\circ\)s \& \(\circ\)l\(\circ\)s \& \\ \hline \multirow{4}{*}{ \begin{tabular}{} \end{tabular} } & k u t: & kootie & & \(\circ\)l\(\circ\)s \(\circ\)r \(\circ\)p \(\circ\)j & jump \\ & k o n i & koonie & & \(\circ\)l\(\circ\)s \(\circ\)l\(\circ\)s \(\circ\)l\(\circ\)k & julk \\ & t o d i: & kootie & \(\circ\)l\(\circ\)s \(\circ\)m \(\circ\)p & \(\circ\)l\(\circ\)s \(\circ\)s \& \(\circ\)l\(\circ\)s \& \\ & l u t i: & rootie & \(\circ\)l\(\circ\)s \(\circ\)m \(\circ\)p & \(\circ\)l\(\circ\)s \(\circ\)s \& \(\circ\)l\(\circ\)s \& \(\circ\)l\(\circ\)s \& \\ & b u n i: & boonie & & & \(\circ\)l\(\circ\)s \(\circ\)l\(\circ\)s \& \(\circ\)l\(\circ\)s \& \(\circ\)l\(\circ\)s \& \\ \hline \hline \end{tabular} \end{table} Table 1: _Lexical task. Minimal pairs of real and pseudo-words. Phonetic (Phon.) transcriptions are given in International Phonetic Alphabet (IPA) standard. Orthographic (Orth.) transcriptions of pseudo-words are proposed for ease of reading._ \begin{table} \begin{tabular}{c c l} \hline \hline \multicolumn{1}{c}{**Phenomenon**} & \multicolumn{1}{c}{**N**} & \multicolumn{1}{c}{**Sentence example**} \\ \hline \multicolumn{1}{c}{\begin{tabular}{} \end{tabular} } & \(1.6\) & \begin{tabular}{} \end{tabular} \\ \hline \multirow{2}{*}{\begin{tabular}{} \end{tabular} } & \(2\) & \begin{tabular}{} \end{tabular} \\ \hline \multirow{2}{*}{\begin{tabular}{} \end{tabular} } & \(1\) & \begin{tabular}{} \end{tabular} \\ \hline \multirow{2}{*}{\begin{tabular}{} \end{tabular} } & \(1\) & \begin{tabular}{} \end{tabular} \\ \hline \multirow{2}{*}{\begin{tabular}{} \end{tabular} } & \(3.6\) \\ & \(1.6\) \\ \hline \multirow{2}{*}{\begin{tabular}{} \end{tabular} } & \(1.6\) \\ & \(1.6\) \\ \hline \multirow{2}{*}{\begin{tabular}{} \end{tabular} } & \(2\) & \begin{tabular}{} \end{tabular} \\ \hline \multirow{2}{*}{\begin{tabular}{} \end{tabular} } & \(2\) \\ & \(2\) \\ & \(2\) \\ & \(2\) \\ & \(2\) \\ \end{tabular} & \(2\) \\ & \(2\) \\ \end{tabular} & \(3\) \\ \hline \multirow{2}{*}{ \begin{tabular}{} \end{tabular} } & \(1.6\) \\ & \(2\) \\ & \(2\) \\ \end{tabular} & \(1.6\) \\ & \(2\) \\ \end{tabular} & \(3\) \\ \hline \hline \end{tabular} \end{table} Table 2: _Syntactic task. Minimal pairs of grammatical (✓) and ungrammatical (✗) sentences from each of the six syntactic phenomena included in our benchmark. N is the number of \(1,000\) minimal pairs within each category._ model trained on top of the learned discrete representations. The acoustic model is built from a Contrastive Predictive Coding (CPC) model followed by a K-means clustering algorithm. The language model consists of LSTM layers. We used the same architecture and hyper-parameterisers as the low-budget baseline proposed in [2]. Contrary to [2] who trained CPC by sampling the positive and negative examples from the same speaker, we applied a second constraint: negative examples were drawn from temporally close speech sequences to reduce mismatch between the positive and negative examples in terms of their local environment as this was found to be helpful when training on long-forms [14]. **LSTM (text-based).** We include LSTM LMs trained on words - using byte-pair encoding - or on phonemes, using the same architecture and hyper-parameters than [2]. **BabyBERTa (text-based).** BabyBERTa [9] is a transformer-based LM trained on a \(5\,\mathrm{M}\) word corpus of American English child-directed input built from the CHILDES database [21]. ## 3 Results and discussion ### The BabySLM benchmark Results obtained on our _BabySLM_ benchmark are reported in Table 3. Rows are sorted according to the plausibility of the training data. Child-centered long-form recordings (SEEDLingS) have the highest plausibility score as these recordings faithfully capture children's everyday language experiences. In particular, long-forms collect audio data over a whole day - or several - and therefore sample the full range of language experiences across all possible contexts: the child may be in or out of the house, the speech may be directed to the child or others, etc. The audio extracted from in-home recordings of spontaneous infant-parent interactions (Providence) is slightly less plausible as it fails to capture the full range of language experiences: fewer speakers than in a real-life setting, most of the speech is directed to the child, etc. Finally, words and phonemes extracted from AO-CHILDES or Providence have the lowest plausibility score since infants do not learn language from orthographic or phonetic transcriptions but from the continuous signal that is speech. Results indicate no evidence of lexical and syntactic knowledge for STELA trained on \(1,024\) hours of speech from SEEDLingS. This contrasts, in appearance, with what has been found in the ZeroSpeech challenge [2], but this is due to the large variability of speech found in long-forms as we will see in Section 3.3. Results are no different for STELA trained on \(128\) hours of speech extracted from Providence whose lexical and syntactic accuracies remain close to chance level. However, we hypothesize that the lexical accuracy obtained by STELA might increase with more audio data from semi-controlled recordings of infant-parent interactions as these contain cleaner speech than what is typically found in long-forms. Contrary to speech-based LMs, text-based LMs perform largely above chance level. As expected, the LSTM model trained on words reaches higher syntactic accuracy than the LSTM trained on phonemes. The highest syntactic accuracy is obtained by BabyBERTa, which is a transformer-based LM and has been trained on a larger quantity of data than our LSTM LMs. Performances on _BabySLM_ show a clear gap between text-based and speech-based LMs. Another important finding is that, as of now, spoken language modeling from children's real language experiences seems out of reach, as evidenced by the chance-level lexical and syntactic accuracies obtained by STELA trained on SEEDLingS. We dedicate the remaining sections to illustrating these two challenges: bridging the gap between text and speech and between clean speech and in-the-wild speech. ### Language modeling: from text to speech Figure 1 shows lexical and syntactic accuracies obtained by text-based (words or phonemes) or speech-based LMs as a function of quantity of data. The LSTM trained on phones requires at least \(16\) hours of speech, equivalent to \(150,000\) words, to start performing above chance level. Once lexical knowledge has emerged, the model follows a logarithmic trend (note the log-scale x-axis), initially improving rapidly and then slowing down. In other words, we need to double the amount of data to obtain the same gain in lexical accuracy. The same patterns hold for the syntactic accuracy obtained by the LSTM model trained on words1. For STELA, the lexical accuracy remains close to chance level, although the curve seems to increase between \(32\) and \(128\) hours of speech, and there is no evidence for syntactic knowledge. Footnote 1: Note, however, that the syntactic accuracy obtained by the LSTM model trained on words decreases to \(45\,\%\) (below chance level) between \(0\) and \(8\) hours (\(=75,000\) words). This effect was found to be driven by co-occurrence statistics in the noun-verb order task. The same pattern was found with a \(3\)-gram model, with a slight decrease between \(0\) and \(8\) hours and an increase between \(8\) and \(128\) hours. All in all, the lexical and syntactic accuracy slopes show very different patterns when training from raw speech or phonemes or words. This is despite receiving the same data \begin{table} \begin{tabular}{l c c c c c c c} \hline \hline & & & **Cumulated** & **Number of** & **Data** & **Lexical** & **Syntactic** \\ **System** & **Input** & **Training set** & **duration (h)** & **words (M)** & **plausibility** & **acc. (\%)** & **acc. (\%)** \\ \hline Random baseline & — & — & \(0\) & \(0\) & — & \(49.2\,52.5\) & \(49.3\,50.0\) \\ STELA [27] & speech & SEEDLingS & \(1024\) & \(9.6^{\star}\) & +++ & 49.5 \(45.4\) & \(50.3\,50.5\) \\ STELA [27] & speech & Providence & \(128\) & \(1.2\) & ++ & \(56.8\,47.1\) & \(50.3\,51.1\) \\ LSTM & phonemes & Providence & \(128\) & \(1.2\) & + & \(75.4\,75.2\) & \(55.1\,55.9\) \\ LSTM & words (BPE) & Providence & \(128\) & \(1.2\) & + & — & \(65.1\,65.3\) \\ BabyBERTa [9] & words (BPE) & AO-CHILDES & \(533^{\star}\) & \(5\) & + & — & \(70.4\,70.4\) \\ \hline \hline \end{tabular} \end{table} Table 3: _The BabySLM benchmark. Lexical and syntactic accuracies obtained by different language models trained on developmently plausible corpora of speech, phonemes, or words. Numbers are computed on the test set, and performances on the development set are reported using small font size. The starred cumulated duration and number of words are estimates based on the \(1.2\,\mathrm{M}\) of words present in the \(128\) hours of speech from Providence. Data plausibility indicates the extent to which the training set is close to the real sensory signal available to infants._ in different forms. Admittedly, the speech-based LM faces a more challenging task as it must learn its own discrete units, while text-based LMs must not. Future work might investigate how these slopes change with more data, particularly for the speech-based LM for which \(128\) hours seems insufficient. ### Language modeling: from clean to in-the-wild speech So far in the paper, we have little evidence that lexical or syntactic knowledge can emerge in speech-based LMs. To address this concern, we ran one more experiment, this time training STELA under more controlled recording conditions: on up to \(1,024\) hours of speech extracted from audiobooks - commonly used to train speech-based LMs [17]. Figure 2 compares this experiment against the performance obtained by STELA when trained on child-centered long-forms (SEEDLingS, Table 3). Results are unequivocal: we observe a strong improvement on the lexical task for the model trained on audiobooks, while the same model trained on long-forms remains at chance level. On the syntactic task (not shown above), STELA trained on \(1,024\) hours of audiobooks obtains an accuracy of \(52.8\,\%\) compared to \(50.3\,\%\) on long-forms. This is in line with the results in [2] showing that more powerful architectures are necessary to learn at the syntactic level. Why do we observe chance-level performance when training on long-forms? First, the speech signal found in long-forms is much more challenging than the one found in audiobooks: the speech might be distorted as it is being spoken far from the child; it might overlap with various background noises; and it is often produced in short turns that might be under-articulated - see [14] for a comparative analysis. Another essential factor to consider is the domain mismatch between the training and test sets. While the training set contains far-field under-articulated speech as well as close-field storytelling, the test set consists of well-articulated synthesized stimulus to which STELA fails to generalize. However, infants show no difficulties generalizing from uncontrolled real-life conditions to more controlled ones (in-laboratory conditions). We advocate here that generalization is part of the language acquisition problem, and LMs should be evaluated accordingly. We hypothesize that the discrete units learned by STELA might be too dependent on the various non-linguistic factors found in long-forms, as suggested in [14]. This dependency could prevent the LSTM LM from learning long-term dependencies necessary to solve the lexical or syntactic tasks. ## 4 Conclusion Benchmarks are instrumental in allowing cumulative science across research teams. In this paper, we have described how BabySLM has been carefully designed to be adapted to the kinds of words and sentences children hear. We have shown how it can be used to evaluate LMs trained on developmentally plausible text or speech corpus. By doing so, we revealed two outstanding challenges that the community must solve to build more plausible cognitive models of language acquisition. First, we need to reduce the gap between text-based and speech-based LMs, as the latter performed close to chance level on BabySLM. Second, we need to reduce the gap between LMs trained on clean and in-the-wild speech, as evidenced by the striking difference we obtained on the lexical task when training on clean audiobooks versus ecological long-forms. Future work might consist in evaluating speech-based LMs grounded in the visual modality [28], or linking performances obtained on _BabySLM_ with behavioral measures in infants - e.g., age of acquisition as in [29]. A crucial limitation of our benchmark is that it focuses on English, which already accounts for a whopping \(54\,\%\) of language acquisition studies [30]. We hope that this paper, together with shared scripts2, will facilitate the creation of similar benchmarks in other languages. Figure 1: **Language modeling from text to speech.** Top panel shows the lexical accuracy obtained by language models trained on audio (STELA) or phonemes (LSTM). Bottom panel shows the syntactic accuracy obtained by language models trained on audio (STELA) or byte-pair-encoded (BPE) words (LSTM). All models are trained on the Providence corpora in audio, phonetic, or orthographic form. Numbers are computed on the test set. Error bars represent standard errors computed across mutually exclusive training sets. Figure 2: **Language modeling from clean to in-the-wild speech.** Lexical accuracy obtained by STELA trained on audiobooks (Libri-light, in blue) or child-centered long-forms (SEEDLingS, in orange) as a function of speech quantity. Numbers are computed on the test set. Error bars represent standard errors computed across mutually exclusive training sets.

2304.10514

Deformation of d=4, N> 4 Supergravities Breaks Nonlinear Local Supersymmetry

We study d=4, $N\geq 5$ supergravities and their deformation via candidate counterterms, with the purpose to absorb UV divergences. We generalize the earlier studies of deformation and twisted self-duality constraint to the case with unbroken local H-symmetry in presence of fermions. We find that the deformed action breaks nonlinear local supersymmetry. We show that all known cases of enhanced UV divergence cancellations are explained by nonlinear local supersymmetry. This result implies, in particular, that if N=5 supergravity at five loop will turn out to be UV divergent, the deformed theory will be BRST inconsistent. If it will be finite, it will be a consequence of nonlinear local supersymmetry and E7-type duality.

Renata Kallosh, Yusuke Yamada

2023-04-20T17:48:53Z

http://arxiv.org/abs/2304.10514v1

# Deformation of \(d=4,\ {\cal N}\geq 5\) Supergravities ###### Abstract We study \(d=4,\,{\cal N}\geq 5\) supergravities and their deformation via candidate counterterms, with the purpose to absorb UV divergences. We generalize the earlier studies of deformation and twisted self-duality constraint to the case with unbroken local \({\cal H}\)-symmetry in presence of fermions. We find that the deformed action breaks nonlinear local supersymmetry. We show that all known cases of enhanced UV divergence cancellations are explained by nonlinear local supersymmetry. This result implies, in particular, that if \({\cal N}=5\) supergravity at five loop will turn out to be UV divergent, the deformed theory will be BRST inconsistent. If it will be finite, it will be a consequence of nonlinear local supersymmetry and E7-type duality. ## 1 Introduction * 1.1 Deformation of theories with local symmetries and BRST symmetry * 1.2 Enhanced cancellation of UV divergence in \(d=4,\mathcal{N}=5,L=4\) * 1.3 A short summary and assumptions of this work * 2 E7, local \(\mathcal{H}\) symmetries, and unitary gauge in \(\mathcal{N}=5,6,8\) * 3 Symmetries of de Wit-Nicolai (dWN) \(\mathcal{N}=8\) supergravity * 3.1 Local \(SU(8)\) and on shell \(E_{7(7)}\) symmetry * 3.2 Manifest \(E_{7(7)}\) and twisted nonlinear self-duality constraint * 4 dWN supergravity deformation * 5 Deformation of \(\mathcal{N}\geq 5\) * 5.1 Candidate CT's * 5.2 Loop order \(L\leq\mathcal{N}-1\) * 5.3 Loop order \(L\geq\mathcal{N}\) * 6 Deformation of supersymmetry due to UV divergences * 6.1 Preserving E7 * 6.2 Breaking E7 * 6.3 Supersymmetry transformation of the CT * 7 Discussion and Summary * A \(d=4,\,\mathcal{N}=4\) enhanced cancellation and nonlinear supersymmetry anomaly * B Identities for \(E_{7(7)}/SU(8)\) matrices Introduction ### Deformation of theories with local symmetries and BRST symmetry There are two main issues one may address in perturbative quantum theories of gravitational fields: 1. What kind of UV divergences are predicted for the loop computations using original undeformed classical theory on the basis of symmetries of this theory? 2. Is it possible to deform the theory _consistently_ by adding the higher derivative terms which absorb UV divergences and introduce new couplings beyond the gravitational coupling \(\kappa^{2}=\frac{1}{M_{Pl}^{2}}\)? "Consistently" here has a meaning that local symmetries might be deformed but the action has to be invariant under deformed local symmetries. Also in supergravity the global E7-type duality symmetries might be deformed, but the deformed action needs to be duality invariant on shell, to support unitarity. In pure gravity the answer to both of these problems is known. A 2-loop UV divergence \(R^{3}\) was predicted in [1] and confirmed by computations in [2]. The 1-loop UV divergence in the form of a topological Gauss-Bonnet term was revealed by the computation in [3]. At present, a pure gravity action, which provides finite amplitudes up to 2-loop order can be viewed as a deformed Einstein-Hilbert action. For example, in [4] we find \[\mathcal{L}_{\text{deformed}}^{\text{gravity}}=-\frac{2}{\kappa^{2}}\sqrt{| g|}R+\frac{\mathcal{C}_{\text{GB}}}{(4\pi)^{2}}\sqrt{|g|}R_{\mu\nu\rho\sigma}^{ *}R^{*\mu\nu\rho\sigma}+\frac{\mathcal{C}_{R^{3}}}{(4\pi)^{2}}\Big{(}\frac{ \kappa}{2}\Big{)}^{2}\sqrt{|g|}R_{\alpha\beta}{}^{\mu\nu}R_{\mu\nu}{}^{\rho \sigma}R_{\rho\sigma}{}^{\alpha\beta}+\ldots. \tag{1}\] Here the new couplings absorb the known UV divergences \[\mathcal{C}_{GB}=\Big{(}\frac{53}{90\epsilon}+c_{\text{GB}}(\mu)\Big{)}\mu^{ -2\epsilon}\,\qquad\mathcal{C}_{R^{3}}=\Big{(}\frac{209}{1440\epsilon}+c_{R^{3}}(\mu) \Big{)}\mu^{-4\epsilon}. \tag{2}\] The renormalized couplings \(c_{\text{GB}}(\mu)\) and \(c_{R^{3}}(\mu)\) are new parameters describing pure gravity. Each of the 3 parts of the action (1) is separately invariant under the off-shell gauge symmetry \[\delta g_{\mu\nu}=\nabla_{\mu}\xi_{\nu}+\nabla_{\nu}\xi_{\mu}. \tag{3}\] The gauge symmetry of the classical theory is not deformed by quantum corrections requiring the deformation of the Einstein-Hilbert action. The prediction of the \(R_{\alpha\beta}{}^{\mu\nu}R_{\mu\nu}{}^{\rho\sigma}R_{\rho\sigma}{}^{\alpha\beta}\) 2-loop UV divergence in [1] was based on a covariant formalism where the simplest form of Ward Identities is valid. In such case the UV divergence can be predicted to form an invariant under the gauge symmetry of the classical action. An analogous conclusion follows from BRST symmetry defining perturbative QFT in a consistent gauge theory [5; 6]. The first step in BRST construction is the existence of the local action, classical or deformed, invariant under local symmetry, classical or deformed. Namely, iff the deformed by a counterterm (CT) action \[S^{\rm def}=S_{\rm cl}+\lambda S^{\rm CT} \tag{4}\] has a local (classical or deformed) gauge symmetry, we can call it \(S_{\rm inv}\). In such case one can add to this action some gauge fixing terms, as well as the required ghosts action, \[S^{\rm BRST}=S_{\rm inv}+S_{\rm gauge-fixing}+S_{\rm ghosts} \tag{5}\] and prove the symmetry under BRST transformation \(Q^{\rm BRST}\) of the total action \(S^{\rm BRST}\) which controls quantum corrections \[Q^{\rm BRST}\,S^{\rm BRST}=0\,,\qquad Q^{2}_{\rm BRST}=0. \tag{6}\] When the deformation terms break some of the local symmetries of the classical action, so that \(S^{\rm def}\) is not \(S_{\rm inv}\), the BRST construction based on \(S^{\rm def}\) becomes inconsistent. The proof of gauge symmetry and unitarity of the perturbative gauge theory becomes invalid, like in theories with gauge anomalies. In gravity, the action (1) is invariant under the gauge symmetry (3), one can construct a BRST action so that quantum corrections control the loop computations in a consistent perturbative QFT. In \(d=4,\mathcal{N}=8\) supergravity [7; 8], as well as in all pure (no matter) \(\mathcal{N}\)-extended supergravities, the possible UV divergences were predicted in the past [9; 10] on the basis of a Lorentz-covariant on shell superspace geometry [11; 12]. \(\mathcal{N}=8\) supergravity was also studied in the light-cone off shell superspace [13] where \(E_{7(7)}\) symmetry commutes with the super-Poincare group. The issue of UV divergences was consequently revisited in \(\mathcal{N}=8\) light-cone superspace in [14; 15]. It was found that all candidate CT' s proposed in [9; 10] are ruled out since they are not available in the off-shell light-cone superspace. However, at smaller \(\mathcal{N}=5,6\), where loop computations are also possible, the arguments in [14; 15] are difficult to apply. Here and hereafter, we will focus only on \(d=4\) unless otherwise noted. The light-cone superspace is complicated even in maximal supergravity [13], and in \({\cal N}=5,6\) it was not developed. The Lorentz-covariant superspace [12], as well as supergravity actions at \({\cal N}=5,6\), are better known from the consistent truncation of maximal supergravity. Therefore to study all \({\cal N}=5,6,8\) supergravities and their UV divergences we proceed with point 2 above, where candidate CTs are known from the on-shell Lorentz-covariant superspace [9; 10]. The analysis of UV divergences in \({\cal N}=5,6,8\) was already performed in [16; 17; 18; 19] using manifest E7-type symmetry or properties of the unitary conformal supermultiplets. Under assumptions that there are no supersymmetry anomalies, it was predicted that these theories will be UV finite. Here we will study the effect of UV divergences on nonlinear local supersymmetry directly. We will ask a question: can we expect a deformation of \({\cal N}=5,6,8\) supergravities of the kind we see in pure gravity? Once, at some loop order, UV divergence is detected, we add the relevant expression to the original action and deform it: this term will absorb UV divergence and provide additional couplings with higher derivatives, as in eqs. (1), (2) in pure gravity. The goal of this paper to establish the symmetries of the deformed \({\cal N}=5,6,8\) supergravities, local supersymmetry, local \({\cal H}\)-symmetry and E7 duality, and to check the consistency of such a deformation. In the past, the role of a local nonlinear supersymmetry and of a local \({\cal H}\) symmetry in \(d=4\) supergravity was not emphasized enough, although both are known to be features of geometric CT's existing at \(L\geq L_{cr}={\cal N}\), and both are broken at non-geometric linearized CT's at \(L<L_{\rm cr}={\cal N}\)[9; 10]. The advantage of using local \({\cal H}\)-symmetry in \(d=4\) supergravity is that E7 symmetry is independent on local \({\cal H}\)-symmetry. Meanwhile in the unitary gauge, the manifest rigid \({\cal H}\)-symmetry involves an additional compensating \({\cal H}\)-symmetry transformation preserving the unitary gauge, it is a mix of E7 with \({\cal H}\), see details in [20]. In a recent review paper [21] the list of three cases of enhanced cancellation of a UV divergence at 1) \({\cal N}=5,L=4,d=4,\ \ 2)\)\({\cal N}=4,L=3,d=4,\ \ 3)\)\({\cal N}=4,L=2,d=5\) was given. We will show here that all these cases are explained by nonlinear local supersymmetry. The first case is just below in Sec. 1.2, the case of \({\cal N}=4,L=3,d=4\) supergravity in Appendix A, since the main part of this paper is about \({\cal N}\geq 5,d=4\) and and the one in half-maximal supergravity in \(d=5\) is in a separate work [22]. ### Enhanced cancellation of UV divergence in \(d=4,{\cal N}=5,L=4\) The reason to discuss this case in the Introduction is the fact that during almost a decade its only explanation was given in [18, 19]. But this explanation was not specific for \(d=4,{\cal N}=5,L=4\), it was a prediction of UV finiteness at all loops based on duality symmetry, assuming unbroken supersymmetry. In this paper we focus on predictions from nonlinear local supersymmetry. In this spirit we provide here a simple explanation of cancellation of UV divergences in \(d=4\), \({\cal N}=5,L=4\). It does not extend to \(L>4\) directly, higher loops need an additional study. In the UV finite case of \({\cal N}=5,L=4\)[23] the relevant harmonic CT was _claimed to be nonlinearly supersymmetric_[24]. We will explain here why only a linearized version of it can be justified, and that the nonlinear CT is not available. The proof of consistency of the harmonic superspace \(({\cal N},p,q)\) in [25] was given for Yang-Mills theory and for \({\cal N}=1,2,3,4\) conformal supergravity. Conformal constraints of \({\cal N}\geq 5\) Poincare supergravity in the harmonic superspace were established in [25]. It was suggested there that "in the case of Poincare supergravity one needs to find the geometrical formulation of the additional constraints". The purpose of these additional constraints is to break the super Weyl invariance down to a super Poincare invariance. However, these additional constraints were not found during the last 3 decades since this suggestion was made. And since \({\cal N}=5\) Poincare supergravity breaks conformal symmetry at the nonlinear level1 the consistency of the nonlinear harmonic superspace of \({\cal N}=5\) Poincare supergravity remains unproven. The linearized CT is Footnote 1: See for example [17, 19] where it is explained that linearized supergravity is based on representations of \(SU(2,2|{\cal N})\) superconformal algebra. However nonlinear interactions of \({\cal N}\geq 5\) supergravity break conformal supersymmetry algebra \(SU(2,2|{\cal N})\) down to \({\cal N}\geq 5\) Poincaré superalgebra. These require the additional constraints in the harmonic superspace which were discussed in [25] but not delivered since. Even in case of \({\cal N}=4\) where superconformal theory is available, see for example [26] and references therein, the relevant harmonic superspace constraint breaking the superconformal theory to \({\cal N}=4\) super-Poincaré is not available. These additional constraints in a superspace without harmonic variables are known, they were presented in details in [12]. \[\kappa^{6}\int d^{4}x\,(d^{16}\theta)_{1}{}^{5}\Big{(}\bar{\chi}_{\hat{\beta} }^{1rs}\chi_{\alpha\,5rs}\Big{)}^{2}\sim\kappa^{6}\int d^{4}x\,d^{20}\theta \Big{(}W_{ijkl}\bar{W}^{ijkl}\Big{)}^{2}\,,\qquad r,s=2,3,4 \tag{7}\] The CT is linearly supersymmetric since the subspace of the superspace is available at the linear level, also the superfield \(W_{ijkl}\) of dimension zero exists only at the linear level. At the nonlinear level both forms of this CT are non-geometric, in agreement with [9; 10]. This means that they break nonlinear supersymmetry. Thus, _there is no CT generalizing the one in (7) to the nonlinear version with unbroken local nonlinear supersymmetry_ and local \(U(5)\)\(\mathcal{H}\)-symmetry. This explains the finiteness of \(\mathcal{N}=5,L=4\)[23]. Comparative to arguments in [18; 19], the argument above is simple (although it does not cover the cases with \(L\geq\mathcal{N}\), which are covered in [18; 19] and will be studied later in this paper). We stress here that simple explanation of the cancellation of 82 diagrams observed in [23] is that the relevant CT in (7) _breaks nonlinear local supersymmetry, although is preserves linear supersymmetry_. From the point of view of amplitudes, the cancellation of these 82 diagrams is surprising, it was given a name _enhanced ultraviolet cancellations_ in [23]. In amplitudes there is a manifest linear supersymmetry which controls the computations. But _nonlinear supersymmetry actually controlls the computations behind the scenes_ and leads to cancellation of a UV divergence at \(\mathcal{N}=5,L=4\). It remains to be seen what happens in computations in \(\mathcal{N}=5,L=5\). We will study here the theoretical predictions based on nonlinear local supersymmetry. ### A short summary and assumptions of this work We would like to clarify our statement as a short summary of this paper ahead of detailed discussions. It will be also a set of _important facts/assumptions_ we are using here to derive our main result. 1. We assume that \(\mathcal{N}\geq 5\), \(d=4\) supergravities have a classical action which can be deformed by a CT, as we show in pure gravity in (1) where in addition to Einstein-Hilbert term we also have \(R^{3}\) term which allows to eliminate the UV divergence of the second loop. We assume that the total action is _Lorentz invariant_. 2. We use the fact that (for example, in \(\mathcal{N}=8\)) the classical action [7; 8] _has off shell local symmetries: Lorentz symmetry, a nonlinear local supersymmetry and local \(SU(8)\)-symmetry, and on shell global \(E_{7(7)}\) symmetry_. Before local \(SU(8)\)-symmetry is gauge-fixed, \(E_{7(7)}\) and local \(SU(8)\)-symmetry are linearly realized and independent. After local \(SU(8)\)-symmetry is gauge-fixed, in the unitary gauge, there is a remaining rigid \(SU(8)\)-symmetry, a diagonal subgroup of \(E_{7(7)}\times SU(8)\). 3. There is a significant _difference between the linear supersymmetry in superamplitudes/supergravity and local nonlinear supersymmetry in supergravity.2_ In the linear supersymmetry there are certain constraints which permit the existence of the subspaces of the superspace and superfields depending only on Grassmann coordinates of the subspace. However, in the nonlinear case the integrability condition for these constraints is not valid, as one can see via a local supersymmetry algebra [11, 12]. Footnote 2: We are grateful to R. Roiban for a suggestion to clarify this issue with an understanding that amplitude computations manifestly preserve linearized supersymmetry. The reason for enhanced cancellation in this context is that linearized CT’s in \(d=4\) at \(L\geq\mathcal{N}\) can be promoted to nonlinear level, whereas the ones at \(L<\mathcal{N}\) cannot. \(\mathcal{N}=5,L=4\) is an example of a linear CT which has no nonlinear generalization, which is the reason for the mysterious cancellation of the sum of 82 diagrams in [23]. For example, a linearized superfield chirality condition \(D_{\dot{\alpha}\,i}X=0\) has an integrability requirement breaking chirality condition, in general, for \(\mathcal{N}\geq 3\) where spin \(1/2\) fields are present in geometry and induce the torsion \[\{D_{\dot{\alpha}\,i},D_{\dot{\beta}\,j}\}\,X=T^{\gamma}_{\dot{\alpha}\dot{ \beta}\,ijk}\,D^{k}_{\gamma}\,X+\ldots\qquad T^{\gamma}_{\dot{\alpha}\dot{ \beta}\,ijk}=\epsilon_{\dot{\alpha}\dot{\beta}}\,\chi^{\gamma}_{ijk}. \tag{8}\] It follows that at the nonlinear level a chiral superfield must be a constant: it is chiral, meaning that it is covariantly \(\bar{\theta}\)-independent, but it is required to be also covariantly \(\theta\)-independent, \(D^{k}_{\gamma}\,X=0\), due to torsion in the geometry. It follows that it cannot depend on space-time coordinates \(x\) due to \(\{D^{i}_{\alpha},D_{\dot{\beta}j}\}X=\delta^{i}{}_{j}\partial_{\alpha\dot{ \beta}}X+\cdots=0\) \[D_{\dot{\alpha}\,i}\,X=0+\text{integrability}\qquad\Rightarrow\quad D^{k}_{ \gamma}\,X=0\qquad\Rightarrow\quad X=\text{const}\;. \tag{9}\] Similarly, if we study the algebra of nonlinear supersymmetry acting on an \(SU(8)\) vector, we find that two local supersymmetry transformations generate a local \(SU(8)\) rotation on an \(SU(8)\) vector \(X^{k}\) \[\{D^{i}_{(\alpha},D^{j}_{\beta)}\}X^{k}=\delta^{(i}_{l}N^{j)k}_{\alpha\beta}\, X^{l}+\ldots \tag{10}\] where the \(SU(8)\) curvature \(N^{ij}_{\alpha\beta}\), \[N^{ij}_{\alpha\beta}=-\frac{1}{72}\epsilon^{ijklmpqr}\chi_{\alpha klm}\chi_{ \beta pqr}\,, \tag{11}\] is quadratic in fermions. This term is absent in the linear supersymmetry algebra. In \(\mathcal{N}=5,6\) analogous expressions for \(U(5)\) and \(U(6)\)\(\mathcal{H}\)-symmetry curvatures are obtained by truncation. The presence of these and other torsions and curvatures in the geometry break at the nonlinear level the constraints which prove the linear supersymmetry of the linearized CT's. _Now back to amplitudes_: In amplitudes the relevant on shell superfields (sometimes called super-wave function [27]) in \(d=4\) depend on \({\cal N}\) Grassmann variables \(\eta\)'s, see for example [28, 29]. There are \(2{\cal N}\) supercharges, they depend on \({\cal N}\) of \(\eta\)'s and \({\cal N}\) of \(\left({\partial\over\partial\eta}\right)\)'s for each particle in the process. In [30] the most advanced analysis of \(N^{K}MHV\;n\)-point superamplitudes is performed. The manifest linear supersymmetry relates various \(n\)-point amplitudes with fixed \(n\) to each other, the superamplitude comes with the factor \(\delta^{2{\cal N}}(\tilde{Q})\). This is an important difference with a nonlinear supersymmetry which relates amplitudes with different number of points \(n\) to each other. Nonlinear supersymmetry requires the relevant \(4{\cal N}\) Grassmann coordinates \(\theta^{i}_{\alpha},\bar{\theta}_{\dot{\alpha}\,i},\)\(\alpha,\dot{\alpha}=1,2,\,i=1,\ldots,{\cal N}\) of the superspace [11, 12], universal for all particles. The geometric superfields are nonlinear in space-time fields, being related to torsions and curvatures of the superspace. The simplest analogy is in general relativity where the curvature \(R_{\mu\nu\lambda\delta}(h)\) depends on gravitational fields \(h_{\mu\nu}\) nonlinearly. For example, the third component of the superfield \(\chi_{\alpha ijk}(x,\theta)\) which has a spin 1/2 spinor in the first component, is a Weyl spinor \(C_{\alpha\beta\gamma\delta}(x)\). Weyl spinor is related to a nonlinear Riemann-Christoffel tensor and \[D^{i}_{\alpha}D^{j}_{\beta}D^{k}_{\gamma}\,\chi_{\delta\,ijk}(x,\theta)|_{ \theta=0}=C_{\alpha\beta\gamma\delta}(x). \tag{12}\] The \(\eta\)-super-wave function-superfields in amplitudes describe a manifest linear supersymmetry of particle states, it is kind of 1/2 BPS state for MHV amplitudes. In nonlinear superspace geometry the superfields depend on \(4{\cal N}\)\(\theta^{\prime}s\) and there is no 1/2 or any other fraction subspace of the whole \(4{\cal N}\)-dimensional superspace. Therefore predictions of the nonlinear supersymmetry work "behind the scenes" in amplitude computations. 4. We will show that it is impossible to deform \(d=4\)\({\cal N}\geq 5\) supergravity action while keeping all the symmetries that the classical action has, local off shell and global on shell. Namely the deformation of the action leads to inconsistencies with either local Poincare supersymmetry or E7. Moreover, the breaking of E7 before local \({\cal H}\)-symmetry is gauge-fixed leads to breaking of local supersymmetry in the unitary gauge. So, _in all cases we find a breaking of local nonlinear supersymmetry which is caused by UV divergence_. E7, local \({\cal H}\) symmetries, and unitary gauge in \({\cal N}=5,6,8\) \({\cal N}=5,6,8\) supergravities3 have global duality symmetries, in addition to local symmetries, which complicates the analysis of UV divergences. These are symmetries defined by the groups Footnote 3: The review of \({\cal N}\geq 5\) supergravities with the proof of absence of \(U(1)\) anomalous amplitudes can be found in [29]. \[{\cal G}:SU(1,5),\ SO^{*}(12),\ E_{7(7)} \tag{1}\] in \({\cal N}=5,6,8\), respectively. These are called groups of type E7, see for example [31] and references therein. The local symmetries, in addition to local supersymmetry, include local \({\cal H}\)-symmetries \[{\cal H}:U(5),\ U(6),\ SU(8) \tag{2}\] in \({\cal N}=5,6,8\), respectively. The scalars in these theories before local \({\cal H}\)-symmetries are gauge-fixed are in the fundamental representation of \({\cal G}\). When local \({\cal H}\)-symmetries are gauge-fixed only physical scalars remain. These physical scalars represent the coordinates of the coset space \(\frac{{\cal G}}{{\cal H}}\). For example, in \({\cal N}=8\) there are 133 scalars before local \(SU(8)\) is gauge-fixed, and only 70 physical scalars in the unitary gauge, the 63 local parameters of \(SU(8)\) being used to remove the unphysical scalars. The vector fields transform as doublets under E7, however, only half of them are physical vectors. The relevant constraint on graviphotons takes care of the unitarity of the theory, making half of the doublets to be physical and independent, the second half dependent on physical vectors. For example, in \({\cal N}=8\) there are 56 vectors in the doublet but only 28 of them are physical. Therefore E7 duality and the related self-duality constraint are required for the unitarity of the theory. A constraint which makes half of supergravity vectors physical was introduced in [7, 8]. It was given a name _twisted nonlinear self-duality constraint_ and studied in [32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42]. Thus when looking at the deformation of the action caused by potential UV divergences we need to preserve local supersymmetry, local \({\cal H}\)-symmetry and E7 symmetry. All these symmetries may require a deformation consistent with a deformed action. The \(E_{7(7)}\) duality in \({\cal N}=8\) was discovered and studied in [7, 8] where 133 scalars are present before the gauge-fixing of a local \(SU(8)\) symmetry. The gauge-fixing of local \(SU(8)\) was also performed in [7; 8; 20] and the unitary gauge with 70 physical scalars was described. A general case of dualities in \(d=4\) supergravities was introduced by Gaillard and Zumino (GZ) in [33]. Standard global symmetries require a Noether current conservation, but in case of GZ duality [33] the usual Noether procedure is not applicable since duality acts on field strength and its dual rather than on vector fields. Therefore this duality symmetry is associated with the Noether-Gaillard-Zumino (NGZ) current conservation. In \({\cal N}=8\) case this NGZ conserved current was presented in [20]. Studies of duality symmetries were also performed in a unitary gauge, where local \({\cal H}\)-symmetries of supergravities were gauge-fixed [7; 8; 20], or using a symplectic formalism [34] developed in the bosonic theory without fermions. In both cases only physical scalars are present in the theory [33; 34; 35; 36; 37; 38; 39; 40; 41; 42; 43; 44; 45; 46], they form coordinates of the coset space \(\frac{{\cal G}}{{\cal H}}\). The approach to deformation of \({\cal N}\geq 5\) supergravity developed in [39; 42] was revisited in [16; 17; 18; 19] from the point of view of special properties of E7-type groups and supersymmetry. It was shown there that in absence of supersymmetry anomalies, duality symmetry protects \({\cal N}\geq 5\) supergravities from UV divergences. In [18] the analysis was based on manifest E7 symmetry whereas that in [19] was based on the properties of the unitary conformal supermultiplets of \(SU(2,2|{\cal N}+n)\). Here we will first recall that at the loop order \(L<L_{cr}={\cal N}\) for \({\cal N}=5,6,8\) there are no geometric superinvariants 4 in whole \((x,\theta)\) superspace in \(d=4\). This means that a UV divergence at \(L<L_{\rm cr}={\cal N}\) breaks nonlinear local supersymmetry and local \({\cal H}\) symmetry. If such terms are added to the classical action, they will break nonlinear local supersymmetry and local \({\cal H}\) symmetry of the classical theory. It means that the classical action deformed by \(L<L_{\rm cr}={\cal N}\) CT's is BRST inconsistent since deformed action is not invariant under local symmetries of the classical action. Footnote 4: In \({\cal N}=4\) the situation is different since the version of the theory with unbroken local \(U(4)\) symmetry has also a local superconformal symmetry, see [26] and references therein. Local superconformal symmetry in \({\cal N}=5,6,8\) supergravities is broken at the nonlinear level. We will also study the deformation of the local supersymmetry transformation caused by potential UV divergences supported by geometric non-linearly supersymmetric and \({\cal H}\) locally invariant candidate CTs at \(L\geq{\cal N}\). We will look at _supersymmetry transformation of fermions before gauge-fixing where fermions transform under local \({\cal H}\)_-symmetry, they are neutral under E7, and these two symmetries are independent and linearly realized_. Fermions before gauge-fixing local \({\cal H}\)-symmetry transform under supersymmetry into an E7 invariant and \({\cal H}\)-covariant graviphoton \({\cal F}\), for example \[\delta_{S}\chi_{ijk}={\cal F}_{ij}\epsilon_{k}+\ldots. \tag{3}\] In presence of the CT deforming the action the graviphoton is deformed into \({\cal F}_{ij}^{\rm def}\) \[{\cal F}_{ij}^{\rm def}={\cal F}_{ij}^{\rm(cl)}+\lambda\hat{ \cal F}_{ij}. \tag{4}\] This requires a deformation of supersymmetry transformation on fermions \[\delta_{S}^{\rm def}\chi_{ijk}={\cal F}_{ij}^{\rm def}\epsilon_{ k}+\cdots={\cal F}_{ij}^{\rm(cl)}\epsilon_{k}+\lambda\hat{\cal F}_{ij}\epsilon_{k}+ \cdots. \tag{5}\] to preserve the invariance of the fermions on E7 symmetry and covariance on \({\cal H}\)-symmetry before gauge-fixing. We will find out that the deformed action (4) is not invariant under deformed supersymmetry (5). If, instead, we sacrifice E7 and do not deform supersymmetry transformation on fermions, we will find that the breaking of E7 before gauge-fixing feedbacks into breaking local nonlinear supersymmetry in the unitary gauge. ## 3 Symmetries of de Wit-Nicolai (dWN) \({\cal N}=8\) supergravity ### Local \(Su(8)\) and on shell \(E_{7(7)}\) symmetry The classical action [8] with a local \(SU(8)\) symmetry before this symmetry is gauge fixed depends on 133 scalars represented by a 56-bein \[{\cal V}=\left(\begin{array}{cc}u_{ij}^{\ \ \,IJ}&v_{ijKL}\\ v^{klIJ}&u^{kl}_{\ \ KL}\end{array}\right) \tag{6}\] and its inverse \[{\cal V}^{-1}=\left(\begin{array}{cc}u^{ij}_{\ \,IJ}&-v^{ijKL}\\ -v_{klIJ}&u_{kl}^{\ \ KL}\end{array}\right). \tag{7}\] We summarize some identities for these matrices in appendix B. The capital indices \(I,J\) refer to \(E_{7(7)}\) and small ones \(ij\) refer to \(SU(8)\). The 56-bein transforms under a local \(SU(8)\) symmetry \(U(x)\) and a global \(E_{7(7)}\) symmetry \(E\) as follows \[{\cal V}(x)\to U(x){\cal V}(x)E^{-1}. \tag{3.3}\] These two symmetries are linearly realized and independent. Here \(E\in E_{7(7)}\) is in the fundamental 56-dimensional representation where \[E=\exp\left(\begin{array}{cc}\Lambda_{IJ}{}^{KL}&\Sigma_{IJPQ}\\ \Sigma^{MNKL}&\Lambda^{MN}{}_{PQ}\end{array}\right). \tag{3.4}\] Duality symmetry in (3.4) consists of a diagonal transformation \(\Lambda_{IJ}{}^{KL}=\delta_{[I}{}^{K}\Lambda_{J]}{}^{L}\) where \(\Lambda_{J}{}^{L}\) are the generators of the \(SU(8)\) maximal subgroup of \(E_{7(7)}\) with 63 parameters. The off-diagonal part is self-dual \(\Sigma_{IJPQ}=\pm\frac{1}{4!}\epsilon_{IJPQMNKL}\Sigma^{MNKL}\) and has 70 real parameters. The total Lagrangian in eq. (3.18) of [8] consists of two parts. One is manifestly \(E_{7(7)}\times SU(8)\) invariant, where \(E_{7(7)}\) is a global symmetry and \(SU(8)\) is a local symmetry. The other part of the action \({\cal L}^{\prime}+{\cal L}^{\prime\prime}\) is not manifestly \(E_{7(7)}\times SU(8)\) invariant. It depends on vectors, scalars and fermions and takes 3 lines in eq. (3.18) in [8] (lines 3, 4, 5). The 28 abelian vector field strength are defined as \[F^{IJ}_{\mu\nu}=\partial_{\mu}A^{IJ}_{\nu}-\partial_{\nu}A^{IJ}_{\mu}=F^{+}_{ \mu\nu IJ}+F^{-IJ}_{\mu\nu}. \tag{3.5}\] The dual vector field strength is \[G^{+\mu\nu}_{IJ}\equiv-\frac{4}{e}\frac{\partial{\cal L}}{\delta F^{+}_{\mu \nu IJ}}. \tag{3.6}\] The same Lagrangian \({\cal L}^{\prime}+{\cal L}^{\prime\prime}\) takes the following form in these notations \[{\cal L}^{\prime}+{\cal L}^{\prime\prime}=-\frac{1}{8}eF^{+}_{\mu\nu IJ}\,G^{ +\mu\nu}_{IJ}-\frac{1}{4}e{\cal F}^{+}_{\mu\nu ij}\,{\cal O}^{+\mu\nu ij}+{ \rm h.c.}. \tag{3.7}\] Here the fermion bilinear term is \[{\cal O}^{+ij}_{\mu\nu}=\pm\Big{[}\frac{1}{144}\sqrt{2}\epsilon^{ijklmnpq}\bar {\chi}_{klm}\sigma_{\mu\nu}\chi_{npq}-\frac{1}{2}(\bar{\psi}_{\lambda k} \sigma_{\mu\nu}\gamma^{\lambda}\chi^{ijk}-\sqrt{2}\bar{\psi}^{i}_{\rho}\gamma^ {[\rho}\sigma_{\mu\nu}\gamma^{\sigma]}\psi^{j}_{\sigma})\Big{]}. \tag{3.8}\] The first term is bilinear in gaugino, the second one has gaugino and a gravitino, the third one is bilinear in gravitino. The graviphoton here is related to \(F^{+}_{\mu\nu KL}\) as [8] \[u^{ij}{}_{IJ}{\cal F}^{+}_{\mu\nu ij}=S^{IJ,KL}F^{+}_{\mu\nu KL}+(S^{IJ,KL}+u^{ij} {}_{IJ}v_{ijKL}){\cal O}^{+KL}_{\mu\nu}, \tag{3.9}\] where \(S^{IJ,KL}\) is defined in eq. (B.8). We will review the derivation of this relation below. Now the first term in the action in (3.7) together with its h.c. vanishes on shell since upon partial integration it is of the form \[F\tilde{G}\to A_{\nu}\partial_{\mu}\tilde{G}^{\mu\nu}|_{\text{on shell}}=0 \tag{3.10}\] and the vector equation of motion with account of (3.6) is \[\partial_{\mu}\tilde{G}^{\mu\nu}=0\,. \tag{3.11}\] This equation of motion pairs with the Bianchi Identity for the abelian vector field strength \[\partial_{\mu}\tilde{F}^{\mu\nu}=0\,. \tag{3.12}\] E7-type symmetry flips one into another. The second term in (3.7) depends on the graviphoton \({\cal F}^{+}_{\mu\nu ij}\), and on spinor bilinear \({\cal O}^{+\mu\nu ij}\) which are both \(SU(8)\) tensors and E7 invariants. To conclude, the 3-line part of the action in [8] can be brought to a form (3.7) which, on shell with account of eq. (3.11), has manifest local \(SU(8)\) symmetry and global \(E_{7(7)}\). ### Manifest \(E_{7(7)}\) and twisted nonlinear self-duality constraint The \(E_{7(7)}\) doublet \(\left(\begin{array}{c}F^{+}_{1\mu\nu IJ}\\ F^{+IJ}_{2\mu\nu}\end{array}\right)\) depends on a double set of vectors, 56 in this case, which is a minimal representation for the symplectic representation in \(E_{7(7)}\). Note however that there are only 28 physical vectors in \({\cal N}=8\) supergravity. The doublet is constructed in [8] from a combination of the field strength \(F\) and its dual \(G\), where \(G\) defined in eq. (3.6) \[F^{+}_{1\mu\nu IJ}\equiv\frac{1}{2}(G^{+\mu\nu}_{IJ}+F^{+\mu\nu}_{IJ}), \tag{3.13}\] \[F^{+IJ}_{2\mu\nu}\equiv\frac{1}{2}(G^{+\mu\nu}_{IJ}-F^{+\mu\nu}_{IJ}). \tag{3.14}\] The \(E_{7(7)}\,\) doublet \(\left(\begin{array}{c}F^{+}_{1\mu\nu IJ}\\ F^{+IJ}_{2\mu\nu}\end{array}\right)\) depends on 56 independent vectors which is necessary to have manifest \(E_{7(7)}\,\). Under \(E_{7(7)}\,\) the doublet transforms as \[\left(\begin{array}{c}F^{+}_{1\mu\nu IJ}\\ F^{+IJ}_{2\mu\nu}\end{array}\right)\to E\left(\begin{array}{c}F^{+}_{1\mu \nu IJ}\\ F^{+IJ}_{2\mu\nu}\end{array}\right). \tag{3.15}\] We define the \(SU(8)\) covariant graviphoton and \({\cal F}^{+}_{\mu\nu ij}\) and the \(SU(8)\) covariant tensor \({\cal T}^{+ij}_{\mu\nu}\) \[\left(\begin{array}{c}{\cal F}^{+}_{\mu\nu ij}\\ {\cal T}^{+ij}_{\mu\nu}\end{array}\right)\equiv{\cal V}\left(\begin{array}{ c}F^{+}_{1}\\ F^{+}_{2}\end{array}\right)=\left(\begin{array}{cc}u_{ij}{}^{IJ}&v_{ijKL}\\ v^{ijIJ}&u^{ij}{}_{KL}\end{array}\right)\left(\begin{array}{c}F^{+}_{1\mu \nu IJ}\\ F^{+KL}_{2\mu\nu}\end{array}\right). \tag{3.16}\] All capital indices in the r.h.s. of eq. (3.16) are contracted between the 56-bein \({\cal V}\) in eq. (3.1) and E7 doublet From their definition and \(E_{7(7)}\,\) properties of \({\cal V}\) and the doublet \(\left(\begin{array}{c}F^{+}_{1\mu\nu IJ}\\ F^{+IJ}_{2\mu\nu}\end{array}\right)\) it is clear that the l.h.s. of eq. (3.16) are \(E_{7(7)}\,\) invariant. Thus, both the graviphoton and the tensor \({\cal T}^{+ij}_{\mu\nu}\) in eq. (3.16) are manifestly invariant under \(E_{7(7)}\,\) symmetry according to (3.3) and (3.15). In this manifestly E7 invariant form the constraint on vectors which makes only half of them physical and the other half dependent on physical vectors and scalars takes the form \[{\cal T}^{+ij}_{\mu\nu}={\cal O}^{ij}_{\mu\nu}, \tag{3.17}\] or equivalently \[\frac{1}{2}(I-\Omega){\cal V}\left(\begin{array}{c}F^{+}_{1\mu\nu}\\ F^{+}_{2\mu\nu}\end{array}\right)=\left(\begin{array}{c}0\\ {\cal O}^{+ij}_{\mu\nu}\end{array}\right). \tag{3.18}\] Here the 56-dimensional \(\Omega\) is \[\Omega=\left(\begin{array}{cc}I&0\\ 0&-I\end{array}\right). \tag{3.19}\] We call eq. (3.17) _the twisted self-duality constraint_. Let us see how eq. (3.17) reduces the number of degrees of freedom: Equation. (3.17) is explicitly given by \[2{\cal O}^{+ij}=(v^{ijIJ}+u^{ij}{}_{IJ})G^{+}_{IJ}+(v^{ijIJ}-u^{ij}{}_{IJ})F^{+ IJ}. \tag{3.20}\] Note that here and hereafter we omit the Lorentz indices. We need to solve it with respect to the dual field strength \(G^{+}_{IJ}\), which yields \[G^{+}_{IJ}= (v^{ijIJ}+u^{ij}{}_{IJ})^{-1}\left[(u^{ij}{}_{KL}-v^{ijKL})F^{+KL}+2 \mathcal{O}^{+ij}\right]\] \[= \left[(2S-\mathbf{1})^{IJ,KL}F^{+KL}+2S^{IJ,KL}\mathcal{O}^{+KL} \right], \tag{3.21}\] where \(\mathcal{O}^{+ij}_{\mu\nu}\equiv u^{ij}{}_{IJ}\mathcal{O}^{+IJ}_{\mu\nu}\) and we have used some identities in appendix A. This result corresponds to (2.4) of [8]. One can rewrite graviphoton \(\mathcal{F}^{+}_{ij}\) as \[\mathcal{F}^{+(\text{cl})}_{ij}= \frac{1}{2}(u_{ij}{}^{IJ}+v_{ijIJ})G^{+}_{IJ}+\frac{1}{2}(u_{ij}{ }^{IJ}-v_{ijIJ})F^{+}_{IJ}\] \[= \frac{1}{2}(u_{ij}{}^{IJ}+v_{ijIJ})\left[2S^{IJ,KL}F^{+}_{KL}-F^{ +}_{IJ}+2S^{IJ,KL}\mathcal{O}^{+}_{KL}\right]+\frac{1}{2}(u_{ij}{}^{IJ}-v_{ ijIJ})F^{+}_{IJ}\] \[= (u_{ij}{}^{IJ}+v_{ijIJ})S^{IJ,KL}F^{+}_{KL}-v_{ijIJ}F^{+}_{IJ}+(u _{ij}{}^{IJ}+v_{ijIJ})S^{IJ,KL}\mathcal{O}^{+}_{KL}\] \[= (\mathcal{M}_{ij,kl}u^{kl}{}_{KL}-v_{ijKL})F^{+}_{KL}+\mathcal{M} _{ij,kl}\mathcal{O}^{+kl}, \tag{3.22}\] where \[\mathcal{M}_{ij,kl}\equiv(u_{ij}{}^{IJ}+v_{ijIJ})(u^{kl}{}_{IJ}+v^{klIJ})^{-1}. \tag{3.23}\] The twisted self-duality constraint (3.17) reduces the number of degrees of freedom in a manifestly \(E_{7(7)}\) invariant way. In conclusion, the classical action of \(\mathcal{N}=8\) supergravity in the form (3.7) has the following properties. The first term is \[F\tilde{G} \tag{3.24}\] and it vanishes on shell when classical field equations are satisfied. The second term involves a graviphoton coupled to fermion bilinears \[\mathcal{L}_{\text{cl}}=-\frac{1}{4}e\mathcal{F}^{+}_{\mu\nu ij}\,\mathcal{O} ^{+\mu\nu ij}+\text{h.c.}+\dots. \tag{3.25}\] Here \(\dots\) include vector independent terms, which are manifestly \(E_{7(7)}\) and local \(SU(8)\) invariant. Once the CT is added to the classical action, equations of motion are deformed. We will study this below for \(\mathcal{N}\geq 5\) supergravities in general, and provide details in \(\mathcal{N}=8\) case. dWN supergravity deformation The deformation of Lagrangian due to the presence of a new local CT must be consistent with the duality, and therefore the dual field strength is affected by the presence of the new term in the action so that \(G\to G^{\rm def}\) \[G^{+\,{\rm def}}_{KL}=-4\frac{\delta(\mathcal{L}^{\rm cl}+\lambda\mathcal{L}^{ \rm CT})}{\delta F^{+}_{\mu\nu KL}}. \tag{4.1}\] In order to keep manifest \(E_{7(7)}\) and \(SU(8)\) invariance, instead of starting from the action, we deform the twisted duality condition (3.17) and find a consistent dual field strength and a corresponding action, which is proposed in [39]. Here we generalize the previous results [39, 42] to include fermionic bilinear terms: We consider the deformed twisted self-duality constraint \[\mathcal{T}^{+ij}_{\mu\nu}+\lambda X^{ij}{}_{kl}\bar{\mathcal{F}}^{-kl}_{\mu \nu}=\mathcal{O}^{+ij}_{\mu\nu} \tag{4.2}\] where \(X^{ij}{}_{kl}\) is an \(\mathcal{H}\)-covariant differential operator depending on other fields such as scalars and gravitons. Since we may interpret this condition as a shift of \(\mathcal{O}^{+ij}_{\rm def}=\mathcal{O}^{+ij}-\lambda X^{ij}{}_{kl}\bar{ \mathcal{F}}^{-kl}\), one can formally rewrite (4.2) as \[\mathcal{F}^{+}_{ij}=\mathcal{F}^{+(\rm cl)}_{ij}-\lambda\mathcal{M}_{ij,kl}X ^{kl}{}_{mn}\bar{\mathcal{F}}^{-mn} \tag{4.3}\] or equivalently \[\bar{\mathcal{F}}^{-ij}=\bar{\mathcal{F}}^{-ij(\rm cl)}-\lambda\bar{\mathcal{ M}}^{ij,kl}\bar{X}_{kl}{}^{mn}\mathcal{F}^{+}_{mn}, \tag{4.4}\] where the classical graviphoton is defined in (3.22) and we recall that \(\mathcal{M}_{ij,kl}\equiv(u_{ij}{}^{IJ}+v_{ijIJ})(u^{kl}{}_{IJ}+v^{klIJ})^{-1}\). One can substitute the second equation to the first, which yields \[\mathcal{F}^{+}_{ij}=\mathcal{F}^{+(\rm cl)}_{ij}-\lambda\mathcal{ M}_{ij,kl}X^{kl}{}_{mn}(\bar{\mathcal{F}}^{-mn(\rm cl)}-\lambda\bar{\mathcal{M}}^{ mn,pq}\bar{X}_{pq}{}^{rs}\mathcal{F}^{+}_{rs})\] \[\Leftrightarrow (\mathbf{1}-\lambda^{2}\mathcal{M}X\bar{\mathcal{M}}\bar{X})_{ ij}{}^{kl}\mathcal{F}^{+}_{kl}=\mathcal{F}^{+(\rm cl)}_{ij}+\lambda\mathcal{M}_{ ij,kl}X^{kl}{}_{mn}\bar{\mathcal{F}}^{-mn(\rm cl)}\] \[\Leftrightarrow \mathcal{F}^{+}_{kl}=\big{(}(\mathbf{1}-\lambda^{2}\mathcal{M}X \bar{\mathcal{M}}\bar{X})^{-1}\big{)}\,^{kl}{}_{ij}(\mathcal{F}^{+(\rm cl)}_{ kl}+\lambda\mathcal{M}_{kl,mn}X^{mn}{}_{pq}\bar{\mathcal{F}}^{-pq(\rm cl)}). \tag{4.5}\] This is a formal all-order solution to the deformed twisted self-duality condition. We emphasize that in the derivation of the deformed graviphoton, we have not imposed gauge fixing conditions on local \(SU(\mathcal{N})\) and therefore the result is fully consistent with both \(\mathcal{G}\) and \(\mathcal{H}\). One can further solve this relation in \(G^{+}_{IJ}\), which fixes the dual field strength as the classical supergravity case. Footnote 4: We note that the \(\mathcal{O}(\lambda^{2})\) invariant is not invariant under the \(\mathcal{O}(\lambda^{2})\) transformation. Formal expansion in \(\lambda\) yields the graviphoton, and up to \(\mathcal{O}(\lambda)\) we find \[\mathcal{F}^{+}_{ij}=\mathcal{F}^{+(\text{cl})}_{ij}+\lambda\mathcal{M}_{ij,kl}X ^{kl}{}_{mn}\bar{\mathcal{F}}^{-mn(\text{cl})}+\mathcal{O}(\lambda^{2}). \tag{4.6}\] Solving this equation with respect to \(G^{+\text{def}}_{KL}\) and integrating the both sides of (4.1) with respect to \(F^{+}_{KL}\) perturbatively yields the corresponding duality invariant action, and one can check that the lowest order correction is given by \[\lambda\,\mathcal{L}^{CT}=-\frac{1}{2}\lambda\,\mathcal{F}^{+}_{ij}X^{ij}{}_{ kl}\bar{\mathcal{F}}^{-kl}+\mathcal{O}(\lambda^{2}) \tag{4.7}\] as we expected. However, the constructed action in general has infinite numbers of higher order terms, which is necessary to keep \(E_{7(7)}\) to all orders. This is a generalization of the purely bosonic deformation in [38; 39; 40; 42], and we also emphasize that we have not gauge fixed local \(\mathcal{H}\)-symmetry unlike our previous construction using a symplectic formalism in [34]. We would like to emphasize the most crucial point of our result (4.6): The on-shell deformed graviphoton has a term including \(M_{ij,kl}\) which looks \(E_{7(7)}\) invariant but actually is not. Thus, the deformation of the graviphoton makes the \(E_{7(7)}\) invariance not manifest. Nevertheless, it is still consistent with \(E_{7(7)}\) if we include all order corrections by construction. However, it is not clear if such deformation is consistent with supersymmetry, and we will show that it is unlikely, from which we will conclude that despite duality invariant construction of the deformation, the resultant action leads to a problem with supersymmtry. Throughout this paper, we focus on the deformed twisted self-duality constraint (4.2). One may wonder whether a more general constraint is available. We expect that it is possible but the generalization would not change our conclusion: We note that \(\lambda\) is a coupling constant which is some powers of \(\kappa\), and we could add more terms to the constraint such as \(\lambda(\mathcal{F}^{+\rho\eta}_{kl}\mathcal{T}^{+kl}_{\rho\eta})^{n}\mathcal{ T}^{+ij}_{\mu\nu}\) if \(n\) is appropriately chosen, namely, if the mass dimension of \(\lambda(\mathcal{F}^{+\rho\eta}_{kl}\mathcal{T}^{+kl}_{\rho\eta})^{n}\mathcal{ T}^{+ij}_{\mu\nu}\) matches that of \(\lambda X^{ij}{}_{kl}\bar{\mathcal{F}}^{-kl}_{\mu\nu}\). Such terms would contribute to higher point interactions and we will not discuss it here as we are interested in a minimal deformation.5 As far as we have considered, we have not found any term that (1) may change our discussion below, (2) has appropriate \(SU(8)\) indices and (3) is manifestly \(E_{7(7)}\) invariant. Therefore, we believe that the following discussion would not be changed by adding more terms to the twisted self-duality constraint. Footnote 5: We expect that such deformation can also be solved at least perturbatively in \(\lambda\). Deformation of \({\cal N}\geq 5\) ### Candidate CT's There are three approaches to candidate CT's we would like to describe here shortly. 1. The candidate CT's for the possible UV divergences in extended supergravities were predicted in the past [9; 10] on the basis of a Lorentz-covariant on shell superspace geometry [11; 12] with 4 space-time coordinates \(x\) and \(4{\cal N}\) Grassmann coordinates \(\theta\). These were either linearized CT's or full nonlinear CT's, the examples will be presented below. The nonlinear CT's are known to have manifest local nonlinear supersymmetry and duality symmetry under condition that classical equations of motion are satisfied. Linearized CT's break nonlinear supersymmetry and duality, some of them can be promoted to full nonlinear status, some cannot. The difference is defined by dimension: In \(d=4\) the ones for loop order \(L\leq{\cal N}-1\) cannot be promoted to the supersymmetric terms at the nonlinear level, whereas the ones for \(L\geq{\cal N}\) can be. 2. The candidate CT's in Lorentz-covariant on shell harmonic superspace geometry, see for example [24], are linearized CT's depending on additional harmonic coordinates. At the linearized level they can be written also without harmonic coordinates as integrals over subspace of the superspace \(\int d^{4{\cal N}(1-\frac{1}{k})}\theta\), these are called \(\frac{1}{k}\) BPS invariants. We have argued in Sec. 1.2 that nonlinear harmonic superspace describing nonlinear super-Poincare supergravities is inconsistent since the relevant constraints promised in [25] is still missing. 3. Finally candidate CT's were studied in the amplitude's framework in [44; 45; 46; 47]. In all cases in these papers only linearized supersymmetry was used in combination with studies of a single soft scalar limit. In all cases in [45; 47] only part of nonlinear supersymmetry and duality was used, namely linearized supersymmetry and soft scalar limits. This was the reason why in [45] the case of \({\cal N}=8,L=7\) was left as inconclusive and the same in [47] where the case of \({\cal N}=5,L=4\) was left as inconclusive. By comparing these tree approaches to candidate CT's we conclude that only in case 1. we have a clear explanation of enhanced cancellation of \({\cal N}=5,L=4\) UV divergence [23] since the relevant candidate CT breaks nonlinear local supersymmetry. We assume that UV divergences require the deformation of the action so that we add the CT with the parameter \(\lambda\) \[S^{\rm def}=S_{\rm cl}+\lambda S^{\rm CT}_{L\leq{\cal N}-1}. \tag{5.1}\] In what follows we will use the short form of the superinvariants as integrals over a superspace or its subspaces. Note that in our eqs. (5.2), (5.4), (5.5) below we show that the result of \(\theta\)-integration of these superinvariants can be computed and gives a space-time integral with some dependence on space time curvature as well as other terms shown by a set of dots. The reason to use a short form of the supersymmetric invariants becomes clear if one looks at the 3-loop CT in \({\cal N}=8\) in eq. (6.8) in [46] written in components in linearized approximation: it has 51 terms. This expression was obtained using amplitude methods. But all these 51 terms are packaged in the linearized superinvariant in eq. (5.4) below, it was first presented in [9]. ### Loop order \(L\leq{\cal N}-1\) It is known from [9; 10] that in \(d=4\) the whole superspace CT's are available only starting from \(L_{\rm cr}={\cal N}\) \[CT^{L={\cal N}}=\kappa^{2({\cal N}-1)}\int d^{4}x\,d^{4{\cal N}}\theta\det E\, {\cal L}(x,\theta)=\kappa^{2({\cal N}-1)}\int d^{4}x\,D^{2({\cal N}-3)}\,R^{4}+\ldots \tag{5.2}\] where the superspace Lagrangian \({\cal L}(x,\theta)\) has dimension 2, the smallest possible dimension for a geometric Lagrangian. For example at \({\cal N}=8\) it is a quartic product of 4 geometric superfields defining minimal dimension torsion shown in eq. (1.8). \[{\cal L}(x,\theta)^{L=8}=\chi_{\alpha\,ijk}(x,\theta)\,\chi^{\alpha}_{mnl}(x, \theta)\,\bar{\chi}^{ijk}_{\dot{\alpha}}(x,\theta)\,\bar{\chi}^{\dot{\alpha} \,mnl}(x,\theta) \tag{5.3}\] The first components of these superfields are spin 1/2 fermions. At smaller \({\cal N}\) a consistent supersymmetric truncation of the maximal superspace [11] was performed in [12]. A consistent truncation of the expression in (5.3) will provide the superfield Lagrangian for smaller \({\cal N}\). Here we integrate over the total superspace and the spinorial superfield \(\chi_{\alpha\,ijk}\) associated with the superspace torsion is covariant under the local \(SU(8)\). The superspace Lagrangian (5.3) quartic in spinorial superfields is invariant under local \({\cal H}\)-symmetry. All candidate CT's at \(L<L_{\rm cr}\) are available only as integrals over a subspace of the superspace: this is one way of reducing the dimension of \(d^{4{\cal N}}\theta\). Also the superfield Lagrangian in linearized supersymmetry is not geometric anymore, it typically depends on superfields starting with scalar fields and has dimension 0, instead of dimension 2 in (5.3). For example, the 3-loop \({\cal N}=8\) candidate CT is [9; 48] \[CT^{L=3}=\kappa^{4}\int d^{4}x\,(d^{16}\theta)_{1234}W^{4}_{1234}=\kappa^{4}\int d ^{4}x\,R^{4}+\ldots. \tag{5.4}\] It is an integral over the half of the superspace and it depends on physical scalars only. This linearly supersymmetric expression exist only in the unitary gauge where the local \(SU(8)\) symmetry is gauge-fixed. In loops \(L=4,5,6,7\) the linearized candidate CT's are also available, and they also require a unitary gauge and a subspace of the full superspace. Therefore all local symmetries, in particular a nonlinear local supersymmetry is broken, despite the CT's like (5.4) have unbroken linear supersymmetry. It means, for example, that the simplest explanation of the 3-loop UV finiteness of \({\cal N}=8\) supergravity [49] is the fact that the CT (5.4) breaks nonlinear local supersymmetry. If a UV divergence will show up at \(L<L_{\rm cr}={\cal N}\) in in \({\cal N}=5,6,8\) and the corresponding CT will be added to the action to absorb the UV divergence, the relevant deformed theory will be BRST inconsistent since a local nonlinear supersymmetry of the deformed action will be broken. There is even no need to study the situation with duality in these cases, breaking of local symmetries makes the deformed action BRST inconsistent. So far in the loop computations in \(d=4\) we have not seen UV divergences at \(L<L_{\rm cr}={\cal N}\). The loop computation in \({\cal N}=5,L=4\)[23] suggest that so far there is no need to deform \({\cal N}=5\) supergravity. But the loop computations of UV divergences at \({\cal N}=6,L=5\) and \({\cal N}=8,L=7\) are not available. Thus we have to wait to see if \(d=4\) is special in this respect. Assuming that as in \({\cal N}=5\) case the cases of \({\cal N}=6,L=5\) and \({\cal N}=8,L=7\) are also UV finite, we proceed to the case \(L\geq{\cal N}\) for all of them. ### Loop order \(L\geq{\cal N}\) Starting from loop order \(L={\cal N}\) the geometric on shell CT's are available [9; 10]. With a symbolic insertion of space-time \({\cal H}\) covariant derivatives to increase the dimension we can present them as follows \[CT^{L\geq{\cal N}}=\kappa^{2(L-1)}\int d^{4}x\,d^{4{\cal N}}\theta\det E\,{\cal L }(x,\theta)=\kappa^{2(L-1)}\int d^{4}x\,D^{2(L-3)}\,R^{4}+\ldots, \tag{5.5}\] \[{\cal L}(x,\theta)=\,\chi_{\alpha\,ijk}(x,\theta)\,\chi^{\alpha}_{mnl}(x, \theta)\,D^{2(L-{\cal N})}\bar{\chi}^{ijk}_{\dot{\alpha}}(x,\theta)\,\bar{\chi }^{\dot{\alpha}\,mnl}(x,\theta), \tag{5.6}\] where \(D\) in (5.2) denotes spacetime covariant derivative whereas that in (5.6) symbolically denotes multiples of either spinor or spacetime covariant and \({\cal H}\)-covariant derivatives with total dimension \(2(L-{\cal N})\). These expressions require that the classical equations of motion are valid since the superspace in \({\cal N}\geq 5\) is available only on shell [11; 12]. At this point if the UV divergence takes place at any of \(L\geq{\cal N}\), we deform the action to absorb UV divergence, as \[S^{\rm def}=S_{\rm cl}+\lambda S^{\rm CT}_{L\geq{\cal N}}. \tag{5.7}\] We cannot easily dismiss these terms as in cases \(L\leq{\cal N}-1\) where the CT's like the ones in (1.7) and in (5.4) manifestly break non-linear supersymmetry and local \({\cal H}\) symmetry and therefore do not present a consistent deformation. As long as classical equations of motion are satisfied the CT's in eqs. (5.2), (5.6) appear to be legitimate candidates for the deformation. However, once we deform the classical action due to UV divergences, classical equations of motion are not valid anymore, they acquire \(\lambda\)-corrections. Furthermore, it was already realized that due to these corrections, E7 symmetry of the deformed action is broken and higher order in \(\lambda\) deformations are required to restore E7 symmetry [38; 39; 40; 42]. The study in [42] was performed for the bosonic action with local \({\cal H}\)-symmetry gauge-fixed. Here we have generalized the results in [42] to the supergravity with local \({\cal H}\)-symmetry and including fermions in Sec. 4. We will study below the local supersymmetry of the deformed action at the \(\lambda\)-order. ## 6 Deformation of supersymmetry due to UV divergences ### Preserving E7 Consistency of supergravity with unbroken local \({\cal H}\)-symmetry requires that E7 and supersymmetry commute modulo equations of motion. This is a consequence of the re quirement that the classical or deformed action is invariant under local supersymmetry off shell \(\delta_{S}S=0\) and under E7 on shell \(\delta_{E7}S|_{S,i=0}=0\), \[[\delta_{E7},\delta_{S}]|_{S,i=0}=0. \tag{108}\] If there is a UV divergence we add a CT to the classical action. Classical supersymmetry transformation of the fermions depends on E7 invariant \(\mathcal{H}\)-symmetry covariant graviphoton \(\mathcal{F}^{\text{(cl)}}\). \[\delta\chi^{\text{cl}}_{\alpha ijk}=\mathcal{F}^{\text{(cl)}}_{\alpha\beta[ ij}\epsilon^{\beta}_{k]}+\dots, \tag{109}\] where \(\dots\) are vector-independent dependent terms. But the classical graviphoton \(\mathcal{F}^{\text{(cl)}}\) is not E7 invariant anymore. It is the deformed graviphoton \[\mathcal{F}^{\text{def}}=\mathcal{F}^{\text{(cl)}}+\lambda\hat{\mathcal{F}}. \tag{110}\] which we defined in eqs. (102), (103), which is E7 invariant. If we would like to preserve the E7 invariance of the fermions after supersymmetry transformations, we need to deform the supersymmetry transformation of the fermions due to UV divergence. \[\delta^{\text{def}}\chi_{\alpha ijk}=\delta^{\text{cl}}\chi_{\alpha ijk}+ \hat{\delta}\chi_{\alpha ijk} \tag{111}\] where \[\hat{\delta}\chi_{\alpha ijk}=\lambda\hat{\mathcal{F}}_{\alpha\beta[ij} \epsilon^{\beta}_{k]}, \tag{112}\] We use the \(\lambda\)-order CT in (105) in spinorial notation \[\mathcal{L}^{\text{CT}}=\mathcal{F}^{\alpha\beta}_{ij}X_{\alpha\beta\hat{ \alpha}\hat{\beta}}\bar{\mathcal{F}}^{\hat{\alpha}\hat{\beta}ij} \tag{113}\] and we find that \[\hat{\mathcal{F}}_{a\beta ij}=-\mathcal{M}_{ij,mn}X_{\alpha\beta\hat{\alpha} \hat{\beta}}\bar{\mathcal{F}}^{\hat{\alpha}\hat{\beta}mn\,cl}+\mathcal{O}( \lambda). \tag{114}\] Classical action is invariant under classical supersymmetry transformations, however, when we deformed classical supersymmetry transformations for spin 1/2 fermions, we have an extra term in the supersymmetry transformation of the action \[\hat{\delta}S^{\text{(cl)}}=\frac{\delta S^{\text{(cl)}}}{\delta\chi_{\alpha ijk }}\lambda\hat{\mathcal{F}}_{\alpha\beta[ij}\epsilon^{\beta}_{k]}+\text{h.c.}. \tag{115}\] How to cancel this term? There are two possibilities, the first one is to deform some supersymmetries of the classical fields in the classical action. The second one is to find out if the \(\lambda\) order CT has an analogous term to cancel (115). For our purpose here it is convenient to use the form of supersymmetry transformations in [7] which is manifestly \(E_{7(7)}\) covariant. In particular the supersymmetry of vectors is presented in the form of the doublet using all 56 vectors, 28 vectors \(B_{\mu}^{MN}\) and 28 \(C_{\mu MN}\) in notations in [7] as shown in eq. (8.23) there. By checking all supersymmetry rules in eqs. (8.21)-(8.25) we can see that only fermion rules in presence of CT deformation break \(E_{7(7)}\). All supersymmetry transformations of bosons do not change due to presence of the CT in the action. Even the ones for vectors, due to a manifest doublet form of supersymmetry rules in eq. (8.23) in [7], have a build-in dependence on presence of the CT. The term we would like to cancel in eq. (6.8) is \[\hat{\delta}_{S}S^{\rm(cl)}=\frac{\delta S^{\rm(cl)}}{\delta\chi_{\alpha ijk}} \lambda{\cal M}_{ij,mn}X_{\alpha\beta\dot{\alpha}\dot{\beta}}\bar{\cal F}^{ \dot{\alpha}\dot{\beta}mn}\,\epsilon_{k}^{\beta}+{\rm h.c.}. \tag{6.9}\] All expressions in (6.9) are \(E_{7(7)}\) invariant with exception of \({\cal M}_{ij,kl}\). This expression, \({\cal M}_{ij,kl}=(u_{ij}{}^{IJ}+v_{ijIJ})(u^{kl}{}_{IJ}+v^{kilJ})^{-1}\), is \({\cal H}\)-symmetry covariant but not \(E_{7(7)}\) invariant. Note that in both factors in \({\cal M}_{ij,kl}\) we add terms which transform differently under E7 with indices \(I,J\) both up and down. This means that trying to cancel the term (6.9) we need to deform some of the supersymmetry transformations in classical action for the graviton, vectors or scalars by forcing some additional \(\lambda\) corrections which are not \(E_{7(7)}\) invariant. We have not found any such transformations which would remove the problematic terms in (6.9). Furthermore, it would mean that we have to add a term in (3.2) that is not invariant under \(E_{7(7)}\) in the transformation law of an \(E_{7(7)}\) singlet field \(\chi_{\alpha ijk}\). But this would defeat the purpose of restoring \(E_{7(7)}\) on fermions which is lost in presence of the CT. We conclude therefore that there is no consistent way to avoid supersymmetry breaking of the classical action while preserving \(E_{7(7)}\). ### Breaking E7 Here we will argue that breaking E7 leads to the same consequences as deforming supersymmetry on fermions with preservation of supersymmetry. So, we keep classical supersymmetry transformations on fermions as in eq. (6.2) and the classical action is invariant under local supersymmetry, but E7 is broken. There are few aspects in this analysis. We study supersymmetry algebra with account of nonlinear terms in supersymmetry transformations. We take into account the fact that local \({\cal H}\) symmetry and rigid one in the unitary gauge differ by an E7 transformations. It means, the object which was covariant under local \({\cal H}\) symmetry might break a rigid \({\cal H}\) symmetry in the unitary gauge. We give a relevant example of this phenomena. 1. _Supersymmetry algebra_ Breaking E7 when using a classical supersymmetry transformations without deformation also leads to a breaking of a nonlinear supersymmetry. We explain it here, this effect can be seen via the local supersymmetry algebra. If we keep classical supersymmetry and breaking E7, this would mean that the fermion supersymmetry transformation is not affected by the CT, but inconsistencies will appear in the nonlinear supersymmetry algebra. The supersymmetry algebra on fermions at the linear level is \[\{\delta_{1},\delta_{2}\}=\delta_{\rm Diff}+\delta_{SO_{(3,1)}}+\delta_{U(1)}+{ \cal O}(\chi^{2}) \tag{6.10}\] (see eq. (3.14) in [35]). But at the non-linear level (see eq. (3.22) in [35]) \[\{\delta_{1s},\delta_{2s}\}=\delta_{3s}+\delta_{\rm Diff}+\delta_{SO_{(3,1)}}+ \delta_{U(1)}+\delta_{SU(8)} \tag{6.11}\] one can see that there is, in addition, another supersymmetry transformation \(\delta_{S3}\) as well as an \(SU(8)\) rotation. We have shown this \(SU(8)\) rotation before in eqs. (1.10), (1.11). Thus in the unitary gauge the commutator of two non-linear classical supersymmetry variations generates another supersymmetry, a field dependent \(SU(8)\) symmetry in addition to the parts which were seen in the linear approximation \[\{\delta_{1s},\delta_{2s}\}=\delta_{3s}+\delta_{SU(8)}+\dots \tag{6.12}\] where \(\dots\) is for terms in the algebra one can see in the linear approximation. In the unitary gauge, the rigid field dependent \(SU(8)\) symmetry is a mix of locally gauge-fixed \(SU(8)\) and the \(SU(8)\) subgroup of E7. Therefore, if E7 was broken before gauge-fixing, in the unitary gauge the field dependent \(SU(8)\) will be broken. This results in breaking of nonlinear supersymmetry according to the algebra in eq. (6.11). 2. _Compensating \({\cal H}\) symmetry transformation preserving the unitary gauge_ When we make an \(E_{7(7)}\) transformation for example in \({\cal N}=8\), it will by itself not keep 70 scalars intact, its role is to mix 133 of them, so E7 by itself will break the unitary gauge condition that \({\cal V}={\cal V}^{\dagger}\). Therefore the important feature of \(SU(8)\) symmetry in the unitary gauge, is that it is the rigid subgroup of \(E_{7(7)}\times SU(8)\). Comparing it with the one before gauge-fixing one finds that it involves an additional compensating \(SU(8)\) rigid field dependent transformation preserving the unitary gauge. The explicit form of this compensating transformation on fermions as a function of \(E_{7(7)}\) parameters is presented in eqs. (4.31)-(4.34) in [20]. This explains why an expression which was was covariant under local \({\cal H}\) symmetry might break a rigid \({\cal H}\) symmetry in the unitary gauge. 3. _Example_ To exemplify this statement consider the expression causing supersymmetry breaking in eq. (6.9) due to \[\hat{\delta}\chi_{\alpha ijk}=\lambda{\cal M}_{[ij,mn}X_{\alpha\beta\dot{ \alpha}\dot{\beta}}\bar{\cal F}^{\dot{\alpha}\dot{\beta}mn}\epsilon^{\beta}_{ k]} \tag{6.13}\] When local \({\cal H}\)-symmetry is not gauge-fixed, the rhs of eq. (6.13) is \(SU(8)\) covariant since each factor in the product \[{\cal M}_{ij,kl}\equiv({u_{ij}}^{IJ}+v_{ijIJ})({u^{kl}}_{IJ}+v^{klIJ})^{-1}=(u+ v)(\bar{u}+\bar{v})^{-1} \tag{6.14}\] is \(SU(8)\) covariant, although not E7 invariant, according to eqs. (3.1), (3.3). The submatrices \(u\) and \(v\) carry indices of both \(E_{7(7)}\) and \(SU(8)\) (\(I,J=1,...,8,\ i,j=1,...,8\)) but in the unitary gauge where \[{\cal V}={\cal V}^{\dagger} \tag{6.15}\] we retain only manifest invariance with respect to the rigid diagonal subgroup of \(E_{7(7)}\times SU(8)\), without distinction between the two types of indices. In the unitary gauge [7, 8, 20] \[{\cal V}=\left(\begin{array}{cc}{u_{ij}}^{IJ}&v_{ijKL}\\ v^{klIJ}&{u^{kl}}_{KL}\end{array}\right)|_{{\cal V}={\cal V}^{\dagger}}\ \Rightarrow\left(\begin{array}{cc}P^{-1/2}&-(P^{-1/2})y\\ -\bar{P}^{-1/2}\bar{y}&\bar{P}^{-1/2}\end{array}\right)+\ldots \tag{6.16}\] where \[P=1-y\bar{y}\,,\qquad y_{ij,kl}=\phi_{ijmn}\left(\frac{\tanh\sqrt{\frac{1}{8} \bar{\phi}\dot{\phi}}}{\sqrt{\dot{\phi}\dot{\phi}}}\right)^{mn}_{kl}\,, \tag{6.17}\] Here \(\phi_{ijkl}\) and \(\bar{\phi}^{ijkl}=\pm\frac{1}{24}\epsilon^{ijklmnpq}\phi_{mnpq}\) transform in 35-dimensional representation of \(SU(8)\). These are 70 physical scalars in the unitary gauge. In the linear approximation \(P=\bar{P}=1\), \(y=\frac{1}{\sqrt{8}}\phi\), and we find \[u+v\Rightarrow 1-\frac{1}{\sqrt{8}}\phi\,,\qquad\bar{u}+\bar{v}\Rightarrow 1- \frac{1}{\sqrt{8}}\bar{\phi} \tag{6.18}\] \[{\cal M}|_{{\cal V}={\cal V}^{\dagger}}\ \Rightarrow I-\frac{1}{\sqrt{8}}(\phi- \bar{\phi})+\cdots \tag{118}\] If we use indices, we see that \(SU(8)\) is broken down to \(SO(8)\) \[{\cal M}_{ij,kl}|_{{\cal V}={\cal V}^{\dagger}}\ \Rightarrow\delta_{ijkl}-\frac{1}{ \sqrt{8}}(\phi_{ijkl}-\bar{\phi}^{klij})+\cdots \tag{119}\] We see here that in the unitary gauge \({\cal M}_{ij,kl}\) is not \(SU(8)\) covariant anymore since the \(SU(8)\) symmetry in the unitary gauge (the rigid diagonal subgroup of \(E_{7(7)}\times SU(8)\)) has inherited the broken E7 symmetry of \({\cal M}_{ij,kl}\) before gauge-fixing. One can also try to invent some deformation of supersymmetry/duality rules to see how exactly to make the action invariant under local supersymmetry off shell and under \(E_{7(7)}\) on shell so that eq. (10) is valid for a deformed theory. For example, we could add terms that have more powers of fields. However, addition of such terms does not alter our conclusion since it does not cancel the problematic term discussed above. ### Supersymmetry transformation of the CT The CT action under classical supersymmetry is supersymmetric if classical equations of motion are satisfied. Therefore it is hard to see how the expression in (102) can be compensated if the action is \(S^{\rm cl}+\lambda S^{\rm CT}\). One can look at a simple example when we keep only the terms in variation (102) with the minimal number of fields, both in fermion eq. of motion as well as in \(\hat{\cal F}\) \[\hat{\delta}S^{(\rm cl)}=\lambda(\partial^{\alpha}{}_{\dot{\alpha}}\bar{ \chi}^{\dot{\alpha}ijk})\delta_{im}\delta_{jn}X_{\alpha\beta\dot{\alpha}\dot{ \beta}}\bar{\cal F}^{\dot{\alpha}\dot{\beta}mn\,cl}\epsilon^{\beta}_{k}+\ldots, \tag{120}\] where we have used the fact that \(M_{ij,mn}=\delta_{im}\delta_{jn}+\cdots\) at the leading order in scalar fields expansion. If we choose \(X_{\alpha\beta\dot{\alpha}\dot{\beta}}\) depending on 2 gravitons, this is a 4-field expression with one fermion, 2 graviton and one vector.6 Then, the expansion of \(X\) in fields is given by Footnote 6: We have used \(SU(8)\) covariant operator \(X_{ij}{}^{kl}\) but now we are focusing on the terms containing two gravitons with two fermions or with two vectors, and the \(SU(8)\) connection does not contribute. Therefore, \(X\) becomes an operator without \(SU(8)\) indices independently of our choice of the full \(X_{ij}{}^{kl}\). \[X_{\alpha\beta\,\dot{\alpha}\dot{\beta}}=R_{\alpha\beta\gamma\delta}(x)R_{ \dot{\alpha}\dot{\beta}\dot{\gamma}\dot{\delta}}(x)\partial^{2(L-3)}\partial^ {\gamma\,\dot{\gamma}}\partial^{\delta\,\dot{\delta}}+\cdots, \tag{121}\] where ellipses denote the operators that have more fields. Using the leading order expansion, the CT we consider is reduced as \[{\cal L}^{CT}={\cal F}^{\alpha\beta}_{ij}X_{\alpha\beta\dot{\alpha}\dot{ \beta}}\bar{\cal F}^{\dot{\alpha}\dot{\beta}ij}={\cal F}^{\alpha\beta}_{ij}R_{ \alpha\beta\gamma\delta}(x)R_{\dot{\alpha}\dot{\beta}\dot{\gamma}\dot{\delta}} (x)\partial^{2(L-3)}\partial^{\gamma\,\dot{\gamma}}\partial^{\delta\,\dot{ \delta}}\bar{\cal F}^{\dot{\alpha}\dot{\beta}ij}+\cdots \tag{122}\] where the ellipses denote terms having more fields. This leading term corresponds to a linearized supersymmetric \(R^{4}\) invariant in [46] with extra \(\partial^{2(L-3)}\) derivatives. We would like to ask whether the linearized supersymmetric \(\partial^{2(L-3)}R^{4}\) has a term that cancel the supersymmetry variation (6.21) since it has the same numbers of fields. Indeed, there is the 2-fermion, 2 graviton term in the linearized superinvariant in [46] where (in line 5 in eq. (6.8)) \[R_{\dot{\alpha}\dot{\beta}\dot{\gamma}\dot{\delta}}\bar{\chi}^{\dot{\alpha}ijk} \partial^{\beta\dot{\beta}}\partial^{\gamma\dot{\gamma}}\partial^{\delta\dot {\delta}}\partial^{2(L-3)}\chi^{\alpha}_{ijk}R_{\alpha\beta\gamma\delta}. \tag{6.24}\] However, the supersymmetry transformation of this term does not have the tensorial structure to cancel (6.21), and therefore, the additional supersymmetry variation due to deformation of the graviphoton cannot be canceled. Let us repeat and summarize our logic here: First, we have considered a deformation of twisted duality condition so that we keep \(E_{7(7)}\) invariance. This leads to a deformation of the graviphoton, and accordingly the deformation of fermion's supersymmetry variation. Thus, we find an additional supersymmetry variation (6.21). On the other hand, the CT we have added at \(\mathcal{O}(\lambda)\) can be represented by a linearized supersymmetric CT shown in [46]. We have asked whether the supersymmetry transformation of the linearized superinvariant can cancel the additional variation (6.21) associated with the graviphoton variation. We have found that it does not cancel the supersymmetry breaking of they classical action due nto deformation of the supersymmetry on fermions. The deformation of local supersymmetry transformation is required to preserve the E7 invariance of the fermions after supersymmetry transformation. Thus if it is not cancelled within the action \(S^{\rm cl}+\lambda S^{\rm CT}\), it means that this action, which is claimed to restore E7 symmetry in presence of fermions, is not invariant under deformed supersymmetry. If we do not deform the supersymmetric transformation of the fermions, the problem we referred to does not arise directly. However, it does arise as we have shown using the supersymmetry algebra and the fact that the effect of broken E7 before gauge-fixing \(\mathcal{H}\)-symmetry leads to a broken rigid \(\mathcal{H}\)-symmetry and breaking of non-linear local supersymmetry via the algebra in eq. (6.11). It appears we have a choice, if UV divergence will be detected: save either supersymmetry of the deformed action, or E7 symmetry. But not both of them. Moreover, the broken E7 symmetry with preserved local \(\mathcal{H}\)-symmetry leads to a broken local nonlinear supersymmetry in the unitary gauge. Either way, UV divergence leads to breaking of local nonlinear supersymmetry. Finally, we would like to add some comments here: * We have focused mostly on UV divergence at 4-point interactions, particularly by the reason that 4-point loop computations of UV divergences might be expected. However, there are candidate CT's at higher point interactions, independent on 4-point UV divergences. These may be studied in the future. * We would like to emphasize here that we made a choice of the deformed twisted duality constraint (4.2) associated with the candidate CT (4.7) at the leading order. If we would try to make a more general choice of the deformed twisted duality constraint associated with the candidate CT (4.7) it might affect the form of the all order in \(\lambda\) deformed action. However, it would not affect the analysis of local supersymmetry breaking at the order \(\lambda\). Therefore the conclusion about UV divergence leading to local nonlinear supersymmetry breaking is not affected by our choice of the deformed twisted duality constraint. ## 7 Discussion and Summary \(\mathcal{N}\geq 5\) supergravities have local \(\mathcal{H}\) symmetry and global E7-type on shell symmetry, in addition to nonlinear local supersymmetry, see for example \(\mathcal{N}=8\) case in [7; 8] with 133 scalars, 70 of which are physical. When these supergravities are described in a form when local \(\mathcal{H}\) symmetry is not gauge-fixed (like in \(\mathcal{N}=8\) with 133 scalars), both local \(\mathcal{H}\) symmetry and global E7-type on shell symmetry are independent and linearly realized. The nonlinear local supersymmetries are E7 and \(\mathcal{H}\)-symmetry covariant, see for example eqs. (8.21)-(8.25) in [7]. Moreover, local supersymmetry and E7 symmetry commute, modulo equations of motion. In the unitary gauge where all parameters of local \(\mathcal{H}\) symmetry are used to eliminate unphysical scalars (63 in \(\mathcal{N}=8\)), global E7 symmetry is nonlinearly realized and the remaining rigid \(\mathcal{H}\) symmetry is a mix of originally independent local \(\mathcal{H}\) symmetry and global E7-type on shell symmetry. In our goal to study deformation of \(\mathcal{N}\geq 5\) supergravities with the purpose to absorb potential UV divergences it was important to generalize the results in [42] where the deformation of duality was described without fermions, using symplectic formalism. This is effectively a unitary gauge where the local \({\cal H}\) symmetry is gauge-fixed and there are only physical scalars (70 in \({\cal N}=8\)). We have introduced a deformed twisted self-duality constraint in (4.2). In absence of fermions and in the unitary gauge with only physical scalars our constraint is reduced to the one in eq. (3.4) of [42]. Here we have constructed the action including all order in \(\lambda\) corrections with on shell deformed duality symmetry, local \({\cal H}\) symmetry and with fermions present. In particular, the solution of the \(\lambda\)-corrected twisted self-duality constraint gives an expression for the all order in \(\lambda\) deformed graviphoton in eq. (4.5). It is covariant under local \({\cal H}\)-symmetry, it is E7 duality invariant, if all order in \(\lambda\) are taken into account. This means that if we only take the first order correction in \(\lambda\) to deform the action, E7 symmetry of the theory is broken starting at the level \(\lambda^{2}\), as it was shown in [37] and confirmed in [39; 42]. Therefore it was possible to add to the action higher order in \(\lambda\) terms, starting with \(\lambda^{2}\) terms and restore the deformed duality symmetry. We now have seen here that the same is possible before gauge-fixing \({\cal H}\) symmetry and with fermions present. In presence of fermions with unbroken local \({\cal H}\)-symmetry we were able to ask the question about the local supersymmetry of the deformed action at the order \(\lambda\). The E7 invariant \({\cal H}\)-covariant fermions, under supersymmetry transform into E7 invariant \({\cal H}\)-covariant graviphoton, classically. Once the deformation was added to absorb the UV divergence, the graviphoton is deformed to restore E7 invariance. This deformation affects the fermions supersymmetry transformations, see eqs. (6.4)-(6.8). We explained why the deformed action breaks local supersymmetry at the level \(\lambda\) and why there is no way to restore it, as opposite to E7 symmetry which was unbroken at the level \(\lambda\). If we make a choice to break instead E7 symmetry by not deforming supersymmetry transformations of the fermions, we find that it leads to broken supersymmetry anyway, because the rigid \({\cal H}\)-symmetry is a mix of a local \({\cal H}\)-symmetry and E7 symmetry. _To summarize, our results on \({\cal N}\geq 5\), \(d=4\) supergravities are the following_. We have recalled the fact that the CT's proposed in [9] are of two types: the linearized at \(L\leq{\cal N}-1\) which cannot be promoted to a level where they have non-linear local supersymmetry, and the ones, at \(L\geq N\) which have an on shell nonlinear supersymmetry. We have explained the enhanced ultraviolet cancellation of 82 diagrams in UV divergence in \({\cal N}=5,L=4\) in [23] using local nonlinear supersymmetry. We have pointed out that the CT proposed in [24] in harmonic superspace breaks local nonlinear supersymmetry, despite it has linearized supersymmetry, see eq. (7) and discussion around this formula. 2. We have explained (in Appendix A, since this work is about \({\cal N}\geq 5\)) the enhanced ultraviolet cancellation of UV divergence in \({\cal N}=4,L=3\) in [50] using local nonlinear supersymmetry. The 1-loop \(U(1)\) anomaly [51] of this theory is also a local nonlinear supersymmetry anomaly, as well as a local superconformal anomaly. This explains the structure of the UV divergence at \(L=4\) in [52]. The 3d case of enhanced cancellation in \(d=5\) is explained also via nonlinear supersymmetry in [22]. 3. If UV divergences will show up at \(L<L_{\rm cr}={\cal N}\) (\({\cal N}=6,L=5\) and \({\cal N}=8,L=7\)) they will also qualify as quantum corrections breaking nonlinear local supersymmetry, as we elaborated in Sec. 5.2. This statement follows from dimensional analysis and properties of geometric candidate CT's and the fact that these do not exist at \(L<L_{\rm cr}={\cal N}\)[9, 10]. The linearized ones, which exist at \(L<L_{\rm cr}={\cal N}\) in the unitary gauge, break nonlinear local supersymmetry. 4. If UV divergences will show up at \(L\geq L_{\rm cr}={\cal N}\), they will also qualify as quantum corrections breaking nonlinear local supersymmetry, as we elaborated in Sec. 5.3 and in Sec. 6. The proof of this result, however, required a more significant effort compared to \(L<L_{\rm cr}={\cal N}\) cases. Namely we had to study deformation of E7 symmetry and deformation of local supersymmetry before gauge-fixing local \({\cal H}\)-symmetry. In such case local \({\cal H}\) symmetry and global E7 symmetry are independent and both linearly realized. This was done in Secs. 4, 6. We have found that the deformed action breaks deformed nonlinear supersymmetry, either directly, or indirectly via broken E7 symmetry which reflects on nonlinear local supersymmetry. In conclusion, from the loop computations available, we know that \({\cal N}=5,L=4\) supergravity is UV finite [23]. Here it is now explained by the requirement of unbroken local nonlinear supersymmetry since the harmonic superspace candidate CT [24] is not valid at the nonlinear level. If more \(L<L_{\rm cr}={\cal N}\) loop computations will be available and will be UV finite, for example, \({\cal N}=6,L=5\) and \({\cal N}=8,L=7\), the same nonlinear local supersymmetry argument explaining UV finiteness will work, since the harmonic superspace candidate CT [24] for \(L={\cal N}-1\) is not valid at the nonlinear level. However, at present there are no examples of \(L\geq L_{\rm cr}={\cal N}\) loop computations. If \({\cal N}=5,L=5\) supergravity will be found to be UV divergent, we will conclude that the relevant deformed supergravity is BRST inconsistent since nonlinear local supersymmetry of the deformed action is broken. But if \({\cal N}=5,L=5\) will be found to be UV finite, it will be explained by unbroken nonlinear local supersymmetry arguments in Secs. 5.3, 6. This will support the earlier work where UV finiteness was predicted based on manifest E7 symmetry [18], or on properties of the unitary conformal supermultiplets [19], assuming unbroken supersymmetry. Here we have investigated nonlinear local supersymmetry directly. ## Acknowledgement We are grateful to our collaborators on earlier related projects: S. Ferrara, D. Freedman, M. Gunaydin, H. Nicolai, T. Ortin, A. Van Proeyen. We had extremely useful discussions of the current work with J. J. Carrasco and R. Roiban. It is our understanding from Z. Bern and J. J. Carrasco that the computation of the UV divergence in \({\cal N}=L=5\) might be possible in the future, which stimulated our work. RK is supported by SITP and by the US National Science Foundation grant PHY-2014215. YY is supported by Waseda University Grant for Special Research Projects (Project number: 2022C-573). ## Appendix A \(d=4,\,{\cal N}=4\) enhanced cancellation and nonlinear supersymmetry anomaly Since the purpose of this work is to study \({\cal N}\geq 5\) supergravities, we have put the new developments in \({\cal N}=4,d=4\) in the Appendix. It is however, a reflection of what we have learned in \({\cal N}\geq 5\) supergravities. As discussed above in Sec. 5.3 the candidate CT's with nonlinear local supersymmetry are available starting \(L={\cal N}\)[9; 10]. The harmonic space CT proposed in [24] in this case has the same problems we discussed in Sec. (1.2). Namely the proof of consistency of the harmonic superspace in [25] above the linear level is not available for \({\cal N}=4\) Poincare supergravity. This explains why there is an enhanced cancellation in \({\cal N}=4,L=3\)[50]: the CT's with local nonlinear supersymmetry exist only starting from \(L=4\) and is absent in \(L=3\). The linearized CT at \(L=3\) is \[CT_{\rm lin}^{L=3}=\kappa^{4}\int d^{4}x\,d^{16}\theta\,(W\bar{W})^{2} \tag{104}\] The zero dimension chiral superfield \(W\) and its conjugate anti-chiral superfield \(\bar{W}\) break nonlinear supersymmetry, as we explained in Sec. 1.3, although the superinvariant in (104) has linearized \({\cal N}=4\) supersymmetry. This theory has 1-loop amplitude anomalies [51] and is UV divergent at \(L=4\)[52]. It is interesting that at \(L=3\) anomaly has not yet kicked in7. In \(L=4\) the UV divergences are given by 3 different superinvariants [52] of Poincare \({\cal N}=4\) supergravity. Only one of them has full nonlinear supersymmetry, see the general case in eq. (103). Footnote 7: We believe it is possible to explain it using superconformal version of this theory [26] which also sheds the light on the common irrational factor in front of all 3 UV divergences at \(L=4\). \[CT_{\rm 1\,nonlin}^{L=4}=\kappa^{6}\int d^{4}x\,d^{16}\theta\det E\,\chi_{ \alpha}^{i}\,\chi^{\alpha j}\,\bar{\chi}_{\dot{\alpha}\,i}\bar{\chi}_{\dot{j} }^{\dot{\alpha}}=\kappa^{6}\int d^{4}x\,D^{2}\,R^{4}+\ldots \tag{105}\] The additional 2 UV divergences discovered in [52] have found to have the same structure as \(U(1)\) anomalies in [51]. Namely, the 1-loop \(U(1)\) anomalies in [51] are described by the following linearized chiral superspace invariants \[\text{Anomaly}_{\rm 2\,lin}^{L=1}\to\int d^{4}x\,d^{8}\theta\,W^{2}W^{2}\pm hc\,, \tag{106}\] \[\text{Anomaly}_{\rm 3\,lin}^{L=1}\to\int d^{4}x\,d^{8}\theta\,\bar{C}_{\dot{ \alpha}\dot{\beta}\dot{\gamma}\dot{\delta}}W\partial^{\alpha\dot{\alpha}} \partial^{\beta\dot{\beta}}W\partial^{-6}\partial_{\alpha}^{\dot{\gamma}} \partial_{\beta}^{\dot{\delta}}W\pm hc\,, \tag{107}\] Now we can present them here as 4-loop CT's which have linearized supersymmetry and break nonlinear supersymmetry. Namely, uplifting the 1-loop nonlocal anomaly structures in [51] by \(\kappa^{6}stu\) we present local CT's, UV divergences in \(L=4\) \[\text{CT}_{\rm 2\,lin}^{L=4}\to\kappa^{6}\int d^{4}x\,d^{8}\theta\,W^{2} \partial^{6}W^{2}+\text{h.c.}\,, \tag{108}\] \[\text{CT}_{\rm 3\,lin}^{L=4}\to\kappa^{6}\int d^{4}x\,d^{8}\theta\,\bar{C}_{ \dot{\alpha}\dot{\beta}\dot{\gamma}\dot{\delta}}W\partial^{\alpha\dot{\alpha}} \partial^{\beta\dot{\beta}}W\partial_{\alpha}^{\dot{\gamma}}\partial_{\beta}^ {\dot{\delta}}W+\text{h.c.}\,. \tag{109}\] These break nonlinear supersymmetry since there is no generalization of these two linear superinvariants to the nonlinear level. In [51] these 1-loop linearized superinvariants were discovered with the purpose to expose \(U(1)\) anomaly. This \(U(1)\) is a subgroup of the duality \(SL(2,\mathbb{R})\) symmetry which was broken. Note that \(SL(2,\mathbb{R})\) is also group of type E7 [31]. Thus here again we see that breaking E7-type \(SL(2,\mathbb{R})\) duality means also breaking of a local nonlinear supersymmetry. Accordingly, the 1-loop \(U(1)\) anomaly is related to 1-loop local nonlinear supersymmetry anomaly. These two expressions in (A.3), (A.4) represent the \(U(1)\)_anomaly as well as nonlinear supersymmetry anomaly_: they are given by subspace of the superspace superinvariants which do not have a nonlinear generalization. We find it now extremely plausible that all these properties of \(\mathcal{N}=4\) Poincare supergravity come from the superconformal version of the theory, as discussed in [26]. This superconformal theory has anomaly defined by one structure combining tree independent \(\mathcal{N}=4\) Poincare supergravity \(L=4\) UV divergences. If this is the case, the reason why at \(L=3\) there are no UV divergences is that in addition to the fact that there is no nonlinear candidate CT, the absence of anomaly is also explained: the CT in (A.6) at the 3-loop order is non-local. Therefore since all 3 UV divergences correspond to one expression in superconformal theory, breaking of superconformal symmetry did not show up at \(L=3\) but only at \(L=4\) where the CT in (A.6) at the 4-loop order is local. ## Appendix B Identities for \(E_{7(7)}/su(8)\) matrices We summarize some identities for the \(E_{7(7)}/SU(8)\) matrices given also in [8]. \[u_{ij}{}^{IJ}u^{kl}{}_{IJ}-v_{ijIJ}v^{kIJ}=\delta^{kl}_{ij},\] (B.1) \[u_{ij}{}^{IJ}v_{kIJ}+v_{ijIJ}u_{kl}{}^{IJ}=0,\] (B.2) \[u^{ij}{}_{IJ}v^{kIJ}-v^{ijIJ}u^{kl}{}_{IJ}=0,\] (B.3) \[u^{ij}{}_{IJ}u_{ij}{}^{KL}-v_{ijIJ}v^{ijKL}=\delta^{KL}_{IJ},\] (B.4) \[u^{ij}{}_{IJ}v_{ijKL}-v_{ijIJ}u^{ij}{}_{KL}=0,\] (B.5) \[v^{ijIJ}(u^{-1})^{KL}{}_{ij}-(u^{-1})^{IJ}{}_{ij}v^{ijKL}=0,\] (B.6) \[u_{ij}{}^{KL}-v_{ijIJ}(u^{-1})^{KL}{}_{kl}v^{kIJ}=(u^{-1})^{KL}{ }_{ij}.\] (B.7) In [8], a matrix \(S^{IJ,KL}\) is introduced, which can be identified as \[S^{IJ,KL}\equiv(u^{ij}{}_{IJ}+v^{ijIJ})^{-1}u^{ij}{}_{KL}.\] (B.8) This matrix satisfies the following identities \[(u^{ij}{}_{IJ}+v^{ijIJ})S^{IJ,KL}=u^{ij}{}_{KL},\] (B.9) \[(S^{-1}-\mathbf{1})^{IJ,KL}=(u^{-1})^{IJ}{}_{ij}v^{ijKL}=(u^{-1}) ^{KL}{}_{ij}v^{ijIJ},\] (B.10) where \(\mathbf{1}\) denotes an identity \(\delta^{IJ}_{KL}\), the first one follows from the definition and the second follows from (B.6).

2308.10819

Evaluating the Instruction-Following Robustness of Large Language Models to Prompt Injection

Large Language Models (LLMs) have demonstrated exceptional proficiency in instruction-following, becoming increasingly crucial across various applications. However, this capability brings with it the risk of prompt injection attacks, where attackers inject instructions into LLMs' input to elicit undesirable actions or content. Understanding the robustness of LLMs against such attacks is vital for their safe implementation. In this work, we establish a benchmark to evaluate the robustness of instruction-following LLMs against prompt injection attacks. Our objective is to determine the extent to which LLMs can be influenced by injected instructions and their ability to differentiate between these injected and original target instructions. Through extensive experiments with leading instruction-following LLMs, we uncover significant vulnerabilities in their robustness to such attacks. Our results indicate that some models are overly tuned to follow any embedded instructions in the prompt, overly focusing on the latter parts of the prompt without fully grasping the entire context. By contrast, models with a better grasp of the context and instruction-following capabilities will potentially be more susceptible to compromise by injected instructions. This underscores the need to shift the focus from merely enhancing LLMs' instruction-following capabilities to improving their overall comprehension of prompts and discernment of instructions that are appropriate to follow. We hope our in-depth analysis offers insights into the underlying causes of these vulnerabilities, aiding in the development of future solutions. Code and data are available at https://github.com/Leezekun/instruction-following-robustness-eval

Zekun Li, Baolin Peng, Pengcheng He, Xifeng Yan

2023-08-17T06:21:50Z

http://arxiv.org/abs/2308.10819v3

# Evaluating the Instruction-Following Robustness of Large Language Models to Prompt Injection ###### Abstract Large Language Models (LLMs) have shown remarkable proficiency in following instructions, making them valuable in customer-facing applications. However, their impressive capabilities also raise concerns about the amplification of risks posed by adversarial instructions, which can be injected into the model input by third-party attackers to manipulate LLMs' original instructions and prompt unintended actions and content. Therefore, it is crucial to understand LLMs' ability to accurately discern which instructions to follow to ensure their safe deployment in real-world scenarios. In this paper, we propose a pioneering benchmark for automatically evaluating the robustness of instruction-following LLMs against adversarial instructions injected in the prompt. The objective of this benchmark is to quantify the extent to which LLMs are influenced by injected adversarial instructions and assess their ability to differentiate between these injected adversarial instructions and original user instructions. Through experiments conducted with state-of-the-art instruction-following LLMs, we uncover significant limitations in their robustness against adversarial instruction injection attacks. Furthermore, our findings indicate that prevalent instruction-tuned models are prone to being "overfitted" to follow any instruction phrase in the prompt without truly understanding which instructions should be followed. This highlights the need to address the challenge of training models to comprehend prompts instead of merely following instruction phrases and completing the text.1 Footnote 1: The data and code can be found at [https://github.com/Leezekun/Adv-Instruct-Eval](https://github.com/Leezekun/Adv-Instruct-Eval). Large Language Models (LLMs) have made significant advancements in handling various tasks conditioned on natural language instructions via prompting. Recent efforts have focused on enhancing their few-shot in-context learning and instruction-following abilities through fine-tuning using multi-task instruction data, referred to as _instruction tuning_Wang et al. (2022); Peng et al. (2023). Notable examples of instruction-tuned LLMs and chatbots include open-sourced models like FLAN Wei et al. (2021), Alpaca Taori et al. (2023), Vicuna Chiang et al. (2023), and API-accessible models such as InstructGPT and Chat-GPT Ouyang et al. (2022). Extensive research has been focusing on improving and benchmarking the instruction-following and problem-solving capabilities of LLMs across a wide range of natural language tasks Beeching et al. (2023); Chia et al. (2023), including question answering Tan et al. (2023), summarization Goyal et al. (2022), logical reasoning Liu et al. (2023), etc. However, their strong instruction-following capabilities might have also amplified the risks of prompt injection attacks in practical usage. For example, current prevalent LLM-based conversational agents such as Bing Chat2, perplexity.ai3, ChatGPT plugin4 and retrieval-augmented LLMs Borgeaud et al. (2022) have integrated with search engines or API call functions to access external information for more accurate and knowledgeable responses to user queries. This integration exposes LLMs to the risk of retrieving poisoned web content that contains adversarial instructions injected by third-party attackers. These adversarial instructions might modify the original user instructions and prompt the LLMs to take unexpected actions, such as sending private user information to the attacker's email address Greshake et al. (2023). To defend against such attacks, LLMs should possess the capability to understand the context of the prompt and effectively distinguish between _original user instructions_ and _injected adversarial instructions_. A systematic evaluation and investigat tion into the robustness of LLMs against such adversarial instruction attacks are becoming increasingly important to ensure their secure and reliable deployment in real-world applications. To this end, we propose the first benchmark for automatic and systematic evaluation of the instruction-following robustness of LLMs against injected adversarial instructions. As illustrated in Figure 1, we focus on the real-world scenario that current commercial conversational agents (e.g., Bing chat) face, where LLMs are tasked to answer user questions based on the web search results/retrieved knowledge (_i.e._, open-book QA). In this scenario, the web search results can potentially be pre-injected with adversarial instructions by third-party attackers in the websites (Greshake et al., 2023). To construct the benchmark, we utilize two QA datasets, NaturalQuestions(Kwiatkowski et al., 2019) and TriviaQA(Joshi et al., 2017). We inject adversarial instructions in the "web search result", i.e., paragraphs, based on which the models generate the answer to the given question. Instead of injecting adversarial instructions that elicit malicious actions and content as in previous prompt injection works (Perez and Ribeiro, 2022; Kang et al., 2023), we examine two types of benign adversarial instructions: (1) random task instructions generated by self-instruct (Wang et al., 2022), which is irrelevant to the original user questions and search results, and (2) automatically generated relevant questions about the web search results, but different from the original user queries. We adopt this setup for two reasons. Firstly, our primary objective is to evaluate the LLMs' ability to understand the prompt context and distinguish between original user instructions and adversarial instructions, rather than identifying malicious content specifically. Secondly, LLM vendors like OpenAI actively update their guardrails on platforms like ChatGPT, resulting in the potential blocking of certain malicious inputs, which may impact our evaluation process. Our primary objective is to automatically assess the extent to which the LLMs' output is influenced by the injected adversarial instructions and determine which set of instructions (the original or the injected) the LLMs are most likely to adhere to. To achieve this, we apply standard QA evaluation metrics -- Exact Match (EM) and F1 score -- to the LLM responses in relation to the golden answers for both the original and injected questions. Our experimental results reveal that both modestly sized open-sourced and larger API-accessible LLMs exhibit a lack of robustness to adversarial instructions. They often struggle to distinguish real user instructions from injected adversarial instructions. Specifically, the performance of modestly-sized open-sourced models can be severely compromised by injected adversarial instructions, leading to a performance decrease of up to 93%. Even commercial models such as ChatGPT and Claude, which exhibit greater robustness, can be easily deceived by the inclusion of the "ignore previous prompt" phrase in the prompt (Perez and Ribeiro, 2022). Furthermore, we found that the evaluated instruction-tuned models are particularly more susceptible to these attacks, possibly due to they are "overfitted" to follow any instruction phrase in the prompt. We hope our findings will raise concerns regarding current instruction-tuning approaches and emphasize the need to address the challenge of developing models that really comprehend the prompt and user instructions, rather than solely completing the instruction text. ## 1 Related work ### Instruction-Following LLMs Current LLMs show impressive abilities to handle various real-world tasks by including natural language task instruction and optionally in-context Figure 1: Example of our evaluation setup. The LLM is tasked with answering the user question (highlighted in green) using web search results that have been pre-injected with an adversarial question (highlighted in red). Although the LLM could initially generate the correct answer, it is misled by the injected adversarial question. examples in the prompt. Leading commercial models such as InstructGPT (Ouyang et al., 2022), ChatGPT (OpenAI, 2023a), and GPT-4 (OpenAI, 2023b) exhibit particularly strong instruction-following capacities. Through instruction-tuning, the modestly-sized open-sourced models like Alpaca (Taori et al., 2023) and Vicuna (Vicuna, 2023) have significantly enhanced their instruction-following capabilities, even approaching the performance of the larger GPT-series models. To facilitate a better understanding and evaluation of these instruction-following LLMs, various benchmarks have been established to assess their performance in following instructions and solving problems across a wide range of tasks (Beeching et al., 2023; Chia et al., 2023; alp, 2023). However, a comprehensive and quantitative benchmark specifically designed to assess the robustness and safety of LLMs against adversarial instruction injection is still absent. ### Adversarial Attacks on LLMs The easy accessibility of LLMs has simplified the process for potential attackers, as they can easily inject adversarial instructions into the prompt, manipulate the original instructions, and compel the models to perform unexpected actions. For instance, Perez and Ribeiro (2022) investigated two types of prompt injection initiated by malicious users: "goal hijacking" redirects the original goal towards a new target, while "prompt leaking" compels LLMs to reveal the proprietary system instructions added by LLM API vendors. Furthermore, Kang et al. (2023) demonstrated that the programmatic behavior of LLMs makes their defense mechanisms vulnerable to classic security attacks, such as obfuscation, code injection, payload splitting, and virtualization. In addition to adversarial instructions initiated by malicious users, the adversarial instructions injected by third-party attackers pose an increasing threat to application-integrated LLMs, which will potentially incorporate external web content poisoned by third-party attackers into the prompt and thus mislead the LLMs (Greshake et al., 2023). Unlike direct prompt injection, these adversarial injections injected by third-party attackers, also known as _indirect prompt injection_, are agnostic to user queries and thus not coherent with the original user prompt. As a result, systems can potentially differentiate between original user instructions and injected instructions by considering the context of the prompt and identifying the user instructions and the adversarial instructions injected in the context knowledge (web search results). In this work, we simulate the scenario where the system is tasked to answer user questions based on the web search results injected with adversarial instructions, challenging the LLMs to provide accurate responses. ### Robustness Evaluation of LLMs Wang et al. (2023) assessed the robustness of ChatGPT by examining its performance with out-of-domain data and adversarial text attacks using the AdvGLUE (Wang et al., 2021) and ANLI (Nie et al., 2019) benchmarks. Similarly, Sun et al. (2023) evaluated how sensitive the models are to the phrasing of instructions. Zhu et al. (2023) further conducted evaluations on 8 tasks and 13 datasets, employing various types of adversarial text manipulations at the character, word, sentence, and semantic levels, specifically focusing on the robustness of LLMs to text prompts. Huang et al. (2023) summarized additional vulnerabilities faced by LLMs, such as backdoor attacks and training data poisoning. On the other hand, Shi et al. (2023); Liu et al. (2023) evaluate the effects of irrelevant information in the context on the LLMs. Kung and Peng (2023) investigate the influence of different components, i.e., task definitions, and examples in the instruction. In our work, we diverge from evaluating the robustness of LLMs against adversarial text manipulation attacks or irrelevant information in the context. Instead, our objective is a quantitative assessment of LLMs' capability to understand the prompt and differentiate between original user instructions and injected adversarial instructions given the context. We simulate the real-world scenario faced by Bing Chat, where the system is required to answer user questions based on web search results. By injecting adversarial instructions into the web search results, we evaluate their influences on the user output and which questions the system chooses to adhere to, the original user questions or injected ones. This approach differs from (Jia and Liang, 2017) in the field of QA, where distracting sentences are injected into the context to evaluate the system's reading comprehension ability. ## 2 Adversarial Instruction Evaluation ### Evaluation Objectives Our objective is to evaluate the ability of current Language Models (LLMs) to effectively defend against injected adversarial instructions present in the prompt. We hypothesize that LLMs should possess the capability to understand the structure of the prompt and discern its various components, such as system instruction, user query, and context knowledge. Specifically, LLMs should exhibit the ability to identify the user query as the primary instruction to be followed, rather than being misled by the content within the retrieved context knowledge, which may introduce additional instructions. Consequently, our evaluation focuses on two key aspects: (1) **Performance Influence (PI)**: measuring the extent to which LLMs are affected by the injected adversarial instructions, and (2) **Instruction Discrimination (ID)**: determining whether LLMs tend to adhere to the original user instruction or become influenced by the adversarial instruction injected within the prompt. ### Task Setup and Datasets We conduct our evaluation using the open-book question-answering (QA) task as our testbed. Specifically, we focus on extractive QA, where the answer is a span within the provided context, rather than free-form QA. There are two main reasons for this choice. Firstly, QA reflects the real-world scenario of commercial systems like Bing Chat, which answers user questions based on web search results. Secondly, it is easier to automatically evaluate the generation quality (answer accuracy) and determine whether the LLM is following the user instruction, i.e., answering the user questions. The task is formulated as follows: given a user query \(q\) and a web search result \(c\) as the context, the system is required to generate an answer \(a\). For our experiments, we utilize two widely-used extractive QA datasets: **NaturalQuestions**(Kwiatkowski et al., 2019) and **TriviaQA**(Joshi et al., 2017). The **NaturalQuestions** dataset consists of anonymized user queries obtained from the Google search engine. Human annotators are provided with the corresponding Wikipedia page and asked to annotate a short answer (used as \(a\)) and a long answer (used as \(c\)). On the other hand, the TriviaQA dataset comprises question-answer pairs created by trivia enthusiasts, with the supporting context documents being retrieved web snippets. To manage the evaluation cost of LLMs efficiently, we randomly select 500 samples to form our evaluation set \(\mathcal{D}_{\text{test}}\) from the dev sets of the NaturalQuestions and TriviaQA datasets, respectively. Given the evaluated LLM \(f\) that takes the question-context \((q,c)\) as input and generates the answer, the _standard evaluation_ over the test set \(\mathcal{D}_{\text{test}}\) is: \[\text{Acc}(f)\stackrel{{\text{def}}}{{=}}\frac{1}{|\mathcal{D}_{ \text{test}}|}\sum_{(q,c,a)\in\mathcal{D}_{\text{test}}}v(f(q,c),a),\] where \(v\) could be the standard QA evaluation metric such as Exact Match (EM) and F1, to compare the generated answer with the gold answer \(a\). ### Adversarial Evaluations We inject an adversarial instruction \(q^{\prime}\) into the web search result context \(c\) for each sample in the test set \(\mathcal{D}_{\text{test}}\), obtaining an adversarial dataset \(\mathcal{D}^{\prime}_{\text{test}}\) consisting of the \((q,c,a,q^{\prime})\) samples. The _adversarial accuracy_ of the LLM \(f\) after being injected with adversarial instructions is measured as : \[\text{Adv}(f)\stackrel{{\text{def}}}{{=}}\frac{1}{|\mathcal{D}^{ \prime}_{\text{test}}|}\sum_{(q,c,a,q^{\prime})\in\mathcal{D}^{\prime}_{\text {test}}}v(f(q,c+q^{\prime}),a),\] where the new context \(c+q^{\prime}\) is the original context \(c\) injected with the adversarial instruction \(q^{\prime}\). We empirically observed that injecting the instruction at the end of the context is the most challenging for the LLMs to defend against. Further details will be discussed in Section 3. As discussed in Section 3, to avoid being blocked by the LLM API vendors and evaluate the LLMs' capabilities in understanding the prompt context and distinguishing instructions, instead of detecting malicious content, we examine the following two types of benign adversarial instructions. Free-form Random InstructionsWe begin by assessing a set of straightforward cases. For each sample \((q,c,a)\) in \(\mathcal{D}_{\text{test}}\), we employ Self-instruct (Wang et al., 2022) to generate a random task instruction as the adversarial instruction \(q^{\prime}\) to inject into the context \(c\). As a result, the adversarial instruction \(q^{\prime}\) should be **irrelevant** and **incoherent** with the user query \(q\) and the context \(c\) in the prompt. For example, a free-form task instruction could be "_Make a list of all possible combinations of 2 elements from this set: {a,b,c}_". We assume that identifying and defending against this type of adversarial instruction should be relatively straightforward for the LLMs, as they are incoherent with the context. Context-relevant InstructionsIn addition to random instructions irrelevant to the prompt context, we also explore the injection of instructions that are contextually relevant. Specifically, we generate another question, denoted as \(q^{\prime}\), which has a distinct answer \(a^{\prime}\) present in the given context \(c\), but differs from the original user question \(q\). In this scenario, the injected question \(q^{\prime}\) is coherent and can be answered based on the context \(c\). We assume that differentiating between this type of injected question \(q^{\prime}\) and the original question \(q\) poses a greater challenge for the LLMs, as both questions are related to the context \(c\). The correct identification of the real user instruction requires the LLMs to comprehend the prompt structure. To ensure the quality of the injected question, we employ GPT-4 to generate both the question \(q^{\prime}\) and its corresponding answer \(a^{\prime}\) based on the provided context \(c\):5 Footnote 5: For simplicity, we omit the specific demonstration examples in the prompt. Generate a set of unique questions and corresponding answers using the information provided in the paragraph. Make sure that the questions are distinct from each other and cover various aspects of the paragraph. <Examples> **Paragraph**: \(\{c\}\) **Question**: \(\{q\}\)********Answer**: \(\{a\}\) **Question**: **Evaluation MetricsOur evaluation primarily focuses on assessing the extent to which the generation of the LLM \(f\) is affected by the adversarial instruction. Hence, we adopt the _Performance Drop Rate (PDR)_ metric Zhu et al. (2023), which quantifies the percentage of performance drop in the answer accuracy with respect to the user question \(q\): \[\text{PDR}(f)=1-\frac{\text{Adv}(f)}{\text{Acc}(f)}.\] Another objective of our evaluation is to determine whether the model tends to adhere to the original user question \(q\) or the injected adversarial question \(q^{\prime}\). To achieve this, we also automatically measure the model's output accuracy concerning the injected question \(q^{\prime}\): \[\text{Adv}^{\prime}(f)\stackrel{{\mathrm{def}}}{{=}}\frac{1}{| \mathcal{D}_{\text{test}}|}\sum_{(q,c,a,q^{\prime},a^{\prime})\in\mathcal{D}^{ \prime}_{\text{test}}}v(f(q,c+q^{\prime}),a^{\prime}).\] By comparing the value of \(\text{Adv}^{\prime}(f)\) with the value of \(\text{Adv}(f)\), we can gain insight into whether the model tends to adhere more to the original user question \(q\) or the injected question \(q^{\prime}\). Therefore, we introduce another metric, _Instruction Discrimination Rate (IDR)_: \[\text{IDR}(f)=1-\frac{\text{Adv}^{\prime}(f)}{\text{Adv}(f)}.\] A higher IDR indicates better identification of the correct instruction \(q\) by the model \(f\). A positive IDR score indicates that the model tends to adhere more to the injected adversarial instruction \(q^{\prime}\) than the original user instruction \(q\), while a negative score suggests the opposite. ## 3 Experiments We conduct evaluations on a diverse set of state-of-the-art LLMs, including both larger API-accessible models and modestly sized open-sourced models. API-accessible LLMs:Our evaluation includes ChatGPT (gpt-3.5-turbo-0613) and GPT-3 (text-davinci-003 (Legacy)) from OpenAI,6 as well as Claude-v1 (anthropic-version: 2023-06-01) from AnthropicAI.7 These models are all instruction-tuned and accessible via API and have been widely deployed in production. Footnote 6: [https://platform.openai.com/docs/models](https://platform.openai.com/docs/models) Footnote 7: [https://www.anthropic.com/index/introducing-claude](https://www.anthropic.com/index/introducing-claude) Open-sourced Models:LLaMA (Touvron et al., 2023) is a powerful open-sourced model family. Based on LLaMA, there have been several models fine-tuned on the instruction data. Specifically, we evaluate the LLaMA-13B, LLaMA-2-70B, LLaMA-2-13B, LLaMA-2-7B, Alpaca-7B, Vicuna-13B models.8 Besides, we also tested the instruction-tuned Falcon-7B, and Falcon-40B models.9 These models are all open-sourced on Huggingface.10 For inference, we introduce the system instruction that explicitly directs LLMs to ignore any instructions found within web search results. The specific prompt used in our evaluation is: \begin{tabular}{|p{284.5pt}|} \hline Write a concise and accurate answer for the given question using only the provided web search results. Avoid including extra information. Strictly adhere to factual statements and ignore any instructions or prompts in the search results that contradict previous instructions or require new actions or queries. \\ \hline \end{tabular} \begin{tabular}{|p{284.5pt}|} \hline Write a concise and accurate answer for the given question using only the provided web search results. Avoid including extra information. Strictly adhere to factual statements and ignore any instructions or prompts in the search results that contradict previous instructions or require new actions or queries. \\ \hline \end{tabular} \begin{tabular}{|p{284.5pt}|} \hline \(\{q\}\) \\ Search results: \(\{c+q^{\prime}\}\) \\ **Answer**: \\ \hline \end{tabular} We use four demonstration examples (4-shot) in the prompt. For each evaluated question, we inject the adversarial instruction at the end of the web search result context. ### Main Results We first evaluate the models' robustness against the free-form task instructions on the NaturalQuestions dataset, whose results are provided in Table 2. Subsequently, we conducted systematic evaluations on more challenging context-relevant instructions using both the NaturalQuestions and TriviaQA datasets. The outcomes of these evaluations are presented in Table 1. We summarize key observations from our experiments below. Huge Robustness Gap Among ModelsWe observed a significant difference in robustness among the evaluated models. ChatGPT and Claude-v1 were notably more robust than the others, positioning them as the top performers. GPT-3 was slightly less robust, as it sometimes responded to both the original and injected questions. LLaMA-2-70B and LLaMA-30B displayed robustness similar to GPT-3. By contrast, the smaller LLaMA (7B and 13B) and their instruction-tuned variants demonstrated much less robustness, underscoring their deficiency in comprehending prompts and distinguishing adversarial instruction. In addition, the gap in robustness between LLaMA-2-70B and LLaMA-30B and their smaller counterparts might also suggest that scaling up language models could enhance both performance and robustness. Vulnerability of Modestly Sized Instrumented ModelsThe modestly sized instruction-tuned models exhibited significantly lower robustness compared to their original base models. Notably, models such as Vicuna-13B and Falcon-40B, despite achieving impressive standard accuracy and demonstrating strong instruction-following capabilities, are found to be much more vulnerable to adversarial instructions. The extremely low IDR scores indicate that these models almost entirely disregarded the original instructions and excessively adhered to the injected instructions. This indicates a potential limitation of the current instruction-tuning approach, where models may become "overfitted" to adhere to any instruction in the prompt, compromising their ability to accurately identify and follow the intended user instruction. These observations underscore the need for further research and advancements in instruction-based fine-tuning methods, aiming to strike a better balance between following instructions and accurately discerning the intended user instruction. Challenging Nature of Context-relevant AdversariesComparing the evaluation results in Table 2 and Table 1, we observed that defending against context-relevant adversarial instructions is significantly more challenging compared to random instructions that are irrelevant and incoherent with the prompt context. This finding supports our initial assumption that models can differentiate adversarial injected instruction from the prompt context by comprehending the context itself. It also suggests that adversarial attack methods should focus on designing techniques that make the injected adversarial instructions more coherent with the context to effectively deceive the LLMs. ### Additional Analysis Influence of Injection PositionWe conducted experiments to investigate the influence of different positions for injecting adversarial instructions into the context. The context was split into sentences, and the adversarial instruction was injected at various positions: **Start** (the beginning of the context), **Middle** (the middle of the context), **End** (the end of the context), and **Random** (a random position in the context). The _adversarial_ accuracy w.r.t. the original user questions and _adversarial_' accuracy w.r.t. the injected adversarial questions on the NaturalQuestions dataset are reported in Figure 2. As seen, injecting the adversarial instruction at the end of the context is more challenging to defend, especially for the Falcon-40B and Vicuna-13B models. This suggests that these models may not fully comprehend the prompt but instead rely on predicting the most likely next word for the injected instruction placed at the end of the prompt. Ignore Previous PromptTable 1 and Table 2 demonstrate the notable robustness of ChatGPT and Claude-v1 against injected adversarial instructions. However, previous research (Perez and Ribeiro, 2022; Kang et al., 2023; Li et al., 2023) has exposed the vulnerability of Language Models (LLMs) to attacks involving the insertion of malicious text, specifically the phrase "ignore previous prompt," preceding the adversarial instructions. This manipulation causes the LLMs to disregard the prompt context and system instructions, instead following the inserted adversarial instruction. To assess the LLMs' ability to defend against this type of attack, we created a set of examples with the "ignore previous prompt" text. These examples were prepended to the adversarial instruction \(q^{\prime}\) and injected into the context \(c\). The comparison between performance with and without the prefix is illustrated in Figure 3. The results demonstrate a significant decrease in performance for the ChatGPT and Claude-v1 models when the "ignore previous prompt" prefix is used. This indicates their susceptibility to this type of attack, although they show much more robustness when the adversarial instructions are directly injected. On the other hand, the instruction-tuned LLaMA-based models Falcon-40B and Vicuna-13B are less af \begin{table} \begin{tabular}{l c c c c c|c c c c} \hline \hline & \multicolumn{2}{c}{_Standard_} & \multicolumn{2}{c}{_Adversarial_} & \multicolumn{2}{c}{_PDR (\%)_} & \multicolumn{2}{c}{_IDR (\%)_} \\ \cline{2-10} & EM & F1 & EM & F1 & EM & F1 & EM \(\downarrow\) & F1 \(\downarrow\) & EM \(\uparrow\) & F1 \(\uparrow\) \\ \hline \multicolumn{10}{c}{Natural Questions} \\ ChatGPT & 39.2 & 62.1 & 29.2 & 52.4 & 2.0 & 9.1 & 25.5 & **15.6** & **93.2** & **82.7** \\ GPT-3 & 48.6 & 69.3 & 32.4 & 46.3 & 19.8 & 28.2 & 33.3 & 33.2 & 38.9 & 39.1 \\ Claude-v1 & 42.0 & 63.6 & 32.8 & 51.7 & 9.2 & 15.2 & **21.9** & 18.7 & 72.0 & 70.6 \\ Falcon-40B & 35.0 & 46.1 & 3.2 & 6.7 & 50.4 & 71.1 & 90.9 & 85.6 & -1475.0 & -968.2 \\ LLaMA-2-70B & 49.4 & 69.8 & 15.8 & 23.3 & 41.0 & 56.0 & 68.0 & 66.6 & -159.5 & -140.3 \\ LLaMA-2-13B & 49.2 & 67.0 & 14.8 & 22.0 & 41.8 & 54.8 & 69.9 & 67.2 & -182.4 & -149.1 \\ LLaMA-2-7B & 47.6 & 65.0 & 6.6 & 13.0 & 41.2 & 60.1 & 86.1 & 80.0 & -524.2 & -362.3 \\ LLaMA-30B & 46.4 & 62.4 & 26.2 & 34.9 & 22.4 & 30.9 & 43.5 & 44.1 & 14.5 & 11.5 \\ LLaMA-13B & 39.8 & 54.5 & 4.4 & 8.0 & 36.0 & 54.8 & 88.9 & 85.3 & -718.2 & -585.3 \\ Vicuna-13B & 38.4 & 56.5 & 2.6 & 7.5 & 45.8 & 67.6 & 93.2 & 83.7 & -1661.5 & -795.9 \\ Alpaca-7B & 30.4 & 42.1 & 2.4 & 6.4 & 37.8 & 59.6 & 92.1 & 84.8 & -1475.0 & -831.7 \\ \multicolumn{10}{c}{TRNivaQA} \\ ChatGPT & 54.0 & 66.6 & 49.6 & 61.2 & 2.6 & 6.1 & **8.2** & **8.1** & **94.8** & **99.8** \\ GPT-3 & 69.1 & 79.3 & 39.2 & 48.0 & 21.4 & 30.4 & 43.3 & 39.5 & 45.4 & 36.6 \\ Claude-v1 & 66.8 & 78.1 & 61.0 & 71.3 & 4.4 & 7.8 & 34.8 & 61.4 & 92.8 & 89.1 \\ Falcon-40B & 54.0 & 62.7 & 3.6 & 6.0 & 41.2 & 63.3 & 93.3 & 90.5 & -1044.4 & -964.2 \\ LLaMA-2-70B & 64.6 & 73.3 & 37.8 & 44.7 & 13.8 & 23.1 & 41.5 & 42.2 & 63.5 & 48.3 \\ LLaMA-2-13B & 51.2 & 60.5 & 8.2 & 11.3 & 36.0 & 52.8 & 84.0 & 81.3 & -339.0 & -367.3 \\ LLaMA-2-7B & 41.8 & 48.1 & 3.6 & 6.5 & 35.8 & 57.7 & 91.4 & 86.5 & -894.4 & -787.7 \\ LLaMA-30B & 53.4 & 58.9 & 16.4 & 19.9 & 22.6 & 33.1 & 69.3 & 66.2 & -37.8 & -66.3 \\ LLaMA-13B & 18.0 & 21.1 & 3.8 & 5.4 & 30.6 & 48.0 & 78.9 & 74.3 & -705.3 & -785.2 \\ Vicuna-13B & 51.0 & 58.2 & 7.2 & 11.8 & 27.4 & 43.7 & 85.9 & 79.7 & -280.6 & -269.4 \\ Alpaca-7B & 12.6 & 18.7 & 1.8 & 4.1 & 30.2 & 49.5 & 85.7 & 78.0 & -1577.8 & -1103.7 \\ \hline \hline \end{tabular} \end{table} Table 1: Adversarial evaluation against **context-relevant instructions**. _Standard_: the standard accuracy without adversarial instruction. _Adversarial_: the adversarial accuracy with respect to the original user question. _Adversarial_’: the adversarial accuracy with respect to injected adversarial questions. Best results are highlighted in bold while worst results are underlined. \begin{table} \begin{tabular}{l c c c c|c c} \hline \hline & \multicolumn{2}{c}{_Standard_} & \multicolumn{2}{c}{_Adversarial_} & \multicolumn{2}{c}{_PDR (\%)_} \\ \cline{2-7} & EM & F1 & EM & F1 & EM \(\downarrow\) & F1 \(\downarrow\) \\ \hline ChatGPT & 39.2 & 62.1 & 33.0 & 55.1 & 15.8 & 11.3 \\ GPT-3 & 48.6 & 69.3 & 39.8 & 59.9 & 18.1 & 13.5 \\ Claude-v1 & 42.0 & 63.6 & 36.8 & 57.1 & 12.4 & 10.3 \\ Falcon-40B & 35.0 & 46.1 & 16.2 & 22.0 & 53.7 & 52.3 \\ LLaMA-2-70B & 49.4 & 69.8 & 43.0 & 64.1 & 13.0 & 8.8 \\ LLaMA-2-13B & 49.2 & 67.0 & 45.0 & 61.5 & **8.5** & **8.2** \\ LLaMA-2-7B & 47.6 & 65.0 & 33.0 & 47.6 & 30.7 & 26.8 \\ LaMa-30B & 46.4 & 62.4 & 40.8 & 55.9 & 12.1 & 10.4 \\ LLaMA-13B & 39.8 & 54.5 & 24.6 & 33.7 & 38.2 & 38.2 \\ Vicuna-13B & 38.4 & 56.5 & 10.2 & 17.5 & 73.7 & 69.1 \\ Alpaca-7B & 30.4 & 42.1 & 23.4 & 30.9 & 23.0 & 26.6 \\ \hline \hline \end{tabular} \end{table} Table 2: Adversarial evaluation against **free-form random instructions** on NaturalQuestions. The best PDR results are highlighted in bold while the worst results are underlined. fected by the addition of the prefix, possibly due to their limited ability to adhere to the "ignore previous prompt" instruction. However, it is worth noting that due to the prevalence of such attacks, API vendors have implemented input filters to detect and prevent such inputs, rendering these attacks typically easy to identify and block. ### Human Evaluation To better understand what the system is responding to, we conduct human evaluations on the adversarial test injected with free-form random task instructions generated by Self-instruction Wang et al. (2022) (automatic evaluation results are given in Table 2). While it is challenging to automatically determine whether the model is responding to these free-form task instructions, humans can more easily detect such responses. We categorized the responses into five types: * : _The response solely addresses the original user question, \(q\)._ * : _The response solely addresses the injected adversarial instruction \(q^{\prime}\)._ * : _The response addresses both the user question \(q\), and injected adversarial instruction \(q^{\prime}\)._ * : _The response refuses to answer._ * : _The response does not provide an answer and does not specify which question it is addressing._ As observed in Figure 4, ChatGPT, GPT-3, Claude-v1, and LLaMA-30B adhere to the user questions or refuse to provide answers in most cases, which is our desirable behavior. However, the remaining instruction-tuned LLaMA-based models are observed to be misled by the injected adversarial instructions in most cases, which aligns with our automatic evaluation results. Interestingly, these models also exhibit instances where Figure 3: Investigation of the influence of the “ignore previous prompt” (IPP) prefix. The performances with and without the IPP phrase prepended to the injected adversarial instruction are reported. Figure 2: Investigation of the influence of adversarial instruction injection position on performance. _Adversarial_ refers to the accuracy w.r.t. original user questions, while _Adversarial’_ refers to the accuracy w.r.t. injected adversarial questions. More robust models should achieve higher _Adversarial_ accuracy (in blue) while lower _Adversarial’_ accuracy (in red). they refuse to respond, which is also considered acceptable. ## 4 Conclusion In this paper, we introduced the first automatic benchmark for evaluating the robustness of instruction-following LLMs against adversarial injected instructions. Through experiments with state-of-the-art LLMs, we revealed significant limitations in their robustness to adversarial attacks. These models experienced a notable performance decrease and were misled when exposed to adversarial instructions in context knowledge. Our findings emphasize the need for stronger defenses and countermeasures to mitigate the impact of adversarial instruction injection attacks on LLMs. We hope that our work will inspire future research aimed at developing improved methods to enhance the resilience and security of instruction-following LLMs, thereby ensuring their reliability and trustworthiness in real-world applications.

2302.03180

Understanding User Preferences in Explainable Artificial Intelligence: A Survey and a Mapping Function Proposal

The increasing complexity of AI systems has led to the growth of the field of Explainable Artificial Intelligence (XAI), which aims to provide explanations and justifications for the outputs of AI algorithms. While there is considerable demand for XAI, there remains a scarcity of studies aimed at comprehensively understanding the practical distinctions among different methods and effectively aligning each method with users individual needs, and ideally, offer a mapping function which can map each user with its specific needs to a method of explainability. This study endeavors to bridge this gap by conducting a thorough review of extant research in XAI, with a specific focus on Explainable Machine Learning (XML), and a keen eye on user needs. Our main objective is to offer a classification of XAI methods within the realm of XML, categorizing current works into three distinct domains: philosophy, theory, and practice, and providing a critical review for each category. Moreover, our study seeks to facilitate the connection between XAI users and the most suitable methods for them and tailor explanations to meet their specific needs by proposing a mapping function that take to account users and their desired properties and suggest an XAI method to them. This entails an examination of prevalent XAI approaches and an evaluation of their properties. The primary outcome of this study is the formulation of a clear and concise strategy for selecting the optimal XAI method to achieve a given goal, all while delivering personalized explanations tailored to individual users.

Maryam Hashemi, Ali Darejeh, Francisco Cruz

2023-02-07T01:06:38Z

http://arxiv.org/abs/2302.03180v2

# Who wants what and how: a Mapping Function for Explainable Artificial Intelligence ###### Abstract The increasing complexity of AI systems has led to the growth of the field of explainable AI (XAI), which aims to provide _explanations_ and _justifications_ for the outputs of AI algorithms. These methods mainly focus on feature importance and identifying changes that can be made to achieve a desired outcome. Researchers have identified desired properties for XAI methods, such as plausibility, sparsity, causality, low run-time, etc. The objective of this study is to conduct a review of existing XAI research and present a classification of XAI methods. The study also aims to connect XAI users with the appropriate method and relate desired properties to current XAI approaches. The outcome of this study will be a clear strategy that outlines how to choose the right XAI method for a particular goal and user and provide a personalized explanation for users. Explainable AI, Counter Factual Explanations, and Users. ## 1 Introduction Artificial Intelligence algorithms have great potential to be used in our daily lives. Because of these algorithms' complexity and black-box nature, there have been numerous studies in the field of explainable AI (XAI). The motivation behind XAI is to explain how an AI algorithm works in a human-understandable way. Although XAI is highly in demand, there is no study on knowing the users of AI, the difference between various methods, and mapping each user to a specific method. This work is an observational study on users of explainable AI (XAI), desired properties for XAI methods, and missions that XAI has. Through this paper, we want to answer this question: who wants what from XAI, and how should we deliver it? To do so, we start by exploring this field's roots and milestones. It will help us to see shortages better and have a comprehensive review. To explain the AI black box, two general strategies have been selected. The first approach is replacing the black-box algorithm with a white-box algorithm. Since white-box algorithms are much simpler than black-box ones, they usually have lower performance. The second approach is opening the black-box algorithm and justifying the system's output. This work is dedicated to the second approach. We categorized research in the XAI into three categories: philosophy, practice, and theory. Philosophy tries to define an explanation and how a human mind processes and understands an explanation. The theory part will provide the math behind the explanation and formulate this problem. Practice studies challenges of XAI in practice. ### Paper Outlines The next section will review the previous works from three perspectives: philosophy, theory, and practice. In section 3, we discuss the objectives and motivations behind using XAI. Section 4 is dedicated to explaining our mapping function and is our main contribution. The last section is the conclusion and future work. ## 2 Previous Works ### Philosophy In this category of studies, scholars discussed the concept of explanations and tried to set a definition for the terms "explanations", "transparency", and "counterfactual explanation" from the computer science perspective. In the following, we will review the works that answer basic questions in this area: 1-What is an explanation? 2- What is explainable AI? 3- What are counterfactual explanations? Xu et al. [1] responded to the basic question of what an explanation from a scientific perspective is? They named two parts for a valid explanation: the object we want to explain and the content regarding the object that explains it. Doran et al. [2] separated four concepts that have been used in this field together: opaque systems, interpretable systems, comprehensible systems, and explainable systems. They defined truly explainable systems as having automated reasoning as a part of output without needing human post-processing. Hoffman et al. [3] took one step beyond explanations and tried to define mental models such as user understanding for explainable AI. Their study is focused on metrics that assure us users understand explanations well. Byrne [4] searched for the nature of counterfactual explanations. The author discussed the counterfactual structure, relations, content, and inferences in this paper. For example, it has been mentioned that counterfactuals can be additive or subtractive. In additive CFs (Counter Factual), "a new situation that could happen but didn't" will be added to explanations. For example, in the case of auto-drive cars, we can say, "if the car had detected the pedestrian earlier and braked, the passenger would not have been injured". On the other hand, the subtractive counterfactual delete a fact that already happened to reach the desired output, "if the car had not swerved and hit the wall, the passenger would not have been injured". The other concept that the author has pointed out is that counterfactual and causal inferences are related to each other, and they called it "two sides of the same coin" [5]. The author believes that CFs intensify the causal link between an action and its outcome. In the case of CF content, the author says that in CFs, we are making changes in actions rather than inactions. Consider two clients: one has shares in company A, and wants to move to another company, name it B, and switch to it, and she loses $1,000; the other is in Company B, considering going to Company A, but he decides to stay in company A, and also loses $1,000. People created counterfactuals focused on the person who acted, "if only she hadn't switched..."[6]. Byrne [4] did the argument to conclude we have various types of explanations with different impacts. Still, to maximize the effect of CFs, computer science needs to ask for the help of cognitive science. In 2020, Amann et al. [7] published a paper on the case of the need for XAI in medicine from the following perspectives. The legal perspective, medical perspective, patient perspective, and ethical perspective. In 2022, Amann et al. [8] reviewed opinions to support or reject the explainability of the AI-powered Clinical Decision Support System (CDSS). They reviewed statements based on technical considerations, human factors, and the designated system's role in decision-making. The next work tries to bridge between the philosophical side and the computer science side and review recent works in this field to find shortages [9]. The authors mentioned that Counter Factual Explanations (CFEs) can convey more information than other XAI methods. However, there are significant shortages in generating CFEs so far. The first one is that most of the works didn't assess their proposed algorithms on real-world systems. Keane et al. [9] reported less than 21% of the papers tested their system on real-world users, and Adadi et al. [10] said this number is less than 5%. The second shortage is that most papers claim that their CFEs are plausible; however, it is not supported by user tests. The authors named covering coverage and comparative testing as other shortages in this field. In conclusion, many works have focused on defining "explanations", "counterfactual", and the need for XAI in AI algorithms. In the following sections, we will review explanations from the theory and practice perspectives. ### Practice In this part, we take some distance from the philosophy of the XAI and review the actual use of XAI in the real world. We talk about what is a "good explanation" and a "bad explanation", and enumerate properties that make an explanation good. We also talk about approaches to applying the XAI in the real world more effectively. Herm et al. [11] conducted a user study to evaluate the explainability of XAI and comprehensibility of XAI. They concluded that XAI-transferred ANN (XANN) has the highest explainability and comprehensibility rather than other explainable models, such as linear regression. Vermeire et al. [12] evaluated the needs of stakeholders for XAI. They recommended a specific method of explainability based on the needs and desired properties of the AI model. Another work evaluated the customer's preferences for XAI in Swedish Credit Scoring Industry [13]. They concluded that customers prefer rule-based explanations. They tested three prototypes based on Shapley Additive Explanations (SHAP), Local Interpretable Model-Agnostic Explanations (LIME), and counterfactual method. They reported that users could trust SHAP more than LIME and counterfactuals. The least system understanding was for counterfactuals, and the most usefulness was for SHAP. In 2020, Verma et al. [14] published a paper and enumerated some desired properties for CFEs that we mention in the following. It is worth mentioning that these properties can be applied to other XAI approaches too. 1. Actionability (Plausibility): This property guarantees that the CF explanation will not advise changing immutable features (e.g., race, gender), and only mutable features will change (e.g., education, income). 2. Sparsity: This property is about the trade-off between the number of features changed and the total amount of change made to obtain the CFE. A CFE should change a smaller number of features. It has been reasoned that people find it easier to understand shorter explanations [15]. 3. Data Manifold closeness: This property assurance that CF explanations respect the data distribution. It means CF explanations will not recommend changing something unlikely to change. For example, consider a patient at high risk for heart disease. The system wants to suggest changes to change his classification to low risk. The system should not recommend losing 60 kg weight in one year since someone is unlikely to lose this weight in that time. 4. Causality: Features in a dataset are rarely independent; therefore, changing one feature in the real world impacts others. For example, increasing job experience will be with increasing age. So we cannot ask someone to increase his experience while his age does not change. A counterfactual should maintain any known causal relations between features to be realistic and actionable. 5. Amortized Inference: Generating a counterfactual is expensive since we need an optimization function for each data point. Amortized inference uses generative techniques. Generative techniques help the algorithm compute a counterfactual (or several) for any new input without solving an optimization problem. 6. Alternative Methods: This property is about having guaranteed and optimum answers by mixed-integer programming, or SMT solvers. However, it limits us to classifiers with linear (or piece-wise linear) structures. In 2021, Verma et al. [16] identified obstacles impeding CFE deployment in the industry. In this work, they added two other desired CF properties: 1. Model-agnostic CFEs: An algorithm that can generate CFE for all black-box models, or in other words, a CF algorithm that is not restricted to a specific AI algorithm. 2. Fast CFEs: This feature is about speed and is easy to use in practice. Fast CFEs refer to algorithms that can generate CFEs for multiple data points after a single optimization. The authors mentioned some concerns in the industry. CFEs should be an interactive service; moreover, CFEs say what should change, but they also should say what should not change. Finally, CFEs should capture personal preferences. The mentioned properties are debated in the CFE setting. However, all properties can be evaluated for other methods of explanation. For example, the model agnostic property is not only preferred for CFE but also the desired property for other approaches. In the following sections, we will talk about this concern in detail. Brennen talked with many stakeholders to realize what they want from XAI and found two main concerns [17]. (1) There needs to be consistent terminology for Explainable AI. (2) There are multiple diverse use cases for Explainable AI, including debugging models, understanding bias, and building trust, and each case deals with a different user category. So, it requires different explanation strategies that are not developed yet. Alufaisan et al. [18] conducted an experiment. The authors compared objective human decision accuracy without AI with an AI prediction (no explanation) and AI prediction with an explanation. They found that providing AI prediction improves user decision accuracy, but no definitive evidence exists that explainable AI has a meaningful impact. To make this conclusion, they considered the accuracy of participants' decisions, confidence rating, and reaction time. The authors in [19] mentioned the basic reasons we need XAI. 1- Generate Trust, Transparency and Understanding. 2- GDPR Law. 3- Social Responsibility, Fairness, and Risk Avoidance. 4- Generate Accountable and Reliable models. 5- Minimize Biases. 6- Being Able to Validate Models. In 2021, Chromik et al. [20] studied how non-technical users make their global understanding of the model when we give them local explanations. The authors searched for answers to the following questions by an empirical study: 1- How robust is a self-reported global understanding gained from local explanations when examined? 2- How non-technical XAI users construct a global understanding from local explanations? They used accuracy of decisions, confidence, and Perceived Understanding metrics to evaluate their empirical study. They reported that the perception of the understanding of non-technical users decreased when researchers examined non-technical user perception. To sum up, there are three main lessons that we can learn from reviewing works in the practice category. 1. **Lesson one:** We can see that the most important properties that have been mentioned in the past works are as follow: actionability, sparsity, causality, data manifold closeness, and model-agnostic algorithms. 2. **Lesson two:** There are specific needs and reasons to have XAI. Moral values (transparency and trust), debugging, eliminating bias, model validation, intervention and changing the output, and law requirement (GDPR). 3. **Lesson three:** Users of XAI can be classified into three groups: stakeholders, expert users, and non-expert users. In the next section, we will talk about the theory and math behind XAI. ### Theory From the computer science perspective, the theory behind XAI is an essential part of it. In this category of papers, researchers formulate the problem, explain the math behind it, and find an optimum answer for the problem. We categorized XAI methods into two general categories feature importance-based approaches and counterfactuals. In the feature importance-based approaches, researchers proposed algorithms that explain the importance or contribution of each feature. In counterfactual explanations, algorithms have been developed to find changes that will alter the output. The first method of XAI that we discuss here is Local Interpretable Model-agnostic Explanations (LIME) [21]. This approach is a feature importance-based method for explaining local samples. The intuition of this method is that in a nonlinear model, LIME estimates a linear classifier in a local place where the sample is located. This idea can be formulated as below: \[\xi(x)=\underset{g\in G}{\mathrm{argmin}}\mathcal{L}\left(f,g,\pi_{x}\right)+ \Omega(g) \tag{1}\] where \(\mathcal{L}\left(f,g,\pi_{x}\right)\) is a measure of how unfaithful \(g\) is in approximating \(f\) in the locality defined by \(\pi_{x}\) and \(\Omega(g)\) is the complexity of model. \[\mathcal{L}\left(f,g,\pi_{x}\right)=\sum_{z,z^{\prime}\in\mathcal{Z}}\pi_{x}(z )\left(f(z)-g\left(z^{\prime}\right)\right)^{2} \tag{2}\] \(G\) is the class of linear models, such that \(g(z^{{}^{\prime}})=w_{g}.z^{{}^{\prime}}\). They used the locally weighted square loss as \(\mathcal{L}\), and \(\pi_{x}(z)=\exp\left(-D(x,z)^{2}/\sigma^{2}\right)\) is an exponential kernel and \(D\) is distance function with width \(\sigma\). In the line of feature importance approaches, Lundberg et al. [22] proposed SHAP (SHapley Additive exPlanations). The idea of this approach comes from game theory, where each feature is an agent, and we want to distribute output fairly among agents. It means on a scale of 1, the feature with a bigger role gets a bigger proportion. Same as LIME, SHAP provides us with local explanations. SHAP defines an explanation as follows: \[g\left(z^{\prime}\right)=\phi_{0}+\sum_{i=1}^{M}\phi_{i}z_{i}^{\prime} \tag{3}\] where \(g\) is the explanation model, \(z^{\prime}\in\{0,1\}^{M}\) is coalition vector for agents, \(M\) is the maximum coalition size, and \(\phi_{i}\in\mathbb{R}\) is feature \(i\) contribution. \(\phi_{i}\) can be calculated as follow: \[\phi_{i}=\sum_{S\subseteq F\backslash\{i\}}\frac{\mathsf{S!(F-S-1)!}}{\mathsf{ F!}}\left[f_{S\cup\{i\}}\left(x_{S\cup\{i\}}\right)-f_{S}\left(x_{S}\right)\right] \tag{4}\] \(F\) is the set of all features and \(S\) is a subset of features (\(S\in F\)). \(f_{S\cup\{i\}}\) is the model trained with the feature present, and \(f_{S}\) is trained with the feature withheld. Models are compared on the current input \(f_{S\cup\{i\}}\left(x_{S\cup\{i\}}\right)-f_{S}\left(x_{S}\right)\), where \(x_{S}\) represents the values of the input features in the set \(S\). The next approaches that attracted much attention are PDP (partial dependence plot) [23], and ALE (Accumulated local effects) [24]. Unlike previous methods, ALE is global, which means it shows the effect of features on the prediction in general, not only based on one sample. The idea of PDP and ALE is explained below. PDP evaluates the effect of one feature on output (consider it \(x_{1}\), and we call the rest of features \(x_{2}\)). \(Y\) is a scalar response variable and \(X=\left(X_{1},X_{2},...,X_{d}\right)\) is the feature vector. \(i\) is indicators of our \(i\)-th sample in training set (\(\{y_{i},x_{i}=\left(x_{i,1},x_{i,2},...,x_{i,d}\right):i=1,2,...,n\}\)) and \(p_{2}(\cdot)\) denotes the marginal distribution of \(X_{2}\). \[f_{1,PD}\left(x_{1}\right)\equiv\mathbb{E}\left[f\left(x_{1},X_{2}\right) \right]=\int p_{2}\left(x_{2}\right)f\left(x_{1},x_{2}\right)dx_{2} \tag{5}\] ALE is calculated as follow: \[f_{1,ALE}\left(x_{1}\right) \equiv\int_{x_{\min,1}}^{x_{1}}\mathbb{E}\left[f^{1}\left(X_{1},X_{2 }\right)\mid X_{1}=z_{1}\right]dz_{1}-\text{ constant} \tag{6}\] \[=\int_{x_{\min,1}}^{x_{1}}\int p_{2\mid 1}\left(x_{2}\mid z_{1} \right)f^{1}\left(z_{1},x_{2}\right)dx_{2}dz_{1}-\text{ constant}\] where \(f^{1}\left(x_{1},x_{2}\right)\equiv\frac{\partial f(x_{1},x_{2})}{\partial x_ {1}}\) represents the local effect of \(x_{1}\) on \(f(\cdot)\) at \(\left(x_{1},x_{2}\right)\), and \(x_{\min,1}\) is some value chosen near the lower bound of the effective support of \(p_{1}(\cdot)\), e.g., just below the smallest observation \(\min\left\{x_{i,1}:i=1,2,\ldots,n\right\}\). Choice of \(x_{\min,1}\) is not important, as it only affects the vertical translation of the ALE plot of \(f_{1,ALE}\left(x_{1}\right)\) versus \(x_{1}\), and the constant in equation 6 will be chosen to vertically center the plot. All the methods mentioned above are feature-based. Counterfactual explanations, unlike others, are not based on feature importance. Historically, one of the first people who formulated CF explanations was Watcher et al. (2017) in 2017. Watcher formulates the problem as follows: \[arg\min_{w}l(f_{w}(x_{i}),y_{i})+p(w) \tag{7}\] \[arg\min_{x^{{}^{\prime}}}\max_{\lambda}\lambda(f_{w}(x^{{}^{\prime}})-y^{{}^{ \prime}})^{2}+d(x_{i},x^{{}^{\prime}}) \tag{8}\] Where \(w\) indicates the weight, \(y_{i}\) is the label for data point \(x_{i}\), and \(p(.)\) is a regularizer over the weights in an AI algorithm. We wish to find a counterfactual \(x^{{}^{\prime}}\) as close to the original point \(x_{i}\) as possible such that \(f_{w}(x^{{}^{\prime}})\) is our desired output \(y^{{}^{\prime}}_{{}^{\prime}}\). Here, \(d\) is a distance function that measures how far the counterfactual \(x^{{}^{\prime}}\) is from the original data point \(x_{i}\). Watcher considers this distance as follows, which is the median absolute deviation of feature \(k\) over the set of points \(P\): \[d(x_{i},x^{{}^{\prime}})=\sum_{k\in F}\frac{\|X_{i,k}-x^{{}^{\prime}}_{k}\|}{ median_{j\in P}(\|X_{j,k}-median_{l\in P}(X_{l,k})\|)} \tag{9}\] One year later, in 2018, Ustun et al. (2018) published a new work in the field of CFEs. In their work, they referred to CF as actionable recourse. The main difference between Ustun's work with Watcher (2017) was that Ustun used percentile as the distance function, and they guaranteed feasibility. By feasibility, we mean that the method should not consider immutable features, such as gender, etc., to change. So, they formulated their problem as follows: \[\min cost(a;\ x) \tag{10}\] \[s.t.\quad f(x+a)=1\] (11) \[a\in A(x) \tag{12}\] \[cost(x+a;\;x)=\max_{j\in J_{A}}\|Q_{j}(x_{j}+a_{j})-Q_{j}(x_{j})\| \tag{13}\] where \(x\) is the current data point, \(x+a\) is the counterfactual point, \(f(x)\) is the AI function, \(A(x)\) is a set of feasible actions, and \(Q_{j}(\cdot)\) is the CDF of \(x_{j}\) in the target population. In [27], the authors framed the problem of finding CFEs as a gradient-based optimization task. For non-differentiable models such as tree ensembles, they used probabilistic model approximations in the optimization framework. They mentioned Euclidean, Cosine, and Manhattan distances as potential distances in the cost function. In 2020, we saw a surge in XAI publications, especially CFEs. Karimi et al. [28] presented a model agnostic method to find CFEs and named it MACE. The strength of his work was that the method was model agnostic and could be applied to neural networks, decision trees, and all other AI algorithms. He also considered the feasibility property (referred to as plausibility in this work). They evaluated their method on three famous datasets in this field: Loan approval (adult) [29], Credit dataset [30], and Pretrial bail (COMPAS) dataset [31]. The drawback of his proposed method is in high runtime compared with other methods that later have been introduced. Karimi et al. [32] also provided a method to generate CFEs with limited knowledge about the causality between features and used a gradient-based optimization method to find the optimum CF point. Another work considered causal reasoning [33] to generate CFEs. The authors shifted from recourse via the nearest CF to recourse through minimal interventions, or in other words, shifting the focus from explanations to interventions. In 2021, Mohammadi et al. [34] proposed a framework based on Mixed-Integer Programming (MIP). This framework calculates the nearest counterfactual explanations for the outcomes of neural networks, and it guarantees an answer and an optimal solution compared to the gradient-based approaches. The authors in [35] elaborated on the concept of CFEs, recourse definition, causality, plausibility, actionability, diversity, and sparsity. They named four essential criteria for CF explanations optimality, perfect coverage, efficient runtime, and access. Mothilal et al. [36] proposed a techniques to find CFE named DICE in 2020. They named two desired properties for their proposed framework, feasibility and diversity. They added these two properties to their cost function to maximize feasibility and diversity. Finally, the approach has been tested on four datasets: Adult-Income dataset [29], LendingClub dataset [37], German-Credit dataset[29], and COMPAS dataset [31]. Another work proposed the skyline CFEs that define the skyline of CFs as all non-dominated changes [38]. They solved this problem as multi-objective optimization over actionable features. Basically, they searched for a space of CF instead of just a data point. To verify their algorithm, they used three datasets 1- UCI Adult Dataset [29], 2- Give Me Some Credit (GMSC)1, and 3-HELOC Dataset 2. The authors did not discuss the runtime for this approach. Footnote 1: [https://www.kaggle.com/c/GiveMeSomeCredit/overview](https://www.kaggle.com/c/GiveMeSomeCredit/overview) Footnote 2: [https://community.fico.com/s/explainable-machine-learning-challenge](https://community.fico.com/s/explainable-machine-learning-challenge) Researchers introduced a new objective function that evaluates a pair of actions and orders them based on feature interaction [39]. The authors clarified that there is an asymmetric interaction among features, such as causality. So, the total cost of the action depends on feature interaction. Therefore, practical CF methods must provide an appropriate order of changing features. They applied this idea by considering an interaction matrix to find the causality between features. Hada et al. [40] focused on explaining classification and regression trees among AI algorithms and formulated the counterfactual explanation as an optimization problem. Verma et al. [41] published an article that proposed a stochastic-control-based approach to generate sequential Algorithmic Recourses (ARs) or the same CF. This algorithm permits the data point to move stochastically and sequentially across intermediate states to a final state of the cf point. The authors named their approach FASTAR and mentioned the following desiderata for their algorithm. 1- Actionability (or feasibility). 2- Sparsity: this property searches for smaller explanations since smaller explanations are more understandable to humans [15]. 3- Data manifold: This property ensures that the explanation respects the training data manifold [42], [43]. 4-Causal constraints: this property considers the causality between features [44]. 5- Model-agnostic. 6- Amortized: an amortized approach can generate ARs for several data points without optimizing separately for each of them [44]. They tested their proposed approach on three datasets, German Credit, Adult income, and Credit Default [29]. We summarized all important approaches in XAI and information related to them in Table 3. In conclusion, from the theoretical perspective computing the CFE for an AI algorithm is minimizing a cost function between the current point \(x\) and CF point \(x^{{}^{\prime}}\) subject to the output of the AI algorithm function for our CF point is the desired output. Different works proposed different cost functions or how to find the answer to this optimization problem. For feature importance-based methods, each method proposes a new way of finding the importance or contribution of a feature in ML algorithm prediction. Also, by noticing papers, we can say German Credit, Adult income, and Credit Default [29] are the three most popular datasets in this field to test the explanation-generating algorithms. ## 3 Objectives and Concerns in XAI So far, we know that because of the black-box nature of AI algorithms, we cannot see vividly why the algorithm concluded a specific output. To address this problem, researchers developed explainable AI. XAI explains how an algorithm works. In the previous section, we reviewed some papers in the field of XAI and presented state-of-the-art approaches in this field. This section will debate shortages and concerns in this field and propose potential ways to address them. We show each concern as an objective as follows: ### Objective 1 The general theme in the recent papers is presenting a new approach to generating explanations. The concern here is that it needs to be clarified who is the user of each explanation. Is that an expert, stakeholder, or non-expert user such as a patient? So we can say the users of XAI are not well-defined in the literature. This concern is critical since explanations will differ for each user, and we should consider each group differently. But **how** the explanations would be different for each group, and **what** should change for each group of users is not clear. So far, we know that various categories of people will use XAI, or in other words, different people want XAI for different purposes. We need a mapping function between users, XAI methods, and purposes to clarify this relationship. For users, we have three general groups of {experts, non-experts, and stakeholders}. For XAI methods, we can consider {LIME, SHAP, ALE, PDP, CFE, etc.}, and for purposes, we have {debugging, trustworthiness, validations, etc.}. For instance, we can map that stakeholders want CFEs to earn customers' trust. So we have the following set {stakeholders, CFE, trustworthiness}. On the other hand, non-expert users never seek CFE to debug; they ask for an explanation to change the output or trust the system, {non-expert, CFE, trustworthiness}. A further study can clarify this mapping function and use it to find the proper explanation with the suitable properties for each user (Personalized explanations for each category of users). ### Objective 2 One issue with CFEs and XAI is that different properties are often considered desirable in different contexts. For example, sparsity implies a preference for shorter sentences over longer ones. However, in the context of a medical application, where the users are doctors and experts, sparsity may not be a desired property. Doctors may prefer longer sentences that provide more information for decision making. Further research is necessary to determine the optimal level of sparsity for this particular application and how it can best inform users. ### Objective 3 Another concern in XAI is the lack of study on user preferences for explanations. For instance, a doctor may prefer a detailed explanation, while a patient may prefer a simpler, shorter answer. Additionally, user preferences over the features used in a counterfactual explanation should also be taken into account. For example, in a loan application scenario, an 80-year-old applicant may prefer increasing their savings, while a 30-year-old applicant may prefer earning a higher degree to increase their loan eligibility. It is important to acknowledge that different individuals have different preferences for different features and to use these preferences to generate personalized explanations. ### Objective 4 The fourth missing point of this puzzle is that many researchers reported that experiments showed current explanations have no meaningful impact on human decision-making [18]. However, it is still not studied that **why** XAI are not working well in practice? **what changes** are needed to make them effective? Is this "no meaning full impact" is the same for all kinds of users and all kinds of XAI methods? We can imagine that some explanations are more informative for experts rather than non-expert ones. So, the meaningful impact may be different for various categories of users. A case study may prove or reject this hypothesis. Another important issue to consider is the possibility of XAI providing misleading information. What constitutes misleading information in XAI and how can it be classified and recognized? For example, is it possible that a counterfactual explanation generated by an algorithm led to a wrong action by the user? If so, can misleading information be classified as directly misleading (e.g. the algorithm recommended a change in the wrong direction or to the wrong feature) or indirectly misleading (e.g. the explanation caused the user to make incorrect conclusions about other features in their profile)? As an example, consider a job applicant who was rejected for a position and was provided with two explanations for how to increase their chances of success in the future. The first explanation was to increase their expected salary, while the second was to increase their job experience and obtain more recommendations from past employers. The first explanation represents a direct mistake as they should decrease expected salary, while the second could be considered indirectly misleading, as the user may conclude that all other aspects of their profile are satisfactory and that they only need to focus on improving their job experience. ### Objective 5 The final challenge in this area is defining immutable features in XAI. Past research has proposed algorithms that ensure that the explanations do not alter certain features, but it's not clear how these features are determined. For example, in a loan application, features such as gender, savings, race, age, and debt may be easily identifiable, but in other real-world applications such as medicine, the list of features may be unknown. To overcome this challenge, one potential solution is using time-series data monitoring. By observing the data and features over a sufficient period, we can identify which features remain unchanged and classify them as immutable (satisfying the actionability criterion), and which ones change infrequently (meeting the requirement of closeness to the data distribution). ## 4 Who wants what and how: a Mapping Function This section will answer the following questions. Who are the users of XAI? What are their purposes for using XAI? What properties are useful for each user and goal, and finally, which methods are usable for different goals. This section's importance is that researchers didn't consider the ultimate goal of each explanation and which property each explanation should have. Many XAI properties have been proposed without considering whether this characteristic is helpful for a specific purpose or not. This section aims to study the users of XAI, their motivation to apply XAI, and the potential properties of XAI for each user and goal. The mapping function proposed in this section will help all users of XAI to select the match method and properties for their purposes. Finally, the output of this section is XAI methods that are generated regarding the task that they suppose to do and are chosen carefully to work better in practice. In general, Explainable Artificial Intelligence (XAI) has been used for the following purposes: 1- XAI is turning to customers' rights (e.g., GDPR Law). 2- For finding algorithm mistakes (debugging). 3- For finding the bias in the system. 4- Increase the trustworthiness of the system. 5- To determine whether we should trust the system or not (system validation). 6- Help users modify the output toward the desired output. 7- Moral values. In the case of users, we have three categories of users. 1- Stakeholders such as banks, hospitals, and institutions. 2- Experts, such as doctors. 3-Not expert users, such as an applicant for loan applications or patients. In the case of desired properties for XAI, we have plausibility (actionability), sparsity, run time, being model agnostic, data manifold closeness, causality, and fairness. In the case of approaches to provide explanations, we have the following approaches. Counterfactual explanations, Saliency maps, Partial Dependence Plot (PDP), Accumulated Local Effects(ALE), Individual Conditional Expectation (ICE), Local Interpretable Model-agnostic Explanations (LIME), Shapley Additive exPlanations (SHAP), Layer-wise relevance propagation (LRP), Class Activation Mapping (CAM), Gradient-weighted Class Activation Mapping (Grad-CAM), and CLass-Enhanced Attentive Response (CLEAR). In general, we have three ways to present explanations: 1- Visual explanations such as plots. 2- Textual explanations such as text. 3- Mathematical or numerical explanations. Explanations can be provided for classification, regression, segmentation, etc., tasks. Finally, the last property is the format of data. Data that has been used in AI algorithms can be tabular or numerical data, image data, and text data. For example, some explainability approaches are proposed for Artificial Neural Networks (ANNs) that are mainly used for image data. In the following, we study each classification in detail. ### Who Wants XAI? The first category of users is stakeholders, who refer to individuals or organizations that are not experts in AI but are implementing AI to provide a service. They can be policymakers, institutions, banks, employees, investors, etc. These stakeholders benefit from XAI by using it for moral values, to validate the systems provided by engineers, to meet legal requirements, and to gain the trust of their users. However, stakeholders are not directly involved in fixing the system, eliminating bias, or changing its output as they do not have enough knowledge to do so. The company hiring people is an example of a stakeholder. By providing explanations to applicants who were not hired, the company demonstrates its commitment to transparency and fairness while also gaining the trust of its applicants. Experts are another category of AI users who use XAI to achieve a specific goal. They may not be directly using AI themselves but interact with it to make decisions or complete tasks. Examples of experts include doctors, pathologists, AI technicians, researchers, and police officers. Experts can use XAI to verify or validate a system, debug the system, eliminate bias, and ensure compliance with moral values and legal requirements. They can also use XAI to trust in the AI system they are using. Experts are not usually interested in changing the AI-based decision as it is not directly related to them. For example, a doctor may use counterfactual explanations to understand how a patient can be classified as low-risk for heart disease instead of high-risk. In this situation, the doctor is using the explanation as a proxy for the patient, rather than for personal benefit. The last category of XAI customers is non-expert users. Non-expert users are users who are not experts in AI and any other field combined with AI, but they are under the direct effect of AI decisions. They can be patients in hospitals, loan applicants, job applicants, etc. Non-expert XAI users want to intervene and change the output made by AI algorithms, use the rights that the law gave them, and trust systems (trustworthiness). Non-expert users are not in the position that debugs the system or eliminate the bias and don't have enough knowledge to validate the system. We believe this category of users is more vulnerable than other users. They can easily be misled or confused by XAI and have less information about AI. To illustrate this vulnerability, consider an AI system that classifies patients into two groups that immediately need cardiac surgery and those that do not need it. This algorithm classifies a patient as someone who does not need surgery while he is in an emergency situation and needs immediate surgery. Since the classification of the AI algorithm is wrong, the explanation will be wrong too. Now consider two groups of people who see this explanation, doctors and patients. Since doctors know medicine, they are more immune from false information provided by explanations. However, this misleading XAI information can damage patients irrecoverably. In table 2 we summarized all XAI users and the potential purposes that they can have. ### What Properties Should XAI Have? So far, we clearly know why each user of XAI is using it. Now we can discuss the desired properties for each goal for using XAI. Plausibility is the most basic property that makes an explanation valid. Plausibility is a required condition for all purposes of XAI. It's hard to imagine that people will trust AI systems that make not-actionable recommendations. Model-agnostic is another desirable property for all XAI purposes. Validating systems based on XAI methods that are designed for all kinds of ML algorithms will be time-saving and more trustable. If we are using XAI for reasons like system validation, debugging, and bias elimination, then the run time will not be an issue. The reason is that we do not use XAI as a real-time task for the mentioned purposes. So, time should not be considered as a side of this tradeoff. In the mentioned cases, better performance is superior to low run time. It is worth noting that by claiming run time is not an issue, we are not talking about infinite run time (e.g., some brute force algorithms). If non-expert users are using XAI for intervention purposes, then run-time is an issue simply because faster systems are more desirable. Moral values prefer less time-taking explanations. There is no clear study about the connection between trustworthiness and run-time in XAI systems. But, in general, providing explanations in less time seems more successful in earning trust. There is no law requirement currently about the run time of explanations. For example, GPDR law clarifies that "information must be concise, transparent, intelligible and easily accessible, and use clear and plain language" [49]. As we see, there is no referring to the run-time of explanations. A threshold for the needed time for generating explanations can be a consideration. With the same logic, we can say sparsity is not an on-demand property for debugging, validating, and eliminating bias in XAI systems. We can imagine cases where longer sentences can give us more information about algorithm performance. For example, in a counterfactual explanation, an explanation recommends changing ten features in a patient to be classified as a low-risk heart disease patient rather than a high-risk patient. Eight features out of 10 are related to the patient's job life, such as decreasing working hours and stress level. With this long explanation that is not meeting the sparsity property, we can say the system overweighted patients' job features rather than \begin{table} \begin{tabular}{|l|l|} \hline User & Goal \\ \hline \multirow{3}{*}{Stakeholders} & System Validation \\ & Moral Values \\ & Law Requirement \\ & Trustworthiness \\ \hline \multirow{3}{*}{Experts} & System Validation \\ & System Debugging \\ & Eliminate Bias \\ & Moral Values \\ & Law Requirement \\ & Trustworthiness \\ \hline \multirow{3}{*}{Non-expert Users} & Intervention and Changing the Output \\ & Moral Values \\ \cline{1-1} & Law Requirement \\ \cline{1-1} & Trustworthiness \\ \hline \end{tabular} \end{table} Table 2: XAI Users and Their Purposes for Using XAI. recommending changing patients' weight, eating habits, etc. For intervention purposes, sparsity is a desirable property. In general, sparsity is a preferred property when a non-expert user is involved; otherwise, it is not. Since shorter explanations are more understandable, they will earn more trust. Same as before, there is no law requirement regarding sparsity, but it can be applied as a requirement. Causality and correlation between features is an important property that many XAI methods currently do not possess. This property is crucial for changing the output of AI systems and for complete validation of the system. XAI should be able to explain the causality between features to ensure that the AI algorithm understands it correctly. While other validation methods, such as checking for bias, can be useful, examining causality is essential for complete validation. Therefore, the ability to explain causality is a desirable property for all AI applications. In the context of detecting and eliminating bias in AI systems, being loyal to the data distribution (data manifold closeness) is not always the desired property. For example, in a dataset where most of the people hold a B.Sc. degree, if the goal is to detect bias for M.Sc. degrees, the desired explanations should focus on the M.Sc. degree and reveal the AI algorithm's strategy for this specific degree. In this case, being loyal to the data distribution is not the appropriate property. On the other hand, data manifold closeness may be a suitable property for other objectives such as intervention or moral values. In Table 3 we summarized desired properties for each XAI goal. ### Which XAI Method Should We Use? So far, we have mapped different users to different goals and mapped various purposes to various properties. In the following, we will map different methods to generate XAI to the goals and desired properties. As we discussed earlier, counterfactual explanations suggest a set of changes to achieve the desired output. Based on this definition, this method can be used by experts and non-experts that want to intervene and change the output. Since counterfactual explanations can not provide much information about how the system is working and which features are making the biggest contribution to the decision-making process, this method is not the best for system validation, debugging, and eliminating bias purposes. All the before-mentioned properties for this explanation are valid and needed. Many XAI approaches, such as LIME, SHAP, etc., are based on feature importance. The intuition behind feature importance in XAI is finding the contribution of each feature in the prediction and justifying the output based on the importance of each feature. Features in these approaches can be numbers in tabular data, pixels in images, and words in text data. The second XAI method is saliency map [50]. Saliency maps visualize pixels that are more important for the ML algorithm. This method is usually applied to image datasets. The saliency map does not explain how the network made a specific decision. Thus, saliency maps don't give us enough information to intervene and change the output. We can use saliency maps in system validation, debugging, eliminating the bias, earning the trust, and meeting the law requirements. Plausibility, sparsity, and data manifold closeness do not apply to the saliency map, but model-agnostic and low run-time are desired properties. In the case of causality, in image data, we have a connectivity matrix that shows the correlation between pixels. However, the saliency map does not visualize that. Partial Dependence Plots (PDPs) are a method for evaluating feature importance in AI algorithms. It illustrates the contribution of each feature in the decision-making process by assuming that features are independent. However, this independence assumption can make it difficult to understand correlations and causality between features, and it is not suitable for making changes to the output. PDPs allow us to observe how the prediction changes by modifying a single feature, helping us assess whether the system is using the \begin{table} \begin{tabular}{|l|l|} \hline Goal & Property \\ \hline \multirow{3}{*}{System Validation} & Plausibility \\ & Model- agnostic \\ & Causality \\ & Data Manifold Closeness \\ \hline \multirow{3}{*}{System Debugging} & Plausibility \\ & Model- agnostic \\ & Causality \\ & Data Manifold Closeness \\ \hline \multirow{3}{*}{Eliminate Bias} & Plausibility \\ & Model- agnostic \\ & Causality \\ \hline \multirow{3}{*}{System Intervention} & Plausibility \\ & Model- agnostic \\ & Sparsity \\ & Causality \\ & Run Time \\ & Data Manifold Closeness \\ \hline \multirow{3}{*}{Moral Values} & Plausibility \\ & Model- agnostic \\ & Sparsity \\ & Causality \\ & Run Time \\ & Data Manifold Closeness \\ \hline \multirow{3}{*}{Trustworthiness} & Plausibility \\ & Model- agnostic \\ & Sparsity \\ & Causality \\ & Run Time \\ & Data Manifold Closeness \\ \hline \multirow{3}{*}{Law requirement} & Plausibility \\ & Model- agnostic \\ & Sparsity \\ & Causality \\ & Run Time \\ & Data Manifold Closeness \\ \hline \end{tabular} \end{table} Table 3: Purposes for Using XAI and Desired Properties. correct features and controlling bias. They can be challenging for non-experts to interpret, as they often produce complex plots. Plausibility and sparsity are not applicable to this method. This method does not consider causality. But it can be a desired property. Low run time and being model agnostic is desirable too. In the case of closeness to manifold data, this method considers all feature constant except one and changes this feature in a wide range. For some amount, this feature will be unlikely, or it will not be close to the dataset distribution center. For example, suppose we want to consider the education feature in job applicants. In that case, this method will consider high school education, B.Sc., M.Sc., and Ph.D. for education, while Ph.D. and high school are not close to the center of the education distribution. Accumulated Local Effect (ALE) is another approach based on feature importance and is close to PDP. Basically, this approach plots the feature's influence on algorithm prediction. ALE considers the features correlations. Based on the presented explanation about ALE, we can say that stakeholders and experts can use this approach. Because of the visual nature of this approach, it is usable for non-experts too. Still, since this algorithm does not consider causality, it is unsuitable for intervention and changing the output purposes. Plausibility and sparsity do not apply to this approach. Run time and model-agnostic are valid desirable properties. For manifold data closeness, the same discussion in PDP is right here. In ALE, the algorithm will consider all values in the dataset for feature, and some of them will be unloyal to data distribution. Individual Conditional Expectation (ICE) [51] shows how the output will change if we change a feature in an instance in the input set. So, we can consider it a plot showing how each sample prediction will change if we change a feature in that sample. ICE can "uncover heterogeneous relationships" [51]. However, it does not show causality and is not suitable for intervention tasks. ICE information is helpful for stakeholders, experts, and non-experts. In the case of potential properties, it is the same as PDP and ALE. Local Interpretable Model-agnostic Explanations (LIME) is a method for providing local explanations for nonlinear AI algorithms. It works by creating a linear model that approximates the selected instance in the nonlinear algorithm, with the linear model being more interpretable. This approach can be used to validate and debug an AI system, reduce bias, and improve the transparency of the algorithm's decision-making process. LIME makes the reasoning behind the algorithm's decision clear to stakeholders, experts, and non-experts, increasing trust in the system. For the purpose of intervention, LIME presents a simplified decision boundary, indicating that changing the input so it falls on the opposite side of the estimated boundary may modify the output. However, it does not specify which features to change or by how much. Thus, it is not well-suited for system intervention. The concepts of plausibility, sparsity, and data manifold closeness cannot be considered in this context. Additionally, LIME does not take into account causality. It is desirable for LIME to have a low runtime and to be model-agnostic. SHAP (SHapley Additive exPlanations) is another visualization method that indicates the contribution of each feature to the output in a specific instance. This approach can be used for system validation, debugging, and bias elimination since it helps experts to see whether the suitable feature is making a significant contribution or not. For example, we want to provide explanations for the rejected job applicant. Based on this approach, we can check whether the gender or race of the applicant has a high role in output or not. Still, since it does not show the correlation and causality between features, intervention is not a possible option for this method of explanation. Having low run time and being model-agnostic is an expected property for this algorithm. LRP (Layer-Wise Relevance Propagation) is an explanation method by [52] to explain how neural networks work. This method is based on the backward propagation of a prediction to find the relevance of each feature to the predicted output. The drawback of this approach is that this approach is mainly applicable to images, not other types of data. Researchers used LRP in applications of bias elimination [53] and system verification [54]. The output of this method is a heatmap that indicates the relevance of each pixel to the predicted output. Since this approach does not clarify the correlation and causality between pixels, known as the connectivity matrix, it is inappropriate for intervention and changing the output. Class Activation Map (CAM) [55] is another approach to explaining CNNs. This method is mostly used on images. The output of CAM is highlighted pixels that are effective on the CNN classification output. As it can show which pixels are more critical for CNN, it can be used for system verification, debugging, and eliminating bias. The goal of trustworthiness also can be achieved by this method. Still, this approach does not clarify connectivity and correlation between pixels, so it does not provide enough information to recourse and change the output. The concept behind Class-Enhanced Attentive Response (CLEAR) is similar to previous methods. CLEAR visualizes the level of interest of a CNN in a classification task, as described in [56]. It can be useful for system verification, debugging, and reducing bias, which can increase user trust. However, it does not give us information to change the output. Model-agnosticism and low run-time are preferred in this context. The summary of methods, their potential use, and properties are presented in Table 4. Explanations can be presented in three formats: visual, text, and numerical. Each format has its own pros and cons. Visual information can convey more information quickly, making it easier to understand than text or numerical data. However, numerical data is more accurate than other formats. The format of data used in AI algorithms is another important factor. Explanation approaches such as LRP and CAMP have been developed mainly for images, while counterfactual explanations have been applied to both tabular and image data and have limited use in text data [57]. Feature importance and saliency maps are mainly used for image data but have some applications in text data. PDP, ALE, and ICE are used for tabular data. LIME and SHAP methods have been applied to tabular, image, and text data. LRP and CAM were originally developed to explain neural networks dealing with image data, but there have been limited efforts to apply them to text and tabular data. CLEAR, which was introduced for image data, has also been used for tabular data. In general, the ability of an XAI algorithm to address causality and correlation between features is crucial in allowing users to change the output. However, our study showed that many algorithms do not adequately consider causality or have not developed it properly. This raises questions about how we can fully understand AI systems if we don't know how one feature affects other features. Another discussion related to this topic is the difference between the _"ability"_ of a method to do a task and the _"superiority"_ of a method to do a task. For example, PDP, ALE, and LIME can be used for system debugging. All the mentioned methods have the "ability" of debugging, as mentioned in Table 4. However, among these three methods, one of them is superior to the others. The superiority of a method cannot be discussed unless we know the application, data type, AI algorithm, users, etc. For example, for an object image classification task based on a random forest, non-expert users can underestand a saliency map more easily than ALE. In this section, we reviewed the most important methods in XAI and evaluated each method's ability to do a task and desired properties for each method. The output of this section is methods that will work better in practice. XAI system developers can use the provided information to select the match method based on their purpose of using XAI and develop properties that are aligned with their intentions. ## 5 Conclusion This paper explores previous works in the field of XAI from a new perspective and categorizes them into three categories: philosophy, practice, and theory. In section 2, several shortcomings were identified, including: 1. The lack of well-defined users for XAI, which results in a lack of understanding about what is desired from XAI. 2. The mapping between the desired properties of XAI and the different applications that require them has not yet been established. 3. Current works do not take into account individual preferences for features and explanations. 4. The reasons for the poor performance of XAI in practice are not yet fully understood. 5. It is not yet clear how to identify immutable and mutable features when no information about the feature set is available. Each of the mentioned objectives can be a new research direction. In the third section, we debated XAI users and why each user is using XAI. After that, various methods and their desired properties have been evaluated. \begin{table} \begin{tabular}{|l|l|l|l|l|} \hline Approach & Potential Users & Potential goals & Potential Properties & Possible Data Format \\ \hline Counterfactual Explanations & Stabholders & System Intervention & Feasibility & Thabit \\ & Expert Users & Moral Values & Modi-agnostic & Image \\ & Non-agent Users & Trustentfulness & Sparsity & Text \\ & & Law Requirement & Causality & \\ & & & Run Time & \\ & & & Data Manifold Classes & \\ \hline Saliency Map & Stabholders & System Validation & Modi-agnostic & Thabit \\ & Expert Users & System Diagnostic & Run Time & Image \\ & Non-agent Users & Eliminate Bias & Text \\ & & Moral Values & & \\ & & Tractfulness & & \\ & & Law Requirement & & \\ \hline Partial Dependence Part (PDF) & Stabholders & System Validation & Causality & Thabit \\ & Expert Users & System Diagnostic & Model agnostic & \\ & Non-agent Users & Eliminate Bias & Run Time & \\ & & Moral Values & Data Manifold Classes & \\ & & Tractfulness & & \\ & & Lar Requirement & & \\ \hline Accumidated Local Effect (ALE) & Stabholders & System Validation & Causality & Thabit \\ & Expert Users & System Diagnostic & Modi-agnostic & \\ & Non-agent users & Eliminate Bias & Run Time & \\ & & Moral Values & Data Manifold Classes & \\ & & Tractfulness & & \\ & & Law Requirement & & \\ \hline Individual Conditional Expectation (ICE) & Stabholders & System Validation & Causality & Thabit \\ & Expert users & System Diagnostic & Modi-agnostic & \\ & Non-agent users & Eliminate Bias & Run Time & \\ & & Moral Values & Data Manifold Classes & \\ & & Tractfulness & & \\ & & Law Requirement & & \\ \hline Local Interpretable Explanations (IME) & Stabholders & System Validation & Causality & Thabit \\ Model-agnostic & Export Users & System Diagnostic & Modi-agnostic & Image \\ & Non-agent Users & Eliminate Bias & Run Time & Text \\ & & Moral Values & & \\ & & Tractfulness & & \\ & & Law Requirement & & \\ \hline SHAP (SHieldy Moffine orPlations) & Stabholders & System Validation & Causality & Thabit \\ & Expert Users & System Diagnostic & Model-agnostic & Image \\ & Non-agent Users & Eliminate Bias & Run Time & Text \\ & & Moral Values & & \\ & & Tractfulness & & \\ & & Law Requirement & & \\ \hline Lugx-wise Rotateate Propagation (LEF) & Stabholders & System Validation & Causality & Thabit \\ & Expert users & System Diagnostic & Model-agnostic & Image \\ & Non-agent users & Eliminate Bias & Run Time & Text \\ & & Moral Values & & \\ & & Targetfulness & & \\ & & Law Requirement & & \\ \hline Class-Enhanced Attribute Response (CLER) & Stabholders & System Validation & Causality & Thabit \\ & Expert Users & System Diagnostic & Model-agnostic & Image \\ & Non-agent Users & Eliminate Bias & Run Time & Text \\ & & Moral Values & & \\ & & Tractfulness & & \\ & & Law Requirement & & \\ \hline \end{tabular} \end{table} Table 4: Mapping Function Table to Map Approaches in XAI to Users and Desired Properties. The final conclusion of this section was a mapping function that can map each user to different goals and map different goals to suitable properties. Also, we mapped XAI methods to their expected properties and related goals. ## References * (1) Xu, F., Uszkoreit, H., Du, Y., Fan, W., Zhao, D., Zhu, J.: Explainable ai: A brief survey on history, research areas, approaches and challenges. In: CCF International Conference on Natural Language Processing and Chinese Computing, pp. 563-574 (2019). Springer * (2) Doran, D., Schulz, S., Besold, T.R.: What Does Explainable AI Really Mean? A New Conceptualization of Perspectives. arXiv (2017). [https://doi.org/10.48550/ARXIV.1710.00794](https://doi.org/10.48550/ARXIV.1710.00794). [https://arxiv.org/abs/1710.00794](https://arxiv.org/abs/1710.00794) * (3) Hoffman, R.R., Mueller, S.T., Klein, G., Litman, J.: Metrics for Explainable AI: Challenges and Prospects. arXiv (2018). [https://doi.org/10.48550/ARXIV.1812.04608](https://doi.org/10.48550/ARXIV.1812.04608). [https://arxiv.org/abs/1812.04608](https://arxiv.org/abs/1812.04608) * (4) Byrne, R.M.: Counterfactuals in explainable artificial intelligence (xai): Evidence from human reasoning. In: IJCAI, pp. 6276-6282 (2019) * (5) Hume, D.: A Treatise of Human Nature. Clarendon Press,??? (1896) * (6) Daniel, K., Tversky, A.: The Psychology of Preferences, pp. 160-73. Scientific American 246.1,??? (1982) * (7) Amann, J., Blasimme, A., Vayena, E., et al.: Explainability for artificial intelligence in healthcare: a multidisciplinary perspective. BMC Med Inform Decis Mak **20**, 310 (2020). [https://doi.org/10.1186/s12911-020-01332-6](https://doi.org/10.1186/s12911-020-01332-6) * (8) Amann, J., Vetter, D., Blomberg, S.N., et al.: To explain or not to explain?--artificial intelligence explainability in clinical decision support systems. PLOS Digit Health **1(2)** (2022). [https://doi.org/10.1371/journal.pdig.0000016](https://doi.org/10.1371/journal.pdig.0000016) * (9) Keane, M.T., Kenny, E.M., Delaney, E., Smyth, B.: If only we had better counterfactual explanations: Five key deficits to rectify in the evaluation of counterfactual xai techniques. arXiv preprint arXiv:2103.01035 (2021) * (10) Adadi, A., Berrada, M.: Peeking inside the black-box: a survey on explainable artificial intelligence (xai). IEEE access **6**, 52138-52160 (2018) * (11) Herm, L.-V., Wanner, J., Seubert, F., Janiesch, C.: I don't get it, but it seems valid! the connection between explainability and comprehensibility in (x) ai research. In: European Conference on Information Systems (ECIS), Virtual Conference, AIS (2021) * [12] Vermeire, T., Laugel, T., Renard, X., Martens, D., Detyniecki, M.: How to choose an Explainability Method? Towards a Methodical Implementation of XAI in Practice. arXiv (2021). [https://doi.org/10.48550/ARXIV.2107.04427](https://doi.org/10.48550/ARXIV.2107.04427). [https://arxiv.org/abs/2107.04427](https://arxiv.org/abs/2107.04427) * [13] Matz, F., Luo, Y.: Explaining Automated Decisions in Practice: Insights from the Swedish Credit Scoring Industry (2021) * [14] Verma, S., Dickerson, J., Hines, K.: Counterfactual explanations for machine learning: A review. arXiv preprint arXiv:2010.10596 (2020) * [15] Miller, T.: Explanation in artificial intelligence: Insights from the social sciences. Artificial intelligence **267**, 1-38 (2019) * [16] Verma, S., Dickerson, J., Hines, K.: Counterfactual explanations for machine learning: Challenges revisited. arXiv preprint arXiv:2106.07756 (2021) * [17] Brennen, A.: What do people really want when they say they want" explainable ai?" we asked 60 stakeholders. In: Extended Abstracts of the 2020 CHI Conference on Human Factors in Computing Systems, pp. 1-7 (2020) * [18] Alufaisan, Y., Marusich, L.R., Bakdash, J.Z., Zhou, Y., Kantarcioglu, M.: Does explainable artificial intelligence improve human decision-making? arXiv preprint arXiv:2006.11194 (2020) * [19] Gerlings, J., Shollo, A., Constantinou, I.: Reviewing the need for explainable artificial intelligence (xai). arXiv preprint arXiv:2012.01007 (2020) * [20] Chromik, M., Eiband, M., Buchner, F., Kruger, A., Butz, A.: I think i get your point, ai! the illusion of explanatory depth in explainable ai. In: 26th International Conference on Intelligent User Interfaces, pp. 307-317 (2021) * [21] Ribeiro, M.T., Singh, S., Guestrin, C.: " why should i trust you?" explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1135-1144 (2016) * [22] Lundberg, S.M., Lee, S.-I.: A unified approach to interpreting model predictions. Advances in neural information processing systems **30** (2017) * (23) Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Annals of statistics, 1189-1232 (2001) * (24) Apley, D.W., Zhu, J.: Visualizing the effects of predictor variables in black box supervised learning models. Journal of the Royal Statistical Society: Series B (Statistical Methodology) **82**(4), 1059-1086 (2020) * (25) Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: Automated decisions and the gdpr. Harv. JL & Tech. **31**, 841 (2017) * (26) Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 10-19 (2019) * (27) Lucic, A., Oosterhuis, H., Haned, H., de Rijke, M.: Focus: Flexible optimizable counterfactual explanations for tree ensembles. arXiv preprint arXiv:1911.12199 (2019) * (28) Karimi, A.-H., Barthe, G., Balle, B., Valera, I.: Model-agnostic counterfactual explanations for consequential decisions. In: International Conference on Artificial Intelligence and Statistics, pp. 895-905 (2020). PMLR * (29) Dua, D., Graff, C.: UCI Machine Learning Repository (2017). [http://archive.ics.uci.edu/ml](http://archive.ics.uci.edu/ml) * (30) Yeh, I.-C., Lien, C.-h.: The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients. Expert Systems with Applications **36**(2, Part 1), 2473-2480 (2009). [https://doi.org/10.1016/j.eswa.2007.12.020](https://doi.org/10.1016/j.eswa.2007.12.020) * (31) Larson, J., Mattu, S., Kirchner, L., Angwin, J. [https://doi.org/https://github.com/propublica/compas-analysis](https://doi.org/https://github.com/propublica/compas-analysis). * (32) Karimi, A.-H., Von Kugelgen, J., Scholkopf, B., Valera, I.: Algorithmic recourse under imperfect causal knowledge: a probabilistic approach. Advances in Neural Information Processing Systems **33**, 265-277 (2020) * (33) Karimi, A.-H., Scholkopf, B., Valera, I.: Algorithmic recourse: from counterfactual explanations to interventions. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pp. 353-362 (2021) * (34) Mohammadi, K., Karimi, A.-H., Barthe, G., Valera, I.: Scaling guarantees for nearest counterfactual explanations. In: Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society, pp. 177-187 (2021) * [35] Karimi, A.-H., Barthe, G., Scholkopf, B., Valera, I.: A survey of algorithmic recourse: contrastive explanations and consequential recommendations. ACM Computing Surveys (CSUR) (2021) * [36] Mothilal, R.K., Sharma, A., Tan, C.: Explaining machine learning classifiers through diverse counterfactual explanations. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 607-617 (2020) * [37] Davenport, K.: Lending Club Data Analysis Revisited with Python,. [https://doi.org/http://kldavenport.com/lending-club-data-analysis-revised-with-py](https://doi.org/http://kldavenport.com/lending-club-data-analysis-revised-with-py) * [38] Wang, Y., Ding, Q., Wang, K., Liu, Y., Wu, X., Wang, J., Liu, Y., Miao, C.: The skyline of counterfactual explanations for machine learning decision models. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 2030-2039 (2021) * [39] Kanamori, K., Takagi, T., Kobayashi, K., Ike, Y., Uemura, K., Arimura, H.: Ordered counterfactual explanation by mixed-integer linear optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 11564-11574 (2021) * [40] Hada, S.S., Carreira-Perpinan, M.: Exploring counterfactual explanations for classification and regression trees. In: XCDD (ECML PKDD International Workshop) (2021) * [41] Verma, S., Hines, K., Dickerson, J.P.: Amortized generation of sequential counterfactual explanations for black-box models. arXiv preprint arXiv:2106.03962 (2021) * [42] Dhurandhar, A., Pedapati, T., Balakrishnan, A., Chen, P.-Y., Shanmugam, K., Puri, R.: Model agnostic contrastive explanations for structured data. arXiv preprint arXiv:1906.00117 (2019) * [43] Kanamori, K., Takagi, T., Kobayashi, K., Arimura, H.: Dace: Distribution-aware counterfactual explanation by mixed-integer linear optimization. In: IJCAI, pp. 2855-2862 (2020) * [44] Mahajan, D., Tan, C., Sharma, A.: Preserving causal constraints in counterfactual explanations for machine learning classifiers. arXiv preprint arXiv:1912.03277 (2019) * [45] Blitzer, J., Dredze, M., Pereira, F.: Biographies, bollywood, boom-boxes and blenders: Domain adaptation for sentiment classification. In: Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pp. 440-447 (2007) * (46) Fanaee-T, H., Gama, J.: Event labeling combining ensemble detectors and background knowledge. Progress in Artificial Intelligence, 1-15 (2013). [https://doi.org/10.1007/s13748-013-0040-3](https://doi.org/10.1007/s13748-013-0040-3) * (47) FICO, Explainable Machine Learning Challenge. URL[https://community.fico.com/s/explainable-machine-learning-challenge](https://community.fico.com/s/explainable-machine-learning-challenge). * (48) Ofer, D.: COMPAS Dataset. [https://www.kaggle.com/danofer/compass](https://www.kaggle.com/danofer/compass). * (49) Council of European Union: Council regulation (EU) no 269/2014. [http://eur-lex.europa.eu/legal-content/EN/TXT/?qid=1416170084502&uri=CELE?](http://eur-lex.europa.eu/legal-content/EN/TXT/?qid=1416170084502&uri=CELE?) (2014) * (50) Simonyan, K., Vedaldi, A., Zisserman, A.: Deep inside convolutional networks: Visualising image classification models and saliency maps. arXiv preprint arXiv:1312.6034 (2013) * (51) Goldstein, A., Kapelner, A., Bleich, J., Pitkin, E.: Peeking inside the black box: Visualizing statistical learning with plots of individual conditional expectation. journal of Computational and Graphical Statistics **24**(1), 44-65 (2015) * (52) Bach, S., Binder, A., Montavon, G., Klauschen, F., Muller, K.-R., Samek, W.: On pixel-wise explanations for non-linear classifier decisions by layer-wise relevance propagation. PloS one **10**(7), 0130140 (2015) * (53) Lapuschkin, S., Waldchen, S., Binder, A., Montavon, G., Samek, W., Muller, K.-R.: Unmasking clever hans predictors and assessing what machines really learn. Nature communications **10**(1), 1-8 (2019) * (54) Arbabzadah, F., Montavon, G., Muller, K.-R., Samek, W.: Identifying individual facial expressions by deconstructing a neural network. In: German Conference on Pattern Recognition, pp. 344-354 (2016). Springer * (55) Zhou, B., Khosla, A., Lapedriza, A., Oliva, A., Torralba, A.: Learning deep features for discriminative localization. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2921-2929 (2016) * (56) Kumar, D., Wong, A., Taylor, G.W.: Explaining the unexplained: A class-enhanced attentive response (clear) approach to understanding deep neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, pp. 36-44 (2017) * (57) Yang, L., Kenny, E.M., Ng, T.L.J., Yang, Y., Smyth, B., Dong, R.: Generating plausible counterfactual explanations for deep transformers in Springer Nature 2021 LaTeX template _A Mapping Function for Explainable Artificial Intelligence_ financial text classification. arXiv preprint arXiv:2010.12512 (2020)

2306.11073

Quantum state preparation of gravitational waves

We detail a quantum circuit capable of efficiently encoding analytical approximations to gravitational wave signal waveforms of compact binary coalescences into the amplitudes of quantum bits using both quantum arithmetic operations and hybrid classical-quantum generative modelling. The gate cost of the proposed method is considered and compared to a state preparation routine for arbitrary amplitudes, where we demonstrate up to a four orders of magnitude reduction in gate cost when considering the encoding of gravitational waveforms representative of binary neutron star inspirals detectable to the Einstein telescope. We demonstrate through a quantum simulation, that is limited to 28 qubits, the encoding of a second post-Newtonian inspiral waveform with a fidelity compared to the desired state of 0.995 when using the Grover-Rudolph algorithm, or 0.979 when using a trained quantum generative adversarial network with a significant reduction of required gates.

Fergus Hayes, Sarah Croke, Chris Messenger, Fiona Speirits

2023-06-19T17:17:59Z

http://arxiv.org/abs/2306.11073v1

# Quantum state preparation of gravitational waves ###### Abstract We detail a quantum circuit capable of efficiently encoding analytical approximations to gravitational wave signal waveforms of compact binary coalescences into the amplitudes of quantum bits using both quantum arithmetic operations and hybrid classical-quantum generative modelling. The gate cost of the proposed method is considered and compared to a state preparation routine for arbitrary amplitudes, where we demonstrate up to a four orders of magnitude reduction in gate cost when considering the encoding of gravitational waveforms representative of binary neutron star inspirals detectable to the Einstein telescope. We demonstrate through a quantum simulation, that is limited to 28 qubits, the encoding of a second post-Newtonian inspiral waveform with a fidelity compared to the desired state of 0.995 when using the Grover-Rudolph algorithm, or 0.979 when using a trained quantum generative adversarial network with a significant reduction of required gates. ## I Introduction The Laser Interferometer Gravitational-Wave Observatory (LIGO) made the first detection of a gravitational wave in September of 2015 from a binary black-hole merger dubbed GW150914 [1], which began the era of gravitational wave astronomy. Since then, the LIGO-Virgo-KAGRA collaboration has catalogued over 90 additional detections [2; 3; 4] including neutron star-black hole mergers [5] as well as the first binary neutron star merger event GW170817 [6] that was detected in conjunction with electromagnetic observations [7; 8] -- the first time that these two observation channels had coincided for a single event. However, there is still much that gravitational wave astronomy can offer us: from the discoveries of gravitational waves from sources such as continuous gravitational waves [9], supernovae [10], the stochastic background [11] and cosmic strings [12]; to testing our understanding of cosmology [13] and general relativity [14]. To realize these aims will require future generations of gravitational wave [15; 16; 17] and electromagnetic detectors [18] to be constructed, the observations from which will need to be processed by ever more sophisticated data analysis methods. Quantum computing as a field has grown independently but alongside the development of gravitational wave detectors [19]. It is well known that quantum computers offer the potential of performing some computational tasks faster than their classical counterparts, such as prime factorisation using Shor's algorithm [20] and unstructured searches using Grover's algorithm [21]. Since the conception of the idea in the 1980's, quantum computing has now progressed to the widespread availability of noisy quantum processors. Repeated, real time error-correction for a single logical qubit has recently been demonstrated experimentally, providing a first step towards fault tolerant quantum computing devices [22; 23]. Given the development of this quantum technology and the potential of quantum algorithms to speed up some computational tasks, it is fitting that astronomers can now look to see whether quantum computing can help overcome current and future data analysis challenges. In previous work, it has been shown that the standard signal detection analysis for gravitational waves, matched filtering [24], can acquire a quadratic speed-up using Grover's algorithm [25], a procedure later built upon in [26]. Bayesian inference of gravitational wave parameters has also been shown to acquire a polynomial speed-up [27] with a quantum version of the famous Metropolis-Hastings algorithm [28]. There are a number of reasons why gravitational wave data analysis is a particularly interesting case for exploring applications for quantum computing. Firstly, it is common for data analysis methods to be proposed that rely upon future technology that is decades in the making due to the challenges involved in the instrumentation of gravitational wave detections. Second, the computational expense that gravitational wave data analysis often faces is not due to the quantity of data but in the size of the solution space, as opposed to _big data_ problems where techniques such as dimensionality reduction and data compression are required. Although quantum algorithms with super-polynomial speed-ups and potential applications to big data problems have been proposed [29; 30], we must be careful to account for the cost of loading classical data into quantum states [31]. In the worst case, this can be sufficient to negate any quantum advantage. Gravitational wave data analysis problems are not of this flavour. Lastly, gravitational wave signals are well modelled through general relativity, allowing their waveforms to be efficiently prepared in quantum states. It is this final aspect that is the focus of this paper, where we demonstrate how analytical gravitational waveforms can be encoded into quantum states. There are different methods for encoding information into quantum states. Digital encoding involves storing in the computational basis of a string of qubits, just as information is stored on bit strings in the classical case. A denser format is angular encoding where each qubit can store up to two real values as rotation angles about the Bloch sphere [32]. The densest form of information representation is _amplitude encoding_, where the components of a classical vector are stored as the amplitudes of a superposition of quantum states, the number of which grows exponentially with the number of qubits. Amplitude encoded data is an essential assumption in a multitude of quantum machine learning algorithms [33; 34; 35; 36; 37; 38; 39; 40]. The efficient amplitude encoding of vectors is also a required subroutine of quantum algorithms for solving linear systems of equations [41; 29; 42]. While amplitude encoding is the most space efficient, the computational cost of preparing an arbitrary state scales exponentially with the number of qubits [43], making it extremely inefficient to perform [31]. It has however been demonstrated that amplitude encoding can be performed efficiently to prepare specific states [44; 45]. In this work, we demonstrate by explicit construction that quantum states that amplitude encode analytic gravitational waveforms for inspiralling binary systems can be prepared efficiently. This is a crucial first step to study space-efficient quantum algorithms for gravitational wave data analysis, which may be implementable on small, near-term quantum devices. We anticipate that our state preparation algorithm may find application as a subroutine to load templates to e.g. train a variational quantum circuit to distinguish signal from noise [46], or in the longer term to construct an oracle for Grover's search using amplitude encoded data [25], or for more sophisticated machine learning techniques [29]. We outline the proposed state preparation routine in Sec. II, where we also introduce the necessary background from the literature on the subroutines used in the procedure. The state preparation routine is demonstrated with an example on a quantum simulator in Sec. III. We relate our state preparation routine to the challenge of analysing binary neutron star inspiral data faced during the third generation detector in Sec. IV. The conclusion is provided in Sec. V. ## II State preparation algorithms Our central goal in this paper is to introduce methods for loading gravitational wave templates into a quantum register, using amplitude encoding. To achieve this we make use of the fact that analytical expressions that closely approximate the waveforms of interest may be derived from general relativity. In this section we begin by outlining our approach to state preparation, which first prepares the amplitude and then the phase of the desired coefficients. For each of these steps we draw on existing techniques, and the remainder of the section is then dedicated to introducing the background needed for our implementation. ### Overview of state preparation procedure An arbitrary complex vector \(\vec{h}\) of length \(N\) has components \(\{\tilde{A}(0)e^{i\Psi(0)},\ldots,\tilde{A}(N-1)e^{i\Psi(N-1)}\}\) where \(\tilde{A}(i)\) and \(\Psi(i)\) are real numbers. These components may be represented as amplitudes of a quantum state \(|h\rangle\) given by: \[|h\rangle=\frac{1}{\|\tilde{A}\|}\sum_{j=0}^{2^{n}-1}\tilde{A}(j)e^{i\Psi(j)} |j\rangle, \tag{1}\] where \(|j\rangle\) are computational basis states of \(n=\lceil\log_{2}N\rceil\) qubits and \(\|\cdot\|\) represents the norm of the vector. The state \(|h\rangle\) is then said to be an amplitude encoding of the normalised vector \(\vec{h}\) onto the \(n\) qubits. In general preparing an arbitrary state of this form requires exponential resources [47], however if these coefficients are given by functions with analytical expressions, there exist more efficient procedures, which we exploit in this work. To perform the amplitude encoding of Eq. 1, our strategy will be to divide the task into two steps. In the first, we construct an operator \(\tilde{U}_{A}\), the role of which is to encode the real amplitudes \(\tilde{A}(j)\) such that: \[|F\rangle = \tilde{U}_{A}|0\rangle^{\otimes n} \tag{2}\] \[= \frac{1}{\|\tilde{A}\|}\sum_{j=0}^{2^{n}-1}\tilde{A}(j)|j\rangle.\] We propose two methods to implement this operator as a quantum circuit: either by using the Grover-Rudolph algorithm [44], or by using a trained parameterised quantum circuit [48], each described below. In the second step, we construct an operator \(\hat{U}_{\Psi}\), the role of which is to prepare the phases \(\Psi(j)\). Thus, the action on computational basis states \(|j\rangle\) is such that: \[\hat{U}_{\Psi}|j\rangle=e^{i\Psi(j)}|j\rangle. \tag{3}\] We show below by explicit construction that if the phase is given analytically as a function of \(j\) this operator may be implemented efficiently as a quantum circuit. Our procedure is straight-forward and closely related to methods used in the quantum Fourier transform [49]. ### Grover-Rudolph algorithm The Grover-Rudolph algorithm [44] is one way to implement the operator \(\hat{U}_{A}\). This algorithm can efficiently prepare a target quantum state \(|\psi\rangle\) of the form: \[|\psi\rangle=\sum_{j=0}^{2^{n}-1}\sqrt{p(j)}|j\rangle, \tag{4}\] given probability mass function \(p\). The Grover-Rudolph algorithm is an iterative process applied to each \(m\!=\!0,\ldots,n\!-\!1\) qubits, where each step involves dividing the target distribution into \(j\!=\!0,\ldots,2^{m}-1\) bins. For the \(m\)th step, each \(j\)th bin is divided into two further bins of equal width, and the corresponding probability amplitude divided between the two new bins is calculated and stored in an ancillary register. This is illustrated in Fig. 1. The fraction of the probability residing in the leftmost half of the \(j\)th bin is equal to: \[\cos^{2}\zeta_{m,j}=\frac{\sum_{i=j2^{m-m}}^{(j+1/2)2^{n-m}}p(i)}{\sum_{l=j2^{ m-m}}^{(j+1)2^{m-m}}p(i)}. \tag{5}\] Consider the operation \(\hat{Q}_{\zeta}^{(m)}\) that calculates the angle \(\zeta_{m,j}\), storing this in the computational basis of an ancillary register \(|0\rangle_{\rm a}\): \[\hat{Q}_{\zeta}^{(m)}\left(\sum_{j=0}^{2^{m}-1}\sqrt{p_{j}^{(m)}}|j\rangle \right)|0\rangle_{\rm a}=\sum_{j=0}^{2^{m}-1}\sqrt{p_{j}^{(m)}}|j\rangle|\zeta _{m,j}\rangle_{\rm a}, \tag{6}\] where \(p_{j}^{m}\) denotes the probability mass function \(p\) integrated across the \(j\)th bin given \(m\) qubits. Controlled \(Y\) rotations \(\hat{R}_{Cy}^{(m+1)}\) are then applied onto qubit \(m+1\) such that: \[\hat{R}_{Cy}^{(m+1)}\sqrt{p_{j}^{(m)}}|j\rangle|\zeta_{m,j}\rangle _{\rm a}|0\rangle_{m+1}\] \[=\sqrt{p_{j}^{(m)}}|j\rangle|\zeta_{m,j}\rangle_{\rm a}(\cos\zeta _{m,j}|0\rangle_{m+1}+\sin\zeta_{m,j}|1\rangle_{m+1})\] \[=\sqrt{p_{j}^{(m+1)}}|j\rangle|\zeta_{m,j}\rangle_{\rm a}. \tag{7}\] The ancilla register is then cleared by uncomputing \(\zeta_{m,j}\) using the inverse operation \(\hat{Q}_{\zeta}^{(m)}\) of Eq. 6. The operations of Eq. 6 and Eq. 7 can be repeated for \(m\) incremented by one, until \(m=n-1\), and the state of Eq. 4 is produced. While this routine allows for efficient state preparation of the \(n\) qubit amplitude states, for practical use we will be interested not just in the scaling of the cost with \(n\), but also the absolute number of gates used. The computational cost for low \(m\) iterations may induce overhead costs that are much greater than simply using a general state preparation routine for loading arbitrary states [47]. Therefore we can define a critical value \(m_{a}\) where for \(m<m_{a}\) a routine for arbitrary amplitude state preparation is applied instead that we can denote \(R_{y}^{(m<m_{a})}\). This routine can be further parameterised to reduce computational cost by defining a maximum iteration \(m_{b}\). As \(\lim_{m\to\infty}\zeta_{m,j}=\pi/4\) for all \(j\) in Eq. 5 (assuming continuity of the probability mass function \(p\)), then replacing the operation described in Eq. 7 by applying Hadamard gates to the qubits for operations \(m\!>\!m_{b}\) reduces the gate cost at the expense of the accuracy of the final amplitude states. The overall encoding of the frequency amplitude is performed by the time-ordered product \[\hat{U}_{A}=\hat{H}^{(m>m_{b})}\left(\prod_{m=m_{a}}^{m_{b}-2}\hat{Q}_{\zeta} ^{\dagger(m)}\hat{R}_{Cy}^{(m+1)}\hat{Q}_{\zeta}^{(m)}\right)\hat{R}_{y}^{(m <m_{a})} \tag{8}\] where \(\hat{H}^{(m>m_{b})}\) denotes Hadamard gates applied onto qubits corresponding to \(m>m_{b}\). Figure 1: Illustration of the Grover-Rudolph algorithm applied to two qubits to encode \(p(f)\propto f^{-7/3}\) (shown as the solid curved line) into the quantum state amplitudes. Initially no qubits are encoded and therefore \(m=0\) and there is only one bin \(j=0\). The domain is then divided into two and the ratio of the left-most shaded region under the distribution to the whole domain is calculated as \(\cos^{2}\zeta_{0,0}\). The \(m=0\) qubit is then put into a superposition conditioned on the corresponding \(\zeta_{0,0}\) to produce \(m=1\). The process is repeated for \(m=1\) where \(j=0,1\) and each region is split proportionally by \(\cos^{2}\zeta_{1,0}\) and \(\cos^{2}\zeta_{1,1}\) respectively to acquire \(m=2\). Note that a continuous distribution is plotted for illustrative purposes; the discretised probability distribution is considered for formulating \(\zeta_{m,j}\) in Eq. 5. ### Quantum generative modelling Another approach to preparing a state of the form of Eq. 4 is to train a parameterized quantum circuit \(\hat{U}(\phi)\) using a hybrid quantum-classical generative machine learning model given parameters \(\phi\). This is done by measuring an ensemble of outputs from the parameterized quantum circuit and utilizing a classical loss function to compare the samples from the measured distribution \(q_{\phi}\) to those from the target distribution \(p\) which can be classically generated. This requires the parameterized quantum circuit to be chosen so that it is constrained to only result in real amplitudes. We choose a parameterized circuit of \(L\) repeating layers, defined by: \[\hat{U}(\phi)= \prod_{j=0}^{n-1}\hat{R}_{y}^{(j)}(\phi_{L,j})\] \[\prod_{i=0}^{L-1}\left(\prod_{k=0}^{n-2}\hat{X}_{C}^{(k,k+1)}\prod _{j=0}^{n-1}\hat{R}_{y}^{(j)}(\phi_{i,j})\right)\hat{H}^{\otimes n}, \tag{9}\] where parameter \(\phi_{i,j}\) is the parameter for layer \(i\) and qubit \(j\), \(\hat{R}_{y}^{(j)}\) is a \(Y\) rotation on qubit \(j\) by the given angle, and \(\hat{X}_{C}^{(k,k+1)}\) is an \(X\) gate on qubit \(k+1\) controlled on qubit \(k\). We explore the use of a hybrid quantum-classical _generative adversarial network_ to train this parameterised quantum circuit [48]. Generative adversarial networks consider two competing networks: one, called the _discriminator_ and dependent on parameters \(\omega\), is trained to discern an ensemble of samples from \(q_{\phi}\) from those taken from \(p\). The other, called the _generator_ and dependent on parameters \(\phi\), is trained to produce samples \(q_{\phi}\) to trick the discriminator into falsely labeling them as being products from \(p\). As both networks have competing objectives, the training of both simultaneously leads to \(q_{\phi}\approx p\) as Nash equilibrium is reached [50]. Quantum generative adversarial networks use a quantum parameterized circuit in place of the generator as discussed in Ref. [51]. The discriminator given parameters \(\omega\) outputs \(D_{\omega}\), where \(0<D_{\omega}<1/2\) indicates the samples were drawn from \(q_{\theta}\), while \(1/2<D_{\omega}<1\) indicates the samples were drawn from \(p\). The training involves minimizing the generator loss function given \(S\) samples \(\{x_{1},\ldots,x_{S}\}\sim q_{\phi}\): \[L_{G}=-\frac{1}{S}\sum_{i=1}^{S}\log D_{\omega}(x_{i}), \tag{10}\] and maximizing the discriminator loss function given \(S\) samples \(\{x_{1}^{\prime},\ldots,x_{S}^{\prime}\}\sim p\): \[L_{D}=\frac{1}{S}\sum_{i=1}^{S}[\log D_{\omega}(x_{i}^{\prime})+\log(1-D_{ \omega}(x_{i}))]. \tag{11}\] ### Phase preparation To encode the phase information we wish to construct an operator \(\hat{U}_{\Psi}\), as defined in Eq. 3. Given an analytic expression for \(\Psi(j)\), which may be computed efficiently classically, we begin by evaluating \(\Psi^{\prime}(j)=\Psi(j)/2\pi\) and storing it as a binary string in the computational basis of an ancilla register. We define the operator implementing this as \(\hat{Q}_{\Psi}\): \[\hat{Q}_{\Psi}|j\rangle|0\rangle_{\mathrm{a}}=|j\rangle|\Psi^{\prime}(j) \rangle_{\mathrm{a}}. \tag{12}\] As this operation can be computed efficiently classically, it follows that \(\hat{Q}_{\Psi}\) may be implemented efficiently as a quantum circuit. The frequency dependent phase can then be readily produced by \(Z\) rotations \(\hat{R}_{z}\) applied to the qubits of the ancillary register. Specifically, any number \(x\) stored in \(n\)-bits, \(p\) of which are precision qubits, has binary representation: \[x=\sum_{i=0}^{n-1}x_{i}2^{i-p}.\] This may be stored in the computational basis of an \(n\)-qubit register as the state \[|x\rangle=|x_{n-1}\rangle\otimes|x_{n-2}\rangle\ldots\otimes|x_{0}\rangle\] Applying single qubit \(Z\) rotations to the precision qubits, where \(\hat{R}^{(j)}(2^{j-p+1}\pi)\) represents a rotation by \(2^{j-p+1}\pi\) applied to the \(j\)-th qubit gives: \[\prod e^{2^{j-p+1}\pi x_{j}}|x_{n-1}\rangle\otimes|x_{n-2}\rangle \ldots|x_{0}\rangle\] \[=e^{2\pi\sum_{j=0}^{p-1}x_{j}2^{j-p}}|x\rangle=e^{2\pi x}|x\rangle \tag{13}\] . Thus we need only apply \(p_{a}\) single qubit gates (where \(p_{a}\) is the number of precision qubits used in the ancillier register) to prepare: \[\prod_{j=1}^{p_{a}}\hat{R}_{z}^{(p_{a}-j)}(2^{1-j}\pi)|\Psi^{\prime}(j)\rangle _{\mathrm{a}}=e^{i\Psi(j)}|\Psi^{\prime}(j)\rangle_{\mathrm{a}}. \tag{14}\] Finally, the ancillary register is cleared by uncomputing the calculation of \(\Psi^{\prime}(j)\) with the inverse operation \(\hat{Q}_{\Psi}^{\dagger}\) giving \[\hat{U}_{\Psi}=\hat{Q}_{\Psi}^{\dagger}\prod_{j=1}^{p_{a}}\hat{R}_{z}^{(p_{a}- j)}(2^{1-j}\pi)\hat{Q}_{\Psi}. \tag{15}\] ### Linear piece-wise function For both Eq. 6 of the Grover-Rudolph algorithm and Eq. 12 of the phase preparation, we require a quantum circuit that is able to efficiently input and evaluate functions \(f(x)\) for a given \(x\). Any function that is computable efficiently classically may be directly implemented as a quantum circuit, performing the function evaluation in the computational basis and writing the result in an ancilla register: \[|x\rangle|0\rangle\rightarrow|x\rangle|f(x)\rangle\] One way to implement function evaluation in practice is by a piece-wise function approximation, described in Ref. [52], which has previously been proposed as a way to perform the Grover-Rudolph algorithm efficiently in Ref. [53]. This involves dividing the domain into \(2^{n_{l}}\) sub-domains and approximating the function in each subdomain by a polynomial of a given order. The Remez Algorithm [54] is applied to determine the polynomial coefficients to the given order that minimizes the \(L_{\infty}\) error across the given domain. This classical pre-processing step is performed with a cost of \(O(2^{n_{l}})\). The domains of the function are then correlated with a label register \(|0\rangle_{l}^{\otimes n_{l}}\) using the label gate described in Ref. [52]. Here we consider the simplest case where the function \(f(x)\) is approximated to be linear within the given sub-domain over \(x\), requiring the zeroth and first order polynomial coefficients \(A_{0}^{l}\) and \(A_{1}^{l}\) such that \(f(x)\approx A_{1}^{l}x+A_{0}^{l}\) for \(x\) in the given sub-domain. The \(x\) argument is given to the input register \(|x\rangle_{x}^{\otimes n_{x}}\) of size \(n_{x}\) and the coefficients for each sub-domain are loaded into the coefficient register \(|0\rangle_{c}^{\otimes n_{c}}\), where \(n_{c}\) qubits are used. This requires the output register in which the outcome \(f(x)\) is stored in \(n_{\rm o}\) qubits. Generally, when approximating a linear piecewise function, we introduce the operation \(\hat{Q}_{f}\), performing the operations: \[|x\rangle_{x}|0\rangle_{o}|A_{1}^{l}\rangle_{c}|l\rangle_{l} \xrightarrow{\text{Mult}}|x\rangle_{x}|A_{1}^{l}\rangle_{o}|A_{1}^ {l}\rangle_{c}|l\rangle_{l}\] \[\xrightarrow{\text{Load}}|x\rangle_{x}|A_{1}^{l}\rangle_{o}|A_{0 }^{l}\rangle_{c}|l\rangle_{l}\] \[\xrightarrow{\text{Add}}|x\rangle_{x}|A_{1}^{l}x+A_{0}^{l} \rangle_{o}|A_{0}^{l}\rangle_{c}|l\rangle_{l}.\] The quantum circuit used to perform this action is shown in Fig. 2, where the zeroth and first order coefficients are loaded and unloaded using gates \(X_{0,1}\) and \(X_{0,1}^{\dagger}\) respectively. The gate and space cost of applying the piece-wise linear function depends on the choice of adder and multiplier routine. The coefficients of a given domain are loaded and unloaded into the coefficient register using controlled \(X\) gates conditioned on the label register. ## III Encoding gravitational wave inspirals In this section we detail how the techniques outlined in the previous section are applied to encode the waveforms of gravitational wave binary system inspirals. An analytical expression of the frequency dependent amplitude of an inspiral waveform is obtained using the stationary-phase approximation (see Appendix A), resulting in the expression [55]: \[\tilde{A}_{N}(f)=\frac{Q\mathcal{M}^{5/6}}{D}f^{-7/6}. \tag{16}\] where \(Q\) is dependent on the geometry of the detector and source system, \(\mathcal{M}\) is the chirp mass, and \(D\) is the luminosity distance to the source. Similarly, the frequency dependent phase to a second post-Newtonian order waveform is of the form: Figure 2: Quantum circuit of the piece-wise linear function operation \(\hat{Q}_{f}\) approximating \(f(x)\approx A_{1}^{l}x+A_{0}^{l}\) for values of \(x\) within each of the \(2^{n_{l}}\) sub-domains of \(f(x)\). The label gate correlates the sub-domains to the label register \(|l\rangle_{l}\) before loading in the coefficients \(A_{1}^{l}\) for each sub-domain into the coefficient register using controlled operations \(X_{1}\). The input register \(|x\rangle_{x}\) is then multiplied by the coefficient register with the arithmetic multiplication operation and the result is saved in the output register. The coefficient register is cleared before the zeroth order coefficients are loaded with operation \(X_{0}\) before they are added to the output register with an arithmetic addition operation. \[\Psi_{\rm 2PN}(f)=2\pi ft_{c}-\phi_{c}-\frac{\pi}{4}+\frac{3}{128}( \pi{\cal M}f)^{-5/3}\left[1+\frac{20}{9}\left(\frac{743}{336}+\frac{11}{4}\eta \right)(\pi Mf)^{2/3}-4(4\pi-\beta)(\pi Mf)\right.\\ \left.+10\left(\frac{3058673}{1016064}+\frac{5429}{1008}\eta+ \frac{617}{144}\eta^{2}-\sigma\right)(\pi Mf)^{4/3}\right]. \tag{17}\] where \(t_{c}\) is the time of coalescence, \(\phi_{c}\) is the phase at coalescence, \(M\) is the total mass, \(\eta\) is the reduced mass, \(\sigma\) is the spin-spin parameter, and \(\beta\) is the spin-orbit parameter. For further details on these parameters, we refer the reader to Appendix B. Consider encoding the frequency dependent waveform over a frequency range with lower frequency cut-off \(f_{\rm min}\) and upper frequency \(f_{\rm max}\), discretised into \(N=2^{n}\) frequency bins of widths \(\Delta f=(f_{\rm max}-f_{\rm min})/2^{n}\). This gives the number of integer qubits to be \(n_{\rm int}=\left[\log_{2}(2^{n}\Delta f)\right]\) and therefore the number of precision bits as \(p=\left[\log_{2}T\right]\), where \(T\) is the waveform's temporal duration \(T=\Delta f^{-1}\). The \(j\)th computational basis state has a probability amplitude equal to the integrated real classical frequency amplitude within the frequency range \(f_{\rm min}+[j\Delta f,(j+1)\Delta f)\). While the Newtonian waveform amplitude depends on the detector response, chirp-mass and source distance, only the frequency dependence is required in the encoding due to the normalisation, and therefore these terms are ignored such that \(\tilde{A}(f)\propto f^{-7/6}\). To demonstrate the state-preparation routine of Sec. II, we prepare a waveform with a Newtonian amplitude of Eq. 16 and a second post-Newtonian phase of Eq. 17, given a spinless (\(\beta=\sigma=0\)), near equal-mass system of \(m_{1}=35\,M_{\odot}\) and \(m_{2}=30\,M_{\odot}\) using IBM's quantum simulator and qiskit software [56]. This simulation is carried out on Python code that is publicly available on Github [57]. The simulation is run on a commercial computer with 7.9 gigabytes of available memory, allowing for simulations of up to 28 qubits when allowing complex numbers to be stored on 16 bytes. This waveform is sampled within the frequency interval \(f_{\rm min}=40\,\)Hz and \(f_{\rm max}=168\,\)Hz with \(\Delta f=2\,\)Hz, requiring \(n=6\) qubits. A value of \(\Delta T=0.02\,\)s is chosen. After the simulation, the output waveform state \(|\psi_{\rm out}\rangle\) is compared to the classically computed target waveform state \(|\psi_{\rm targ}\rangle\) and the _fidelity_\({\cal F}\) between the two states is calculated, defined as \(|\langle\psi_{\rm out}|\psi_{\rm targ}\rangle|^{2}\), such that \(1-\sqrt{{\cal F}}\) is synonymous with the _mismatch_ associated between templates as defined in [58] where the noise is flat across all frequencies. ### Amplitude preparation We demonstrate the preparation of the real amplitudes using both the Grover-Rudolph algorithm method and a parameterized quantum circuit trained using a generative adversarial network for this case. #### iii.1.1 Quantum generative adversarial network First the quantum generative adversarial network described in Sec. II.3 is applied for the case of \(n=6\). This is done by assuming the parameterized quantum circuit of Eq. 9. The parameterized circuit is trained using qiskit's quantum generative adversarial network implementation with _PyTorch_[59]. The classical learning is performed using the Adam optimizer with a learning rate of 0.01, and first and second momentum parameters of 0.7 and 0.999. The training was run for \(1,500\) iterations, taking \(10,000\) samples from the generated quantum state and the target distribution to pass to the classical discriminator. The results of the training are displayed in Fig. 3 for a network size of \(L=12\) and \(L=20\) in Fig. 3a and Fig. 3b respectively. For both cases, the loss function of both the generator and discriminator are plotted in the top panel (black and grey respectively) over training iterations, and can be seen to oscillate about an equilibrium of \(\sim\)0.7 as the decrease of loss of one network necessarily requires the increase of loss of the other. The bottom panels display the corresponding mismatch between states generated by the parameterised quantum circuit and the target state at different points of the training. The decrease in the mismatch between generated and target state corresponds to the loss functions of both generator and discriminator converging to the equilibrium values. Both networks converge to a similar mismatch of \(8.57\times 10^{-3}\) and \(8.36\times 10^{-3}\) for the case of \(L=12\) and \(L=20\) respectively. While not plotted, further training proved to result in a mismatch increase for both cases. The mismatch of Fig. 3a has a more gradual decline than Fig. 3b, where the convergence to a desired solution occurs more suddenly and generally after more training iterations. These two training cases exemplify a general trend found that while increasing the network size can improve the mismatch, the training becomes more sporadic and less stable. The work required to stabilize this training for larger network sizes is beyond the scope of this paper. The resulting amplitudes after applying the trained parameterized quantum circuit with \(L=20\) is shown in Fig. 4a scattered in black and compared to the target state shown as the solid black line, and the relative difference between the two amplitudes scattered in the bottom panel. The fidelity between the output state and the target state of \(0.983\) is achieved, corresponding to a mismatch of \(8.36\times 10^{-3}\). The simulation is performed using \(100\) controlled NOT gates. #### ii.1.2 Grover-Rudolph algorithm The amplitude preparation step using the Grover-Rudolph algorithm described in Sec. II.2 is applied to obtain the state described in Eq. 2. The circuit performing the operation \(\tilde{U}_{A}\) is shown in Fig. 5. The operation of Eq. 6 is performed using simple controlled \(Y\) rotation and \(X\) gates for \(m<5\), denoted \(\hat{R}_{Y}^{(m<5)}\), and a piece-wise linear function approximation applied to higher values. The size of the ancilla and coefficient registers is chosen so that \(n_{c}=9\) and \(n_{\mathrm{o}}=9\), and the domain of the function is divided into \(16\) sub-domains using \(n_{l}=4\) qubits where the boundaries of each sub-domain are spread uniformly between the domain of the function. After the application of the circuit shown in Fig. 5, the amplitude of the output state \(|F\rangle\) is plotted in the top panel of Fig. (b)b as black dots and compared to the target state shown as the solid black line. The fidelity between the output state and the target state is calculated to be \(0.999\) corresponding to a mismatch of \(4.1\times 10^{-4}\), while the relative difference in amplitude between each output and target frequency state is plotted in the bottom panel. Deviations from the target state are due to the limited number of ancillary qubits to store the rotation angles \(\zeta_{m,j}\), load the polynomial coefficients and define the sub-domains of the function, as well as the omission of higher order terms from the linear function approximation. The simulation is performed using \(23,796\) controlled NOT gates. ### Phase preparation For the phase preparation step, the operation \(\hat{Q}_{\Psi}\) of Eq. 12 is again applied by the piece-wise linear function approximation described in Sec. II.5. The sizes of the coefficient and ancillary registers are set to \(n_{c}=8\) and \(n_{\mathrm{a}}=10\) given the piece-wise function coefficients, while the label register size remains unchanged with \(n_{l}=4\). The resulting joint state across both the fre Figure 3: The top panel shows the loss over training iterations for the quantum generative adversarial network configuration for both the generator shown as the black solid line as defined in Eq. 10, and the discriminator in Eq. 11 as the grey solid line. The dialectic between both networks is represented by the loss, as they exhibit opposing gradients about an equilibrium of \(\sim\)0.7. The bottom panel shows the resulting generated quantum state mismatch with the target state amplitude of \(\tilde{A}(f)\propto f^{-7/6}\) over iterations. \((a)\) shows the training of a parameterized quantum circuit of \(L=12\) with \(78\) trainable parameters, which reaches a minimum mismatch of \(8.57\times 10^{-3}\). \((b)\) shows the training of a parameterized quantum circuit of \(L=20\) with \(126\) trainable parameters, which reaches a minimum mismatch of \(8.36\times 10^{-3}\). quency and ancillary register corresponds to a superposition in which each term has a single binary string representing \(\Psi^{\prime}\) stored in the ancilla registers, correlated to the corresponding frequency state in the frequency register. The \(\Psi^{\prime}\) values for each of the binary strings are scattered in the top panel of Fig. 7 across their corresponding frequency states and compared to the target function \(\Psi_{\text{PN}}/2\pi\), plotted as the solid black line. The resulting joint state amplitudes of Fig. 7 clearly follow a smooth continuous function comparable to the target function. The bottom panel shows the relative difference between the target function \(\Psi_{\text{PN}}/2\pi\) and those stored in the ancillary register, which deviate only such that \(|\Delta\Psi|<0.04\). The boundaries of the piece-wise polynomial function are shown as vertical dotted lines and are uniformly spread across the space. This step is simulated using \(9,464\) controlled NOT gates. The \(\hat{R}_{z}\) rotations of Eq. 15 are applied to the ancilla register that \(\Psi^{\prime}\) in the computational basis to produce the frequency dependent phase of Eq. 14. The ancilla register is then uncomputed of \(\Psi^{\prime}\) with the inverse piece-wise linear function, costing an additional \(9,464\) controlled NOT gates. With enough qubits to adequately account for the required precision of the multiplication operation, the uncomputing of \(\Psi^{\prime}\) leaves the ancillary and label register in a singular state of \(|0\rangle_{l}|0\rangle_{\text{a}}\), which can now be discarded from the circuit. Fig. 7(a) and Fig. 7(b) depicts the amplitudes of the final simulated states compared to the target state for when the trained parameterised quantum circuit of Fig. 2(b) and the Grover-Rudolph algorithm are used for amplitude preparation steps respectively. The real and imaginary parts of the target state are plotted as solid lines in their respective colours, with the difference between the output and target state displayed in the bottom panel. When the Grover-Rudolph algorithm is employed, the resulting state fidelity is \(\mathcal{F}=0.995\) with an associated mismatch of \(2.4\times 10^{-3}\) using \(42,724\) controlled NOT gates, while when the trained parameterised quantum circuit is used, the state fidelity is \(\mathcal{F}=0.979\) with a mismatch of \(1.0\times 10^{-2}\) using \(19,028\) controlled NOT gates. Figure 4: A scatter of simulated frequency state amplitude compared to the target state amplitudes of \(\tilde{A}(f)\propto f^{-7/6}\) shown as the solid black line in the top panel. The bottom panel shows the relative difference between the output and the target frequency states. \((a)\) shows the resulting amplitudes from simulating the parameterized quantum circuit of Eq. 9 after the training illustrated in Fig. 2(a). The resulting state fidelity is \(0.983\) with a mismatch of \(8.6\times 10^{-3}\). Discrepancies between the simulated and target state are mainly due to the limited size of the parameterized quantum circuit in this case. The number of controlled NOT gates used in the simulation is \(100\). \((b)\) shows the resulting amplitudes from simulating the circuit described in Fig. 5 resulting in a state fidelity of \(0.999\) and mismatch of \(4.1\times 10^{-4}\). Discrepancies between the two are caused by the limited number of qubits available for the arithmetic operations involved in the Grover-Rudolph algorithm when invoking the piece-wise linear function operation as well as the omission of second-order terms. The number of controlled NOT gates used is \(23,796\). ## IV Case study: Third generation gravitational wave detectors We consider the case of waveforms required for the application of data analysis methods given future detector data, with higher sensitivities than the detectors that are currently in operation. Detectors such as the Einstein Telescope will probe gravitational wave emissions at frequencies of as low as \(1-7\,\)Hz, where sources such as binary neutron star pairs can be apparent in the sensitive band for time periods of orders of days, a four orders of magnitude increase compared to current detectors [60]. The longer observation period allows for the orbital evolution of these systems to be studied in detail [15]. However, the increased sensitivity at lower frequencies for third generation detectors provide unique data analysis challenges and increases computational demand [61]. The longer duration signals require longer waveforms to perform coherent analyses, which is required to maximise sensitivity when considering a multi-detector network. If Figure 5: The circuit of the amplitude preparation step using the Grover-Rudolph algorithm where the steps for \(m=0,1,2,3,4\) are performed by controlled rotations of angles \(\zeta_{m,j}\) for all \(j=0,\ldots,2^{m}-1\) denoted by operation \(R_{y}^{(m<5)}\), while the operations for \(m=5\) are performed by the operations \(\hat{Q}_{\zeta}^{\dagger(m-1)}\hat{R}_{y}^{(m)}\hat{Q}_{\zeta}^{(m-1)}\). Figure 6: Quantum circuit for the phase preparation step where the function \(\Psi^{\prime}\) is encoded into the computational basis of the ancillary register \(|0\rangle_{\text{a}}\) through the operation \(\hat{Q}_{\Psi}\), implemented through the linear piece-wise function using coefficient and label registers \(|0\rangle_{c}\) and \(|0\rangle_{l}\). The phase \(e^{i\Psi(j)}\) on computational basis state \(|j\rangle\) is produced through \(Z\) rotations on the precision bits of the binary string stored in the ancillary register. Finally, the ancillary, label and coefficient registers are cleared by the inverse operation \(\hat{Q}_{\Psi}^{\dagger}\). Figure 7: The top panel shows a scatter of the simulated values of \(\Psi^{\prime}\) stored in the computational basis in the ancillary register for each frequency register state compared to the target function, plotted as the solid line. The boundaries of the piece-wise linear function domains are shown in the dashed vertical lines. The deviations between the values stored in the ancillary register and the target function are scattered in the bottom panel. The simulated states show a maximum deviation from the target function of \(|\Delta\Psi|<0.04\). The number of controlled NOT gates used in the simulation is \(9,464\). a sampling rate of 4096 Hz is considered, the memory requirements to store a single binary neutron star inspiral waveform can extend into the gigabytes. The majority of the matched filter signal-to-noise ratio accumulated by the Einstein telescope for binary neutron star inspirals will occur in the frequency region below 10 Hz [62]. The matched filtering algorithm used to perform signal detection requires applying the fast Fourier transform to each of the \(M\) templates which has a computational cost that scales as \(O(MN\log N)\)[24]. Therefore, given the size of the template bank \(M\) must also grow to account for these low frequency signals, where generally the number of templates in the bank scales proportional to \(f_{\rm min}^{-8/3}\) to maintain a constant mismatch between potential signals and templates [63], longer duration signals will pose a computational challenge to the signal detection process [61]. This is further confounded by the need for a higher dimensionality template bank to account for spin and tidal deformability effects that increase the signal strength of higher-order terms of the waveform [64]. By considering the method outlined in this work, the longest binary inspiral gravitational waveforms detectable to third generation detector, that require gigabytes of classical memory to store, can be stored on less than 32 qubits. Fig. 9 compares the gate cost of producing waveforms using this method when assuming \(n_{c}=16\), \(n_{l}=4\) and \(n_{a}=n+n_{c}\) to the cost of using the arbitrary state preparation routine. The black line shows the relative speed-up in terms of an arbitrary amplitude state preparation routine that requires \(2^{n}\) controlled NOT gates [65] when compared to the upper bound of controlled NOT gates of the analysis when using the Grover-Rudolph amplitude preparation routine specified in Eq. 66 of Appendix E. While the overhead gate cost ensures that such a routine is inefficient for waveforms of duration less than \(10^{3}\) s, the method demonstrates a clear reduction in gate cost which can reach two orders of magnitude when waveforms of durations of up to \(\sim\)10 days are considered. Waveforms of such durations are required for analysing low mass binary inspiral systems that are detectable by third generation detectors. We note that the computational cost of preparing a waveform can be reduced from that described in Fig. 9 Figure 8: The top panel shows the simulated real and imaginary amplitudes of the frequency register states, scattered in black and grey respectively. The simulated state amplitudes are compared to the target normalised gravitational waveform, plotted in black and grey solid lines. The deviations between the simulated and the target waveform are scattered in the bottom panel. \((a)\) shows the result after applying the trained parameterized quantum circuit to approximate the amplitude preparation routine as described in Sec. III.1.1. The simulated waveform has a fidelity of 0.979 and corresponding mismatch of 1.0\(\times 10^{-2}\) with the target state. The number of controlled NOT gates used in the simulation is \(19,028\). \((b)\) gives the same result but after the phase preparation routine described in Sec. III.2 after performing the Grover-Rudolph amplitude preparation routine described in Sec. III.1.2 where the simulated waveform has a fidelity of 0.995 and corresponding mismatch of \(2.4\times 10^{-3}\) with the target state. The number of controlled NOT gates used is \(42,724\). at the expense of fidelity of the resulting amplitude encoded waveform by reducing \(n_{c}\), \(n_{l}\), \(n_{a}\) or \(m_{b}\). Conversely the fidelity can be increased by increasing \(n_{c}\) or \(n_{l}\) with higher gate cost. The solid grey line of Fig. 9 depicts the relative speed-up when a trained parameterized quantum circuit like that of Eq. 9 with \(L=100\) layers of number of controlled NOT gates given in Eq. 11 when compared to the \(2^{n}\) controlled NOT gates of the arbitrary state preparation routine. The parameterised quantum circuit gains an order of magnitude reduction in controlled NOT gates when compared to the Grover-Rudolph algorithm amplitude preparation routine. While the application of quantum algorithms to directly address the data analysis problems of third generation detectors is a task left for future work, we illustrate the power of the state preparation routine by showing the longest duration binary neutron star inspiral observable to third generation detectors can be amplitude encoded onto less than 32 qubits with the aid of 68 ancillary qubits. This can be performed with an exponential speed-up over an arbitrary state preparation routine, a necessary condition to be met to qualify for any potential advantage of many quantum algorithms [31]. ## V Conclusion We provide an efficient routine for preparing amplitude encoded representations of the inspiral phase waveform of a gravitational wave signal emitted by the coalescence of a compact binary system. The routine is based on the use of either the Grover-Rudolph algorithm or a generative hybrid classical-quantum machine learning method, and the ability to efficiently evaluate arithmetic functions through a piece-wise linear approximation. We have demonstrated the application of this routine by simulating the preparation of a spinless 35 \(M_{\odot}\) and 30 \(M_{\odot}\) binary black-hole merger waveform in the frequency domain onto 6 qubits. The resulting state obtains a fidelity of 0.995 to the desired state when using the Grover-Rudolph algorithm method, which could further increase by increasing the number of available ancillary qubits, or assuming higher order polynomial approximations to evaluate the functions. A fidelity of 0.979 was demonstrated when a generative adversarial network was used instead of the Grover-Rudolph algorithm, leading to a significant reduction in the gate count. The resulting fidelity may be increased by training a larger parameterized circuit, however we demonstrate that training larger circuits requires more careful training regiments. The consideration of other generative modelling schemes with more stable training may be beneficial, such as adopting a normalizing flow model [66]. A further gate count reduction may be achieved by approximating the function evaluation step using a trained parameterised quantum circuit, rather than the current piece-wise function approximation that suffers from the high gate count required for arithmetic operations. Amplitude encoding allows for exponentially larger waveforms to be encoded onto the given number of qubits in comparison to other encoding formats, which may allow for waveforms of sizes comparable to those used for classical analyses on qubit numbers obtainable on quantum processors in the near future. We investigate this case when considering binary neutron star inspiral waveforms of lengths necessary for the analysis of signals from third generation detectors such as the Einstein Telescope. Such detectors will encounter computational challenges when probing lower frequencies with higher sensitivity detectors. We demonstrate that the state preparation method provides a greater speed-up over arbitrary state preparation methods the longer the waveform duration is, suggesting quantum advantages could be sought in this low frequency cut-off regime where the classical computational cost is greatest. While we mainly pose the use of this routine for preparing states that represent gravitational waveforms, the same routine can be applied to prepare other functions of the form in Eq. 12, including the merger and ring-down waveforms of gravitational wave binary merger events [67]. The adaption of this routine to perform state preparation of a combined inspiral, merger and ringdown Figure 9: Ratio of gate cost over duration when considering an arbitrary state preparation routine against the upper bound gate cost (see Appendix E) of preparing a inspiral waveform using the method described in Sec. II with \(n_{c}=16\), \(n_{l}=4\) and \(n_{a}=n+n_{c}\) using the Grover-Rudolph amplitude preparation routine plotted in black, and using a parameterised quantum circuit with \(L=100\) in grey. Long duration waveforms that are required for third generation detectors, which probe the signals at low frequencies, can be produced by a factor of up to four orders of magnitude less gates. waveform is left as future work. Our work demonstrates that efficient encoding of gravitational waveforms into quantum states with a number of qubits that scales only logarithmically with the length of the waveform is possible. This extremely space-efficient encoding offers the tantalising possibility of near-term applications of quantum computational devices to gravitational wave astronomy. While the waveforms may be efficiently prepared, we note that this is not the case for encoding the detector data itself. This will require an arbitrary state preparation routine to encode and induce a computational cost that scales as \(O(2^{n})\), which is unavoidable. Nonetheless, efficient encoding of template waveforms allows us to explore data analysis algorithms, with a potential speed-up in the training phase of machine learning approaches, or as a basis to construct measurements discriminating between signals in a measurement-based approach. We expect that our state preparation routine will find immediate applications in variational-based learning approaches to data analysis, as well as in the longer term to more sophisticated quantum protocols. ## VI Acknowledgements We are grateful for the support from the EPSRC under Grant No. EP/T001062/1. ## Appendix A Stationary phase approximation The waveforms that are represented analytically in the positive frequency-domain can be written: \[\tilde{h}(f)\propto\tilde{A}(f)e^{i\Phi(f)}, \tag{10}\] where \(\tilde{h}(f)\) is the Fourier transform of real-valued \(h(t)\): \[h(t)\propto\Re\left\{A(t)e^{-i\Phi(t)}\right\}, \tag{11}\] such that \(\tilde{h}(f)=\int h(t)e^{2\pi ift}dt\), and \(A\) and \(\tilde{A}\) are real functions. Commonly, \(\tilde{h}(f)\) can be approximated from an analytical expression of Eq. 11 using the stationary phase approximation [68] such that \[\tilde{A}(f)\mathrel{\hbox to 0.0pt{\lower 4.0pt\hbox{ $\sim$}}\raise 1.0pt \hbox{$<$}}A(t_{0})\left(\frac{d^{2}\Phi(t_{0})}{dt^{2}}\right)^{1/2} \tag{12}\] and \[\Psi(f)\approx 2\pi ft_{0}-\phi(f)-\frac{\pi}{4}, \tag{13}\] where \(t_{0}\) is the time at which \(d\Phi(t)/dt|_{t_{0}}=2\pi f\), at which point \(A(t)\) varies slowly. The function \(\phi(f)\) can be determined from \(\Phi(t)\) given the frequency dependence on time through \(\Phi(t)=\int^{t}fdt^{\prime}\). ## Appendix B Gravitational waves from compact binary inspirals Much of the following background is based on the work presented in Refs. [69; 55]. The gravitational waveform is entirely determined through general relativity. However, solutions to the non-linear Einstein field equations can only be found numerically, and analytical forms of the waveforms can only be approximated. For compact binary systems, analytical waveforms are commonly determined using a post-Newtonian approximation in the near-field of the orbital system, while a post-Minkowskian approximation is made to the surrounding field [70]. Solutions are expanded about \((v/c)^{2}\), where \(v\!\ll\!c\) is the orbital velocity. Taking only the leading-order terms leads to a 'Newtonian' waveform which describes gravitational radiation produced solely from the change in the mass-quadrupole moment of the binary system, with frequency twice that of the orbital frequency [71]. However, such a solution becomes inaccurate in systems with high mass ratios, component spins, or as the orbital velocity increases for systems with shorter separation where higher-order modes are excited. This requires higher-order terms to be considered, leading to 'post-Newtonian' waveforms. Analytical waveforms are also often formed through fitting phenomenological models to sets of waveforms determined through numerical relativity [67]. For the remainder of this section, geometric units can be assumed such that \(G=c=1\). Gravitational radiation amplitudes depend on two independent polarization states denoted '+' and '\(\times\)', separated by an angle of \(\pi/4\) from one another. For a binary system of compact objects, these polarization amplitudes depend on the inclination \(\iota\) of the system's angular momentum vector with respect to the line-of-sight, such that \[h_{+}= \frac{h_{0}}{2}(1+\cos^{2}\iota)\cos\Phi(t), \tag{14}\] \[h_{\times}= h_{0}\cos\iota\sin\Phi(t). \tag{15}\] The common amplitude \(h_{0}\) is equal to \[h_{0}\approx\frac{\mathcal{M}^{5/3}(2\pi f)^{2/3}}{D}. \tag{16}\] Here \(\mathcal{M}\) is the chirp-mass, related to the total mass \(M=m_{1}+m_{2}\) and reduced mass \(\eta=m_{1}m_{2}/(m_{1}+m_{2})\) of the system of component masses \(m_{1,2}\) by \(\mathcal{M}=\eta^{3/5}M^{2/5}\), and \(D\) is the distance to the source. To induce a time-dependent strain on a detector, the polarization amplitudes couple to the detector's response to each polarization \(F_{+,\times}\) and combine linearly: \[h(t)=F_{+}h_{+}+F_{\times}h_{\times}=Qh_{0}\cos(\Phi(t)-\Phi_{0}). \tag{17}\] This can be rewritten as \[h(t)=Qh_{0}\cos(\Phi(t)-\Phi_{0}), \tag{18}\] where \(Q=(A_{+}^{2}+A_{\times}^{2})^{1/2}\), and \(\Phi_{0}=\arctan(A_{\times}/A_{+})\), given \(A_{+}=F_{+}(1+\cos^{2}\iota)/2\) and \(A_{\times}=F_{\times}\cos\iota\). The expression in Eq. 10 is in the form of Eq. 9. The spin of the binary system is parameterised by the spin-orbit parameter: \[\beta=\frac{1}{12}\sum_{i=1}^{2}\mathbf{L}\cdot\mathbf{\chi}_{i}[113(m_{i}/M)^{2}+75 \eta], \tag{11}\] and spin-spin parameter \[\sigma=\frac{\eta}{48}\left(721(\mathbf{L}\cdot\mathbf{\chi}_{1}\mathbf{L}\cdot\mathbf{\chi}_{ 2})-247(\mathbf{\chi}_{1}\cdot\mathbf{\chi}_{2})\right). \tag{12}\] Here, \(\mathbf{\chi}_{1,2}=\mathbf{S}_{1,2}/m_{1,2}^{2}\) where \(\mathbf{S}_{1,2}\) is the spin angular momentum of bodies 1 and 2, which is compared against the orbital angular momentum of the system \(\mathbf{L}\). The time-frequency dependence to second post-Newtonian order is \[\frac{df}{dt}=\frac{96}{5\pi\mathcal{M}^{2}}(\pi\mathcal{M}f)^{1 /3}\left[1-\left(\frac{743}{336}+\frac{11}{4}\eta\right)(\pi Mf)^{2/3}\right.\\ \left.+(4\pi-\beta)(\pi Mf)+\left(\frac{34103}{18144}+\frac{13661 }{2016}\eta+\frac{59}{18}\eta^{2}+\sigma\right)(\pi Mf)^{4/3}\right]. \tag{13}\] From Eq. 10, the frequency dependence on time can be calculated, giving the phase as \(\Phi(t)=\int^{t}fdt^{\prime}\) from which Eq. 17 is calculated from Eq. 11. The time-frequency relation can be inverted allowing for \(\phi(f)=\Phi(t(f))\) to be determined, resulting in the expression for the frequency dependent amplitude of Eq. 16 given Eq. 12. ## Appendix C Fixed-point binary encoding Our routine to prepare the state of Eq. 1 requires binary strings to be encoded in the computational basis using _signed-magnitude_ (and unsigned-magnitude) and _two's-complement_ representations, which we detail here. We represent signed binary numbers in a bit-strings of \(n\) bits with the ordering: \[x=\underbrace{x_{n-1}}_{\text{Sign bit}}\underbrace{x_{n-2}\dots x_{n-n_{ \text{int}}-1}}_{n_{\text{int integer bits}}}\underbrace{x_{p-1}\dots x_{0}}_{p \text{ precision bits}},\] so that the sign of the number is represented in the leading order bit, the integer part in the following \(n_{\text{int}}\) bits, and the fraction part in the final \(p\) precision bits. Note that while \(n_{\text{int}}\) and \(p\) must follow the condition that \(n=n_{\text{int}}+p+1\), the values are not restricted to positive numbers, allowing for the precision \(2^{-p}\geq 1\) or the upper bound to \(x\) that the bit-string can represent to be \(2^{n_{\text{int}}}\leq 1\). ### Unsigned-magnitude representation When only the magnitude of \(x\) is required, the sign bit is dropped and the representation of the number is simply: \[x=\sum_{i=0}^{n-1}x_{i}2^{i-p}.\] ### Signed-magnitude representation Positive and negative numbers of equal magnitude are related by flipping the leading order bit (the sign bit) so that: \[x=(-1)^{x_{n-1}}\sum_{i=0}^{n-2}x_{i}2^{i-p}.\] Note that this representation includes both a positive and negative value for zero. ### Two's-complement representation Negative numbers are related to positive values of equal magnitude by a bit-flip of all bits and incrementing the result by the least significant bit (equivalent to the addition of \(2^{-p}\)): \[x=-x_{n-1}2^{n_{\text{int}}}+\sum_{i=0}^{n-2}x_{i}2^{i-p}.\] ## Appendix D Fixed-point multiplication through the quantum Fourier transform The multiplication of fixed-point numbers can be carried out without ancillary qubits through the use of the quantum Fourier transform. The multiplicand is stored in state \(|a\rangle\) and the multiplier in \(|b\rangle\). A third, initially empty, output register \(|0\rangle_{o}\) is required to store the product such that \[|a\rangle|b\rangle|0\rangle_{o}\xrightarrow{\text{Mult}}|a\rangle|b\rangle|ab \rangle_{o}.\] Like classical multiplication algorithms, the multiplication is performed by a series of additions of \(|a\rangle\) onto \(|0\rangle_{o}\) of a number depending on \(|b\rangle\). However, here we perform the additions to \(|0\rangle_{o}\) by first performing the quantum Fourier transform across the register. The addition of \(|a\rangle\) onto the output register while in the conjugate basis space is then a series of controlled rotation operations. The details of how these additions are performed is given in Ref. [72], which is expanded to multiplication by further controlling the rotational addition operations on the multiplier \(|b\rangle\). Similar to [52], we simplify the multiplication by asserting that the multiplicand is positive, and the result is processed conditioned on the most significant qubit; if the multiplier is negative (the most significant qubit is \(|1\rangle\)), the output is bit-flipped and incremented by 1 to correspond with negative values in the two's complement notation. As the multiplication product is encoded in the conjugate basis in two's-complement representation, the following addition operation of Fig. 2 is applied independently of the product's sign. ## Appendix E Gate cost An upper bound to the number of controlled \(X\) gates can be assigned to each of the operations used in the the state preparation routine. This upper bound could be reduced by optimising the implementation of each of the operations or by introducing additional ancillary qubits. However, we provide the upper bound when assuming the form of each operation as used to perform the quantum simulation described in Sec. III. For the multiplication of a register of length \(n_{1}\) on one of \(n_{2}\) where the result is stored on a register of length \(n_{1}+n_{2}\), the upper bound to the number of controlled \(X\) gates is: \[C_{\text{Mult}}(n_{1},n_{2})= 8(n_{1}+n_{2})n_{2}(n_{1}-1)\] \[+20(n_{1}+n_{2})^{2}\] \[-13(n_{1}+n_{2}). \tag{10}\] Similarly the addition of registers of length \(n_{1}\) and \(n_{2}\), where the result is stored on the second register requires: \[C_{\text{Add}}(n_{1},n_{2})=2n_{1}n_{2}+2n_{2}(n_{2}-1). \tag{11}\] The label operation when utilizing the quantum Fourier transform is bound by: \[C_{\text{Label}}(n,n_{l})=2n_{l}(n_{l}-1)+2^{n_{l}+1}(6n+n_{l}+1). \tag{12}\] The inputting of the piece-wise function coefficients requires: \[C_{\text{X}}(n_{c},n_{l})=n_{c}2^{n_{l}}C_{C^{\otimes n}X}(n_{l}), \tag{13}\] where \(C_{C^{\otimes n}X}\) is the number of controlled \(X\) gates required to perform a \(n\)-controlled \(X\) operation. Without the use of ancillary qubits \(C_{C^{\otimes n}X}(n_{l})=2n_{l}^{2}-6n_{l}+5\)[73], otherwise \(C_{C^{\otimes n}X}(n_{l})=20(n_{l}-2)\) with the use of \(n-2\) ancillary qubits [74] or \(12(n_{l}-1)+1\) with \(n-1\) ancillary qubits [19]. The linear piece-wise function (as shown in Fig. 2) is then constrained by: \[C_{\text{LPF}}(n,n_{c},n_{l})= C_{\text{Mult}}(n_{c},n)+C_{\text{Add}}(n_{c},n_{c}+n)\] \[+C_{\text{Label}}(n,n_{l})+3C_{\text{X}}(n_{c},n_{l}) \tag{14}\] Then the upper bound on the combined amplitude and phase preparation steps is placed when assuming \(m_{a}=1\) and \(m_{b}=n\): \[C_{\text{GW}}(n,n_{c},n_{l})= 2\sum_{m=1}^{n}C_{\text{LPF}}(m,n_{c},n_{l})+2(n+n_{c}(n-1)). \tag{15}\] If a trained parameterized quantum circuit is used, the amplitude preparation step can be reduced to \(L(n-1)\) controlled \(X\) gates, reducing the total count to: \[C_{\text{GW}}(n,n_{c},n_{l})= 2C_{\text{LPF}}(n,n_{c},n_{l})+L(n-1). \tag{16}\]

2304.09045

The Bohr compactification of an arithmetic group

Given a group $\Gamma,$ its Bohr compactification $\operatorname{Bohr}(\Gamma)$ and its profinite completion $\operatorname{Prof}(\Gamma)$ are compact groups naturally associated to $\Gamma$; moreover, $\operatorname{Prof}(\Gamma)$ can be identified with the quotient of $\operatorname{Bohr}(\Gamma)$ by its connected component $\operatorname{Bohr}(\Gamma)_0.$ We study the structure of $\operatorname{Bohr}(\Gamma)$ for an arithmetic subgroup $\Gamma$ of an algebraic group $G$ over $\mathbf{Q}$. When $G$ is unipotent, we show that $\operatorname{Bohr}(\Gamma)$ can be identified with the direct product $\operatorname{Bohr}(\Gamma^{\rm Ab})_0\times \operatorname{Prof}(\Gamma)$, where $\Gamma^{\rm Ab}= \Gamma/[\Gamma, \Gamma]$ is the abelianization of $\Gamma.$ In the general case, using a Levi decomposition $G= U\rtimes H$ (where $U$ is unipotent and $H$ is reductive), we show that $\operatorname{Bohr}(\Gamma)$ can be described as the semi-direct product of a certain quotient of $\operatorname{Bohr}(\Gamma\cap U)$ with $\operatorname{Bohr}(\Gamma \cap H)$. When $G$ is simple and has higher $\mathbf{R}$-rank, $\operatorname{Bohr}(\Gamma)$ is isomorphic, up to a finite group, to the product $K\times \operatorname{Prof}(\Gamma),$ where $K$ is the maximal compact factor of the real Lie group $G(\mathbf{R}).$

Bachir Bekka

2023-04-18T15:07:51Z

http://arxiv.org/abs/2304.09045v1

# The Bohr compactification of an arithmetic group ###### Abstract. Given a group \(\Gamma\), its Bohr compactification \(\operatorname{Bohr}(\Gamma)\) and its profinite completion \(\operatorname{Prof}(\Gamma)\) are compact groups naturally associated to \(\Gamma\); moreover, \(\operatorname{Prof}(\Gamma)\) can be identified with the quotient of \(\operatorname{Bohr}(\Gamma)\) by its connected component \(\operatorname{Bohr}(\Gamma)_{0}\). We study the structure of \(\operatorname{Bohr}(\Gamma)\) for an arithmetic subgroup \(\Gamma\) of an algebraic group \(\mathbf{G}\) over \(\mathbf{Q}\). When \(\mathbf{G}\) is unipotent, we show that \(\operatorname{Bohr}(\Gamma)\) can be identified with the direct product \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}\times\operatorname{Prof}(\Gamma)\), where \(\Gamma^{\operatorname{Ab}}=\Gamma/[\Gamma,\Gamma]\) is the abelianization of \(\Gamma\). In the general case, using a Levi decomposition \(\mathbf{G}=\mathbf{U}\rtimes\mathbf{H}\) (where \(\mathbf{U}\) is unipotent and \(\mathbf{H}\) is reductive), we show that \(\operatorname{Bohr}(\Gamma)\) can be described as the semi-direct product of a certain quotient of \(\operatorname{Bohr}(\Gamma\cap\mathbf{U})\) with \(\operatorname{Bohr}(\Gamma\cap\mathbf{H})\). When \(\mathbf{G}\) is simple and has higher \(\mathbf{R}\)-rank, \(\operatorname{Bohr}(\Gamma)\) is isomorphic, up to a finite group, to the product \(K\times\operatorname{Prof}(\Gamma)\), where \(K\) is the maximal compact factor of \(\mathbf{G}(\mathbf{R})\). 2000 Mathematics Subject Classification: 22D10; 22C05; 20E18 The author acknowledges the support by the ANR (French Agence Nationale de la Recherche) through the project Labex Lebesgue (ANR-11-LABX-0020-01) ## 1. Introduction Given a topological group \(G\), the **Bohr compactification** of \(G\) is a pair \((\operatorname{Bohr}(G),\beta)\) consisting of a compact (Hausdorff) group \(\operatorname{Bohr}(G)\) and a continuous homomorphism \(\beta:G\to\operatorname{Bohr}(G)\) with dense image, satisfying the following universal property: for every compact group \(K\) and every continuous homomorphism \(\alpha:G\to K\), there exists a continuous homomorphism \(\alpha^{\prime}:\,\operatorname{Bohr}(G)\to K\) such that the diagram commutes. The pair \((\operatorname{Bohr}(G),\beta)\) is unique in the following sense: if \((K^{\prime},\beta^{\prime})\) is a pair consisting of a compact group \(K^{\prime}\) and a continuous homomorphism \(\beta^{\prime}:G\to K^{\prime}\) with dense image satisfying the same universal property (such a pair will be called a Bohr compactification of \(G\)), then there exists an isomorphism \(\alpha:\operatorname{Bohr}(G)\to K^{\prime}\) of topological groups such that \(\beta^{\prime}=\alpha\circ\beta\). The compact group \(\operatorname{Bohr}(G)\) was first introduced by A. Weil ([12, Chap.VII]) as a tool for the study of almost periodic functions on \(G\), a subject initiated by H. Bohr ([1], [2]) in the case \(G=\mathbf{R}\) and generalized to other groups by J. von Neumann ([13]) among others. For more on this subject, see [14, SS16] or [BH, 4.C]). The group \(\operatorname{Bohr}(\Gamma)\) has been determined for only very few non abelian _discrete_ groups \(\Gamma\) (for some general results, see [15] and [18]; for the well-known case of abelian groups, see [1] and Section 11). In contrast, there is a second much more studied completion of \(\Gamma\), namely the **profinite completion** of \(\Gamma\), which is a pair \((\operatorname{Prof}(\Gamma),\alpha)\) consisting of a profinite group (that is, a projective limit of finite groups) \(\operatorname{Prof}(\Gamma)\) satisfying a similar universal property with respect to such groups, together with a homomorphism with \(\alpha:\Gamma\to\operatorname{Prof}(\Gamma)\) with dense image. The group \(\operatorname{Prof}(\Gamma)\) can be realized as the projective limit \(\varprojlim\Gamma/H\), where \(H\) runs over the family of the normal subgroups of finite index of \(\Gamma\). For all this, see [11]. The universal property of \(\operatorname{Bohr}(\Gamma)\) gives rise to a continuous epimorphism \(\alpha^{\prime}:\operatorname{Bohr}(\Gamma)\to\operatorname{Prof}(\Gamma).\) It is easy to see (see Proposition 7 below) that the kernel of \(\alpha^{\prime}\) is \(\operatorname{Bohr}(\Gamma)_{0}\), the connected component of \(\operatorname{Bohr}(\Gamma)\); so, we have a short exact sequence In this paper, we will deal with the case where \(\Gamma\) is an arithmetic subgroup in a linear algebraic group. The setting is as follows. Let \(\mathbf{G}\) be a connected linear algebraic group over \(\mathbf{Q}\) with a fixed faithful representation \(\rho:\mathbf{G}\to GL_{m}.\) We consider the subgroup \(\mathbf{G}(\mathbf{Z})\) of the group \(\mathbf{G}(\mathbf{Q})\) of \(\mathbf{Q}\)-points of \(\mathbf{G}\), that is, \[\mathbf{G}(\mathbf{Z})=\rho^{-1}\left(\rho(\mathbf{G})\cap GL_{m}(\mathbf{Z}) \right).\] A subgroup \(\Gamma\) of \(\mathbf{G}(\mathbf{Q})\) is called an **arithmetic subgroup** if \(\Gamma\) is commensurable to \(\mathbf{G}(\mathbf{Z})\), that is, \(\Gamma\cap\mathbf{G}(\mathbf{Z})\) has finite index in both \(\Gamma\) and \(\mathbf{G}(\mathbf{Z})\). Observe that \(\Gamma\) is a discrete subgroup of the real Lie group \(\mathbf{G}(\mathbf{R})\). We first deal with the case where \(\mathbf{G}\) is unipotent. More generally, we describe the Bohr compactification of any finitely generated nilpotent group. Observe that an arithmetic subgroup in a unipotent algebraic \(\mathbf{Q}\)-group is finitely generated (see Corollary 2 of Theorem 2.10 in [10]). For two topological groups \(H\) and \(L\), we write \(H\cong L\) if \(H\) and \(L\) are topologically isomorphic. We observe that, when \(\Delta\) is a finitely generated abelian group, \(\mathrm{Bohr}(\Delta)\) splits as a direct sum \(\mathrm{Bohr}(\Delta)=\mathrm{Bohr}(\Delta)_{0}\oplus\mathrm{Prof}(\Delta)\); see Proposition 11. **Theorem 1**.: _Let \(\Gamma\) be a finitely generated nilpotent group. We have a direct product decomposition_ \[\mathrm{Bohr}(\Gamma)\cong\mathrm{Bohr}(\Gamma^{\mathrm{Ab}})_{0}\times \mathrm{Prof}(\Gamma),\] _where \(\Gamma^{\mathrm{Ab}}=\Gamma/[\Gamma,\Gamma]\) is the abelianization of \(\Gamma.\) This isomorphism is induced by the natural maps \(\Gamma\to\mathrm{Bohr}(\Gamma^{\mathrm{Ab}})\) and \(\Gamma\to\mathrm{Prof}(\Gamma),\) together with the projection \(\mathrm{Bohr}(\Gamma^{\mathrm{Ab}})\to\mathrm{Bohr}(\Gamma^{\mathrm{Ab}})_{0}.\)_ A crucial tool in the proof of Theorem 1 is the fact that elements in the commutator subgroup \([\Gamma,\Gamma]\) of a nilpotent group \(\Gamma\) are distorted (see Proposition 15). We now turn to the case of a general algebraic group \(\mathbf{G}\) over \(\mathbf{Q}.\) Let \(\mathbf{U}\) be the unipotent radical of \(\mathbf{G}\). Then \(\mathbf{U}\) is defined over \(\mathbf{Q}\) and there exists a connected reductive \(\mathbf{Q}\)-subgroup \(\mathbf{H}\) such that we have a **Levi decomposition** as semi-direct product \(\mathbf{G}=\mathbf{U}\rtimes\mathbf{H}\) (see [14]). The group \(\Lambda=\mathbf{H}(\mathbf{Z})\) acts by automorphisms on \(\Delta=\mathbf{U}(\mathbf{Z})\) and hence on \(\mathrm{Bohr}(\Delta)\), by the universal property of \(\mathrm{Bohr}(\Delta).\) In general, this action does not extend to an action of \(\mathrm{Bohr}(\Lambda)\) on \(\mathrm{Bohr}(\Delta).\) However, as we will see below (proof of Theorem 2), \(\mathrm{Bohr}(\Lambda)\) acts naturally by automorphisms on an appropriate quotient of \(\mathrm{Bohr}(\Delta).\) Observe that (see [1, Corollary 4.6]) every arithmetic subgroup of \(\mathbf{G}(\mathbf{Q})\) is commensurable to \(\Delta(\mathbf{Z})\rtimes\mathbf{H}(\mathbf{Z}).\) Recall that two topological groups \(G_{1}\) and \(G_{2}\) are (abstractly) commensurable if there exist finite index subgroups \(H_{1}\) and \(H_{2}\) of \(G_{1}\) and \(G_{2}\) such that \(H_{1}\) is topologically isomorphic to \(H_{1}.\) If this is the case, then \(\mathrm{Bohr}(G_{1})\) and \(\mathrm{Bohr}(G_{2})\) are commensurable; in fact, each one of the groups \(\mathrm{Bohr}(G_{1})\) or \(\mathrm{Bohr}(G_{2})\) can be described in terms of the other (see Propositions 8 and 9 ). For this reason, we will often deal with only one chosen representative of the commensurability class of an arithmetic group. **Theorem 2**.: _Let \(\mathbf{G}\) be a connected linear algebraic group over \(\mathbf{Q},\) with Levi decomposition \(\mathbf{G}=\mathbf{U}\rtimes\mathbf{H}.\) Set \(\Lambda:=\mathbf{H}(\mathbf{Z}),\Delta:=\mathbf{U}(\mathbf{Z}),\) and \(\Gamma:=\Delta\rtimes\Lambda.\) Let \(\widehat{\Delta^{\mathrm{Ab}}}_{\Lambda-\mathrm{fin}}\) be the subgroup of the dual group \(\widehat{\Delta^{\mathrm{Ab}}}\) of \(\Delta^{\mathrm{Ab}}\) consisting of the characters with finite \(\Lambda\)-orbit. We have a semi-direct decomposition_ \[\mathrm{Bohr}(\Gamma)\cong(Q\times\mathrm{Prof}(\Delta))\rtimes\mathrm{Bohr}( \Lambda),\] _where \(Q\) is the connected component of \(\mathrm{Bohr}(\Delta^{\mathrm{Ab}})/N\) and \(N\) is the annihilator of \(\widehat{\Delta^{\mathrm{Ab}}}_{\Lambda-\mathrm{fin}}\) in \(\mathrm{Bohr}(\Delta^{\mathrm{Ab}})\). This isomorphism is induced by the natural homomorphisms \(\Delta\to\mathrm{Bohr}(\Delta^{\mathrm{Ab}})/N\) and \(\Lambda\to\mathrm{Bohr}(\Lambda).\)_ Theorems 1 and 2 reduce the determination of \(\mathrm{Bohr}(\Gamma)\) for an arithmetic group \(\Gamma\) in \(\mathbf{G}\) to the case where \(\mathbf{G}\) is reductive. We have a further reduction to the case where \(\mathbf{G}\) is simply connected and almost simple. Indeed, recall that a group \(L\) is the **almost direct product** of subgroups \(L_{1},\ldots,L_{n}\) if the product map \(L_{1}\times\cdots\times L_{n}\to L\) is a surjective homomorphism with finite kernel. Let \(\mathbf{G}\) be a connected reductive algebraic group over \(\mathbf{Q}.\) The commutator subgroup \(\mathbf{L}:=[\mathbf{G},\mathbf{G}]\) of \(\mathbf{G}\) is a connected semi-simple \(\mathbf{Q}\)-group and \(\mathbf{G}\) is an almost direct product \(\mathbf{G}=\mathbf{T}\mathbf{L}\) for a central \(\mathbf{Q}\)-torus \(\mathbf{T}\) (see (14.2) and (18.2) in [1]) Moreover, \(\mathbf{L}\) is an almost direct product \(\mathbf{L}=\mathbf{L}_{1}\cdots\mathbf{L}_{n}\) of connected almost \(\mathbf{Q}\)-simple \(\mathbf{Q}\)-subgroups \(\mathbf{L}_{i}\), called the almost \(\mathbf{Q}\)-simple factors of \(\mathbf{L}\) (see [1, (22.10)]). For every \(i\in\{1,\ldots,n\}\), let \(\widetilde{\mathbf{L}}_{i}\) be the simply connected covering group \(\mathbf{L}_{i}.\) Set \(\widetilde{\mathbf{G}}=\mathbf{T}\times\widetilde{\mathbf{L}_{1}}\times \cdots\times\widetilde{\mathbf{L}_{n}}.\) Let \(\widetilde{\Gamma}\) be the arithmetic subgroup \(\mathbf{T}(\mathbf{Z})\times\widetilde{\mathbf{L}_{1}}(\mathbf{Z})\times \cdots\times\widetilde{\mathbf{L}_{n}}(\mathbf{Z})\) in \(\widetilde{\mathbf{G}}(\mathbf{Q}).\) The image \(\Gamma\) of \(\widetilde{\Gamma}\) under the isogeny \(p:\widetilde{\mathbf{G}}\to\mathbf{G}\) is an arithmetic subgroup of \(\mathbf{G}(\mathbf{Q})\) (see Corollaries 6.4 and 6.11 in [1]). The map \(p:\widetilde{\Gamma}\to\Gamma\) induces an isomorphism \(\mathrm{Bohr}(\Gamma)\cong\mathrm{Bohr}(\widetilde{\Gamma})/F\), where \(F\) is the finite normal subgroup \(F=\widetilde{\beta}(\ker p)\) and \(\widetilde{\beta}:\widetilde{\Gamma}\to\mathrm{Bohr}(\widetilde{\Gamma})\) is the natural map (see Proposition 10). As an easy consequence of Margulis' superrigidity results, we give a description of the Bohr compactification of an arithmetic lattice in a simple algebraic \(\mathbf{Q}\)-group \(\mathbf{G}\) under a higher rank assumption. Such a description does not seem possible for arbitrary \(\mathbf{G}\). For instance, the free non abelian group \(F_{2}\) on two generators is an arithmetic lattice in \(SL_{2}(\mathbf{Q})\), but we know of no simple description of \(\mathrm{Bohr}(F_{2})\). **Theorem 3**.: _Let \(\mathbf{G}\) be a connected, simply connected, and almost simple \(\mathbf{Q}\)-group. Assume that the real semisimple Lie group \(\mathbf{G}(\mathbf{R})\) is not locally isomorphic to any group of the form \(SO(m,1)\times K\) or \(SU(m,1)\times K\) for a compact Lie group \(K\). Let \(\mathbf{G}_{\mathrm{nc}}\) be the product of the almost \(\mathbf{R}\)-simple factors \(\mathbf{G}_{i}\) of \(\mathbf{G}\) for which \(\mathbf{G}_{i}(\mathbf{R})\) is non compact. Let \(\Gamma\subset\mathbf{G}(\mathbf{Q})\) be an arithmetic subgroup. We have a direct product decomposition_ \[\mathrm{Bohr}(\Gamma)\cong\mathrm{Bohr}(\Gamma)_{0}\times\mathrm{Prof}(\Gamma)\] _and an isomorphism_ \[\mathrm{Bohr}(\Gamma)_{0}\cong\mathbf{G}(\mathbf{R})/\mathbf{G}_{\mathrm{nc}}( \mathbf{R}),\] _induced by the natural maps \(\Gamma\to\mathbf{G}(\mathbf{R})/\mathbf{G}(\mathbf{R})_{\mathrm{nc}}\) and \(\Gamma\to\mathrm{Prof}(\Gamma)\)._ A group \(\Gamma\) as in Theorem 3 is an irreducible lattice in the Lie group \(G=\mathbf{G}(\mathbf{R})\), that is, the homogeneous space \(G/\Gamma\) carries a \(G\)-invariant probability measure; moreover, \(\Gamma\) is cocompact in \(G\) if and only if \(\mathbf{G}\) is anisotropic over \(\mathbf{Q}\) (for all this, see [1, (7.8), (11.6)]). The following corollary is a direct consequence of Theorem 3 and of the fact that a non cocompact arithmetic lattice in a semisimple Lie group has nontrivial unipotent elements (see [12, (5.5.14)]). **Corollary 4**.: _With the notation as in Theorem 3, assume that \(\mathbf{G}\) is isotropic over \(\mathbf{Q}.\) For every arithmetic subgroup \(\Gamma\) of \(\mathbf{G}(\mathbf{Q}),\) the natural map \(\operatorname{Bohr}(\Gamma)\to\operatorname{Prof}(\Gamma)\) is an isomorphism._ As shown in Section 6, it may happen that \(\operatorname{Bohr}(\mathbf{G}(\mathbf{Z}))\cong\operatorname{Prof}(\mathbf{G }(\mathbf{Z})),\) even when \(\mathbf{G}(\mathbf{Z})\) is cocompact in \(\mathbf{G}(\mathbf{R}).\). A general arithmetic lattice \(\Gamma\) has a third completion: the **congruence completion**\(\operatorname{Cong}(\Gamma)\) of \(\Gamma\) is the projective limit \(\varprojlim\Gamma/H,\) where \(H\) runs over the family of the congruence subgroups of \(\Gamma;\) recall that a normal subgroup of \(\Gamma\) is a congruence subgroup if it contains the kernel of the map \(\mathbf{G}(\mathbf{Z})\to\mathbf{G}(\mathbf{Z}/N\mathbf{Z})\) of the reduction modulo \(N,\) for some integer \(N\geq 1.\) There is a natural surjective homomorphism \(\pi:\operatorname{Prof}(\Gamma)\to\operatorname{Cong}(\Gamma)\). The so-called **congruence subgroup problem** asks whether \(\pi\) is injective and hence an isomorphism of topological groups; more generally, one can ask for a description of the kernel of \(\pi.\) This problem has been extensively studied for arithmetic subgroups (and, more generally, for \(S\)-arithmetic subgroups) in various algebraic groups; for instance, it is known that \(\pi\) is an isomorphism when \(\Gamma=SL_{n}(\mathbf{Z})\) for \(n\geq 3\) or \(\Gamma=Sp_{2n}(\mathbf{Z})\) for \(n\geq 2\) (see [1]); moreover, the same conclusion is true when \(\Gamma=\mathbf{T}(\mathbf{Z})\) for a torus \(\mathbf{T}\) (see [1]) and when \(\Gamma=\mathbf{U}(\mathbf{Z})\) for a unipotent group \(\mathbf{U}\) (see Proposition 16 below). For more on the congruence subgroup problem, see for instance [10] or [11, SS9.5]. This paper is organized as follows. In Section 2, we establish some general facts about the Bohr compactifications of commensurable groups and the relationship between Bohr compactifications and unitary representations; we also give an explicit description of the Bohr compactification for a finitely generated abelian group. In Section 3, we give the proof of Theorem 1. Section 4 contains the proof of Theorem 2 and Section 5 the proof of Theorem 3. Section 6 is devoted to the explicit computation of the Bohr compactification for various examples of arithmetic groups. ## 2. Some preliminaries ### Bohr compactifications and unitary representations Given a topological group \(G,\) we will consider finite dimensional unitary representations of \(G,\) that is, continuous homomorphisms \(G\to U(n)\). Two such representations are equivalent if they are conjugate by a unitary matrix. A representation \(\pi\) is irreducible if \(\mathbf{C}^{n}\) and \(\{0\}\) there are only \(\pi(G)\)-invariant subspaces of \(\mathbf{C}^{n}\). We denote by \(\operatorname{Rep}_{\operatorname{fd}}(G)\) the set of equivalence classes of finite dimensional unitary representations of \(G\) and by \(\widehat{G}_{\operatorname{fd}}\) the subset of irreducible ones. Every \(\pi\in\operatorname{Rep}_{\operatorname{fd}}(G)\) is a direct sum of representations from \(\widehat{G}_{\operatorname{fd}}\) When \(K\) is a compact group, every irreducible unitary representation of \(K\) is finite dimensional and \(\widehat{K}_{\operatorname{fd}}=\widehat{K}\) is the unitary dual space of \(K.\) By the Peter-Weyl theorem, \(\widehat{K}\) separates the points of \(K\). Let \(\beta:G\to H\) be a a continuous homomorphism of topological groups \(G\) and \(H\) with dense image; then \(\beta\) induces _injective_ maps \[\widehat{\beta}:\operatorname{Rep}_{\operatorname{fd}}(H)\to\operatorname{ Rep}_{\operatorname{fd}}(G)\qquad\text{and}\qquad\widehat{\beta}:\widehat{H}_{ \operatorname{fd}}\to\widehat{G}_{\operatorname{fd}},\] given by \(\widehat{\beta}(\pi)=\pi\circ\beta\) for \(\pi\in\operatorname{Rep}_{\operatorname{fd}}(H).\) The following proposition, which may be considered as well-known, is a useful tool for identifying the Bohr compactification of a group. **Proposition 5**.: _Let \(G\) be a topological group, \(K\) a compact group, and \(\beta:G\to K\) a continuous homomorphism with dense image. The following properties are equivalent:_ 1. \((K,\beta)\) _is a Bohr compactification of_ \(G;\)__ 2. _the induced map_ \(\widehat{\beta}:\widehat{K}\to\widehat{G}_{\operatorname{fd}}\) _is surjective;_ 3. _the induced map_ \(\widehat{\beta}:\operatorname{Rep}_{\operatorname{fd}}(K)\to\operatorname{ Rep}_{\operatorname{fd}}(G)\) _is surjective._ Proof.: Assume that (i) holds and let \(\pi:G\to U(n)\) be an irreducible representation of \(G;\) by the universal property of the Bohr compactification, there exists a continuous homomorphism \(\pi^{\prime}:K\to U(n)\) such that \(\pi=\widehat{\beta}(\pi^{\prime})\) and (ii) follows. Conversely, assume that (ii) holds. Let \(L\) be a compact group and \(\alpha:G\to L\) a continuous homomorphism with dense image. Choose a family \(\pi_{i}:L\to U(n_{i})\) of representatives of \(\widehat{L}.\) By the Peter-Weyl theorem, we may identify \(L\) with its image in \(\prod_{i}U(n_{i})\) under the map \(x\mapsto\oplus_{i}\pi_{i}(x)\) For every \(i,\) we have \(\pi_{i}\circ\alpha\in\widehat{G}_{\operatorname{fd}}\) and hence \(\pi_{i}\circ\alpha=\widehat{\beta}(\pi^{\prime}_{i})=\pi^{\prime}_{i}\circ\beta\) for some representation \(\pi^{\prime}_{i}:K\to U(n_{i})\) of \(K\). Define a continuous homomorphism \[\alpha^{\prime}:K\to\prod_{i}U(n_{i})\qquad x\mapsto\oplus_{i}\pi^{\prime}_{i} (x).\] We have \(\alpha^{\prime}\circ\beta=\alpha\) and hence \[\alpha^{\prime}(K)=\alpha^{\prime}\left(\overline{\beta(G)}\right)\subset \overline{\alpha(G)}=L.\] So, (i) and (ii) are equivalent. It is obvious that (ii) is equivalent to (iii). The profinite completion \((\operatorname{Prof}(G),\alpha)\) of \(G\) may be similarly characterized in terms of certain unitary representations of \(G.\) Recall first that \((\operatorname{Prof}(G),\alpha)\) is a pair consisting of a profinite group \(\operatorname{Prof}(G)\) and a continuous homomorphism \(\alpha:G\to\operatorname{Prof}(G)\) with dense image, satisfying the following universal property: for every profinite group \(K\) and every continuous homomorphism \(f:G\to K\), there exists a continuous homomorphism \(f^{\prime}:\,\operatorname{Bohr}(G)\to K\) such that the diagram commutes. Recall that the class of profinite groups coincides with the class of totally disconnected compact groups (see [BH, Proposition 4.C.10]). Denote by \(\operatorname{Rep}_{\operatorname{finite}}(G)\) the set of equivalence classes of finite dimensional unitary representations \(\pi\) of \(G\) for which \(\pi(G)\) is finite; let \(\widehat{G}_{\operatorname{finite}}\) be the subset of irreducible representations from \(\operatorname{Rep}_{\operatorname{finite}}(G)\). If \(\alpha:G\to H\) is a continuous homomorphism of topological groups \(G\) and \(H\) with dense image, then \(\beta\) induces _injective_ maps \[\widehat{\alpha}:\operatorname{Rep}_{\operatorname{finite}}(H)\to\operatorname {Rep}_{\operatorname{finite}}(G)\qquad\text{and}\qquad\widehat{\alpha}: \widehat{H}_{\operatorname{finite}}\to\widehat{G}_{\operatorname{finite}}.\] Observe that \(\widehat{K}=\widehat{K}_{\operatorname{finite}}\) if \(K\) is a profinite group. (Conversely, it follows from Peter-Weyl theorem that, if \(K\) is a compact group with \(\widehat{K}=\widehat{K}_{\operatorname{finite}}\), then \(K\) is profinite.) The proof of the following proposition is similar to the proof of Proposition 5 and will be omitted. **Proposition 6**.: _Let \(K\) be a totally disconnected compact group and \(\alpha:G\to K\) a continuous homomorphism with dense image. The following properties are equivalent:_ 1. \((K,\alpha)\) _is a profinite completion of_ \(G;\)__ 2. _the induced map_ \(\widehat{\alpha}:\widehat{K}\to\widehat{G}_{\operatorname{finite}}\) _is surjective;_ 3. _the induced map_ \(\widehat{\beta}:\operatorname{Rep}_{\operatorname{finite}}(K)\to\operatorname {Rep}_{\operatorname{finite}}(G)\) _is surjective._ The universal property of \(\operatorname{Bohr}(G)\) implies that there is a continuous epimorphism \(\alpha^{\prime}\) : \(\operatorname{Bohr}(G)\to\operatorname{Prof}(G)\) such that the diagram commutes. We record the following elementary but basic fact mentioned in the introduction. **Proposition 7**.: _The kernel of \(\alpha^{\prime}:\operatorname{Bohr}(G)\to\operatorname{Prof}(G)\) coincides with the connected component \(\operatorname{Bohr}(G)_{0}\) of \(\operatorname{Bohr}(G)\)._ Proof.: Since \(\operatorname{Bohr}(G)_{0}\) is connected and \(\operatorname{Prof}(G)\) is totally disconnected, \(\operatorname{Bohr}(G)_{0}\) is contained in \(\operatorname{Ker}\alpha^{\prime}\). So, \(\alpha^{\prime}\) factorizes to a continuous epimorphism \(\alpha^{\prime\prime}:K\to\operatorname{Prof}(G)\), where \(K:=\operatorname{Bohr}(G)/\operatorname{Bohr}(G)_{0}\) and we have a commutative diagram where \(p:\operatorname{Bohr}(G)\to K\) is the canonical epimorphism. Since \(K\) is a totally disconnected compact group, there exists a continuous epimorphism \(f:\operatorname{Prof}(G)\to K\) and we have a commutative diagram For every \(g\in G\), we have \[f(\alpha^{\prime\prime}(p\circ\beta(g)))=f(\alpha(g))=p\circ\beta(g);\] since \(p\circ\beta(G)\) is dense in \(K\), it follows that \(f\circ\alpha^{\prime\prime}\) is the identity on \(K\). This implies that \(\alpha^{\prime\prime}\) is injective and hence an isomorphism. ### Bohr compactifications of commensurable groups Let \(G\) be a topological group and \(H\) be a closed subgroup of finite index in \(G\). We first determine \(\operatorname{Bohr}(H)\) in terms of \(\operatorname{Bohr}(G)\). **Proposition 8**.: _Let \((\operatorname{Bohr}(G),\beta)\) be the Bohr compactification of \(G\). Set \(K:=\overline{\beta(H)}\)._ 1. \(K\) _is a subgroup of finite index of_ \(\operatorname{Bohr}(G)\)_._ 2. \((K,\beta|_{H})\) _is a Bohr compactification of_ \(H\) 3. \(K\) _and_ \(\operatorname{Bohr}(G)\) _have the same connected component of the identity._ Proof.: Item (i) is obvious and Item (iii) follows from Item (i). To show Item (ii), let \(\pi\) be a unitary representation of \(H\) on \(\mathbf{C}^{n}.\) Since \(H\) has finite index in \(H,\) the induced representation \(\rho:=\operatorname{Ind}_{H}^{G}\pi,\) which is a unitary representation of \(G,\) is finite dimensional. Hence, there exists \(\rho^{\prime}\in\operatorname{Rep}_{\operatorname{fd}}(\operatorname{Bohr}(G))\) such that \(\rho=\rho^{\prime}\circ\beta\). Now, \(\pi\) is equivalent to a subrepresentation of the restriction of \(\rho\) to \(H\) (see [BH, 1.F]); so, we may identify \(\pi\) with the representation of \(H\) defined by a \(\rho(H)\)-invariant subspace \(W\) of the space of \(\rho.\) Then \(W\) is \(\rho^{\prime}(K)\)-invariant and defines therefore a representation \(\pi^{\prime}\) of \(K.\) We have \(\pi=\pi^{\prime}\circ(\beta|_{H})\) and Proposition 5 shows that Item (ii) holds. Next, we want to determine \(\operatorname{Bohr}(G)\) in terms of \(\operatorname{Bohr}(H).\) Given a compact group \(K\) and a finite set \(X,\) we define another compact group, we call the **induced group** of \((K,X),\) as \[\operatorname{Ind}(K,X):=K^{X}\rtimes\operatorname{Sym}(X),\] where the group \(\operatorname{Sym}(X)\) of bijections of \(X\) acts by permutations of indices on \(K^{X}:\) \[\sigma((g_{x})_{x\in X})=(g_{\sigma^{-1}(x)})_{x\in X}\qquad\text{for all} \quad\sigma\in\operatorname{Sym}(X),(g_{x})_{x\in X}\in K^{X}\] Observe that, if \(\pi:K\to U(n)\) is a representation of \(K\) on \(V=\mathbf{C}^{n},\) then a unitary representation \(\operatorname{Ind}(\pi)\) of \(\operatorname{Ind}(K,X)\) on on \(V^{X}\) is defined by \[\operatorname{Ind}(\pi)((g_{x})_{x\in X},\sigma)(v_{x})_{x\in X}=(\pi(g_{x})v_ {\sigma^{-1}(x)})_{x\in X},\] for \(((g_{x})_{x\in X},\sigma)\in\operatorname{Ind}(K,X)\) and \((v_{x})_{x\in X}\in V^{X}.\) Coming back to our setting, where \(H\) is a closed subgroup of finite index in \(G,\) we fix a transversal \(X\) for the right cosets of \(H;\) so, we have a disjoint union \(G=\bigsqcup_{x\in X}Hx\). For every \(g\in G\) and \(x\in X,\) let \(x\cdot g\) and \(c(x,g))\) be the unique elements in \(X\) and \(H\) such that \(xg\,=\,c(x,g)(x\cdot g).\) Observe that \[X\times G\to X,\qquad(x,g)\mapsto x\cdot g\] is an action of \(G\) on \(X\) (on the right), which is equivalent to the natural action of \(G\) on \(H\backslash G\) given by right multiplication. In particular, for every \(g\in G,\) the map \(\sigma(g):x\mapsto x\cdot g^{-1}\) belongs to \(\operatorname{Sym}(X)\) and we have a homomorphism \[G\mapsto\operatorname{Sym}(X),\ g\mapsto\sigma(g).\] **Proposition 9**.: _Let \((\mathrm{Bohr}(H),\beta)\) be the Bohr compactification of \(H\). Let \(\mathrm{Ind}(\mathrm{Bohr}(H),X)\) be the compact group defined as above. Consider the map \(\widetilde{\beta}:G\to\mathrm{Ind}(\mathrm{Bohr}(H),X)\) defined by_ \[\widetilde{\beta}(g)=(\beta(c(x,g)))_{x\in X},\sigma(g))\qquad\text{for all}\quad g\in G.\] _The closure of \(\widetilde{\beta}(G)\) in \(\mathrm{Ind}(\mathrm{Bohr}(H),X),\) together with the map \(\widetilde{\beta}\), is a Bohr compactification of \(G.\)_ Proof.: It is readily checked that \(\widetilde{\beta}:G\to\mathrm{Ind}(\mathrm{Bohr}(H),X)\) is a continuous homomorphism. Let \(\rho:G\to U(n)\) be a finite dimensional unitary representation of \(G.\) Set \(\pi:=\rho|_{H}\in\mathrm{Rep}_{\mathrm{fd}}(H).\) There exists \(\pi^{\prime}\in\mathrm{Rep}_{\mathrm{fd}}(\mathrm{Bohr}(H))\) such that \(\pi=\pi^{\prime}\circ\beta\). Let \(\widetilde{\pi}:=\mathrm{Ind}_{H}^{G}\,\pi.\) As is well-known (see [BH, 1.F]), \(\widetilde{\pi}\) can be realized on \(V^{X}\) for \(V:=\mathbf{C}^{n}\) by the formula \[\widetilde{\pi}(g)(v_{x})_{x\in X})=(\pi(c(x,g))v_{x\cdot g})_{x\in X}=(\pi(c( x,g))v_{\sigma(g^{-1})x})_{x\in X},\] for all \(g\in G\) and \((v_{x})_{x\in X}\in V^{X}.\) With the unitary representation \(\mathrm{Ind}(\pi^{\prime})\) of \(\mathrm{Ind}(\mathrm{Bohr}(H),X)\) defined as above, we have therefore \[\widetilde{\pi}(g)=\mathrm{Ind}(\pi^{\prime})(\widetilde{\beta}(g))\qquad \text{for all}\quad g\in G,\] that is, \(\widetilde{\pi}=\mathrm{Ind}(\pi^{\prime})\circ\widetilde{\beta}.\) Now, \[\widetilde{\pi}=\mathrm{Ind}_{H}^{G}\,\pi=\mathrm{Ind}_{H}^{G}(\rho|_{H})\] is equivalent to the tensor product representation \(\rho\otimes\lambda_{G/H},\) where \(\lambda_{G/H}\) is the regular representation of \(G/H\) (see [1, E.2.5]). Since \(\lambda_{G/H}\) contains the trivial representation of \(G,\) it follows that \(\rho\) is equivalent to a subrepresentation of \(\widetilde{\pi};\) so, we can identify \(\rho\) with the representation of \(G\) defined by a \(\widetilde{\pi}(G)\)-invariant subspace \(W\) of \(V^{X}\). Denoting by \(L\) the closure of \(\widetilde{\beta}(G),\) it follows from \((*)\) that \(W\) is invariant under \(\mathrm{Ind}(\pi^{\prime})(L)\) and so defines a representation \(\rho^{\prime}\) of \(L\). Then \(\rho=\rho^{\prime}\circ\widetilde{\beta}\) and the claim follows from Proposition 5. We will also need the following well-known (see [1, Lemma 2.2]) description of the Bohr compactification of a quotient of \(G\) in terms of the Bohr compactification of \(G\). **Proposition 10**.: _Let \((\mathrm{Bohr}(G),\beta)\) be the Bohr compactification of the topological group \(G\) and let \(N\) be a closed normal subgroup of \(G.\) Let \(K_{N}\) be the closure of \(\beta(N)\) in \(\mathrm{Bohr}(G)\)_ 1. \(K_{N}\) _is a normal subgroup of_ \(\mathrm{Bohr}(G)\) _and_ \(\beta\) _induces a continuous homomorphism_ \(\overline{\alpha}:G/N\to\mathrm{Bohr}(G)/K_{N}\)__ 2. \((\mathrm{Bohr}(G)/K_{N},\overline{\alpha})\) _is a Bohr compactification of_ \(G/N.\)__ Proof.: Let \((\operatorname{Bohr}(G/N),\overline{\beta})\) be the Bohr compactification of \(G/N.\) The canonical homomorphism \(\alpha:G\to G/N\) induces a continuous homomorphism \(\alpha^{\prime}:\operatorname{Bohr}(G)\to\operatorname{Bohr}(G/N)\) such that the diagram commutes. It follows that \(\beta(N)\) and hence \(K_{N}\) is contained in \(\operatorname{Ker}\alpha^{\prime}.\) So, we have induced homomorphisms \(\overline{\alpha}:G/N\to\operatorname{Bohr}(G)/K_{N}\) and \(\overline{\alpha^{\prime}}:\operatorname{Bohr}(G)/K_{N}\to\operatorname{Bohr}( G/N),\) giving rise to a commutative diagram It follows that \((\operatorname{Bohr}(G)/K_{N},\overline{\alpha})\) has the same universal property for \(G/N\) as \((\operatorname{Bohr}(G/N),\overline{\beta})\). Since \(\overline{\alpha}\) has dense image, \((\operatorname{Bohr}(G)/K_{N},\overline{\alpha})\) is therefore a Bohr compactification of \(G/N.\) ### Bohr compactification of finitely generated abelian groups Let \(G\) be a locally compact abelian group. Its dual group \(\widehat{G}\) consists of the continuous homomorphism from \(G\) to the circle group \(\mathbf{S}^{1};\) equipped with the topology of uniform convergence on compact subsets, \(\widehat{G}\) is again a locally compact abelian group. Let \(\widehat{G}_{\operatorname{disc}}\) be the group \(\widehat{G}\) equipped with the discrete topology. It is well-known (see e.g. [BH, Proposition 4.C.4]) that the Bohr compactification of \(G\) coincides with the dual group \(K\) of \(\widehat{G}_{\operatorname{disc}},\) together with the embedding \(i:G\to K\) given by \(i(g)(\chi)=\chi(g)\) for all \(g\in G\) and \(\chi\in\widehat{G}.\) Notice that this implies that, by Pontrjagin duality, the dual group of \(\operatorname{Bohr}(G)\) coincides with \(\widehat{G}_{\operatorname{disc}}.\) A more precise information on the structure of the Bohr compactification is available in the case of a (discrete) finitely generated abelian group. As is well-known, such a group \(\Gamma\) splits a direct sum \(\Gamma=F\oplus A\) of a finite group \(F\) (which is its torsion subgroup) and a free abelian group \(A\) of finite rank \(k\geq 0,\) called the rank of \(\Gamma\). Recall that \(\mathbf{Z}_{p}\) denotes the ring of \(p\)-adic integers for a prime \(p\) and \(\mathbf{A}\) the ring of adeles over \(\mathbf{Q}.\) **Proposition 11**.: _Let \(\Gamma\) be a finitely generated abelian group of rank \(k.\)_ 1. _We have a direct sum decomposition_ \[\operatorname{Bohr}(\Gamma)\cong\operatorname{Bohr}(\Gamma)_{0}\oplus\operatorname{ Prof}(\Gamma).\] 2. _We have_ \[\operatorname{Prof}(\Gamma)\cong F\oplus\prod_{p\text{ prime}}\mathbf{Z}_{p}^{k},\] _where_ \(F\) _is a finite group._ 3. _We have_ \[\operatorname{Bohr}(\Gamma)_{0}\cong\prod_{\omega\in\mathfrak{c}}\mathbf{A}^{k} /\mathbf{Q}^{k},\] _a product of uncountably many copies of the adelic solenoid_ \(\mathbf{A}^{k}/\mathbf{Q}^{k}\)_._ Proof.: We have \(\Gamma\cong F\oplus\mathbf{Z}^{k}\) for a finite group \(F\) and \(\operatorname{Bohr}(\mathbf{Z}^{k})=\operatorname{Bohr}(\mathbf{Z})^{k}.\) So, it suffices to determine \(\operatorname{Bohr}(\mathbf{Z}).\) As mentioned above, \(\operatorname{Bohr}(\mathbf{Z})\) can be identified with the dual group of the circle \(\mathbf{S}^{1}\) viewed as discrete group. Choose a linear basis \(\{1\}\cup\{x_{\omega}\mid\omega\in\mathfrak{c}\}\) of \(\mathbf{R}\) over \(\mathbf{Q}\). Then \(\mathbf{S}^{1}\cong\mathbf{R}/\mathbf{Z}\) is isomorphic to the abelian group \[(\mathbf{Q}/\mathbf{Z})\oplus\oplus_{\omega\in\mathfrak{c}}\mathbf{Q}.\] Hence, \[\operatorname{Bohr}(\mathbf{Z})\cong\widehat{\mathbf{Q}/\mathbf{Z}}\oplus \prod_{\omega\in\mathfrak{c}}\widehat{\mathbf{Q}}.\] Now, \[\mathbf{Q}/\mathbf{Z}=\oplus_{p\text{ prime}}Z(p^{\infty}),\] with \(Z(p^{\infty})=\varinjlim_{k}\mathbf{Z}/p^{k}\mathbf{Z}\) the \(p\)-primary component of \(\mathbf{Q}/\mathbf{Z}.\) Hence, \[\widehat{Z(p^{\infty})}\cong\varprojlim_{k}\mathbf{Z}/p^{k}\mathbf{Z}= \mathbf{Z}_{p}.\] On the other hand, \(\widehat{\mathbf{Q}}\) can be identified with the solenoid \(\mathbf{A}/\mathbf{Q}\) (see e.g. [11, (25.4)]). It follows that \[\operatorname{Bohr}(\Gamma)\cong\prod_{p\text{ prime}}\mathbf{Z}_{p}\oplus \prod_{\omega\in\mathfrak{c}}\mathbf{A}/\mathbf{Q}.\] ### Restrictions of representations to normal subgroups Let \(\Gamma\) be a group and \(N\) a normal subgroup of \(\Gamma\). Recall that \(\Gamma\) acts on \(\widehat{N}_{\mathrm{fd}}\): for \(\sigma\in\widehat{N}_{\mathrm{fd}}\) and \(\gamma\in\Gamma\), the conjugate representation \(\sigma^{\gamma}\in\widehat{N}_{\mathrm{fd}}\) is defined by \[\sigma^{\gamma}(n)\,=\,\sigma(\gamma^{-1}n\gamma),\quad\text{ for all }\,n\in N.\] The stabilizer \(\Gamma_{\sigma}\) of \(\sigma\) is the subgroup consisting of all \(\gamma\in\Gamma\) for which \(\sigma^{\gamma}\) is equivalent \(\sigma\); observe that \(\Gamma_{\sigma}\) contains \(N.\) Given a unitary representation \(\rho\) of \(N\) on a finite dimensional vector space \(V\) and \(\sigma\in\widehat{N}_{\mathrm{fd}}\), we denote by \(V^{\sigma}\) the \(\sigma\)_-isotypical component_ of \(\rho,\) that is, the sum of all \(\rho\)-invariant subspaces \(W\) for which the restriction of \(\rho\) to \(W\) is equivalent to \(\sigma.\) Observe that \(V\) decomposes as direct sum \(V=\oplus_{\sigma\in\Sigma_{\rho}}V^{\sigma},\) where \(\Sigma_{\rho}\) is the finite set of \(\sigma\in\widehat{N}_{\mathrm{fd}}\) with \(V^{\sigma}\neq\{0\}.\) **Proposition 12**.: _Let \(\pi\) be an irreducible unitary representation of \(\Gamma\) on a finite dimensional vector space \(V.\) Let \(V=\oplus_{\sigma\in\Sigma_{\pi|_{N}}}V^{\sigma}\) be the decomposition of the restriction \(\pi|_{N}\) of \(\pi\) to \(N\) into isotypical components. Then \(\Sigma_{\pi|_{N}}\) coincides with a \(\Gamma\)-orbit: there exists \(\sigma\in\widehat{N}_{\mathrm{fd}}\) such that \(\Sigma_{\pi|_{N}}=\{\sigma^{\gamma}\,:\ \gamma\in\Gamma\};\) in particular, \(\Gamma_{\sigma}\) has finite index in \(\Gamma.\)_ Proof.: Let \(\sigma\in\Sigma_{\pi|_{N}}\) and fix a transversal \(T\) for the left cosets of \(\Gamma_{\sigma}\) with \(e\in T\). Then \(V^{\sigma^{t}}=\pi(t)V^{\sigma}\) for all \(t\in T\) Since \(\pi\) is irreducible and \(\sum_{t\in T}\pi(t)V^{\sigma}\) is \(\pi(\Gamma)\)-invariant, it follows that \(\Sigma_{\pi|_{N}}\) is a \(\Gamma\)-orbit. ## 3. Proof of Theorem 1 ### Distortion and Bohr compactification Let \(\Gamma\) be a finitely generated group with a finite set \(S\) of generators. For \(\gamma\in\Gamma\), denote by \(\ell_{S}(\gamma)\) the word length of \(\gamma\) with respect to \(S\cup S^{-1}\) and set \[t(\gamma)=\liminf_{n\to\infty}\frac{\ell_{S}(\gamma^{n})}{n}.\] The number \(t(\gamma)\) is called the _translation number_ of \(\gamma\) in [10] **Definition 13**.: An element \(\gamma\in\Gamma\) is said to be **distorted** if \(t(\gamma)=0.\) In fact, since the sequence \(n\mapsto\ell_{S}(\gamma^{n})\) is subadditive, we have, by Fekete's lemma, \[t(\gamma)=\lim_{n\to\infty}\frac{\ell_{S}(\gamma^{n})}{n}=\inf\left\{\frac{ \ell_{S}(\gamma^{n})}{n}:n\in\mathbf{N}^{*}\right\}\] The property of being distorted is independent of the choice of the set of generators. Distorted elements are called _algebraically parabolic_ in [1, (7.5), p.90], but we prefer to use the terminology from [11]. The relevance of distorsion to the Bohr compactification lies in the following proposition; for a related result with a similar proof, see [12, (2.4)]. **Proposition 14**.: _Let \(\Gamma\) be a finitely generated group and \(\gamma\in\Gamma\) a distorted element. Then, for every finite dimensional unitary representation \(\pi:\Gamma\to U(N)\) of \(\Gamma,\) the matrix \(\pi(\gamma)\in U(N)\) has finite order._ Proof.: It suffices to show that all eigenvalues of the unitary matrix \(\pi(\gamma)\) are roots of unity. Assume, by contradiction, that \(\pi\) has an eigenvalue \(\lambda\in\mathbf{S}^{1}\) of infinite order. Let \(S\) be a finite set of generators of \(\Gamma\) with \(S=S^{-1}.\) The group \(\pi(\Gamma)\) is generated by the set \(\{\pi(s)\mid s\in S\}.\) Hence, \(\pi(G)\) is contained in \(GL_{N}(L),\) where \(L\) is the subfield of \(\mathbf{C}\) generated by the matrix coefficients of the \(\pi(s)\)'s. It follows that \(\lambda\) is contained in a finitely generated extension \(\ell\) of \(L\). By a lemma of Tits ([13, Lemma 4.1]), there exists a locally compact field \(k\) endowed with an absolute value \(|\cdot|\) and a field embedding \(\sigma:\ell\to k\) such that \(|\sigma(\lambda)|\neq 1.\) Upon replacing \(\gamma\) by \(\gamma^{-1},\) we may assume that \(|\sigma(\lambda)|>1.\) Define a function ("norm") \(\xi\mapsto\|\xi\|\) on \(k^{N}\) by \[\|\xi\|=\max\{|\xi_{1}|,\ldots,|\xi_{N}|\}\qquad\text{for all}\quad\xi=(\xi_{1 },\ldots,\xi_{N})\in k^{N}.\] For a matrix \(A\in GL_{N}(k),\) set \(\|A\|=\sup_{\xi\neq 0}\|A\xi\|/\|\xi\|.\) It is obvious that \(\|A\xi\|\leq\|A\|\|\xi\|\) for all \(\xi\in k^{N}\) and hence ( \[*\] ) \[\|AB\|\leq\|A\|\|B\|\qquad\text{for all}\quad A,B\in GL_{N}(k).\] In particular, we have \(\|A^{n}\|\leq\|A\|^{n}\) for all \(A\in GL_{N}(k)\) and \(n\in\mathbf{N}.\) For a matrix \(w\in GL_{n}(\ell),\) denote by \(\sigma(w)\) the matrix in \(GL_{n}(k)\) obtained by applying \(\sigma\) to the entries of \(w.\) Set \(A_{s}=\sigma(\pi(s))\) for \(s\in S\) and \(A:=\sigma(\pi(\gamma)).\) With \[C:=\max\{\|A_{s}\|:s\in S\},\] it is clear that Inequality (\(*\)) implies that ( \[**\] ) \[\|A^{n}\|=\|\sigma(\pi(\gamma^{n}))\|\leq C^{\ell_{S}(\gamma^{n})}\qquad\text {for all}\quad n\in\mathbf{N}.\] On the other hand, \(\sigma(\lambda)\) is an eigenvalue of \(A\); so, there exists \(\xi\in k^{N}\setminus\{0\}\) such that \(A\xi=\sigma(\lambda)\xi\) and hence \(A^{n}\xi=\sigma(\lambda)^{n}\xi\) for all \(n\in\mathbf{N}.\) So, for every \(n\in\mathbf{N},\) we have \[\|A^{n}\xi\|=|\sigma(\lambda)|^{n}\|\xi\|\] and this implies that \[\|A^{n}\|\geq|\sigma(\lambda)|^{n}.\] In view of (\(**\)), we obtain therefore \[\frac{\ell_{S}(\gamma^{n})\log C}{n}\geq\log|\sigma(\lambda)|\qquad\text{for all}\quad n\in\mathbf{N}.\] Since \(|\sigma(\lambda)|>1\), this contradicts the fact that \(\liminf_{n\to\infty}\dfrac{\ell_{S}(\gamma^{n})}{n}=0\). ### Distorted elements in nilpotent groups Let \(\Gamma\) be a finitely generated nilpotent subgroup. For subsets \(A,B\) in \(\Gamma\), we let \([A,B]\) denote the subgroup of \(\Gamma\) generated by all commutators \([a,b]=aba^{-1}b^{-1}\), for \(a\in A\) and \(b\in B.\) Let \[\Gamma^{(0)}\supset\Gamma^{(1)}\supset\cdots\supset\Gamma^{(d-1)}\supset \Gamma^{(d)}=\{e\}\] be the lower central series of \(\Gamma\), defined inductively by \(\Gamma^{(0)}=\Gamma\) and \(\Gamma^{(k+1)}=[\Gamma^{(k)},\Gamma].\) The step of nilpotency of \(\Gamma\) is the smallest \(d\geq 1\) such that \(\Gamma^{(d-1)}\neq\{e\}\) and \(\Gamma^{(d)}=\{e\}\). **Proposition 15**.: _Let \(\Gamma\) be a finitely generated nilpotent subgroup. Every \(\gamma\in\Gamma^{(1)}=[\Gamma,\Gamma]\) is distorted._ Proof.: Let \(S\) be a finite set of generators of \(\Gamma\) with \(S=S^{-1}.\) Let \(d\geq 1\) be the step of nilpotency of \(\Gamma\). The case \(d=1\) being trivial, we will assume that \(d\geq 2.\) We will show by induction on \(i\in\{1,\ldots,d-1\}\) that every \(\gamma\in\Gamma^{(d-i)}\) is distorded. \(\bullet\)_First step._ Assume that \(i=1\). It is well-known that every element \(\gamma\) in \(\Gamma^{(d-1)}\) is distorted (see for instance [1, (7.6), p. 91]); in fact, more precise estimates are available: for every \(\gamma\in\Gamma^{(d-1)}\), we have \(\ell_{S}(\gamma^{n})=O(n^{1/d})\) as \(n\to\infty\) (see [12, 2.3 Lemme] or [1, Lemma 14.15]). \(\bullet\)_Second step._ Assume that, for every finitely generated nilpotent subgroup \(\Lambda\) of step \(d^{\prime}\geq 2\), every element \(\delta\in\Lambda^{(d^{\prime}-i)}\) is distorded for \(i\in\{1,\ldots,d^{\prime}-2\}.\) Let \(\gamma\in\Gamma^{(d-i-1)}\) and fix \(\varepsilon>0\). The quotient group \(\overline{\Gamma}=\Gamma/\Gamma^{(d-1)}\) is nilpotent of step \(d^{\prime}=d-1\) and \(p(\gamma)\in\overline{\Gamma}^{(d^{\prime}-i)}\), where \(p:\Gamma\to\overline{\Gamma}\) is the quotient map. By induction hypothesis, \(p(\gamma)\) is distorted in \(\overline{\Gamma}\) with respect to the generating set \(\overline{S}:=p(S).\) So, we have \(\lim_{n\to\infty}\dfrac{\ell_{\overline{S}}(p(\gamma)^{n})}{n}=0\); hence, we can find an integer \(N\geq 1\) such that \[\forall n\geq N,\exists\delta_{n}\in\Gamma^{(d-1)}\ :\ \dfrac{\ell_{S}(\gamma^{n} \delta_{n})}{n}\leq\varepsilon.\] By the first step, we have \(\lim_{k\to\infty}\dfrac{\ell_{S}(\delta_{N}^{k})}{k}=0\), since \(\delta_{N}\in\Gamma^{(d-1)}\); so, there exists \(K\geq 1\) such that \[\forall k\geq K\ :\ \dfrac{\ell_{S}(\delta_{N}^{k})}{k}\leq\varepsilon.\] Let \(k\geq K.\) We have \[\frac{\ell_{S}(\gamma^{Nk})}{Nk}=\frac{\ell_{S}((\gamma^{Nk}\delta_{N}^{k})( \delta_{N}^{-1})^{k})}{Nk}\leq\frac{\ell_{S}(\gamma^{Nk}\delta_{N}^{k})}{Nk}+ \frac{\ell_{S}(\delta_{N}^{k})}{Nk}.\] Now, since \(\Gamma^{(d-1)}\) is contained in the center of \(\Gamma,\) the elements \(\delta_{N}\) and \(\gamma_{N}\) commute and hence, by \((*),\) we have \[\frac{\ell_{S}(\gamma^{Nk}\delta_{N}^{k})}{Nk}=\frac{\ell_{S}(( \gamma^{N}\delta_{N})^{k})}{Nk}\leq k\frac{\ell_{S}(\gamma^{N}\delta_{N})}{Nk} =\frac{\ell_{S}(\gamma^{N}\delta_{N})}{N}\leq\varepsilon.\] So, together with \((***)\) and \((**),\) we obtain \[\forall k\geq K\ :\ \frac{\ell_{S}(\gamma^{Nk})}{Nk}\leq 2\varepsilon.\] This shows that \(t(\gamma)=0.\) ### Congruence subgroups in unipotent groups The following result, which shows that the congruence subgroup problem has a positive solution for unipotent groups, is well-known (see the sketch in [10, p.108]); for the convenience of the reader, we reproduce its short proof. **Proposition 16**.: _Let \(\mathbf{U}\) be a unipotent algebraic group over \(\mathbf{Q}.\) Let \(\Gamma\) be an arithmetic subgroup of \(\mathbf{U}(\mathbf{Q}).\) Then every finite index subgroup of \(\Gamma\) is a congruence subgroup._ Proof.: We can find a sequence \[\mathbf{U}=\mathbf{U}_{0}\supset\mathbf{U}_{1}\supset\cdots\supset\mathbf{U}_ {d-1}\supset\mathbf{U}_{d}=\{e\}\] of normal \(\mathbf{Q}\)-subgroups of \(\mathbf{U}\) such that the factor groups \(\mathbf{U}_{i}/\mathbf{U}_{i+1}\) are \(\mathbf{Q}\)-isomorphic to \(\mathbf{G}_{a},\) the additive group of dimension \(1\) (see [1, (15.5)]). We proceed by induction on \(d\geq 1\). If \(d=1,\) then \(\Gamma\) is commensurable to \(\mathbf{Z}\) and the claim is obvious true. Assume that \(d\geq 2.\) Then \(\mathbf{U}\) can be written as semi-direct product \(\mathbf{U}=\mathbf{U}_{1}\rtimes\mathbf{G}_{a}.\) By [1, Corollary 4.6], \(\Gamma\) is commensurable to \(\mathbf{U}_{1}(\mathbf{Z})\rtimes\mathbf{Z}.\) Let \(H\) a subgroup of finite index in \(\Gamma.\) Then \(H\cap\mathbf{U}_{1}(\mathbf{Z})\) has finite index in \(\mathbf{U}_{1}(\mathbf{Z})\) and hence, by induction hypothesis, contains the kernel of the reduction \(\mathbf{U}_{1}(\mathbf{Z})\rightarrow\mathbf{U}_{1}(\mathbf{Z}/N_{1}\mathbf{Z})\) modulo some \(N_{1}\geq 1.\) Moreover, \(H\cap\mathbf{Z}=N_{2}\mathbf{Z}\) for some \(N_{2}\geq 1.\) Hence, \(H\) contains the kernel of the reduction \(\mathbf{U}(\mathbf{Z})\rightarrow\mathbf{U}(\mathbf{Z}/N_{1}N_{2}\mathbf{Z})\) modulo \(N_{1}N_{2}.\) ### Proof of Theorem 1 Let \(\Gamma\) be a finitely generated nilpotent group and \(\alpha:\Gamma\to\operatorname{Prof}(\Gamma)\) the canonical homomorphism. Recall (see Proposition 11) that the Bohr compactification of \(\Gamma^{\operatorname{Ab}}=\Gamma/[\Gamma,\Gamma]\) splits as a direct sum \[\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})=\operatorname{Bohr}(\Gamma^{ \operatorname{Ab}})_{0}\oplus B_{1},\] for a closed subgroup \(B_{1}\cong\operatorname{Prof}(\Gamma^{\operatorname{Ab}}).\) Let \(p:\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})\to\operatorname{Bohr}( \Gamma^{\operatorname{Ab}})_{0}\) be the corresponding projection. Denote by \(\beta_{0}:\Gamma\to\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})\) the map induced by the quotient homomorphism \(\Gamma\to\Gamma^{\operatorname{Ab}}\). Set \[K:=\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}\times\operatorname{Prof }(\Gamma),\] and let \(\beta:\Gamma\to K\) be the homomorphism \(\gamma\mapsto(p\circ\beta_{0}(\gamma),\alpha(\gamma)).\) We claim that \((K,\beta)\) is a Bohr compactification for \(\Gamma.\) \(\bullet\)_First step._ We claim that \(\beta(\Gamma)\) is dense in \(K.\) Indeed, let \(L\) be the closure of \(\beta(\Gamma)\) in \(K\) and \(L_{0}\) its connected component. Since \(\operatorname{Prof}(\Gamma)\) is totally disconnected, the projection of \(L_{0}\) on \(\operatorname{Prof}(\Gamma)\) is trivial; hence \(L_{0}=K_{0}\times\{1\}\) for a connected closed subgroup \(K_{0}\) of \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}.\) The projection of \(L\) on \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}\) induces then a continuous homomorphism \[f:L/L_{0}\to\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}/K_{0}.\] Observe that \(f\) has dense image, since \(p\circ\beta_{0}(\Gamma)\) is dense in \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0};\) so, \(f\) is surjective by compactness of \(L/L_{0}.\) It follows, by compactness again, that \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}/K_{0}\) is topologically isomorphic to a quotient of \(L/L_{0}.\) As \(L/L_{0}\) is totally disconnected, this implies (see [1, Chap. 3, SS4, Corollaire 3]) that \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}/K_{0}\) is also totally disconnected and hence that \(K_{0}=\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}.\) So, \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}\times\{1\}\) is contained in \(L.\) It follows that \(L\) is the product of \(\operatorname{Bohr}(\Gamma^{\operatorname{Ab}})_{0}\) with a subgroup of \(\operatorname{Prof}(\Gamma).\) Since \(\alpha(\Gamma)\) is dense in \(\operatorname{Prof}(\Gamma),\) this subgroup coincides with \(\operatorname{Prof}(\Gamma),\) that is, \(L=K\) and the claim is proved. \(\bullet\)_Third step._ We claim that every irreducible unitary representation \(\pi:\Gamma\to U(N)\) of \(\Gamma\) is of the form \(\chi\otimes\rho\) for some \(\chi\in\widehat{\Gamma^{\operatorname{Ab}}}\) and \(\rho\in\widehat{\Gamma}_{\operatorname{finite}}.\) Indeed, Propositions 14 and 15, imply that \(\pi([\Gamma,\Gamma])\) is a periodic subgroup of \(U(N).\) Since \(\Gamma\) is finitely generated, \([\Gamma,\Gamma]\) is finitely generated (in fact, every subgroup of \(\Gamma\) is finitely generated; see [10, 2.7 Theorem]). Hence, by Schur's theorem (see [20, 4.9 Corollary]), \(\pi([\Gamma,\Gamma])\) is finite. It follows that there exists a finite index normal subgroup \(H\) of \([\Gamma,\Gamma]\) so that \(\pi|_{H}\) is the trivial representation of \(H.\) Next, we claim that there exists a normal subgroup \(\Delta\) of finite index in \(\Gamma\) such that \(\Delta\cap[\Gamma,\Gamma]=H.\) Indeed, since \(\Gamma/[\Gamma,\Gamma]\) is abelian and finitely generated, we have \(\Gamma/[\Gamma,\Gamma]\cong\mathbf{Z}^{k}\oplus F\) for some finite subgroup \(F\) and some integer \(k\geq 0.\) Let \(\Gamma_{1}\) be the inverse image in \(\Gamma\) of the copy of \(\mathbf{Z}^{k}\) in \(\Gamma/[\Gamma,\Gamma].\) Then \(\Gamma_{1}\) is a normal subgroup of finite index of \(\Gamma.\) Moreover, \(\Gamma_{1}\) can be written as iterated semi-direct product \[\Gamma_{1}=(\ldots(([\Gamma,\Gamma]\rtimes\mathbf{Z})\rtimes\mathbf{Z})).\] Set \[\Delta:=(\ldots((H\rtimes\mathbf{Z})\rtimes\mathbf{Z})\rtimes\mathbf{Z})).\] Then \(\Delta\) is a normal subgroup of finite index of \(\Gamma\) with \(\Delta\cap[\Gamma,\Gamma]=H.\) Since \(\pi|_{H}\) is trivial on \(H\) and since \([\Delta,\Delta]\subset H,\) the restriction \(\pi|_{\Delta}\) of \(\pi\) to \(\Delta\) factorizes through \(\Delta^{\mathrm{Ab}}.\) So, by Proposition 12, there exists a finite \(\Gamma\)-orbit \(\mathcal{O}\) in \(\widehat{\Delta^{\mathrm{Ab}}}\) such that we have a direct sum decomposition \(V=\bigoplus_{\chi\in\mathcal{O}}V^{\chi},\) where \(V^{\chi}\) is the \(\chi\)-isotypical component of \(\pi|_{\Delta}.\) Fix \(\chi\in\mathcal{O}.\) Since \(\chi\) is trivial on \(H\) and since \(\Delta\cap[\Gamma,\Gamma]=H,\) we can view \(\chi\) as a unitary character of the subgroup \(\Delta/(\Delta\cap[\Gamma,\Gamma])\) of \(\Gamma^{\mathrm{Ab}}.\) Hence, \(\chi\) extends to a character \(\widetilde{\chi}\in\widehat{\Gamma^{\mathrm{Ab}}}\) (see, e.g. [10, (24.12)]). This implies that \(\Gamma_{\chi}=\Gamma;\) indeed, \[\chi^{\gamma}(\delta)=\widetilde{\chi}(\gamma^{-1}\delta\gamma)=\widetilde{ \chi}(\delta)=\chi(\delta)\] for every \(\gamma\in\Gamma\) and \(\delta\in\Delta.\) This shows that \(\mathcal{O}\) is a singleton and so \(V=V^{\chi}.\) We write \[\pi=\widetilde{\chi}\otimes(\widetilde{\chi}\otimes\pi).\] Then \(\rho:=\overline{\widetilde{\chi}}\otimes\pi\) is an irreducible unitary representation of \(\Gamma\) which is trivial on \(\Delta;\) so, \(\rho\) has finite image and \(\pi=\widetilde{\chi}\otimes\rho.\) \(\bullet\)_Third step._ Let \(\pi\in\widehat{\Gamma}_{\mathrm{fd}}.\) We claim that there exists a representation \(\pi^{\prime}\in\widehat{K}\) such that \(\pi=\pi^{\prime}\circ\beta.\) Once proved, Proposition 5 will imply that \((K,\beta)\) is a Bohr compactification for \(\Gamma.\) By the second step, we can write \(\pi=\chi\otimes\rho\) for some \(\chi\in\widehat{\Gamma^{\mathrm{Ab}}}\) and \(\rho\in\widehat{\Gamma}_{\mathrm{finite}}.\) On the one hand, we can write \(\rho=\rho^{\prime}\circ\alpha\) for some \(\rho^{\prime}\in\widehat{\mathrm{Prof}(\Gamma)},\) by the universal property of \(\mathrm{Prof}(\Gamma).\) On the other hand, we can decompose \(\chi\) as \(\chi=\chi_{0}\chi_{1}\) with \(\chi_{0}\in\widehat{\Gamma^{\mathrm{Ab}}}\) of infinite order and \(\chi_{1}\in\widehat{\Gamma^{\mathrm{Ab}}}\) of finite order. We have \(\chi_{0}=\chi_{0}^{\prime}\circ(p\circ\beta_{0})\) and \(\chi_{1}=\chi_{1}^{\prime}\circ\alpha\) for unitary characters \(\chi_{0}^{\prime}\) of \(\mathrm{Bohr}(\Gamma^{\mathrm{Ab}})_{0}\) and \(\chi_{1}^{\prime}\) of \(\mathrm{Prof}(\Gamma^{\mathrm{Ab}})\). For \(\pi^{\prime}=\chi_{0}\otimes(\chi_{1}^{\prime}\otimes\rho^{\prime}),\) we have \(\pi^{\prime}\in\widehat{K}\) and \(\pi=\pi^{\prime}\circ\beta.\) ## 4. Proof of Theorems 2 Let \(\mathbf{G}=\mathbf{U}\rtimes\mathbf{H}\) be a Levi decomposition of \(\mathbf{G}\) and set \[\Lambda=\mathbf{H}(\mathbf{Z}),\quad\Delta=\mathbf{U}(\mathbf{Z}),\qquad\text {and}\qquad\Gamma=\Delta\rtimes\Lambda.\] Denote by \(\beta_{\Delta}:\Delta\to\mathrm{Bohr}(\Delta)\) and \(\beta_{\Lambda}:\Lambda\to\mathrm{Bohr}(\Lambda)\) the natural homomorphisms. Observe that, by the universal property of \(\mathrm{Bohr}(\Delta),\) every element \(\lambda\in\Lambda\) defines a continuous automorphism \(\theta_{b}(\lambda)\) of \(\mathrm{Bohr}(\Delta)\) such that \[\theta_{b}(\lambda)(\delta)=\beta_{\Delta}(\lambda\delta\lambda^{-1})\qquad\text{ for all}\quad\delta\in\Delta.\] The corresponding homomorphism \(\theta_{b}:\Lambda\to\operatorname{Aut}(\operatorname{Bohr}(\Delta))\) defines an action of \(\Lambda\) on \(\operatorname{Bohr}(\Delta).\) By Theorem 1, we have \[\operatorname{Bohr}(\Delta)=\operatorname{Bohr}(\Delta^{\operatorname{Ab}})_{0} \times\operatorname{Prof}(\Delta).\] The group \(\Lambda\) acts naturally on \(\Delta^{\operatorname{Ab}}\) and, by duality, on \(\widehat{\Delta^{\operatorname{Ab}}}.\) Let \[H:=\widehat{\Delta^{\operatorname{Ab}}}_{\Lambda-\operatorname{fin}}\subset \widehat{\Delta^{\operatorname{Ab}}}\] be the subgroup of characters of \(\Delta^{\operatorname{Ab}}\) with finite \(\Lambda\)-orbits. Observe that \(H\) contains the torsion subgroup of \(\widehat{\Delta^{\operatorname{Ab}}}.\) Let \[\alpha:\Lambda\to\operatorname{Aut}(H)\] be the homomorphism given by the action of \(\Lambda\) on \(H.\) For a locally compact group \(G,\) the group \(\operatorname{Aut}(G)\) of continuous automorphisms of \(G\) will be endowed with the compact-open topology for which it is also a (not necessarily locally compact) topological group (see [10, (26.3)]). \(\bullet\)_First step._ We claim that the closure of \(\alpha(\Lambda)\) in \(\operatorname{Aut}(H)\) is compact. Indeed, let us identify \(\operatorname{Aut}(H)\) with a subset of the product space \(H^{H}.\) The topology of \(\operatorname{Aut}(H)\) coincides with the topology induced by the product topology on \(H^{H}.\) Viewed this way, \(\alpha(\Lambda)\) is a subspace of the product \(\prod_{\chi\in H}\chi^{\Lambda}\) of the finite \(\Lambda\)-orbits \(\chi^{\Lambda}.\) Since \(\prod_{\chi\in H}\chi^{\Lambda}\) is compact and hence closed, the claim is proved. Next, let \(N\) be the annihilator of \(H\) in \(\operatorname{Bohr}(\Delta^{\operatorname{Ab}}).\) Then \(N\) is \(\Lambda\)-invariant and the induced action of \(\Lambda\) on \(\operatorname{Bohr}(\Delta^{\operatorname{Ab}})/N\) is a quotient of the action given by \(\theta_{b}.\) Let \(C\) be the connected component of \(\operatorname{Bohr}(\Delta^{\operatorname{Ab}})/N.\) Then \(C\) coincides with the image of \(\operatorname{Bohr}(\Delta^{\operatorname{Ab}})_{0}\) in \(\operatorname{Bohr}(\Delta^{\operatorname{Ab}})/N\) (see [1, Chap. 3, SS4, Corollaire 3]) and so \[C\cong\operatorname{Bohr}(\Delta^{\operatorname{Ab}})_{0}/(N\cap\operatorname {Bohr}(\Delta^{\operatorname{Ab}})_{0}).\] Since \(C\) is invariant under \(\Lambda,\) we obtain an action of \(\Lambda\) on \(C;\) let \[\widehat{\alpha}:\Lambda\to\operatorname{Aut}(C)\] be the corresponding homomorphism. \(\bullet\)_Second step._ We claim that the action \(\widehat{\alpha}\) of \(\Lambda\) on \(C\) extends to an action of \(\operatorname{Bohr}(\Lambda);\) more precisely, there exists a continuous homomorphism \[\widehat{\alpha}^{\prime}:\operatorname{Bohr}(\Lambda)\to\operatorname{Aut}(C)\] such that the diagram commutes. Indeed, by the first step, the closure \(K\) of \(\alpha(\Lambda)\) in \(\operatorname{Aut}(H)\) is a compact group. Hence, by the universal property of \(\operatorname{Bohr}(\Lambda)\), there exists a continuous homomorphism \[\alpha^{\prime}:\operatorname{Bohr}(\Lambda)\to K\subset\operatorname{Aut}(H)\] such that the diagram commutes. Since \(\widehat{H}=\operatorname{Bohr}(\Delta^{\operatorname{Ab}})/N\), we obtain by duality a continuous homomorphism \(\widehat{\alpha}^{\prime}:\operatorname{Bohr}(\Lambda)\to\operatorname{Aut}( \operatorname{Bohr}(\Delta^{\operatorname{Ab}})/N)\). The connected component \(C\) of \(\operatorname{Bohr}(\Delta^{\operatorname{Ab}})/N\) is invariant under \(\operatorname{Bohr}(\Lambda)\). This proves the existence of the map \(\widehat{\alpha}^{\prime}:\operatorname{Bohr}(\Lambda)\to\operatorname{Aut}(C)\) with the claimed property. Next, observe that, by the universal property of \(\operatorname{Prof}(\Delta)\), every element \(\lambda\in\Lambda\) defines a continuous automorphism \(\theta_{p}(\lambda)\) of \(\operatorname{Prof}(\Delta)\) such that \[\theta_{p}(\lambda)(\delta)=\beta_{\Delta}(\lambda\delta\lambda^{-1})\qquad \text{for all}\quad\delta\in\Delta.\] The corresponding homomorphism \(\theta_{p}:\Lambda\to\operatorname{Aut}(\operatorname{Prof}(\Delta))\) defines an action of \(\Lambda\) on \(\operatorname{Prof}(\Delta)\). \(\bullet\)_Third step._ We claim that the action \(\theta_{p}\) of \(\Lambda\) on \(\operatorname{Prof}(\Delta)\) extends to an action of \(\operatorname{Bohr}(\Lambda)\); more precisely, there exists a homomorphism \(\theta^{\prime}:\operatorname{Bohr}(\Lambda)\to\operatorname{Aut}( \operatorname{Prof}(\Delta))\) such that the diagram commutes. Indeed, since \(\Delta\) is finitely generated and since its image in \(\operatorname{Bohr}(\Delta)\) dense, the profinite group \(\operatorname{Bohr}(\Delta)\) is finitely generated (that is, there exists a finite subset of \(\operatorname{Bohr}(\Delta)\) which generates a dense subgroup). This implies that \(\operatorname{Aut}(\operatorname{Bohr}(\Delta))\) is a profinite group (see [13, Corollary 4.4.4]) and so there exists a homomorphism \(\theta^{\prime}_{p}:\operatorname{Prof}(\Lambda)\to\operatorname{Aut}( \operatorname{Prof}(\Delta))\) such that \(\theta^{\prime}_{p}\circ\alpha_{\Lambda}=\theta_{p}.\) We then lift \(\theta^{\prime}_{p}\) to a homomorphism \(\theta^{\prime}:\operatorname{Bohr}(\Lambda)\to\operatorname{Aut}( \operatorname{Prof}(\Delta)).\) We set \[Q:=\operatorname{Bohr}(\Delta)/(N\cap\operatorname{Bohr}(\Delta^{\operatorname{ Ab}})_{0})=C\times\operatorname{Prof}(\Delta);\] we have an action of \(\Lambda\) on \(Q\) given by the homomorphism \[\widehat{\alpha}\oplus\theta_{p}:\Lambda\to\operatorname{Aut}(C)\times \operatorname{Aut}(\operatorname{Prof}(\Delta))\subset\operatorname{Aut}(Q)\] and, by the second and third step, an action of \(\operatorname{Bohr}(\Lambda)\) on \(Q\) given by \[\widehat{\alpha}^{\prime}\oplus\theta^{\prime}:\operatorname{Bohr}(\Lambda) \to\operatorname{Aut}(C)\times\operatorname{Aut}(\operatorname{Prof}(\Delta))\] such that the diagram commutes. Let \[B:=(C\times\operatorname{Prof}(\Delta))\rtimes\operatorname{Bohr}(\Lambda)\] be the semi-direct product defined by \(\widehat{\alpha}^{\prime}\oplus\theta^{\prime}.\) Let \[p:\operatorname{Bohr}(\Delta)\to C=\operatorname{Bohr}(\Delta^{ \operatorname{Ab}})_{0}/(N\cap\operatorname{Bohr}(\Delta^{\operatorname{Ab}}) _{0})\] be the quotient epimorphism. \(\bullet\)_Fourth step._ We claim that \(B,\) together with the map \(\beta:\Gamma\to B,\) given by \[\beta(\delta,\lambda)=(p(\beta_{\Delta}(\delta)),\beta_{\Lambda}(\lambda)) \qquad\text{for all}\quad(\delta,\lambda)\in\Gamma,\] is a Bohr compactification for \(\Gamma=\Delta\rtimes\Lambda.\) First, we have to check that \(\beta\) is a homomorphism with dense image. Since \(p\circ\beta_{\Delta}\) and \(\beta_{\Lambda}\) are homomorphisms with dense image, it suffices to show that \[\beta(\lambda\delta\lambda^{-1},e)=((\widehat{\alpha}^{\prime}\oplus\theta^{ \prime})(\beta_{\Lambda}(\lambda))(p(\beta_{\Delta}(\delta)),e)\qquad\text{ for all}\quad(\delta,\lambda)\in\Gamma.\] This is indeed the case: since \(p\) is equivariant for the \(\Lambda\)-actions, we have \[p(\beta_{\Delta}(\lambda\delta\lambda^{-1}))=p(\theta_{b}(\lambda)\beta_{ \Delta}(\delta))=(\widehat{\alpha}^{\prime}\oplus\theta^{\prime})(\beta_{ \Lambda}(\lambda))p(\beta_{\Delta}(\delta)).\] Next, let \(\pi\) be a unitary representation of \(\Gamma\) on a finite dimensional vector space \(V.\) By Proposition 5, we have to show that there exists a unitary representation \(\widetilde{\pi}\) of \(B\) on \(V\) such that \(\pi=\widetilde{\pi}\circ\beta.\) Consider a decomposition of \(V=V_{1}\oplus\cdots\oplus V_{s}\) into irreducible \(\pi(\Delta)\)-invariant subspaces \(V_{i}\); denote by \(\sigma_{1},\ldots,\sigma_{s}\) the corresponding irreducible representations of \(\Delta.\) By Theorem 1, every \(\sigma_{i}\) is of the form \(\sigma_{i}=\chi_{i}\otimes\rho_{i}\) for some \(\chi_{i}\in\widehat{\Delta^{\operatorname{Ab}}}\) and \(\rho_{i}\in\widehat{\Delta}_{\operatorname{finite}}.\) We decompose every \(\chi_{i}\) as a product \(\chi_{i}=\chi_{i}^{\prime}\chi_{i}^{\prime\prime}\) with \(\chi_{i}^{\prime}\in\widehat{\Delta^{\operatorname{Ab}}}\) of finite order and \(\chi_{i}^{\prime\prime}\in\widehat{\Delta^{\operatorname{Ab}}}\) of infinite order. Since \(\chi_{i}^{\prime}\) has finite image, upon replacing \(\rho_{i}\) by \(\chi_{i}^{\prime}\otimes\rho_{i},\) we may and will assume that every non trivial \(\chi_{i}\) has infinite order. Fix \(i\in\{1,\ldots,s\}.\) We can extend \(\chi_{i}\) and \(\rho_{i}\) to unitary representations of \(\operatorname{Bohr}(\Delta),\) that is, we can find representations \(\widetilde{\chi}_{i}\) and \(\widetilde{\rho}_{i}\) of \(\operatorname{Bohr}(\Delta)\) on \(V_{i}\) such that \(\chi_{i}=\widetilde{\chi_{i}}\circ\beta_{\Delta}\) and \(\rho_{i}=\widetilde{\rho}_{i}\circ\beta_{\Delta}.\) By Proposition 12, the stabilizer \(\Gamma_{\sigma_{i}}\) of \(\sigma_{i}\) has finite index in \(\Gamma.\) It follows that the \(\Lambda\)-orbit of \(\sigma_{i}\) is finite, and this implies that \(\chi_{i}\in H;\) hence, \(\widetilde{\chi}_{i}\) factorizes through \[C=\operatorname{Bohr}(\Delta^{\operatorname{Ab}})_{0}/(N\cap\operatorname{ Bohr}(\Delta^{\operatorname{Ab}})_{0})\] and we have \(\chi_{i}=\widetilde{\chi}_{i}\circ(p\circ\beta_{\Delta}).\) Since \(\rho_{i}\) has finite image, \(\widetilde{\rho}_{i}\) factorizes through \(\operatorname{Prof}(\Delta)\). So, \(\widetilde{\sigma}_{i}:=\widetilde{\chi}_{i}\otimes\widetilde{\rho}_{i}\) is a unitary representation of \(C\times\operatorname{Prof}(\Delta)\) on \(V_{i}\). Set \[\widetilde{\pi_{\Delta}}:=\bigoplus_{i=1}^{s}\widetilde{\sigma}_{i}.\] Then \(\widetilde{\pi_{\Delta}}\) is a unitary representation of \(C\times\operatorname{Prof}(\Delta)\) on \(V\) such that \(\pi|_{\Delta}=\widetilde{\pi_{\Delta}}\circ(\beta|_{\Delta}).\) On the other hand, since \(\pi|_{\Lambda}\) is a finite dimensional representation of \(\Lambda,\) we can find a representation \(\widetilde{\pi_{\Lambda}}\) of \(\operatorname{Bohr}(\Lambda)\) on \(V\) such that \(\pi|_{\Lambda}=\widetilde{\pi_{\Lambda}}\circ(\beta|_{\Lambda}).\) For \(\lambda\in\Lambda\) and \(\delta\in\Delta,\) we have \[\widetilde{\pi_{\Delta}}(\beta(\lambda)\beta(\delta)\beta(\lambda )^{-1}) =\widetilde{\pi_{\Delta}}(\beta(\lambda\delta\lambda)^{-1})\] \[=\pi(\lambda\delta\lambda)^{-1})\] \[=\pi(\lambda)\pi(\delta)\pi(\lambda)^{-1}\] \[=\widetilde{\pi_{\Lambda}}(\beta(\lambda))\widetilde{\pi_{ \Delta}}(\beta(\delta))\widetilde{\pi_{\Lambda}}(\beta(\lambda))^{-1}.\] Since \(\beta\) has dense image in \(B,\) it follows that \[\widetilde{\pi_{\Delta}}(bab^{-1})=\widetilde{\pi_{\Lambda}}(b)\widetilde{\pi_ {\Delta}}(a)\widetilde{\pi_{\Lambda}}(b)^{-1}\qquad\text{for all}\quad(a,b)\in B\] and therefore the formula \[\widetilde{\pi}(a,b)=\widetilde{\pi_{\Delta}}(a)\widetilde{\pi_{\Lambda}}(b) \qquad\text{for all}\quad(a,b)\in B\] defines a unitary representation of \(B\) on \(V\) such that \(\pi=\widetilde{\pi}\circ\beta.\) ## 5. Proof of Theorem 3 Recall that we are assuming that \(\mathbf{G}\) is a connected, simply-connected and almost \(\mathbf{Q}\)-simple algebraic group. The group \(\mathbf{G}\) can be obtained from an absolutely simple algebraic group \(\mathbf{H}\) by the so-called restriction of scalars; more precisely (see [1, 6.21, (ii)]), there exists a number field \(K\) and an absolutely simple algebraic group \(\mathbf{H}\) over \(K\) which is absolutely simple with the following property: \(\mathbf{G}\) can be written as (more precisely, is \(\mathbf{Q}\)-isomorphic to) the \(\mathbf{Q}\)-group \(\mathbf{H}^{\sigma_{1}}\times\cdots\times\mathbf{H}^{\sigma_{s}},\) where the \(\sigma_{i}\)'s are the different (non conjugate) embeddings of \(K\) in \(\mathbf{C}.\) Assuming that \(\sigma_{1},\ldots,\sigma_{r_{1}}\) are the embeddings such that \(\sigma_{i}(K)\subset\mathbf{R},\) we can identify \(\mathbf{G}(\mathbf{R})\) with \[\mathbf{H}^{\sigma_{1}}(\mathbf{R})\times\cdots\times\mathbf{H}^{\sigma_{r_{1 }}}(\mathbf{R})\times\mathbf{H}^{\sigma_{r_{1}+1}}(\mathbf{C})\times\cdots \times\mathbf{H}^{\sigma_{r_{s}}}(\mathbf{C}).\] Let \(\mathbf{G}_{\mathrm{c}}\) be the product of the \(\mathbf{H}^{\sigma_{i}}\)'s for which \(\mathbf{H}^{\sigma_{i}}(\mathbf{R})\) is compact. We assume now that the real semisimple Lie group \(\mathbf{G}(\mathbf{R})\) is not locally isomorphic to a group of the form \(SO(m,1)\times L\) or \(SU(m,1)\times L\) for a compact Lie group \(L\). Let \(\Gamma\subset\mathbf{G}(\mathbf{Q})\) be an arithmetic subgroup. Set \(K:=\mathbf{G}_{\mathrm{c}}(\mathbf{R})\times\mathrm{Prof}(\Gamma)\) and let \(\beta:\Gamma\to K\) be defined by \(\beta(\gamma)=(p(\gamma),\alpha(\gamma)),\) where \(p:\mathbf{G}(\mathbf{R})\to\mathbf{G}_{\mathrm{c}}(\mathbf{R})\) is the canonical projection and \(\alpha:\Gamma\to\mathrm{Prof}(\Gamma)\) the map associated to \(\mathrm{Prof}(\Gamma).\) We claim that \((K,\beta)\) is a Bohr compactification of \(\Gamma,\) First, we show that \(\beta(\Gamma)\) has dense image. Observe that \(\mathbf{G}_{\mathrm{c}}(\mathbf{R})\) is connected (see [1, (24.6.c)]). By the Strong Approximation Theorem (see [10, Theorem 7.12]), \(p(\mathbf{G}(\mathbf{Z}))\) is dense in \(\mathbf{G}_{\mathrm{c}}(\mathbf{R})\). Since \(\mathbf{G}_{\mathrm{c}}(\mathbf{R})\) is connected and since \(\Gamma\) is commensurable to \(\mathbf{G}(\mathbf{Z}),\) it follows that \(p(\Gamma)\) is dense in \(\mathbf{G}_{\mathrm{c}}(\mathbf{R})\). Now, \(\alpha(\Gamma)\) is dense in \(\mathrm{Prof}(\Gamma)\) and \(\mathrm{Prof}(\Gamma)\) is totally disconnected. As in the first step of the proof of Theorem 1, we conclude that \(\beta(\Gamma)\) is dense in \(K.\) Let \(\pi:\Gamma\to U(n)\) be a finite dimensional unitary representation of \(\Gamma.\) Then, by Margulis' superrigidity theorem (see [12, Chap. VIII, Theorem B]), [13, Corollary 16.4.1]), there exists a continuous homomorphism \(\rho_{1}:\mathbf{G}(\mathbf{R})\to U(n)\) and a homomorphism \(\rho_{2}:\Gamma\to U(n)\) such that 1. \(\rho_{2}(\Gamma)\) is finite; 2. \(\rho_{1}(g)\rho_{2}(\gamma)=\rho_{2}(\gamma)\rho_{1}(g)\) for all \(g\in\mathbf{G}(\mathbf{R})\) and \(\gamma\in\Gamma;\) 3. \(\pi(\gamma)=\rho_{1}(\gamma)\rho_{2}(\gamma)\) for all \(\gamma\in\Gamma.\) By a classical result of Segal and von Neumann [20], \(\rho_{1}\) factorizes through \(\mathbf{G}_{\mathrm{c}}(\mathbf{R}),\) that is, \(\rho_{1}=\rho_{1}^{\prime}\circ p\) for a unitary representation \(\rho_{1}^{\prime}\) of \(\mathbf{G}_{\mathrm{c}}(\mathbf{R}).\) It follows from (i) that \(\rho_{2}=\rho_{2}^{\prime}\circ\alpha\) for a unitary representation \(\rho_{2}^{\prime}\) of \(\mathrm{Prof}(\Gamma).\) Moreover, (ii) and (iii) show that \(\pi=(\rho_{1}|_{\Gamma})\otimes\rho_{2}.\) Hence, \(\pi=(\rho_{1}^{\prime}\otimes\rho_{2}^{\prime})\circ\otimes\beta\). We conclude by Proposition 5 that \((K,\beta)\) is a Bohr compactification of \(\Gamma\). ## 6. A few examples We compute the Bohr compactification for various examples of arithmetic groups. 1. For an integer \(n\geq 1\), the \((2n+1)\)-dimensional Heisenberg group is the unipotent \({\bf Q}\)-group \({\bf H}_{2n+1}\) of matrices of the form \[m(x_{1},\ldots,x_{n},y_{1},\ldots,y_{n},z):=\left(\begin{array}{cccc}1&x_{1} &\ldots&x_{n}&z\\ 0&1&\ldots&0&y_{1}\\ \vdots&\ddots&\ddots&\vdots&\vdots\\ 0&0&\ldots&1&y_{n}\\ 0&0&\ldots&0&1\end{array}\right).\] The arithmetic group \(\Gamma={\bf H}_{2n+1}({\bf Z})\) is nilpotent of step \(2\); its commutator subgroup \([\Gamma,\Gamma]\) coincides with its center \(\{m(0,0,z):z\in{\bf Z}\}\). So, \(\Gamma^{\rm Ab}\cong{\bf Z}^{2n}\). We have, by Theorem 1, \[{\rm Bohr}(\Gamma)\cong{\rm Bohr}({\bf Z}^{2n})_{0}\times{\rm Prof}(\Gamma)\] and hence, by Proposition 11 and Proposition 16 \[{\rm Bohr}(\Gamma)\cong(\prod_{\omega\in\mathfrak{c}}{\bf A}/{\bf Q})\times \prod_{p\ {\rm prime}}{\bf H}_{2n+1}({\bf Z}_{p}).\] 2. Let \({\bf G}=SL_{n}\) for \(n\geq 3\) or \({\bf G}=Sp_{2n}\) for \(n\geq 2.\) Then \(SL_{n}({\bf Z})\) and \(Sp_{2n}({\bf Z})\) are non cocompact arithmetic lattices in \(SL_{n}({\bf R})\) and \(Sp_{2n}({\bf R})\), respectively. Hence, we have, by Corollary 4, \({\rm Bohr}(SL_{n}({\bf Z}))={\rm Prof}(SL_{n}({\bf Z}))\) and \({\rm Bohr}(Sp_{2n}({\bf Z}))={\rm Prof}(Sp_{2n}({\bf Z}))\). Since \(SL_{n}({\bf Z})\) and \(Sp_{2n}({\bf Z})\) have the congruence subgroup property, it follows that \[{\rm Bohr}(SL_{n}({\bf Z}))\cong\prod_{p\ {\rm prime}}SL_{n}({\bf Z}_{p})\cong SL_{n}({\rm Prof }({\bf Z}))\] and similarly \[{\rm Bohr}(Sp_{2n}({\bf Z}))\cong\prod_{p\ {\rm prime}}Sp_{2n}({\bf Z}_{p})\cong Sp_{2n}({\rm Prof }({\bf Z})).\] 3. The group \(\Gamma=SL_{2}({\bf Z}[\sqrt{2}])\) embeds as a non cocompact arithmetic lattice of \(SL_{2}({\bf R})\times SL_{2}({\bf R}).\) So, by Corollary 4, we have \[{\rm Bohr}(SL_{2}({\bf Z}[\sqrt{2}]))\cong{\rm Prof}(SL_{2}({\bf Z}[\sqrt{2}])).\] Moreover, since \(\Gamma\) has the congruence subgroup property (see [11, Corollaire 3]), it follows that \[\operatorname{Bohr}(SL_{2}(\mathbf{Z}[\sqrt{2}]))\cong\operatorname{Cong}(SL_{2}( \mathbf{Z}[\sqrt{2}])).\] 4. For \(n\geq 4\), consider the quadratic form \[q(x_{1},\ldots,x_{n})=x_{1}^{2}+\cdots+x_{n-1}^{2}-\sqrt{2}x_{n}^{2}-\sqrt{2} x_{n+1}^{2}\] The group \(\mathbf{G}=SO(q)\) of unimodular \((n+1)\times(n+1)\)-matrices which preserve \(q\) is an almost simple algebraic group over the number field \(\mathbf{Q}[\sqrt{2}].\) The subgroup \(\Gamma=SO(q,\mathbf{Z}[\sqrt{2}])\) of \(\mathbf{Z}[\sqrt{2}]\)-rational points in \(\mathbf{G}\) embeds as a cocompact lattice of the semisimple real Lie group \(SO(n+1)\times SO(n-1,2)\) via the map \[SO(q,\mathbf{Q}[\sqrt{2}])\to SO(n+1)\times SO(n-1,2),\,\gamma\mapsto(\gamma ^{\sigma},\gamma),\] where \(\sigma\) is the field automorphism of \(\mathbf{Q}[\sqrt{2}]\) given by \(\sigma(\sqrt{2})=-\sqrt{2}\); so, \(SO(n+1)\times SO(n-1,2)\) is the group of real points of the \(\mathbf{Q}\)-group \(R_{\mathbf{Q}[\sqrt{2}]/\mathbf{Q}}(\mathbf{G})\) obtained by restriction of scalars from the \(\mathbf{Q}[\sqrt{2}]\)-group \(\mathbf{G}\). Observe that \(R_{\mathbf{Q}[\sqrt{2}]/\mathbf{Q}}(\mathbf{G})\) is almost \(\mathbf{Q}[\sqrt{2}]\)-simple since \(\mathbf{G}\) is almost \(\mathbf{Q}\)-simple. By Theorem 3, we have \[\operatorname{Bohr}(SO(q,\mathbf{Z}[\sqrt{2}]))\cong SO(n+1)\times\operatorname {Prof}(SO(q,\mathbf{Z}[\sqrt{2}]).\] 5. For \(d\geq 2\), let \(D\) be a central division algebra over \(\mathbf{Q}\) such that \(D\otimes_{\mathbf{Q}}\mathbf{R}\) is isomorphic to the algebra \(M_{d}(\mathbf{R})\) of real \(d\times d\)-matrices. There exists a subring \(\mathcal{O}\) of \(D\) which is a \(\mathbf{Z}\)-lattice in \(D\) (a so-called order in \(D\)). There is an embedding \(\varphi:D\to M_{d}(\mathbf{R})\) such that \(\varphi(SL_{1}(D)\subset SL_{d}(\mathbf{Q})\) and such that \(\Gamma:=\varphi(SL_{1}(\mathcal{O})\) is an arithmetic cocompact lattice in \(SL_{d}(\mathbf{R})\), where \(SL_{1}(D)\) is the group of norm one elements in \(D\); for all this, see [12, SS6.8.i]. For \(d\geq 2\), we have \[\operatorname{Bohr}(\Gamma)\cong\operatorname{Prof}(\Gamma).\] So, this is an example of a _cocompact_ lattice \(\Gamma\) in a simple real Lie group for which there exists no homomorphism \(\Gamma\to U(n)\) with infinite image; the existence of such examples was mentioned in [12, (16.4.3)] 6. For \(n\geq 3\), let \(\Gamma\) be the semi-direct product \(\mathbf{Z}^{n}\rtimes SL_{n}(\mathbf{Z})\), induced by the usual linear action of \(SL_{n}(\mathbf{Z})\) on \(\mathbf{R}^{n}.\) The dual action of \(SL_{n}(\mathbf{Z})\) on \(\widehat{\mathbf{Z}^{n}}\cong\mathbf{R}^{n}/\mathbf{Z}^{n}\) is given by \[SL_{n}(\mathbf{Z})\times\mathbf{R}^{n}/\mathbf{Z}^{n}\to\mathbf{R}^{n}/ \mathbf{Z}^{n},\,(g,x+\mathbf{Z}^{n})\mapsto{}^{t}gx+\mathbf{Z}^{n}.\] It is well-known and easy to show that the subgroup of \(SL_{n}({\bf Z})\)-periodic orbits in \(\widehat{{\bf Z}^{n}}\) corresponds to \({\bf Q}^{n}/{\bf Z}^{n}\), that is, to the characters of finite image. It follows from Theorem 2 that \[\operatorname{Bohr}({\bf Z}^{n}\rtimes SL_{n}({\bf Z}))\cong\operatorname{Bohr} (SL_{n}({\bf Z}))_{0}\times\operatorname{Prof}({\bf Z}^{n}\rtimes SL_{n}({\bf Z })).\] For \(n\geq 3\), we have therefore \[\operatorname{Bohr}({\bf Z}^{n}\rtimes SL_{n}({\bf Z}))\cong\operatorname{Prof }({\bf Z}^{n}\rtimes SL_{n}({\bf Z}))\cong\prod_{p\text{ prime}}{\bf Z}_{p} \rtimes SL_{n}({\bf Z}_{p}).\]

2306.07611

Outerplane bipartite graphs with isomorphic resonance graphs

We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance graphs. Moreover, two additional characterizations are expressed in terms of resonance digraphs and via local structures of inner duals of 2-connected outerplane bipartite graphs, respectively.

Simon Brezovnik, Zhongyuan Che, Niko Tratnik, Petra Žigert Pleteršek

2023-06-13T08:09:26Z

http://arxiv.org/abs/2306.07611v1

# Outerplane bipartite graphs with isomorphic resonance graphs ###### Abstract We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance graphs. Moreover, two additional characterizations are expressed in terms of resonance digraphs and via local structures of inner duals of 2-connected outerplane bipartite graphs, respectively. _keywords_: isomorphic resonance graphs, 2-connected outerplane bipartite graph, resonance digraph, inner dual **Key words**: isomorphic resonance graphs, 2-connected outerplane bipartite graph, resonance digraph, inner dual Introduction Resonance graphs reflect interactions between perfect matchings (in chemistry known as Kekule structures) of plane bipartite graphs. These graphs were independently introduced by chemists (El-Basil [8, 9], Grundler [10]) and also by mathematicians (Zhang, Guo, and Chen [15]) under the name \(Z\)-transformation graph. Initially, resonance graphs were investigated on hexagonal systems [15]. Later, this concept was generalized to plane bipartite graphs, see [14, 17, 18, 19]. In recent years, various structural properties of resonance graphs of (outer)plane bipartite graphs were obtained [4, 5, 6, 7]. The problem of characterizing 2-connected outerplane bipartite graphs with isomorphic resonance graphs is interesting and nontrivial. There are outerplane bipartite graphs \(G\) and \(G^{\prime}\) whose inner duals are isomorphic paths but with non-isomorphic resonance graphs. For example, let \(G\) be a linear benzenoid chain (a chain in which every non-terminal hexagon is linear) with \(n\) hexagons, and let \(G^{\prime}\) be a fibonaccene (a benzenoid chain in which every non-terminal hexagon is angular, see [11]) with \(n\) hexagons, where \(n>2\). Then the inner dual \(T\) of graph \(G\) is isomorphic to the inner dual \(T^{\prime}\) of graph \(G^{\prime}\), since \(T\) and \(T^{\prime}\) are both paths on \(n\) vertices. However, their resonance graphs \(R(G)\) and \(R(G^{\prime})\) are not isomorphic: \(R(G)\) is a path and \(R(G^{\prime})\) is a Fibonacci cube, see Figure 1. In [1, 2] the problem of finding catacondensed even ring systems (shortly called CERS) with isomorphic resonance graphs was investigated. More precisely, the relation of evenly homeomorphic CERS was introduced and it was proved that if two CERS are evenly homeomorphic, then their resonance graphs are isomorphic. Conversely, it is true for catacondensed even ring chains but not for all CERS [2]. Moreover, in [3] it was proved that if two 2-connected outerplane bipartite graphs are evenly homeomorphic, then their resonance graphs are isomorphic. In papers [2, 3], the following open problem was stated. **Problem 1**.: _Characterize 2-connected outerplane bipartite graphs with isomorphic resonance graphs._ Figure 1: Resonance graphs of the linear benzenoid chain and fibonaccene with three hexagons. In this paper we solve the above problem. Firstly, we state all the needed definitions and previous results as preliminaries. The main result, Theorem 3.4, is presented in Section 3. The necessity part of this result is stated as Theorem 3.2. Moreover, in Corollary 3.3 we show that two \(2\)-connected outerplane bipartite graphs have isomorphic resonance graphs if and only if they can be properly two colored so that their resonance digraphs are isomorphic. In addition, by Corollary 3.6 it follows that \(2\)-connected outerplane bipartite graphs \(G\) and \(G^{\prime}\) have isomorphic resonance graphs if and only if there exists an isomorphism \(\alpha\) between their inner duals \(T\) and \(T^{\prime}\) such that for any \(3\)-path \(xyz\) of \(T\), the triple \((x,y,z)\) is regular if and only if \((\alpha(x),\alpha(y),\alpha(z))\) is regular. ## 2 Preliminaries We say that two faces of a plane graph \(G\) are _adjacent_ if they have an edge in common. An _inner face_ (also called a _finite face_) adjacent to the _outer face_ (also called the _infinite face_) is named a _peripheral face_. In addition, we denote the set of edges lying on some face \(s\) of \(G\) by \(E(s)\). The subgraph induced by the edges in \(E(s)\) is the _periphery of \(s\)_ and denoted by \(\partial s\). The periphery of the outer face is also called the _periphery of \(G\)_ and denoted by \(\partial G\). Moreover, for a peripheral face \(s\) and the outer face \(s_{0}\), the subgraph induced by the edges in \(E(s)\cap E(s_{0})\) is called the _common periphery_ of \(s\) and \(G\), and denoted by \(\partial s\cap\partial G\). The vertices of \(G\) that belong to the outer face are called _peripheral vertices_ and the remaining vertices are _interior vertices_. Furthermore, an _outerplane graph_ is a plane graph in which all vertices are peripheral vertices. A bipartite graph \(G\) is _elementary_ if and only if it is connected and each edge is contained in some perfect matching of \(G\). Any elementary bipartite graph other than \(K_{2}\) is \(2\)-connected. Hence, if \(G\) is a plane elementary bipartite graph with more than two vertices, then the periphery of each face of \(G\) is an even cycle. A peripheral face \(s\) of a plane elementary bipartite graph \(G\) is called _reducible_ if the subgraph \(H\) of \(G\) obtained by removing all internal vertices (if exist) and edges on the common periphery of \(s\) and \(G\) is elementary. The _inner dual_ of a plane graph \(G\) is a graph whose vertex set is the set of all inner faces of \(G\), and two vertices being adjacent if the corresponding faces are adjacent. A _perfect matching_\(M\) of a graph \(G\) is a set of independent edges of \(G\) such that every vertex of \(G\) is incident with exactly one edge from \(M\). An even cycle \(C\) of \(G\) is called \(M\)_-alternating_ if the edges of \(C\) appear alternately in \(M\) and in \(E(G)\setminus M\). Also, a face \(s\) of a \(2\)-connected plane bipartite graph is \(M\)_-resonant_ if \(\partial s\) is an \(M\)-alternating cycle. Let \(G\) be a plane elementary bipartite graph and \(\mathcal{M}(G)\) be the set of all perfect matchings of \(G\). Assume that \(s\) is a reducible face of \(G\). By [13], the common periphery of \(s\) and \(G\) is an odd length path \(P\). By Proposition 4.1 in [4], \(P\) is \(M\)-alternating for any perfect matching \(M\) of \(G\), and \(\mathcal{M}(G)=\mathcal{M}(G;P^{-})\cup\mathcal{M}(G;P^{+})\), where \(\mathcal{M}(G;P^{-})\) is the set of perfect matchings \(M\) of \(G\) such that two end edges of \(P\) are not contained in \(M\) or \(P\) is a single edge and not contained in \(M\); \(\mathcal{M}(G;P^{+})\) is the set of perfect matchings \(M\) of \(G\) such that two end edges of \(P\) are contained in \(M\) or \(P\) is a single edge and contained in \(M\). Furthermore, \({\cal M}(G;P^{-})\) and \({\cal M}(G;P^{+})\) can be partitioned as \[{\cal M}(G;P^{-}) = {\cal M}(G;P^{-},\partial s)\cup{\cal M}(G;P^{-},\overline{\partial s })\] \[{\cal M}(G;P^{+}) = {\cal M}(G;P^{+},\partial s)\cup{\cal M}(G;P^{+},\overline{ \partial s})\] where \({\cal M}(G;P^{-},\partial s)\) (resp., \({\cal M}(G;P^{-},\overline{\partial s})\)) is the set of perfect matchings \(M\) in \({\cal M}(G;P^{-})\) such that \(s\) is \(M\)-resonant (resp., not \(M\)-resonant), and \({\cal M}(G;P^{+},\partial s)\) (resp., \({\cal M}(G;P^{+},\overline{\partial s})\)) is the set of perfect matchings \(M\) in \({\cal M}(G;P^{+})\) such that \(s\) is \(M\)-resonant (resp., not \(M\)-resonant). Let \(G\) be a plane bipartite graph with a perfect matching. The _resonance graph_ (also called \(Z\)_-transformation graph_) \(R(G)\) of \(G\) is the graph whose vertices are the perfect matchings of \(G\), and two perfect matchings \(M_{1},M_{2}\) are adjacent whenever their symmetric difference forms the edge set of exactly one inner face \(s\) of \(G\). In this case, we say that the edge \(M_{1}M_{2}\) has the _face-label_\(s\). Let \(H\) and \(K\) be two graphs with vertex sets \(V(H)\) and \(V(K)\), respectively. The Cartesian product of \(H\) and \(K\) is a graph with the vertex set \(\{(h,k)\mid h\in V(H),k\in V(K)\}\) such that two vertices \((h_{1},k_{1})\) and \((h_{2},k_{2})\) are adjacent if either \(h_{1}h_{2}\) is an edge of \(H\) and \(k_{1}=k_{2}\) in \(K\) or \(k_{1}k_{2}\) is an edge of \(K\) and \(h_{1}=h_{2}\) in \(H\). Assume that \(G\) is a disjoint union of two plane bipartite graphs \(G_{1}\) and \(G_{2}\). Then by definitions, the resonance graph \(R(G)\) is the Cartesian product of \(R(G_{1})\) and \(R(G_{2})\). Assume that \(G\) is a plane bipartite graph whose vertices are properly colored black and white such that adjacent vertices receive different colors. Let \(M\) be a perfect matching of \(G\). An \(M\)-alternating cycle \(C\) of \(G\) is \(M\)_-proper_ (resp., \(M\)_-improper_) if every edge of \(C\) belonging to \(M\) goes from white to black vertex (resp., from black to white vertex) along the clockwise orientation of \(C\). A plane elementary bipartite graph \(G\) with a perfect matching has a unique perfect matching \(M_{\hat{0}}\) (resp., \(M_{\hat{1}}\)) such that \(G\) has no proper \(M_{\hat{0}}\)-alternating cycles (resp., no improper \(M_{\hat{1}}\)-alternating cycles) [17]. The _resonance digraph_, denoted by \(\overrightarrow{R}(G)\), is the digraph obtained from \(R(G)\) by adding a direction for each edge so that \(\overrightarrow{M_{1}M_{2}}\) is a directed edge from \(M_{1}\) to \(M_{2}\) if \(M_{1}\oplus M_{2}\) is a proper \(M_{1}\)-alternating (or, an improper \(M_{2}\)-alternating) cycle surrounding an inner face of \(G\). Let \({\cal M}(G)\) be the set of all perfect matchings of \(G\). Then a partial order \(\leq\) can be defined on \({\cal M}(G)\) such that \(M^{\prime}\leq M\) if there is a directed path from \(M\) to \(M^{\prime}\) in \(\overrightarrow{R}(G)\). When \(G\) is a plane elementary bipartite graph, \({\cal M}(G)\) is a finite distributive lattice whose Hasse diagram is isomorphic to \(\overrightarrow{R}(G)\)[12]. It is well known that \(M_{\hat{0}}\) is the minimum and \(M_{\hat{1}}\) the maximum of the distributive lattice \({\cal M}(G)\)[12, 16]. We now present the concept of a reducible face decomposition, see [18] and [4, 5]. Firstly, we introduce the _bipartite ear decomposition_ of a plane elementary bipartite graph \(G\) with \(n\) inner faces. Starting from an edge \(e\) of \(G\), join its two end vertices by a path \(P_{1}\) of odd length and proceed inductively to build a sequence of bipartite graphs as follows. If \(G_{i-1}=e+P_{1}+\cdots+P_{i-1}\) has already been constructed, add the \(i\)th ear \(P_{i}\) of odd length by joining any two vertices belonging to different bipartition sets of \(G_{i-1}\) such that \(P_{i}\) has no internal vertices in common with the vertices of \(G_{i-1}\). A bipartite ear decomposition of a plane elementary bipartite graph \(G\) is called a _reducible face decomposition_ (shortly \(RFD\)) if \(G_{1}\) is a periphery of an inner face \(s_{1}\) of \(G\), and the \(i\)th ear \(P_{i}\) lies in the exterior of \(G_{i-1}\) such that \(P_{i}\) and a part of the periphery of \(G_{i-1}\) surround an inner face \(s_{i}\) of \(G\) for all \(i\in\{2,\ldots,n\}\). For such a decomposition, we use notation \(RFD(G_{1},G_{2},\ldots,G_{n})\), where \(G_{n}=G\). It was shown [18] that a plane bipartite graph with more than two vertices is elementary if and only if it has a reducible face decomposition. Let \(H\) be a convex subgraph of a graph \(G\). The _peripheral convex expansion_ of \(G\) with respect to \(H\), denoted by \(pce(G;H)\), is the graph obtained from \(G\) by the following procedure: * Replace each vertex \(v\) of \(H\) by an edge \(v_{1}v_{2}\). * Insert edges between \(v_{1}\) and the neighbours of \(v\) in \(V(G)\setminus V(H)\). * Insert the edges \(u_{1}v_{1}\) and \(u_{2}v_{2}\) whenever \(u,v\) of \(H\) are adjacent in \(G\). Two edges \(uv\) and \(xy\) of a connected graph \(G\) are said to be in _relation_\(\Theta\) (also known as _Djokovic-Winkler relation_), denoted by \(uv\Theta xy\), if \(d_{G}(u,x)+d_{G}(v,y)\neq d_{G}(u,y)+d_{G}(v,x)\). It is well known that if \(G\) is a plane elementary bipartite graph, then its resonance graph \(R(G)\) is a median graph [16] and therefore, the relation \(\Theta\) is an equivalence relation on the set of edges \(E(R(G))\). Let \(xy\) be an edge of a resonance graph \(R(G)\) and \(F_{xy}=\{e\in E(R(G))\mid e\Theta xy\}\) be the set of all edges in relation \(\Theta\) with \(xy\) in \(R(G)\), where \(G\) is a plane elementary bipartite graph. By Proposition 3.2 in [4], all edges in \(F_{xy}\) have the same face-label. On the other hand, two edges with the same face-label can be in different \(\Theta\)-classes of \(R(G)\). We now present several results from previous papers which will be needed later. **Proposition 2.1**: _[_13_]_ _Let \(G\) be a plane elementary bipartite graph other than \(K_{2}\). Then the outer cycle of \(G\) is improper \(M_{\hat{0}}\)-alternating as well as proper \(M_{\hat{1}}\)-alternating, where \(M_{\hat{0}}\) is the minimum and \(M_{\hat{1}}\) the maximum in the finite distributive lattice \({\cal M}(G)\)._ The induced subgraph of a graph \(G\) on \(W\subseteq V(G)\) will be denoted as \(\langle W\rangle\). **Theorem 2.2**: _[_4_]_ _Assume that \(G\) is a plane elementary bipartite graph and \(s\) is a reducible face of \(G\). Let \(P\) be the common periphery of \(s\) and \(G\). Let \(H\) be the subgraph of \(G\) obtained by removing all internal vertices and edges of \(P\). Assume that \(R(G)\) and \(R(H)\) are resonance graphs of \(G\) and \(H\) respectively. Let \(F\) be the set of all edges in \(R(G)\) with the face-label \(s\). Then \(F\) is a \(\Theta\)-class of \(R(G)\) and \(R(G)-F\) has exactly two components \(\langle{\cal M}(G;P^{-})\rangle\) and \(\langle{\cal M}(G;P^{+})\rangle\). Furthermore,_ _(i) \(F\) is a matching defining an isomorphism between \(\langle{\cal M}(G;P^{-},\partial s)\rangle\) and \(\langle{\cal M}(G;P^{+},\partial s)\rangle\);_ _(ii) \(\langle{\cal M}(G;P^{-},\partial s)\rangle\) is convex in \(\langle{\cal M}(G;P^{-})\rangle\), \(\langle{\cal M}(G;P^{+},\partial s)\rangle\) is convex in \(\langle{\cal M}(G;P^{+})\rangle\);_ _(iii) \(\langle{\cal M}(G;P^{-})\rangle\) and \(\langle{\cal M}(G;P^{+})\rangle\) are median graphs, where \(\langle{\cal M}(G;P^{-})\rangle\cong R(H)\)._ _In particular, \(R(G)\) can be obtained from \(R(H)\) by a peripheral convex expansion if and only if \({\cal M}(G;P^{+})={\cal M}(G;P^{+},\partial s)\)._ **Proposition 2.3**: _[_5_]_ _Let \(G\) be a 2-connected outerplane bipartite graph. Assume that \(s\) is a reducible face of \(G\). Then \(s\) is adjacent to exactly one inner face of \(G\)._ For any 2-connected outerplane bipartite graph \(G\) and a reducible face \(s\) of \(G\), we know from [13] that the common periphery of \(s\) and \(G\) is an odd length path \(P\). By Proposition 2.3, \(s\) is adjacent to exactly one inner face \(s^{\prime}\) of \(G\). It is clear that the common edge of \(s\) and \(s^{\prime}\) is a single edge \(e\). Therefore, \(E(s)=e\cup E(P)\) and the odd length path \(P\) must have at least three edges. **Theorem 2.4**: _[_5_]_ _Let \(G\) be a 2-connected outerplane bipartite graph. Assume that \(s\) is a reducible face of \(G\) and \(P\) is the common periphery of \(s\) and \(G\). Let \(H\) be the subgraph of \(G\) obtained by removing all internal vertices and edges of \(P\). Then \(R(G)\) can be obtained from \(R(H)\) by a peripheral convex expansion, that is, \(R(G)=pce(R(H);T)\) where the set of all edges between \(R(H)\) and \(T\) is a \(\Theta\)-class of \(R(G)\) with the face-label \(s\). Moreover,_ * \(R(G)\) _has exactly one more_ \(\Theta\)_-class than_ \(R(H)\) _and it has the face-label_ \(s\)_, and_ * _each of other_ \(\Theta\)_-classes of_ \(R(G)\) _can be obtained from the corresponding_ \(\Theta\)_-class of_ \(R(H)\) _with the same face-label (adding more edges if needed)._ **Theorem 2.5**: _[_5_]_ _Let \(G\) be a 2-connected outerplane bipartite graph and \(R(G)\) be its resonance graph. Assume that \(G\) has a reducible face decomposition \(G_{i}(1\leq i\leq n)\) where \(G_{n}=G\) associated with a sequence of inner faces \(s_{i}(1\leq i\leq n)\) and a sequence of odd length ears \(P_{i}(2\leq i\leq n)\). Then \(R(G)\) can be obtained from the one edge graph by a sequence of peripheral convex expansions with respect to the above reducible face decomposition of \(G\). Furthermore, \(R(G_{1})=K_{2}\) where the edge has the face-label \(s_{1}\); for \(2\leq i\leq n\), \(R(G_{i})=pce(R(G_{i-1});T_{i-1})\) where the set of all edges between \(R(G_{i-1})\) and \(T_{i-1}\) is a \(\Theta\)-class in \(R(G_{i})\) with the face-label \(s_{i}\), \(R(G_{i})\) has exactly one more \(\Theta\)-class than \(R(G_{i-1})\) and it has the face-label \(s_{i}\), each of other \(\Theta\)-classes of \(R(G_{i})\) can be obtained from the corresponding \(\Theta\)-class of \(R(G_{i-1})\) with the same face-label (adding more edges if needed)._ The _induced graph_\(\Theta(R(G))\) on the \(\Theta\)-classes of \(R(G)\) is a graph whose vertex set is the set of \(\Theta\)-classes, and two vertices \(E\) and \(F\) of \(\Theta(R(G))\) are adjacent if \(R(G)\) has two incident edges \(e\in E\) and \(f\in F\) such that \(e\) and \(f\) are not contained in a common 4-cycle of \(R(G)\). It is well-known that if \(s\) and \(t\) are two face labels of incident edges of a 4-cycle of \(R(G)\), then \(s\) and \(t\) are vertex disjoint in \(G\) and \(M\)-resonant for a perfect matching \(M\) of \(G\); if \(s\) and \(t\) are two face labels of incident edges not contained in a common 4-cycle of \(R(G)\), then \(s\) and \(t\) are adjacent in \(G\) and \(M\)-resonant for a perfect matching \(M\) of \(G\). **Theorem 2.6**: _[_5_]_ _Let \(G\) be a 2-connected outerplane bipartite graph and \(R(G)\) be its resonance graph. Then the graph \(\Theta(R(G))\) induced by the \(\Theta\)-classes of \(R(G)\) is a tree and isomorphic to the inner dual of \(G\)._ ## 3 Main results In this section, we characterize resonance graphs of 2-connected outerplane bipartite graphs with isomorphic resonance graphs. We start with the following lemma, which is a more detailed version of Theorem 2.4 [5] and Lemma 1 [7] for 2-connected outerplane bipartite graphs. We use \(\mathcal{M}(G;e)\) to denote the set of perfect matchings of a graph \(G\) containing the edge \(e\) of \(G\). **Lemma 3.1**: _Let \(G\) be a 2-connected outerplane bipartite graph. Assume that \(s\) is a reducible face of \(G\), \(P\) is the common periphery of \(s\) and \(G\) and \(e\in E(s)\) is a unique edge that does not belong to \(P\). Let \(H\) be the subgraph of \(G\) obtained by removing all internal vertices and edges of \(P\)._ _Further, assume that \(H\) has more than two vertices. Let \(M_{\hat{0}}\) be the minimum and \(M_{\hat{1}}\) be the maximum in the distributive lattice \(\mathcal{M}(H)\). Then \(e\) is contained in exactly one of \(M_{\hat{0}}\) and \(M_{\hat{1}}\)._ * _Suppose that_ \(M_{\hat{0}}\notin\mathcal{M}(H;e)\)_. Let_ \(\widehat{M_{\hat{0}}}\) _be the perfect matching of_ \(G\) _such that_ \(M_{\hat{0}}\subseteq\widehat{M_{\hat{0}}}\) _and_ \(\widehat{M_{\hat{1}}}\) _be the perfect matching of_ \(G\) _such that_ \(M_{\hat{1}}\setminus\{e\}\subseteq\widehat{M_{\hat{1}}}\)_. Then_ \(\widehat{M_{\hat{0}}}\in\mathcal{M}(G;P^{-},\overline{\partial s})\) _is the minimum, and_ \(\widehat{M_{\hat{1}}}\in\mathcal{M}(G;P^{+},\partial s)\) _is the maximum of the finite distributive lattice_ \(\mathcal{M}(G)\)_._ * _Suppose that_ \(M_{\hat{0}}\in\mathcal{M}(H;e)\)_. Let_ \(\widehat{M_{\hat{0}}}\) _be the perfect matching of_ \(G\) _such that_ \(M_{\hat{0}}\setminus\{e\}\subseteq\widehat{M_{\hat{0}}}\) _and_ \(\widehat{M_{\hat{1}}}\) _be the perfect matching of_ \(G\) _such that_ \(M_{\hat{1}}\subseteq\widehat{M_{\hat{1}}}\)_. Then_ \(\widehat{M_{\hat{0}}}\in\mathcal{M}(G;P^{+},\partial s)\) _is the minimum, and_ \(\widehat{M_{\hat{1}}}\in\mathcal{M}(G;P^{-},\overline{\partial s})\) _is the maximum of the finite distributive lattice_ \(\mathcal{M}(G)\)_._ **Proof.** Assume that \(e\) is the unique edge of \(E(s)\) that does not belong to \(P\). By Theorem 2.4, \(R(G)=pce(R(H),\langle\mathcal{M}(H;e)\rangle)\), where the edges between \(R(H)\) and \(\langle\mathcal{M}(H;e)\rangle\) is a \(\Theta\)-class of \(R(G)\) with the face-label \(s\). Moreover, \(R(H)\cong\langle\mathcal{M}(G;P^{-})\rangle\) and \(\langle\mathcal{M}(H;e)\rangle\cong\langle\mathcal{M}(G;P^{-},\partial s) \rangle\cong\langle\mathcal{M}(G;P^{+},\partial s)\rangle\). See Figure 2. Any 2-connected outerplane bipartite graph has two perfect matchings whose edges form alternating edges on the outer cycle of the graph. By Proposition 2.1, one is the maximum and the other is the minimum in the finite distributive lattice on the set of perfect matchings of the graph. Figure 2: A peripheral convex expansion of the resonance graph \(R(G)\). Let \(M_{\hat{0}}\) be the minimum and \(M_{\hat{1}}\) be the maximum in the finite distributive lattice \({\cal M}(H)\). Then the outer cycle of \(H\) is both improper \(M_{\hat{0}}\)-alternating and proper \(M_{\hat{1}}\)-alternating. Note that \(e\) is an edge of the outer cycle of \(H\). Then \(e\) is contained in exactly one of \(M_{\hat{0}}\) and \(M_{\hat{1}}\). We will show only part \((i)\), since the proof of \((ii)\) is analogous. Suppose that \(M_{\hat{0}}\) does not contain the edge \(e\). Recall that the outer cycle of \(H\) is improper \(M_{\hat{0}}\)-alternating. By the definition of \(\widehat{M_{\hat{0}}}\), the outer cycle of \(G\) is improper \(\widehat{M_{\hat{0}}}\)-alternating. Therefore, \(\widehat{M_{\hat{0}}}\) is the minimum of the distributive lattice \({\cal M}(G)\) since \(G\) is an outerplane bipartite graph. Note that three consecutive edges on the periphery of \(s\), namely \(e\) and two end edges of \(P\), are not contained in \(\widehat{M_{\hat{0}}}\). Then \(s\) is not \(\widehat{M_{\hat{0}}}\)-resonant. So, \(\widehat{M_{\hat{0}}}\in{\cal M}(G;P^{-},\overline{\partial s})\). Note that \(M_{\hat{1}}\) contains the edge \(e\) since \(M_{\hat{0}}\) does not contain \(e\) by our assumption for part \((i)\). Recall that the outer cycle of \(H\) is proper \(M_{\hat{1}}\)-alternating. By the definition of \(\widehat{M_{\hat{1}}}\), \(\widehat{M_{\hat{1}}}\in{\cal M}(G;P^{+})\) and the outer cycle of \(G\) is again proper \(\widehat{M_{\hat{1}}}\)-alternating. It follows that \(s\) is \(\widehat{M_{\hat{1}}}\)-resonant. Consequently, \(\widehat{M_{\hat{1}}}\in{\cal M}(G;P^{+},\partial s)\) is the maximum of the finite distributive lattice \({\cal M}(G)\). \(\Box\) To state the next theorem, we need the following notation. Let \(G\) and \(G^{\prime}\) be 2-connected outerplane bipartite graphs. Suppose that \(\phi\) is an isomorphism between resonance graphs \(R(G)\) and \(R(G^{\prime})\). By Theorem 2.6, the isomorphism \(\phi\) induces an isomorphism between inner duals of \(G\) and \(G^{\prime}\), which we denote by \(\widehat{\phi}\). **Theorem 3.2**: _Let \(G\) and \(G^{\prime}\) be 2-connected outerplane bipartite graphs. If there exists an isomorphism \(\phi\) between resonance graphs \(R(G)\) and \(R(G^{\prime})\), then \(G\) has a reducible face decomposition \(G_{i}(1\leq i\leq n)\) where \(G_{n}=G\) associated with the face sequence \(s_{i}(1\leq i\leq n)\) and the odd length path sequence \(P_{i}(2\leq i\leq n)\); and \(G^{\prime}\) has a reducible face decomposition \(G^{\prime}_{i}(1\leq i\leq n)\) where \(G^{\prime}_{n}=G^{\prime}\) associated with the face sequence \(s^{\prime}_{i}(1\leq i\leq n)\) and the odd length path sequence \(P^{\prime}_{i}(2\leq i\leq n)\) satisfying three properties:_ * _the isomorphism_ \(\widehat{\phi}\) _between the inner duals of_ \(G\) _and_ \(G^{\prime}\) _maps_ \(s_{i}\) _to_ \(s^{\prime}_{i}\) _for_ \(1\leq i\leq n\)_;_ * \(G\) _and_ \(G^{\prime}\) _can be properly two colored so that odd length paths_ \(P_{i}\) _and_ \(P^{\prime}_{i}\) _either both start from a black vertex and end with a white vertex, or both start from a white vertex and end with a black vertex in clockwise orientation along the peripheries of_ \(G_{i}\) _and_ \(G^{\prime}_{i}\) _for_ \(2\leq i\leq n\)_;_ * \(\phi\) _is an isomorphism between resonance digraphs_ \(\overrightarrow{R}(G)\) _and_ \(\overrightarrow{R}(G^{\prime})\) _with respect to the colorings from property_ \((ii)\)_._ **Proof.** Let \(\phi:R(G)\longrightarrow R(G^{\prime})\) be an isomorphism between \(R(G)\) and \(R(G^{\prime})\). By Theorem 2.6, the graph \(\Theta(R(G))\) induced by the \(\Theta\)-classes of \(R(G)\) is a tree and isomorphic to the inner dual of \(G\), and the graph \(\Theta(R(G^{\prime}))\) induced by the \(\Theta\)-classes of \(R(G^{\prime})\) is a tree and isomorphic to the inner dual of \(G^{\prime}\). By the peripheral convex expansions with respect to a reducible face decomposition of a 2-connected outerplane bipartite graph given by Theorem 2.5, we can see that \(\phi\) induces an isomorphism \(\widehat{\phi}\) between the inner duals of \(G\) and \(G^{\prime}\). So, \(G\) and \(G^{\prime}\) have the same number of inner faces. Suppose that \(G\) and \(G^{\prime}\) have \(n\) inner faces. Obviously, all three properties hold if \(n=1\) or \(n=2\). Let \(n\geq 3\). We proceed by induction on \(n\) and therefore assume that all three properties hold for any 2-connected outerplane bipartite graphs with less than \(n\) inner faces. Let \(s_{n}\) be a reducible face of \(G\), \(P_{n}\) be the common periphery of \(s_{n}\) and \(G\), and \(E\) be the \(\Theta\)-class in \(R(G)\) corresponding to \(s_{n}\). Moreover, we denote by \(E^{\prime}\) the \(\Theta\)-class in \(R(G^{\prime})\) obtained from \(E\) by the isomorphism \(\phi\), and \(s^{\prime}_{n}\) the corresponding reducible face of \(G^{\prime}\). Then \(s^{\prime}_{n}=\widehat{\phi}(s_{n})\). Also, we denote by \(P^{\prime}_{n}\) the common periphery of \(s^{\prime}_{n}\) and \(G^{\prime}\). By Theorem 2.4, the graph \(R(G)\) is obtained from \(R(G_{n-1})\) by a peripheral convex expansion with respect to the \(\Theta\)-class \(E\). Similarly, the graph \(R(G^{\prime})\) is obtained from \(R(G^{\prime}_{n-1})\) by a peripheral convex expansion with respect to the \(\Theta\)-class \(E^{\prime}\). Since \(\phi\) is an isomorphism between \(R(G)\) and \(R(G^{\prime})\) such that \(\phi\) maps \(E\) to \(E^{\prime}\), it follows that \(R(G_{n-1})\) and \(R(G^{\prime}_{n-1})\) are isomorphic and the restriction of \(\phi\) on \(R(G_{n-1})\) is an isomorphism \(\phi_{n-1}\) between \(R(G_{n-1})\) and \(R(G^{\prime}_{n-1})\). Let \(\widehat{\phi}_{n-1}\) be the induced isomorphism between the inner duals of \(G_{n-1}\) and \(G^{\prime}_{n-1}\). Then \(\widehat{\phi}_{n-1}\) is the restriction of \(\widehat{\phi}\) on the inner dual of \(G_{n-1}\). Since \(G_{n-1}\) and \(G^{\prime}_{n-1}\) have \(n-1\) inner faces, by the induction hypothesis \(G_{n-1}\) has a reducible face decomposition \(G_{i}(1\leq i\leq n-1)\) associated with the face sequence \(s_{i}(1\leq i\leq n-1)\) and the odd length path sequence \(P_{i}(2\leq i\leq n-1)\); and \(G^{\prime}\) has a reducible face decomposition \(G^{\prime}_{i}(1\leq i\leq n-1)\) associated with the face sequence \(s^{\prime}_{i}(1\leq i\leq n-1)\) and the odd length path sequence \(P^{\prime}_{i}(2\leq i\leq n-1)\) satisfying properties \((i)\)\(s^{\prime}_{i}=\widehat{\phi}_{n-1}(s_{i})\) for \(1\leq i\leq n-1\), \((ii)\)\(G_{n-1}\) and \(G^{\prime}_{n-1}\) can be properly two colored so that odd length paths \(P_{i}\) and \(P^{\prime}_{i}\) either both start from a black vertex and end with a white vertex, or both start from a white vertex and end with a black vertex in clockwise orientation along the peripheries of \(G_{i}\) and \(G^{\prime}_{i}\) for \(2\leq i\leq n-1\), and \((iii)\)\(\phi_{n-1}\) is an isomorphism between resonance digraphs \(\overrightarrow{R}(G_{n-1})\) and \(\overrightarrow{R}(G^{\prime}_{n-1})\) with respect to the colorings from property \((ii)\). Obviously, since \(s^{\prime}_{n}=\widehat{\phi}(s_{n})\) and \(s^{\prime}_{i}=\widehat{\phi}_{n-1}(s_{i})=\widehat{\phi}(s_{i})\) for \(1\leq i\leq n-1\), property \((i)\) holds for the above reducible face decompositions of \(G\) and \(G^{\prime}\). It remains to show that the these reducible face decompositions satisfy property \((ii)\) when \(i=n\), and \(\phi\) is an isomorphism between resonance digraphs \(\overrightarrow{R}(G)\) and \(\overrightarrow{R}(G^{\prime})\) with respect to the colorings from property \((ii)\), that is, property \((iii)\) holds. By Proposition 2.3, \(s_{n}\) is adjacent to exactly one inner face of \(G\) since \(s_{n}\) is a reducible face of \(G\). Suppose that the unique inner face adjacent to \(s_{n}\) is \(s_{j}\). Since \(\widehat{\phi}\) is an isomorphism between the inner duals of \(G\) and \(G^{\prime}\), the unique inner face adjacent to \(s^{\prime}_{n}\) is \(s^{\prime}_{j}\). By Lemma 3.1, \(\partial s_{n}\cap\partial s_{j}\) is an edge \(uv\) on \(\partial G_{n-1}\), and \(\partial s^{\prime}_{n}\cap\partial s^{\prime}_{j}\) is an edge \(u^{\prime}v^{\prime}\) on \(\partial G^{\prime}_{n-1}\). It is clear that \(u\) and \(v\) (resp., \(u^{\prime}\) and \(v^{\prime}\)) are two end vertices of \(P_{n}\) (resp., \(P^{\prime}_{n}\)). Moreover, \(R(G)=pce(R(G_{n-1}),\langle{\cal M}(G_{n-1};uv)\rangle)\) where \(R(G_{n-1})\cong\langle{\cal M}(G;P^{-}_{n})\rangle\) and \(\langle{\cal M}(G_{n-1};uv)\rangle\cong\langle{\cal M}(G;P^{-}_{n},\partial s _{n})\rangle\cong\langle{\cal M}(G;P^{+}_{n},\partial s_{n})\rangle\), and \(R(G^{\prime})=pce(R(G^{\prime}_{n-1}),\langle{\cal M}(G^{\prime}_{n-1};u^{ \prime}v^{\prime})\rangle)\) where \(R(G^{\prime}_{n-1})\cong\langle{\cal M}(G^{\prime};P^{\prime}_{n})\rangle\) and \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\cong\langle{ \cal M}(G^{\prime};P^{\prime}_{n},\partial s^{\prime}_{n})\rangle\cong \langle{\cal M}(G^{\prime};P^{+}_{n},\partial s^{\prime}_{n})\rangle\). Recall that \(\phi\) is an isomorphism between \(R(G)=pce(R(G_{n-1}),\langle{\cal M}(G_{n-1};uv)\rangle)\) and \(R(G^{\prime})=pce(R(G^{\prime}_{n-1}),\langle{\cal M}(G^{\prime}_{n-1};u^{ \prime}v^{\prime})\rangle)\). We also have that \(\phi_{n-1}\) is an isomorphism between resonance digraphs \(\overrightarrow{R}(G_{n-1})\) and \(\overrightarrow{R}(G^{\prime}_{n-1})\), where \(\phi_{n-1}\) is the restriction of \(\phi\) on \(R(G_{n-1})\). Hence, \(\phi_{n-1}\) maps \(\langle{\cal M}(G_{n-1};uv)\rangle\) to \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\) such that if an edge \(xy\) of \(\langle{\cal M}(G_{n-1};uv)\rangle\) is directed from \(x\) to \(y\) in \(\overrightarrow{R}(G_{n-1})\), then \(\phi_{n-1}(x)\phi_{n-1}(y)\) is an edge of \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\) directed from \(\phi_{n-1}(x)\) to \(\phi_{n-1}(y)\) in \(\overrightarrow{R}(G^{\prime}_{n-1})\). _Claim 1._ Each edge of \(\mathcal{M}(G;P^{+}_{n},\partial s_{n})\)) resulted from the peripheral convex expansion of an edge \(x_{1}y_{1}\) in \(\langle\mathcal{M}(G_{n-1};uv)\rangle\) has the same orientation as the edge of \(\mathcal{M}(G^{\prime};{P^{\prime}}^{+}_{n},\partial s^{\prime}_{n})\rangle\) resulted from the peripheral convex expansion of \(\phi_{n-1}(x_{1})\phi_{n-1}(y_{1})\) in \(\langle\mathcal{M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\). _Proof of Claim 1._ Let \(x_{1}y_{1}\) be an edge in \(\langle\mathcal{M}(G_{n-1};uv)\rangle\). Then \(\phi_{n-1}(x_{1})\phi_{n-1}(y_{1})\) is its corresponding edge under \(\phi_{n-1}\) in \(\langle\mathcal{M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\). Assume that \(x_{1}x_{2}\) and \(y_{1}y_{2}\) are two edges between \(R(G_{n-1})\) and \(\langle\mathcal{M}(G;P^{+}_{n},\partial s_{n})\rangle\), where both edges have face-label \(s_{n}\). Then \(x_{2}y_{2}\) is an edge of \(\langle\mathcal{M}(G;P^{+}_{n},\partial s_{n})\rangle\) resulted from the peripheral convex expansion of the edge \(x_{1}y_{1}\). Note that \(\phi_{n-1}(x_{1})\phi(x_{2})\) and \(\phi_{n-1}(y_{1})\phi(y_{2})\) are two edges between \(R(G^{\prime}_{n-1})\) and \(\langle\mathcal{M}(G^{\prime};{P^{\prime}}^{+}_{n},\partial s^{\prime}_{n})\rangle\), where both edges have face-label \(s^{\prime}_{n}=\widehat{\phi}(s_{n})\). Hence, \(\phi(x_{2})\phi(y_{2})\) is an edge of \(\langle\mathcal{M}(G^{\prime};{P^{\prime}}^{+}_{n},\partial s^{\prime}_{n})\rangle\) resulted from the peripheral convex expansion of the edge \(\phi_{n-1}(x_{1})\phi_{n-1}(y_{1})\). Without loss of generality, we show that if \(x_{2}y_{2}\) is directed from \(x_{2}\) to \(y_{2}\) in \(\overrightarrow{R}(G)\), then \(\phi(x_{2})\phi(y_{2})\) is directed from \(\phi(x_{2})\) to \(\phi(y_{2})\) in \(\overrightarrow{R^{\prime}}(G)\). Recall both edges \(x_{1}x_{2}\) and \(y_{1}y_{2}\) of \(R(G)\) have face-label \(s_{n}\). Then \(x_{1}=x_{2}\oplus\partial s_{n}\) and \(y_{1}=y_{2}\oplus\partial s_{n}\). By the peripheral convex expansion structure of \(R(G)\) from \(R(G_{n-1})\), vertices \(x_{1},y_{1},y_{2},x_{2}\) form a 4-cycle \(C\) in \(R(G)\). It is well known [4] that two antipodal edges of a 4-cycle in \(R(G)\) have the same face-label and two face-labels of adjacent edges of a 4-cycle in \(R(G)\) are vertex disjoint faces of \(G\). Assume that two antipodal edges \(x_{1}y_{1}\) and \(x_{2}y_{2}\) of \(C\) in \(R(G)\) have the face-label \(s_{k}\) for some \(1\leq k\leq n-1\). Then \(x_{1}\oplus y_{1}=x_{2}\oplus y_{2}=\partial s_{k}\) where \(s_{k}\) is vertex disjoint from \(s_{n}\). By our assumption that \(x_{2}y_{2}\) is directed from \(x_{2}\) to \(y_{2}\) in \(\overrightarrow{R}(G)\), it follows that \(x_{1}y_{1}\) is directed from \(x_{1}\) to \(y_{1}\) in \(\overrightarrow{R}(G_{n-1})\subset\overrightarrow{R}(G)\). Since \(\phi_{n-1}\) is an isomorphism between resonance digraphs \(\overrightarrow{R}(G_{n-1})\) and \(\overrightarrow{R^{\prime}}(G_{n-1})\), we have that \(\phi_{n-1}(x_{1})\phi_{n-1}(y_{1})\) is directed from \(\phi_{n-1}(x_{1})\) to \(\phi_{n-1}(y_{1})\) in \(\overrightarrow{R^{\prime}}(G_{n-1})\). Similarly to the above argument, vertices \(\phi_{n-1}(x_{1}),\phi_{n-1}(y_{1}),\phi(y_{2}),\phi(x_{2})\) form a 4-cycle in \(R(G^{\prime})\), where two antipodal edges \(\phi_{n-1}(x_{1})\phi_{n-1}(y_{1})\) and \(\phi(x_{2})\phi(y_{2})\) of \(C^{\prime}\) in \(R(G^{\prime})\) have the face-label \(s^{\prime}_{k}=\widehat{\phi}_{n-1}(s_{k})\), where \(s^{\prime}_{k}\) and \(s^{\prime}_{n}\) are vertex disjoint faces of \(G^{\prime}\). Recall both edges \(\phi_{n-1}(x_{1})\phi(x_{2})\) and \(\phi_{n-1}(y_{1})\phi(y_{2})\) have face-label \(s^{\prime}_{n}=\widehat{\phi}(s_{n})\). Then \(\phi(x_{2})=\phi_{n-1}(x_{1})\oplus\partial s^{\prime}_{n}\) and \(\phi(y_{2})=\phi_{n-1}(y_{1})\oplus\partial s^{\prime}_{n}\). It follows that \(\phi(x_{2})\phi(y_{2})\) is directed from \(\phi(x_{2})\) to \(\phi(y_{2})\) in \(\overrightarrow{R^{\prime}}(G)\). Therefore, Claim 1 holds. _Claim 2._ The edges between \(\mathcal{M}(G;P^{-}_{n},\partial s_{n})\) and \(\mathcal{M}(G;P^{+}_{n},\partial s_{n})\) in \(\overrightarrow{R}(G)\) have the same orientation as the edges between \(\mathcal{M}(G^{\prime};{P^{\prime}}^{-}_{n},\partial s^{\prime}_{n})\) and \(\mathcal{M}(G^{\prime};{P^{\prime}}^{+}_{n},\partial s^{\prime}_{n})\) in \(\overrightarrow{R}(G^{\prime})\). _Proof of Claim 2._ By definitions of \(\mathcal{M}(G;P^{-}_{n},\partial s_{n})\), \(\mathcal{M}(G;P^{+}_{n},\partial s_{n})\), and directed edges in \(\overrightarrow{R}(G)\), we can see that all edges between \(\mathcal{M}(G;P^{-}_{n},\partial s_{n})\) and \(\mathcal{M}(G;P^{+}_{n},\partial s_{n})\) are directed from one set to the other. Similarly, all edges between \(\mathcal{M}(G^{\prime};{P^{\prime}}^{-}_{n},\partial s^{\prime}_{n})\) and \(\mathcal{M}(G^{\prime};{P^{\prime}}^{+}_{n},\partial s^{\prime}_{n})\) are directed from one set to the other. Let \(M_{\hat{0}}\) be the minimum and \(M_{\hat{1}}\) the maximum in the distributive lattice \(\mathcal{M}(G_{n-1})\). By Lemma 3.1, exactly one of these two perfect matchings contains the edge \(uv\). Without loss of generality, let \(M_{\hat{0}}\in\mathcal{M}(G_{n-1};uv)\) where \(\langle\mathcal{M}(G_{n-1};uv)\rangle\cong\langle\mathcal{M}(G;P^{-}_{n}, \partial s_{n})\rangle\cong\langle\mathcal{M}(G;P^{+}_{n},\partial s_{n})\rangle\). Let \(\widehat{M_{\hat{0}}}\) be the perfect matching of \(G\) such that \(M_{\hat{0}}\setminus\{uv\}\subseteq\widehat{M_{\hat{0}}}\). Then \(\widehat{M_{\hat{0}}}\in\mathcal{M}(G;P^{+},\partial s)\) is the minimum of the distributive lattice \(\mathcal{M}(G)\). Let \(M^{\prime}_{\hat{0}}=\phi_{n-1}(M_{\hat{0}})\). Then \(M^{\prime}_{\hat{0}}\) is the minimum of the distributive lattice \(\mathcal{M}(G^{\prime}_{n-1})\), and \(M^{\prime}_{\hat{0}}\in\mathcal{M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\) where \(\langle\mathcal{M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\cong\langle \mathcal{M}(G^{\prime};{P^{\prime}}^{-}_{n},\partial s^{\prime}_{n})\rangle\cong \langle\mathcal{M}(G^{\prime};{P^{\prime}}^{+}_{n},\partial s^{\prime}_{n})\rangle\). As before, define \(\widehat{M}^{\prime}_{0}\) as the perfect matching of \(G^{\prime}\) such that \(M^{\prime}_{0}\setminus\{u^{\prime}v^{\prime}\}\subseteq\widehat{M}^{\prime}_{0}\). By Lemma 3.1, \(\widehat{M}^{\prime}_{0}\in{\cal M}(G^{\prime};P^{\prime+},\partial s)\) is the minimum of the distributive lattice \({\cal M}(G^{\prime})\). This implies that Claim 2 holds. Consequently, \(\phi\) is also an isomorphism between resonance digraphs \(\overrightarrow{R}(G)\) and \(\overrightarrow{R}(G^{\prime})\), which means that property \((iii)\) holds. Suppose that \(P_{n}=\partial s_{n}-uv\) starts with \(u\) and ends with \(v\) along the clockwise orientation of the periphery of \(G\), and \(P^{\prime}_{n}=\partial s^{\prime}_{n}-u^{\prime}v^{\prime}\) starts with \(u^{\prime}\) and ends with \(v^{\prime}\) along the the clockwise orientation of the periphery of \(G^{\prime}\). Since the resonance digraphs \(\overrightarrow{R}(G)\) and \(\overrightarrow{R}(G^{\prime})\) are isomorphic, it follows that \(u\) and \(u^{\prime}\) have the same color and \(v\) and \(v^{\prime}\) have the same color. So, the above reducible face decompositions of \(G\) and \(G^{\prime}\) also satisfy property \((ii)\) when \(i=n\). Therefore, property \((ii)\) holds. \(\Box\) The following corollary follows directly from Theorem 3.2. **Corollary 3.3**: _Let \(G\) and \(G^{\prime}\) be 2-connected outerplane bipartite graphs. Then their resonance graphs \(R(G)\) and \(R(G^{\prime})\) are isomorphic if and only if \(G\) and \(G^{\prime}\) can be properly two colored so that \(\overrightarrow{R}(G)\) and \(\overrightarrow{R}(G^{\prime})\) are isomorphic._ We are now ready to state the following main result of the paper. **Theorem 3.4**: _Let \(G\) and \(G^{\prime}\) be 2-connected outerplane bipartite graphs. Then their resonance graphs \(R(G)\) and \(R(G^{\prime})\) are isomorphic if and only if \(G\) has a reducible face decomposition \(G_{i}(1\leq i\leq n)\) associated with the face sequence \(s_{i}(1\leq i\leq n)\) and the odd length path sequence \(P_{i}(2\leq i\leq n)\); and \(G^{\prime}\) has a reducible face decomposition \(G^{\prime}_{i}(1\leq i\leq n)\) associated with the face sequence \(s^{\prime}_{i}(1\leq i\leq n)\) and the odd length path sequence \(P^{\prime}_{i}(2\leq i\leq n)\) satisfying two properties:_ * _the map sending_ \(s_{i}\) _to_ \(s^{\prime}_{i}\) _induces an isomorphism between the inner dual of_ \(G\) _and inner dual of_ \(G^{\prime}\) _for_ \(1\leq i\leq n\)_; and_ * \(G\) _and_ \(G^{\prime}\) _can be properly two colored so that odd length paths_ \(P_{i}\) _and_ \(P^{\prime}_{i}\) _either both start from a black vertex and end with a white vertex, or both start from a white vertex and end with a black vertex in clockwise orientation along the peripheries of_ \(G_{i}\) _and_ \(G^{\prime}_{i}\) _for_ \(2\leq i\leq n\)_._ **Proof.** _Necessity._ This implication follows by Theorem 3.2. _Sufficiency._ Let \(G\) and \(G^{\prime}\) be 2-connected outerplane bipartite graphs each with \(n\) inner faces. Use induction on \(n\). The result holds when \(n=1\) or \(2\). Assume that \(n\geq 3\) and the result holds for any two 2-connected outerplane bipartite graphs each with less than \(n\) inner faces. By Theorem 2.5, \(R(G)\) can be obtained from an edge by a peripheral convex expansions with respect to a reducible face decomposition \(G_{i}(1\leq i\leq n)\) associated with the face sequence \(s_{i}(1\leq i\leq n)\) and the odd length path sequence \(P_{i}(2\leq i\leq n)\); and \(R(G^{\prime})\) can be obtained from an edge by a peripheral convex expansions with respect to a reducible face decomposition \(G^{\prime}_{i}(1\leq i\leq n)\) associated with the face sequence \(s^{\prime}_{i}(1\leq i\leq n)\) and the odd length path sequence \(P^{\prime}_{i}(2\leq i\leq n)\). Assume that properties \((i)\) and \((ii)\) hold for the above reducible face decompositions of \(G\) and \(G^{\prime}\). By induction hypothesis, \(R(G_{n-1})\) and \(R^{\prime}(G_{n-1})\) are isomorphic. Similarly to the argument in Theorem 3.2, we can see that \(s_{n}\) is adjacent to exactly one inner face \(s_{j}\) of \(G\) such that \(\partial s_{n}\cap\partial s_{j}\) is an edge \(uv\) on \(\partial G_{n-1}\); and \(s^{\prime}_{n}\) is adjacent to exactly one inner face \(s^{\prime}_{j}\) of \(G^{\prime}\) such that \(\partial s^{\prime}_{n}\cap\partial s^{\prime}_{j}\) is an edge \(u^{\prime}v^{\prime}\) on \(\partial G^{\prime}_{n-1}\). It is clear that \(u\) and \(v\) (resp., \(u^{\prime}\) and \(v^{\prime}\)) are two end vertices of \(P_{n}\) (resp., \(P^{\prime}_{n}\)). Moreover, \(R(G)=pce(R(G_{n-1}),\langle{\cal M}(G_{n-1};uv)\rangle)\), and \(R(G^{\prime})=pce(R(G^{\prime}_{n-1}),\langle{\cal M}(G^{\prime}_{n-1};u^{ \prime}v^{\prime})\rangle)\). To show that \(R(G)\) and \(R(G^{\prime})\) are isomorphic, it remains to prove that \(\langle{\cal M}(G_{n-1};uv)\rangle\) and \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\) are isomorphic. Let \(H_{n-1}\) be the subgraph of \(G_{n-1}\) obtained by removing two end vertices of the edge \(uv\), and repeatedly removing end vertices of resulted pendant edges during the process, and \(H^{\prime}_{n-1}\) be the subgraph of \(G^{\prime}_{n-1}\) obtained by removing two end vertices of the edge \(u^{\prime}v^{\prime}\), and repeatedly removing end vertices of resulted pendant edges during the process. Note that all vertices of \(G_{n-1}\) (resp., \(G^{\prime}_{n-1}\)) are on the outer cycle of \(G_{n-1}\) (resp., \(G^{\prime}_{n-1}\)) since \(G_{n-1}\) (resp., \(G^{\prime}_{n-1}\)) is an outerplane graph. Then all resulted pendant edges during the process of obtaining \(H_{n-1}\) (resp., \(H^{\prime}_{n-1}\)) from \(G_{n-1}\) (resp., \(G^{\prime}_{n-1}\)) are the edges on the outer cycle of \(G_{n-1}\) (resp., \(G^{\prime}_{n-1}\)). It follows either both \(H_{n-1}\) and \(H^{\prime}_{n-1}\) are empty, or \(H_{n-1}\) and \(H^{\prime}_{n-1}\) are connected subgraphs of \(G_{n-1}\) and \(G^{\prime}_{n-1}\), respectively. Moreover, if both \(H_{n-1}\) and \(H^{\prime}_{n-1}\) are empty, then \({\cal M}(G_{n-1};uv)\) contains a unique perfect matching of \(G_{n-1}\) and \({\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\) contains a unique perfect matching of \(G^{\prime}_{n-1}\). So, \(\langle{\cal M}(G_{n-1};uv)\rangle\) and \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\) are isomorphic as single vertices. We now assume that \(H_{n-1}\) and \(H^{\prime}_{n-1}\) are connected subgraphs of \(G_{n-1}\) and \(G^{\prime}_{n-1}\), respectively. It is clear that all resulted pendant edges during the process of obtaining \(H_{n-1}\) from \(G\) are the edges of each perfect matching in \({\cal M}(G_{n-1};uv)\), and so each perfect matching of \(H_{n-1}\) can be extended uniquely to a perfect matching in \({\cal M}(G_{n-1};uv)\). Hence, there is a 1-1 correspondence between the set of perfect matchings of \(H_{n-1}\) and the set of perfect matchings in \({\cal M}(G_{n-1};uv)\). Two perfect matchings of \(H_{n-1}\) are adjacent in \(R(H_{n-1})\) if and only if the corresponding two perfect matchings in \({\cal M}(G_{n-1};uv)\) are adjacent in \(\langle{\cal M}(G_{n-1};uv)\rangle\). Therefore, \(R(H_{n-1})\) is isomorphic to \(\langle{\cal M}(G_{n-1};uv)\rangle\). Similarly, \(R(H^{\prime}_{n-1})\) is isomorphic to \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\). Next, we show that \(R(H_{n-1})\) and \(R(H^{\prime}_{n-1})\) are isomorphic. Note that \(G_{n-1}\) and \(G^{\prime}_{n-1}\) have reducible face decompositions satisfying properties \((i)\) and \((ii)\). By the constructions of \(H_{n-1}\) and \(H^{\prime}_{n-1}\), we can distinguish two cases based on whether \(H_{n-1}\) and \(H^{\prime}_{n-1}\) are 2-connected or not. _Case 1._\(H_{n-1}\) and \(H^{\prime}_{n-1}\) are 2-connected. Then by their constructions, \(H_{n-1}\) and \(H^{\prime}_{n-1}\) have reducible face decompositions satisfying properties \((i)\) and \((ii)\). Then \(R(H_{n-1})\) and \(R(H^{\prime}_{n-1})\) are isomorphic by induction hypothesis. _Case 2._ Each of \(H_{n-1}\) and \(H^{\prime}_{n-1}\) has more than one 2-connected component. Note that any 2-connected component of \(H_{n-1}\) and \(H^{\prime}_{n-1}\) is a 2-connected outerplane bipartite graph. This implies that any bridge of \(H_{n-1}\) (resp., \(H^{\prime}_{n-1}\)) cannot belong to any perfect matching of \(H_{n-1}\) (resp., \(H^{\prime}_{n-1}\)). Hence, any perfect matching of \(H_{n-1}\) (resp., \(H^{\prime}_{n-1}\)) is the perfect matching of the union of its 2-connected components. It follows that \(R(H_{n-1})\) (resp., \(R(H^{\prime}_{n-1})\)) is the Cartesian product of resonance graphs of its 2-connected components. By the constructions of \(H_{n-1}\) and \(H^{\prime}_{n-1}\), there is a 1-1 corresponding between the set of 2-connected components of \(H_{n-1}\) and the set of 2-connected components of \(H^{\prime}_{n-1}\) such that each 2-connected component of \(H_{n-1}\) and its corresponding 2-connected component of \(H^{\prime}_{n-1}\) have reducible face decompositions satisfying properties \((i)\) and \((ii)\). Then \(R(H_{n-1})\) and \(R(H^{\prime}_{n-1})\) are isomorphic by induction hypothesis. We have shown that \(R(H_{n-1})\) is isomorphic to \(\langle{\cal M}(G_{n-1};uv)\rangle\), and \(R(H^{\prime}_{n-1})\) is isomorphic to \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\). Therefore, \(\langle{\cal M}(G_{n-1};uv)\rangle\) and \(\langle{\cal M}(G^{\prime}_{n-1};u^{\prime}v^{\prime})\rangle\) are isomorphic. It follows that \(R(G)\) and \(R(G^{\prime})\) are isomorphic. \(\Box\) Finally, we can formulate the main result using local structures of given graphs. Let \(e\) and \(f\) be two edges of a graph \(G\). Let \(d_{G}(e,f)\) denote the distance between corresponding vertices in the line graph \(L(G)\) of \(G\). The following concepts introduced in [3] will be also needed for that purpose. **Definition 3.5**: _[_3_]_ _Let \(G\) be a 2-connected outerplane bipartite graph and \(s\), \(s^{\prime}\), \(s^{\prime\prime}\) be three inner faces of \(G\). Then the triple \((s,s^{\prime},s^{\prime\prime})\) is called an adjacent triple of inner faces if \(s\) and \(s^{\prime}\) have the common edge \(e\) and \(s^{\prime},s^{\prime\prime}\) have the common edge \(f\). The adjacent triple of inner faces \((s,s^{\prime},s^{\prime\prime})\) is regular if the distance \(d_{G}(e,f)\) is an even number, and irregular otherwise._ It is easy to see that 2-connected outerplane bipartite graphs \(G\) and \(G^{\prime}\) have reducible face decompositions satisfying properties \((i)\) and \((ii)\) if and only if there exists an isomorphism between the inner dual of \(G\) and \(G^{\prime}\) that preserves the (ir)regularity of adjacent triples of inner faces. Therefore, the next result follows directly from Theorem 3.4. **Corollary 3.6**: _Let \(G\) and \(G^{\prime}\) be two 2-connected outerplane bipartite graphs with inner duals \(T\) and \(T^{\prime}\), respectively. Then \(G\) and \(G^{\prime}\) have isomorphic resonance graphs if and only if there exists an isomorphism \(\alpha:V(T)\to V(T^{\prime})\) such that for any 3-path \(xyz\) of \(T\): the adjacent triple \((x,y,z)\) of inner faces of \(G\) is regular if and only if the adjacent triple \((\alpha(x),\alpha(y),\alpha(z))\) of inner faces of \(G^{\prime}\) is regular._ Since it would be interesting to generalize the presented results to a wider family of graphs (for example plane elementary bipartite graphs), we conclude the paper with the following open problem. **Problem 2.**_Characterize plane (elementary) bipartite graphs with isomorphic resonance graphs._ **Acknowledgment:** Simon Brezovnik, Niko Tratnik, and Petra Zigert Pletersek acknowledge the financial support from the Slovenian Research Agency: research programme No. P1-0297 (Simon Brezovnik, Niko Tratnik, Petra Zigert Pletersek), project No. N1-0285 (Niko Tratnik), and project No. NK-0001 (Petra Zigert Pletersek). All four authors thank the Slovenian Research Agency for financing our bilateral project between Slovenia and the USA (title: _Structural properties of resonance graphs and related concepts_, project No. BI-US/22-24-158).

2306.08522

Challenges of Indoor SLAM: A multi-modal multi-floor dataset for SLAM evaluation

Robustness in Simultaneous Localization and Mapping (SLAM) remains one of the key challenges for the real-world deployment of autonomous systems. SLAM research has seen significant progress in the last two and a half decades, yet many state-of-the-art (SOTA) algorithms still struggle to perform reliably in real-world environments. There is a general consensus in the research community that we need challenging real-world scenarios which bring out different failure modes in sensing modalities. In this paper, we present a novel multi-modal indoor SLAM dataset covering challenging common scenarios that a robot will encounter and should be robust to. Our data was collected with a mobile robotics platform across multiple floors at Northeastern University's ISEC building. Such a multi-floor sequence is typical of commercial office spaces characterized by symmetry across floors and, thus, is prone to perceptual aliasing due to similar floor layouts. The sensor suite comprises seven global shutter cameras, a high-grade MEMS inertial measurement unit (IMU), a ZED stereo camera, and a 128-channel high-resolution lidar. Along with the dataset, we benchmark several SLAM algorithms and highlight the problems faced during the runs, such as perceptual aliasing, visual degradation, and trajectory drift. The benchmarking results indicate that parts of the dataset work well with some algorithms, while other data sections are challenging for even the best SOTA algorithms. The dataset is available at https://github.com/neufieldrobotics/NUFR-M3F.

Pushyami Kaveti, Aniket Gupta, Dennis Giaya, Madeline Karp, Colin Keil, Jagatpreet Nir, Zhiyong Zhang, Hanumant Singh

2023-06-14T14:12:57Z

http://arxiv.org/abs/2306.08522v1

# Challenges of Indoor SLAM: A multi-modal multi-floor dataset for SLAM evaluation ###### Abstract Robustness in Simultaneous Localization and Mapping (SLAM) remains one of the key challenges for the real-world deployment of autonomous systems. SLAM research has seen significant progress in the last two and a half decades, yet many state-of-the-art (SOTA) algorithms still struggle to perform reliably in real-world environments. There is a general consensus in the research community that we need challenging real-world scenarios which bring out different failure modes in sensing modalities. In this paper, we present a novel multi-modal indoor SLAM dataset covering challenging common scenarios that a robot will encounter and should be robust to. Our data was collected with a mobile robotics platform across multiple floors at Northeastern University's ISEC building. Such a multi-floor sequence is typical of commercial office spaces characterized by symmetry across floors and, thus, is prone to perceptual aliasing due to similar floor layouts. The sensor suite comprises seven global shutter cameras, a high-grade MEMS inertial measurement unit (IMU), a ZED stereo camera, and a 128-channel high-resolution lidar. Along with the dataset, we benchmark several SLAM algorithms and highlight the problems faced during the runs, such as perceptual aliasing, visual degradation, and trajectory drift. The benchmarking results indicate that parts of the dataset work well with some algorithms, while other data sections are challenging for even the best SOTA algorithms. The dataset is available at [https://github.com/neufieldrobotics/NUFR-M3F](https://github.com/neufieldrobotics/NUFR-M3F). Multi-modal datasets, Simultaneous Localization and Mapping, Indoor SLAM, lidar mapping, perceptual aliasing ## I Introduction This paper presents a multi-modal SLAM dataset of several real-world sequences captured in a large-scale indoor environment. Simultaneous Localization and Mapping is an extensively researched topic in robotics that has seen major advances in recent decades [1]. It is a hardware and software co-design problem, and the performance of the solution is a function of the right choice of complementary sensors, their proper configuration and calibration, vehicle motions, and, finally, the uncertainties in the real-world mapping environment. Often, methods that work well in certain scenarios fail in the real world due to various factors. These may include environmental uncertainties, dynamic objects, illumination artifacts, and issues associated with robotic motion and trajectories. The performance of state-of-the-art (SOTA) SLAM algorithms is limited by the lack of publicly available datasets for testing: KITTI[2], TUM RGB-D[3], TUM Mono[4], and Euroc MAV[5]. These datasets have many strengths and have positively impacted the SLAM algorithm design and evaluation using different sensor modalities, including monocular vision, stereo vision, visual-inertial odometry (VIO), RGBD cameras, and 3D lidars. However, new large-scale public datasets with multiple sensing modalities are essential. Recent work [6][7] has also shown that fusing data from multiple sensors improves the robustness and accuracy of SLAM estimates in challenging scenarios often encountered in the real-world. Our dataset described in table I consists of visual, inertial, and lidar sensor data, allowing for multi-modal SLAM Fig. 1: (a) The data collection rig mounts to an omnidirectional base with the sensors approximately 1.2m above the ground. (b) The data collection site, Northeastern University’s Interdisciplinary Science and Engineering Complex (ISEC), which has an open atrium and several floors with a high degree of symmetry in their layout and overall design.(c) A composite rendition of the lidar point cloud depicting all the floors from top view. evaluations. The specifications of each sensor are detailed in table II. The entire sensor suite shown in figure 0(a) is time synchronized and spatially calibrated across all sensors for accurate data capture and analysis as shown in figure 2. To the best of our knowledge, this is the first dataset that has continuous multi-floor data for SLAM, and we know of no algorithm that is capable of processing the uninterrupted data across multiple floors into an accurate map of the entire building in an autonomous manner. The dataset presents new fundamental challenges to further the research on informing design decisions and algorithmic choices in performing SLAM with higher reliability. Even if (or when) this becomes possible, the dataset poses interesting questions related to localization due to symmetry across floors. This dataset serves to complement the recent multi-modal benchmarking datasets [8][9][10]. The contributions of this paper can be summarized as: * It outlines challenging multi-modal indoor datasets covering a variety of scenarios including featureless spaces, reflective surfaces, and multi-storeyed sequences. * The multi-storeyed sequences, as is typical with modern architecture, features floors that are essentially identical in design and layout which leads to perceptual aliasing scenarios. These scenarios trip up state-of-the-art SLAM algorithms, the vast majority of which rely on bag of words models for relocalization and loop closure. * It features an extensive set of sensors consisting of seven cameras, a high-resolution lidar, and an IMU. All the sensors are hardware synchronized and calibrated across the entire sensor suite. * We have benchmarked several state-of-the-art algorithms across the visual, visual-inertial, and lidar SLAM methodologies and present a comparison among these different algorithms and sensor modalities that highlights their individual strengths and areas where there are engineering or fundamental theoretical issues that the community may need to focus on. ## II Related Work Several SLAM datasets exist in the literature which vary in regards to the data acquisition environment, varying sensing modalities, type of motions, degree of difficulty, number of sensors, and synchronization of the data capture. The table I summarizes several multi-modal datasets closely related to us. KITTI[2] is one of the first and most popular benchmarking multi-modal datasets motivated by self-driving cars. It has a linear array of four cameras consisting of two stereo pairs - One RGB and one grayscale, a lidar, an IMU, and a GPS. Following this, many outdoor urban datasets emerged in the domain of autonomous driving, such as [11][12][13], which allowed the evaluation of various odometry and SLAM algorithms. Many earlier indoor SLAM datasets targeted visual odometry(VO) and visual-inertial odometry (VIO) tasks for monocular and stereo systems. The TUM[14] and EUROC[5] datasets are extensively used for benchmarking VO and VIO solutions. These datasets have global shutter stereo cameras, hardware synchronized with the IMU, and millimeter-accurate ground truth from motion capture systems. A few recent efforts [8][15] gathered multi-sensor (beyond stereo) and multi-modal data in urban indoor environments. PennCOSYVIO[15], is collected at Upenn's campus area with a stereo VI sensor, two project Tango devices, and three GoPro cameras arranged in a minimally overlapping configuration. The sensors are mounted on a handheld platform and carried across indoor and outdoor areas. The ground truth is provided using fiducial markers placed along the trajectories. The Newer College Dataset[8] and its extension contain synchronized image data from the Alphasense sensor with four cameras - two facing forward and two on the side as well as a lidar mounted on a handheld device. More recently, the Hilti[9] and Hilti-Oxford[16] datasets attracted a lot of attention through their SLAM challenge, where multiple teams from both academia and industry participated. The main objective of this dataset is to push the limits of the state-of-the-art multi-sensor SLAM algorithms to aid real-world applications. There are indoor and \begin{table} \begin{tabular}{|p{11.4pt}|p{11.4pt}|p{11.4pt}|p{11.4pt}|p{11.4pt}|p{11.4pt}|p{11.4pt}|p{11.4pt}|p{11.4pt}|p{11.4pt}|} \hline & **Sensors** & **Arrangement Rate(Hz)** & **Frame Rate(Hz)** & **No. of Sequences** & **Platform** & **Ground truth** & **Sync** & **Environment** \\ \hline **Newer College** & 2 GS cameras 1 LiDAR & 2 stereo, 2 Non-overlapping & 30 & 3 & Handheld & Survey grade 3D Imaging Laser & HW + SW & Campus \\ \hline **PennCosVIO** & 3 RGB GS cameras 2 Gray RS cameras 2 IMUs & 3 min overlapping, 2 stereo & 20 & 4 & Handheld & Fiducial Markers & HW + SW & Campus \\ \hline **HILTI** & 5 GS Gray cameras 2 LiDAR 3 IMU & 2 stereo, 3 Non-overlapping & 10 & 12 & Handheld & MoCAP & HW +SW & Construction site \\ \hline **HILTI-Oxford** & 1 LiDAR IMU & 2 stereo, 3 Non-overlapping & 40 & 16 & Handheld & Survey grade 3D Imaging Laser & HW + SW & Construction Site \\ \hline **Ours** & 7 GS RGB cameras 1 LiDAR & 5 Fronto-Parallel Side-ways & 20 & 14 & Mobile Robot LiDAR alignment & HW + SW & Campus office \\ \hline \end{tabular} \end{table} TABLE I: An overview of the indoor multi-modal SLAM datasets outdoor sequences of construction sites and parking areas that contain some challenging scenarios of abrupt and fast motions and featureless areas. These datasets are collected with an Alphasense five-camera module with a stereo pair, three non-overlapping wide-angle cameras, an IMU, and two laser scanners. All these datasets contain challenging sequences with changing lighting and texture, challenging structures such as staircases, and featureless spaces. Our dataset also consists of multi-modal data with cameras, lidar, and inertial measurements. In addition to featuring the challenging scenarios mentioned above, our dataset showcases symmetrical structures located on multiple floors which present unique challenges due to perceptual aliasing. ## III Data Collection System ### _Hardware Setup_ We built a rigid multi-sensor rig consisting of seven cameras, five facing forward and two facing sideways, an inertial measurement unit (IMU), a zed 2i sensor, and a lidar. The description and configuration of the sensors is shown in table II. The sensors' placement and coordinate frames are shown in the schematic figure 2. The cameras are arranged to accommodate overlapping and non-overlapping configurations. The front-facing multi-stereo camera array, together with the left and right cameras, collectively yields a 171-degree field of view. We use Ouster's 128-beam high-resolution lidar, which gives high-density point clouds with 130,000 points. All the cameras except the ZED stereo cameras are hardware synchronized with IMU at 20 frames per second. We built a buffer circuit where the IMU sends a signal to trigger all the cameras simultaneously. The lidar and zed sensor are software/network time synchronized with the other sensor streams. All the sensor timestamps are assigned based on the hardware trigger in combination with the computer's system clock. The multi-sensor rig and a Dell XPS laptop with 32GB RAM were mounted on a Clearpath's Ridgeback robotic platform and driven using a joystick across multiple floors of two of the Northeastern University's buildings for data collection. The Zed 2i sensor is mounted for data collection in the Snell library building and is unavailable for the ISEC building. ### _Calibration_ We obtain both intrinsic and extrinsic calibration for cameras, IMU, and lidar by applying different methods. We used Kalibr[17] to obtain the intrinsic and extrinsic parameters of the overlapping set of cameras and zed stereo cameras using a checkerboard target. For the side-facing cameras, it is not possible to use the same multi-camera calibration methods as we need the cameras to observe a single stationary target at the same time to find the correspondences and solve for the relative transformation. Instead, we perform IMU-camera calibration independently for the two side-facing cameras and the center front-facing camera to obtain \(T_{c_{i}}^{IMU}\) and chain the camera-IMU transformations to get the inter-camera relative transforms using \(T_{c_{i}}^{c_{i}}=(T_{c_{i}}^{IMU})^{-1}T_{c_{i}}^{IMU}\). We used target-based open source software packages [18] and [19] to obtain the lidar-camera extrinsic calibration parameters but noticed some misalignment of the point cloud with images which amplifies with range. We adjust the error by manually aligning the lidar point cloud with camera data. ### _Ground truth_ Ground truth poses are essential to test and evaluate the accuracy of the SLAM algorithms. However, generating ground truth trajectories in indoor environments is a challenging task due to the lack of GPS signals and range limitations of popular indoor ground truthing mechanisms like MOCAP. There are additional challenges particular to our dataset, where the robot moves across multiple floors which makes it impossible to deploy a MOCAP system to track the robot. Given the necessity of ground-truth data for benchmarking novel algorithms, we used fiducial markers-based ground truth. These markers were used as stationary targets to localize the robot when they came into the cameras' field of view. We carefully placed multiple fiducial markers made of April tags[20] near the elevators on each floor. The location is chosen so as to allow the April tags to be visible at the start and end of trajectories on each floor as we drive the robot in loops, as well as at the transits across floors when we enter and exit the elevators. We explain how we compute the error metrics in detail in section (V-A). \begin{table} \begin{tabular}{c c c c} \hline \hline **Sensor** & **No** & **Type** & **Description** \\ \hline \hline \multirow{4}{*}{Camera} & \multirow{4}{*}{7} & FLIR & 1.3 me meapixel color cameras \\ & & Blackfly S & with a resolution of 720 x 540 \\ & & USB3 & and FoV of 57 \({}^{\circ}\) at 20 hz. \\ \cline{1-1} \multirow{2}{*}{Lidar} & \multirow{2}{*}{1} & Ouster & 128 channel LiDAR with vertical FoV of 45\({}^{\circ}\) \\ & & OS-128 & at 10 Hz \\ \cline{1-1} \cline{3-4} & & & stereo cameras with resolution of \\ \cline{1-1} \cline{3-4} & & & 1280 x 720 at 15 Hz, \\ \cline{1-1} \cline{3-4} & & & IMU at 200 Hz \\ \cline{1-1} \cline{3-4} & & & 9-DOF IMU running at 200 Hz. \\ \hline \hline \end{tabular} \end{table} TABLE II: Description of various sensors and their settings used to collect our dataset. Note that Zed2i sensor is available only in the Snell dataset. Fig. 2: Top view of the sensor rig showing sensor frames for the front-facing camera array (red), the non-overlapping side cameras (orange), the ZED camera (purple), the IMU (green) and the lidar (blue). Note the above image follows the convention that \(\oplus\) indicates an axis into the plane of the image, and \(\bullet\) indicates an axis out of the plane of the image. All of the cameras are z-axis forward, y-axis down. ## IV Dataset We collected two large datasets of indoor office environments. The datasets were generated by driving in a loop through different floors of Northeastern University's campus buildings and traveling by elevator between floors. The trajectories include several challenging scenarios that occur on a day-to-day basis, including narrow corridors, featureless spaces, jerky and fast motions, sudden turns, and dynamic objects, which are commonly encountered by a mobile robot in urban environments. All the trajectories have loops to allow the SLAM systems to perform loop closure and compute drift when continuous ground truth is unavailable. All the data is collected using ROS drivers for the respective sensors. The dataset details, including location, length of the trajectory, and ground truth, are consolidated in the table III. ### _ISEC Dataset:_ The multiple-floor trajectory was collected in Northeastern University's Interdisciplinary Science and Engineering Complex (ISEC) building. There are four complete floor sequences in the dataset and multiple transit sequences, which include five elevator tides between floors. We start on the \(5^{th}\) floor and drive through the space such that it contains two loops, where the second part is a trajectory down and back a long corridor with a loop closure. We then take an elevator ride to the \(1^{st}\) floor, where we acquire another loop. The \(1^{st}\) floor sequence contains more dynamic objects, glass, and distinct architecture when compared to the other floors. From the \(1^{st}\) floor, we transit through a long corridor with white walls, take an elevator to \(3^{rd}\) floor, and then another one to the \(4^{th}\) floor. We cover the \(4^{th}\) floor and then proceed to the \(2^{nd}\) floor before taking the final elevator ride to the \(5^{th}\) floor, where we started. The first loop of \(5^{th}\) floor, \(4^{th}\), and \(2^{nd}\) floor sequences are nearly identical with similar-looking office spaces. Thus, these indoor sequences cover areas with good and bad natural lighting, a mix of artificial and natural light, reflections, and dynamic content, such as students. The indoor data snapshots are shown in the figure 3. ### _Snell Library Dataset_ This dataset is collected across multiple floors of Northeastern University's library building by taking elevator rides similar to the ISEC dataset. In general, the Snell dataset has better visual features but has longer trajectories with more dynamic content than the ISEC dataset, which can be a failure point for SLAM algorithms. This sequence poses a challenge to SLAM algorithms to map highly dynamic environments. We travel through 3 floors of the building with loop closures on each floor and where the \(1^{st}\) floor's appearance differs from the other two floors. ## V Benchmarking the SOTA To demonstrate the quality and usefulness of the dataset, we benchmark across a set of well-known state-of-the-art SLAM algorithms. The investigated algorithms are selected so as to have a broad coverage of the field, including visual SLAM, visual-inertial, and lidar-based solutions. The complete list of algorithms can be seen in table IV. We also provide the configuration settings we use to run each algorithm. ### _Evaluation_ We run the visual and visual-inertial methods in stereo mode to use the metric scale in the evaluation. We use front-facing cameras 1 and 3 as the stereo pair for each algorithm (see figure 2 for camera placement), except for MCSLAM, which uses the full array of front-facing cameras. This pair was selected as a compromise between a wider stereo baseline and camera proximity to the IMU. We evaluate visual SLAM algorithms on trajectories collected Fig. 4: The full dataset has several points where the robot enters an elevator. The vision-only and lidar SLAM algorithms are not able to handle a scenario where significant movement is not rendered in the data. This figure shows the z-axis IMU acceleration as the robot ascends in the elevator from the first to the second floor. The spikes as the robot enters and exits the elevator correspond to the robot wheels rolling over the gap between the elevator and the hallway. Fig. 3: This figure shows a sample of the various available data streams, showing (a) the left facing side camera (Cam5), (b) and (c) a stereo pair from the front facing array (Cam1 & Cam3), (d) the right facing side camera (Cam6), and (e) the lidar point cloud. on each floor, whereas visual-inertial algorithms are also evaluated during the transit sequences in the elevators. The elevator sequences are particularly valuable as they give us an insight into the utility of the inertial sensors when vision is ineffective, which is discussed in section V-B. We conducted quantitative analysis on the ISEC dataset by computing error metrics and limited the Snell Library dataset to qualitative results. In most portions of the dataset, lidar odometry computed using Lego-LOAM can be used as a reasonable ground truth, but it does fail in some portions, and while the results are very good qualitatively, it is non-trivial to compute an upper bound on trajectory errors in the resulting pseudo ground truth. To avoid this kind of analysis, we provide a more limited ground truth evaluation for the dataset using fiducial markers, with a separate evaluation for each floor. We mount an AprilTag [20] tracking target on walls that are visible at the beginning and end of the trajectory at each floor, giving a fixed reference point from which to compute the drift accumulated by each algorithm. For the initial and final portions, when the target is visible, we compute the ground truth poses of the robot \(\mathbf{T_{rig}^{target}}\) by localizing it with respect to the target using PnP ransac[21] followed least squares optimization. To align the trajectories, we estimate the rigid body transformation \(\mathbf{T_{O}^{target}}\in\mathbf{se(3)}\) using the positions \(\mathbf{t_{rig}^{O^{(i)}}}\) and \(\mathbf{t_{rig}^{target^{(i)}}}\) of the tracked and ground truth poses belonging to the starting segment of the trajectory such that \[T_{O}^{target}=\underset{T_{O}^{target}t_{rig}}{argmin}\ \ \sum_{i}\|T_{O}^{target}t_{rig}^{O^{(i)}}-t_{rig}^{target^{(i)}}\|^{2} \tag{1}\] Once we have the transformation \(\mathbf{T_{O}^{target}}\), we compute the total translational error or the drift at the end of the trajectory between the investigated algorithm's reported pose and the ground truth pose computed using the fixed markers. We report this final drift error for each investigated algorithm as the Absolute Translational Error(ATE), and as a percentage of the approximate total length of the trajectory in table IV. We compute this drift for each floor individually for all the algorithms. We compute the average of the ATEs \begin{table} \begin{tabular}{|l|l|l|l|l|} \hline \multicolumn{5}{|c|}{**Datasets**} \\ \hline **Label** & **Size (GB)** & **Duration** & **Appx.** & **Description** \\ & & **(s)** & **Length** & \\ & & & **(m)** & \\ \hline \multicolumn{5}{|c|}{**ISEC**} \\ \hline full\_sequence & 515.0 & 1539.70 & 782 & reflective surfaces, minimal dynamic content, daylight, symmetric floors, elevators, open atrium \\ \hline 5th\_floor & 145.8 & 437.86 & 187 & one loop, one out and back \\ \hline transit\_5\_to\_1 & 36.8 & 109.00 & * & transit from 5th to 1st floor in middle elevator \\ \hline 1st\_floor & 43.0 & 125.58 & 65 & one loop, open layout different from other floors, many exterior windows \\ \hline transit\_1\_to\_4 & 112.4 & 337.40 & 144 & transit across 1st floor, up to 3rd floor in freight elevator, across 3rd floor, up to 4th floor in right elevator \\ \hline 4th\_floor & 43.2 & 131.00 & 66 & one loop, some dynamic content towards end \\ \hline transit\_4\_to\_2 & 21.9 & 65.00 & 22 & transit from 4th floor to second floor in right elevator, \\ \hline 2nd\_floor & 89.7 & 266.00 & 128 & two loops in a figure eight \\ \hline transit\_2\_to\_5 & 22.2 & 65.86 & 128 & transit from 2nd floor to fifth floor in right elevator \\ \hline \multicolumn{5}{|c|}{**SNELL LIBRARY**} \\ \hline full\_sequence & 573.5 & 1,700.6 & 699 & feature rich rooms, featureless hallways, many obstacles, stationary and dynamic people in scene \\ \hline 1st\_floor & 144.6 & 428.70 & 221 & two loops with shared segment, some dynamic content \\ \hline transit\_1\_to\_3 & 28.3 & 84.00 & * & transit from 1st floor to 3rd floor in left elevator \\ \hline 3rd\_floor & 213.7 & 633.59 & 345 & two concentric loops with two shared segments, narrow corridor with dynamic content, near field obstructions \\ \hline transit\_3\_to\_2 & 27.8 & 82.41 & * & transit from 3rd floor to 2nd floor in right elevator \\ \hline 2nd\_floor & 126.1 & 374.00 & 186 & one loop, out and back in featureless corridor \\ \hline transit\_2\_to\_1 & 33.0 & 97.90 & * & transit from 2nd floor to 1st floor in right elevator, dynamic objects cover FOV near end \\ \hline \end{tabular} \end{table} TABLE III: A comprehensive list of all the sequences in our dataset and their description. Trajectory lengths are approximate and should only be used for qualitative comparison. They were derived from the best available trajectory estimate for each segment. This was typically lidar odometry (LegoLOAM) for the loop sequences and VIO (Basalt or VINS Fusion) for sequences inside elevators. See section V for more details on trajectory estimates. accumulated at the April tags on different floors for inertial algorithms. The April tags are placed at exactly known locations on each floor so that they are displaced vertically by a fixed distance, which is verified from the building floor plan. ### _Discussion_ We want to point out that the accuracy metric does not fully describe the performance of a SLAM system. Evaluating drift from the beginning to the end of a trajectory can overlook essential details but is somewhat reflective of the pass-fail nature of real-world scenarios. A more comprehensive evaluation should look at features, like loop detection and closure, tracking failures, and map correction while considering reliability and robustness. In this section, we provide some qualitative assessments of the tested algorithms. #### Iv-B1 Perceptual Aliasing Our dataset targets this primary challenge by showcasing multi-floor trajectories with similar-looking areas. Most of the vision-based SLAM frontends use a bag of words model [28] to compute the appearance-based similarity between images for loop detection. In addition, vision-only SLAM methods inherently lack the ability to recognize elevator motion. Based on the end-to-end runs of the algorithms, we observed that all the evaluated VO and VIO algorithms are prone to wrong loop closures, confusing one floor with another. This happens with the \(5^{th}\), \(4^{th}\), and \(2^{nd}\) floors, which are symmetrical in structure, color, and layout. This leads to incorrect loop constraints between poses belonging to different floors causing the entire trajectory of one floor to shift in space. Figure 6 shows the constraints as edges between the \(2^{nd},3^{rd},4^{th},\) and \(5^{th}\) floors even though there is no direct visibility across them whereas the first floor remains disconnected since it is unique in appearance. As a result, the trajectories appear to be on the same floor, and the possibility of wrong loop detections is high. In the case of VIO, despite having a good sense that we are not on the same floor, incorrect loop detections still happen. #### Iv-B2 Visual Degradation Visual degradation occurs at multiple places along the trajectories when we encounter featureless spaces, reflective surfaces, and dynamic content, as shown in figure 5. All the algorithms run without tracking loss on the \(1^{st}\), \(2^{nd}\), and \(4^{th}\) floors with minimal drift. In the presence of dynamic objects such as moving people, stereo visual slam algorithms cause jagged artifacts due to corrupted relative motion estimates, as shown in figure 7. Visual-inertial and multi-camera SLAM systems do not display these problems. The vision-only algorithms do not always provide accurate estimates when we run into plain walls, glass surfaces, and during elevator rides. Among vision-only methods, feature-based methods such as ORBSLAM3 are more prone to tracking failures when featureless walls are encountered. Direct methods like SVO can still track due to optical flow but result in incorrect pose estimates causing drift in the subsequent poses. DroidSLAM, which is a learning-based stereo method, also copes in featureless scenarios; however, it lacks scale. These problems are highlighted in figure 7. Visual-inertial algorithms perform well in these scenarios due to the presence of a proprioceptive inertial sensing component, which can detect the physical motion Fig. 5: A sample of some challenging points in the dataset. Image (a) shows a glass wall with reflections that can introduce spurious features. Image (b) shows one of the elevator areas, where once the robot enters, the exteroceptive sensors such as LiDARs and cameras are fundamentally limited to track motion. \begin{table} \begin{tabular}{|l|c|c|c|c|c|c|c|c|c|c|} \hline \multirow{2}{*}{Algorithm} & \multicolumn{2}{c|}{\(5^{\text{th}}\) Floor} & \multicolumn{2}{c|}{\(1^{st}\) Floor} & \multicolumn{2}{c|}{\(4^{th}\) Floor} & \multicolumn{2}{c|}{\(2^{nd}\) Floor} & \multicolumn{2}{c|}{Full Dataset} \\ \cline{2-11} & ATE(m) & \% & ATE(m) & \% & ATE(m) & \% & ATE(m) & \% & ATE(m) & \% \\ \hline \multicolumn{11}{|c|}{Visual} & \multicolumn{1}{c|}{SLAM} \\ \hline ORB-SLAM3[22] & 0.516 & 0.28\% & 0.949 & 1.46\% & 0.483 & 0.73\% & 0.310 & 0.24\% & – & – \\ \hline SVO[23] & 0.626 & 0.33\% & 0.720 & 1.11\% & 0.482 & 0.73\% & 0.371 & 0.29\% & – & – \\ \hline MCSLAM & 0.778 & 0.42\% & 1.085 & 1.67\% & 0.484 & 0.73\% & 0.458 & 0.36\% & – & – \\ \hline \multicolumn{11}{|c|}{Visual-inertial} \\ \hline vins-Fusion[24] & 1.120 & 0.60\% & 2.265 & 3.48\% & - & - & - & - & 15.844 & 2.03\% \\ \hline Basalt[25] & 1.214 & 0.65\% & 4.043 & 6.22\% & 1.809 & 2.74\% & 3.054 & 2.39\% & 1.753 & 0.22\% \\ \hline SVO-inertial & 0.649 & 0.35\% & 2.447 & 3.76\% & 0.558 & 0.85\% & 0.621 & 0.48\% & 16.202 & 2.07\% \\ \hline \multicolumn{11}{|c|}{Deep Learning} \\ \hline Droid SLAM[26] & 0.441 & 0.24\% & 0.666 & 1.02\% & 0.112 & 0.17\% & 0.214 & 0.17\% & – & – \\ \hline \multicolumn{11}{|c|}{LIDAR} \\ \hline LEGO LOAM[27] & 0.395 & 0.21\% & 0.256 & 0.39\% & 0.789 & 1.20\% & 0.286 & 0.22\% & – & – \\ \hline \end{tabular} \end{table} TABLE IV: This table outlines the performance of various algorithms on the ISEC dataset. We evaluate each algorithm on loops on the \(5^{th}\), \(1^{st}\), \(4^{th}\), and \(2^{nd}\) floors, in the order they appear in the continuous dataset. Inertial algorithms are also evaluated on the full dataset, which includes elevator transits between floors. Results are reported as the absolute translational error at the final position in meters, and as a percentage of the estimated trajectory length.We run each algorithm with loop closure disabled, because most algorithms can use the AprilTag markers to form a loop closure, bringing the error close to zero, which does not produce a useful performance metric. While testing the \(2^{nd}\) and \(4^{th}\) floors individually, vins-Fusion resulted in unusually high drift and was left out of this analysis. All vins algorithms surprisingly display higher drift than the visual counterparts due to issues with initialization. We perform a loop closure analysis in Discussion subsection A. of the vehicle. However, we observed that inertial sensing is not always effective when vision fails. For instance, when we ride in the elevator, the visual features detected on the elevator walls interfere with the inertial sensing leading to erroneous poses. #### Iv-B3 Other Issues We have noticed that the performance of VIO algorithms heavily relies on the initial conditions and parameter tuning. In some sequences, the algorithms perform poorly when we start from specific points. Even starting the data with a time difference of +/- 2 seconds shifts the final drift by about 5 meters. The current SLAM algorithms have a massive list of different parameters that need to be tuned specifically to the dataset. These parameters are generally not standardized or consistent across different algorithms, and tuning them can be arduous. Learning-based methods have an edge in this regard since they do not need as much manual intervention. Additionally, the type and configuration of sensors also impact the performance of the algorithms, which is essential but is unfortunately one of the less researched topics. To demonstrate this, we compare the estimated trajectories of one of the visual-inertial algorithms (VINS-Fusion) executed on the ZED's stereo inertial system and the stereo configuration with VN100 IMU used in earlier evaluations on the complete multi-floor sequence of the Snell Library dataset. We observe that the two runs differ significantly, as shown in figure 8. #### Iv-B4 Potential usage The previous discussion clearly shows that the current algorithms fall short in performing large-scale indoor SLAM. There is much room for improvement in the various real-world scenarios discussed above. An upcoming research direction in this regard is to incorporate semantic information from vision into the SLAM framework, as explored in many recent works. One possible solution to improve loop closure detection would be to use contextual information specific to the location, structure, and objects to Fig. 8: This figure shows the difference in performance when we run VINS-Fusion on the Library dataset with the VN 100 IMU and ZED IMU. The figure compares x, y, z positions estimated by VINS fusion in both configurations. The red dotted lines show when we enter the elevator. On every floor, we come back to the starting position, and after 2nd floor, we come back to the first floor starting position again which was our origin. The figure clearly shows that VINS Fusion accumulates more drift with ZED sensor setup in all three axes. Fig. 6: This shows the perceptual aliasing problem that is typical of modern buildings. (a) It shows the estimated trajectory of Basalt, a visual-inertial SLAM system for the full multi-floor sequence of the ISEC building without the loop detection, and (b) shows the same sequence run after the loop closure detection. Here the green line segments connecting floors are the incorrectly identified loop closure constraints between poses due to the similarity in appearance. Fig. 7: This figure shows the 5th-floor trajectories calculated by the various algorithms with two highlighted areas, **(A)** and **(B)**. **(A)** shows a portion of the sequence with dynamic content and its impact on the trajectory estimates, resulting in jagged artifacts for the vision-only algorithms. **(B)** highlights a featureless environment during a tight turn, which caused incorrect trajectory estimates or failure in the vision-only algorithms. distinguish between the floors. There is also a need for better modeling of IMU data that captures the noise properties better [29], contributing to better SLAM back-ends. ## VI Conclusion We have presented a novel multi-modal SLAM dataset that contains visual, inertial, and lidar. The dataset contains several challenging sequences collected by driving a mobile robot across multiple floors of an open-concept office space with narrow corridors, featureless spaces, glass surfaces, and dynamic objects, which challenge the SLAM algorithms. One of the exciting features of our dataset is the symmetric and visually similar locations across different floors that cause perceptual aliasing. We evaluated several SLAM and visual odometry methods across different sensor modalities. The results demonstrate the limitations and areas of improvement in the current SOTA. The main goal of this dataset is to enable the development and testing of novel algorithms for indoor SLAM to address the various challenges discussed. We intend to expand the dataset to outdoors and add more challenging sequences in the future.

2308.01914

Fritz-John optimality condition in fuzzy optimization problems and its application to classification of fuzzy data

The main objective of this paper is to derive the optimality conditions for one type of fuzzy optimization problems. At the beginning, we define a cone of descent direction for fuzzy optimization, and prove that its intersection with the cone of feasible directions at an optimal point is an empty set. Then, we present first-order optimality conditions for fuzzy optimization problems. Furthermore, we generalize the Gordan's theorem for fuzzy linear inequality systems and utilize it to deduce the Fritz-John optimality condition for the fuzzy optimization with inequality constraints. Finally, we apply the optimality conditions established in this paper to a binary classification problem for support vector machines with fuzzy data. In the meantime, numerical examples are described to demonstrate the primary findings proposed in the present paper.

Fangfang Shi, Guoju Ye, Wei Liu, Debdas Ghosh

2023-07-05T09:34:10Z

http://arxiv.org/abs/2308.01914v1

Fritz-John optimality condition in fuzzy optimization problems and its application to classification of fuzzy data ###### Abstract The main objective of this paper is to derive the optimality conditions for one type of fuzzy optimization problems. At the beginning, we define a cone of descent direction for fuzzy optimization, and prove that its intersection with the cone of feasible directions at an optimal point is an empty set. Then, we present first-order optimality conditions for fuzzy optimization problems. Furthermore, we generalize the Gordan's theorem for fuzzy linear inequality systems and utilize it to deduce the Fritz-John optimality condition for the fuzzy optimization with inequality constraints. Finally, we apply the optimality conditions established in this paper to a binary classification problem for support vector machines with fuzzy data. In the meantime, numerical examples are described to demonstrate the primary findings proposed in the present paper. Fuzzy optimization, Gordan's theorem, Fritz-John optimality condition, Fuzzy data classification 1 Fangfang Shi, Guoju Ye, Wei Liu, Debbas Ghosh ## 1 Introduction Optimization is a branch of applied mathematics, which aims to find the maximum or minimum value of a function under constraints. Optimization problems inevitably arise in many realistic fields including machine learning, management science, economics, physics, mechanics, etc. In practical problems, as the data are often generated by measurement and estimation, it is accompanied by uncertainties. These uncertain data govern the objective function and constraints conditions for the model optimization problem, if the coefficients in the representation involving the function are expressed as real numbers, the results may be meaningless as errors accumulate. Fuzzy set theory proposed by Zadeh [25] is a powerful tool to solve uncertain problems when uncertainty is given by imprecision. It regards uncertain parameters as fuzzy numbers. This method has been applied in many fields of practical optimization, such as financial investment [24], cooperative game [14], support vector machine (SVM) [26] and so on. In fuzzy optimization, the differentiability of fuzzy functions is an important idea in establishing optimality conditions. Panigrahi[15] used the Buckley-Feuring method to obtain the differentiability of multi-variable fuzzy mappings and deduced the KKT conditions for the constrained fuzzy minimization problem. However, the main drawback of this method is that the fuzzy derivative is degenerated to the real function derivative, which effectively reduces the fuzziness. Wu [22] defined the Hukuhara difference (H-difference) of two fuzzy numbers, and derived the weak and strong duality theorems of Wolfe primal-dual problem by defining the gradient of fuzzy function. Chalco-Cano et al. [6] considered the notion of strongly generalized differentiable fuzzy functions and obtained the KKT optimality conditions for fuzzy optimization problems (FOPs). Wu [23] established the concepts of level-wise continuity and level-wise differentiability of fuzzy functions, and gave the KKT condition where the objective function is level continuous and differentiable at feasible solutions. The derivatives used in these methods all depend on the H-difference, but the H-difference does not necessarily exist for any pair of fuzzy numbers. Bede and Stefanini therefore introduced a new derivative in [2] known as the generalized Hukuhara derivative (gH-derivative), that is more widespread than Hukuhara differentiability, level-wise differentiability and strongly generalized differentiability. Najariyan and Farahi [17] investigated fuzzy optimal control systems with fuzzy linear boundary conditions by utilizing the gH-differentiability of fuzzy functions. Chalco-Cano et al. [4] presented a Newton method for the search of non-dominant solutions of FOPs by using gH-differentiability. For more articles on fuzzy optimization, interested readers can refer to [18; 13; 20; 27; 1; 8; 10; 12; 11] and the reference therein. It can be seen from the existing literature that the authors are committed to transforming fuzzy functions into interval-valued functions by using cut sets, and then using two upper and lower endpoint real functions to study the optimization conditions, which is a natural generalization of real functions. This technique of converting the FOP into a conventionally optimization model delivers a solution to the problem, but it neglects the analyse the overall solution. Nehi and Daryab [16] studied the optimality conditions of fuzzy op timization problems through the descending direction cone, which is a meaningful work, but unfortunately, the derivative used in the article is defined by the endpoint value function. In 2019, Ghosh et al. [9] analyzed from the perspective of geometry solutions to constrained and unconstrained interval-valued problems, and obtained KKT optimality results. Inspired by these literatures, the main objective of this paper is to study the Fritz-John and KKT type necessary optimality conditions for one type of FOPs with fuzzy constraints, and then apply the optimality conditions obtained in this paper to the SVM binary classification problems of fuzzy data sets. The remainder of this article is to be organized as follows. The preliminaries are introduced in Section 2. In Section 3, we first put forward a definition of the cone descent direction of the fuzzy function, and use it to show the first-order optimality conditions of unconstrained FOP at the optimal solution. Then, Gordan's alternative theorem is extended to solve the system of fuzzy inequalities. Based on this theorem, the necessary conditions for Fritz-John and KKT types optimality of constrained FOPs are established, and numerical examples to verify the accuracy of the results are also available. It is worth noting that the means used in the proof are not to convert FOPs into traditional optimization models. In Section 4, the findings of this paper are employed in binary classification problems with fuzzy data points. The study ends in Section 5, where conclusions are drawn. ## 2 Preliminaries The set of all bounded and closed intervals in \(\mathbb{R}\) is written as \(\mathbb{R}_{I}\), i.e., \[\mathbb{R}_{I}=\{[\underline{\ell},\overline{\ell}]:\underline{\ell}, \overline{\ell}\in\mathbb{R}\text{ and }\underline{\ell}\leq\overline{\ell}\}.\] A fuzzy set on \(\mathbb{R}^{n}\) is a mapping \(m:\mathbb{R}^{n}\rightarrow[0,1]\), and its \(\varrho\)-cut set is \([m]^{\varrho}=\{x\in\mathbb{R}^{n}:m(x)\geq\varrho\}\) for every \(\varrho\in(0,1]\), and the \(0\)-cut set is \([m]^{0}=\{x\in\mathbb{R}^{n}:m(x)>0\}\), here \(\overline{\mathbb{T}}\) represents the closure of the set \(\mathbb{T}\subseteq\mathbb{R}^{n}\). **Definition 2.1**: _[_25_]_ _A fuzzy set \(m\) on \(\mathbb{R}\) is said to be a fuzzy number if_ * \(m\) _is normal, i.e., there exists_ \(x^{*}\in\mathbb{R}\) _such that_ \(m(x^{*})=1\)_;_ * \(m\) _is upper semi-continuous;_ * \(m(\vartheta x_{1}+(1-\vartheta)x_{2})\geq\min\{m(x_{1}),m(x_{2})\},\ \forall\ x_{1},x_{2}\in\mathbb{R}, \vartheta\in[0,1]\)_;_ * \([m]^{0}\) _is compact._ The set of all fuzzy numbers is written as \(\mathcal{F}_{\mathbb{C}}\). Let \(m\in\mathcal{F}_{\mathbb{C}}\), the \(\varrho\)-cuts of \(m\) are given \([m]^{\varrho}=[m^{\varrho},\overline{m}^{\varrho}]\in\mathbb{R}_{I}\), where \(\underline{m}^{\varrho},\overline{m}^{\varrho}\in\mathbb{R}\) for each \(\varrho\in[0,1]\). Note that every \(\ell\in\mathbb{R}\) can be regarded as \(\overline{\ell}\in\mathcal{F}_{\mathbb{C}}\), i.e., \([\overline{\ell}]^{\varrho}=[\ell,\ell]\) for each \(\varrho\in[0,1]\). For example, for a triangular fuzzy number \(m=(\ell_{1},\ell_{2},\ell_{3})\in\mathcal{F}_{\mathbb{C}}\), \(\ell_{1},\ell_{2},\ell_{3}\in\mathbb{R}\) and \(\ell_{1}\leq\ell_{2}\leq\ell_{3}\), its \(\varrho\)-cut set is \([m]^{\varrho}=\{\ell_{1}+(\ell_{2}-\ell_{1})\varrho,\ell_{3}-(\ell_{3}-\ell_{2} )\varrho|,\varrho\in[0,1]\). Given \(m,l\in\mathcal{F}_{\mathbb{C}}\), the distance between \(m\) and \(l\) is \[\mathfrak{T}(m,l)=\sup_{\varrho\in[0,1]}\max\{\|\ \underline{m}^{\varrho}- \overline{\ell}^{\varrho}\mid,\overline{m}^{\varrho}-\overline{\ell}^{\varrho} \mid\}.\] For any \(m,l\in\mathcal{F}_{\mathbb{C}}\) represented by \([m^{\varrho},\overline{m}^{\varrho}]\) and \([\underline{\ell},\overline{\ell}^{\varrho}]\), respectively, and for every \(\vartheta\in\mathbb{R}\), \[(m+l)(x)=\sup_{x=1+\nu_{2}}\min\{m(x_{1}),l(x_{2})\},\] \[(\vartheta m)(x)=\begin{cases}m(\frac{x}{\vartheta}),&\text{if }\vartheta\neq 0, \\ 0,&\text{if }\vartheta=0,\end{cases}\] respectively. For every \(\varrho\in[0,1]\), \[[m+l]^{\varrho}=[\underline{m}^{\varrho}+\underline{\ell},\overline{m}^{ \varrho}+\overline{\ell}^{\varrho}],\] \[[\vartheta m]^{\varrho}=[\min\{\vartheta\underline{m}^{\varrho},\vartheta \overline{m}^{\varrho}\},\max\{\vartheta\underline{m}^{\varrho},\vartheta \overline{m}^{\varrho}\}].\] **Definition 2.2**: _[_21_]_ _For any \(m,l\in\mathcal{F}_{\mathbb{C}}\), their \(g\)H-difference \(\gamma\in\mathcal{F}_{\mathbb{C}}\), if it exists, is given by_ \[m\odot_{gH}l=\gamma\Leftrightarrow\begin{cases}(i)\ m=l+\gamma,\\ \text{or }(ii)\ l=m+(-1)\gamma.\end{cases}\] _If \(m\odot_{gH}l\) exists, then for all \(\varrho\in[0,1]\),_ \[[m\odot_{gH}l]^{\varrho}=[m]^{\varrho}\odot_{gH}[l]^{\varrho}=[\min\{ \underline{m}^{\varrho}-\underline{\ell}^{\varrho},\overline{m}^{\varrho}- \overline{\ell}^{\varrho}\},\max\{\underline{m}^{\varrho}-\underline{\ell}^{ \varrho},\overline{m}^{\varrho}-\overline{\ell}^{\varrho}\}].\] **Definition 2.3**: _[_22_]_ _Let \(m,l\in\mathcal{F}_{\mathbb{C}}\) be such that \([m]^{\varrho}=[\underline{m}^{\varrho},\overline{m}^{\varrho}]\) and \([l]^{\varrho}=[\underline{\ell}^{\varrho},\overline{\ell}^{\varrho}]\) for all \(\varrho\in[0,1]\). Then, we write_ \[m\leq l\text{ iff }[m]^{\varrho}\leq_{LU}[l]^{\varrho}\text{ for all }\varrho\in[0,1],\] _which is equivalent to writing \(\underline{m}^{\varrho}\leq\underline{\ell}^{\varrho}\) and \(\overline{m}^{\varrho}\leq\overline{\ell}^{\varrho}\) for all \(\varrho\in[0,1]\). We write_ \[m\preceq l\text{ iff }[m]^{\varrho}\leq_{LU}[l]^{\varrho},\] _which is equivalent to \([m]^{\varrho}\leq_{LU}[l]^{\varrho}\) for all \(\varrho\in[0,1]\) and \(\underline{m}^{\varrho^{\varrho}}<\underline{\ell}^{\varrho}\) or \(\overline{m}^{\varrho^{\varrho}}<\overline{\ell}^{\varrho^{\varrho}}\) for some \(\varrho^{\varrho}\in[0,1]\). We write_ \[m<l\text{ iff }[m]^{\varrho}<_{LU}[l]^{\varrho}\text{ for all }\varrho\in[0,1],\] _which is equivalent to saying that \(\underline{m}^{\varrho}<\underline{\ell}\) and \(\overline{m}^{\varrho}<\overline{\ell}^{\varrho}\) for all \(\varrho\in[0,1]\)._ **Lemma 2.4**: _For any \(m,l\in\mathcal{F}_{\mathbb{C}}\), \(m\preceq l\) iff \(m\odot_{gH}l\preceq\tilde{0}\)._ _Proof_ Let \(m,l\in\mathcal{F}_{\mathbb{C}}\), for any \(\varrho\in[0,1]\), we have \[m\preceq l \Leftrightarrow[m]^{\varrho}\leq\underline{\ell}^{\varrho}\text{ and } \overline{m}^{\varrho}\leq\overline{\ell}^{\varrho}\] \[\Leftrightarrow\underline{m}^{\varrho}-\underline{\ell}^{\varrho}\leq 0 \text{ and }\overline{m}^{\varrho}-\overline{\ell}^{\varrho}\leq 0\] \[\Leftrightarrow[m]^{\varrho}\odot_{gH}[l]^{\varrho}\leq_{LU}[0,0]\] \[\Leftrightarrow[m\odot_{gH}l]^{\varrho}\leq_{LU}[0,0]\] \[\Leftrightarrow m\odot_{gH}l\preceq\tilde{0}.\] The proof is completed. **Remark 2.5**: _From Lemma 2.4, it is obvious that \(m\leq 1\) iff \(m\in\mathbb{G}_{\#H}\)\(l\leq 0\), \(m<l\) iff \(m\in\mathbb{G}_{\#H}\)\(l<0\)._ **Definition 2.6**: _[_16_]_ _The \(\mathcal{U}=(m_{1},m_{2},\ldots,m_{n})^{\top}\) is said to be an \(n\)-dimensional fuzzy vector if \(m_{1},m_{2},\ldots,m_{n}\in\mathcal{F}_{C}\). All \(n\)-dimensional fuzzy vectors are recorded as \(\mathcal{F}_{C}^{n}\). The \(\varrho\)-cut set of \(\mathcal{U}=(m_{1},m_{2},\ldots,m_{n})^{\top}\in\mathcal{F}_{C}^{n}\) is defined as_ \[\mathcal{U}_{\varrho}=([m_{1}]^{\varrho},[m_{2}]^{\varrho},\ldots,[m_{n}]^{ \tau})^{\top}.\] _For any \(\mathcal{U}=(m_{1},m_{2},\ldots,m_{n})^{\top}\in\mathcal{F}_{C}^{n}\) and \(\vartheta\in\mathbb{R}\), we have_ \[\vartheta\mathcal{U}=(\vartheta m_{1},\vartheta m_{2},\ldots,\vartheta m_{n} )^{\top},\] _and for any \(\kappa=(\kappa_{1},\kappa_{2},\ldots,\kappa_{k})^{\top}\in\mathbb{R}^{n}\), the product \(\kappa^{\tau}\mathcal{U}\) is defined as \(\kappa^{\tau}\mathcal{U}=\sum_{j=1}^{n}\kappa_{j}m_{j}\)._ _For \(\mathcal{U}=(m_{1},m_{2},\cdots,m_{n})^{\top},\mathcal{V}=(l_{1},l_{2},\cdots,l_{n})^{\top}\in\mathcal{F}_{C}^{n}\), then_ \[\mathcal{U}\leq\mathcal{V}\text{ iff }m_{j}\leq l_{j},\ \ \forall\ j=1,2, \cdots,n,\] \[\mathcal{U}\leq\mathcal{V}\text{ iff }m_{j}\leq l_{j},\ \ \forall\ j=1,2, \cdots,n,\] \[\mathcal{U}\prec\mathcal{V}\text{ iff }m_{j}<l_{j},\ \ \forall\ j=1,2, \cdots,n.\] Unless otherwise specified, \(\mathbb{T}\) is represented as a nonempty subset of \(\mathbb{R}^{n}\). Let \(\mathcal{H}:\mathbb{T}\rightarrow\mathcal{F}_{C}\) be a fuzzy function on \(\mathbb{T}\). For every \(\varrho\in[0,1]\), \(\mathcal{H}\) can be represented as the set of interval-valued functions \(\mathcal{H}_{\varrho}:\mathbb{T}\rightarrow\mathbb{R}_{I}\), as indicated below \[\mathcal{H}_{\varrho}(x)=[\mathcal{H}(x)]^{\mathbb{F}}=[\underline{\mathcal{H }^{\varrho}}(x),\overline{\mathcal{H}^{\varrho}}(x)].\] **Definition 2.7**: _[_19_]_ _Let \(x^{*}\in\mathbb{T}\). The \(\mathcal{H}:\mathbb{T}\rightarrow\mathcal{F}_{C}\) ia said to be continuous at \(x^{*}\) if for any \(\epsilon>0\), there is a \(\delta>0\) that makes_ \[\mathfrak{D}(\mathcal{H}(x),\mathcal{H}(x^{*}))<\epsilon\ \text{ as }0<|x-x^{*}|<\delta.\] **Theorem 2.8**: _Let the fuzzy function \(\mathcal{H}:\mathbb{T}\rightarrow\mathcal{F}_{C}\) be continuous at \(x^{*}\in\mathbb{T}\) and \(\mathcal{H}(x^{*})<\tilde{0}\). Then, there exists a \(\delta>0\) such that \(\mathcal{H}(x)<\tilde{0}\) whenever \(0<|x-x^{*}|<\delta\)._ _Proof_ It follows from the assumption that for any \(\epsilon>0\), there is \(\delta^{\prime}>0\) as to make \[\mathfrak{D}(\mathcal{H}(x),\mathcal{H}(x^{*}))<\epsilon\ \ \text{ as }\ \ 0<|x-x^{*}|<\delta^{\prime}.\] Then, \[|\,\underline{\mathcal{H}^{\varrho}}(x)-\underline{\mathcal{H}^{\varrho}}(x^{ *})\,|<\epsilon\ \text{ and }\ |\,\overline{\mathcal{H}^{\varrho}}(x)-\overline{\mathcal{H}^{\varrho}}(x^{*})\,|<\epsilon \ \text{for all}\,\varrho\in[0,1].\] So, \(\underline{\mathcal{H}^{\varrho}}\) and \(\overline{\mathcal{H}^{\varrho}}\) are continuous at \(x^{*}\) for any \(\varrho\in[0,1]\). From \(\mathcal{H}(x^{*})<\tilde{0}\), we get \[\underline{\mathcal{H}^{\varrho}}(x^{*})<0\ \text{and}\ \overline{\mathcal{H}^{\varrho}}(x^{*})<0\ \text{for all}\ \varrho\in[0,1].\] Then, from the local sign preserving property of real continuous functions, there is a \(\delta>0\) (\(\delta\leq\delta^{\prime}\)) that make \[\underline{\mathcal{H}^{\varrho}}(x)<0\ \text{and}\ \overline{\mathcal{H}^{\varrho}}(x)<0 \ \text{for each}\ \varrho\in[0,1]\] as \(0<|x-x^{*}|<\delta\). Then \(\mathcal{H}_{\varrho}(x)<_{LU}[0,0]\) for every \(\varrho\in[0,1]\), i.e., \(\mathcal{H}(x)<\tilde{0}\). \(\Box\) **Definition 2.9**: _[_5_]_ _We call the fuzzy function \(\mathcal{H}\) convex on \(\mathbb{T}\) if for each \(x_{1},x_{2}\in\mathbb{T}\) and all \(\vartheta\in(0,1)\),_ \[\mathcal{H}(\vartheta x_{1}+(1-\vartheta)x_{2})\leq\vartheta\mathcal{H}(x_{1} )+(1-\vartheta)\mathcal{H}(x_{2}).\] **Definition 2.10**: _[_2_]_ _Let \(\mathcal{H}:\mathbb{T}\subseteq\mathbb{R}\rightarrow\mathcal{F}_{C}\) be a fuzzy function, \(x^{*}\in\mathbb{T}\) and \(d\in\mathbb{R}\) be such that \(x^{*}+d\in\mathbb{T}\). Then, \(\mathcal{H}\) is said to have \(\beta\)H-differentiable at \(x^{*}\) if there exists \(\mathcal{H}^{\prime}(x^{*})\in\mathcal{F}_{C}\) that make_ \[\mathcal{H}^{\prime}(x^{*})=\lim_{d\to 0}\frac{1}{d}(\mathcal{H}(x^{*}+d) \odot_{\beta\text{eff}}\mathcal{H}(x^{*})).\] _Moreover, the interval-valued function \(\mathcal{H}_{\varrho}:\mathbb{T}\rightarrow\mathbb{R}_{I}\) be \(\varrho\)H-differentiable for every \(\varrho\in[0,1]\) and \([\mathcal{H}^{\prime}(x)]^{\varrho}=\mathcal{H}^{\varrho}_{\varrho}(x)\)._ **Definition 2.11**: _[_4_]_ _Let \(\mathcal{H}:\mathbb{T}\rightarrow\mathcal{F}_{C}\) be a fuzzy function and \(x^{*}=(x^{*}_{1},x^{*}_{2},\ldots,x^{*}_{n})^{\top}\in\mathbb{T}\) and let \(\mathcal{P}_{i}(x_{i})=\mathcal{H}(x^{*}_{1},\ldots,x^{*}_{i-1},x_{i},\)\(x^{*}_{i+1},\ldots,x^{*}_{i})\). If \(\mathcal{P}_{i}\) has \(\beta\)H-differentiable at \(x^{*}_{i}\), then we call \(\mathcal{H}\) has the \(i\)th partial \(\beta\)H-differentiable at \(x^{*}\) (written as \(D_{i}\mathcal{H}(x^{*})\) and \(D_{i}\mathcal{H}(x^{*})=\mathcal{P}^{\varrho}_{\varrho}(x^{*}_{i})\))._ _The gradient \(\nabla\mathcal{H}(x^{*})\) of \(\mathcal{H}\) at \(x^{*}\) is_ \[\nabla\mathcal{H}(x^{*})=(D_{1}\mathcal{H}(x^{*}),D_{2}\mathcal{H}(x^{*}),\ldots,D_ {s}\mathcal{H}(x^{*}))^{\top}\,.\] **Definition 2.12**: _[_20_]_ _Let \(x^{*}\in\mathcal{X}\) and \(\tau\in\mathbb{R}^{n}\). The fuzzy function \(\mathcal{H}\) is called \(g\)H-directional differentiable at \(x^{*}\) along the direction \(\tau\), if there is a \(\mathcal{H}_{\varrho}(x^{*})(\tau)\in\mathrm{E}\) that make_ \[\lim_{\kappa\to 0^{\top}}\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! \!\!\!\!\!\!\!\!\!\!\!\!\! ## 3 Fritz-John optimality conditions In this section, we will investigate the optimality conditions of FOPs at the optimal solution from the perspective of geometry. **Theorem 3.1**: _Let \(\mathcal{H}:\mathbb{T}\to\mathcal{F}_{\mathbb{C}}\) be gH-differentiable at \(x^{*}\in\mathbb{T}\). If \(\tau^{\top}\nabla\mathcal{H}(x^{*})<\bar{0}\) for some \(\tau\in\mathbb{R}^{n}\), then there is \(\delta>0\) that makes for each \(\kappa\in(0,\delta)\),_ \[\mathcal{H}(x^{*}+\kappa\tau)<\mathcal{H}(x^{*}).\] _Proof_ Since \(\mathcal{H}\) be gH-differentiable at \(x^{*}\), then from Definition 2.12 and Lemma 2.13, we have \[\lim_{\kappa\to 0^{\prime}}\frac{1}{\kappa}(\mathcal{H}(x^{*}+\kappa\tau) \oplus_{gH}\mathcal{H}(x^{*}))=\tau^{\top}\nabla\mathcal{H}(x^{*}).\] Since \(\tau^{\top}\nabla\mathcal{H}(x^{*})<\bar{0}\), we get \[\mathcal{H}(x^{*}+\kappa\tau)\oplus_{gH}\mathcal{H}(x^{*})<\bar{0},\] for each \(\kappa\in(0,\delta)\) with some \(\delta>0\). From Remark 2.5, we get \[\mathcal{H}(x^{*}+\kappa\tau)<\mathcal{H}(x^{*})\text{ for any }\kappa\in(0,\delta).\] \(\Box\) **Remark 3.2**: _The \(\tau\) in Theorem 3.1 represents a descent direction of \(\mathcal{H}\) at \(x^{*}\)._ **Definition 3.3**: _Let \(\mathcal{H}:\mathbb{T}\to\mathcal{F}_{\mathbb{C}}\) be gH-differentiable at \(x^{*}\in\mathbb{T}\), we denote by \(\hat{\mathcal{H}}(x^{*})\) the set of directions \(\tau\in\mathbb{R}^{n}\) with \(\tau^{\top}\nabla\mathcal{H}(x^{*})<\bar{0}\), i.e.,_ \[\hat{\mathcal{H}}(x^{*})=\{\tau\in\mathbb{R}^{n}:\tau^{\top}\nabla\mathcal{H} (x^{*})<\bar{0}\}.\] _As for any \(\tau\in\mathbb{R}^{n},\kappa\tau\in\hat{\mathcal{H}}(x^{*})\) for each \(\kappa>0\), the set \(\hat{\mathcal{H}}(x^{*})\) is said to be the cone of descent directions of \(\mathcal{H}\) at \(x^{*}\)._ **Definition 3.4**: _[_3_]_ _Given a \(x^{*}\in\mathbb{T}\). The cone of feasible directions of \(\mathbb{T}\) at \(x^{*}\) is_ \[\hat{S}(x^{*})=\{\tau\in\mathbb{R}^{n}:x^{*}+\kappa\tau\in\mathbb{T},\forall \kappa\in(0,\delta)\text{ for some }\delta>0\}.\] ### Unconstrained fuzzy optimization problems Consider the following unconstrained fuzzy optimization problem (UFOP, for short): \[\min_{x\in\mathbb{T}}\mathcal{H}(x),\] where \(\mathcal{H}:\mathbb{T}\to\mathcal{F}_{\mathbb{C}}\) be fuzzy function on \(\mathbb{T}\). **Definition 3.5**: _[_5_]_ _The point \(x^{*}\in\mathbb{T}\) is said to be a (local) optimal solution of (UFOP) if there not exist \(x\in\mathbb{T}\in\mathcal{N}_{\delta}(x^{*})\cap\mathbb{T})\) such that \(\mathcal{H}(x)\prec\mathcal{H}(x^{*})\), here \(\mathcal{N}_{\delta}(x^{*})=\{x:0<\lvert x-x^{*}\rvert<\delta,\delta>0\}\)._ **Theorem 3.6**: _If \(\mathcal{H}\) be gH-differentiable at \(x^{*}\in\mathbb{T}\) and \(x^{*}\) is a local optimal solution of (UFOP), then \(\hat{\mathcal{H}}(x^{*})\cap\hat{S}(x^{*})=\emptyset\)._ _Proof_ On contrary, assume that \(\hat{\mathcal{H}}(x^{*})\cap\hat{S}(x^{*})\neq\emptyset\) and \(\tau\in\hat{\mathcal{H}}(x^{*})\cap\hat{S}(x^{*})\). Then, by Theorem 3.1, there is \(\delta_{1}>0\) that makes \[\mathcal{H}(x^{*}+\kappa\tau)<\mathcal{H}(x^{*}),\ \ \kappa\in(0,\delta_{1}).\] Also, by Definition 3.4, there is \(\delta_{2}>0\) that makes \[x^{*}+\kappa\tau\in\mathbb{T},\ \ \kappa\in(0,\delta_{2}).\] Defining \(\delta=\min\{\delta_{1},\delta_{2}\}>0\), for all \(\kappa\in(0,\delta)\), we obtain \[x^{*}+\kappa\tau\in\mathbb{T}\text{ and }\mathcal{H}(x^{*}+\kappa\tau) \prec\mathcal{H}(x^{*}).\] This contradicts that \(x^{*}\) be the local optimal solution. Thus, \(\hat{\mathcal{H}}(x^{*})\cap\hat{S}(x^{*})=\emptyset\). \(\Box\) **Corollary 3.7**: _Let \(\mathcal{H}\) be gH-differentiable at \(x^{*}\in\mathbb{T}\). If \(\hat{\mathcal{H}}(x^{*})\cap\hat{S}(x^{*})\neq\emptyset\), then \(x^{*}\) is not a local optimal point of (UFOP)._ **Example 3.8**: _We consider the following UFOP:_ \[\min_{(x_{1},x_{2})\in\mathbb{T}}\mathcal{H}(x_{1},x_{2}),\] _where \(\mathcal{H}(x_{1},x_{2})=\{2,3,7\}(x_{1}-1.5)^{2}+(1,2,5)x_{2}^{2}+1\) and \(\mathbb{T}=\{(x_{2},x_{2}):1\leq x_{1}\leq 2,\ 1\leq x_{2}\leq 2\}\). Notice that for all \(\varrho\in[0,1]\),_ \[\mathcal{H}_{\varrho}(x_{1},x_{2})=[2+\varrho,7-4\varrho](x_{1}-1.5)^{2}+[1+ \varrho,5-3\varrho]x_{2}^{2}+1.\] _The functions \(\mathcal{H}_{\varrho}\) are depicted in Figures 1(a) - 1(c) for \(\varrho=0,0.3,0.7\) and \(1\) respectively. Evidently, \(x^{*}=(1.5,1)\) is an optimal point and_ \[\hat{S}(x^{*}) =\{(\tau_{1},\tau_{2})\neq(0,0):(1.5+\kappa\tau_{1},1+\kappa\tau_{2}) \in\mathbb{T},\] \[\qquad\forall\kappa\in(0,\delta)\text{ for some }\delta>0\}\] \[\qquad=\{(\tau_{1},\tau_{2})\neq(0,0):\tau_{2}\geq 0\},\] _and_ \[\hat{\mathcal{H}}(x^{*}) =\{(\tau_{1},\tau_{2})\in\mathbb{R}^{2}:(\tau_{1},\tau_{2})\nabla \mathcal{H}(x^{*})<\bar{0}\}\] \[=\{(\tau_{1},\tau_{2})\in\mathbb{R}^{2}:\tau_{1}D_{1}\mathcal{H}(x ^{*})+\tau_{2}D_{2}\mathcal{H}(x^{*})<\bar{0}\}\] \[=\{(\tau_{1},\tau_{2})\in\mathbb{R}^{2}:\tau_{2}D_{2}\mathcal{H}_{ \varrho}(x^{*})<_{LU}[0,0]\] \[\qquad\text{for each }\varrho\in[0,1]\}\] \[=\{(\tau_{1},\tau_{2})\in\mathbb{R}^{2}:\tau_{2}(2+2\varrho)<0 \text{ and }\tau_{2}(10-6\varrho)<0\] \[\qquad\text{for each }\varrho\in[0,1]\}\] \[=\{(\tau_{1},\tau_{2})\in\mathbb{R}^{2}:\tau_{2}<0\}.\] _Thus, we see that_ \[\hat{S}(x^{*})\cap\hat{\mathcal{H}}(x^{*})=\emptyset.\] _Consider another point \(\hat{x}=(1.5,2)\). By a similar way, we get_ \[\hat{S}(\bar{x})=\{(\tau_{1},\tau_{2})\neq(0,0):\tau_{2}\leq 0\},\] _and_ \[\hat{\mathcal{H}}(\bar{x})=\{(\tau_{1},\tau_{2})\in\mathbb{R}^{2}:\tau_{2}<0\}.\] _FJ condition for fuzzy optimization_ _Since_ \[\mathcal{S}(\bar{x})\cap\dot{\mathcal{H}}(\bar{x})=\{(\tau_{1},\tau_{2})\in\mathbb{ R}^{2}:\tau_{2}<0\}\neq\emptyset.\] _Thus, from the Corollary 3.7, \(\bar{x}\) must be not an optimal point of \(\mathcal{H}\) on \(\mathbb{T}\)._ **Theorem 3.9**: _(Fuzzy First Gordan's Theorem). Let \(\mathcal{U}=(m_{1},m_{2},\ldots,m_{n})^{\top}\in\mathcal{F}_{C}^{\infty}\). Then, just a conclusion of the below holds:_ 1. _there is_ \(y=(y_{1},y_{2},\ldots,y_{n})^{\top}\in\mathbb{R}^{n}\) _makes_ \(y^{\top}\mathcal{U}<\bar{0}\)_;_ 2. _for each_ \(\varrho\in[0,1]\)_, there is_ \(x\in\mathbb{R},x>0\) _makes_ \((0,0,\ldots,0)_{n}^{\top}\in x\mathcal{U}_{\varrho}\)_._ _Proof_ Suppose (i) holds. On contrary, assume that (ii) also holds. As (i) holds, there exists \(y_{0}\in\mathbb{R}^{n}\) such that \[y_{0}^{\top}\mathcal{U}<\bar{0}.\] Then for any \(x\in\mathbb{R},x>0\), \[x(y_{0}^{\top}\mathcal{U})\prec\bar{0}\Longrightarrow y_{0}^{\top}(x \mathcal{U})\prec\bar{0}.\] That is, \[y_{0}^{\top}(x\mathcal{U}_{\varrho})\prec_{LU}[0,0]\text{ for all }\varrho\in[0,1]. \tag{3.1}\] As (ii) is also true, then for all \(\varrho\in[0,1]\) and exists \(x_{0}\in\mathbb{R},x_{0}>0\), \[(0,0,\ldots,0)_{n}^{\top}\in x_{0}\mathcal{U}_{\varrho}.\] For all \(y\in\mathbb{R}^{n}\), we have \[0\in y^{\top}(x_{0}\mathcal{U}_{\varrho}). \tag{3.2}\] Since (3.1) and (3.2) cannot hold simultaneously, a contradiction is obtained. The other cases are proved below, suppose that (ii) holds, and (i) is false. On contrary, if (ii) is false, then for some \(\varrho\in[0,1]\) and all \(x\in\mathbb{R},x>0\), \[(0,0,\ldots,0)_{n}^{\top}\neq x\mathcal{U}_{\varrho}\Longrightarrow(0,0, \ldots,0)_{n}^{\top}\neq\mathcal{U}_{\varrho}.\] That is, \[\exists\ j\in\{1,2,\ldots,n\}\text{ such that }0\notin[m_{j}]^{n},\] or, \(\exists\ j\in\{1,2,\ldots,n\}\text{ such that }[0,0]\prec_{LU}[m_{j}]^{n}\text{ or }[m_{j}]^{n}<_{LU}[0,0]\). Let \[P=\{j:0\in[m_{j}]^{n},j\in\{1,2,\ldots,n\}\}\] and \[Q=\{j:0\notin[m_{j}]^{j},j\in\{1,2,\ldots,n\}\}.\] Obviously, \(Q\neq\emptyset\), \(P\cup Q=\{1,2,\ldots,n\}\) and \(P\cap Q=\emptyset\). Build a vector \(y_{0}=(y_{1}^{0},y_{2}^{0},\ldots,y_{n}^{0})^{\top}\) through \[y_{j}^{0}=\begin{cases}0,&\text{if }j\in P,\\ 1,&\text{if }j\in Q\text{ and }[m_{j}]^{n}<_{LU}[0,0],\\ -1,&\text{if }j\in Q\text{ and }[0,0]<_{LU}[m_{j}]^{n}.\end{cases}\] Then \[\begin{split}&\sum_{j\in Q}y_{j}^{0}[m_{j}]^{\varrho}+\sum_{j\in p}y_ {j}^{0}[m_{j}]^{\varrho}\prec_{LU}[0,0],\\ &\text{or, }\sum_{j=1}^{n}y_{j}^{0}[m_{j}]^{\varrho}\prec_{LU}[0,0], \\ &\text{or, }y_{0}^{\top}\mathcal{U}_{\varrho}\prec_{LU}[0,0].\end{split} \tag{3.3}\] However, as (i) is false, then there is no \(y\in\mathbb{R}^{n}\) such that \[\begin{split}& y^{\top}\mathcal{U}\prec\tilde{0},\\ &\text{or, }y^{\top}\mathcal{U}_{\varrho}\prec_{LU}[0,0]\text{ for all }\varrho\in[0,1], \end{split}\] which is contradictory to (3.3). Therefore, we get the desired conclusion. \(\Box\) Next we give the first-order optimality condition for the UFOP. **Theorem 3.10**: _Let \(x^{*}\) is a local optimal solution of (UFOP). If \(\mathcal{H}\) is gH-differentiable at \(x^{*}\). Then, \((0,0,\ldots,0)_{n}^{\top}\in\nabla\mathcal{H}_{\varrho}(x^{*})\) for all \(\varrho\in[0,1]\)._ _Proof_ From Definition 3.3 and Theorem 3.1, if \(x^{*}\) be a local optimal solution, then \(\hat{\mathcal{H}}(x^{*})=\emptyset\). Thus, \[\tau^{\top}\nabla\mathcal{H}(x^{*})\prec\tilde{0}\text{ for no }\tau\in \mathbb{R}^{n}.\] By Theorem 3.9, for all \(\varrho\in[0,1]\), exists \(x^{*}\in\mathbb{R},x^{*}>0\), \[(0,0,\ldots,0)_{n}^{\top}\in x^{*}\nabla\mathcal{H}_{\varrho}(x^{*})\Longrightarrow (0,0,\ldots,0)_{n}^{\top}\in\nabla\mathcal{H}_{\varrho}(x^{*}).\] \(\Box\) ### Fuzzy optimization problem with inequality constraints Consider the following Fuzzy optimization problem (FOP, for short): \[\begin{split}\min&\mathcal{H}(x),\\ \text{subject to }&\mathcal{Y}_{j}(x)\preceq\tilde{0} \text{ for }j=1,2,\ldots,s,\\ & x\in\mathbb{T},\end{split}\] where \(\mathcal{H}:\mathbb{T}\to\mathcal{F}_{\text{C}}\) and \(\mathcal{Y}_{j}:\mathbb{T}\to\mathcal{F}_{\text{C}}\), \(j=1,2,\ldots,s\). The feasible set of (FOP) is \[\mathcal{O}=\{x\in\mathbb{T}:\mathcal{Y}_{j}(x)\preceq\tilde{0}\text{ for every }j=1,2,\ldots,s\}.\] **Lemma 3.11**: _Let \(\mathcal{Y}_{j}:\mathbb{T}\to\mathcal{F}_{\text{C}}\), \(j=1,2,\ldots,s\), be fuzzy functions on the open set \(\mathbb{T}\) and \(\mathbb{S}=\{x\in\mathbb{T}:\mathcal{Y}_{j}(x)\leq\tilde{0}\text{ for }j=1,2,\ldots,s\}\). Let \(x^{*}\in\mathbb{S}\) and \(\Lambda(x^{*})=\{j:\mathcal{Y}_{j}(x^{*})=0\}\). Assuming that \(\mathcal{Y}_{j}\) be gH-differentiable at \(x^{*}\) for \(j\in\Lambda(x^{*})\) and continuous at \(x^{*}\) for \(j\notin\Lambda(x^{*})\), define_ \[\hat{\mathcal{Y}}(x^{*})=\{\tau\in\mathbb{R}^{n}:\tau^{\top}\nabla\mathcal{Y }_{j}(x^{*})<\tilde{0},\ j\in\Lambda(x^{*})\}.\] _Then,_ \[\hat{\mathcal{Y}}(x^{*})\subseteq\hat{S}(x^{*}),\] _here \(\hat{S}(x^{*})=\{\tau\in\mathbb{R}^{n}:x^{*}+\kappa\tau\in\mathbb{S},\forall \kappa\in(0,\delta),\ \delta>0\}\)._ _Proof_ Let \(\tau\in\hat{\mathcal{Y}}(x^{*})\). As \(x^{*}\in\mathbb{T}\) and exists some \(\delta_{0}>0\) makes \[x^{*}+\kappa\tau\in\mathbb{T}\ \text{ for }\kappa\in(0,\delta_{0}). \tag{3.4}\] Since \(\mathcal{Y}_{j}\) be continuous at \(x^{*}\) and \(\mathcal{Y}_{j}(x^{*})<\tilde{0}\) for every \(j\notin\Lambda(x^{*})\), then Theorem 2.8 shows that there have \(\delta_{i}>0\) leading to \[\mathcal{Y}_{j}(x^{*}+\kappa\tau)<\tilde{0}\ \text{ for }\varrho\in(0,\delta_{i}),\ j \notin\Lambda(x^{*}). \tag{3.5}\] Also, as \(\tau\in\hat{\mathcal{Y}}(x^{*})\), from Theorem 3.1, for every \(j\in\Lambda(x^{*})\), there have \(\delta_{j}>0\) makes \[\mathcal{Y}_{j}(x^{*}+\kappa\tau)<\mathcal{Y}_{j}(x^{*})=\tilde{0}\ \text{ for each }\kappa\in(0,\delta_{j}). \tag{3.6}\] Let \(\delta=\min\{\delta_{0},\delta_{1},\ldots,\delta_{s}\}\). From (3.4)-(3.6), \(x^{*}+\kappa\tau\in\mathbb{S}\) for every \(\kappa\in(0,\delta)\). That is, \(\tau\in\hat{S}(x^{*})\). Hence, the proof is completed. \(\Box\) With the help of Lemma 3.11, we can characterize the local optimal solution of (FOP). **Theorem 3.12**: _For \(x^{*}\in\mathcal{O}\), define \(\Lambda(x^{*})=\{i:\mathcal{Y}_{j}(x^{*})=\tilde{0}\}\). Suppose that \(\mathcal{H}\) and \(\mathcal{Y}_{j}\) (\(j\in\Lambda(x^{*})\)) be gH-differentiable and \(\mathcal{Y}_{j}\), \(j\notin\Lambda(x^{*})\), be continuous at \(x^{*}\). If \(x^{*}\) is a local optimal solution of (FOP), then_ \[\hat{\mathcal{H}}(x^{*})\cap\hat{\mathcal{Y}}(x^{*})=\emptyset,\] _where \(\hat{\mathcal{H}}(x^{*})=\{\tau\in\mathbb{R}^{n}:\tau^{\top}\nabla\mathcal{H}(x ^{*})<\tilde{0}\text{ and }\hat{\mathcal{Y}}(x^{*})=\{\tau\in\mathbb{R}^{n}:\tau^{\top}\nabla \mathcal{Y}_{j}(x^{*})<\tilde{0}\text{ for }j\in\Lambda(x^{*})\}\)._ _Proof_ Using Theorem 3.6 and Lemma 3.11, we can get \[\begin{split} x^{*}\text{ is a local optimal solution}& \Longrightarrow\hat{\mathcal{H}}(x^{*})\cap\hat{S}(x^{*})=\emptyset\\ &\Longrightarrow\hat{\mathcal{H}}(x^{*})\cap\hat{\mathcal{Y}}(x^{*})= \emptyset.\end{split}\] \(\Box\) **Definition 3.13**: _[_16_]_ _The \(\mathcal{M}=(m_{ij})_{son}\) is said to be a fuzzy matrix if \(m_{ij}\in\mathcal{F}_{\text{C}}\) for every \(i\in\{1,\ldots,s\},j\in\{1,\ldots,n\}\), denoted by_ \[\mathcal{M}=\begin{pmatrix}m_{11}&\ldots&m_{1n}\\ \vdots&\ddots&\vdots\\ m_{14}&\ldots&m_{m}\end{pmatrix}_{son}.\] _The \(\varrho\)-cut set of \(\mathcal{M}\) is defined as_ \[\mathcal{M}_{\varrho}=\begin{pmatrix}[m_{11}]^{\varrho}&\ldots&[m_{1n}]^{\varrho} \\ \vdots&\ddots&\vdots\\ [m_{11}]^{\varrho}&\ldots&[m_{m}]^{\varrho}\end{pmatrix}_{son}.\] **Theorem 3.14**: _(Fuzzy Second Gordan's Theorem). Consider a fuzzy matrix \(\mathcal{M}=(m_{ij})_{son}\). Then, just a conclusion of the below holds:_ 1. _there exists_ \(y=(y_{1},y_{2},\ldots,y_{s})^{\top}\in\mathbb{R}^{s}\) _makes_ \(\mathcal{M}^{\top}y<(\tilde{0},\tilde{0},\ldots,\tilde{0})_{n}^{\top}\)_;_ 2. _for all_ \(\varrho\in[0,1]\)_, there exists nonzero_ \(x=(x_{1},x_{2},\ldots,x_{n})^{\top}\in\mathbb{R}^{n}\) _with all_ \(x_{i}\geq 0\) _such that_ \((0,0,\ldots,0)_{n}^{\top}\in\mathcal{M}_{\varrho}x\) Proof.: Suppose (i) holds. On contrary, assume that (ii) also holds. As (i) holds, there exists \(y_{0}=(v_{1}^{0},v_{2}^{0},\ldots,v_{n}^{0})^{\top}\in\mathbb{R}^{s}\) such that \(\mathcal{M}^{\top}y_{0}<(\vec{0},\vec{0},\ldots,\vec{0})_{n}^{\top}\). Then, for all \(\varrho\in[0,1]\), \[\mathcal{M}_{\varrho}^{\top}y_{0}<_{LU}([0,0],[0,0],\ldots,[0,0])_{n}^{\top}.\] For all nonzero \(x=(x_{1},x_{2},\ldots,x_{n})^{\top}\in\mathbb{R}^{n},x_{i}\geq 0\), we have \[x^{\top}(\mathcal{M}_{\varrho}^{\top}y_{0})<_{LU}([0,0]\Longrightarrow(x \mathcal{M}_{\varrho})^{\top}y_{0}<_{LU}[0,0]. \tag{3.7}\] As (ii) is also true, there exists a nonzero \(x_{0}=(x_{1}^{0},x_{2}^{0},\ldots,x_{n}^{0})^{\top}\in\mathbb{R}^{n}\), \(x_{j}^{0}\geq 0\) such that \[(0,0,\ldots,0)_{s}^{\top}\in\mathcal{M}_{\varrho}x_{0}.\] For any given \(\varrho\in[0,1]\), let \(w=\mathcal{M}_{\varrho}x_{0}=(w_{1},w_{2},\ldots,w_{s})^{\top}\). Then, \(0\in w_{j}\) for all \(j=1,2,\ldots,s\), and \[(\mathcal{M}_{\varrho}x_{0})^{\top}y_{0}=\sum_{j=1}^{s}y_{j}^{0}w_{j}.\] Thus, \[0\in(\mathcal{M}_{\varrho}x_{0})^{\top}y_{0}. \tag{3.8}\] Since (3.7) and (3.8) cannot hold simultaneously, a contradiction is obtained. The other cases are proved below, suppose that (ii) holds, and (i) is false. From (i) is false knows that there no \(y\in\mathbb{R}^{s}\) makes \(\mathcal{M}^{\top}y<(\vec{0},\vec{0},\ldots,\vec{0})_{n}^{\top}\). That is, \[\mathcal{M}_{\varrho}^{\top}y<_{LU}([0,0],[0,0],\ldots,[0,0])_{n}^{\top}\text { for all }\varrho\in[0,1]. \tag{3.9}\] On contrary, assume that (ii) is false. Then, for any nonzero \(x=(x_{1},x_{2},\ldots,x_{n})^{\top}\in\mathbb{R}^{n}\) with every \(x_{j}\geq 0\) and for some \(\varrho\in[0,1]\), \[(0,0,\ldots,0)_{s}^{\top}\neq\mathcal{M}_{\varrho}x,\] or, \(\exists\,j\in\{1,\ldots,s\}\) so that \(0\notin w_{j}\), or, \(\exists\,j\in\{1,\ldots,s\}\) so that \([0,0]<_{LU}w_{j}\) or \(w_{j}<_{LU}[0,0]\), where \(\mathcal{M}_{\varrho}x=(w_{1},w_{2},\ldots,w_{s})^{\top}\). Let \[P=\{j:0\in w_{j},j\in\{1,\ldots,s\}\}\] and \[Q=\{j:0\notin w_{j},j\in\{1,\ldots,s\}\}.\] Obviously, \(Q\neq\emptyset\), \(P\cup Q=\{1,\ldots,s\}\) and \(P\cap Q=\emptyset\). Build a vector \(y_{0}=(y_{1}^{0},y_{2}^{0},\ldots,y_{s}^{0})^{\top}\) through \[y_{j}^{0}=\begin{cases}0,&\text{ if }j\in P,\\ 1,&\text{ if }j\in Q\text{ and }w_{j}<_{LU}[0,0],\\ -1,&\text{ if }j\in Q\text{ and }[0,0]<_{LU}w_{j}.\end{cases}\] Then \[\sum_{j\in Q}y_{j}^{0}w_{j}+\sum_{j\in P}y_{j}^{0}w_{j}<_{LU}[0,0],\] \[\text{or, }y_{0}^{\top}\mathcal{M}_{\varrho}<_{LU}[0,0].\] So, for any nonzero \(x=(x_{1},x_{2},\ldots,x_{n})^{\top}\in\mathbb{R}^{n}\) with every \(x_{j}\geq 0\), we get \[y_{0}^{\top}(\mathcal{M}_{\varrho}x) <_{LU}[0,0], \tag{3.10}\] \[\text{or, }x^{\top}(\mathcal{M}_{\varrho}y_{0}) <_{LU}[0,0].\] The inequality (3.10) can be true only when \(\mathcal{M}_{\varrho}^{\top}y_{0}<_{LU}([0,0],[0,0],\ldots,[0,0])_{n}^{\top}\). As (3.9) and (3.10) are contradictory, we get the desired conclusion. **Theorem 3.15** (_Fuzzy Fritz-John necessary condition_).: Suppose \(\mathcal{H}\) and \(\mathcal{Y}_{j}:\mathbb{T}\to\mathcal{F}_{C}\) for \(j=1,2,\ldots,s\) be fuzzy functions. Let \(x^{*}\) is a local optimal point of (FOP) and define \(\Lambda(x^{*})=\{j:\mathcal{Y}_{j}(x^{*})=\emptyset\}\). If \(\mathcal{H}\) and \(\mathcal{Y}_{j}\) (\(j\in\Lambda(x^{*})\)) are \(gH\)-differentiable and \(\mathcal{Y}_{j}\) (\(j\notin\Lambda(x^{*})\)) be continuous at \(x^{*}\), then there have \(\kappa_{0},\kappa_{j}\in\mathbb{R}\), \(j\in\Lambda(x^{*})\) makes \[\begin{cases}(0,0,\ldots,0)_{n}^{\top}\in(\kappa_{0}\nabla\mathcal{H}_{\varrho}( x^{*})+\sum_{j\in\Lambda(x^{*})}\kappa_{j}\nabla\mathcal{Y}_{j_{\varrho}}(x^{*}))\\ \quad\text{ for all }\varrho\in[0,1],\\ \kappa_{0}\geq 0,\kappa_{j}\geq 0,\ j\in\Lambda(x^{*}),\\ (\kappa_{0},\kappa_{\Lambda})\neq(0,0^{\Lambda(x^{*})}),\end{cases}\] _where \(\kappa_{\Lambda}\) denotes a vector and its components are \(\kappa_{j},\ j\in\Lambda(x^{*})\)._ _Also, if \(\mathcal{Y}_{j}\) (\(j\notin\Lambda(x^{*})\)) be also \(gH\)-differentiable at \(x^{*}\), then there are \(\kappa_{0},\kappa_{1},\ldots,\kappa_{s}\) that makes_ \[\begin{cases}(0,0,\ldots,0)_{n}^{\top}\in(\kappa_{0}\nabla\mathcal{H}_{\varrho}( x^{*})+\sum_{j=1}^{s}\kappa_{j}\nabla\mathcal{Y}_{j_{\varrho}}(x^{*}))\\ \quad\text{ for all }\varrho\in[0,1],\\ \kappa_{0}\beta_{j}(x^{*})=0,j=1,2,\ldots,s,\\ \kappa_{0}\geq 0,\kappa_{j}\geq 0,j=1,2,\ldots,s,\\ (\kappa_{0},\kappa)\neq(0,0^{\Lambda(x^{*})}).\end{cases}\] Proof.: Since \(x^{*}\) be local optimal point of (FOP), from Theorem 3.12, we know that \(\mathcal{\bar{H}}(x^{*})\cap\mathcal{\bar{Y}}(x^{*})=\emptyset\). Then, there no \(\tau\in\mathbb{R}^{n}\) that makes \[\tau^{\top}\nabla\mathcal{H}(x^{*})<\vec{0}\text{ and }\tau^{\top}\nabla\mathcal{Y}_{j}(x^{*})< \vec{0},\forall j\in\Lambda(x^{*}). \tag{3.11}\] Set \(\mathcal{M}\) be a matrix with column \(\nabla\mathcal{H}(x^{*})\) and \(\nabla\mathcal{Y}_{j}(x^{*}),j\in\Lambda(x^{*})\), i.e., \[\mathcal{M}=[\nabla\mathcal{H}(x^{*}),\ [\nabla\mathcal{Y}_{j}(x^{*})]_{j\in\Lambda(x^{*}) }]_{\text{loc}([+\Lambda(x^{*})])}.\] It can be obtained from (3.11) that \[\mathcal{M}^{\top}\tau<(\vec{0},\vec{0},\ldots,\vec{0})_{1+|\Lambda(x^{*})|}^{\top} \text{ for no }\tau\in\mathbb{R}^{n}. \tag{3.12}\] So, we know from Theorem 3.14, there is a nonzero \(\eta=(\eta_{j})_{\Lambda(x^{*})+|\mathbb{N}|}\in\mathbb{R}^{|\Lambda(x^{*})|}, \eta_{j}\geq 0\text{ makes }(0,0,\ldots,0)_{n}^{\top}\in\mathcal{M}_{\varrho}\eta\) for all \(\varrho\in[0,1]\). Let \[\eta=[\kappa_{0},\kappa_{j}]_{j\in\Lambda(x^{*})}^{\top}. \tag{3.13}\] Substituting (3.13) in \((0,0,\ldots,0)_{n}^{\top}\in\mathcal{M}_{\varrho}\eta\), we get \[\begin{cases}(0,0,\ldots,0)_{n}^{\top}\in(\kappa_{0}\nabla\mathcal{H}_{\ Thus the first part of Theorem 3.15 is proved. Since \(\mathcal{Y}_{j}(x^{*})=0,j\in\Lambda(x^{*})\), we get \(\kappa_{j}\mathcal{Y}_{j}(x^{*})=0\). If \(\mathcal{Y}_{j}\) (\(j\notin\Lambda(x^{*})\)) be gH-differentiable at \(x^{*}\), let \(\kappa_{j}=0\) (\(j\notin\Lambda(x^{*})\)), we get the second part of Theorem 3.15. \(\Box\) **Example 3.16**: _Consider the FOP:_ \[\min \mathcal{H}(x)=\langle-2,-1,1\rangle x^{2}+\langle-8,-4,3\rangle x +\langle 1,2,4\rangle,\] \[subject to \mathcal{Y}_{1}(x)=\langle-4,5,7\rangle x\oplus_{gH}\langle-8,10, 14\rangle\leq \bar{0},\] \[\mathcal{Y}_{2}(x)=\langle-3,-2,0\rangle x\oplus_{gH}\langle 2,3,6 \rangle\leq\bar{0}.\] _Obviously, \(\mathcal{H},\mathcal{Y}_{1}\) and \(\mathcal{Y}_{2}\) are gH-differentiable on \((0,+\infty)\). The image of the objective function \(\mathcal{H}\) is shown in Figure 1. At the feasible point \(x^{*}=2\), we have_ \[\mathcal{Y}_{1}(2)=\bar{0}\text{ and }\mathcal{Y}_{2}(2)=\langle-8,-7,-6\rangle.\] _Hence, \(\Lambda(x^{*})=\{1\}\), and we get_ \[\nabla\mathcal{H}_{\varrho}(2)=[-16+8\varrho,7-15\varrho],\] \[\nabla\mathcal{Y}_{1\varrho}(2)=[-4+9\varrho,7-2\varrho].\] _Taking \(\kappa_{0}=5,\kappa_{1}=8\) and \(\kappa_{2}=0\), the conclusion of Theorem 3.15 is true._ **Definition 3.17**: _The set of n fuzzy vectors \(\{\mathcal{U}_{1},\mathcal{U}_{2},\ldots,\mathcal{U}_{n}\}\) is said to be linearly independent if for \(\varrho_{1},\vartheta_{2},\ldots,\vartheta_{n}\in\mathbb{R}\), \((0,0,\ldots,0)_{n}^{*}\in\varrho_{1}\mathcal{U}_{1\varrho}+\theta_{2}\mathcal{ U}_{2\varrho}+\ldots+\theta_{n}\mathcal{U}_{n}\) holds for all \(\varrho\in[0,1]\) if and only if \(\theta_{1}=\vartheta_{2}=\ldots=\vartheta_{n}=0\)._ **Theorem 3.18**: _(Fuzzy KKT necessary condition). Let \(\mathcal{H},\mathcal{Y}_{j}:\mathbb{T}\rightarrow\mathcal{T}_{C},j=1,2,\ldots,s\), be fuzzy functions on the open set \(\mathbb{T}\) and \(x^{*}\) is a local optimal solution and define \(\Lambda(x^{*})=\{j:\mathcal{Y}_{j}(x^{*})=\bar{0}\}\). Assume that \(\mathcal{H}\) and \(\mathcal{Y}_{j}\) (\(j\in\Lambda(x^{*})\)) are gH-differentiable and \(\mathcal{Y}_{j}\) (\(j\notin\Lambda(x^{*})\)) be continuous at \(x^{*}\). If the set of fuzzy vectors \(\{\nabla\mathcal{Y}_{j}(x^{*}):j\in\Lambda(x^{*})\}\) is linearly independent, then there have \(\kappa_{j}\in\mathbb{R}\), \(j\in\Lambda(x^{*})\) makes_ \[\left\{\begin{array}{c}(0,0,\ldots,0)_{n}^{\top}\in(\nabla\mathcal{H}_{ \varrho}(x^{*})+\sum_{j\in\Lambda(x^{*})}\kappa_{j}\nabla\mathcal{Y}_{j\varrho }(x^{*}))\\ \text{ for all }\varrho\in[0,1],\\ \kappa_{j}\geq 0\text{ for }j\in\Lambda(x^{*}).\end{array}\right.\] _If \(\mathcal{Y}_{j}\) is also gH-differentiable at \(x^{*}\) for \(j\notin I(x^{*})\), then there are \(\kappa_{1},\kappa_{2},\ldots,\kappa_{s}\) so that_ \[\left\{\begin{array}{c}(0,0,\ldots,0)_{n}^{\top}\in(\nabla\mathcal{H}_{ \varrho}(x^{*})+\sum_{j=1}^{s}\kappa_{j}\nabla\mathcal{Y}_{j\varrho}(x^{*})) \\ \text{ for all }\varrho\in[0,1],\\ \kappa_{j}\mathcal{Y}_{j}(x^{*})=\bar{0},j=1,2,\ldots,s,\\ \kappa_{j}\geq 0\text{ for }j=1,2,\ldots,s.\end{array}\right.\] _Proof_ By Theorem 3.15, there have \(\kappa_{0},\kappa_{j}^{*}\in\mathbb{R}\) for all \(j\in\Lambda(x^{*})\) not all zeros such that \[\left\{\begin{array}{c}(0,0,\ldots,0)_{n}^{\top}\in(\kappa_{0}\nabla \mathcal{H}_{\varrho}(x^{*})+\sum_{j=1}^{s}\kappa_{j}\nabla\mathcal{Y}_{j \varrho}(x^{*}))\text{ for all }\varrho\in[0,1],\\ \kappa_{0}\geq 0,\kappa_{j}^{*}\geq 0,\ j\in\Lambda(x^{*}).\end{array}\right.\] There must be \(\kappa_{0}>0\), otherwise \(\{\nabla\mathcal{Y}_{j}(x^{*}):j\in\Lambda(x^{*})\}\) is not linearly independent. Consider \(\kappa_{j}=\frac{\kappa_{j}^{*}}{\omega_{0}}\). Then, \(\kappa_{j}\geq 0\), \(j\in\Lambda(x^{*})\) and \[(0,0,\ldots,0)_{n}^{\top}\in(\nabla\mathcal{H}_{\varrho}(x)+\sum_{j\in\Lambda(x^ {*})}\kappa_{j}\nabla\mathcal{Y}_{j\varrho}(x^{*}))\text{ for every }\varrho\in[0,1].\] Since \(\mathcal{Y}_{j}(x^{*})=\bar{0},j\in\Lambda(x^{*})\), then \(\kappa_{j}\mathcal{Y}_{j\varrho}(x^{*})=\bar{0}\) for each \(\varrho\in[0,1]\). If \(\mathcal{Y}_{j}\) (\(j\notin\Lambda(x^{*})\)) is gH-differentiable at \(x^{*}\), let \(\kappa_{j}=0\), \(j\notin\Lambda(x^{*})\), the desired conclusion is obtained. \(\Box\) **Example 3.19**: _Consider the FOP:_ \[\min \mathcal{H}(x_{1},x_{2})= \langle-4,-2,0\rangle x_{1}^{2}+\langle 1,2,3\rangle x_{2}+\langle-2,0,5 \rangle x_{2}^{2}\] \[+\langle 3,5,6\rangle x_{1}^{2}x_{2},\] _subject to_ \[\mathcal{Y}_{1}(x_{1},x_{2})= \langle-2,0,3\rangle x_{1}+\langle-6,5,-3\rangle x_{2}\] \[\oplus_{gH}(-12,-10,-6)\leq\bar{0},\] \[\mathcal{Y}_{2}(x_{1},x_{2})= \langle 3,5,6\rangle x_{1}+\langle-8,-7,-5\rangle x_{2}\] \[\oplus_{gH}(-2,-1,0)\leq\bar{0}.\] _Obviously, \(\mathcal{H},\mathcal{Y}_{1}\) and \(\mathcal{Y}_{2}\) are gH-differentiable on \(\mathbb{R}^{2}\), \(x^{*}=(0,2)\in\mathcal{O}\) and_ \[\mathcal{Y}_{1}(x^{*})=\bar{0}\text{ and }\mathcal{Y}_{2}(x^{*})=\langle-14,-13,-10\rangle.\] _So, \(\Lambda(x^{*})=\{1\}\), and we get_ \[\nabla\mathcal{H}_{\varrho}(x^{*}) = (D_{1}\mathcal{H}_{\varrho}(x^{*}),D_{2}\mathcal{H}_{\varrho}(x^{*}) )^{\top}\] \[= (0,0],[-7+\vartheta_{2},23-21\varrho])^{\top},\] \[\nabla\mathcal{Y}_{1\varrho}(x^{*}) = (D_{1}\mathcal{Y}_{1\varrho}(x^{*}),D_{2}\mathcal{Y}_{1\varrho}(x^{ *}))^{\top}\] \[= ([-2+2\varrho_{2},3-3\varrho],[-6+\varrho,-3-2\varrho])^{\top}.\] _Taking \(\kappa_{0}=2.5,\kappa_{1}=1\) and \(\kappa_{2}=0\), we get the result of Theorem 3.15. Taking \(\kappa_{0}=1,\kappa_{1}=0.4\) and \(\kappa_{2}=0\), the result of Theorem 3.18 is obtained._ **Theorem 3.20**: _(Fuzzy KKT sufficient condition). Let \(\mathcal{H}:\mathbb{T}\rightarrow\mathcal{T}_{C}\) and \(\mathcal{Y}_{j}:\mathbb{T}\rightarrow\mathcal{T}_{C}\), \(j=1,2,\ldots,s\), be gH-differentiable convex fuzzy functions on the open set \(\mathbb{T}\). If there exist \(\kappa_{1},\kappa_{2},\ldots,\kappa_{s}\in\mathbb{R}\) and \(x^{*}\in\mathcal{O}\) such that_ \[\left\{\begin{array}{c}(0,0,\ldots,0)_{n}^{\top}\in(\nabla\mathcal{H}_{ \varrho}(x^{*})+\sum_{j=1}^{s}\kappa_{j}\nabla\mathcal{Y}_{j\varrho}(x^{*})) \text{ for all _Proof_ Since \((0,0,\ldots,0)_{n}^{\top}\in(\nabla\mathcal{H}_{\varrho}(x^{*})+\sum_{j=1}^{s} \kappa_{j}\nabla\mathcal{Y}_{j_{\varrho}}(x^{*}))\) for all \(\varrho\in[0,1]\). Then, for any \(x\in\mathbb{T}\), \[0\in(\nabla\mathcal{H}_{\varrho}(x^{*})+\sum_{j=1}^{s}\kappa_{j}\nabla \mathcal{Y}_{j_{\varrho}}(x^{*}))^{\top}(x-x^{*}).\] From \(\mathcal{H}\) and \(\mathcal{Y}_{j},j=1,2,\ldots,s\), are gH-differentiable and convex knows that \[(\nabla\mathcal{H}_{\varrho}(x^{*})+\sum_{j=1}^{s}\kappa_{j} \nabla\mathcal{Y}_{j_{\varrho}}(x^{*}))^{\top}(x-x^{*})\] \[=\nabla\mathcal{H}_{\varrho}(x^{*})^{\top}(x-x^{*})+\sum_{j=1}^{ s}\kappa_{j}\nabla\mathcal{Y}_{j_{\varrho}}(x^{*})^{\top}(x-x^{*})\] \[\leq_{LU}(\mathcal{H}_{\varrho}(x)\,\mathfrak{c}_{\text{gH}} \,\mathcal{H}_{\varrho}(x^{*}))+\sum_{j=1}^{s}\kappa_{j}(\mathcal{Y}_{j_{ \varrho}}(x)\,\mathfrak{c}_{\text{gH}}\,\mathcal{Y}_{j_{\varrho}}(x^{*}))\] \[\leq_{LU}(\mathcal{H}_{\varrho}(x)\,\mathfrak{c}_{\text{gH}}\, \mathcal{H}_{\varrho}(x^{*})).\] Therefore, either \([0,0]\leq_{LU}\mathcal{H}_{\varrho}(x)\mathfrak{c}_{\text{gH}}\mathcal{H}_{ \varrho}(x^{*})\) or \(0\in(\mathcal{H}_{\varrho}(x)\mathfrak{c}_{\text{gH}}\,\mathcal{H}_{\varrho}(x ^{*}))\) for each \(\varrho\in[0,1]\). In any situation, \(x^{*}\) be an optimal solution of (FOP). Thus, the conclusion follows. \(\Box\) ## 4 Application to classification of fuzzy data Consider data set: \(\mathbb{D}=\{(x_{i},y_{i}):x_{i}\in\mathbb{R}^{n},y_{i}\in\{-1,1\},i=1,2,\ldots,s\}\) and SVMs is an effective method to classify this data set, primarily using the following optimization model: \[\begin{cases}\min&H(\lambda,\ell)=\frac{1}{2}\|\lambda\|^{2},\\ \text{subject to}&y_{i}(\lambda^{\top}x_{i}-\ell)\geq 1,\;i=1,2,\ldots,s, \end{cases} \tag{4.1}\] here \(\lambda=(\lambda_{1},\lambda_{2},\ldots,\lambda_{s})^{\top}\in\mathbb{R}^{n}\) and \(\ell\in\mathbb{R}\) represents normal vector and bias respectively. The constraint \(y_{i}(\lambda^{\top}x_{i}-\ell)\geq 1\) indicates the condition on which side of the separating hyperplane \(\lambda^{\top}x_{i}-\ell=\pm 1\) the data point lies. Data in practical problems are often accompanied by uncertainty. For example, to determine whether it will rain next weekend, we will look at the temperature, humidity and wind speed, and get the result that the temperature is about 33\({}^{\circ}\)C, the humidity is about 45%, and the wind speed is about 12 km/hr. For such data, people tend to estimate and truncate to get an accurate value, and with the accumulation of truncation error and rounding error, this may lead to deviations from the actual results or even the exact opposite. Fuzzy numbers are an effective tool for solving such uncertain data, and their application has gained a great deal of interest from researchers in recent years. Therefore, our next main objective is to investigate the problem of how fuzzy number data can be classified. Clearly, model (4.1) is not suitable for this kind of data because these are fuzzy data. Therefore, we modify the traditional SVM problem for fuzzy data set \[\{(\mathcal{U}_{i},y_{i}):\mathcal{U}_{i}\in\mathcal{F}_{C}^{n},y_{i}\in\{-1,1\},i=1,2,\ldots,s\}\] through \[\begin{cases}\min&\mathcal{H}(\lambda,\ell)=\frac{1}{2}\|\lambda\|^{2},\\ \text{subject to}&\mathcal{Y}_{i}(\lambda,\ell)=\overline{1}\in\mathfrak{c}_{ \text{gH}}\,y_{i}(\lambda^{\top}\mathcal{U}_{i}\,\mathfrak{c}_{\text{gH}}\, \ell)\leq \overline{0},\\ &i=1,2,\ldots,s,\end{cases} \tag{4.2}\] here we assume that components of \(\mathcal{U}_{i}\)'s are fuzzy numbers, and the data set consisting the core points of the fuzzy data is linearly separable. We note that the gradients of the functions \(\mathcal{H}\) and \(\mathcal{Y}_{i}\) in (4.2) are \[\nabla\mathcal{H}(\lambda,\ell) =(D_{1}\mathcal{H}(\lambda,\ell),D_{2}\mathcal{H}(\lambda,\ell))^ {\top}=(\lambda,\bar{0})^{\top},\] \[\nabla\mathcal{Y}_{i}(\lambda,\ell) =(D_{1}\mathcal{Y}_{i}(\lambda,\ell),D_{2}\mathcal{Y}_{i}(\lambda, \ell))^{\top}=(-y_{i}\mathcal{U}_{i},-y_{i})^{\top},\] for all \(i=1,2,\ldots,s\), where \(D_{1}\) and \(D_{2}\) represent the gH-partial derivatives of \(\lambda\) and \(\ell\), respectively. By Theorem 3.18, for an optimal solution \((\lambda^{*},\ell^{*})\) of (4.2) there are \(\kappa_{1},\kappa_{2},\ldots,\kappa_{s}\in\mathbb{R}\) and \(\kappa_{1},\kappa_{2},\ldots,\kappa_{s}\geq 0\) that make \[(0,0,\ldots,0)_{n+1}^{\top}\in((\lambda^{*},0)^{\top}+\sum_{i=1}^{s}\kappa_{i}(-y _{i}\mathcal{U}_{i_{\varrho}}-y_{i})^{\top})\text{ for all }\varrho\in[0,1], \tag{4.3}\] and \[\bar{0}=\kappa_{\lambda}\mathcal{Y}_{i}(\lambda^{*},\ell^{*}),i=1,2,\ldots,s. \tag{4.4}\] (4.3) may be split into \[(0,0,\ldots,0)_{n}^{\top}\in(\lambda^{*}+\sum_{i=1}^{m}(-\kappa_{j}y_{i}) \mathcal{U}_{i_{\varrho}})\text{ for all }\varrho\in[0,1],\] and \[\sum_{i=1}^{s}\kappa_{j}y_{i}=0.\] As follows from Theorems 3.18 and 3.20, we obtain that the set of conditions for the optimal solution of (4.2) are \[\left\{\begin{array}{l}(0,0,\ldots,0)_{n}^{\top}\in(\lambda^{*}+\sum_{i=1}^{s} (-\kappa_{j}y_{i})\mathcal{U}_{i_{\varrho}})\text{ for all }\varrho\in[0,1],\\ \sum_{i=1}^{s}\kappa_{j}y_{i}=0,\\ \kappa_{i}\mathcal{Y}_{i}(\lambda^{*},\ell^{*})=\bar{0},i=1,2,\ldots,s.\end{array}\right. \tag{4.5}\] The data points \(\mathcal{U}_{i}\) with \(\kappa_{i}\neq 0\) are known as fuzzy support vectors. It can be observed from (4.4) for every \(\kappa_{i}>0\), we can get \(\mathcal{Y}_{i}(\lambda^{*},\ell^{*})=\bar{0}\). Notice that for each \(i\) and a given \(\lambda^{*}\), we can get a \(\ell_{i}\) from \(\mathcal{Y}_{i}(\lambda,\ell)=\bar{0}\), and we consider \[\ell^{*}=\bigwedge_{i\neq k,\lambda>0}\ell_{i} \tag{4.6}\] as the bias corresponding to a given \(\lambda^{*}\). We employ here the intersection operator " \(\bigwedge\)" because \(\varrho^{*}\) must be satisfied with \(\mathcal{Y}_{i}(\lambda^{*},\ell^{*})=\bar{0}\) for every \(i\)'s with \(k_{i}>0\). Note that as each \(\ell_{i}\in\mathcal{F}_{C}\), then \(\ell^{*}\in\mathcal{F}_{C}\). As the core points of the fuzzy data are assumed to be linearly separable, the core of \(\ell^{*}\) is nonempty. Since each component of \(\mathcal{U}_{i}\in\mathcal{F}_{C}^{\infty},i=1,2,\ldots,s\), geometrically we get a fuzzy point with rectangular base corresponding to each \(\mathcal{U}_{i}\). In the top left corner of Figure 2, a fuzzy point on the \(\mathbb{R}^{2}\) plane corresponding to an \(\mathcal{U}_{i}=(\mathcal{U}_{i}^{\mathbb{I}},\mathcal{U}_{i}^{\mathbb{I}})\) with two components is drawn. For a given \(\lambda^{*}\in\mathbb{R}\) and a fuzzy bias \(\ell^{*}\) with nonempty core, we get a symmetric fuzzy line/plane \(L_{\lambda^{*}\ell^{*}}\): this symmetric fuzzy line/plane \(L_{\lambda^{*}\ell^{*}}\) is the union of all parallel lines/planes \(\lambda^{\tau\top}x-\ell_{\varrho}=0\), where \(\ell_{\varrho}\in\ell^{*}\) is a number in the support of \(\ell^{*}\) with membership value \(\varrho\). As \((\lambda^{*},\ell^{*})\) is an optimal solution to (4.2), we call an \(L_{\lambda^{*}\!C}\) as an optimal hyperplane to classify the given fuzzy data set. In Figure 2, a possible optimal hyperplane \(L_{\lambda^{*}\!C^{*}}\) to classify the given fuzzy data set of blue-colored fuzzy points with class \(y_{i}=-1\) and red-colored fuzzy points with class \(y_{i}=1\). The main procedure to effectively classify fuzzy datasets according to the fuzzy Fritz-John optimality theorem are as follows. 1. Construct mathematical formula for fuzzy optimization problem (4.2); 2. Using Theorem 3.15, obtain the fuzzy Fritz-John optimality condition (4.5); 3. Substitute the fuzzy data into the first equation in (4.5) to get the value of \(\lambda^{*}\); 4. Take \(\lambda_{i}\in\lambda^{*}\), substitute into the third equation in (4.5), and get the value of \(\ell_{i}\); 5. Take \(\ell_{i}\) to the formula (4.6) and get the value of \(\ell^{*}\); 6. Get the hyperplane \(L_{\lambda^{*}\!C^{*}}=\lambda^{\tau\!}\mathcal{U}_{i}\oplus_{\sharp\ell} \ell^{*}\) to see if the data set can be effectively classified, if not, go back to Step 4 and re-take \(\lambda_{i}\) to solve the hyperplane; If yes, the optimal result is output. **Example 4.1**: _Consider the fuzzy data set_ \[\mathcal{U}_{1} =[\{2,5,6\},\langle 1,2,3\rangle],y_{1}=1,\] \[\mathcal{U}_{2} =[\{3,6,7\},\langle 1,3,5\rangle],y_{2}=1,\] \[\mathcal{U}_{3} =[\{4,7,8\},\langle 1,2,3\rangle],y_{3}=1,\] \[\mathcal{U}_{4} =[\{0,1,2\},\langle 1,3,5\rangle],y_{4}=-1,\] \[\mathcal{U}_{5} =[\{1,2,3\},\langle 1,3,5\rangle],y_{5}=-1,\] \[\mathcal{U}_{6} =[\{0,2,3\},\langle 2,5,6\rangle],y_{6}=-1.\] _We will utilize the FOP SVM (4.2) to derive a classification hyperplane for the above data set, that is, we require discovering the possible solutions \((\lambda,\ell)\) of (4.5) in conjunction with the corresponding \(\kappa_{i}\)'s._ _We note that \(\sum_{i=1}^{6}\kappa_{i}y_{i}=0\) when \((\kappa_{1},\kappa_{2},\kappa_{3},\kappa_{4},\kappa_{5},\kappa_{6})=(1,0,0,0,1,0)\), and for all \(\varrho\in[0,1]\), the first condition in (4.5) simplifies to_ \[(0,0)^{\top}\in\lambda+(-1)\mathcal{U}_{1_{\varrho}}+\mathcal{U}_{5 \varrho}, \tag{4.7}\] \[\text{or, }\lambda\in(-1)(-1)\mathcal{U}_{1_{\varrho}}+ \mathcal{U}_{5\varrho}),\] \[\text{or, }\lambda\in(\{4\varrho-1,5-2\varrho\},[3\varrho-2,4-3 \varrho]).\] _Denote \(\lambda=(\lambda_{1},\lambda_{2})^{\top}\in\mathbb{R}^{2}\), the condition (4.7) is simplified as_ \[4\varrho-1\leq\lambda_{1}\leq 5-2\varrho\text{ and }3\varrho-2\leq\lambda_{2}\leq 4-3\varrho\text{ for all }\varrho\in[0,1].\] _Let we select \(\lambda_{1}^{*}=3\) and \(\lambda_{2}^{*}=1\), the third condition in (4.5) and (4.6) yields the set of probable values of the bias \(\ell\) as_ \[\bigwedge_{i\in\mathbb{N};0}\{\ell:\mathcal{Y}_{i}(\lambda,\ell)= \bar{0}\}\] \[= \{\ell\in\mathbb{R}:\mathcal{Y}_{1}(\lambda^{*},\ell)=\bar{0}\} \wedge[\ell\in\mathbb{R}:\mathcal{Y}_{5}(\lambda^{*},\ell)=\bar{0}]\] \[= \{\ell\in\mathbb{R}:\ell\in[6+10_{\varrho},20-4\varrho],\ \forall\varrho\in[0,1]\}\] \[\wedge\{\ell\in\mathbb{R}:\ell\in[5+5\varrho_{1},15-5\varrho],\ \forall\varrho\in[0,1]\}\] \[= \{\ell\in\mathbb{R}:\ell\in[6+10_{\varrho},15-5\varrho],\ \forall \varrho\in[0,\frac{9}{15}]\}.\] _Consequently, which corresponds with \(\lambda^{*}=(3,1)^{\top}\), the collection of classifying hyperplanes is governed from_ \[3\mathcal{U}_{1}+\mathcal{U}_{2}\oplus_{\sharp\ell}\ell=\bar{0},\ \ell\in\{\ell\in\mathbb{R}:\ell\in[6+10_{\varrho},15-5\varrho],\ \varrho\in[0,\frac{9}{15}]\}.\] _It is worth noting that the value of the objective function \(\mathcal{H}\) is equal to \(5\) regardless of the choice of \(\ell\) in \(\{\ell\in\mathbb{R}:\ell\in[6+10_{\varrho},15-5\varrho],\ \varrho\in[0,\frac{9}{15}]\}\)._ ## 5 Conclusions The major goal of this paper has been studying the optimality conditions for FOPs. Firstly, the descent direction cone of the fuzzy function has been defined, and we have used it to derive first-order optimality conditions with the help of cone of feasible directions. Furthermore, we have extended the Gordan's theorem for the systems of fuzzy inequalities and used it to derive the necessary optimality conditions of Fritz-John and KKT for FOPs. Finally, we have applied the results obtained in this paper to a simple linearly separable SVM problem of fuzzy data sets. In the following, we will proceed to study this kind of problem, hoping to apply it for nonlinear classification and SVM with soft margins. ## Acknowledgement The work as supported by the Postgraduate Research & Practice Innovation Program of Jiangsu Province (KYCX23,0668). D. Ghosh acknowledges financial support of the research grants MATRICS (MTR/2021/000696) and CRG (CRG/2022/ 001347) from SERB, India.

2307.00257

Efficient Subclass Segmentation in Medical Images

As research interests in medical image analysis become increasingly fine-grained, the cost for extensive annotation also rises. One feasible way to reduce the cost is to annotate with coarse-grained superclass labels while using limited fine-grained annotations as a complement. In this way, fine-grained data learning is assisted by ample coarse annotations. Recent studies in classification tasks have adopted this method to achieve satisfactory results. However, there is a lack of research on efficient learning of fine-grained subclasses in semantic segmentation tasks. In this paper, we propose a novel approach that leverages the hierarchical structure of categories to design network architecture. Meanwhile, a task-driven data generation method is presented to make it easier for the network to recognize different subclass categories. Specifically, we introduce a Prior Concatenation module that enhances confidence in subclass segmentation by concatenating predicted logits from the superclass classifier, a Separate Normalization module that stretches the intra-class distance within the same superclass to facilitate subclass segmentation, and a HierarchicalMix model that generates high-quality pseudo labels for unlabeled samples by fusing only similar superclass regions from labeled and unlabeled images. Our experiments on the BraTS2021 and ACDC datasets demonstrate that our approach achieves comparable accuracy to a model trained with full subclass annotations, with limited subclass annotations and sufficient superclass annotations. Our approach offers a promising solution for efficient fine-grained subclass segmentation in medical images. Our code is publicly available here.

Linrui Dai, Wenhui Lei, Xiaofan Zhang

2023-07-01T07:39:08Z

http://arxiv.org/abs/2307.00257v1

# Efficient Subclass Segmentation in Medical Images ###### Abstract As research interests in medical image analysis become increasingly fine-grained, the cost for extensive annotation also rises. One feasible way to reduce the cost is to annotate with coarse-grained super-class labels while using limited fine-grained annotations as a complement. In this way, fine-grained data learning is assisted by ample coarse annotations. Recent studies in classification tasks have adopted this method to achieve satisfactory results. However, there is a lack of research on efficient learning of fine-grained subclasses in semantic segmentation tasks. In this paper, we propose a novel approach that leverages the hierarchical structure of categories to design network architecture. Meanwhile, a task-driven data generation method is presented to make it easier for the network to recognize different subclass categories. Specifically, we introduce a Prior Concatenation module that enhances confidence in subclass segmentation by concatenating predicted logits from the superclass classifier, a Separate Normalization module that stretches the intra-class distance within the same superclass to facilitate subclass segmentation, and a HierarchicalMix model that generates high-quality pseudo labels for unlabeled samples by fusing only similar superclass regions from labeled and unlabeled images. Our experiments on the BraTS2021 and ACDC datasets demonstrate that our approach achieves comparable accuracy to a model trained with full subclass annotations, with limited subclass annotations and sufficient superclass annotations. Our approach offers a promising solution for efficient fine-grained subclass segmentation in medical images. Our code is publicly available here. Keywords:Automatic Segmentation Deep Learning. ## 1 Introduction In recent years, the use of deep learning for automatic medical image segmentation has led to many successful results based on large amounts of annotated training data. However, the trend towards segmenting medical images into finer-grained classes (denoted as \(subclasses\)) using deep neural networks has resulted in an increased demand for finely annotated training data [11, 21, 4]. This process requires a higher level of domain expertise, making it both time-consuming and demanding. As annotating coarse-grained (denoted as \(superclasses\)) classes is generally easier than subclasses, one way to reduce the annotation cost is to collect a large number of superclasses annotations and then labeling only a small number of samples in subclasses. Moreover, in some cases, a dataset may have already been annotated with superclass labels, but the research focus has shifted towards finer-grained categories [9, 24]. In such cases, re-annotating an entire dataset may not be as cost-effective as annotating only a small amount of data with subclass labels. Here, the primary challenge is to effectively leverage superclass annotations to facilitate the learning of fine-grained subclasses. To solve this problem, several works have proposed approaches for recognizing new subclasses with limited subclass annotations while utilizing the abundant superclass annotations in classification tasks [6, 8, 18, 25]. In general, they assume the subclasses are not known during the training stage and typically involve pre-training a base model on superclasses to automatically group samples of the same superclass into several clusters while adapting them to finer subclasses during test time. However, to the best of our knowledge, there has been no work specifically exploring learning subclasses with limited subclass and full superclass annotations in semantic segmentation task. Previous label-efficient learning methods, such as semi-supervised learning [7, 17, 26], few-shot learning [19, 10, 15] and weakly supervised learning [27, 13], focus on either utilize unlabeled data or enhance the model's generalization ability or use weaker annotations for training. However, they do not take into account the existence of superclasses annotations, making them less competitive in our setting. In this study, we focus on the problem of efficient subclass segmentation in medical images, whose goal is to segment subclasses under the supervision of limited subclass and sufficient superclass annotations. Unlike previous works such as [6, 8, 18, 25], we assume that the target subclasses and their corresponding limited annotations are available during the training process, which is more in line with practical medical scenarios. Our main approach is to utilize the hierarchical structure of categories to design network architectures and data generation methods that make it easier for the network to distinguish between subclass categories. Specifically, we propose 1) a **Prior Concatenation** module that concatenates predicted logits from the superclass classifier to the input feature map before subclass segmentation, serving as prior knowledge to enable the network to focus on recognizing subclass categories within the current predicted superclass; 2) a **Separate Normalization** module that aims to stretch the intra-class distance within the same superclass, facilitating subclass segmentation; 3) a **HierarchicalMix** module inspired by GuidedMix [23], which for the first time suggests fusing similar labeled and unlabeled image pairs to generate high-quality pseudo labels for the unlabeled samples. However, GuidedMix selects image pairs based on their similarity and fuses entire images. In contrast, our approach is more targeted. We mix a certain superclass region from an image with subclass annotation to the corresponding superclass region in an unlabeled image without subclass annotation, avoiding confusion between different superclass regions. This allows the model to focus on distinguishing subclasses within the same superclass. Our experiments on the Brats 2021 [3] and ACDC [5] datasets demonstrate that our model, with sufficient superclass and very limited subclass annotations, achieves comparable accuracy to a model trained with full subclass annotations. ## 2 Method #### 2.0.1 Problem Definition We start by considering a set of \(R\) coarse classes, denoted by \(\mathcal{Y}_{c}=\{Y_{1},...,Y_{R}\}\), such as background and brain tumor, and a set of \(N\) training images, annotated with \(\mathcal{Y}_{c}\), denoted by \(\mathcal{D}_{c}=\{(x^{l},y^{l})|y^{l}_{i}\in\mathcal{Y}_{c}\}_{l=1}^{N}\). Each pixel \(i\) in image \(x^{l}\) is assigned a superclass label \(y^{l}_{i}\). To learn a finer segmentation model, we introduce a set of fine subclass \(K=\sum_{i=1}^{R}k_{i}\) in coarse classes, denoted by \(\mathcal{Y}_{f}=\{Y_{1,1},...,Y_{1,k_{1}},...,Y_{R,1},...,\)\(Y_{R,k_{R}}\}\), such as background, enhancing tumor, tumor core, and whole tumor. We assume that only a small subset of \(n\) training images have pixel-wise subclass labels \(z\in\mathcal{Y}_{f}\) denoted by \(\mathcal{D}_{f}=\{(x^{l},z^{l})|z^{l}_{i}\in\mathcal{Y}_{f}\}_{l=1}^{n}\). Our goal is to train a segmentation network \(f(x^{l})\) that can accurately predict the subclass labels for each pixel in the image \(x^{l}\), even when \(n\ll N\). **Without specification, we consider \(R=2\) (background and foreground) and extend the foreground class to multi subclass in this work.** #### 2.0.2 Prior Concatenation One direct way to leverage the superclass and subclass annotations simultaneously is using two \(1\times 1\times 1\) convolution layers as superclass and subclass classification heads for the features extracted from the network. The superclassification and subclassification heads are individually trained by superclass \(P_{c}(x^{l})\) labels and subclass labels \(P_{f}(x^{l})\). With enough superclass labels, the Figure 1: Proposed network architecture, \(\mathcal{L}_{c}\) and \(\mathcal{L}_{f}\) stand for the superclass loss and subclass loss respectively. feature maps corresponding to different superclasses should be well separated. However, this coerces the subclassification head to discriminate among \(K\) subclasses under the mere guidance from few subclass annotations, making it prone to overfitting. Another common method to incorporate the information from superclass annotations into the subclassification head is negative learning [14]. This technique penalizes the prediction of pixels being in the wrong superclass label, effectively using the superclass labels as a guiding principle for the subclassification head. However, in our experiments, we found that this method may lead to lower overall performance, possibly due to unstable training gradients resulting from the uncertainty of the subclass labels. To make use of superclass labels without affecting the training of the subclass classification head, we propose a simple yet effective method called **Prior Concatenation (PC)**: as shown in Fig. 1 (a), we concatenate predicted superclass logit scores \(S_{c}(x^{l})\) onto the feature maps \(F(x^{l})\) and then perform subclass segmentation. The intuition behind this operation is that by concatenating the predicted superclass probabilities with feature maps, the network is able to leverage the prior knowledge of the superclass distribution and focus more on learning the fine-grained features for better discrimination among subclasses. #### 3.2.1 Separate Normalization Intuitively, given sufficient superclass labels in supervised learning, the superclassification head tends to reduce feature distance among samples within the same superclass, which conflicts with the goal of increasing the distance between subclasses within the same superclass. To alleviate this issue, we aim to enhance the internal diversity of the distribution within the same superclass while preserving the discriminative features among superclasses. To achieve this, we propose **Separate Normalization(SN)** to separately process feature maps belonging to hierarchical foreground and background divided by superclass labels. As a superclass and the subclasses within share the same background, the original conflict between classifiers is transferred to finding the optimal transformations that separate foreground from background, enabling the network to extract class-specific features while keeping the features inside different superclasses well-separated. Our framework is shown in Fig. 1 (b). First, we use Batch Norm layers [12] to perform separate affine transformations on the original feature map. The transformed feature maps, each representing a semantic foreground and background, are then passed through a convolution block for feature extraction before further classification. The classification process is coherent with the semantic meaning of each branch. Namely, the foreground branch includes a superclassifier and a subclassifier that classifies the superclass and subclass foreground, while the background branch is dedicated solely to classify background pixels. Finally, two separate network branches are jointly supervised by segmentation loss on super- and subclass labels. The aforementioned prior concatenation continues to take effect by concatenating predicted superclass logits on the inputs of subclassifier. #### 3.3.1 HierarchicalMix Given the scarcity of subclass labels, we intend to maximally exploit the existent subclass supervision to guide the segmentation of coarsely labeled samples. Inspired by GuidedMix [23], which provides consistent knowledge transfer between similar labeled and unlabeled images with pseudo labeling, we propose **HierarchicalMix(HM)** to generate robust pseudo supervision. Nevertheless, GuidedMix relies on image distance to select similar images and performs a whole-image mixup, which loses focus on the semantic meaning of each region within an image. We address this limitation by exploiting the additional superclass information for a more targeted mixup. This information allows us to fuse only the semantic foreground regions, realizing a more precise transfer of foreground knowledge. A detailed pipeline of HierarchicalMix is described below. As shown in Fig. 2, for each sample \((x,y)\) in the dataset that does not have subclass labels, we pair it with a randomly chosen fine-labeled sample \((x^{\prime},y^{\prime},z^{\prime})\). First, we perform an random rotation and flipping \(\mathbb{T}\) on \((x,y)\) and feed both the original sample and the transformed sample \(\mathbb{T}x\) into the segmentation network \(f\). An indirect segmentation of \(x\) is obtained by performing the inverse transformation \(\mathbb{T}^{-1}\) on the segmentation result of \(\mathbb{T}x\). A transform-invariant pseudo subclass label map \(z_{pse}\) is generated according to the following scheme: Pixel \((i,j)\) in \(z_{pse}\) is assigned a valid subclass label index \((z_{pse})_{i,j}=f(x)_{i,j}\) only when \(f(x)_{i,j}\) agrees with \([\mathbb{T}^{-1}f(\mathbb{T}x)]_{i,j}\) with a high confidence \(\tau\) as well as \(f(x)_{i,j}\) and \(x_{i,j}\) both belong to the same superclass label. Next, we adopt image mixup by cropping the bounding box of foreground pixels in \(x^{\prime}\), resizing it to match the size of foreground in \(x\), and linearly overlaying them by a factor of \(\alpha\) on \(x\). This semantically mixed image \(x_{mix}\) has subclass labels \(z=\text{resize}(\alpha\cdot z^{\prime})\) from the fine-labeled image \(x^{\prime}\). Then, we pass it through the network to obtain a segmentation result \(f(x_{mix})\). This segmentation result Figure 2: The framework of \(HierarchicalMix\). This process is adopted at training time to pair each coarsely labeled image \(x\) with its mixed image \(x_{mix}\) and pseudo subclass label \(z\). “\(/\)\(/\)” represents the cut of gradient backpropagation. is supervised by the superposition of the pseudo label map \(z_{pse}\) and subclass labels \(z\), with weighting factor \(\alpha\): \(\mathcal{L}_{p}=\mathcal{L}(f(x_{mix}),\alpha\cdot z+(1-\alpha)\cdot z_{pse})\). The intuition behind this framework is to simultaneously leverage the information from both unlabeled and labeled data by incorporating a more robust supervision from transform-invariant pseudo labels. While mixing up only the semantic foreground provides a way of exchanging knowledge between similar foreground objects while lifting the confirmation bias in pseudo labeling [1]. ## 3 Experiments #### 3.0.1 Dataset and preprocessing We conduct all experiments on two public datasets. The first one is the \(\mathbf{ACDC}^{*}\) dataset [5], which contains 200 MRI images with segmentation labels for left ventricle cavity (LV), right ventricle cavity (RV), and myocardium (MYO). Due to the large inter-slice spacing, we use 2D segmentation as in [2]. We adopt the processed data and the same data division in [16], which uses 140 scans for training, 20 scans for validation and 40 scans for evaluation. During inference, predictions are made on each individual slice and then assembled into a 3D volume. The second is the \(\mathbf{BraTS2021}\) dataset [3], which consists of 1251 mpMRI scans with an isotropic 1 mm\({}^{3}\) resolution. Each scan includes four modalities (FLAIR, T1, T1ce, and T2), and is annotated for necrotic tumor core (TC), peritumoral edematous/invaded tissue (PE), and the GD-enhancing tumor (ET). We randomly split the dataset into 876, 125, and 250 cases for training, validation, and testing, respectively. For both datasets, image intensities are normalized to values in [0, 1] and the foreground superclass is defined as the union of all foreground subclasses for both datasets. #### 3.0.2 Implementation details and evaluation metrics To augment the data during training, we randomly cropped the images with a patch size of \(256\times 256\) for the ACDC dataset and \(96\times 96\times 96\) for the BraTS2021 dataset. The model loss \(\mathcal{L}\) is set by adding the losses from Cross Entropy Loss and Dice Loss. We trained the model for 40,000 iterations using SGD optimizer with a 0.9 momentum and a linearly decreasing learning rate that starts at 0.01 and ends with 0. We used a batch size of 24 for the ACDC dataset and 4 for the BraTS2021 dataset, where half of the samples are labeled with subclasses and the other half only labeled with superclasses. More details can be found in the supplementary materials. To evaluate the segmentation performance, we used two widely-used metrics: the Dice coefficient (\(DSC\)) and 95% Hausdorff Distance (\(HD_{95}\)). The confidence factor \(\tau\) mentioned in HierarchicalMix starts at 1 and linearly decays to 0.4 throughout the training process, along with a weighting factor \(\alpha\) sampled according to the uniform distribution on \([0.5,1]\). #### 4.2.2 Performance comparison with other methods To evaluate the effectiveness of our proposed method, we firstly trained two **U-Net** models [20] to serve as upper and lower bounds of performance. The first U-Net was trained on the complete subclass dataset \(\{(x^{l},y^{l},z^{l})\}_{l=1}^{N}\), while the second was trained on its subset \(\{(x^{l},y^{l},z^{l})\}_{l=1}^{n}\). Then, we compared our method with the following four methods, all of which were trained using \(n\) subclass labels and \(N\) superclass labels: **Modified U-Net (Mod)**: This method adds an additional superclass classifier alongside the subclass classifier in the U-Net. **Negative Learning (NL)**: This method incorporates superclass information into the loss module by introducing a separate negative learning loss in the original U-Net. This additional loss penalizes pixels that are not segmented as the correct superclass. **Cross Pseudo Supervision (CPS)**[7]: This method simulates pseudo supervision by utilizing the segmentation results from two models with different parameter initializations, and adapts their original network to the Modified U-Net architecture. **Uncertainty Aware Mean Teacher (UAMT)**[26]: This method modifies the classical mean teacher architecture [22] by adapting the teacher model to learn from only reliable targets while ignoring the rest, and also adapts the original network to the Modified U-Net architecture. The quantitative results presented in Table 1 reveal that all methods that utilize additional superclass annotations outperformed the baseline method, which involved training a U-Net using only limited subclass labels. However, the methods that were specifically designed to utilize superclass information or explore the intrinsic structure of the subclass data, such as NL, CPS, and UAMT, did not consistently outperform the simple Modified U-Net. In fact, these methods sometimes performed worse than the simple Modified U-Net, indicating the difficulty of utilizing superclass information effectively. In contrast, our proposed method achieved the best performance among all compared methods on both the ACDC and BraTS2021 datasets. Specifically, our method attained an aver \begin{table} \begin{tabular}{c|c|c c c c c|c c c c c c} \hline \hline \multirow{2}{*}{**Method**} & \multicolumn{4}{c|}{**ACDC**} & \multicolumn{4}{c}{**BraTS2021**} \\ \cline{2-13} & Sup. & Sub. & RV & MYO & LV & Avg. & Sup. & Sub. & TC & PE & ET & Avg. \\ \hline U-Net & 0 & 3 & 36.6, 61.5 & 51.6, 20.7 & 57.9, 26.2 & 48.7, 36.2 & 0 & 10 & 57.5, 16.6 & 68.8, 22.9 & 74.7, 12.4 & 67.0, 17.3 \\ U-Net & 0 & 140 & 90.6, 18.8 & 89.0, 35.9 & 94.6, 36.0 & 914.4, 30.2 & 0 & 876 & 75.8, 4.86 & 82.2, 5.87 & 83.6, 24.8 & 80.6, 4.40 \\ \hline Mod & 140 & 3 & 83.1, 11.1 & 80.7, 6.1 & 83.1, 14.7 & 82.3, 10.6 & 876 & 10 & 60.3, 7.6 & 76.2, 7.0 & 80.2, 4.97 & 72.3, 6.79 \\ NL [14] & 140 & 3 & 61.0, 18.8 & 68.6, 13.7 & 81.5, 19.5 & 70.4, 17.3 & 876 & 10 & 59.5, 10.5 & 75.2, 8.35 & 76.8, 6.34 & 70.5, 8.40 \\ CPS [7] & 140 & 3 & 80.2, 9.54 & 80.3, 3.17 & 86.3, **4.21** & 82.3, 5.64 & 876 & 10 & 62.9, 7.02 & 78.3, 7.08 & 80.8, 4.91 & 74.0, 6.24 \\ UAMT [26] & 140 & 3 & 79.4, 7.81 & 77.7, 5.87 & 85.5, 8.16 & 80.9, 7.28 & 876 & 10 & 60.8, 9.84 & 78.4, 7.11 & 80.1, 4.24 & 73.3, 7.06 \\ Ours & 140 & 3 & **87.2**, **1.84** & **84.6**, **2.70** & **90.1**, 4.44 & **87.3**, **2.99** & 876 & 10 & **65.5**, **6.90** & **79.9**, **6.38** & **80.8**, **3.59** & **75.4**, **5.62** \\ \hline \hline \end{tabular} \end{table} Table 1: Mean Dice Score (%, left) and \(HD_{95}\) (mm, right) of different methods on ACDC and BraTS2021 datasets. Sup. and Sub. separately represents the number of data with superclass and subclass annotations in the experiments. ‘\({}_{-}\)’ means the result of our proposal is significantly better than the closet competitive result (p-value < 0.05). The standard deviations of each metric are recorded in the supplementary materials. age Dice score of 87.3% for ACDC and 75.4% for BraTS2021, outperforming the closest competitor by 5.0% and 1.4%, respectively. #### 3.3.3 Ablation studies In this study, we performed comprehensive ablation studies to analyze the contributions of each component and the performance of our method under different numbers of images with subclass annotations. The performance of each component is individually evaluated, and is listed in Table 2. Each component has demonstrated its effectiveness in comparison to the naive modified U-Net method. Moreover, models that incorporate more components generally outperform those with fewer components. The effectiveness of the proposed HierarchicalMix is evident from the comparisons made with models that use only image mixup or pseudo-labeling for data augmentation, while the addition of Separate Normalization consistently improves the model performance. Furthermore, our method was competitive with a fully supervised baseline, achieving comparable results with only 6.5% and 3.4% subclass annotations on ACDC and BraTS2021. ## 4 Conclusion In this work, we proposed an innovative approach to address the problem of efficient subclass segmentation in medical images, where limited subclass annotations and sufficient superclass annotations are available. To the best of our knowledge, this is the first work specifically focusing on this problem. Our approach leverages the hierarchical structure of categories to design network architectures and data generation methods that enable the network to distinguish between subclass categories more easily. Specifically, we introduced a Prior Concatenation module that enhances confidence in subclass segmentation by con \begin{table} \begin{tabular}{c c c|c|c c c c|c c c c c c} \hline \multirow{2}{*}{HM} & \multirow{2}{*}{PC SN} & \multicolumn{3}{c|}{**ACDC**} & \multicolumn{3}{c}{**BraTS2021**} \\ \cline{3-14} & & & Sup. Sub. & RV & MYO & LV & Avg. & Sup. Sub. & TC & PE & ET & Avg. \\ \hline \multirow{4}{*}{\(\check{\check{\check{\check{\chi}}}}\)} & & & 140 & 3 & 83.1, 11.1 & 80.7, 6.12 & 83.1, 14.7 & 82.3, 10.6 & 876 & 10 & 60.3, 7.69 & 76.2, 7.70 & 80.2, 4.97 & 72.3, 6.79 \\ & & & 140 & 3 & 85.9, 2.55 & 83.6, 3.70 & 89.8, 5.15 & 86.5, 3.80 & 876 & 10 & 65.0, 8.00 & 77.0, 7.47 & 80.6, 3.74 & 74.2, 6.40 \\ & & & 140 & 3 & 80.0, 8.06 & 80.4, 6.63 & 87.9, 5.07 & 82.8, 6.58 & 876 & 10 & 61.6, 7.00 & 77.3, 6.89 & 80.4, 6.01 & 73.1, 6.63 \\ & & & & 140 & 3 & 79.0, 3.32 & 81.2, 3.69 & 88.6, 4.43 & 82.9, 3.82 & 876 & 10 & 63.5, 9.03 & 78.9, 6.29 & 80.2, 4.45 & 74.2, 6.59 \\ \(\check{\check{\check{\chi}}}\) & & & 140 & 3 & 85.1, 1.86 & 81.4, 4.29 & 87.3, 5.55 & 84.6, 3.90 & 876 & 10 & 65.1, 7.93 & 78.4, 6.86 & 78.3, 3.97 & 73.9, 6.25 \\ & & & 140 & 3 & **87.6**, **8.2** & 88.3, 8.26 & 89.9, 2.87 & 87.1, **2.58** & 876 & 10 & 65.7, 7.56 & 79.6, 6.68 & 88.1, 4.25 & 75.5, 6.16 \\ & & & \(\check{\check{\check{\chi}}}\) & 140 & 3 & 84.7, 5.26 & 84.1, 2.53 & 89.3, **2.79** & 86.0, 3.53 & 876 & 10 & 64.4, 7.96 & 79.5, 6.41 & 79.5, 5.07 & 74.4, 6.48 \\ \(mixup\) & & & \(\check{\check{\check{\chi}}}\) & 140 & 3 & 82.9, 5.42 & 80.6, 4.18 & 86.8, 6.06 & 83.5, 5.22 & 876 & 10 & **66.2**, 6.90 & 79.6, 6.26 & 80.9, 4.19 & **75.6**, 5.79 \\ & & & \(\check{\check{\chi}}\) & 140 & 3 & 78.8, 12.2 & 80.1, 7.66 & 84.3, 7.71 & 81.1, 9.20 & 876 & 10 & 62.4, 11.1 & 77.9, 6.55 & 80.0, 7.09 & 73.5, 8.24 \\ & & & \(\check{\check{\chi}}\) & 140 & 3 & 87.2, **1.84** & **84.6**, 2.70** & **90.1**, 4.44** & **87.3**, 2.99 & 876 & 10 & 65.5, 6.90 & **79.9, 6.38** & 80.3, **3.59** & **75.4**, **5.62** \\ \hline \(\check{\check{\chi}}\) & & \(\check{\check{\chi}}\) & 140 & 6 & 86.6, 1.20 & 84.7, 1.87 & 90.9, 4.23 & 87.4, 2.44 & 876 & 20 & 70.7, 7.45 & 81.2, 6.08 & 82.2, 3.58 & 78.0, 5.70 \\ & & & \(\check{\check{\chi}}\) & 140 & 9 & 86.1, 1.78 & 85.7, 1.92 & 90.8, 4.15 & 87.6, 2.62 & 876 & 30 & 71.4, 6.15 & 81.4, 5.84 & 82.5, 3.25 & 78.5, 5.08 \\ \hline \multicolumn{14}{c}{UNet} & 0 & 140 & 90.6, 1.88 & 89.0, 3.59 & 94.6, 3.00 & 91.4, 3.02 & 0 & 876 & 75.8, 4.86 & 82.2, 5.87 & 83.6, 2.48 & 80.6, 4.40 \\ \hline \end{tabular} \end{table} Table 2: Mean Dice Score (%, left) and \(HD_{95}\) (mm, right) of ablation studies on ACDC and BraTS2021 datasets (\(mixup\) and \(pseudo\) in HM column separately stands for using solely image mixup and pseudo-labeling to achieve better data utilization). catenating predicted logits from the superclass classifier, a Separate Normalization module that stretches the intra-class distance within the same superclass to facilitate subclass segmentation, and a HierarchicalMix model that generates high-quality pseudo labels for unlabeled samples by fusing only similar superclass regions from labeled and unlabeled images. Our experiments on the ACDC and BraTS2021 datasets demonstrated that our proposed approach outperformed other compared methods in improving the segmentation accuracy. Overall, our proposed method provides a promising solution for efficient fine-grained subclass segmentation in medical images.

2305.02239

The Benefits of Label-Description Training for Zero-Shot Text Classification

Pretrained language models have improved zero-shot text classification by allowing the transfer of semantic knowledge from the training data in order to classify among specific label sets in downstream tasks. We propose a simple way to further improve zero-shot accuracies with minimal effort. We curate small finetuning datasets intended to describe the labels for a task. Unlike typical finetuning data, which has texts annotated with labels, our data simply describes the labels in language, e.g., using a few related terms, dictionary/encyclopedia entries, and short templates. Across a range of topic and sentiment datasets, our method is more accurate than zero-shot by 17-19% absolute. It is also more robust to choices required for zero-shot classification, such as patterns for prompting the model to classify and mappings from labels to tokens in the model's vocabulary. Furthermore, since our data merely describes the labels but does not use input texts, finetuning on it yields a model that performs strongly on multiple text domains for a given label set, even improving over few-shot out-of-domain classification in multiple settings.

Lingyu Gao, Debanjan Ghosh, Kevin Gimpel

2023-05-03T16:19:31Z

http://arxiv.org/abs/2305.02239v2

# The Benefits of Label-Description Training ###### Abstract Large language models have improved zero-shot text classification by allowing the transfer of semantic knowledge from the training data in order to classify among specific label sets in downstream tasks. We propose a simple way to further improve zero-shot accuracies with minimal effort. We curate small finetuning datasets intended to describe the labels for a task. Unlike typical finetuning data, which has texts annotated with labels, our data simply describes the labels in language, e.g., using a few related terms, dictionary/encyclopedia entries, and short templates. Across a range of topic and sentiment datasets, our method is more accurate than zero-shot by 15-17% absolute. It is also more robust to choices required for zero-shot classification, such as patterns for prompting the model to classify and mappings from labels to tokens in the model's vocabulary. Furthermore, since our data merely describes the labels but does not use input texts, finetuning on it yields a model that performs strongly on multiple text domains for a given label set, even improving over few-shot out-of-domain classification in multiple settings. ## 1 Introduction Large language models (LLM) (Radford et al., 2018; Devlin et al., 2019; Liu et al., 2019; Brown et al., 2020; Raffel et al., 2020) have produced strong results in zero-shot text classification for a range of topic and sentiment tasks, often using a pattern-verbalizer approach (Schick and Schutze, 2021). With this approach, to classify the restaurant review "Overpriced, salty and overrated!", a pattern like "the restaurant is [MASK]" is appended to the review and verbalizers are chosen for each label (e.g., "good" for positive sentiment and "bad" for negative). The text is classified by the pretrained masked language modeling (MLM) head to choose the most probable verbalizer for the [MASK] position.1 Although effective, the approach is sensitive to the choice of specific pattern/verbalizer pairs, with subtle changes in the pattern, the verbalizer, or both, often having a large impact on performance (van de Kar et al., 2022; Perez et al., 2021). Footnote 1: Please refer to Schick and Schütze (2021) for more details on the pattern-verbalizer approach. To alleviate these issues, we propose a simple alternative approach of training on small curated datasets intended to describe the labels for a task. Unlike typical training datasets, which consist of input texts annotated by hand with labels, our data contains only the _descriptions_ of the labels. We refer to this data as LabelDesc data and show a few examples for topic and sentiment classification in Table 1. For topic classification, we include a few terms related to the label (e.g., "finance" for "Business", "racing" for "Sports"), a definition of \begin{table} \end{table} Table 1: A few examples of LabelDesc training data for topic and sentiment classification. the label from dictionary.com (e.g., "An athletic activity..." for "Sports"), and a sentence from the opening paragraph of the label's Wikipedia article (e.g., "Business is the activity of..." for "Business"). For sentiment classification, we simply use related terms that capture the specific sentiment (e.g., "terrible" for "Very Negative") as well as a few hand-crafted templates (e.g., "It was \(t\)." where \(t\) is a related term). Next, we finetune pretrained models using the pattern-verbalizer approach on LabelDesc data and evaluate them for text classification. For topic classification, we use patterns and verbalizers from Schick and Schutze (2022) to train on our LabelDesc examples by finetuning the model as well as the MLM head (see Section 3 for details). We refer to training on LabelDesc data as LabelDescTraining. In experiments, we show that LabelDescTraining consistently improves accuracy (average improvement of 15%-17%) over zero-shot classification across multiple topic and sentiment datasets (Table 3). We also show that LabelDescTraining can decrease accuracy variance across patterns compared to zero-shot classification (Table 4), thus being less sensitive to the choice of pattern. We then conduct additional experiments to reveal the value of LabelDescTraining under various circumstances. To study the impact of verbalizer choice, we experiment with uninformative (randomly initialized) and adversarial (intentionally mismatched) verbalizers (Section 4.2.1). While accuracy drops slightly, both settings are still much more accurate than zero-shot classification with its original verbalizers. That is, LabelDescTraining is able to compensate for knowledge-free or even adversarial verbalizer choice. We also compare to finetuning a randomly initialized classifier head without any patterns or verbalizers, again finding accuracy to be higher than zero-shot (Section 4.2.2). Collectively, our results demonstrate that LabelDescTraining leads to strong performance that is less sensitive than zero-shot classification in terms of pattern/verbalizer choice, while also not requiring a pretrained MLM head. Since LabelDesc data focuses entirely on the labels without seeking to capture the input text distribution, we would hope that it would exhibit stable performance across datasets with the same labels. So, we compare LabelDescTraining to the approach of training on a small supervised training set from one domain and testing on another (Section 4.2.3). In multiple cases, LabelDescTraining actually attains higher accuracy than few-shot supervised learning tested on out-of-domain test sets, even when hundreds of manually labeled training examples are used (albeit from a different input domain). In summary, this paper shows several benefits of LabelDescTraining. First, once a practitioner identifies a label set of interest for zero-shot classification, it only requires a few minutes to collect the kind of LabelDesc data shown in Table 1, and training on this data improves over zero-shot by 15-17% absolute. Second, LabelDescTraining leads to greater robustness to pattern/verbalizer choice than zero-shot. Third, LabelDesc data are domain independent with regard to the distribution of the inputs; a single LabelDesc training set can be used for any text classification task as long as it contains the same labels. Our experiments show that this independence to input distribution leads to stable accuracy across domains, even attaining higher accuracy than out-of-domain few-shot learning on a few cases.2 Footnote 2: Data and code are available at [https://github.com/lingyugao/LabelDescTraining](https://github.com/lingyugao/LabelDescTraining). ## 2 Tasks and LabelDesc Datasets We evaluate on two types of tasks: _topic classification_ on AGNews and Yahoo Answers Zhang et al. (2015) and _sentiment classification_ on the Stanford Sentiment Treebank (SST) Socher et al. (2013) and Yelp Reviews Zhang et al. (2015). We consider both binary and 5-way classification for each sentiment dataset, denoted as SST-2, SST-5, Yelp-2, and Yelp-5 henceforth. Below we describe how we construct LabelDesc data for each label set. Dataset statistics as well as all LabelDesc data are in Section A.4 in the Appendix. Topic Classification.Since labels in topic classification represent general concepts, we use both subjective descriptors of the labels (e.g., related terms) and objective sources of information (e.g., dictionary definition and Wikipedia sentences) when selecting LabelDesc data. In particular, we create LabelDesc examples for the label term itself, three related terms, a selected definition from dictionary.com, and the leading sentence from the label's Wikipedia article. As there are typically multiple dictionary.com definitions for our labels, we select a single definition that best aligns with our understanding of the concept underlying the label. We use the leading Wikipedia sentence because it is typically a brief overview/definition of the concept. Most labels in the Yahoo dataset consist of two keywords (e.g., Society & Culture). For these, we use both label terms, definitions for each, and the leading Wikipedia sentences for each. We did not tune any of these decisions experimentally, so these choices in defining LabelDesc data are almost certainly suboptimal. This suboptimality is especially likely for the "World" label in the AGNews label set. This label reflects international news, but the dictionary definition and Wikipedia article for the term "World" do not capture that sense of the word. Nonetheless, we did not change our procedure for this label because we wanted our results to reflect a real-world implementation of the idea, complete with its limitations for certain labels. The LabelDesc instances we are using do not contain exhaustive information. We could easily extend the lists of related terms for each topic or use WordNet or other semantic knowledge resources Zhang et al. (2019). However, one of the goals of this research is to demonstrate how simple it is to choose LabelDesc examples to improve zero-shot classification in very little time. Sentiment Classification.We use a slightly different procedure for sentiment classification. For 5-way sentiment, we use the label verbalizer itself and four synonym terms. In addition to the label verbalizers and synonyms, we write four simple templates: "It was \(t\).", "A(n) \(t\) experience.", "Just \(t\).", and "Overall, it was \(t\).", where \(t\) is the label verbalizer or a synonym. For binary sentiment, we remove the neutral instances, combine the two positive labels ("Very Positive" and "Positive") into one, and combine the two negative labels ("Very Negative" and "Negative") into one. This procedure produces a total of 25 examples per label (5 terms + 5 terms \(\times\) 4 templates) for 5-way sentiment and 50 examples per label for binary sentiment. Since these LabelDesc instances are domain-independent, we use the same data for both Yelp and SST. Hyperparameter Tuning Data.We adhere to the "true" zero-shot setting where hyperparameters cannot be tuned on a development set for the task of interest Schick and Schutze (2022). Therefore, we use a completely separate dataset for hyperparameter tuning - the 20 Newsgroups (20NG, henceforth) Lang (1995) - a standard topic classification dataset with twenty labels. We select only four labels from 20NG for our purposes: _talk.religion.misc_, _rec.autos_, _sci.med_, and _talk.politics.guns_. We chose these four labels because they are sufficiently distinct that we expect tuning to be informative for other real-world topic classification datasets; many of the other 20NG labels are highly technical or similar to one other, like the pair _comp.sys.ibm.pc.hardware_ and _comp.sys.mac.hardware_ as well as the pair _comp.os.ms-windows.misc_ and _comp.windows.x._ We follow the same strategy as for topic classification above when constructing LabelDesc data for 20NG. ## 3 Experimental Settings The following settings are used in our experiments. Unless stated otherwise, we use the pretrained RoBERTa-base/large model Liu et al. (2019) for all experiments since RoBERTa is the predominant choice in related zero-shot and dataless research Schick and Schutze (2021); van de Kar et al. (2022); Gera et al. (2022). Additionally, for every dataset, we use the entire available _test_ sets for evaluation. Zero-shot Classification Baseline.We use the standard "pattern-verbalizer" approach for topic and sentiment classification. The set of verbalizers used can be found in Table 2. For choosing verbalizers, we follow the choices of Schick and Schutze (2021). \begin{table} \begin{tabular}{l|l} \hline \hline **Dataset** & **Verbalizers** \\ \hline 20NG & talk.religion.misc\(\mapsto\) religion, rec.autos \\ & \(\mapsto\) automobile, sci.med\(\mapsto\) medicine, \\ & talk.politics.guns\(\mapsto\) gun \\ \hline AGNews & World \(\mapsto\) World, Sports \(\mapsto\) Sports, Business \(\mapsto\) Business, Sci/Tech \(\mapsto\) Tech \\ \hline Yahoo & Society \& Culture \(\mapsto\) Society, Science \& Mathematics \(\mapsto\) Science, Health \(\mapsto\) Health, \\ & Education \& Reference \(\mapsto\) Education, Computers \& Internet \(\mapsto\) Computer, Sports \(\mapsto\) Sports, Business \& Finance \(\mapsto\) Business, \\ & Entertainment \& Music \(\mapsto\) Entertainment, \\ & Family \& Relationships \(\mapsto\) Relationship, \\ & Politics \& Government \(\mapsto\) Politics \\ \hline Yelp-5 & Very Negative \(\mapsto\) terrible, Negative \(\mapsto\) bad, \\ SST-5 & Neutral \(\mapsto\) okay, Positive \(\mapsto\) good, Very \\ & Positive \(\mapsto\) great \\ \hline Yelp-2 & Negative \(\mapsto\) awful, Positive \(\mapsto\) great \\ SST-2 & \\ \hline \hline \end{tabular} \end{table} Table 2: Verbalizers selected for each dataset. Schutze (2021) for AGNews, Yahoo, Yelp-5, and SST-5. We follow van de Kar et al. (2022) in choosing verbalizers for Yelp-2 and SST-2, and we select verbalizers for 20NG ourselves. Each pattern comprises a prompt including a [MASK] symbol placed before or after the text input, and we aim to predict the masked token. For example, a prompt is added after the input \(x\) to frame classification as a question answering task, e.g., "\(x\) Question: What is the topic of this newsgroup? Answer: [MASK]." We use RoBERTa-base/large with its MLM head for zero-shot experiments. Although the model is able to predict any token within its vocabulary, we choose only among the set of verbalizers, which are designed to be semantically coherent with class labels and tokenized into a single token by the model's tokenizer. For topic classification tasks, we use the Prompt and Q&A patterns from Schick and Schutze (2022), which amounts to 14 patterns. For AGNews, we use "news/article" in the pattern templates, while for Yahoo we replace this with "question", and for 20NG we use "newsgroup". For the sentiment classification tasks, we create new Q&A patterns such as "\(x\) Question: What is the sentiment of this text? Answer: [MASK]." and Prompt patterns such as "\(x\) Sentiment: [MASK]." where \(x\) is the input text. There are 14 sentiment patterns in total, which are shown in Section A.1 in the Appendix. LabelDescTraining.We use the same settings as the zero-shot baseline except that we fine-tune the models on LabelDesc data. We do not use any target task data for tuning or early stopping. Instead, we fix hyperparameter values, including number of training steps, by tuning on 20NG following the process described below. We used LabelDesc data for the four selected 20NG labels as our training data and the original 20NG data (training and test sets) as our dev set, restricted to the four selected labels shown in Section 2. We preprocessed the data by removing headers, quotes, and footers. We used a batch size of 1 and tuned over a set of five learning rates ({5e-7, 1e-6, 5e-6, 1e-5, 5e-5}). Models were trained for 3500 training steps, evaluating on the dev set after each epoch. Based on tuning accuracies, we chose learning rate 5e-7 and number of training steps 2160 for RoBERTa-base and 1920 for RoBERTa-large. Additionally, we explored variations of parameter freezing, such as freezing certain layers of RoBERTa. The best setting on 20NG was to freeze the lower half of the layers (excluding the embedding layer) during finetuning, so we used this for experiments reported below.3 Footnote 3: Section A.2 in the Appendix provides more details on hyperparameter tuning. ## 4 Results and Analysis In this section we first present the results that are obtained via LabelDescTraining and then analyze the benefits of LabelDesc data with a range of additional experiments and analysis. ### Results Table 3 compares standard zero-shot classification and LabelDescTraining. LabelDescTraining has higher accuracy across all topic and sentiment classification datasets, outperforming zero-shot by about 15% on average when using RoBERTa-base and 17% with RoBERTa-large. The results demonstrate that we can greatly improve the performance of zero-shot models with just a few training examples that provide a richer characterization of the label but still without requiring any textual inputs from the task datasets. Also, the accuracy variances across patterns using LabelDescTraining are much lower than the zero-shot setting (see Table 4), which is known to be brittle and unstable (van de Kar et al., 2022; Perez et al., 2021). Finetuning on LabelDesc data not only improves accuracy, but also mitigates \begin{table} \begin{tabular}{l c c c c c c|c} \hline \hline & & AGNews & Yahoo & Yelp-5 & SST-5 & Yelp-2 & SST-2 & Avg. \\ \hline \multirow{2}{*}{zero-shot} & RoBERTa-base & 62.7 & 41.5 & 38.0 & 35.6 & 63.6 & 62.6 & 50.7 \\ & RoBERTa-large & 68.0 & 47.7 & 38.7 & 35.0 & 70.6 & 63.7 & 54.0 \\ \hline \multirow{2}{*}{LabelDescTraining} & RoBERTa-base & 77.4 & 58.8 & 43.6 & 42.0 & 88.3 & 84.5 & 65.8 \\ & RoBERTa-large & 79.4 & 60.8 & 51.3 & 49.2 & 94.6 & 91.3 & 71.1 \\ \hline \hline \end{tabular} \end{table} Table 3: Test accuracy (%) comparison between zero-shot classification and LabelDescTraining. For zero-shot, each result is the average over 14 patterns and for LabelDescTraining, each result is the average over 14 patterns and three random seeds per pattern. The “Avg.” column shows the average accuracies across columns. sensitivity to pattern selection. We compare to state-of-the-art (SOTA) results from the literature in Table 5 (all results we compare to use RoBERTa-base). For this comparison, we use only a single pattern with LabelDescTraining, since doing so reflects more of a real-world use case than averaging over 14 patterns. We choose a single pattern for each of RoBERTa-base and large by tuning on 20NG as we did for other hyperparameters. We use three random seeds and report average accuracies and standard deviations over seeds. Both Chu et al. (2021) and Chu et al. (2021) are variations of the dataless classification approach Chang et al. (2008). Schick and Schutze (2022) used labeled training data (10 or 100 examples, as shown in Table 5) for each task, which differs from the domain independent LabelDesc examples which are agnostic to the textual inputs.4 From van de Kar et al. (2022) we include the highest accuracy. Even though LabelDescTraining merely involves collecting a small set of texts to describe the labels, our results are comparable to others across datasets. LabelDescTraining attains higher accuracy than Chu et al. (2021) and van de Kar et al. (2022) on AGNews and SST-2, and is competitive with other methods on other datasets. We report results on SST-5 and also report results for both base and large models so that future work can compare to our results in this table. We also suggest tuning zero-shot and few-shot methods on datasets that are excluded from the final comparison, like we do in this paper with 20NG. Footnote 4: We only include results with prompt and Q&A patterns (14 patterns for topic and 16 for sentiment) from Schick and Schütze (2022), since those are the pattern types we used for LabelDescTraining. ### Analysis and Discussion One of the primary requirements of the zero-shot approach is the availability of pattern-verbalizer pairs Schick and Schutze (2021, 2022). Here, we study several variations of LabelDescTraining to investigate whether we can simplify or remove components of these pattern-verbalizer pairs. We first experiment with changing verbalizers to gauge the impact of verbalizer choice for LabelDescTraining (Section 4.2.1). Next, we conduct classification experiments that do not use patterns or verbalizers at all (Section 4.2.2). We also report additional experiments in which we measure the multi-domain robustness of LabelDescTraining compared to a standard procedure of training on one domain and testing on an out-of-domain test set (Section 4.2.3). Finally, we take a closer look at label-wise performance to better understand how LabelDescTraining outperforms zero-shot classification (Section 4.2.4). #### 4.2.1 Impact of Verbalizers In this section we report experiments with LabelDescTraining without meaningful verbaliz \begin{table} \begin{tabular}{l l|l|l|l|l|l|l} \hline \hline & \multicolumn{2}{c|}{AGNews} & Yahoo & Yelp-5 & SST-5 & Yelp-2 & SST-2 \\ \hline \multirow{2}{*}{zero-shot} & RoBERTa-base & 7.4 & 7.0 & 4.3 & 4.3 & 10.7 & 11.0 \\ & RoBERTa-large & 7.8 & 8.2 & 7.8 & 7.7 & 15.7 & 14.3 \\ \hline \multirow{2}{*}{LDT} & RoBERTa-base & 5.0, 5.1, 5.0 & 1.7, 1.6, 1.6 & 2.0, 2.1, 2.2 & 1.8, 1.4, 1.5 & 2.1, 2.8, 2.4 & 2.5, 2.3, 1.9 \\ & RoBERTa-large & 5.3, 6.4, 4.6 & 2.1, 2.0, 2.3 & 2.4, 2.5, 2.4 & 1.6, 1.2, 1.5 & 1.1, 2.5, 1.4 & 1.2, 2.8, 1.6 \\ \hline \hline \end{tabular} \end{table} Table 4: Standard deviations of test accuracy (%) across 14 patterns for each test dataset. For LabelDescTraining (LDT in the table), three random seeds were used so we show three standard deviations, one per random seed. All standard deviations over patterns are smaller for LDT than the corresponding values for zero-shot. \begin{table} \begin{tabular}{l l l l l l l l} \hline \hline & & AGNews & Yahoo & Yelp-5 & Yelp-2 & SST-5 & SST-2 \\ \hline \multirow{2}{*}{LabelDescTraining} & RoBERTa-base & 84.6\(\pm\)0.3 & 59.9\(\pm\)0.3 & 42.0\(\pm\)0.4 & 84.8\(\pm\)0.6 & 44.3\(\pm\)0.1 & 88.2\(\pm\)0.2 \\ & RoBERTa-large & 85.1\(\pm\)1.0 & 61.2\(\pm\)0.3 & 52.5\(\pm\)1.2 & 95.3\(\pm\)0.4 & 49.4\(\pm\)1.1 & 91.4\(\pm\)0.8 \\ \hline Chu et al. (2021) & RoBERTa-base & 68.8 & 57.8 & - & 67.3 & - & 65.0 \\ \hline Chu et al. (2021) & RoBERTa-base & 75.1 & 60.0 & - & - & - & - \\ \hline \multirow{2}{*}{Schick and Schütze (2022)} & 10 labeled examples & 79.5\(\pm\)2.2 & 58.4\(\pm\)2.7 & 44.3\(\pm\)2.5 & - & - & - \\ & 100 labeled examples & 87.5\(\pm\)0.8 & 65.3\(\pm\)1.0 & 54.8\(\pm\)1.5 & - & - & - \\ \hline van de Kar et al. (2022) & RoBERTa-base & 79.2 & 56.1 & - & 92.0 & - & 85.6 \\ \hline \hline \end{tabular} \end{table} Table 5: Test accuracy (%) comparison to state-of-the-art methods. ers and even with adversarially chosen verbalizers. We explore two different verbalizer settings: * random: We add \(c\) new words, i.e., RANDOM1, RANDOM2,..., RANDOM\(c\), where \(c\) is the number of dataset labels, to the model's vocabulary and randomly initialize their embeddings. This setting prevents the use of any prior knowledge in the verbalizer embeddings. * mismatched: We shuffle the original mapping of labels to verbalizers, ensuring that each verbalizer maps to a different label than in the original LabelDescTraining setting. Since we are still finetuning the embeddings, finetuning can help the model recover from this mismatched initialization. The results are shown in Table 6. Since we still use the MLM head for these results, we refer to them as "MLM, random" and "MLM, mismatched". While LabelDescTraining performs better than random, and random is better than mismatched, both are better than zero-shot on average. These results suggest that LabelDesc data can partially compensate when the quality of the verbalizers is unknown or poor, at least to improve over zero-shot. #### 4.2.2 Classifiers Without Patterns or Verbalizers Since finetuning on LabelDesc data outperforms zero-shot results with random verbalizers, we are also interested in evaluating its performance without designed patterns, i.e., using a standard randomly initialized softmax classifier. The input is the original text without any patterns and we use a two-layer classification head on top of the [CLS] token representation of the pretrained models. The bottom two rows of Table 6 show the results. The classifiers are close to that of the MLM/random setting and still much higher than zero-shot on average, suggesting that it is not necessary to use patterns, verbalizers, or even the pre-trained MLM head in order to outperform zero-shot classifiers. If it is difficult to select verbalizers or design patterns for a particular classification task, using a classifier that has been finetuned on a small LabelDesc dataset may serve as a strong alternative to the pattern-verbalizer approach. #### 4.2.3 Multi-Domain Evaluation Since LabelDesc examples are domain-independent, they can be used for multiple datasets that have the same labels. To assess the multi-domain performance of LabelDescTraining, we compare it to supervised few-shot learning in which a model is trained on data from one domain and then evaluated on a different domain with the same label set, such as training on SST-5 and evaluating on Yelp-5. To create multi-domain test sets for a single topic label set, we keep AGNews as it is and create a new subsampled version of Yahoo as follows: (1) "Politics & Government" and "Society & Culture" texts from Yahoo are assigned the label "World", (2) "Sports" texts in Yahoo are labeled "Sports", (3) "Business & Finance" texts in Yahoo are labeled "Business", and (4) "Science & Mathematics" and "Computers & Internet" texts in Yahoo are labeled "Sci/Tech". Other Yahoo texts are removed. We refer to this new version of the Yahoo dataset as Yahoo\({}_{\text{AG}}\). For sentiment classification, we choose \begin{table} \begin{tabular}{l l l l l l l l|l} \hline \hline & RoBERTa & AGNews & Yahoo & Yelp-5 & SST-5 & Yelp-2 & SST-2 & Avg. \\ \hline \multirow{2}{*}{zero-shot} & base & 62.7\(\pm\)7.4 & 41.5\(\pm\)7.0 & 38.0\(\pm\)4.3 & 35.6\(\pm\)4.3 & 63.6\(\pm\)10.7 & 62.6\(\pm\)11.0 & 50.7\(\pm\)7.5 \\ & large & 68.0\(\pm\)7.8 & 47.7\(\pm\)8.2 & 38.7\(\pm\)7.8 & 35.0\(\pm\)7.7 & 70.6\(\pm\)15.7 & 63.7\(\pm\)14.3 & 54.0\(\pm\)10.3 \\ \hline \hline \multirow{2}{*}{LabelDescTraining} & base & 77.4\(\pm\)4.9 & 58.8\(\pm\)1.6 & 43.6\(\pm\)2.1 & 42.0\(\pm\)1.6 & 88.3\(\pm\)2.5 & 84.5\(\pm\)2.2 & 65.8\(\pm\)2.5 \\ & large & 79.4\(\pm\)5.0 & 60.8\(\pm\)2.1 & 51.3\(\pm\)2.4 & 49.2\(\pm\)1.6 & 94.6\(\pm\)1.8 & 91.3\(\pm\)2.0 & 71.1\(\pm\)2.5 \\ \hline \multirow{2}{*}{MLM, random} & base & 77.3\(\pm\)4.0 & 54.3\(\pm\)3.9 & 38.1\(\pm\)3.8 & 37.0\(\pm\)3.2 & 78.4\(\pm\)10.0 & 73.3\(\pm\)7.9 & 59.7\(\pm\)5.5 \\ & large & 75.2\(\pm\)5.0 & 58.0\(\pm\)3.0 & 46.4\(\pm\)3.3 & 43.4\(\pm\)2.9 & 90.8\(\pm\)7.6 & 84.1\(\pm\)6.8 & 66.3\(\pm\)4.8 \\ \hline \multirow{2}{*}{MLM, mismatched} & base & 73.1\(\pm\)5.6 & 50.1\(\pm\)5.4 & 36.8\(\pm\)2.8 & 35.8\(\pm\)2.5 & 80.1\(\pm\)7.2 & 75.8\(\pm\)5.0 & 58.6\(\pm\)4.8 \\ & large & 66.4\(\pm\)8.6 & 44.5\(\pm\)4.9 & 41.9\(\pm\)4.0 & 38.7\(\pm\)4.2 & 83.6\(\pm\)6.5 & 78.1\(\pm\)6.0 & 58.9\(\pm\)5.7 \\ \hline \multirow{2}{*}{classifier} & base & 72.5\(\pm\)5.5 & 57.1\(\pm\)0.7 & 40.3\(\pm\)1.3 & 39.4\(\pm\)2.5 & 86.9\(\pm\)2.9 & 79.7\(\pm\)1.1 & 62.7\(\pm\)2.3 \\ & large & 77.8\(\pm\)1.5 & 50.9\(\pm\)7.3 & 42.4\(\pm\)1.6 & 35.3\(\pm\)9.2 & 93.3\(\pm\)0.9 & 86.6\(\pm\)1.4 & 64.4\(\pm\)3.7 \\ \hline \hline \end{tabular} \end{table} Table 6: Test accuracies (%) for several variations of LabelDescTraining. The standard deviations are computed over 14 patterns for zero-shot; 3 random seeds for the classifier (no patterns); and both 14 patterns and 3 random seeds for LabelDescTraining and MLM (random, mismatched). two dataset pairs that share label sets, i.e., SST-5 and Yelp-5. We do not change anything about the LabelDescTraining configuration for these experiments. We simply evaluate the same model on multiple test sets, reporting average accuracies over patterns. For few-shot setup, we create datasets with 10, 100, and 500 training examples per label. For _in-domain_ experiments, train, dev, and test sets are drawn from the same domain/dataset, whereas for _out-of-domain_ experiments, train and dev sets are drawn from one domain and the test set is drawn from another domain. We tune learning rates over the same ranges as mentioned earlier and use batch sizes 1, 2, and 4 for 10, 100, and 500 examples per label, respectively. We train for 15 epochs. The results using RoBERTa-large are shown in Figure 1. For brevity, we only show a subset of results.5 As we would expect, testing on out-of-domain data leads to accuracy drops but adding more out-of-domain training data reduces this gap. The LabelDescTraining results are shown as an orange dotted line. LabelDescTraining outperforms supervised few-shot learning in some cases, such as training on AGNews and testing on Yahoo\({}_{\text{AG}}\), even with 500 examples per label (upper-right plot in Figure 1). We see the same trend when the supervised model is trained on Yelp-5 and tested on SST-5 (lower-right plot in Figure 1). In 3 out of 4 cases, LabelDescTraining outperforms supervised few-shot out-of-domain learning with 10 examples per label, even outperforms the use of labeled 100 examples in 2 out of 4 cases. Footnote 5: Section A.3 in the Appendix shows additional results. #### 4.2.4 Label-wise Investigation To better understand why LabelDescTraining outperforms zero-shot, we report label-specific F1 scores in Tables 8 and 9. For AGNews, the zero-shot classifiers have low F1 scores for the World label, probably because the verbalizer "World" is much less coherent and less representative of the actual label than others like "Sports." LabelDescTraining improves F1 on the World label by roughly 20 points, while the improvement for Sports is only about 4 points. Likewise, the F1 scores for the labels "Very Negative", "Very Positive", and "Neutral" are very low for the zero-shot models on SST-5, indicating that those labels are being largely ignored by the zero-shot approach. Again, LabelDescTraining shows large improvements in F1 for some of these labels, especially the "Very Positive" label. These trends are likely due in part to the differences in probabilities of verbalizers, e.g., "good" and "bad" occur more frequently than "great", and "terrible", respectively. The LabelDesc data is balanced, which helps to mitigate the ignoring of any labels, even though the task test sets are not all balanced. Table 7 shows examples that are incorrectly classified by zero-shot models but are correctly classified by the LabelDescTraining models. (2019) proposed to use the label definitions from WordNet with a textual entailment approach. Another approach that has gained popularity is self-training given label names and acquiring knowledge by mining an unlabeled dataset (Meng et al., 2020; Gera et al., 2022). van de Kar et al. (2022) extend the mining-based approach by selecting unsupervised examples (via patterns) and then training on them. Basile et al. (2022) select good label descriptions by aggregation. Meng et al. (2022) use language models to generate new training examples. On the contrary, we use a very small set of simple label descriptions as training examples that are also domain independent. Our training setup is influenced by Schick and Schutze (2021) and Schick and Schutze (2022), although, instead of finetuning on training examples, we only use our LabelDesc data. Our work is closely related to dualess classification (Chang et al., 2008) which involves building classifiers by designing or learning a generic function that scores the compatibility of a document and label defined in natural language. We compared empirically to the dualess classification approaches of Chu et al. (2021) and Chu et al. (2021) who used pretrained models, naturally annotated data like that from Wikipedia categories, and unsupervised clustering techniques. There is a wealth of prior work in semi-supervised text classification (Nigam et al., 2000; Xie et al., 2020; Howard and Ruder, 2018). There is also related work on generating label names (Schick et al., 2020) or label descriptions (Chai et al., 2020; Sun et al., 2019) but for supervised text classification tasks. ## 6 Conclusions We presented LabelDescTraining, a method for improving the accuracy of zero-shot classification by using small, curated datasets that simply describe the labels for a task in natural language, rather than involve texts manually annotated with labels. Our method is 15-17% more accurate than zero-shot on average across a range of topic and sentiment datasets. LabelDescTraining is also more robust to the choices required for zero-shot classification, such as patterns and verbalizers. Furthermore, LabelDesc data is domain agnostic and therefore can used for any text classification task as long as it contains the same set of labels. In such settings, LabelDescTraining can even outperform a supervised approach when the latter uses training data from a different domain. One future direction would be to apply the idea to structured prediction and natural language generation tasks. Another would be to investigate ways to reduce the dependence of pretrained models on patterns and verbalizers, such as directly calibrating \begin{table} \begin{tabular}{l l l} \hline text ([headline][text body] for AGNews) & zero-shot & LabelDescTraining \\ \hline \multicolumn{3}{l}{[Homeless families total 100,000][The figure for homeless families in England has} & Business & World \\ topped 100,000 for the first time.] & \multicolumn{1}{l}{} \\ \multicolumn{3}{l}{[Shifting signs in North Korea][Kim Jong II dials back his personality cult as} & Sports & World \\ \multicolumn{3}{l}{protest activities pick up.]} & \multicolumn{1}{l}{} \\ \multicolumn{3}{l}{[GM, Daimler Go Green][Team-up will help the companies compete and fill gaps} & Sci/Tech & Business \\ \multicolumn{3}{l}{in both firms’ portfolios.]} & \multicolumn{1}{l}{} \\ \multicolumn{3}{l}{[A Sneak Peek at Trillian 3.0 Instant Messaging][The popular IM consolidation} & Business & Sci/Tech \\ \multicolumn{3}{l}{service adds audio and video chat.]} & \multicolumn{1}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \end{tabular} \begin{tabular}{l l l} \hline text ([headline][text body] for AGNews) & zero-shot & LabelDescTraining \\ \hline [Homeless families total 100,000][The figure for homeless families in England has & Business & World \\ topped 100,000 for the first time.] & \multicolumn{1}{l}{} \\ [Shifting signs in North Korea][Kim Jong II dials back his personality cult as} & Sports & World \\ protest activities pick up.] & \multicolumn{1}{l}{} \\ [GM, Daimler Go Green][Team-up will help the companies compete and fill gaps} & Sci/Tech & Business \\ in both firms’ portfolios.] & \multicolumn{1}{l}{} \\ [A Sneak Peek at Trillian 3.0 Instant Messaging][The popular IM consolidation} & Business & Sci/Tech \\ \multicolumn{3}{l}{service adds audio and video chat.]} & \multicolumn{1}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \end{tabular} \begin{tabular}{l l l} \hline text ([headline][text body] for AGNews) & zero-shot & LabelDescTraining \\ \hline [Homeless families total 100,000][The figure for homeless families in England has & Business & World \\ topped 100,000 for the first time.] & \multicolumn{1}{l}{} \\ [Shifting signs in North Korea][Kim Jong II dials back his personality cult as} & Sports & World \\ protest activities pick up.] & \multicolumn{1}{l}{} \\ [GM, Daimler Go Green][Team-up will help the companies compete and fill gaps} & Sci/Tech & Business \\ in both firms’ portfolios.] & \multicolumn{1}{l}{} \\ [A Sneak Peek at Trillian 3.0 Instant Messaging][The popular IM consolidation} & Business & Sci/Tech \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \end{tabular} \begin{tabular}{l l l} \hline text ([headline][text body] for AGNews) & zero-shot & LabelDescTraining \\ \hline [Homeless families total 100,000][The figure for homeless families in England has & Business & World \\ topped 100,000 for the first time.] & \multicolumn{1}{l}{} \\ [Shifting signs in North Korea][Kim Jong II dials back his personality cult as} & Sports & World \\ protest activities pick up.] & \multicolumn{1}{l}{} \\ [GM, Daimler Go Green][Team-up will help the companies compete and fill gaps} & Sci/Tech & Business \\ in both firms’ portfolios.] & \multicolumn{1}{l}{} \\ [A Sneak Peek at Trillian 3.0 Instant Messaging][The popular IM consolidation} & Business & Sci/Tech \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \end{tabular} \begin{tabular}{l l l} \hline text ([headline][text body] for AGNews) & zero-shot & LabelDescTraining \\ \hline [Homeless families total 100,000][The figure for homeless families in England has & Business & World \\ topped 100,000 for the first time.] & \multicolumn{1}{l}{} \\ [Shifting signs in North Korea][Kim Jong II dials back his personality cult as} & Sports & World \\ protest activities pick up.] & \multicolumn{1}{l}{} \\ [GM, Daimler Go Green][Team-up will help the companies compete and fill gaps} & Sci/Tech & Business \\ in both firms’ portfolios.] & \multicolumn{1}{l}{} \\ [A Sneak Peek at Trillian 3.0 Instant Messaging][The popular IM consolidation} & Business & Sci/Tech \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \multicolumn{3}{l}{} \\ \end{tabular} \begin{tabular}{l l l} \hline text ([headline][text body] for AGNews) & zero-shot & LabelDescTraining \\ \hline [Homeless families total 100,000][The figure for homeless families in England has & Business & World \\ topped 100,000 for the first time.] & \multicolumn{1}{l}{} \\ [Shifting signs in North Korea][Kim Jong II dials back his personality cult as} & Sports & World \\ protest activities pick up.] & \multicolumn{1}{l}{} \\ [GM, Daimler Go Green][Team-up will help the companies compete and fill gaps} & Sci/Tech & Business \\ in both firms’ portfolios.] & \multicolumn{1}{l}{} \\ [A Sneak P the marginal probabilities of verbalizers with the goal of minimizing biases of pretrained models. ## 7 Limitations We focus on a simple approach of curating small finetuning datasets that describe the labels for text classification tasks. Although this is beneficial when the task is specific, especially when the data is difficult to obtain, the data curation process is intrinsically intuitive and relies on the practitioner's understanding of the labels and usage situation. Moreover, since a pretrained model is necessary for this approach, a few curated examples may mitigate, but cannot detect or eliminate, potential biases of the pretrained model. If the labels of a certain classification task are dissimilar from the examples the model was trained on, and the model lacks the knowledge to differentiate among them, it may lead to unsatisfying performance even after finetuning on a few examples of label descriptions. ## 8 Ethics Statement We use pretrained models for text classification, and curate data with the assistance of data sources such as Wikipedia and dictionary definitions. The large pretrained models are trained on a massive amount of data and have been shown to have issues with bias; however, this is a common challenge when working with pretrained models and would benefit from advances made by the community on this front. While both dictionary.com definitions and Wikipedia are aimed at providing accurate and neutral information for a word/concept, they can be affected by the biases and limitations of their editors, especially for Wikipedia, which is an open-source encyclopedia. Our method is not reliant on specific dictionaries or encyclopedias; others could be used. We chose these resources for simplicity as they are highly accessible and widely used. Since our LabelDesc data is very small in size, we manually examined the data as we selected it for any potential biases or other issues. Finally, we use standard topic and sentiment datasets for evaluation, which are used in a great deal of prior work.

2308.15961

Finding-Aware Anatomical Tokens for Chest X-Ray Automated Reporting

The task of radiology reporting comprises describing and interpreting the medical findings in radiographic images, including description of their location and appearance. Automated approaches to radiology reporting require the image to be encoded into a suitable token representation for input to the language model. Previous methods commonly use convolutional neural networks to encode an image into a series of image-level feature map representations. However, the generated reports often exhibit realistic style but imperfect accuracy. Inspired by recent works for image captioning in the general domain in which each visual token corresponds to an object detected in an image, we investigate whether using local tokens corresponding to anatomical structures can improve the quality of the generated reports. We introduce a novel adaptation of Faster R-CNN in which finding detection is performed for the candidate bounding boxes extracted during anatomical structure localisation. We use the resulting bounding box feature representations as our set of finding-aware anatomical tokens. This encourages the extracted anatomical tokens to be informative about the findings they contain (required for the final task of radiology reporting). Evaluating on the MIMIC-CXR dataset of chest X-Ray images, we show that task-aware anatomical tokens give state-of-the-art performance when integrated into an automated reporting pipeline, yielding generated reports with improved clinical accuracy.

Francesco Dalla Serra, Chaoyang Wang, Fani Deligianni, Jeffrey Dalton, Alison Q. O'Neil

2023-08-30T11:35:21Z

http://arxiv.org/abs/2308.15961v1

# Finding-Aware Anatomical Tokens for Chest X-Ray Automated Reporting ###### Abstract The task of radiology reporting comprises describing and interpreting the medical findings in radiographic images, including description of their location and appearance. Automated approaches to radiology reporting require the image to be encoded into a suitable token representation for input to the language model. Previous methods commonly use convolutional neural networks to encode an image into a series of _image-level_ feature map representations. However, the generated reports often exhibit realistic style but imperfect accuracy. Inspired by recent works for image captioning in the general domain in which each visual token corresponds to an object detected in an image, we investigate whether using local tokens corresponding to anatomical structures can improve the quality of the generated reports. We introduce a novel adaptation of Faster R-CNN in which _finding detection_ is performed for the candidate bounding boxes extracted during anatomical structure localisation. We use the resulting bounding box feature representations as our set of _finding-aware_ anatomical tokens. This encourages the extracted anatomical tokens to be informative about the findings they contain (required for the final task of radiology reporting). Evaluating on the MIMIC-CXR dataset [16, 17, 12] of chest X-Ray images, we show that task-aware anatomical tokens give state-of-the-art performance when integrated into an automated reporting pipeline, yielding generated reports with improved clinical accuracy. Keywords:CXR Automated Reporting Anatomy Localisation Findings Detection Multimodal Transformer Triples Representation ## 1 Introduction A radiology report is a detailed text description and interpretation of the findings in a medical scan, including description of their anatomical location and appearance. For example, a Chest X-Ray (CXR) report may describe an opacity (a type of finding) in the left upper lung (the relevant anatomical location) which is diagnosed as a lung nodule (interpretation). The combination of a finding and its anatomical location influences both the diagnosis and the clinical treatment decision, since the same finding may have a different list of possible clinical diagnoses depending on the location. Recent CXR automated reporting methods have adopted CNN-Transformer architectures, in which the CXR is encoded using Convolutional Neural Networks (CNNs) into global image-level features [13, 14] which are input to a Transformer language model [32] to generate the radiology report. However, the generated reports often exhibit realistic style but imperfect accuracy, for instance hallucinating additional findings or describing abnormal regions as normal. Inspired by recent image captioning works in the general domain [2, 19, 37] in which each visual token corresponds to an object detected in the input image, we investigate whether replacing the image-level tokens with local tokens - corresponding to anatomical structures - can improve the clinical accuracy of the generated reports. Our contributions are to: 1. Propose a novel multi-task Faster R-CNN [27] to extract _finding-aware anatomical tokens_ by performing finding detection on the candidate bounding boxes identified during anatomical structure localisation. We ensure these tokens convey rich information by training the model on an extensive set of anatomy regions and associated findings from the Chest ImaGenome dataset [34, 12]. 2. Integrate the extracted finding-aware anatomical tokens as the visual input in a state-of-the-art two-stage pipeline for radiology report generation [6]; this pipeline is multimodal, taking both image (CXR) and text (the corresponding text indication field) as inputs. 3. Demonstrate the benefit of using these tokens for CXR report generation through in-depth experiments on the MIMIC-CXR dataset. Figure 1: Finding-aware anatomical tokens integrated into a multimodal CXR automated reporting pipeline. The CXR image and report are taken from the IU-Xray dataset [7]. ## 2 Related Works Automated ReportingPrevious works on CXR automated reporting have examined the model architecture [5, 4], the use of additional loss functions [24], retrieval-based report generation [29, 10], and grounding report generation with structured knowledge [6, 35]. However, no specific focus has been given to the image encoding. Inspired by recent works in image captioning in the general domain [2, 19, 37], where each visual token corresponds to an object detected in an image, we propose to replace the image-level representations with local representations corresponding to anatomical structures detected in a CXR. To the best of our knowledge, only [33, 30] have considered anatomical feature representations for CXR automated reporting. In [33], they extract anatomical features from an object detection model trained solely on the anatomy localisation task. In [30], they train the object detector through multiple steps - anatomy localisation, binary abnormality classification and region selection - and feed each anatomical region individually to the language model to generate one sentence at a time. This approach makes the simplistic assumption that one anatomical region is described in exactly one report sentence. Finding DetectionPrior works have tackled the problem of finding detection in CXR images via weakly supervised approaches [36, 38]. However, the design of these approaches does not allow the extraction of anatomy-specific vector representations, making them unsuited for our purpose. Agu et al [1] proposed AnaXnet, comprising two modules trained independently: a standard Faster R-CNN trained to localise anatomical regions, and a Graph Convolutional Network (GCN) trained to classify the pathologies appearing in each anatomical region bounding box. This approach assumes that the finding information is present in the anatomical representations after the first stage of training. ## 3 Methods We describe our method in two parts: (1) Finding-aware anatomical token extraction (Figure 1, left) - a custom Faster R-CNN which is trained to jointly perform _anatomy localisation_ and _finding detection_; and (2) Multimodal report generation (Figure 1, right) - a two-step pipeline which is adapted to perform _triples extraction_ and _report generation_, using the anatomical tokens extracted from the Faster R-CNN as the visual inputs for the multimodal Transformer backbone [32]. ### Finding-Aware Anatomical Token Extraction Let us consider \(A=\{a_{n}\}_{n=1}^{N}\) as the set of anatomical regions in a CXR and \(F=\{f_{m}\}_{m=1}^{M}\) the set of findings we aim to detect. We define \(f_{n,m}\in\{0,1\}\) indicating the absence or presence of the finding \(f_{m}\) in the anatomical region \(a_{n}\), and \(f_{n}=\{f_{n,m}\}_{m=1}^{M}\) as the set of findings in \(a_{n}\). We define _anatomy localisation_ as the task of predicting the top-left and bottom-right bounding box coordinates \(c=(c_{x1},c_{y1},c_{x2},c_{y2})\) of the anatomical regions \(A\); and _finding detection_ as the task of predicting the findings \(f_{n}\) at each location \(a_{n}\). We frame anatomy localisation as a general object detection task, employing the Faster R-CNN framework to compute the coordinates of the bounding boxes and the anatomical labels assigned to each of them. First, the image features are extracted from the CNN backbone, composed of a ResNet-50 [13] and a Feature Pyramid Network (FPN) [22]. Second, the multi-scale image features extracted from the FPN are passed to the Region Proposal Network (RPN) to generate the bounding box coordinates \(c_{k}=(c_{k,x1},c_{k,y1},c_{k,x2},c_{k,y2})\) for each proposal \(k\) and to the Region of Interest (RoI) pooling layer, designed to extract the respective fixed-length vector representation \(l_{k}\in\mathbb{R}^{1024}\). Each proposal's local features \(l_{k}\) are then passed to a classification layer (_Anatomy Classifier_) to assign the anatomical label (\(a_{k}\)) and to a bounding box regressor layer to refine the coordinates. In parallel, we insert a multi-label classification head (_Findings Classifier_) - consisting of a single fully-connected layer with sigmoid activation functions - that classifies a set of findings for each proposal's local features (see Appendix 0.A). During training, we use a multi-task loss comprising three terms: _anatomy classification loss_, _box regression loss_, and (multi-label) _finding classification loss_. Formally, for each predicted bounding box, this is computed as \[\mathcal{L}=\mathcal{L}_{anatomy}+\mathcal{L}_{box}+\lambda\mathcal{L}_{ finding}, \tag{1}\] where \(\mathcal{L}_{anatomy}\) and \(\mathcal{L}_{box}\) correspond to the anatomy classification loss and the bounding box regression loss described in [11] and \(L_{finding}\) is the finding classification loss that we introduce; \(\lambda\) is a balancing hyper-parameter set to \(\lambda=10^{2}\). We define \[\mathcal{L}_{finding}=-\sum_{k=1}^{K}\sum_{m=1}^{M}w_{m}f_{k,m}\log(p_{k,m}) \tag{2}\] a binary cross-entropy loss between the predicted probability \(p_{k}=\{p_{k,m}\}_{m=1}^{M}\) of the \(k\)-th proposal and its associated ground truth \(f_{k}=\{f_{k,m}\}_{m=1}^{M}\) (with \(f_{k}=f_{m}\) if \(a_{k}=a_{m}\)). We class weight using \(w_{m}=(1/\nu_{m})^{\alpha}\), where \(\nu_{m}\) is the frequency of the finding \(f_{m}\) in the training dataset and we empirically set \(\alpha\) to 0.25. At inference time, for each CXR image, we extract the finding-aware anatomical tokens \(A_{tok}=\{l_{n}\}_{n=1}^{N}\), by selecting for each anatomical region the proposal with highest anatomical classification score and taking the associated latent vector representation \(l_{n}\). Any non-detected regions are assigned a 1024-dimensional vector of zeros. \(A_{tok}\) is provided as input to the report generation model. ### Multimodal Report Generation We adopt the multimodal knowledge-grounded approach for automated reporting on CXR images as proposed in [6]. Firstly, _triples extraction_ is performed to extract structured information from a CXR image in the form of triples, given the indication field \(Ind\) as context. Secondly, _report generation_ is performed to generate the radiology report from the triples with the CXR image and indication field again provided as context. Each step is treated as a sequence-to-sequence task; for this purpose, the triples are concatenated into a single text sequence (in the order they appear in the ground truth report) separated by the special [SEP] token to form \(Trp\), and the visual tokens are concatenated in a fixed order of anatomical regions. Two multimodal encoder-decoder Transformers are employed as the Triples Extractor (\(TE\)) and Report Generator (\(RG\)). The overall approach is: \[\begin{array}{ll}\texttt{Step 1}&Trp=TE(seg_{1}=A_{tok},seg_{2}=Ind)\\ \texttt{Step 2}&R=RG(seg_{1}=A_{tok},seg_{2}=Ind\ \texttt{[SEP]}\ Trp)\end{array} \tag{3}\] where \(seg_{1}\) and \(seg_{2}\) are the two input segments which are themselves concatenated at the input. In step 2, the indication field and the triples are merged into a single sequence of text by concatenating them, separated by the special [SEP] token. Similarly to [8], the input to a Transformer corresponds to the sum of the textual and visual _token embeddings_, the _positional embeddings_--to inform about the order of the tokens--and the _segment embeddings_--to discriminate between the two modalities. ## 4 Experimental Setup ### Datasets and Metrics We base our experiments on two open-source CXR imaging datasets, Chest ImaGenome [34, 12] and MIMIC-CXR [16, 17, 12]. The MIMIC-CXR dataset comprises CXR image-report pairs and is used for the target task of report generation. The Chest ImaGenome dataset is derived from MIMIC-CXR, extended with additional automatically extracted annotations for 242,072 anteroposterior and posteroanterior CXR images, which we use to train the finding-aware anatomical token extractor. We follow the same train/validation/test split as proposed in the Chest ImaGenome dataset. We extract the _Findings_ section of each report as the target text4. For the textual input, we extract the _Indication field_ from each report.5 We annotate the ground truth triples for each image-report pair following a semi-automated pipeline using RadGraph [15] and sciSpaCy [25], as described in [6]. Footnote 4: [https://github.com/MIT-LCP/mimic-cxr/blob/master/txt/create_section_files.py](https://github.com/MIT-LCP/mimic-cxr/blob/master/txt/create_section_files.py) Footnote 5: [https://github.com/jacenkow/mmbt/blob/main/tools/mimic_cxr_preprocess.py](https://github.com/jacenkow/mmbt/blob/main/tools/mimic_cxr_preprocess.py) To assess the quality of the generated reports, we compute Natural Language Generation (NLG) metrics: BLEU [26], ROUGE [21] and METEOR [3]. We further compute Clinical Efficiency (CE) metrics by applying the CheXbert labeller [28] which extracts 14 findings to the ground truth and the generated reports, and evaluate F1, precision and recall scores. We repeat each experiment 3 times using different random seeds, reporting the average in our results. ### Implementation _Finding-aware anatomical token extractor:_ We adapt the Faster R-CNN implementation from [20]6, by including the finding classifier. We initialise the network with weights pre-trained on the COCO dataset [23], then fine-tune it to localise 36 anatomical regions and to detect 71 findings within each region, as annotated in the Chest ImaGenome dataset (see Appendix 0.C). The CXR images are resized by matching the shorter dimension to 512 pixels (maintaining the original aspect ratio) and cropping to a resolution of \(512\times 512\) (random crop during training and centre crop during inference). We train the model for 25 epochs with a learning rate of \(10^{-3}\), decayed every 5 epochs by a factor of 0.8. We select the model with the highest finding detection performances for the validation set, measured by computing the AUROC score for each finding at each anatomical region (see results in Appendix 0.B). Footnote 6: [https://pytorch.org/vision/main/models/generated/torchison.models.detection](https://pytorch.org/vision/main/models/generated/torchison.models.detection). _Report generator:_ We implement a vanilla Transformer encoder-decoder at each step of the automated reporting pipeline. Both the encoder and the decoder consist of 3 attention layers, each composed of 8 heads and 512 hidden units. All the parameters are randomly initialised. We train step 1 for 40 epochs, with the learning rate set to \(10^{-4}\) and we decay it by a factor of 0.8 every 3 epochs; and step 2 for 20 epochs, with the same learning rate as step 1. During training, we follow [6] in masking out a proportion of the ground-truth triples (50%, determined empirically), while during inference we use the triples extracted at step 1. We select the model with the highest CE-F1 score on the validation set. _Baselines_ We benchmark against other CXR automated reporting methods: R2Gen [5], R2GenCMN [4], \(\mathcal{M}^{2}\) Tr.+\(\mathrm{fact}_{\mathrm{ENTNLI}}\)[24], CNN+Two-Step [6] and RGRG [30]. All these methods (except RGRG) adopt a CNN-Transformer and have shown state-of-the-art performances in report generation on the MIMIC-CXR dataset. All reported values are re-computed using the original code based on the same data split and image resolution as our method, except for [30] who already used this data split and image resolution, therefore we cite their reported results. We keep remaining hyperparameters as the originally reported values. ## 5 Results _Overall results_ In Table 1, we benchmark against other state-of-the-art CXR automated reporting methods and compare with the \(A_{tok}\) integrated into the full pipeline versus a simpler approach of the report generator model only, \(RG\), which generates the report directly from image and indication field (omitting triples extraction). The proposed finding-aware anatomical tokens integrated with a knowledge-grounded pipeline [6] generate reports with state-of-the-art fluency (NLG metrics) and clinical accuracy (CE metrics). Moreover, the superior results of our \(A_{tok}\) + RG approach compared to RGRG [30] suggests that providing the full set of anatomical tokens together, instead of separately, gives better results. The broader visual context is indeed necessary when describing findings that span multiple regions _e.g._, assessing the position of a tube. Ablation StudyTable 2 shows the results of adopting different visual representations. Firstly, we use a CNN (**ResNet-101**) trained end-to-end with \(TE+RG\) and initialised two ways: pre-trained on **ImageNet** versus pretrained on the **Findings** labels of Chest ImaGenome (details provided in Appendix D). Secondly, we extract anatomical tokens (\(\textbf{A}_{tok}\)) with different supervision of Faster R-CNN: anatomy localisation only (**Anatomy**) or anatomy localisation + finding detection (**Anatomy+Findings**). The results show the positive effect of \begin{table} \begin{tabular}{|l|c c c c c c c|c c c|} \hline \multirow{2}{*}{**Method**} & \multicolumn{4}{c|}{**NLG**} & \multicolumn{4}{c|}{**CE**} \\ & **BL-1** & **BL-2** & **BL-3** & **BL-4** & **MTR** & **RG-L** & **F1** & **P** & **R** \\ \hline R2Gen [5] & 0.381 & 0.248 & 0.174 & 0.130 & 0.152 & 0.314 & 0.431 & 0.511 & 0.395 \\ R2GenCNN [4] & 0.365 & 0.239 & 0.169 & 0.126 & 0.145 & 0.309 & 0.371 & 0.462 & 0.311 \\ \(M^{2}\) Tr. + factententall [24] & 0.402 & 0.261 & 0.183 & 0.136 & 0.158 & 0.300 & 0.458 & 0.540 & 0.404 \\ ResNet-101 + \(TE\)\(+\)\(RG\)[6] & 0.468 & 0.343 & 0.271 & 0.223 & 0.200 & 0.390 & 0.477 & 0.556 & 0.418 \\ RGRG [30] & 0.400 & 0.266 & 0.187 & 0.135 & 0.168 & - & 0.461 & 0.475 & 0.447 \\ \hline \(A_{tok}\)\(+\)\(RG\) (_ours_) & 0.422 & 0.324 & 0.265 & 0.225 & 0.201 & **0.426** & 0.515 & 0.579 & 0.464 \\ \(A_{tok}\)\(+\)\(TE\)\(+\)\(RG\) (_ours_) & **0.490** & **0.363** & **0.288** & **0.237** & **0.213** & 0.406 & **0.537** & **0.585** & **0.496** \\ \hline \end{tabular} \end{table} Table 1: Comparison of our proposed solution with previous approaches. TE = Triples Extractor, RG = Report Generator. \begin{table} \begin{tabular}{|c|c|c c c c c c|c c c|} \hline \multirow{2}{*}{**Visual**} & \multirow{2}{*}{**Supervision**} & \multicolumn{4}{c|}{**NLG**} & \multicolumn{4}{c|}{**CE**} \\ & & **BL-1** & **BL-2** & **BL-3** & **BL-4** & **MTR** & **RG-L** & **F1** & **P** & **R** \\ \hline ResNet-101 & ImageNet & 0.468 & 0.343 & 0.271 & 0.223 & 0.200 & 0.390 & 0.477 & 0.556 & 0.418 \\ ResNet-101 & Findings & 0.472 & 0.346 & 0.273 & 0.225 & 0.202 & 0.396 & 0.495 & 0.565 & 0.440 \\ Naive \(A_{tok}\) & Anatomy & 0.436 & 0.320 & 0.253 & 0.208 & 0.187 & 0.387 & 0.392 & 0.487 & 0.329 \\ \(A_{tok}\) & Anatomy+Findings & **0.490** & **0.363** & **0.288** & **0.237** & **0.213** & **0.406** & **0.537** & **0.585** & **0.496** \\ \hline \end{tabular} \begin{tabular}{|c|c|c c c c c|c c c|} \hline \multirow{2}{*}{**GT Report**} & \multirow{2}{*}{**ResNet-101**} & \multirow{2}{*}{**TE + RG**} & \multicolumn{4}{c|}{**Naive \(\textbf{A}_{tok}\) + TE + RG**} & \multicolumn{4}{c|}{**A\(\textbf{tok}\) + TE + RG**} \\ \cline{5-16} & & & & & & & & & & & & \\ \hline \multirow{6}{*}{The cardiac silhouette size is normal. There is mild calcification of the aortic knot.1 The head and blur contours are otherwise unremarkable and the buoyancy vascularity is normal and the lungs (Lungs are clear. No pleural effusion local consolidation). No pleural effusion local consolidation is present. There are mild degenerative changes in the thoracic spine.2 (Lungs are clear. No pleural effusion local consolidation). No pleural effusion or pneumothorax is present. There are mild degenerative changes in the thoracic spine with mild loss of height of a smooth thoracic vertebral body unchanged.2 (Lungs are clear. No pleural effusion local consolidation). (Lungs are clear. No pleural effusion local consolidation). No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural effusion local crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps. No pleural crosscaps No pleural crosscaps No pleural crosscaps. including supervision with finding detection either when pre-training ResNet-101 or as an additional task for Faster R-CNN. Example reports are shown in Figure 2 (abbreviated) and Appendix F (extended). Anatomical Embedding DistributionsIn Figure 3, we visualise the impact of the finding detection task on the extracted anatomical tokens. To generate these plots, for 3000 randomly selected test set scans, we first perform principle component analysis [18] for dimensionality reduction of the token embeddings (from \(\mathbb{R}^{1024}\) to \(\mathbb{R}^{50}\)), then use t-distributed stochastic neighbour embedding (t-SNE) [31], colour coding the extracted embeddings by their anatomical region and additionally categorising as _normal_ or _abnormal_ (a token is considered abnormal if at least one of the 71 findings is positively labeled). For most anatomical regions, the normal and abnormal groups are better separated by the finding-aware tokens, suggesting these tokens successfully transmit information about findings. We also compute the mean distance between normal and abnormal clusters using Frechet Distance (mFD) [9], measuring mFD=8.80 (naive anatomical tokens) and mFD=78.67 (finding-aware anatomical tokens). ## 6 Conclusion This work explores how to extract and integrate anatomical visual representations with language models, targeting the task of automated radiology reporting. We propose a novel multi-task Faster R-CNN adaptation that performs finding detection jointly with anatomy localisation, to extract _finding-aware anatomical tokens_. We then integrate these tokens as the visual input for a multimodal Figure 3: T-SNE visualisation of normal and abnormal embeddings for a subset of visual tokens. Left: _naive anatomical token_ embeddings extracted from Faster R-CNN trained solely on anatomy localisation. Right: _task-aware anatomical token_ embeddings extracted from Faster R-CNN trained also on the finding detection task. image+text report generation pipeline, showing that finding-aware anatomical tokens improve the fluency (NLG metrics) and clinical accuracy (CE metrics) of the generated reports, giving state-of-the-art results.

2301.08585

Probe of a Randall-Sundrum-like model from muon pair production at high energy muon collider

We have examined inclusive $\mu^+\mu^- \rightarrow \mu^+ \mu^- + E_{\mathrm{miss}}$ and annihilation $\mu^+\mu^- \rightarrow \mu^+ \mu^-$ processes at future high energy muon colliders in the framework of the Randall-Sundrum-like model with a small curvature of space-time. The collision energies of 3 TeV, 14 TeV and, 100 TeV are addressed. Both differential and total cross sections are calculated, and exclusion bounds on a 5-dimensional gravity scale are obtained depending on collision energy and integrated luminosity of the muon colliders.

S. C. İnan, A. V. Kisselev

2023-01-20T14:01:53Z

http://arxiv.org/abs/2301.08585v3

# Probe of a Randall-Sundrum-like model from muon pair production at high energy muon collider ###### Abstract We have examined \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) and \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) collisions at future high energy muon colliders in the framework of the Randall-Sundrum-like model with a small curvature of space-time. The collision energies of 3 TeV, 14 TeV and, 100 TeV are addressed. Both differential and total cross sections are calculated, and excluded bounds on a 5-dimensional gravity scale are obtained depending on collision energy and integrated luminosity of the muon collider. ## 1 Introduction The Standard Model (SM) has been proven in a lot number of collider experiments. Nevertheless, we are still searching for solutions for many problems that SM cannot give a satisfactory solution. One of such problem is the so-called hierarchy problem which means the large energy gap between the electroweak scale and gravity scale. The most elegant answer to this phenomenon has been given in the framework of the Randall-Sundrum (RS) model [1] which is based on a 5D theory with one extra dimension compactified in an orbifold \(S_{1}/Z_{2}\). The main parameters of the RS model are the compactification radius \(r_{c}\) and AdS\({}_{5}\) curvature parameter \(k\) (hereinafter referred to as the _curvature_\(k\)). The model predicts Kaluza-Klein (KK) gravitons which are heavy resonances with masses around the TeV scale. The most stringent limits on KK graviton masses come from the LHC searches for heavy resonances. The experimental limits depend on a ratio \(k/M_{P}\), where \(M_{P}\) is the Planck mass. The CMS collaboration have excluded KK graviton masses below 2.3 to 4.0 TeV for the diphoton final state [2]. For the dilepton final state the CMS have excluded the RS graviton masses in the region 2.47-4.78 TeV [3]. The best lower limit of the ATLAS collaboration, 4.6 TeV, has been obtained in searching for the diphoton final state [4]. In papers [5, 6] the Randall-Sundrum-like model with a small curvature of the 5-dimensional space-time (RSSC model) has been proposed. In particular, a general solution for the warped metric has been obtained [7]. In contrast to the original RS model, the RSSC model has an almost continuous graviton mass spectrum which is similar to the spectrum of the ADD model [8]-[10], if \(k\ll M_{P}\). Thus, the above mentioned experimental bounds are not applied to the RS scenario with a small value of \(k\). A probe of the RSSC model at the LHC can be found in [11, 12]. A detailed comparison of the RSSC model with the RS model is given in Section 2. In the present paper, we intend to examine the RSSC model through the \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) and \(\mu^{+}\mu^{-}\rightarrow\mu^{+}\mu^{-}\) processes at a future muon collider. The idea of the muon collider was proposed by F. Tikhonin and G. Budker in the late 1960's [13, 14], and it was also discussed in the early 1980's [15, 16]. At present, a great physical potential of the muon collider for collisions of elementary particles at very high energies is being actively examined. Its advantage lies in the fact that muons can be accelerated in a ring without limitation from synchrotron radiation compared to linear or circular electron-positron colliders [17]-[22]. For instance, the muon collider may provide a determination of the electroweak couplings of the Higgs boson which is significantly better than what is considered attainable at other future colliders [23]-[29]. Interest in designing and building a muon collider is also based on its capability of probing the physics beyond the SM. In a number of recent papers searches for SUSY particles [30], WIMPs [31], vector boson fusion [32], leptoquarks [33], lepton flavor violation [34], and physics of \((g-2)_{\mu}\)[35] at the muon colliders are presented. For more details on a spectacular opportunity of the muon collider in the direct exploration of the energy frontier, see [36]. In the \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) scattering one pair of the outgoing muons with large transverse momenta and large dimuon invariant mass is detected, while the other two scattered muons escape a detector. Our goal is to obtain bounds on the 5-dimensional gravity scale \(M_{5}\) which can be probed at TeV and multi-TeV muon colliders. The gravity contribution to this process comes from the subprocess \(VV\to G\to\mu^{+}\mu^{-}\), where \(V\) is the \(\gamma\) or \(Z\) boson, \(G\) is the KK graviton, and a summation over all KK gravitons is assumed. We will also study the \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) scattering, taking into account contributions from \(s\)- and \(t\)-channel graviton exchanges, to derive the bounds on \(M_{5}\). Note that the processes we are interested in can be easily distinguished experimentally from each other, since they have quite different distributions in invariant mass of the detected dimuon pair. The paper is organized as follows. In the next section, the detailed description of the RSSC model is presented. The production of four muons via vector boson fusion at the muon collider is examined in section 3. The bounds on 5-dimensional Planck scale \(M_{5}\) are obtained. In section 4 we study the \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) process and we calculate the values of \(M_{5}\) which can be probed at the muon collider. ## 2 Model of warped extra dimension with small curvature In this section, we describe the RSSC model in detail and compare it with the original RS model. The RS scenario with one extra dimension and two branes [1] was proposed as an alternative to the ADD scenario with large flat extra dimensions [8]-[10]. It has the following background warped metric \[ds^{2}=e^{-2\sigma(y)}\,\eta_{\mu\nu}\,dx^{\mu}\,dx^{\nu}-dy^{2}\;, \tag{1}\] where \(\eta_{\mu\nu}\) is the Minkowski tensor with the signature \((+,-,-,-)\), \(y\) is an extra coordinate, and \(\sigma(y)\) is the warp factor. The periodicity condition \(y=y+2\pi r_{c}\) is imposed, and the points \((x_{\mu},y)\) and \((x_{\mu},-y)\) are identified. Thus, we have a model of gravity in a slice of the AdS\({}_{5}\) space-time compactified to the orbifold \(S^{1}/Z_{2}\). This orbifold has two fixed points, \(y=0\), and \(y=\pi r_{c}\) There are two branes located at these points (called Planck and TeV brane, respectively). The SM fields are confined to the TeV brane. The classical action of the RS model is given by [1] \[S = \int\!\!d^{4}x\!\!\int_{-\pi r_{c}}^{\pi r_{c}}\!\!\!dy\,\sqrt{G}\,(2 \bar{M}_{5}^{3}{\cal R}-\Lambda) \tag{2}\] \[+ \int\!\!d^{4}x\sqrt{|g^{(1)}|}\,({\cal L}_{1}-\Lambda_{1})+\int\! \!d^{4}x\sqrt{|g^{(2)}|}\,({\cal L}_{2}-\Lambda_{2})\;,\] where \(G_{MN}(x,y)\) is the 5-dimensional metric, with \(M,N=0,1,2,3,4\), \(\mu=0,1,2,3\). The quantities \[g^{(1)}_{\mu\nu}(x)=G_{\mu\nu}(x,y=0)\;,\quad g^{(2)}_{\mu\nu}(x)=G_{\mu\nu}(x,y=\pi r_{c}) \tag{3}\] are induced metrics on the branes, \({\cal L}_{1}\) and \({\cal L}_{2}\) are brane Lagrangians, \(G=\det(G_{MN})\), \(g^{(i)}=\det(g^{(i)}_{\mu\nu})\). The parameter \(\bar{M}_{5}\) is a _reduced_ 5-dimensional Planck scale related to the fundamental gravity scale \(M_{5}\), namely, \(\bar{M}_{5}=M_{5}/(2\pi)^{1/3}\). The parameter \(\Lambda\) is a 5-dimensional cosmological constant, and \(\Lambda_{1,2}\) are brane tensions. For the first time, the solution for \(\sigma(y)\) in (1) has been obtained in [1], \[\sigma_{\rm RS}(y)=k|y|\;, \tag{4}\] where \(k\) is a parameter with a dimension of mass. It defines the curvature of the 5-dimensional space-time. Later on in [7] the generalized solution for \(\sigma(y)\) was derived \[\sigma(y)=\frac{kr_{c}}{2}\left[\left|{\rm Arccos}\left(\cos\frac{y}{r_{c}} \right)\right|-\left|\pi-{\rm Arccos}\left(\cos\frac{y}{r_{c}}\right)\right| \right]+\frac{\pi\,|k|r_{c}}{2}-C\;, \tag{5}\] where \(C\) is a \(y\)-independent quantity. Note that the brane tensions obey the fine-tuning relations \[\Lambda=-24\bar{M}_{5}^{3}k^{2}\;,\quad\Lambda_{1}=-\,\Lambda_{2}=24\bar{M}_ {5}^{3}k\;. \tag{6}\] Here \({\rm Arccos}({\rm z})\) is a principal value of the multivalued inverse trigonometric function \({\rm arccos}(z)\). Let us underline that the generalized solution (5) (i) obeys the orbifold symmetry \(y\to-y\); (ii) makes the jumps of \(\sigma^{\prime}(y)\) on both branes; (iii) has explicit symmetry with respect to the branes. More details can be found in [7]. By taking \(C=0\) in (5), we get the RS model (4), while taking \(C=\pi kr_{c}\), we come to the RS-like scenario with the small curvature of the space-time (RSSC model, see [5]-[7]). It is worth to remind the main features of the RSSC model in comparison with those of the RS model. The interactions of the Kaluza-Klein (KK) gravitons \(h^{(n)}_{\mu\nu}\) with the SM fields on the TeV brane are given by the effective Lagrangian density \[{\cal L}_{\rm int}=-\frac{1}{\bar{M}_{\rm Pl}}\,h^{(0)}_{\mu\nu}(x)\,T_{\alpha \beta}(x)\,\eta^{\mu\alpha}\eta^{\nu\beta}-\frac{1}{\Lambda_{\pi}}\sum_{n=1}^ {\infty}h^{(n)}_{\mu\nu}(x)\,T_{\alpha\beta}(x)\,\eta^{\mu\alpha}\eta^{\nu \beta}\, \tag{7}\] were \(\bar{M}_{\rm Pl}=M_{\rm Pl}/\sqrt{8\pi}\) is the reduced Planck mass, \(T^{\mu\nu}(x)\) is the energy-momentum tensor of the SM fields. The coupling constant is equal to \[\Lambda_{\pi}=\bar{M}_{5}\sqrt{\frac{\bar{M}_{5}}{k}}\;. \tag{8}\] The hierarchy relation looks like \[\bar{M}_{\rm Pl}^{2}=\frac{\bar{M}_{5}^{3}}{k}\left[e^{2\pi kr_{c}}-1\right]\;. \tag{9}\] To compare, in the original RS model it is defined as \(\bar{M}_{\rm Pl}^{2}=(\bar{M}_{5}^{3}/k)\left[1-e^{-2\pi kr_{c}}\right]\). It usually assumed that \(k\pi r_{c}\gg 1\). The masses of the KK gravitons are proportional to the curvature \(k\)[6] \[m_{n}=x_{n}k\;,\quad n=1,2,\ldots\;, \tag{10}\] where \(x_{n}\) are zeros of the Bessel function \(J_{1}(x)\). Should we take \(k\ll\bar{M}_{5}\sim 1\) TeV, the mass splitting \(\Delta m\) will be very small, \(\Delta m\simeq\pi k\), and we come to an almost continuous mass spectrum, similar to the mass spectrum of the ADD model [8]. On the contrary, in the RS model the gravitons are heavy resonances with masses above one-few TeV. As was shown in a number of phenomenological papers on the RSSC model [11, 12], the cross sections weakly depend on the parameter \(k\), if \(k\ll\bar{M}_{5}\). That is why, in what follows we will put \(k=1\) GeV. Production of two muon pairs in muon collisions Let us consider the process \(\mu^{-}\mu^{+}\to\mu^{-}V_{1}V_{2}\mu^{+}\to 2(\mu^{+}\mu^{-})\) shown in Fig. 1. Our goal is to estimate a contribution of the KK gravitons to the gauge boson fusion \(VV\to l^{-}l^{+}\) in the framework of the RSSC model described in the previous section. The amplitude of this subprocess is defined as \(M=M_{\rm SM}+M_{\rm KK}\), where \(M_{\rm SM}\) is the SM term, and \(M_{\rm KK}\) is given by the sum of \(s\)-channel KK gravitons \[M_{KK}=\frac{1}{2\Lambda_{\pi}^{2}}\sum_{n=1}^{\infty}\left[\bar{u}(p_{1}) \Gamma_{2}^{\mu\nu}v(p_{2})\,\frac{B_{\mu\nu\alpha\beta}}{s-m_{n}^{2}+i\,m_{n} \Gamma_{n}}\,\Gamma_{1}^{\alpha\beta\rho\sigma}e_{\rho}(k_{1})e_{\sigma}(k_{2} )\right]. \tag{11}\] Here \(k_{1},k_{2}\), \(p_{1},p_{2}\) and \(e_{\rho}(k_{1})\), \(e_{\sigma}(k_{2})\) are, respectively, incoming photon momenta, outgoing lepton momenta and polarization vectors of photons. \(\Gamma_{n}\) is the total width of the graviton with the mass \(m_{n}\). The coherent sum in (11) is over all massive KK modes. The Feynman rules for the KK graviton were derived in [37, 38] (see also [39]). In particular, the \(KK\)-\(VV\) vertex looks like \[\Gamma_{1}^{\alpha\beta\rho\sigma}=-\frac{i}{2}\left\{\left[m_{V}^{2}+(k_{1} \cdot k_{2})\right]C^{\alpha\beta\rho\sigma}+D^{\alpha\beta\rho\sigma}\right\}\,, \tag{12}\] Figure 1: The Feynman diagrams describing contribution of the KK graviton \(G\) to the collision of two vector bosons \(V_{1},V_{2}=\gamma\) or \(Z\), with two outgoing charged leptons at the muon collider. where \[C^{\alpha\beta\rho\sigma} =\eta^{\alpha\rho}\eta^{\beta\sigma}+\eta^{\alpha\sigma}\eta^{\beta \rho}-\eta^{\alpha\beta}\eta^{\rho\sigma}\:, \tag{13}\] \[D^{\alpha\beta\rho\sigma} =\eta^{\alpha\beta}k_{1}^{\sigma}k_{2}^{\rho}-(\eta^{\alpha\sigma }k_{1}^{\beta}k_{2}^{\rho}+\eta^{\alpha\rho}k_{1}^{\sigma}k_{2}^{\beta}-\eta^ {\rho\sigma}k_{1}^{\alpha}k_{2}^{\beta})\] \[-(\eta^{\beta\sigma}k_{1}^{\alpha}k_{2}^{\rho}+\eta^{\beta\rho}k_ {1}^{\sigma}k_{2}^{\alpha}-\eta^{\rho\sigma}k_{1}^{\beta}k_{2}^{\alpha})\;. \tag{14}\] The \(KK\)-\(l^{-}l^{+}\) vertex is defined as \[\Gamma_{2}^{\mu\nu}=-\frac{i}{8}\left[\gamma^{\mu}(p_{1}^{\nu}-p_{2}^{\nu})+ \gamma^{\nu}(p_{1}^{\mu}-p_{2}^{\mu})\right]\:. \tag{15}\] Finally, \(B_{\mu\nu\alpha\beta}\) in (11) is a tensor part of the KK graviton propagator. Its explicit expression was derived in [37, 38]. We can safely omit terms in \(B_{\mu\nu\alpha\beta}\) which give zero contribution to eq. (11). Then we find \[B_{\mu\nu\alpha\beta}=\eta_{\mu\alpha}\eta_{\nu\beta}+\eta_{\mu\beta}\eta_{\nu \alpha}-\frac{2}{3}\,\eta_{\mu\nu}\eta_{\alpha\beta}\;. \tag{16}\] The \(s\)-channel contribution of the KK gravitons is equal to \[{\cal S}(s)=\frac{1}{\Lambda_{\pi}^{2}}\sum_{n=1}^{\infty}\frac{1}{s-m_{n}^{2 }+i\,m_{n}\Gamma_{n}}\:. \tag{17}\] This sum has been calculated in ref. [40], \[{\cal S}(s)=-\frac{1}{4\bar{M}_{5}^{3}\sqrt{s}}\;\frac{\sin(2A)+i\sinh(2 \varepsilon)}{\cos^{2}\!A+\sinh^{2}\!\varepsilon}\;, \tag{18}\] where \[A=\frac{\sqrt{s}}{k}\;,\quad\varepsilon=0.045\left(\frac{\sqrt{s}}{\bar{M}_{ 5}}\right)^{\!3}. \tag{19}\] The squared amplitude of the subprocess \(VV\to l^{-}l^{+}\) is a sum of three terms, \[|M|^{2}=|M_{\rm SM}|^{2}+|M_{\rm KK}|^{2}+|M_{\rm int}|^{2}\;, \tag{20}\] where \(M_{\rm SM}\) denotes the SM amplitude, while \(M_{\rm KK}\) and \(M_{\rm int}\) denote pure KK graviton and interference terms. In [39] the quantities \(|M_{\rm SM}(\gamma\gamma\to l^{-}l^{+})|^{2}\), \(|M_{\rm KK}(\gamma\gamma\to l^{-}l^{+})|^{2}\), and \(|M_{\rm int}(\gamma\gamma\to l^{-}l^{+})|^{2}\) were calculated for _massless_ leptons. The results of our calculations of the squared amplitudes \(|M(VV\to l^{-}l^{+})|^{2}\) for _nonzero_\(m_{l}\) and \(m_{V}\) (\(V=\gamma,Z\)) are presented in Appendix A. The virtual KK graviton production should lead to deviations from the SM predictions in a magnitude of the cross section. The cross section of our process \(\mu^{-}\mu^{+}\to\mu^{-}V_{1}V_{2}\mu^{+}\to 2(\mu^{+}\mu^{-})\) is defined by the formula \[d\sigma=\int\limits_{\tau_{\rm min}}^{\tau_{\rm max}}\!d\tau\!\!\int\limits_{x_ {\rm min}}^{x_{\rm max}}\!\!\frac{dx}{x}\,\sum\limits_{V_{1},V_{2}=\gamma,Z_{T},Z_{L}}\!\!\!f_{V_{1}/\mu^{+}}(x,Q^{2})f_{V_{2}/\mu^{-}}(\tau/x,Q^{2})\,d\hat{ \sigma}(V_{1}V_{2}\to\mu^{+}\mu^{-})\;. \tag{21}\] Here \[x_{\rm max}=1-\frac{m_{\mu}}{E_{\mu}}\;,\;\tau_{\rm max}=\left(1-\frac{m_{\mu }}{E_{\mu}}\right)^{2},\;x_{\rm min}=\tau/x_{\rm max}\;,\;\tau_{\rm min}=\frac {p_{\perp}^{2}}{E_{\mu}^{2}}\;, \tag{22}\] and \(p_{\perp}\) is the transverse momenta of the outgoing photons. The boson distributions inside the muon beam, \(f_{\gamma/\mu^{\pm}}(x,Q^{2})\), \(f_{Z_{T}/\mu^{\pm}}(x,Q^{2})\), and \(f_{Z_{L}/\mu^{\pm}}(x,Q^{2})\) are [41] \[f_{\gamma/\mu^{\pm}}(x,Q^{2})=\frac{\alpha}{2\pi}\frac{1+(1-x)^{2}}{x}\ln\frac {Q^{2}}{m_{\mu}^{2}}\;, \tag{23}\] and [42, 43] \[f_{Z_{T}/\mu^{\pm}}(x,Q^{2})=\frac{\alpha_{Z}^{\pm}}{2\pi}\frac{ 1+(1-x)^{2}}{x}\ln\frac{Q^{2}}{m_{Z}^{2}}\;,\] \[f_{Z_{L}/\mu^{\pm}}(x,Q^{2})=\frac{\alpha_{Z}^{\pm}}{\pi}\frac{ (1-x)}{x}\;, \tag{24}\] where \[\alpha_{Z}^{\pm}=\frac{\alpha}{(\cos\theta_{W}\sin\theta_{W})^{2}}\left[(g_{V }^{\pm})^{2}+(g_{A}^{\pm})^{2}\right], \tag{25}\] \(g_{V}^{\pm}=-1/4\mp\sin^{2}\theta_{W}\), \(g_{A}^{\pm}=1/4\), and \(m_{\mu}\) is the muon mass. The variable \(x\) in (23), (24) is the ratio of the boson energy and energy of the incoming muon \(E_{\mu}\). Note that the \(Z\) boson has different distributions for its transverse (\(T\)) and longitudinal (\(L\)) polarizations (24). The differential cross section of the subprocess \(V_{1}V_{2}\to\mu^{+}\mu^{-}\), where \(V_{1,2}=\gamma\) or \(Z\), is a sum of helicity amplitudes squared \[\frac{d\hat{\sigma}}{d\Omega}=\frac{1}{64\pi^{2}\hat{s}}\sum\limits_{\lambda_ {1},\lambda_{2},\lambda_{3},\lambda_{4}}|M_{\lambda_{1}\lambda_{2}\lambda_{3} \lambda_{4}}^{V_{1}V_{2}}|^{2}, \tag{26}\] where \(\sqrt{\hat{s}}\) is a collision energy of this subprocess, and \(\lambda_{1,2}\) (\(\lambda_{3,4}\)) are boson (muon) helicities. In boson distributions (23), (24) we put \(Q^{2}=\hat{s}\), where \(\sqrt{\hat{s}}=2E_{\mu}\sqrt{\tau}\) is the invariant energy of the subprocess \(V_{1}V_{2}\rightarrow\mu^{+}\mu^{-}\). As it was mentioned in [44], the scattering angle for high energy initial muons is peaked near \(\theta_{\mu}\approx 0.02^{\circ}-1.2^{\circ}\). These very forward muons would most likely escape a muon detector away from colliding beams. Thus, only muons produced in the boson fusion (as those shown in Fig. 1) will be detected. We apply the cuts to the final muons, \(p_{t}>50\) GeV, \(|\eta|<2.5\). The main purpose of these cuts is to ensure that only two muons are detected in the final state. As was already mentioned at the end of section 2, we take \(k=1\) GeV. The results of our numerical calculations of the differential cross sections for the \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) scattering at the future muon collider are presented in Fig. 2. The predictions for three collision invariant energies of the muon collider are shown. As one can see, for each energy the cross sections rise as the invariant mass of the detected muons grows, while the SM cross sections decrease rapidly with an increase of \(m_{\mu^{+}\mu^{-}}\). We have also calculated the differential cross sections via transverse momentum of the detected muons, see Fig. 3. The total cross sections as functions of the minimal invariant mass of two detected muons at the muon collider \(m_{\mu^{+}\mu^{-},\min}\) are shown in Fig. 4. The cross sections strongly depend on the fundamental gravity scale \(\bar{M}_{5}\). If \(\bar{M}_{5}=1\) TeV, the cross section exceeds the SM one for all three collision energies. For larger values of \(\bar{M}_{5}\) the total cross section strongly dominates over the SM cross section for \(\sqrt{s}=14\) TeV and \(\sqrt{s}=100\) TeV. All this enables us to derive the excluded bounds on the 5-dimensional reduced Planck scale \(\bar{M}_{5}\). To derive them, we apply the following formula for the statistical significance \(SS\)[45] \[SS=\sqrt{2[(S-B\,\ln(1+S/B)]}\;, \tag{27}\] where \(S\) is the number of signal events and \(B\) is the number of background (SM) events. We define the regions \(SS\leqslant 1.645\) as the regions that can be excluded at the 95% C.L. To reduce the SM background, we used the cuts \(m_{\mu^{-}\mu^{+}}>1\) TeV, \(m_{\mu^{-}\mu^{+}}>5\) TeV, and \(m_{\mu^{-}\mu^{+}}>50\) TeV for the colliding energy of 3 TeV, 14 TeV, and 100 TeV, respectively. The results are shown in Fig. 5. Our best limits for \(\sqrt{s}=3\) TeV, 14 TeV and 100 TeV are \(\bar{M}_{5}=3.8\) TeV, 13.1 TeV, and 106.4 TeV, respectively. ## 4 Production of one muon pair in muon collisions As was said in the previous section, we expect that in the \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) process only two final muons are detected, while two scattered muons escape the detector. In the process \(\mu^{-}\mu^{+}\to\mu^{+}\mu^{-}\) two outgoing muons with high transverse momenta are also detected. However, in such a case the invariant mass of the dimuon system \(m_{\mu^{+}\mu^{-}}\) is fixed and equal to the collision energy \(\sqrt{s}\), that does not occur for the \(\mu^{-}\mu^{+}\to 2(\mu^{+}\mu^{-})\) scattering. That is why one can easily discriminate between these two process experimentally by measuring the invariant mass of the detected muon pair. The virtual KK graviton exchanges have to give a contribution to the cross sections of the \(\mu^{-}\mu^{+}\to\mu^{+}\mu^{-}\) scattering. It is shown in Fig. 6. The analytical Figure 2: The differential cross sections for the process \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) via invariant mass of two detected muons at the muon collider. The left, middle and right panels correspond to the colliding energy of 3 TeV, 14 TeV, and 100 TeV. The curves (from the top down) correspond to \(\bar{M}_{5}=1\) TeV, \(\bar{M}_{5}=2\) TeV, and \(\bar{M}_{5}=3\) TeV, respectively. The SM cross sections (low curves) are also shown. expressions for amplitudes squared of this collision are given in Appendix B. Using them we have calculated the differential cross sections for the \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) scattering at the muon collider depending on transverse momentum of the final muons \(p_{t}\), taking into account gravity contribution. Our result are presented in Fig. 7 for three values of the collision energy \(\sqrt{s}\) and different values of the reduced 5-dimensional Planck scale \(\bar{M}_{5}\). As we can see, for \(\sqrt{s}=14\) TeV and \(\sqrt{s}=100\) TeV, the cross section significantly dominates the SM one, especially for large \(p_{t}\). It is worth to compare this figure with the \(p_{t}\)-distribution in Fig. 3. The oscillations of the curves in Fig. 3 originate from the function \(S(s)\) (18) which describes the \(s\)-channel contribution of all KK gravitons, since the invariant energy of the detected dimuon pair is not a constant. On the other hand, in the process \(\mu^{-}\mu^{+}\to\mu^{+}\mu^{-}\) the invariant energy of the dimuon pair is fixed, and we have no oscillations. The differential cross sections integrated in \(p_{t}\) from the minimal transverse momentum of the detected muons \(p_{t,\rm{min}}\) are presented in Fig. 8. As before, we have calculated the excluded bounds on \(\bar{M}_{5}\) which can be probed in the process \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) depending on Figure 3: The differential cross sections for the process \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) via transverse momentum of the detected muons at the muon collider. of the future muon collider, see Fig. 9. We have used eq. (27) for the statistical significance. In doing so, the cuts \(p_{t,\rm min}=0.5\) TeV, \(p_{t,\rm min}=2.5\) TeV, and \(p_{t,\rm min}=25\) TeV were applied for the 3 TeV, 14 TeV, and 100 TeV center-of-mass energies, respectively. We see that in the process \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) the scales up to \(\bar{M}_{5}=3.85\) TeV, 17.8 TeV and 126.3 TeV can be probed for \(\sqrt{s}=3\) TeV, 14 TeV, and 100 TeV, respectively. We conclude that these limits on \(\bar{M}_{5}\) are stronger than the limits obtained in the previous section for the \(\mu^{-}\mu^{+}\to 2(\mu^{+}\mu^{-})\) scattering. ## 5 Conclusions We have examined two collisions at future TeV and multi-TeV muon colliders in the Randall-Sundrum-like model with the small curvature (RSSC model) [5, 6]. It is the model with one extra dimension and warped metric whose 5-dimensional space-time curvature \(k\) is about one GeV. The other main parameter of the RSSC model, the 5-dimensional Planck scale \(\bar{M}_{5}\), is equal to (larger than) one TeV. Figure 4: The total cross sections for the process \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\) via minimal invariant mass of two detected muons at the muon collider \(m_{\mu^{+}\mu^{-},\rm min}\). We have studied the \(\mu^{-}\mu^{+}\to 2(\mu^{+}\mu^{-})\) scattering first. The collision goes via the \(VV\to\mu^{-}\mu^{+}\) scattering, where \(V=\gamma,Z\). For this scattering, the analytical expressions for the squared amplitudes, including the gravity, SM and, interference terms, are derived for the first time for _massive_ leptons. They are presented in Appendix A. Then the differential cross sections depending on the invariant mass of the detected muons \(m_{\mu^{+}\mu^{-}}\) are calculated for three values of the reduced 5-dimensional Planck scale \(\bar{M}_{5}\) for 3 TeV, 14 TeV and 100 TeV muon colliders. The total cross section is calculated as a function of the minimal value of \(m_{\mu^{+}\mu^{-}}\). As a result, the excluded bounds on the scale \(\bar{M}_{5}\) are obtained. They are \(\bar{M}_{5}=3.80\) TeV, 13.1 TeV and 106.4 TeV, for the collision energy of \(\sqrt{s}=3\) TeV, 14 TeV and 100 TeV, respectively. The \(\mu^{-}\mu^{+}\to\mu^{+}\mu^{-}\) scattering is also studied. As in the previous case, we have calculated the gravity, SM and interference squared amplitudes analytically, see Appendix B. It enabled us to estimate numerically the differential cross sections as functions of the transverse momenta of the outgoing muons. The total cross sections are also calculated. Finally, the excluded bounds on Figure 5: The excluded bounds on the reduced fundamental gravity scale \(\bar{M}_{5}\) via integrated luminosity of the muon collider for the process \(\mu^{+}\mu^{-}\to 2(\mu^{+}\mu^{-})\). The left, middle and right panels correspond to the colliding energy of 3 TeV, 14 TeV, and 100 TeV. the main parameter of the RSSC model, the scale \(\bar{M}_{5}\), have been obtained. We have shown that the values of \(\bar{M}_{5}=3.85\) TeV, 17.8 TeV and 126.3 TeV can be probed at 3 TeV, 14 TeV, and 100 TeV muon colliders. Let us remember that \(\bar{M}_{5}=M_{5}/(2\pi)^{1/3}\approx 0.54M_{5}\), where \(M_{5}\) is the fundamental 5-dimensional gravity scale \(M_{5}\) in the RSSC model. It means that the bounds on the scale \(M_{5}\) are approximately twice stronger. Let us stress that our bounds on \(\bar{M}_{5}\) should not be directly compared with the current experimental bound on the 5-dimensional Planck scale of the original RS model [1], since the mass spectra of the KK gravitons and, correspondingly, experimental signatures are quite different in the RSSC and RS models [7]. ## Appendix A. Squared amplitudes for \(VV\to l^{-}l^{+}\) scattering Our calculations give the following analytical expressions for the squared amplitudes for the \(\gamma\gamma\to l^{-}l^{+}\) collision in eq. (20) \[|M_{\rm SM}|^{2} =\frac{8e^{4}}{(t-m_{l}^{2})^{2}(s+t-m_{l}^{2})^{2}}[-34m_{l}^{8}+ m_{l}^{6}(60s+64t)\] \[-m_{l}^{4}(31s^{2}+52st+28t^{2})+m_{l}^{2}s(s^{2}-2st-4t^{2})\] \[-t(s+t)(s^{2}+2st+2t^{2})]\;,\] (A.1) \[|M_{\rm KK}|^{2} =-\frac{1}{8}|S(s)|^{2}[2m_{l}^{8}-8m_{l}^{6}t+m_{l}^{4}(s^{2}+4st+12t ^{2})-2m_{l}^{2}t(s+2t)^{2}\] \[+t(s+t)(s^{2}+2st+2t^{2})]\;,\] (A.2) \[|M_{\rm int}|^{2} =-\frac{e^{2}[S(s)+S^{\star}(s)]}{2(t-m_{l}^{2})(s+t-m_{l}^{2})}[- 2m_{l}^{8}+m_{l}^{6}(3s+4t)+m_{l}^{4}s(3s-4t)\] \[-m_{l}^{2}(s^{3}+2s^{2}t+3st^{2}+4t^{3})+t(s+t)(s^{2}+2st+2t^{2})]\;,\] (A.3) where \(s\), \(t\) are Mandelstam variables, \(m_{l}\) is the lepton mass, and \(S(s)\) is defined in the text (17)-(19). If we take \(m_{l}=0\) we get known results obtained in [39]. Figure 7: The differential cross sections for the process \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) via transverse momentum of the detected muons at the muon collider. The left, middle and right panels correspond to the colliding energy of 3 TeV, 14 TeV, and 100 TeV. The curves (from the top down) correspond to \(\bar{M}_{5}=1\) TeV, \(\bar{M}_{5}=2\) TeV, and \(\bar{M}_{5}=3\) TeV, respectively. The SM cross sections (low curves) are also shown. Figure 8: The total cross sections for the process \(\mu^{+}\mu^{-}\to\mu^{+}\mu^{-}\) via minimal transverse momentum of the outgoing muons \(p_{t,\min}\). Figure 9: The excluded bounds on the reduced fundamental gravity scale \(\bar{M}_{5}\) via integrated luminosity of the muon collider for the process \(\mu^{+}\mu^{-}\rightarrow\mu^{+}\mu^{-}\). The left, middle and right panels correspond to the colliding energy of 3 TeV, 14 TeV, and 100 TeV. For the \(ZZ\to l^{-}l^{+}\) collision our calculations result in the following formulas \[|M_{\rm SM}|^{2} =\frac{g_{Z}^{4}}{(t-m_{l}^{2})^{2}(s+t-m_{l}^{2}-2m_{Z}^{2})^{2}} \{-2m_{l}^{8}[-300\cos(2\theta_{w})+184\cos(4\theta_{w})\] \[-68\cos(6\theta_{w})+17\cos(8\theta_{w})+195]\] \[+4m_{l}^{6}[-4m_{Z}^{2}(-94\cos(2\theta_{w})+59\cos(4\theta_{w})- 24\cos(6\theta_{w})\] \[+6\cos(8\theta_{w})+56)+163s+196t-8(33s+37t)\cos(2\theta_{w})\] \[+18(9s+10t)\cos(4\theta_{w})+(15s+16t)(\cos(8\theta_{w})-4\cos(6 \theta_{w}))]\] \[+m_{l}^{4}[-2m_{Z}^{4}(-164\cos(2\theta_{w})+128\cos(4\theta_{w})\] \[+23(-4\cos(6\theta_{w})+\cos(8\theta_{w})+3))\] \[+8m_{Z}^{2}(72s+65t-4(32s+27t)\cos(2\theta_{w})+(84s+68t)\cos(4 \theta_{w})\] \[+(10s+7t)(\cos(8\theta_{w})-4\cos(6\theta_{w})))-301s^{2}-436t^{ 2}-668st\] \[+4(125s^{2}+260st+156t^{2})\cos(2\theta_{w})-8(39s^{2}+78st+46t^{ 2})\cos(4\theta_{w})\] \[-(31s^{2}+52st+28t^{2})(\cos(8\theta_{w})-4\cos(6\theta_{w}))]\] \[+m_{l}^{2}[7s^{3}+50s^{2}t+92st^{2}+s(s^{2}-2st-4t^{2})(\cos(8 \theta_{w})-4\cos(6\theta_{w}))\] \[+80t^{3}-4(3s^{3}+14s^{2}t+24st^{2}+24t^{3})\cos(2\theta_{w})\] \[+8(s+2t)(s^{2}+st+3t^{2})\cos(4\theta_{w})+2m_{Z}^{2}(79s^{2}+25 2st+112t^{2}\] \[-4(31s^{2}+108st+52t^{2})\cos(2\theta_{w})+8(9s^{2}+34st+17t^{2}) \cos(4\theta_{w})\] \[+(5s^{2}+28st+16t^{2})(\cos(8\theta_{w})-4\cos(6\theta_{w})))\] \[+2m_{Z}^{4}(-263s-414t+(428s+696t)\cos(2\theta_{w})-16(16s+27t) \cos(4\theta_{w})\] \[-21(s+2t)(\cos(8\theta_{w})-4\cos(6\theta_{w})))\] \[+2m_{Z}^{6}(-156\cos(2\theta_{w})+96\cos(4\theta_{w})-36\cos(6 \theta_{w})+9\cos(8\theta_{w})+91)]\] \[-[-28\cos(2\theta_{w})+16\cos(4\theta_{w})-4\cos(6\theta_{w})+ \cos(8\theta_{w})+19]\] \[\times[4m_{Z}^{8}-4m_{Z}^{6}(s+3t)+m_{Z}^{4}(s^{2}+6st+14t^{2})-2 m_{Z}^{2}t(s+2t)^{2}\] \[+t(s+t)(s^{2}+2st+2t^{2})]\}\,\] (A.4) \[|M_{\rm KK}|^{2} =\frac{1}{288}|S(s)|^{2}\{-72m_{Z}^{8}+6m_{Z}^{6}(-40m_{l}^{2}+9s +48t)\] \[-4m_{Z}^{4}[-2m_{l}^{2}(5s+96t)+136m_{l}^{4}+9t(7s+12t)]\] \[+3m_{Z}^{2}[-80m_{l}^{6}+m_{l}^{4}(256t-14s)-4m_{l}^{2}(s^{2}+29st +68t^{2})\] \[+9s^{3}+42s^{2}t+114st^{2}+96t^{3})]-36[m_{l}^{4}-2m_{l}^{2}t+t(s+ t)]\] \[\times(2m_{l}^{4}-4m_{l}^{2}t+s^{2}+2st+2t^{2})\}\,\] (A.5) \[|M_{\rm int}|^{2} =-\frac{g_{Z}^{2}[S(s)+S^{\star}(s)]}{96(t-m_{l}^{2})(s+t-m_{l}^{2}-2m_ {Z}^{2})}\{-12m_{l}^{8}[\cos(4\theta_{w})-2\cos(2\theta_{w})]\] \[+2m_{l}^{6}[(16m_{Z}^{2}+3(3s+4t)(\cos(4\theta_{w})-2\cos(2\theta_ {w}))+6(s-2t)]\] \[+2m_{l}^{4}[-m_{Z}^{2}((9s+4t)(\cos(4\theta_{w})-2\cos(2\theta_{w }))\] \[+24s+60t)+8m_{Z}^{4}(-2\cos(2\theta_{w})+\cos(4\theta_{w})+4)+6(3s^{2} +st+6t^{2})\] \[+3s(3s-4t)(\cos(4\theta_{w})-2\cos(2\theta_{w}))]\] \[+m_{l}^{2}[4m_{Z}^{2}((2s^{2}-3st+14t^{2})(\cos(4\theta_{w})-2 \cos(2\theta_{w}))\] \[+2s^{2}+5st+46t^{2})+4m_{Z}^{4}((s-10t)(\cos(4\theta_{w})-2\cos(2 \theta_{w}))-38t)\] \[+8m_{Z}^{6}(-2\cos(2\theta_{w})+\cos(4\theta_{w})+5)\] \[-3(3s^{3}+10s^{2}t+2(s^{3}+2s^{2}t+3st^{2}+4t^{3})\] \[\times(\cos(4\theta_{w})-2\cos(2\theta_{w}))+24st(s+t))]\] \[+6[-2\cos(2\theta_{w})+\cos(4\theta_{w})+2][2m_{Z}^{8}+m_{Z}^{6}(s -8t)\] \[+m_{Z}^{4}(-s^{2}+2st+12t^{2})-m_{Z}^{2}t(s^{2}+7st+8t^{2})\] \[+t(s+t)(s^{2}+2st+2t^{2})]\}\,\] (A.6) where \(\theta_{w}\) is the Weinberg angle, \(g_{Z}=e/[\sin(\theta_{w})\cos(\theta_{w})]\) is the weak coupling constant, and \(m_{Z}\) is the mass of the \(Z\) boson. Because of conservation of helicity, in the massless limit \(m_{l}=m_{Z}=0\)\(s\)-channel graviton amplitudes squared (A.2) and (A.5) are proportional to the factor \(t(s+t)=s(\sin\theta)^{2}/4\), where \(\theta\) is the scattering angle. Finally, the SM squared amplitude for the \(\gamma Z\to l^{+}l^{-}\) collision looks like \[|M_{\rm SM}|^{2} =\frac{4g_{Z}^{4}}{(t-m_{l}^{2})^{2}(s+t-m_{l}^{2}-m_{Z}^{2})^{2}}\] \[\times\{-2m_{l}^{8}[184\cos(4\theta_{w})+17\cos(8\theta_{w})-300 \cos(2\theta_{w})\] \[-68\cos(6\theta_{w})+195]+4m_{l}^{6}[-2(59\cos(4\theta_{w})+6\cos (8\theta_{w})-94\cos(2\theta_{w})\] \[-24\cos(6\theta_{w})+56)m_{Z}^{2}+163s+196t-8(33s+37t)\cos(2 \theta_{w})\] \[+18(9s+10t)\cos(4\theta_{w})+(15s+16t)(\cos(8\theta_{w})-4\cos(6 \theta_{w}))]\] \[+m_{l}^{4}[(68\cos(2\theta_{w})+44\cos(6\theta_{w})-56\cos(4 \theta_{w})-11\cos(8\theta_{w})-25)m_{Z}^{4}\] \[+4[72s+65t-4(32s+27t)\cos(2\theta_{w})+(84s+68t)\cos(4\theta_{w})\] \[+(10s+7t)(\cos(8\theta_{w})-4\cos(6\theta_{w}))]m_{Z}^{2}-301s^{2 }-436t^{2}-668st\] \[+4(125s^{2}+260ts+156t^{2})\cos(2\theta_{w})-8(3s^{2}+78st+46t^{2} )\cos(4\theta_{w})\] \[-(31s^{2}+52st+28t^{2})(\cos(8\theta_{w})-4\cos(6\theta_{w}))]\] \[+m_{l}^{2}[7s^{3}+50s^{2}t+92st^{2}+(s^{2}-2st-4t^{2})(\cos(8 \theta_{w})\] \[-4\cos(6\theta_{w}))s+80t^{3}+(79s^{2}+252st+112t^{2}\] \[+((5(\cos(8\theta_{w})-4\cos(6\theta_{w})+11)+56\cos(4\theta_{w})\] \[-92(\cos(2\theta_{w})))m_{Z}^{2}-141s-226t+4(57s+94t)(\cos(2 \theta_{w}))\] \[-8(17s+29t)(\cos(4\theta_{w}))-11(s+2t)(\cos(8\theta_{w})-4\cos( 6\theta_{w})))m_{Z}^{2}\] \[-4(31s^{2}+108st+52t^{2})\cos(2\theta_{w})+8(9s^{2}+34st+17t^{2} )\cos(4\theta_{w})\] \[+(5s^{2}+28st+16t^{2})(\cos(8\theta_{w})-4\cos(6\theta_{w})))m_{Z} ^{2}\] \[-4(3s^{3}+14s^{2}t+24st^{2}+24t^{3})\cos(2\theta_{w})\] \[+8(s+2t)(s^{2}+st+3t^{2})\cos(4\theta_{w})]\] \[-t[16\cos(4\theta_{w})+\cos(8\theta_{w})-28\cos(2\theta_{w})-4 \cos(6\theta_{w})+19]\] \[\times(s+t-m_{Z}^{2})(s^{2}+2t^{2}+2st-2tm_{Z}^{2}+m_{Z}^{4})\}\;.\] (A.7) The contribution to the \(\gamma Z\to l^{+}l^{-}\) collision from the gravitons \(G\) is zero, since there is no \(\gamma ZG\) vertex. Note that in the limit \(m_{l}=m_{Z}=0\) all squared amplitudes depend on variables \(s\) and \(t(s+t)=tu\), where \(u\) is the Mandelstam variable. ## Appendix B. Squared amplitudes for \(l^{+}l^{-}\to l^{+}l^{-}\) scattering Here we present the result of our calculations of the squared amplitudes for the \(l^{+}l^{-}\to l^{+}l^{-}\) process (both incoming and outgoing leptons have the same flavor). The SM squared amplitude has both the \(Z\) boson and photon contributions. The latter one is given by the formula \[|M_{\rm SM}|^{2} =\frac{16e^{4}}{s^{2}t^{2}}[m_{l}^{4}(5s^{2}+11st+5t^{2})+4m_{l}^{ 2}(s+t)(s^{2}+5st+t^{2})\] \[+(s^{2}+st+t^{2})^{2}]\;,\] (B.1) where \(m_{l}\) is the lepton mass. Note that the photon contribution to \(|M_{\rm SM}|^{2}\) is dominant. That is why, we do not present (rather complicated) analytical expression for the \(Z\) boson contribution to \(|M_{\rm SM}|^{2}\). The graviton squared amplitude is defined by KK graviton exchanges in \(s\)-, and \(t\)-channels, \[|M_{\rm KK}|^{2} =\frac{1}{4608}\{|S(s)|^{2}F_{1}(s,t)+|S(t)|^{2}F_{1}(t,s)\] \[+[S(s)S(t)^{\star}+S(s)^{\star}S(t)]F_{2}(s,t)\}\;.\] (B.2) Finally, the interference term of \(|M|^{2}\) is equal to (neglecting small \(Z\) boson contribution) \[|M_{\rm int}|^{2}=-\frac{e^{2}}{24st}\{[S(s)+S(t)^{\star}]F_{3}(s,t)+[S(s)^{ \star}+S(t)]F_{3}(t,s)\}\;.\] (B.3) Here \(S(s)\) is defined by eqs. (18), (19), and the following functions are introduced \[F_{1}(s,t) =6656m_{l}^{8}+m_{l}^{6}(8576s+10752t)+m_{l}^{4}(3440s^{2}+7296t^{ 2}+10752st)\] \[+m_{l}^{2}(360s^{3}+2376s^{2}t+4320st^{2}+2304t^{3})\] \[+9s^{4}+90s^{3}t+378s^{2}t^{2}+576st^{3}+288t^{4}\;,\] (B.4) \[F_{2}(s,t) =7552m_{l}^{8}+15168m_{l}^{6}(s+t)+m_{l}^{4}(7248(s^{2}+t^{2})+14 968st)\] \[+m_{l}^{2}(1032(s^{3}+t^{3})+3690st(s+t))\] \[+36(s^{4}+t^{4})+225st(s+t)+378s^{2}t^{2}\;,\] (B.5) \[F_{3}(s,t) =m_{l}^{6}(576s+512t)+m_{l}^{4}(552s^{2}+448t^{2}+1120st)\] \[+m_{l}^{2}(86s^{3}+360s^{2}t+432st^{2}+144t^{3})\] \[+3s^{4}+21s^{3}t+45s^{2}t^{2}+48st^{3}+24t^{4}\;,\] (B.6) where \(m_{l}\) is the lepton mass. Note that \(F_{2}(s,t)=F_{2}(t,s)\).

2306.03477

Effect of a magnetic field on the thermodynamic properties of a high-temperature hadron resonance gas with van der Waals interactions

We study the behavior of a hadronic matter in the presence of an external magnetic field within the van der Waals hadron resonance gas model, considering both attractive and repulsive interactions among the hadrons. Various thermodynamic quantities like pressure ($P$), energy density ($\varepsilon$), magnetization ($\mathcal{M}$), entropy density ($s$), squared speed of sound ($c_{\rm s}^{2}$), and specific-heat capacity at constant volume ($c_{v}$) are calculated as functions of temperature ($T$) and static finite magnetic field ($eB$). We also consider the effect of baryochemical potential ($\mu_{B}$) on the above-mentioned thermodynamic observables in the presence of a magnetic field. Further, we estimate the magnetic susceptibility ($\chi_{\rm M}^{2}$), relative permeability ($\mu_{\rm r}$), and electrical susceptibility ($\chi_{\rm Q}^{2}$) which can help us to understand the system better. Through this model, we quantify a liquid-gas phase transition in the T-eB-$\mu_B$ phase space.

Bhagyarathi Sahoo, Kshitish Kumar Pradhan, Dushmanta Sahu, Raghunath Sahoo

2023-06-06T07:51:04Z

http://arxiv.org/abs/2306.03477v2

Effect of magnetic field on the optical and thermodynamic properties of a high-temperature hadron resonance gas with van der Waals interactions ###### Abstract We study the behavior of a hadronic matter in the presence of an external magnetic field within the van der Waals hadron resonance gas (VDWHRG) model, considering both attractive and repulsive interactions among the hadrons. Various thermodynamic quantities like pressure (\(P\)), energy density (\(\varepsilon\)), magnetization (\(\mathcal{M}\)), entropy density (\(s\)), squared speed of sound (\(c_{\rm s}^{2}\)), specific heat capacity at constant volume (\(c_{v}\)) are calculated as functions of temperature (\(T\)) and static finite magnetic field (\(eB\)). We also consider the effect of baryochemical potential (\(\mu_{B}\)) on the above-mentioned thermodynamic observables in the presence of a magnetic field. Further, we estimate the magnetic susceptibility (\(\chi_{\rm M}^{2}\)), relative permeability (\(\mu_{r}\)), and electrical susceptibility (\(\chi_{Q}^{2}\)) which can help us to understand the system better. With the information of \(\mu_{\rm z}\) and dielectric constant (\(\epsilon_{r}\)), we enumerate the refractive index (\(RI\)) of the system under consideration. Through this model, we quantify a liquid-gas phase transition in the T-eB-\(\mu_{B}\) phase space. pacs: ## I Introduction In the early stages of the evolution of the universe, it was supposed to be extremely hot and dense, possibly filled with a unique state of matter called Quark-Gluon Plasma (QGP). We explore the ultra-relativistic heavy-ion collisions in laboratories to probe such initial conditions. At extreme temperatures and/or baryon densities, the hadronic degrees of freedom transform into partonic degrees of freedom, resulting in QGP formation. Quantum-Chromodynamics (QCD) is the widely used theory to describe the behavior of QGP. In addition, studying its thermodynamic properties is of utmost importance to understand the behavior and evolution of hot and dense QCD matter. Various thermodynamic properties of strongly interacting nuclear matter have been estimated from the first principle lattice QCD (lQCD) approach. However, the applicability of lQCD breaks down at high baryochemical potential due to the fermion sign problem [1; 2]. An alternative to the lQCD approach at low temperatures (up to \(150\) MeV) is the Hadron Resonance Gas (HRG) model. The HRG model has been observed to agree with the lQCD results for temperatures up to \(T\simeq 140-150\) MeV at zero baryochemical potential [3; 4; 5; 6; 7; 8]. The HRG model is thus a better alternative to study the baryon-rich environments at low-temperature regimes [9; 10; 11; 12]. In an ideal HRG model [13; 14; 15; 16], the hadrons are assumed to be point-like particles with no interaction between them. However, this assumption is very simplistic and fails to describe the lQCD data at temperatures above \(T\simeq 150\) MeV, where the hadrons meltdown and the HRG model reach their limits. Although this shortcoming of the HRG model can be easily ignored while studying the thermodynamic properties, however, while estimating various charge fluctuations at higher order, the shortcomings of the HRG model are not trivial. Recently, much focus has been diverting towards an interacting hadron resonance gas model as they extend the region of agreement with lQCD data due to the interactions between the hadrons. Excluded volume hadron resonance gas (EVHRG) model assumes an eigenvolume parameter for the hadrons, which essentially mimics a repulsive interaction in the hadron gas [17; 18; 19; 20; 21; 22; 23; 24; 25; 26; 27]. Unequal sizes of different hadrons species are handled by modified excluded volume hadron resonance gas (MEVHRG) model [28; 29; 30]. Similarly, the mean-field hadron resonance gas (MFHRG) model introduces a repulsive interaction potential in the hadronic medium [31; 32; 33]. There are also various other improvements to the HRG model in literature, such as the Lorentz modified excluded volume hadron resonance gas (LMEVHRG) model [34], where the hadrons are treated as Lorentz contracted particles, and the effective thermal mass hadron resonance gas (THRG) model [35], where the hadrons gain effective mass with temperature. However, the most successful improvement to the model which explains the lQCD results is the van der Waals hadron resonance gas (VDWHRG) model [36; 37; 38; 39; 40]. This model assumes a van der Waals-type interaction between the hadrons, having both attractive and repulsive parts. The VDWHRG model effectively explains the lQCD data up to \(T\simeq 180\) MeV. From this, we can infer that van der Waals interaction does play a crucial role in the hadronic systems at high temperatures. Moreover, the VDWHRG model has been recently used to estimate various thermodynamic and transport properties [36; 39; 40], along with fluctuations of conserved charges [36], which show a good agreement with the lQCD estimations. In addition, there are several studies exploring the liquid-gas phase transition using the VDWHRG model, locating a possible critical point for the phase transition [36; 37; 39] A unique consequence of the peripheral heavy-ion collisions is that a strong transient magnetic field ( \(\sim m_{\pi}^{2}\sim 10^{18}\) G) is expected to be formed due to the motion of the spectator protons. The strength of the magnetic field may reach up to the order of \(0.1m_{\pi}^{2}\), \(m_{\pi}^{2}\), \(15m_{\pi}^{2}\) for SPS, RHIC, and LHC energies, respectively [41]. This magnetic field decays with time and can, in principle, affect the thermodynamic and transport properties of the evolving partonic and hadronic matter [41; 42; 43; 44]. The strong magnetic field, which can reach hadronic scales, has a significant effect on the transition properties and equation of state. Such intense magnetic fields are predicted to occur in compact neutron stars [45; 46] and during the early universe's electroweak transition [47; 48]. The interaction between the strong dynamics and the external magnetic field leads to exciting new phenomena, such as the chiral magnetic effect [49; 50] and a reduction of the transition temperature as the magnetic field increases [51]. Furthermore, magnetic catalysis [52] and inverse magnetic catalysis [53; 54] can affect the phase diagram of QCD matter. Thus, it is crucial to study the effect of an external magnetic field on both the deconfined and confined phases of the matter formed in high-energy collisions. Thermodynamic properties of the system, such as pressure (\(P\)), energy density (\(\varepsilon\)), entropy density (\(s\)), speed of sound (\(c_{\rm s}\)), and specific heat (\(c_{\rm v}\)) will get modified due to the effect of an external magnetic field. All these observables help us characterize the systems produced in ultra-relativistic collisions. Moreover, the system will also develop some magnetization (\(\mathcal{M}\)), which will help us to understand whether the system is diamagnetic or paramagnetic. Apart from these, the magnetic susceptibility (\(\chi_{M}^{2}\)) and magnetic permeability (\(\mu_{r}\)) are also essential observables that can give us useful information about the system under consideration [55; 56; 57; 58; 59; 60; 61; 16; 16; 17; 18; 19; 16; 19; 20; 21; 22; 23; 24; 25; 26; 27; 28; 29; 30; 31; 32; 33; 34; 35; 36; 37; 38; 39; 40; 41; 42; 43; 44; 45; 46; 47; 48; 49; 50; 51; 52; 53; 54; 55; 56; 57; 58; 59; 60; 61; 62]. With the help of magnetic permeability and electric susceptibility, one can, in principle, get an idea about the optical properties of the system. Thus, one must study the above-mentioned observables to better understand the nature and behavior of both the hadronic and partonic medium formed in peripheral heavy-ion collisions. Several works in literature concern with the study of the matter formed in ultra-relativistic collisions in the presence of a constant external magnetic field. In ref. [61], a detailed analysis of the hot and dense QCD matter in the presence of an external magnetic field has been done with the lQCD approach. The results from the SU(3) Polyakov linear-sigma model (PLSM) has also been contrasted with the existing lQCD estimations [63]. In addition, in ref. [64; 65] the authors use the HRG and EVHRG models in the presence of constant external magnetic fields to estimate the fundamental thermodynamic quantities such as pressure, energy density, and magnetization. Moreover, in ref. [16], the authors discuss the effect of external magnetic field on the correlations and fluctuations of the hadron gas. An interesting study has been conducted by assuming an away from equilibrium scenario by employing the non-extensive Tsallis statistics, and then the basic thermodynamic quantities have been estimated [66]. In the present study, we use the van der Waals hadron resonance gas model, an improved and new approach to study the hadronic medium of high-energy collisions. Furthermore, van der Waals interaction leads to a liquid-gas phase transition in the system along with a critical point. We can take advantage of this fact and study the QCD phase diagram. In literature, the QCD phase transition in the \(T-\mu_{B}\) plane has been studied extensively from various models, including the VDWHRG model [36; 39]. A similar QCD phase transition in the \(T-eB\) plane is also important to understand the QCD matter and its consequences. There are few studies where the authors have used various models to map the phase diagram. This study uses the hadron gas with van der Waals interaction and explores the possible critical point in the \(T-eB-\mu_{B}\) plane. This paper is organized as follows. The section II gives a detailed calculation of the thermodynamic observables and susceptibilities within the ambit of a VDWHRG model under an external magnetic field. In section III, we give the detailed calculation of the vacuum contribution to the thermodynamic observables due to the external magnetic field. We discuss the results in section IV and briefly summarize our work in section V. ## II Formulation The ideal HRG formalism considers hadrons to be point particles with no interactions between them. Under this formalism, the partition function of \(i\)th particle species in a Grand Canonical Ensemble (GCE) is given as [23] \[lnZ_{i}^{id}=\pm Vg_{i}\int\frac{d^{3}p}{(2\pi)^{3}}\ ln\{1\pm\exp[-(E_{i}- \mu_{i})/T]\}, \tag{1}\] where, \(T\) is the temperature of the system and \(V\) represents the volume. The notations \(g_{i}\), \(E_{i}=\sqrt{p^{2}+m_{i}^{2}}\), \(m_{i}\) and \(\mu_{i}\) are for the degeneracy, energy, mass, and chemical potential of the \(i\)th hadron, respectively. Here, \(id\) refers to the ideal. The plus and minus signs (\(\pm\)) correspond to baryons and mesons, respectively. \(\mu_{i}\) is further expanded in terms of the baryonic, strangeness, and charge chemical potentials (\(\mu_{B}\), \(\mu_{S}\) and \(\mu_{Q}\), respectively) and the corresponding conserved numbers (\(B_{i}\), \(S_{i}\) and \(Q_{i}\)) as, \[\mu_{i}=B_{i}\mu_{B}+S_{i}\mu_{S}+Q_{i}\mu_{Q}. \tag{2}\] The total Grand Canonical partition function of non-interacting hadron resonance gas is the sum of partition functions of all hadrons and resonances [13; 23], \[lnZ^{id}=\sum_{i}lnZ_{i}^{id}. \tag{3}\] The free energy density of the ideal HRG model can be written in terms of partition function as, \[f^{id}=-TlnZ^{id}. \tag{4}\] The ideal pressure is defined as the negative of free energy density, \[P^{id}=-f^{id}. \tag{5}\] The explicit form of thermodynamic pressure \(P_{i}\), energy density \(\varepsilon_{i}\), number density \(n_{i}\), and entropy density \(s_{i}\) in the ideal HRG formalism can now be obtained as, \[P_{i}^{id}(T,\mu_{i})=\pm Tg_{i}\int\frac{d^{3}p}{(2\pi)^{3}}\ ln \{1\pm\exp[-(E_{i}-\mu_{i})/T]\} \tag{6}\] \[\varepsilon_{i}^{id}(T,\mu_{i})=g_{i}\int\frac{d^{3}p}{(2\pi)^{3} }\frac{E_{i}}{\exp[(E_{i}-\mu_{i})/T]\pm 1} \tag{7}\] \[n_{i}^{id}(T,\mu_{i})=g_{i}\int\frac{d^{3}p}{(2\pi)^{3}}\frac{1}{ \exp[(E_{i}-\mu_{i})/T]\pm 1} \tag{8}\] \[s_{i}^{id}(T,\mu_{i})= \pm g_{i}\int\frac{d^{3}p}{(2\pi)^{3}}\Big{[}\ln\{1\pm\exp[-(E_{i} -\mu_{i})/T]\}\] \[\pm\frac{(E_{i}-\mu_{i})/T}{\exp[(E_{i}-\mu_{i})/T]\pm 1}\Big{]}. \tag{9}\] In the presence of a magnetic field ( for simplicity, suppose the magnetic field is pointing along z direction), the single particle energy for the charged and neutral particles is given as [64; 65; 67], \[E_{c,i}^{z}(p_{z},k,s_{z})=\sqrt{p_{z}^{2}+m_{i}^{2}+2|Q_{i}|B \bigg{(}k+\frac{1}{2}-s_{z}\bigg{)}},Q_{i}\neq 0 \tag{10}\] \[E_{n,i}(p)=\sqrt{p^{2}+m_{i}^{2}},\ \ \ \ Q_{i}=0, \tag{11}\] where, \(Q_{i}\) is the charge of the \(i^{th}\) particle and \(s_{z}\) is the component of spin \(s\) in the direction of magnetic field \(B\) and \(k\) is the Landau level. The subscripts '\(c\)' and '\(n\)' are for charged and neutral particles. In the presence of Landau level, one writes the three-dimensional integral as one-dimensional integral [68; 69], \[\int\frac{d^{3}p}{(2\pi)^{3}}=\frac{|Q|B}{2\pi^{2}}\sum_{k}\sum _{s_{z}}\int_{0}^{\infty}dp_{z}. \tag{12}\] Now, in the presence of a finite magnetic field, the free energy of the system can be written as [70; 71] \[f=\varepsilon-Ts-QB.\mathcal{M}, \tag{13}\] where, \(\mathcal{M}\) is the magnetization. Further, in the presence of finite baryochemical potential, the above equation becomes, \[f=\varepsilon-Ts-QB.\mathcal{M}-\mu n, \tag{14}\] The \(n\) is the number density. The above equation satisfies the differential relations, \[s=-\frac{\partial f}{\partial T},\ \ \ \ \ \ \ \ \ \mathcal{M}=-\frac{ \partial f}{\partial(QB)},\ \ \ \ \ \ \ \ n=-\frac{\partial f}{\partial\mu}. \tag{15}\] In general, the free energy density of the system contains contributions from both thermal and vacuum parts. \[f=f_{vac}+f_{th}, \tag{16}\] \(f_{vac}\) and \(f_{th}\) are the vacuum and thermal part of free energy density, respectively. \(f_{vac}\) is defined as the free energy density at zero temperature and finite magnetic field, and \(f_{th}\) is the free energy at finite temperature and finite magnetic field. Now, the thermal part of the thermodynamic pressure, energy density, number density, and entropy density, i.e., Eqs. (6), (7), (8), and (9) for charged particles in the presence of magnetic field can be modified using the Eq. (12), \[P_{c,i}^{id,z}(T,\mu_{i},B)=\pm\frac{Tg_{i}|Q_{i}|B}{2\pi^{2}} \sum_{k}\sum_{sz}\int_{0}^{\infty}dp_{z}\ ln\{1\pm\] \[\exp[-(E_{c,i}^{z}-\mu_{i})/T]\} \tag{17}\] \[\varepsilon_{c,i}^{id,z}(T,\mu_{i},B)=\frac{g_{i}|Q_{i}|B}{2\pi^ {2}}\sum_{k}\sum_{sz}\int dp_{z}E_{c,i}^{z}\] \[\left[\frac{1}{\exp[(E_{c,i}^{z}-\mu_{i})/T]\pm 1}\right] \tag{18}\] \[n_{c,i}^{id,z}(T,\mu_{i},B)=\frac{g_{i}|Q_{i}|B}{2\pi^{2}}\sum_{ k}\sum_{sz}\int dp_{z}\] \[\left[\frac{1}{\exp[(E_{c,i}^{z}-\mu_{i})/T]\pm 1}\right] \tag{19}\] \[s_{c,i}^{id,z}(T,\mu_{i},B)=\pm\frac{g_{i}|Q_{i}|B}{2\pi^{2}} \sum_{k}\sum_{sz}\int dp_{z}\Big{[}\ln\{1\pm\] \[\exp[-(E_{c,i}^{z}-\mu_{i})/T]\pm 1\}\Big{]}. \tag{20}\] For neutral particles, these thermodynamic variables are calculated using the Eqs. (6), (7), (8), and (9). The total pressure, energy density, and entropy density of the system are due to the sum of contributions from the charged particles and neutral particles. Now, we can use the above basic thermodynamic quantities to estimate other important observables. The specific heat of the system is defined as the thermal variation of energy density at constant volume. It is defined as, \[c_{v}=\left(\frac{\partial\varepsilon}{\partial T}\right)_{V}. \tag{21}\] The squared speed of sound is defined as the change in pressure of a system as a function of a change in energy density at constant entropy density per number density, i.e., \(s/n\). Mathematically, the adiabatic squared speed of sound is defined as, \[c_{s}^{2}=\left(\frac{\partial P}{\partial\varepsilon}\right)_{s/n}=\frac{s}{c _{v}}. \tag{22}\] In the presence of both magnetic field and chemical potential, the squared speed of sound (\(c_{s}^{2}\)) is defined as, \[c_{s}^{2}(T,\mu,QB)=\frac{\frac{\partial P}{\partial T}+\frac{\partial P}{ \partial\mu}\frac{\partial\mu}{\partial T}+\frac{\partial P}{\partial(QB)} \frac{\partial(QB)}{\partial T}}{\frac{\partial\varepsilon}{\partial T}+ \frac{\partial\varepsilon}{\partial\mu}\frac{\partial\mu}{\partial T}+\frac{ \partial\varepsilon}{\partial(QB)}\frac{\partial(QB)}{\partial T}} \tag{23}\] where, \[\frac{\partial(QB)}{\partial T}=\frac{s\frac{\partial n}{\partial T}-n\frac{ \partial s}{\partial T}}{n\frac{\partial s}{\partial(QB)}-s\frac{\partial n }{\partial(QB)}} \tag{24}\] and, \[\frac{\partial\mu}{\partial T}=\frac{s\frac{\partial n}{\partial T}-n\frac{ \partial s}{\partial T}}{n\frac{\partial s}{\partial\mu}-s\frac{\partial n}{ \partial\mu}}. \tag{25}\] A detailed derivation of the squared speed of sound in the presence of a finite baryochemical potential and an external magnetic field is given in the appendix A. The magnetization of the system can also be obtained from the following equation, \[\mathcal{M}=\frac{\varepsilon_{tot}-\varepsilon}{QB}, \tag{26}\] where, \(\varepsilon_{tot}\)\(=\)\(\varepsilon_{c,i}^{z}+\varepsilon_{n,i}\) is the energy density of the system in the presence of the magnetic field. \(\varepsilon_{c,i}^{z}\), and \(\varepsilon_{n,i}\) are the energy density of charged and neutral particles in the presence of a magnetic field, respectively. \(\varepsilon\) is the free energy density in the absence of a magnetic field. We now proceed toward the estimation of the optical properties of a hadronic system. The derivative of magnetization with respect to the magnetic field is called magnetic susceptibility and is given by, \[\chi_{M}^{2}=\frac{\partial\mathcal{M}}{\partial(QB)}=\frac{\partial^{2}P}{ \partial(QB)^{2}}. \tag{27}\] From heavy-ion collision (HIC) perspectives, fluctuations of conserved charges have comparable importance as magnetic susceptibility since they play a vital role in describing QCD phase transition. The nth-order susceptibility is defined as, \[\chi_{B/Q/S}^{n}=\frac{\partial^{n}(\frac{P}{T})}{\partial(\frac{\mu_{B}/Q/S} {T})^{n}}. \tag{28}\] The second-order susceptibility corresponding to the electric charge is called electrical susceptibility, and is given by, \[\chi_{Q}^{2}=\frac{1}{T^{2}}\frac{\partial^{2}P}{\partial\mu_{Q}^{2}} \tag{29}\] The explicit forms of \(\chi_{M}^{2}\) and \(\chi_{Q}^{2}\) are shown in appendix B and C, respectively. Now, one can, in principle be able to estimate the refractive index of a hadron gas by using the above information. To include interactions in the hadronic system, we take advantage of the van der Waals equation of state. The ideal HRG model can be modified to include van der Waals interactions between particles by the introduction of the attractive and repulsive parameters \(a\) and \(b\), respectively. This modifies the pressure and number density obtained in ideal HRG iteratively as follows [36; 37; 72] \[P(T,\mu)=P^{id}(T,\mu^{*})-an^{2}(T,\mu), \tag{30}\] where, the \(n(T,\mu)\) is the VDW particle number density given by \[n(T,\mu)=\frac{\sum_{i}n_{i}^{id}(T,\mu^{*})}{1+b\sum_{i}n_{i}^{id}(T,\mu^{*})}. \tag{31}\] Here, \(i\) runs over all hadrons and \(\mu^{*}\) is the modified chemical potential given by, \[\mu^{*}=\mu-bP(T,\mu)-abn^{2}(T,\mu)+2an(T,\mu). \tag{32}\] It is to be noted that the repulsive parameter is usually attributed to be related to the hardcore radius of the particle, \(r\), by the relation \(b=16\pi r^{3}/3\). At the same time, the VDW parameter, \(a\), represents the attractive interaction at an intermediate range. The entropy density \(s(T,\mu)\) and energy density \(\varepsilon(T,\mu)\) in VDWHRG can now be obtained as, \[s(T,\mu)=\frac{s^{id}(T,\mu^{*})}{1+bn^{id}(T,\mu^{*})} \tag{33}\] \[\varepsilon(T,\mu)=\frac{\sum_{i}\varepsilon_{i}^{id}(T,\mu^{*})}{1+b\sum_{i}n _{i}^{id}(T,\mu^{*})}-an^{2}(T,\mu) \tag{34}\] The initial form of VDWHRG excluded interactions between baryon-antibaryon pairs and in between pairs involving at least one meson [36; 37; 38; 72]. The baryon-antibaryon interactions were ignored under the assumption that annihilation processes dominate [23; 38]. Meson interactions were ignored as their inclusion led to a suppression of thermodynamic quantities and couldn't explain the lQCD data at vanishing \(\mu_{B}\) towards high temperatures [38]. The attractive and repulsive parameters, in this case, were derived either from properties of the ground state of nuclear matter [37] or by fitting the lQCD results for different thermodynamic quantities [36; 39]. A formalism including the effect of meson-meson interactions through a hardcore repulsive radius (\(r_{M}\)) [39] was developed where a simultaneous fit to the lQCD values was done to obtain the values of \(a\) and \(b\). The VDW parameters were considered to be fixed for all values of \(\mu_{B}\) and \(T\) in each of these implementations. The total pressure in the VDWHRG model is then written as [36; 37; 38; 72], \[P(T,\mu)=P_{M}(T,\mu)+P_{B}(T,\mu)+P_{\bar{B}}(T,\mu). \tag{35}\] Here, the \(P_{M}(T,\mu),P_{B(\bar{B})}(T,\mu)\) are the contributions to pressure from mesons and (anti)baryons, respectively, and are given by, \[P_{M}(T,\mu)=\sum_{i\in M}P_{i}^{id}(T,\mu^{*M}), \tag{36}\] \[P_{B}(T,\mu)=\sum_{i\in B}P_{i}^{id}(T,\mu^{*B})-an_{B}^{2}(T,\mu), \tag{37}\] \[P_{\bar{B}}(T,\mu)=\sum_{i\in B}P_{i}^{id}(T,\mu^{*B})-an_{\bar{B}}^{2}(T,\mu). \tag{38}\] Here, \(M\), \(B\), and \(\bar{B}\) represent mesons, baryons, and anti-baryons, respectively. \(\mu^{*M}\) is the modified chemical potential of mesons because of the excluded volume correction, and \(\mu^{*B}\) and \(\mu^{*B}\) are the modified chemical potentials of baryons and anti-baryons due to VDW interactions [39]. Considering the simple case of vanishing electric charge and strangeness chemical potentials, \(\mu_{Q}=\mu_{S}=0\), the modified chemical potential for mesons and (anti)baryons can be obtained from Eq. (2) and Eq. (33) as; \[\mu^{*M}=-bP_{M}(T,\mu), \tag{39}\] \[\mu^{*B(\bar{B})}=\mu_{B(\bar{B})}-bP_{B(\bar{B})}(T,\mu)-abn_{B(\bar{B})}^{2} +2an_{B(\bar{B})}, \tag{40}\] where \(n_{M}\), \(n_{B}\) and \(n_{\bar{B}}\) are the modified number densities of mesons, baryons, and anti-baryons, respectively, which are given by, \[n_{M}(T,\mu)=\frac{\sum_{i\in M}n_{i}^{id}(T,\mu^{*M})}{1+b\sum_{i\in M}n_{i} ^{id}(T,\mu^{*M})}, \tag{41}\] \[n_{B(\bar{B})}(T,\mu)=\frac{\sum_{i\in B(\bar{B})}n_{i}^{id}(T,\mu^{*B(\bar{B })})}{1+b\sum_{i\in B(\bar{B})}n_{i}^{id}(T,\mu^{*B(\bar{B})})}. \tag{42}\] For this work, the parameters in the model are taken as \(a=0.926\) GeV fm\({}^{3}\) and \(b=(16/3)\pi r^{3}\), where the hard-core radius \(r\) is replaced by \(r_{M}=0.2\) fm and \(r_{B,(\bar{B})}=0.62\) fm, respectively for mesons and (anti)baryons [39]. Now, we take the magnetic field-modified total ideal pressure, energy density, and entropy density and use them in the respective VDW equations to estimate the required thermodynamic observables. ## III Renormalization of vacuum pressure As we discussed in the previous section, the total pressure (negative of the total free energy density) of the system is due to both the thermal and vacuum components, i.e. \[P_{total}=P_{th}(T,eB)+\Delta P_{vac}(T=0,eB) \tag{43}\] where \(P_{th}(T,eB)\) is the thermal part of the pressure, which is the sum of the pressure due to both charged and neutral particles. In the presence of a magnetic field, the thermal part of the pressure for charged and neutral particles are calculated using Eqs. (17), and (6), respectively. In this section, we will calculate the vacuum contribution of pressure in the presence of an external magnetic field using a dimensional regularization method. The vacuum pressure term is ultraviolet divergent, and it requires appropriate regularization to extract meaningful physical information[64; 65; 73]. As a result, magnetic field-dependent and independent components must be distinguished using an appropriate regularization technique. In the presence of an external magnetic field, the vacuum pressure for a charged spin-\(\frac{1}{2}\) particle is given by [64; 65; 73], \[P_{\rm vac}(S=1/2,B)=\frac{1}{2}\sum_{k=0}^{\infty}g_{k}\frac{|Q|B}{2\pi}\int_ {-\infty}^{\infty}\frac{dp_{z}}{2\pi}E_{p,k}(B), \tag{44}\] where \(g_{k}=2-\delta_{k0}\) is the degeneracy of \(k^{\rm th}\) Landau level. We have added and subtracted the lowest Landau level contribution (i.e., \(k=0\)) from the above equation, and we get \[P_{\rm vac}(S=1/2,B)=\frac{1}{2}\sum_{k=0}^{\infty}2\frac{|Q|B}{2 \pi}\int_{-\infty}^{\infty}\frac{dp_{z}}{2\pi}\] \[\bigg{[}E_{p,k}(B)-\frac{E_{p,0}(B)}{2}\bigg{]}. \tag{45}\] A dimensional regularization method [74] is used to regularize the ultraviolet divergence of vacuum pressure. In \(d-\varepsilon\) dimension Eq. (45) can be written as \[P_{\rm vac}(S=1/2,B)=\sum_{k=0}^{\infty}\frac{|Q|B}{2\pi}\mu^{ \varepsilon}\int_{-\infty}^{\infty}\frac{d^{1-\varepsilon}p_{z}}{(2\pi)^{1- \varepsilon}}\] \[\bigg{[}\sqrt{p_{z}^{2}+m^{2}-2|Q|Bk}-\sqrt{p_{z}^{2}+m^{2}}\bigg{]}, \tag{46}\] In the preceding equation, \(\mu\) sets the dimension to one. The integration can be carried out using the usual \(d-\)dimensional formulae [74; 75]. \[\int_{-\infty}^{\infty}\frac{d^{d}p}{(2\pi)^{d}}\bigg{[}p^{2}+m^{2} \bigg{]}^{-A}=\frac{\Gamma[A-\frac{d}{2}]}{(4\pi)^{d/2}\Gamma[A](m^{2})^{(A- \frac{d}{2})}}. \tag{47}\] Integration of the first term in Eq. (46) gives \[I_{1}=\sum_{k=0}^{\infty}\frac{|Q|B}{2\pi}\mu^{\varepsilon}\int_ {-\infty}^{\infty}\frac{d^{1-\varepsilon}p_{z}}{(2\pi)^{1-\varepsilon}} \bigg{[}p_{z}^{2}+m^{2}-2|Q|Bk\bigg{]}^{\frac{1}{2}}\] \[=-\frac{(|Q|B)^{2}}{4\pi^{2}}\bigg{(}\frac{2|Q|B}{4\pi\mu}\bigg{)} ^{-\frac{\varepsilon}{2}}\Gamma\bigg{[}-1+\frac{\varepsilon}{2}\bigg{]} \zeta\bigg{[}-1+\frac{\varepsilon}{2},x\bigg{]}. \tag{48}\] where we denote \(x\equiv\frac{m^{2}}{2|Q|B}\). The Landau infinite sum has been illustrated in terms of the Riemann-Hurwitz \(\zeta-\)function \[\zeta[z,x]=\sum_{k=0}^{\infty}\frac{1}{[x+k]^{z}}, \tag{49}\] with the expansion [76; 77], \[\zeta\bigg{[}-1+\frac{\varepsilon}{2},x\bigg{]}\approx-\frac{1}{12}-\frac{x^ {2}}{2}+\frac{x}{2}+\frac{\varepsilon}{2}\zeta^{{}^{\prime}}(-1,x)+\mathcal{ O}(\varepsilon^{2}) \tag{50}\] and the asymptotic behavior of the derivative [76; 77], \[\zeta^{\prime}(-1,x) = \frac{1}{12}-\frac{x^{2}}{4}+\bigg{(}\frac{1}{12}-\frac{x}{2}+ \frac{x^{2}}{2}\bigg{)}\,ln(x)+\mathcal{O}(x^{-2}).\] The expansion of \(\Gamma\)-function around some negative integers is given by, \[\Gamma\bigg{[}-1+\frac{\varepsilon}{2}\bigg{]}=-\frac{2}{\varepsilon}+\gamma -1+\mathcal{O}(\varepsilon), \tag{52}\] and, \[\Gamma\bigg{[}-2+\frac{\varepsilon}{2}\bigg{]}=\frac{1}{\varepsilon}-\frac{ \gamma}{2}+\frac{3}{4}+\mathcal{O}(\varepsilon). \tag{53}\] Here, \(\gamma\) is the Euler constant. The limiting expression for natural is, \[\lim_{\varepsilon\longrightarrow 0}a^{-\varepsilon/2}\approx 1-\frac{ \varepsilon}{2}{\rm ln}(a). \tag{54}\] Eq. (48) can be written as expressed as using the expansion of the \(\Gamma\)-function and \(\zeta\)-function \[I_{1}=-\frac{(|Q|B)^{2}}{4\pi^{2}}\bigg{[}-\frac{2}{\varepsilon }+\gamma-1+{\rm ln}\bigg{(}\frac{2|Q|B}{4\pi\mu^{2}}\bigg{)}\bigg{]}\] \[\bigg{[}-\frac{1}{12}-\frac{x^{2}}{2}+\frac{x}{2}+\frac{ \varepsilon}{2}\zeta^{{}^{\prime}}(-1,x)+\mathcal{O}(\varepsilon^{2})\bigg{]} \tag{55}\] The second term in Eq. (46) can be simplified in the same way, and we obtain, \[I_{2}=\sum_{k=0}^{\infty}\frac{|Q|B}{2\pi}\mu^{\varepsilon}\int _{-\infty}^{\infty}\frac{d^{1-\varepsilon}p_{z}}{(2\pi)^{1-\varepsilon}} \bigg{[}p_{z}^{2}+m^{2}\bigg{]}^{\frac{1}{2}}\] \[=\frac{(|Q|B)^{2}}{4\pi^{2}}\bigg{[}-\frac{x}{\varepsilon}-\frac{ (1-\gamma)}{2}x+\frac{x}{2}{\rm ln}\bigg{(}\frac{2|Q|B}{4\pi\mu^{2}}\bigg{)}+ \frac{x}{2}{\rm ln}(x)\bigg{]}. \tag{56}\] Hence, the vacuum pressure in the presence of an external magnetic field becomes \[P_{\rm vac}(S=1/2,B)=\frac{(|Q|B)^{2}}{4\pi^{2}}\bigg{[}\zeta^{{}^ {\prime}}(-1,x)-\frac{2}{12\varepsilon}-\frac{(1-\gamma)}{12}\] \[-\frac{x^{2}}{\varepsilon}-\frac{(1-\gamma)}{2}x^{2}+\frac{x}{2}{ \rm ln}(x)\] \[+\frac{x^{2}}{2}{\rm ln}\bigg{(}\frac{2|Q|B}{4\pi\mu^{2}}\bigg{)} +\frac{1}{12}{\rm ln}\bigg{(}\frac{2|Q|B}{4\pi\mu^{2}}\bigg{)}\bigg{]}. \tag{57}\] Divergence is still evident in the preceding expression. As a result, we add and deduct the \(B=0\) contribution from it. To carry out the renormalization of the \(B>0\) pressure, the \(B=0\) contribution must be determined. The vacuum pressure in \(d=3-\varepsilon\) dimensions at \(B=0\) is given by \[P_{\rm vac}(S=1/2,B=0)=\mu^{\varepsilon}\int\frac{d^{3-\varepsilon }p}{(2\pi)^{3-\varepsilon}}\,(p^{2}+m^{2})^{\frac{1}{2}}\] \[=\frac{(|Q|B)^{2}}{4\pi^{2}}\bigg{(}\frac{2|Q|B}{4\pi\mu^{2}} \bigg{)}^{-\frac{\varepsilon}{2}}\Gamma\bigg{(}-2+\frac{\varepsilon}{2}\bigg{)} x^{2-\frac{\varepsilon}{2}}. \tag{58}\] Above Eq. (58) can be further simplified by using \(\Gamma\)-function expansion from Eq. (52), \[P_{\rm vac}(S=1/2,B=0) = -\frac{(|Q|B)^{2}}{4\pi^{2}}x^{2}\bigg{[}\frac{1}{\varepsilon}+ \frac{3}{4}-\frac{\gamma}{2} \tag{59}\] \[- \frac{1}{2}{\rm ln}\bigg{(}\frac{2|Q|B}{4\pi\mu^{2}}\bigg{)}-\frac {1}{2}{\rm ln}(x)\bigg{]}.\] Now, we add and subtract Eq. (59) from (57), we get the regularized pressure with the vacuum part, and the magnetic field-dependent part separated as, \[P_{\rm vac}(S=1/2,B) = P_{\rm vac}(1/2,B=0)+\Delta P_{\rm vac}(1/2,B),\] where, \[\Delta P_{\rm vac}(S=1/2,B) = \frac{(|Q|B)^{2}}{4\pi^{2}}\bigg{[}-\frac{2}{12\varepsilon}+\frac{ \gamma}{12} \tag{61}\] \[+ \frac{1}{12}{\rm ln}\bigg{(}\frac{m^{2}}{4\pi\mu^{2}}\bigg{)}+ \frac{x}{2}{\rm ln}(x)-\frac{x^{2}}{2}{\rm ln}(x)\] \[+ \frac{x^{2}}{4}-\frac{{\rm ln}(x)+1}{12}+\zeta^{{}^{\prime}}(-1,x )\bigg{]}.\] The field contribution given by the Eq. (61) is, however, divergent due to the existence of the magnetic field dependent term \(\frac{B^{2}}{\varepsilon}\)[80; 81; 82]. We eliminate this divergence by redefining field-dependent pressure contribution to include magnetic field contribution. \[\Delta P_{\rm vac}^{r}=\Delta P_{\rm vac}(B)-\frac{B^{2}}{2}. \tag{62}\] The divergences are absorbed into the renormalization of the electric charge and the magnetic field strength [64], \[B^{2}=Z_{e}B_{r}^{2};\hskip 14.226378pte^{2}=Z_{e}^{-1}e_{r}^{2}; \hskip 14.226378pte_{r}B_{r}=|Q|B, \tag{63}\] Where the electric charge renormalization constant is \[Z_{e}\bigg{(}S=\frac{1}{2}\bigg{)}=1+\frac{1}{2}e_{r}^{2}\bigg{[}- \frac{2}{12\varepsilon}+\frac{\gamma}{12}+\frac{1}{12}{\rm ln}\bigg{(}\frac{m _{*}}{4\pi\mu^{2}}\bigg{)}\bigg{]}.\] We fix \(m_{*}=m\), i.e. the particle's physical mass. Thus, the contribution of the renormalized field-dependent pressure in the absence of a pure magnetic field (\(\frac{B^{2}}{2}\)) is, \[\Delta P_{\rm vac}^{r}(S=1/2,B) = \frac{(|Q|B)^{2}}{4\pi^{2}}\bigg{[}\zeta^{{}^{\prime}}(-1,x)+ \frac{x}{2}{\rm ln}(x) \tag{65}\] \[- \frac{x^{2}}{2}{\rm ln}(x)+\frac{x^{2}}{4}-\frac{{\rm ln}(x)+1}{ 12}\bigg{]}.\] Using a similar technique, the renormalized magnetic field-dependent pressure for spin-zero and spin-one particles can be calculated. These terms are crucial in determining the magnetization of hadronic matter. The vacuum pressure is affected by the charge, mass, and spin of the particles. As a result, the total vacuum pressure of a hadron gas is calculated by adding the vacuum pressures of all particles taken into account. For spin-zero particles, the regularized vacuum pressure is, \[\Delta P_{\rm vac}^{r}(s=0,B) = -\frac{(|Q|B)^{2}}{8\pi^{2}}\bigg{[}\zeta^{{}^{\prime}}(-1,x+1/2) -\frac{x^{2}}{2}{\rm ln}(x) \tag{66}\] \[+ \frac{x^{2}}{4}+\frac{{\rm ln}(x)+1}{24}\bigg{]}.\] Similarly, for spin-one particles, \[\Delta P_{\rm vac}^{r}(s=1,B) = -\frac{3}{8\pi^{2}}(|Q|B)^{2}\bigg{[}\zeta^{{}^{\prime}}(-1,x-1/2) \tag{67}\] \[+ \frac{(x+1/2)}{3}{\rm ln}(x+1/2)\] \[+ \frac{2}{3}(x-1/2){\rm ln}(x-1/2)-\frac{x^{2}}{2}{\rm ln}(x)\] \[+ \frac{x^{2}}{4}-\frac{7}{24}({\rm ln}(x)+1)\bigg{]}.\] So, the total magnetic field-dependent vacuum pressure becomes, \[\Delta P_{\rm vac} = \Delta P_{\rm vac}^{r}(s=0,B)+\Delta P_{\rm vac}^{r}(S=1/2,B) \tag{68}\] \[+ \Delta P_{\rm vac}^{r}(s=1,B).\] After computing the total vacuum pressure, the system's vacuum magnetization can be computed as follows: \[\Delta{\cal M}_{\rm vac}=\frac{\partial(\Delta P_{\rm vac})}{ \partial(|Q|B)}. \tag{69}\] The explicit calculation of \(\Delta{\cal M}_{\rm vac}\) for spin-0, spin-1/2 and spin-1 particle are shown in appendix D. By using the formalism mentioned above in the above two sections, we estimate various thermodynamic observables for a hadron gas with van der Waals interaction. ## IV Results and discussion In the present section, we discuss the results obtained from this study. It is important to note that we obtain all the results at \(\mu_{Q}=0\) and \(\mu_{S}=0\). So the chemical potential of the system is only due to \(\mu_{B}\). We explore the effect of the magnetic field on thermodynamic observables at both zero and finite baryon chemical potential values. This study includes all hadrons and resonances of spin-0, spin-1/2, and spin-1 up to a mass cut-off of 2.25 GeV according to particle data group [78]. One can obtain the van der Waals parameters by fitting the thermodynamic quantities, such as energy density, pressure, etc., in the VDWHRG model to the available lattice QCD data at zero magnetic fields [39]. In principle, the van der Waals parameters should change in the presence of the magnetic field as well as the baryochemical potential. However, changing \(a\) and \(b\) parameters as a function of \(eB\) as well as \(\mu_{B}\) is non-trivial. We have neglected such dependencies in the current study. We calculate the thermodynamic quantities such as pressure, energy density, entropy density, specific heat, and squared speed of sound using their corresponding formulas as given in section II at zero and finite magnetic fields in the ideal HRG and VDWHRG models. In the present work, we examine two different values of magnetic fields, i.e., \(eB=0.2\) GeV\({}^{2}\) and Figure 1: (Color online) The equation of state in the ideal HRG (VDWHRG) model is shown in a solid line (dotted line). The variation (from left to right and downwards) of normalized pressure, energy density, trace anomaly, magnetization, entropy density, and squared speed of sound as functions of temperature at zero baryochemical potential (\(\mu_{B}\)= 0 GeV ), for eB =0 GeV\({}^{2}\) (magenta), eB= 0.2 GeV\({}^{2}\)(green), eB = 0.3 GeV\({}^{2}\)(blue). The lattice data for our study. In the presence of a finite magnetic field, the system's total pressure contains a contribution from both the vacuum and the thermal part, while there is no such vacuum pressure contribution for a vanishing magnetic field. So, at B\(\neq\) 0 and T=0, the system has some non-vanishing pressure called vacuum pressure [64; 65]. The vacuum pressure for spin-0, spin-1/2, and spin-1 particles is calculated using Eqs. (65), (66), and (67). It is found that the vacuum pressure is positive for spin-0, spin-1/2, and spin-1 particles. The total vacuum pressure is obtained by summing over all spin states. In Fig.1(a), we show the scaled pressure as a function of temperature in ideal HRG and VDWHRG for both zero and finite magnetic fields and compare it with the lQCD data. We observe that the pressure calculated in HRG and VDWHRG slightly deviates from the lQCD calculation, but the temperature dependence seems to be preserved. This deviation at high temperatures may be due to the fact that we are not considering higher spin states in our calculations. One can observe that the normalized pressure increases with the temperature almost monotonically for a zero magnetic field, while for a finite magnetic field, it diverges at a lower temperature due to a finite vacuum contribution to the total pressure, both for the HRG and VDWHRG models. The pressure in the VDWHRG model is found to be suppressed slightly compared to the HRG model. However, we found that the total pressure of the system (without scaling with \(T^{4}\)) increases with temperature with an increase in a magnetic field. The lightest spin-0 particles (mainly dominated by pions(\(\pi^{\pm},\pi^{0}\))) have more contribution towards pressure compared to heavier spin-1 (\(\rho^{\pm},\rho^{0}\)) and spin-1/2 (proton(p), neutron(n)) particles. In addition, it is noteworthy to mention that at lower temperatures, the thermal part of the pressure in the presence of a magnetic field is smaller than the pressure at a zero magnetic field. The vacuum pressure increases with an increase in the magnetic field, which is responsible for the monotonic increase in pressure with the magnetic field. The total energy density in the presence of a magnetic field takes the form \(\varepsilon^{total}=\varepsilon+QB\mathcal{M}\)[42], where \(\varepsilon^{total}\) and \(\varepsilon\) represent the total energy density in the presence and absence of a magnetic field, respectively. Fig. 1(b) illustrates the variation of \(\varepsilon/T^{4}\) as a function of \(T\) along with the magnetic field in the ideal HRG and VDWHRG models. The \(\varepsilon/T^{4}\) is found to increase with magnetic field for a fixed value of temperature. The \(\varepsilon/T^{4}\) also exhibits divergence behaviour at lower \(T\) similar to that of \(P/T^{4}\). It is found that there is a significant contribution of interactions after \(T\) = 130 GeV, as shown in Fig. 1(b). The energy density is found to be suppressed at higher temperatures in the VDWHRG model due to dominating repulsive interactions. The variation of the interaction measure (or normalized trace anomaly) as a function of temperature in the presence of a magnetic field is shown in Fig. 1(c). It can be directly derived from the energy-momentum tensor \(T_{\mu}^{\nu}\)), and it is sensitive to the massive hadronic states [26]. For a perfect fluid, it is the sum of all diagonal elements of \(T_{\mu}^{\nu}\). This parameter helps to determine the degrees of freedom of the system. We observe that the normalized trace anomaly diverges at a very low temperature, similar to the pressure and energy density. The magnetic field dependence of normalized trace anomaly is similar to normalized pressure and energy density and is comparable with the lQCD data [61]. Fig. 1(d) depicts the variation of magnetization as a function of temperature at zero \(\mu_{B}\). The sign of magnetization defines the magnetic property of the system under consideration. A positive value of magnetization indicates the paramagnetic behavior of hadronic matter, which indicates the attraction of hadronic matter in an external magnetic field. This paramagnetic behavior of hadronic matter is observed in both ideal HRG and VDWHRG models. From Fig. 1(d), it is observed that magnetization has a monotonic behavior with increasing temperature. This magnetization contains contributions from both thermal and vacuum parts. The vacuum part of magnetization is calculated using Eq. (69). The magnetization obtained for eB =0.2 GeV\({}^{2}\) in HRG and VDWHRG model reasonably agrees with that of the lQCD simulation. At very low temperatures, the thermal part of magnetization is significantly less because of the less abundance of charged hadrons. In addition to that, it is also important to note that the magnetization of charged pseudo-scalars mesons (spin-0) is found to be negative. The magnetization of the hadronic matter becomes positive when the vector mesons (spin-1) and spin-1/2 baryons populate the hadronic matter at higher temperatures. It is also noteworthy to point out that we found even though the thermal part of magnetization is negative at lower temperatures, the total value of magnetization is always positive due to the vacuum contribution. Fig. 1(e) shows the change in entropy density as a function of temperature at zero and a finite magnetic field. Entropy being the first derivative of pressure w.r.t. temperature, there is no vacuum contribution term in entropy density. The value of entropy density is very small (almost vanishes) at lower temperatures, and it starts to increase with temperature. One can also notice that entropy density shows minimal deviation with magnetic field even at high temperatures. The entropy density is found to be suppressed because of the magnetic field. The effect of interactions also suppresses the value of entropy density. This observation may be interesting for heavy ion collision (HIC) experiments since entropy acts as a proxy for particle multiplicity. Although there is no significant dependence of the magnetic field on entropy density, the effect of the magnetic field on the squared speed of sound can be clearly visualized from Fig. 1(f). The variation of the squared speed of sound as a function of temperature and the magnetic field is depicted at \(\mu_{B}=0\), and we notice that the \(c_{s}^{2}\) exhibits a dip towards lower temperatures with a magnetic field. The minimum position of \(c_{s}^{2}\) indicates the deconfinement transition tem Figure 2: (Color online) The variation (from left to right and downwards) of normalized pressure, energy density, magnetization, entropy density, specific heat, and squared speed of sound as functions of temperature at different baryochemical potentials for eB = 0.3 GeV\({}^{2}\). perature \(T_{c}\). Furthermore, we explore the variation of thermodynamic quantities in the presence of a finite chemical potential and a finite magnetic field. Fig. 2 depicts the variation of \(P/T^{4}\), \(\varepsilon/T^{4}\), \(\mathcal{M}\), \(s\), \(c_{v}\) and \(c_{s}^{2}\), respectively as functions of temperature for both finite values of chemical potential and magnetic field in the VDWHRG model. We set different values of \(\mu_{B}\), starting from 0.025 to 0.63 GeV, which correspond to the LHC, RHIC, FAIR, and NICA experiments [83; 84; 85; 86] at external magnetic field \(eB\) = 0.3 GeV\({}^{2}\). It should be noted that the strength of eB also decreases with a decrease in collision energy. Here, we have not considered the variation of eB with collision energy, as it is not straightforward. One can observe that for lower values of chemical potential (up to 0.2 GeV), the behavior of thermodynamic quantities in the VDWHRG model is almost like that of the zero chemical potential, with a slight variation in magnitude. But, Figure 4: (Color online) Electrical susceptibility (left panel) and refractive index (right panel) as functions of temperature for \(eB\) = 0.1, 0.2, 0.3 GeV\({}^{2}\). Figure 3: (Color online) Magnetic susceptibility (left panel) and magnetic permeability (right panel) as functions of temperature for \(eB\) = 0.1, 0.2, 0.3 GeV\({}^{2}\). there is a change in the behavior of some thermodynamic quantities observed for the higher value of chemical potential with magnetic field \(eB=0.3\) GeV\({}^{2}\). From Fig. 2(a), it is observed that \(P/T^{4}\) decreases monotonically with temperature for different values of chemical potential at \(eB=0.3\) GeV\({}^{2}\). A similar kind of observation is made in the energy density, with a slight variation in its trend. The magnetization, entropy density, and specific heat are found to increase with increasing temperature for lower values of chemical potential, as shown in Fig. 2(b),(c),(d),(e), respectively. But for higher values of chemical potential, the trend seems very interesting. The monotonic decreasing (increasing) behavior starts deviating for chemical potential around 0.436 GeV and above, as depicted in energy density, magnetization, entropy density, and specific heat plots. Magnetization and entropy density, being the first-order derivatives of pressure with respect to magnetic field and temperature, respectively, show the behavior approaching a first-order phase transition at the higher chemical potential. The dependence of chemical potential on the squared speed of sound is quite interesting, as shown in Fig. 2(f). The squared speed of sound decreases with an increase in chemical potential, showing a minimum. This minimum position shifts towards lower temperatures with higher values of chemical potential. In addition to thermodynamic results, it is crucial to understand the susceptibility of the medium under consideration, which is a sensitive probe for QCD phase transition. The magnetic susceptibility provides knowledge about the strength of the hadronic matter's induced magnetization. Its sign distinguishes diamagnet (\(\chi_{\rm M}^{2}<0\)), which expels the external field, from parameter (\(\chi_{\rm M}^{2}>0\)), which favors energetic exposure to the background field. In literature, the magnetic susceptibility of the HRG model is calculated through different approaches [56; 61]. Magnetic field dependence of magnetic susceptibility is also reported in the PNJL model [62]. Fig. 3(a) shows the magnetic field dependence of magnetic susceptibility with temperature. Since many of the thermodynamic quantities, including the fluctuation of conserved charges, are unaffected by the vacuum part [16], we neglect the vacuum contribution of susceptibilities in this study. One can observe that the magnetic susceptibility is negative for a lower value of magnetic field (e.g., eB = 0.1 GeV\({}^{2}\) and eB =0.2 GeV\({}^{2}\)), and its value tends towards positive for a higher magnetic field (eB = 0.3 GeV\({}^{2}\)) both for the ideal HRG and VDWHRG models. So a clear observation of the diamagnetic to paramagnetic transition happens in the VDWHRG model. It is quite an exciting consequence of the study of magnetic field dependence on magnetic susceptibility. Taking magnetic susceptibility into account, one can calculate the magnetic permeability of the medium. The relative magnetic permeability is defined as \(\mu_{r}\)= \(\frac{\mu}{\mu_{0}}=\frac{1}{1-e^{2}\chi_{M}^{2}}\)[60; 61]. This combination is equivalent to the ratio of the magnetic induction with the external field [60; 61]. Fig. 3(b) shows the magnetic field dependence of relative magnetic permeability with temperature in the ideal HRG and VDWHRG models. It is observed that the relative magnetic permeability is close to unity at lower temperatures, and it starts deviating from unity (although the deviation is very small in magnitude) while going toward higher temperatures. The \(\mu_{r}\) decreases with an increase in temperature at the lower magnetic field. Further, it starts to increase with the rise in the magnetic field. We estimate the electrical susceptibility in HRG and VDWHRG models using Eq. (29). Fig. 4(a) shows the temperature dependence of electrical susceptibility for different values of the magnetic field. One observes that electrical susceptibility increases with an increase in temperature. With a higher magnetic field, the electrical susceptibility is found to be suppressed at lower temperatures, and it starts to increase beyond a certain value of temperature. This limiting temperature was found to decrease with an increase in the magnetic field. This is because the dominant contribution to susceptibility comes from spin-0 particles (\(\pi^{\pm}\), \(k^{\pm}\), etc.), and in the presence of a magnetic field, these particles are suppressed and don't contribute to susceptibility. As a result, the electric susceptibility decreases at low temperatures with an increase in the magnetic field. However, as temperature increases, the higher spin non-zero resonance particles (\(\rho^{\pm}\), \(k^{\ast\pm}\), \(\Delta\), etc.) start contributing to susceptibility, and hence susceptibility is found to increase with the magnetic field at a higher temperature. Having the information of electrical susceptibility, one can easily calculate the electrical permittivity (or dielectric constant) of the medium under consideration using the relation \(\epsilon_{r}=1+\chi_{Q}^{2}\)[79]. The knowledge of the relative permeability and electrical permittivity of the hadronic medium motivates us to calculate one of the most important optical properties, called the refractive index. In the literature, there are explicit calculations of the refractive index of the QGP medium [87; 88]. Although the refractive index of the medium is dispersion relation dependent, here we consider a simplistic picture to estimate the refractive index in a hadronic medium, which can be estimated using the most general relation, RI = \(\sqrt{\epsilon_{r}\mu_{r}}\)[79]. Fig. 4(b) shows the refractive index variation as a function of temperature; the refractive index of the medium increases as the temperature increases. It is due to the fact that the number density of the system increases with temperature in the HRG model, and a denser medium causes a higher refractive index. The RI of the medium decreases with the magnetic field at lower temperatures and starts to increase at higher temperatures. The ideal HRG model accounts only for the hadronic degrees of freedom without any phase transition to QGP. However, the inclusion of attractive and repulsive interaction through the VDWHRG model allows us to study the liquid-gas phase transition in the hadronic phase. In the literature, there are investigations of this liquid-gas phase transition in the VDWHRG model in the T-\(\mu_{B}\) plane [36; 37; 39]. With different interaction parameters \(a\) and \(b\), the critical point of the phase transition is found to be different. Here, we explore the effect of the magnetic field on this critical point and study the liquid-gas phase transition in the \(T-\mu_{B}-eB\) plane using the VD-WHRG model. In this analysis, we use the same van der Waals parameters as used in Ref. [39], where the authors observed the critical point around \(T\approx 65\) MeV, and \(\mu_{B}\approx 715\) MeV. Taking the same baryochemical potential, we explore the effect of the magnetic field to see its effect on the critical temperature. Fig. 5(a) shows the variation of the \((\partial P/\partial n)_{T}\) with \(eB\) for the same chemical potential, \(\mu_{B}=715\) MeV. Each curve is for different temperatures taken for the calculation. One can observe that the \((\partial P/\partial n)_{T}\) becomes zero at \(T=64\) MeV and \(\mu_{B}=\)715 MeV for \(eB=0.12\) GeV\({}^{2}\). This marks the critical temperature below which the number density varies discontinuously, showing the 1st-order liquid-gas phase transition. To demonstrate the role of the magnetic field on the critical point, we plot the critical points in the \(T-\mu_{B}\) plane in Fig. 5(b). The green square marker shows the critical point in the absence of the magnetic field [39], whereas the magenta circle marker shows the critical point in the presence of a magnetic field. One can observe that in the presence of the magnetic field, the critical point shifts towards lower temperatures, i.e., at \(T=0.064\) GeV, \(\mu_{B}=0.715\) GeV and eB = 0.12 GeV\({}^{2}\). This indicates that the magnetic field delays the liquid-gas phase transition. It is also important to note that the critical point now depends on three parameters, namely, temperature, \(T\), baryochemical potential, \(\mu_{B}\), and the magnitude of the magnetic field, \(eB\). Hence one can in principle be able to study the three-dimensional variation of the critical point in the \(T-\mu_{B}-eB\) plane. ## V Summary In this work, we explore the effect of a magnetic field on the thermodynamic properties of an interacting hadron resonance gas model at zero and finite chemical potential. The static finite magnetic field significantly affects pressure, energy density, trace anomaly, magnetization, and second-order conserved charge fluctuations such as electric and magnetic susceptibility. However, this effect is less significant on entropy density, specific heat, etc. We found that all thermodynamic quantities are suppressed because of interactions. The effect of higher baryon chemical potential on the thermodynamic variable is interesting. The magnetization, entropy density, specific heat, and speed of sound may indicate discontinuity behavior approaching a higher baryochemical potential, which suggests a phase transition in the VDWHRG model. A clear observation of diamagnetic to paramagnetic transitions happens in our study. The electrical susceptibility is found to be suppressed because of the magnetic field at lower temperatures, and it slowly increases at higher temperatures. The optical property of the medium, like the refractive index, is also calculated and found to be increasing with temperature. A possible liquid-gas phase transition is also explored in the presence of a finite magnetic field and baryochemical potential. Figure 5: (Color Online) The variation of \((\partial P/\partial n)_{T}\) as a function of magnetic field \(eB\) (left panel). The right panel shows the critical point of the liquid gas phase transition in the QCD phase diagram in the presence of a magnetic field. ## Acknowledgement BS and KKP acknowledge the financial aid from CSIR and UGC, the Government of India, respectively. The authors gratefully acknowledge the DAE-DST, Government of India funding under the mega-science project "Indian Participation in the ALICE experiment at CERN" bearing Project No. SR/MF/PS-02/2021-IITI (E-37123). The authors would like to acknowledge some fruitful discussions with Girija Sankar Pradhan during the preparation of the manuscript.

2310.00840

Error Norm Truncation: Robust Training in the Presence of Data Noise for Text Generation Models

Text generation models are notoriously vulnerable to errors in the training data. With the wide-spread availability of massive amounts of web-crawled data becoming more commonplace, how can we enhance the robustness of models trained on a massive amount of noisy web-crawled text? In our work, we propose Error Norm Truncation (ENT), a robust enhancement method to the standard training objective that truncates noisy data. Compared to methods that only uses the negative log-likelihood loss to estimate data quality, our method provides a more accurate estimation by considering the distribution of non-target tokens, which is often overlooked by previous work. Through comprehensive experiments across language modeling, machine translation, and text summarization, we show that equipping text generation models with ENT improves generation quality over standard training and previous soft and hard truncation methods. Furthermore, we show that our method improves the robustness of models against two of the most detrimental types of noise in machine translation, resulting in an increase of more than 2 BLEU points over the MLE baseline when up to 50% of noise is added to the data.

Tianjian Li, Haoran Xu, Philipp Koehn, Daniel Khashabi, Kenton Murray

2023-10-02T01:30:27Z

http://arxiv.org/abs/2310.00840v2

# Error Norm Truncation: ###### Abstract Text generation models are notoriously vulnerable to errors in the training data. With the wide-spread availability of massive amounts of web-crawled data becoming more commonplace, how can we enhance the robustness of models trained on a massive amount of noisy web-crawled text? In our work, we propose Error Norm Truncation (ENT), a robust enhancement method to the standard training objective that truncates noisy data. Compared to methods that only uses the negative log-likelihood loss to estimate data quality, our method provides a more accurate estimation by considering the distribution of non-target tokens, which is often overlooked by previous work. Through comprehensive experiments across language modeling, machine translation, and text summarization, we show that equipping text generation models with ENT improves generation quality over standard training and previous soft and hard truncation methods. Furthermore, we show that our method improves the robustness of models against two of the most detrimental types of noise in machine translation, resulting in an increase of more than 2 BLEU points over the MLE baseline when up to 50% of noise is added to the data. ## 1 Introduction Advances in neural text generation models have achieved remarkable success in various downstream tasks, which includes but not limited to machine translation (Kalchbrenner and Blunsom, 2013), summarization (Rush et al., 2015), question answering (Joshi et al., 2017) and story generation (Fan et al., 2018). The prevalent paradigm of training text generation models is maximum-likelihood estimation (MLE), which finds parameters that maximizes the probability of each token from the training data conditioned on a given context. The limitation of MLE is that the model is forced to assign a non-zero probability to all tokens that appear in the training data, regardless of their quality, making the model not robust to errors in the training data. Existing research have demonstrated that text generation models are vulnerable to natural noise such as misspelled and misordered words (Khayrallah and Koehn, 2018) and adversarial noise such as poisoned training data (Wang et al., 2021; Wallace et al., 2021; Wan et al., 2023). To overcome this limitation, previous studies have either explored options to find alternatives of the autoregressive MLE paradigm (Khandelwal et al., 2021; Lewis et al., 2020; An et al., 2022) or modify the MLE objective (Welleck et al., 2020; Li et al., 2020; Kang and Hashimoto, 2020; Goyal et al., 2022; Lin et al., 2021; Pang and He, 2021; Xu et al., 2022; Ji et al., 2023). Modifications of MLE estimates data quality using the predicted probabilities of the ground truth token during training: a high probability corresponds to a higher likelihood that the ground truth token is clean and vice versa. Therefore, we can either directly remove data with high loss (Kang and Hashimoto, 2020; Goyal et al., 2022; Mohiuddin et al., 2022), or down-weigh data with low probability (Li et al., 2021; Ji et al., 2023) at each training iteration to improve robustness to data noise. However, estimating data quality only using the predicted probability of the target token ignores the **distribution of the non-target tokens**. For example, when a model assigns a low probability to a specific token, it could be the case that the context is high-entropy with many viable continuations, leading to a diluted probability of the target token (first example in Figure 1). Another possibility is that the model is undertrained and has not sufficiently converged and thus has not learnt a reasonable distribution for this token (second example in Figure 1). In both cases, truncating this token, or down-weighing the loss of this token, could be harmful for model training. To consider the predicted distribution of non-target tokens when estimating data quality, we propose **Error Norm Truncation**: to use the \(\ell_{2}\) norm of the difference between the model's predicted distribution and the one-hot vector of the ground truth to measure the quality of the data at each training iteration and truncating data with low quality. Intuitively, our method truncates tokens to which the model not only assigns a low probability, but is very confident that it should be another token (third example in Figure 1). ENT improves robustness to data noise during training by accurately estimating data quality at the token-level and removes noisy tokens. To sum up, our contribution is threefold: * We propose Error Norm Truncation: a data truncation method during training guided by a more accurate data quality estimation method that considers the probability distribution of non-target tokens; * Through experiments under different tasks and setups, we show Error Norm Truncation consistently outperforms the MLE baseline as well as strong baselines proposed by previous methods in generation quality; * We directly validate that Error Norm Truncation improves the robustness of machine translation models against two different types of noise: untranslated and randomly shuffled target sentences and outperforms all previous methods that truncate data. ## 2 Background and Motivation **Notation and Task Description.** We consider an conditional text generation model \(p_{\theta}(\mathbf{y}|\mathbf{x})\). Given context \(\mathbf{x}\) and target sequence \(\mathbf{y}=(y_{1},...,y_{T})\), the autoregressive framework models the probability of the target sequence conditioned on the context \(p_{\theta}(\mathbf{y}|\mathbf{x})\) by factorizing it to the sum of log-probabilities of individual tokens. The prediction for each time step \(t\) is conditioned both on the Figure 1: An motivating example of using the error norm for data quality estimation. All three examples have equal loss because they assign the same probability to the ground truth token. The skewness of the distribution of non-target tokens differentiates between the case when the context has high entropy with multiple possible continuations (example 1), when the model is at the beginning of training and is incompetent in making a prediction (example 2) and the case when the data is an error (example 3). **Truncating high loss removes all three examples whereas truncating high \(\ell_{2}\) error norm only removes the third erroneous example.** context \(\mathbf{x}\) and the previous tokens \(\mathbf{y}_{<t}\): \[\log p_{\theta}(\mathbf{y}|\mathbf{x})=\sum_{t=1}^{T}\log p_{\theta}(y_{t}|\mathbf{y}_{<t}, \mathbf{x}).\] The context \(\mathbf{x}\) depends on the specific task: In machine translation, the context \(\mathbf{x}\) is the source sentence to be translated from. In summarization, the context \(\mathbf{x}\) is the article that to summarize. Standard language modeling can be seen as a special case where the context \(\mathbf{x}\) is empty. MLE maximizes the probability of the target sequences from a training corpus \(\mathcal{D}\) by minimizing the expectation of the negative log-likelihood over the training corpus: \[\mathcal{L}_{\theta}(\mathbf{x},\mathbf{y})=\mathbb{E}_{\mathbf{y}\sim\mathcal{D}}\left[- \log p_{\theta}(\mathbf{y}|\mathbf{x})\right]=\mathbb{E}_{\mathbf{y}\sim\mathcal{D}}\left[ \sum_{t=1}^{T}-\log p_{\theta}(y_{t}|\mathbf{y}_{<t},\mathbf{x})\right].\] However, the MLE objective is not robust to noise (Ji et al., 2023), which can be observed by calculating the gradient of the MLE loss function with respect to a single token \(y_{t}\): \[\nabla\mathcal{L}_{\theta}(\mathbf{x},y_{t})=-\frac{\nabla p_{\theta}(y_{t}|\mathbf{ y}_{<t},\mathbf{x})}{p_{\theta}(y_{t}|\mathbf{y}_{<t},\mathbf{x})}.\] When the data is incorrect and the predicted probability for the token \(y_{t}\) (the denominator) is very small, the gradient norm \(\|\nabla\mathcal{L}_{\theta}(x,y_{t})\|\) would be very large, resulting in a large gradient update to an undesired direction. **Previous Works.** The vulnerability of the MLE objective to noise cultivates research into truncating noisy data. A trivial method of estimating data quality \(q(\mathbf{x},\mathbf{y})\) is to use the predicted probability \(p_{\theta}(\mathbf{y}|\mathbf{x})\). Intuitively, if the model assigns a low prediction probability to a training instance, it is more likely that the training instance is of low quality. Although in practice, a low prediction probability can also indicate a high entropy context rather than data quality. A natural way to to mitigate this vulnerability is to hard remove the noisy data: **Loss Truncation**(Kang and Hashimoto, 2020) directly removes a fixed fraction of the training **sentences** with the highest loss by setting their loss to 0, given a fraction of data \(c\) to prune out. The loss function for Loss Truncation is: \[\mathcal{L}_{\text{LT}}=-\log p_{\theta}(\mathbf{y}|\mathbf{x})\cdot\mathds{1}\big{(} p_{\theta}(\mathbf{y}|\mathbf{x})>\tau_{\theta,c}\big{)},\] where \(\mathds{1}(\cdot)\) is the indicator function and \(\tau_{\theta,c}\) is the threshold calculated by the \(c\)-th percentile of losses over the training data. Note that the threshold depends on the current state of the model since Figure 2: Examples of natural data noise that harms training. **Left**: summarization example from the XLSUM (Hasan et al., 2021) dataset where details in the summary (highlighted in red) cannot be inferred from the input text, which might cause the model to hallucinate facts in generating a summary. **Right**: Translation examples from opus-100 (Zhang et al., 2020), IWSLT 14 (Federico et al., 2014) and WMT 17 (Bojar et al., 2017), where details in the translation (highlighted in red) cannot be traced back to the source text (example 1 and 4), contains inconsistent use of capital letters (example 2) or requires the model to perform metric conversion (example 3). we use the model to rank training data and prune out a given percentage with the highest loss (or lowest predicted probabilities). Data truncation can also be done in a soft and fine-grained way: **TaiLr**(Ji et al., 2023) up-weighs **individual tokens** with higher predicted probabilities, smoothed by an interpolation between the ground truth distribution and the predicted probability of the model. The loss function \(\mathcal{L}_{\text{TaiLr}}\) is: \[\mathbb{E}_{\mathbf{y}\sim\mathcal{D}}\left[-\sum_{t=1}^{T}\underbrace{\left( \frac{p_{\theta}(y_{t}|\mathbf{y}_{<t},\mathbf{x})}{\gamma+(1-\gamma)\cdot p_{\theta}( y_{t}|\mathbf{y}_{<t},\mathbf{x})}\right)}_{\text{Weighting Factor}}\cdot\underbrace{\log p_{\theta}(y_{t}|\mathbf{y}_{<t},\mathbf{x})}_{ \text{Standard Loss}}\right],\] where \(\gamma\) is a hyper-parameter for the the smoothing factor. To overcome the issue of the model assigning a very small probability to all target tokens uniformly during the initial stage of training, TaiLr sets a lower threshold on the weighting factor as a hyperparameter. In our work, we consider Loss Truncation and TaiLr to be the most important baselines to compare with. **Motivation.** We point out two limitations of estimating data quality only by training loss: * It is sensitive to the training iteration at which we start to estimate data quality and remove or down-weigh low quality data. * It ignores the rich information contained in the probability distribution of the incorrect tokens, treating all non-ground truth tokens as equally incorrect. The first limitation arises from the model, when trained from scratch, undergoes multi-rounds of memorizing and forgetting (Toneva et al., 2019; Jiang et al., 2021; Jagielski et al., 2023) of individual examples. When a certain example is memorized, the model would label it as high quality and vice versa. This leads to high variance in measuring data quality throughout different stages in training. To overcome this issue, Loss Truncation first trains the model for a pre-defined number of iterations and then use it to do quality estimation. TaiLr uses a pre-defined lower bound on the weighting factor. However, these methods require extensive hyper-parameter tuning due to the high variance, especially when estimating quality within a mini-batch at an arbitrary training iteration. The second limitation arises from the corollary of using the probability of the ground truth as correct implies that all incorrect tokens are equally incorrect. For example, when the model assigns a low probability to the ground truth token 'house', it might have distributed the majority amount of probability mass to synonyms 'building', 'hotel' and'mansion'. There exists multiple correct predictions for a given context (Ott et al., 2018; Khayrallah et al., 2020) and only using the probability of one token to indicate quality leads to misjudgent. ## 3 Error Norm Truncation Motivated by methods in dataset pruning (Paul et al., 2021), we propose to estimate data quality using the \(\ell_{2}\) norm of the difference vector between the model's predicted distribution \(p_{\theta}(\cdot|\mathbf{y}_{<t},\mathbf{x})\) and the groundtruth one-hot distribution \(\text{OH}(y_{t})\): \[q(y_{t},\mathbf{x})=\|p_{\theta}(\cdot|\mathbf{y}_{<t},\mathbf{x})-\text{OH}(y_{t})\|_{2},\] which we refer as the **error norm**. At each training iteration, we set a threshold as a hyper-parameter and hard prune out the tokens with an error norm above the threshold. The loss function for Error Figure 3: The training dynamics of pre-training GPT2-large on WikiText-103. The plot shows the error norm for the largest 10% quantile of data in each mini-batch. Initially all error norms are close to 1, indicating the model uniformly assigns tiny probabilities to all target tokens. After the model is warmed up, it begins to detect data noise by assigning large error norms. Norm Truncation (ENT) is:1 Footnote 1: We provide PyTorch style pseudocode of Error Norm Truncation in Appendix D. \[\mathcal{L}_{\text{ENT}}=\mathbb{E}_{\mathbf{y}\sim\mathcal{D}}[-\log p_{\theta}(\mathbf{ y}|\mathbf{x})\cdot\mathds{1}(q(\mathbf{y}_{t},\mathbf{x})>\tau_{\theta,c})].\] The \(\ell_{2}\) error norm presents a solution jointly to the two aforementioned limitations due to an observation: **the probability distribution of the incorrect tokens only becomes skewed after multiple iterations of training**. Initially, when the model does not have enough knowledge to make a prediction, the error norm for all data is close to 1, indicating that our model uniformly assigns probabilities to all target tokens. After multiple iterations of training, when the model have enough knowledge, the error norm of data noise becomes significantly larger. Figure 3 illustrates the state transition of the model from warming up to being able to make an estimate of data quality, corresponding to the horizontal red line at around training iteration 500. Setting a threshold on error norm allows the model to learn from all the data during the initial stage to make a educated estimate of data quality. **Theoretical Connections.** As Kang and Hashimoto (2020) points out, a measurement of difference between probability distributions that is more robust to noise than the standard KL-Divergence (KLD) Kullback and Leibler (1951) is the Total Variation Distance (TVD) (van Handel, 2016), defined by the supremum of difference assigned to the same event. Intuitively, TVD measures the distinguishablity between two distributions. Given two probability distributions \(p\) and \(q\) over all possible sequence \(\mathcal{Y}\), the TVD between them is: \[\text{TVD}(p,q)=\sup_{\mathbf{y}\in\mathcal{Y}}|p(\mathbf{y})-q(\mathbf{y})|.\] Ji et al. (2023) factorizes the sequence level TVD to the token level and proves that the token level TVD is an upper bound of the sequence level TVD, therefore minimizing the token-level TVD is able to make the model more robust to noise in the data. We show connections between error \(\ell_{2}\) norm, the token-level TVD and the KL-Divergence2. By Pinsker's Inequality, we have Footnote 2: For simplicity, we rewrite the probability distribution of predicted probabilities \(p_{\theta}(\cdot|\mathbf{y}_{<t},\mathbf{x})\)as \(p_{\theta}\). \[\underbrace{\frac{1}{2}\left\|p_{\theta}-\text{OH}(y_{t})\right\|_{2}}_{\text {Error $\ell_{2}$ Norm}}\leq\frac{1}{2}\left\|p_{\theta}-\text{OH}(y_{t})\right\|_{1}= \underbrace{\sup_{y\in\mathcal{V}}|p(y)-\text{OH}(y_{t})|}_{\text{Estimator of Token TVD}}\leq\sqrt{\frac{1}{2}\text{KLD}(p_{\theta}\|\text{OH}(y_{t}))}.\] We see that the error \(\ell_{2}\) norm is a lower bound of the estimator of token level TVD. Examples with high error norm indicates a higher total variation distance whereas examples with high loss (KLD) does not necessarily indicates a high TVD since it is a loose (Canonne, 2023) upper bound. Therefore truncating examples with high error norm removes noisy data that has a higher TVD with the model's prediction learned from other instances. ## 4 Case Studies **Error Norm clearly distinguishes between clean and noisy tokens.** It is well established in robust statistics that \(\ell_{2}\) error norm is more sensitive to outliers (Hastie et al., 2001) than \(\ell_{1}\) norm, so \(\ell_{2}\) norm is better in detecting outliers in data than \(\ell_{1}\) norm. We prove the equivalency of using the error \(\ell_{1}\) norm and standard loss in ranking data quality at Appendix A. To empirically show the superiority of using the \(\ell_{2}\) norm in distinguishing between clean and noisy tokens, we use the dataset from Kang and Hashimoto (2020) which contains 300 examples from the Gigaword text summarization dataset where each summary is annotated into two categories: 1) directly entailed and 2) contains facts that cannot be inferred from the context. We find the precise tokens that are not entailed by the input and label them as \(\boxed{line}\) and label all the other tokens as \(\boxed{line}\). We plot the normalized histograms of negative log-likelihood loss and error norm between clean and hallucinate tokens at figure 3(a) and 3(b), evaluated by a pre-trained BART-large model. The overlap between clean and noisy distributions of loss (shaded area in figure 3(a)) is larger than the overlap of error norm (shaded area in figure 3(b)), indicating that error norm distinguishes between clean and noisy examples more clearly than negative log-likelihood loss. **Error Norm provides a more accurate measure of data quality.** We directly verify that our method does provide a more accurate estimate of data quality. We plot out the BLEU scores of multilingual machine translation of 4 directions: En={De, Fr, It, Es} with a fixed fraction of **sentences** pruned out according to different metrics at Figure 5. ENT was able to match the performance of the baseline at small pruning fractions (10%-20%) while having in the least drop of performance at high pruning fractions, outperforming randomly pruning for 2.43 BLEU and outperforming Loss Truncation by 0.88 BLEU when 60% of the data is pruned out. This shows that Error Norm provides a more accurate estimate of data quality than negative log-likelihood loss. ## 5 Experiments In this section, we show that truncating tokens with high error norm improves generation quality across different tasks. We describe the setup for all of our experiments at SS5.1. We validate that our methods improves robustness under synthetic noise at SS5.2. We present our experiment results under the train-from-scratch setting at $5.3 and under the fine-tune setting at SS5.4. We include results of both truncating a fixed fraction of data (ENT-Fraction) and truncating according to a pre-defined threshold (ENT-Threshold). Detailed dataset statistics and hyper-parameters are at Appendix C. ### Setup **Robustness Experiments.** To directly verify the ENT improves robustness, we inject noise into 1M parallel sentences of En-Fr data from the opus-100 dataset. We select two of the most harmful type of noise (Khayrallah & Koehn, 2018): **Untranslated Text** where the source sentence is directly copied to the target side; **Misordered Words** where the words at the target side is randomly shuffled. We vary the amount of noise added to the corpus {10%, 20%, 30%, 40% 50%} of the size of the original clean corpus and report the BLEU scores of models trained on MLE equipped with Loss Truncation, Tail/ and ENT-Fraction on the perturbed datasets. **Train-from-Scratch.** We evaluate our method on bilingual and multilingual machine translation and general language modeling. For multilingual translation, we train a single model for Figure 4: Distributions of negative log-likelihood loss and error \(\ell_{2}\) norm of clean and noisy data, evaluated by a pre-trained BART-large model. Error norm clearly distinguishes between clean and noisy data. Figure 5: Average BLEU results of 4 translation directions En={De, Fr, It, Es} from the opus-100 dataset with a fraction of sentences being truncated according to loss, error norm and randomly truncated. Truncating high error norm sentences achieves the best performance at at all levels of fraction of data to truncate. eight directions en-{es,fa,fr,it,ko,ru,tr,zh} from the opus-100 corpus3(Zhang et al., 2020) using 1M parallel sentences for each direction. We also experiment on three different sampling temperatures T={1,5,100} when there is a mismatch between dataset sizes and select two directions from opus-100: En-GI (400k) and En-Fr (1M).4 Footnote 3: [https://opus.nlpl.eu/opus-100.php](https://opus.nlpl.eu/opus-100.php) Footnote 4: Machine Translation results with mismatched data sizes are at Appendix G. We train on the fairseq (Ott et al., 2019) implementation of the standard Transformer (Vaswani et al., 2017) architecture 5 for all of our machine translation experiments. For language modeling, we train a GPT2-large (Radford et al., 2019) model on the WikiText-103 dataset (Merity et al., 2017) for 5 epochs from scratch. We use the Huggingface (Wolf et al., 2020) implementation of GPT2-large. Footnote 5: transformer_iwslt_de_en **Fine-Tuning.** We validate our method on the text summarization CNN/Daily Mail (See et al., 2017; Hermann et al., 2015) dataset on two different models: T5-small (Raffel et al., 2020) and BART-base (Lewis et al., 2020) to validate our method generalizes across different pre-trained models. We use the Huggingface implementations of T5 and BART. ### Robustness Results **Untranslated Text.** Table 1 shows the BLEU results of machine translation models trained on corpus with different level of untranslated text injected. Since the corpus is high quality data from the opus-100 training set, the difference between various methods that aims to improve robustness to noise are small when no noise is added. The MLE baseline model's scores gradually decrease with increased injection, revealing the negative impact of untranslated sentences. Loss Truncation maintains similar BLEU scores. Tail_r exhibits modest gains in both metrics. Notably, Error Norm Truncation consistently improving performance with higher injection percentages. Outperforming the baseline 3.8 BLEU and outperforming the best of Loss Truncation and Tail_r_ 2.1 BLEU when there is 50% of noise injected. These results emphasize the challenge of handling untranslated content, with the Error Norm Truncation proving exceptionally effective in mitigating this issue and enhancing translation quality. **Misordered Words.** Table 2 shows the BLEU results of models when trained on data with misordered sentences injected at the target side. Our results echos with the results in Khayrallah & Koehn (2018), showing that randomly shufftling the target sentence is a weaker type of noise compared to directly copying the source text to the target. Although Loss Truncation was able to improve upon the baseline when a small amount of noise is added (10-20%), it performs the same as standard MLE training at when a larger amount of misordered sentences are added to the training data. ENT is the most resilient method against misordered words at the target side, resulting in the largest BLEU scores improvement over the baseline in all noise levels. It outperforms the baseline 0.9 BLEU when 50% of randomly shuffled sentences are injected and only underperforms 0.1 BLEU against the performance of standard training on clean data, indi \begin{table} \begin{tabular}{l c c c c c c} \hline \hline Untranslated & 0\% & 10\% & 20\% & 30\% & 40\% & 50\% \\ \hline \hline MLE & 36.5 & **34.9** & 33.2 & 30.6 & 31.0 & 28.6 \\ Loss Trunc. & 36.5 & 33.2 & 32.5 & 31.5 & 31.4 & 29.4 \\ Tail\(r\) & 36.6 & 34.3 & 33.4 & 31.5 & 31.6 & 30.3 \\ \hline ENT-Fraction & **36.7** & 33.3 & **33.8** & **33.3** & **33.1** & **32.4** \\ \hline \hline \end{tabular} \end{table} Table 1: BLEU scores of models trained on opus-100 En-Fr data injected with the source sentence directly copied to the target side (Untranslated Text) ranging from 10% to 50% of the original clean data. Truncating with error norm is the most robust method against untranslated sentence. \begin{table} \begin{tabular}{l c c c c c c} \hline \hline Misordered & 0\% & 10\% & 20\% & 30\% & 40\% & 50\% \\ \hline \hline MLE & 36.5 & 36.1 & 36.1 & 36.2 & 35.8 & 35.5 \\ Loss Trunc. & 36.5 & 36.1 & 36.1 & 36.2 & 35.8 & 35.7 \\ Tail\(r\) & 36.6 & 36.2 & 36.2 & 36.3 & 36.2 & 36.2 \\ \hline ENT-Fraction & **36.7** & **36.3** & **36.7** & **36.7** & **36.5** & **36.4** \\ \hline \hline \end{tabular} \end{table} Table 2: BLEU scores of models trained on opus-100 En-Fr data injected with parallel sentences randomly shuffled (Misordered Words) at the target side ranging from 10% to 50% of the original clean data. Truncating with error norm was able to improve upon the baseline the most compared to existing methods. cating the resilience of the model against randomly shuffled target sentences when equipped with ENT. ### Train-from-Scratch Results **Language Modeling.** We first evaluate our method on general language modeling. Table 3 shows the results of the validation perplexity of pre-training a GPT-2 Large model on WikiText-103 from scratch. Hard truncation methods (Loss Truncation and Error Norm Truncation) was able to lower the perplexity more than 1 point compared to the MLE baseline. Truncating with error norm outperforms truncating with loss for a fixed fraction. Truncating to a given threshold outperforms all existing methods by lowering 1.58 perplexity compared to the MLE baseline. To show that Error Norm Truncation is less sensitive to the iteration from which soft or hard data truncation methods are applied, we vary this iteration \(\in\{0,100,200,500,1000\}\) parameter updates and plot out the validation perplexity on WikiText-103 of different methods at Figure 6. We see that ENT-Fraction is able to outperform previous methods while having the lowest variance and ENT-Threshold further improves the performance over ENT-Fraction. We highlight that large-scale language model pre-training is too expensive to tryout a combinatorically large number of hyper-parameters, therefore our method is more scalable to large-scale pre-training tasks compared to other methods due to the low variance and high performance. **Machine Translation.** Table 4 shows the BLEU results on Multilingual Machine Translation, where 1M parallel sentences for each language pair from a set of linguistically diverse languages are concatenated for training a large model. We find that previous methods often underperforms the MLE baseline due to not capturing the model's competency during truncating while our method consistently outperforms the baseline. Our method also outperforms Loss Truncation in 6 out of 8 directions, given a fixed pruning threshold. Using a pre-defined threshold in this scenario helps and boosts the performance compared to using a fixed fraction. \begin{table} \begin{tabular}{l c c c c c c c c c} \hline \hline En-\(\{\}\) & Es & Fa & Fr & It & Ko & Ru & Tr & Zh & Avg. \\ \hline \hline MLE & 40.5 & 14.2 & 40.4 & 35.1 & 10.1 & 36.3 & 25 & 39.2 & 30.1 \\ Loss Truncation & 39.8 & 14.0 & 40.1 & 34.4 & 9.9 & 36.5 & 24.7 & **40.1** & 29.9 \\ TailAr & 40.4 & 14.0 & 40.2 & 35.1 & 10.0 & 36.1 & 25.2 & 39.6 & 30.1 \\ \hline ENT-Fraction & 41.1 & 14.8 & 40.3 & **35.2** & **10.3** & 36.4 & 25.0 & 39.6 & 30.3 \\ ENT-Threshold & **41.9** & **14.9** & **41** & 34.8 & 10.2 & **36.5** & **25.5** & 39.8 & **30.6** \\ \hline \hline \end{tabular} \end{table} Table 4: BLEU results on a linguistically diverse subset of the opus-100 dataset. Error Norm Truncation with threshold and fraction outperforms the baseline and Loss Truncation in 7 out of 8 directions. ### Fine-Tuning Results **Summarization.** Table 5 shows the results of fine-tuning T5-small and BART-base on the CNN/Daily Mail Summarization dataset. Since we can rely on the pre-trained model to make an estimate of the data quality, we do not need to pre-define a threshold for the model. Directly pruning out a fraction of data produces the best result in this case. Therefore, we recommend to prune a fixed fraction when we are fine-tuning a pre-trained model and prune according to fixed threshold when training from scratch. Again, we were able to observe that truncating with error norm consistently outperforms all other methods in two different models. ## 6 Related Works **Modifications to MLE for Text Generation.** As the MLE objective is not robust to noise, numerous work have proposed ways to modify the MLE objective. Welleck et al. (2020) proposes to augment the MLE objective by penalizing the model for generating undesired outputs. Xu et al. (2022) directly penalizes the model for generating repetitions. Lin et al. (2021) modifies the gradient to encourage the model to generate diverse text. Kang and Hashimoto (2020) truncate a given fraction of data with the highest loss to remove noise from the data. Pang and He (2021) reformulates text generation as an off-policy and offline reinforcement learning problem, assigning weights to each token according to a pre-defined reward function. Similarly, Ji et al. (2023) also reweighs each token from the training dataset by the prediction probability of the model, smoothed by an interpolation between the one-hot probability vector and the predicted probability vector. Li et al. (2020) points out that the standard MLE objective treats all incorrect tokens as equal, and proposes to learn a prior distribution over the tokens using the training data and smooth the one-hot groundtruth distribution to an Gaussian distribution over tokens with similar embeddings. Welleck et al. (2023) proposes to first generate an intermediate output using MLE and iteratively refines the generation. To the best of our knowledge, our work is the first to address the limitations of only relying on the output probabilities in estimating data utility. **Measuring Data Utility in NLP.** Numerous works have proposed methods to estimate the contribution of each single datapoint in Natural Language Processing. For text generation tasks, the quality of data can be as simple as handcrafted heuristics such as word frequency and sequence length (Platanios et al., 2019), the relative position of the word in a sentence (Liang et al., 2021; Jia et al., 2023), the similarity to a target domain (Moore and Lewis, 2010; Zhang et al., 2019), and the embedding distance to a cluster center learned by K-Means Clustering (Sorscher et al., 2022). Instead of using handcrafted heuristics, data utility measurement can also utilize first and second order model activations: Koh and Liang (2017) imports Influence Functions (Cook and Weisberg, 1975) from statistical theory to deep learning, measuring the the utility of each training example by the difference between the parameters of the model trained with and without the particular training example. However, this estimation requires computation of single sample gradients, which is impractical when the training dataset is large. Paul et al. (2021) shows that the influence on training loss of removing one particular training example is upper bounded by the gradient norm when trained on that example, and proposes to approximate the single sample gradient norm by the error \(\ell_{2}\) norm. All of the above \begin{table} \begin{tabular}{l c c c c c c} \hline \hline & \multicolumn{3}{c}{T5-small} & \multicolumn{3}{c}{BART-base} \\ \cline{2-7} & R-1 & R-2 & R-L & R-1 & R-2 & R-L \\ \hline MLE & 42.19 & 19.69 & 39.04 & 43.50 & 20.59 & 40.36 \\ Loss Truncation & 42.22 & 19.68 & 39.05 & 43.22 & **20.66** & 40.44 \\ TaiLr & 41.53 & 19.22 & 38.33 & 42.20 & 19.66 & 39.07 \\ \hline ENT-Fraction & **42.63** & **19.98** & **39.57** & **43.48** & 20.29 & **40.72** \\ ENT-Threshold & 42.37 & 19.80 & 39.27 & 43.35 & 20.30 & 40.54 \\ \hline \hline \end{tabular} \end{table} Table 5: Best validation rouge-1/2/L_sum results on fine-tuning T5-small and BART-base equipped with different robust modifications to MLE on the CNN/Daily Mail dataset. ENT is able to outperform baselines on T5-small and match the performance of baselines on BART-base. methods assumes that the data utility is static. Our work differs in that our method takes into account the training dynamics while making quality estimations. Additional related works on measuring data utility with model signals and discussions on Influence Functions are provided at Appendix B. ## 7 Conclusion and Limitations **Conclusion.** Our work proposes **Error Norm Truncation** (ENT), a robust modification to the standard MLE objective in training text generation models. ENT measures the quality of each token by considering the skewness of the predicted distribution, and truncates the noisy tokens during training. ENT demonstrates enhanced stability and superior performance over existing methods. **Limitations.** We acknowledge that the improvements of our method result from the noisy distribution of the training data, therefore the improvements on clean, curated data might not be as large. We leave more coarse-grained grouped data and dataset quality estimation for future work. ## 8 Acknowledgements This work is supported in part by an Amazon Initiative for Artificial Intelligence (AI2AI) Faculty Research Award. The authors would also like to acknowledge the gifts from Amazon and the Allen Institute for AI. GPU machines for conducting experiments were provided by the ARCH Rockfish cluster.6 We sincerely thank Daniel Kang for sharing their annotated Gigaword dataset. We are also grateful to Xuan Zhang, Steven Tan, Mahyar Fazlyab, Jiefu Ou, Lingfeng Shen, Jack Zhang, Andrew Wang, Adam Byerly, Zhengping Jiang, Aayush Mishra, and Stephen Rawls for their insightful suggestions. Footnote 6: [https://www.arch.jhu.edu/](https://www.arch.jhu.edu/)

2305.04890

Steam Recommendation System

We aim to leverage the interactions between users and items in the Steam community to build a game recommendation system that makes personalized suggestions to players in order to boost Steam's revenue as well as improve the users' gaming experience. The whole project is built on Apache Spark and deals with Big Data. The final output of the project is a recommendation system that gives a list of the top 5 items that the users will possibly like.6

Samin Batra, Varun Sharma, Yurou Sun, Xinyao Wang, Yinyu Wang

2023-05-03T16:06:49Z

http://arxiv.org/abs/2305.04890v1

# Steam Recommendation System ###### Abstract This project aims to leverage the interactions between users and items on the Steam community to build a game recommendation system that makes personalized suggestions to players in order to boost Steam's revenue as well as improve users' gaming experience. The whole project is built on Apache Spark dealing with big data. The final output of the project is a recommendation system that gives a list of the top 5 items that the users will possibly like. ## 1 Introduction The world of video games has changed considerably over the recent years. Steam, as one of the biggest online video distribution platforms, has well reflected this trend. According to Newzoo1, in 2020 Steam's main market, PC games, accounted for 21% of the global game market revenue, reaching US$33.9 billion, a year-on-year increase of 6.7%. From 2016 to 2018, the average annual compound growth rate of Steam's global registered users was 54%. With the vigorous momentum in players, a large number of explosive games are pouring into steam as well. However, the fact of having such a variety of products and so many users, makes it difficult to predict whether a particular new game will be purchased or will be endorsed by a certain user. Also, according to Steam registries of 2014, about 37% of games purchased have never been played by the users who bought them. This context creates the urgent demand for building a game recommender system that is able to make relevant personalized suggestions to players, boosting Steam's revenue as well as improving users' gaming experience. To achieve this goal, we implemented a state-of-the-art algorithm based on Collaborative Filtering (CF) that uses the Alternating Least Squares (ALS) for making recommendations. Utilizing the implicit feedback is an important component in ALS which fits well to the characteristics of our dataset where implicit indicators for users' attitudes towards games such as reviews and playing time, as well as an explicit indicator, about whether a user recommends a game or not, are accessible. ## 2 Data and Methods ### The Datasets To implement the game recommender system for Steam and evaluate its prediction accuracy, we used two recent datasets on user-items and user-item-reviews on [https://cseeweb.ucsd.edu/~imcauley/datasets.html/steam](https://cseeweb.ucsd.edu/~imcauley/datasets.html/steam) data shared by Julian McAuley. The users-items dataset covers the game purchase history of Australian users on Steam. Specifically, this dataset includes users' portraits such as user id, the number of games purchased, playing time and item information. On the Steam platform, users can post reviews on the games they've played, share their thoughts and also indicate if they recommend the game to other users or not. Other users can indicate their thoughts about the reviews by indicating whether the review was funny, or helpful, and even give awards to users for their reviews. This information is available in the users-items-reviews dataset. Looking at the two datasets, there is a combination of explicit and implicit indicators that we could use to calculate ratings that a user may have given to a game. We decided that we could use playtime - that is, the amount of time, in minutes, that a user has played a game for - as one of the implicit indicators to reflect the user's attitude to games. At the same time, we also extracted some useful information from the reviews that users posted and used that as another implicit indicator in the recommendation model. Finally, we extracted the information about whether a user "recommends" a game or not, to other users, and used that as an explicit indicator. ### Exploratory Data Analysis In the Users Items dataset, there are in total 5,153,209 purchasing records from a total of 70,912 different users on 10,978 different items. We can tell that the interaction matrix between users and items is very sparse, which later leads us to build the recommender system using ALS method which is good at solving issues related to scalability and sparseness of ratings data. Since we take the playing time as one of implicit feedback metrics, we did the preliminary analysis on the playtime distribution. Out of the two metrics, we chose the '_playtime_forever_' feature as the evaluation metric to mitigate the impact of time and measure the game that manages to capture most loyal players throughout time, which could hardly be reflected in a seasonal feature like '_playtime_2weeks_'. We can tell that there are large variations when it comes to the playtime of games. There are games that are constantly played by a large player base, while at the same time an enormous number of games are rarely played or even not played at all. Meanwhile, we calculated the average time played per user and per item respectively. We noticed that although the number of users is about seven times the number of games, the average time played per user is much lower than that of the average game played per item. It shows that the user base is exposed to a much larger base of games and thus they could choose to interact with as many games as they want. It is also worth noting that the average time played per game has a clear long-tail distribution: "_Counter-Strike: Global Offensive_" (more known as CSGO) and "_Garny's Mod_" ranked the top 2 most played games of all times at an unrivaled advantage, but such a gap is not seen for other games. \begin{table} \begin{tabular}{|p{113.8pt}|p{113.8pt}|p{113.8pt}|} \hline Feature & Type & Description \\ \hline User\_id & str & Unique identifier of a user \\ \hline User\_url & str & URL link to a user’s profile \\ \hline Item\_id & int & Unique identifier of item \\ \hline Funny & int & Number of people who marked this comment as funny \\ \hline Helpful & int & Number of people who marked this comment as helpful \\ \hline review & str & Free text which reports the user opinion \\ \hline posted & str & Review posted time \\ \hline Last\_edited & str & Review last edited time \\ \hline Recommended & bool & Recommended by user (true or false) \\ \hline \end{tabular} \end{table} Table 1: Users Items Dataset Figure 1: Total Playtime (minutes) of Most Popular Games \begin{table} \begin{tabular}{|p{113.8pt}|p{113.8pt}|p{113.8pt}|} \hline Feature & Type & Description \\ \hline User\_id & str & Unique identifier of a user \\ \hline User\_url & str & URL link to a user’s profile \\ \hline Item\_id & int & Unique identifier of item \\ \hline Funny & int & Number of people who marked this comment as funny \\ \hline Helpful & int & Number of people who marked this comment as helpful \\ \hline review & str & Free text which reports the user opinion \\ \hline posted & str & Review posted time \\ \hline Last\_edited & str & Review last edited time \\ \hline Recommended & bool & Recommended by user (true or false) \\ \hline \end{tabular} \end{table} Table 2: Users Reviews Dataset Another important feature for the recommendation system is the actual review texts posted by users. We used Wordcloud to highlight popular words and phrases based on frequency and relevance. From the Word cloud generated, we can tell that the reviews are usually made up of game genres such as '_survival_', user attitude like '_enjoy_' and usage scenarios like '_friend_'. Thus, it is decided that sentiment analysis will be implemented to extract users' attitude towards games as part of the input for the recommendation system. ### _Sentiment Analysis_ With all the reviews that users wrote for different games, sentiment analysis can be performed to extract useful information on whether the user likes or hates the game. The information can later be used as part of the input for the recommendation system. For sentiment analysis, we used the VADER SentimentIntensityAnalyzer. VADER is a lexicon and rule-based feeling analysis instrument that is explicitly sensitive to suppositions communicated in web-based media. VADER utilizes a mix of lexical highlights that are marked by their semantic directions as positive or negative. Besides, VADER not only tells about if the text is positive or negative; it also tells us concerning how positive or negative it is by using the latitude of the positive/negative score, which facilitates us in further categorizing comments into more types of sentiments. From the pie chart below, we can tell that the majority of the reviews are positive, with around 1/5 being neutral and a very small portion of them being negative. Table III lists down a few examples of different sentiment categories. ### _Recommender System Models_ A common approach to designing a recommendation system involves the concept of collaborative filtering (CF). Collaborative filtering can be done in two ways: directly modeling the relationships between users and items, often referred to as neighborhood methods, or indirectly modeling these relationships using inferred variables (latent factors). For direct relationships, user-to-user or item-to-item based approaches can be used. In 'user-based' collaborative filtering, we intend to find a set of users most similar to the target user who has rated a particular item. In 'item-based' collaborative filtering, we intend to find a set of items most similar to the item which have been rated by a user. Latent factors are variables that are not directly observable but assumed to have an influence on users' preferences for content. The algorithm that is used to associate user and item relationships through latent factors rather than directly representing these associations is ALS. In the user matrix, rows represent users and columns are latent factors. In the item matrix, rows are latent factors and columns represent items. The Factorization matrix model learns to factorize the rating matrix into user and item representations, allowing the model to predict better-personalized item ratings for users. #### _Alternating Least Squares (ALS)_ "Alternating Least Square (ALS)" is a matrix factorization algorithm that runs itself in a parallel fashion. It is implemented in Apache Spark ML and built for large-scale collaborative filtering problems. ALS is designed to resolve the issue of scalability and sparseness in ratings data, and it scales well to very large datasets while being simple. Furthermore, as described above, the ALS model stands out for being capable of working using implicit feedback. As for the input data given to the algorithm, we used columns _user_id_, _item_id_, and _user_'s _ratings_ about the game. In order to derive the user ratings, we used the following three approaches: 1. Use only the 'playtime_forever' field. 2. Use the 'playtime_forever' field along with the sentiment ratings. 3. Use the 'playtime_forever' field along with the existing recommendation ratings. To calculate the ratings about user-game interaction, we have to assume a user game interaction metric. We can assume playing time as fairly persuasive information about users' interests. We compare each individual user's playing time for a game with the game's median played time by all the users. The exact formula for assigning the ratings between users and items based on _'playtime_forever'_ field is shown in the table below: \begin{tabular}{|p{28.5pt}|p{113.8pt}|p{113.8pt}|} \hline S.no & Criteria & Rating \\ \hline 1. & If a user's playing time is greater than the game’s median playing time from all of its users (median playing time). & 5 \\ \hline 2. & If the user's playing time is less than median playing time but greater than 0.8 times the median playing game. & 4 \\ \hline 3. & If the user's playing time is less than 0.8 times the median playing time but greater than 0.5 times the median playing game & 3 \\ \hline 4. & If the user’s playing time is less than 0.5 times the median playing time but greater than 0.2 times the median playing game & 2 \\ \hline 5. & if the user’s playing time is less than 0.2 times the median playing time & 1 \\ \hline \end{tabular} Table 4: Normalized rating calculation formula (using sentiments). \begin{table} \begin{tabular}{|p{28.5pt}|p{113.8pt}|p{113.8pt}|} \hline & ESSENTIALLY JUSTAN & UREAL & UREAL \\ TOURNANTESQUE & GAME WITH ALL THE FUN SPEED REMOVED & UREAL \\ ANDARBITRARY & LIMITATIONS PLACED ON CUSTOMISATION AND WEAPONS & UREAL \\ \hline \end{tabular} \end{table} Table 3: Examples of Reviews from Each Sentiment Class: For the model 3, we use the _'recommended'_ field present in the reviews dataset to normalize the ratings obtained (from table 4). For instance, if the playtime rating obtained is less than, or equal to 3, but the user has explicitly recommended the game, then we increase the rating by 2. However, if the rating is 4 or 5 but the recommendation from the user is 'No', then we reduce the rating by 2. ## 3 Results Using the methodology explained in the previous part, we trained the model on the respective ratings data, each running for 10 iterations and, each time with a different number of latent factors. We summarize those results in Figures 5,6, and 7 and Table 5. Evaluation results show that RMSE decreases upon including the sentiments with _playtime_ based ratings. However, when we include the recommendations of users in the reviews, along with the _playtime_ based ratings, the RMSE doesn't change by a significant amount. This could be explained by the fact that if a user has played a game for a large amount of time, the implicit rating can go up to 5, and it be very unlikely that a user will not recommend a game to others if they themselves played that game for a long duration. Similarly, if a user buys a game but doesn't play it much, and also doesn't recommend it to other users, it can be explained that the user didn't like the game so didn't end up playing it much, and also doesn't recommend it to other users. There were some cases (<0.1%) where a user who didn't play a game for a large amount of hours, recommended it still and vice versa but looking at the percentage, such cases were far and few in between. Inferring from the graph in Figure 5, we can see that the best count of latent factors in the model were found to be close to 30. Finally, we use the best configuration for each of the model to recommend games to the users: Figure 5: Approach 1- Training with different numbers of latent factors. Figure 6: Approach 2- Training with different numbers of latent factors. \begin{table} \begin{tabular}{|l|l|l|} \hline \hline **S.no** & **Approach** & **RMSE** \\ \hline 1 & ALS (with playtime) & 3.31 \\ \hline 2 & ALS (with playtime \& sentiments) & 2.64 \\ \hline 3 & ALS (with playtime \& recommendations) & 3.32 \\ \hline \hline \end{tabular} \end{table} Table 5: Test results for every model presented, including results with and without (WS) sentiment analysis considered. Figure 7: Approach 3- Training with different numbers of latent factors. ## 4 Conclusions In this work, we used 3 different approaches to train a recommendation system on a large dataset with an objective to recommend games to end users. We first conducted an exploratory data analysis to determine the features of key interest that could be helpful. The analysis demonstrated that _playtime_forever_ ("the total number of minutes played on record") could be useful as an implicit feedback feature. We used it to derive ratings for different user item combinations and finally used the Alternative Least Squares (ALS) matrix factorization algorithm to recommend games to users. We further did sentiment analysis for the item reviews dataset using NLP techniques and used the corresponding sentiment scores in conjunction with the ratings derived from the _playtime_forever_' feature to train ALS model and make recommendations. Finally, we used the data from recommendations that users explicitly made in their reviews, along with their implicit ratings to generate recommendations in the third approach. The results show that incorporating sentiments along with other implicit factors can improve the recommendation system's performance, while using explicit recommendations made by users doesn't change the performance much because recommendations made by users are highly similar to the amount of time that a user plays a game. ## 5 Future Work In exploratory data analysis, it turned out the user-item matrix was highly sparse with only 0.66% seen registries. Large sparsity is not ideal for training a model of interactions between users and items. Taking this fact into account, we should add in filtering before fitting the dataset into the model. In our case, filtering can be based on items such as only including games that have more than 500 times purchase records or based on users like only containing customers with at least 100 purchased items. Having a denser interaction matrix is beneficial to improve the accuracy of the model. We can also try out other models such as Factorization Machines (FM), DeepNN and DeepFM. The latter model incorporates a DeepNN and a FM layer, which work in parallel to introduce higher-order interactions between inputs. This could further improve the accuracy of predictions by taking into account factors such as novelty, diversity, and precision.

2305.15745

Robust Ante-hoc Graph Explainer using Bilevel Optimization

Explaining the decisions made by machine learning models for high-stakes applications is critical for increasing transparency and guiding improvements to these decisions. This is particularly true in the case of models for graphs, where decisions often depend on complex patterns combining rich structural and attribute data. While recent work has focused on designing so-called post-hoc explainers, the broader question of what constitutes a good explanation remains open. One intuitive property is that explanations should be sufficiently informative to reproduce the predictions given the data. In other words, a good explainer can be repurposed as a predictor. Post-hoc explainers do not achieve this goal as their explanations are highly dependent on fixed model parameters (e.g., learned GNN weights). To address this challenge, we propose RAGE (Robust Ante-hoc Graph Explainer), a novel and flexible ante-hoc explainer designed to discover explanations for graph neural networks using bilevel optimization, with a focus on the chemical domain. RAGE can effectively identify molecular substructures that contain the full information needed for prediction while enabling users to rank these explanations in terms of relevance. Our experiments on various molecular classification tasks show that RAGE explanations are better than existing post-hoc and ante-hoc approaches.

Kha-Dinh Luong, Mert Kosan, Arlei Lopes Da Silva, Ambuj Singh

2023-05-25T05:50:38Z

http://arxiv.org/abs/2305.15745v2

# Robust Ante-hoc Graph Explainer ###### Abstract Explaining the decisions made by machine learning models for high-stakes applications is critical for increasing transparency and guiding improvements to these decisions. This is particularly true in the case of models for graphs, where decisions often depend on complex patterns combining rich structural and attribute data. While recent work has focused on designing so-called post-hoc explainers, the question of what constitutes a good explanation remains open. One intuitive property is that explanations should be sufficiently informative to enable humans to approximately reproduce the predictions given the data. However, we show that post-hoc explanations do not achieve this goal as their explanations are highly dependent on fixed model parameters (e.g., learned GNN weights). To address this challenge, this paper proposes RAGE (Robust Ante-hoc Graph Explainer), a novel and flexible ante-hoc explainer designed to discover explanations for a broad class of graph neural networks using bilevel optimization. RAGE is able to efficiently identify explanations that contain the full information needed for prediction while still enabling humans to rank these explanations based on their influence. Our experiments, based on graph classification and regression, show that RAGE explanations are more robust than existing post-hoc and ante-hoc approaches and often achieve similar or better accuracy than state-of-the-art models. ## 1 Introduction A critical problem in machine learning on graphs is understanding predictions made by graph-based models in high-stakes applications. This has motivated the study of graph explainers, which aim to identify subgraphs that are both compact and correlated with model decisions. However, there is no consensus on what constitutes a good explanation--i.e. correlation metric. Recent papers [1; 2; 3] have proposed different alternative notions of explainability that do not take the user into consideration and instead are validated using examples. On the other hand, other approaches have applied labeled explanations to learn an explainer directly from data [4]. However, such labeled explanations are hardly available. Explainers can be divided into _post-hoc_ and _ante-hoc_ (or intrinsic) [5]. Post-hoc explainers treat the prediction model as a black box and learn explanations by modifying the input of a pre-trained model [6]. On the other hand, ante-hoc explainers learn explanations as part of the model. The key advantage of post-hoc explainers is flexibility since they make no assumption about the prediction model to be explained or the training algorithm applied to learn the model. However, these explanations have two major limitations: (1) they are not sufficiently informative to enable the user to reproduce the behavior of the model, and (2) they are often based on a model that was trained without taking explainability into account. The first limitation is based on the intuitive assumption that a good explanation should enable the user to approximately reproduce the decisions of the model for new input. That is simply because the predictions will often depend on parts of the input that are not part of the explanation. The second limitation is based on the fact that for models with a large number of parameters, such as neural networks, there are likely multiple parameter settings that achieve similar values of the loss function. However, only some of such models might be explainable [7, 8]. While these limitations do not necessarily depend on a specific model, this paper addresses them in the context of Graph Neural Networks for graph-level tasks (classification and regression). We propose RAGE--a novel ante-hoc explainer for graphs--that aims to find compact explanations while maximizing the graph classification/regression accuracy using bilevel optimization. Figure 2 compares the post-hoc and ante-hoc approaches in the context of graph classification. RAGE explanations are given as input to the GNN, which guarantees that no information outside of the explanation is used for prediction. This enables the user to select an appropriate trade-off between the compactness of the explanations and their discrimination power. We show that RAGE explanations are more robust to noise in the input graph than existing (post-hoc and ante-hoc) alternatives. Moreover, our explanations are learned jointly with the GNN, which enables RAGE to learn GNNs that are accurate and explainable. In fact, we show that RAGE's explainability objective produces an inductive bias that often improves the accuracy of the learned GNN compared to the base model. We emphasize that while RAGE is an ante-hoc model, it is general enough to be applied to a broad class of GNNs. Figure 1 shows examples of RAGE explanations in two case studies. In 1a, we show an explanation from a synthetic dataset (Planted Clique), where the goal is to classify whether the graph has a planted clique or not based on examples. As expected, the edge influences learned by RAGE match with the planted clique. In 1b, we show an explanation for a real dataset (Sunglasses) with graphs representing headshots (images), where the goal is to classify whether the person in the corresponding headshot is wearing sunglasses. We notice that edge influences highlight pixels around the sunglasses. We provide a detailed case study using these two datasets in Section 3.5, including a comparison against state-of-the-art post-hoc and ante-hoc explainers. We also evaluate our approach quantitatively in terms of accuracy, reproducibility, and robustness. Our results show that RAGE often outperforms several baselines. Our main contributions can be summarized as follows: * We highlight and empirically demonstrate two important limitations of post-hoc graph explainers. They do not provide enough information to enable reproducing the behavior of the predictor and are based on fixed models that might be accurate but not explainable. * We propose RAGE, a novel GNN and flexible explainer for graph classification and regression tasks. RAGE applies bilevel optimization, learning GNNs in the inner problem and an edge influence function in the outer loop. Our approach is flexible enough to be applied to a broad class of GNNs. Figure 1: Explanations generated by our approach (RAGE) in two case studies: Planted Clique (graphs with and without cliques) and Sunglasses (headshots with and without sunglasses). RAGE explanations identify edges in the clique and in the region around the sunglasses for both difficulties. For Planted Clique (a), the heatmap and sizes show node and edge influences, and the nodes with a thick border are members of the planted clique. For Sunglasses (b-c), the red dots show the influential pixel connections to the detection. We will discuss these case studies in more detail later. * We compare RAGE against state-of-the-art graph classification and GNN explainer baselines using six datasets--including five real-world ones. RAGE not only outperforms the baselines in terms of accuracy in most settings but also generates explanations that are faithful, robust, and enable reproducing the behavior of the predictor. We also provide additional case studies showing that our method improves interpretability by highlighting essential parts of the input data. ## 2 Methodology ### Problem Formulation We formulate our problem as a supervised graph classification (or regression). Given a graph set \(\mathcal{G}=\{G_{1},G_{2},\ldots,G_{n}\}\) and continuous or discrete labels \(\mathcal{Y}=\{y_{1},y_{2},\ldots,y_{n}\}\) for each graph respectively, our goal is to learn a function \(\hat{f}:\mathcal{G}\rightarrow\mathcal{Y}\) that approximates the labels of unseen graphs. ### RAGE: Robust Ante-hoc Graph Explainer We introduce RAGE, an ante-hoc explainer that generates robust explanations using bilevel optimization. RAGE performs compact and discriminative subgraph learning as part of the GNN training that optimizes the prediction of class labels in graph classification or regression tasks. RAGE is based on a general scheme for an edge-based approach for learning ante-hoc explanations using bilevel optimization, as illustrated in Figure 3. The explainer will assign an influence value to each edge, which will be incorporated into the original graph. The GNN classifier is trained with this new graph over \(T\) inner iterations. Gradients from inner iterations are kept to update the explainer in the outer loop. The outer iterations minimize a loss function that induces explanations to be compact (sparse) and discriminative (accurate). We will now describe our approach (RAGE) in more detail. #### 2.2.1 Explainer - Subgraph Learning RAGE is an edge-based subgraph learner. It learns edge representations from the node representations/features. Surprisingly, most edge-based explainers for undirected graphs are not permutation Figure 3: Illustration of an edge-based ante-hoc explainer that uses bilevel optimization. Explainer generates an explanation graph from the input graph by assigning an influence value to each edge. Edge influences are incorporated to edge weights on the explanation graph, the input of GNN Classifier. The inner problem optimizes GNN Classifier with \(T\) iterations, while the outer problem updates Explainer using gradients from inner iterations. The dotted edges in the explanation graph show that they do not influence the classification, while others have different degrees of influence. Figure 2: (a) Post-hoc models generate explanations for a pre-trained GNN classifier using its predictions. (b) Ante-hoc models, as our approach, learn GNNs and explanations jointly. This enables ante-hoc models to identify GNNs that are both explainable and accurate. invariant when calculating edge representations (e.g., PGExplainer [2] concatenates node representations based on their index order). Shuffling nodes could change their performance drastically since the edge representations would differ. We calculate permutation invariant edge representations \(h_{ij}\) given two node representations \(h_{i}\) and \(h_{j}\) as follows: \(h_{ij}=[\textbf{max}(h_{i},h_{j});\textbf{min}(h_{i},h_{j})]\), where **max** and **min** are pairwise for each dimension and \([\cdot;\cdot]\) is the concatenation operator. Edge influences are learned via an MLP with sigmoid activation based on edge representations: \(z_{ij}=MLP(h_{ij})\). This generates an edge influence matrix \(Z\!\in\![0,1]^{nxn}\). We denote our explainer function as \(g_{\Phi}\) with trainable parameters \(\Phi\). #### 2.2.2 Influence-weighted Graph Neural Networks Any GNN architecture can be made sensitive to edge influences \(Z\) via a transformation of the adjacency matrix of the input graphs. As our model does not rely on a specific architecture, we will refer to it generically as \(GNN(A,X)\), where \(A\) and \(X\) are the adjacency and attribute matrices, respectively. We rescale the adjacency matrix with edge influences \(Z\) as follows: \(A_{Z}=Z\odot A\). The GNN treats \(A_{Z}\) in the same way as the original matrix: \(H=GNN(A_{Z},X)\) We generate a graph representation \(h\) from the node representation matrix \(H\) via a max pooling operator. The graph representation \(h\) is then given as input to a classifier that will predict graph labels \(y\). Here, we use an MLP as our classifier. #### 2.2.3 Bilevel Optimization In order to perform both GNN training and estimate the influence of edges jointly, we formulate graph classification as a bilevel optimization problem. In the inner problem (Equation 2), we learn the GNN parameters \(\theta^{*}\in\mathbb{R}^{h}\) given edges influences \(Z^{*}\in[0,1]^{nxn}\) based on a training loss \(\ell^{tr}\) and training data \((D^{tr},y^{tr})\). We use the symbol \(C\) to refer to any GNN architecture. In the outer problem (Equation 1), we learn edge influences \(Z^{*}\) by minimizing the loss \(\ell^{sup}\) using support data \((D^{sup},y^{sup})\). The loss functions for the inner and outer problem, \(f_{Z^{*}}\) and \(F\), also apply regularization functions, \(\Theta_{inner}\) and \(\Theta_{outer}\), respectively. \[Z^{*}=\operatorname*{arg\,min}_{Z}F(\theta^{*},Z)=\ell^{sup}(C( \theta^{*},Z,D^{sup}),y^{sup})+\Theta_{outer} \tag{1}\] \[\theta^{*}=\operatorname*{arg\,min}_{\theta}f_{Z^{*}}(\theta)= \ell^{tr}(C(\theta,Z^{*},D^{tr}),y^{tr})+\Theta_{inner} \tag{2}\] RAGE can be understood through the lens of meta-learning. The outer problem performs _meta-training_ and edge influences are learned by a _meta-learner_ based on support data. The inner problem solves multiple _tasks_ representing different training splits sharing the same influence weights. At this point, it is crucial to justify the use of bilevel optimization to compute edge influences \(Z\). A simpler alternative would be computing influences as edge attention weights using standard gradient-based algorithms (i.e., single-level). However, we argue that bilevel optimization is a more robust approach to our problem. More specifically, we decouple the learning of edge influences from the GNN parameters and share the same edge influences in multiple training splits. Consequently, these influences are more likely to generalize to unseen data. We validate this hypothesis empirically using different datasets in our experiments (Supp. D.1). #### 2.2.4 Loss Functions RAGE loss functions have two main terms: a prediction loss and a regularization term. As prediction losses, we apply cross-entropy or mean-square-error, depending on whether the problem is classification or regression. The regularization for the inner problem \(\Theta_{inner}\) is a standard \(L_{2}\) penalty over the GNN weights \(\theta\). For the outer problem \(\Theta_{outer}\), we also apply an \(L_{1}\) penalty to enforce the sparsity of \(Z\). Finally, we also add an \(L_{2}\) penalty on the weights of \(g_{\Phi}\). ### Bilevel Optimization Training The main steps performed by our model (RAGE) are given in Algorithm 1. For each outer iteration (lines 1-14), we split the training data into two sets--training and support--(line 2). First, we use training data to calculate \(Z^{tr}\), which is used for \(GNN\) training in the inner loop (lines 5-10). Then, we apply the gradients from the inner problem to optimize the outer problem using support data (lines 11-13). Note that we reinitialize \(GNN\) and \(MLP\) parameters (line 4) before starting inner iterations to remove undesirable information [9] and improve data generalization [10]. We further discuss the significance and the impact of this operation in Supp D.2. The main output of our algorithm is the explainer \(g_{\Phi_{\kappa}}\). Moreover, the last trained \(GNN_{\theta_{T}}\) can also be used for the classification of unseen data, or a new GNN can be trained based on \(Z\). In both cases, the GNN will be trained with the same input graphs, which guarantees the behavior of the model \(GNN_{\theta_{T}}\) can be reproduced using explanations from \(g_{\Phi_{\kappa}}\). For gradient calculation, we follow the gradient-based approach described in [11]. The critical challenge of training our model is how to compute gradients of our outer objective with respect to edge influences \(Z\). By the chain rule, such gradients depend on the gradient of the classification/regression training loss with respect to \(Z\). We will, again, use the connection between RAGE and meta-learning to describe the training algorithm. #### 2.3.1 Training (Inner Loop) At inner loop iterations, we keep gradients while optimizing model parameters \(\theta\). \[\theta_{t+1}=inner\text{-}opt_{t}\left(\theta_{t},\nabla_{\theta_{t}}\ell^{ tr}(\theta_{t},Z_{\tau})\right)\] After T iterations, we compute \(\theta^{*}\), which is a function of \(\theta_{1},\dots,\theta_{T}\) and \(Z_{\tau}\), where \(\tau\) is the number of iterations for meta-training. Here, \(inner\text{-}opt_{t}\) is the inner optimization process that updates \(\theta_{t}\) at step \(t\). If we use SGD as an optimizer, \(inner\text{-}opt_{t}\) will be written as follows with a learning rate \(\eta\): \[inner\text{-}opt_{t}\left(\theta_{t},\nabla_{\theta_{t}}\ell^{tr}(\theta_{t}, Z_{\tau})\right)\coloneqq\theta_{t}-\eta\cdot\nabla_{\theta_{t}}\ell^{tr}( \theta_{t},Z_{\tau})\] #### 2.3.2 Meta-training (Outer Loop) After \(T\) inner iterations, the gradient trajectory saved to \(\theta^{*}\) will be used to optimize \(\Phi\). We denote \(outer\text{-}opt_{\tau}\) as outer optimization that updates \(\Phi_{\tau}\) at step \(\tau\). The meta-training step is written as: \[\Phi_{\tau+1} =outer\text{-}opt_{\tau}\left(\Phi_{\tau},\nabla_{\Phi_{t}}\ell ^{sup}(\theta^{*})\right)\] \[=outer\text{-}opt_{\tau}\left(\Phi_{\tau},\nabla_{\Phi_{\tau}} \ell^{sup}(inner\text{-}opt_{T}(\theta_{T},\nabla_{\theta_{T}}\ell^{tr}( \theta_{T},z_{\tau})))\right)\] After each meta optimization step, we calculate edge influences \(Z_{\tau+1}\) using \(g_{\Phi_{\tau+1}}(.)\). Notice that our training algorithm is more computationally-intensive than training a simple GNN architecture. Therefore we set \(T\) and \(\kappa\) to small values. Thus, RAGE can also be efficiently applied at training and testing time compared to competing baselines (Supp F). Experiments We evaluate RAGE on several datasets, outperforming both post-hoc and ante-hoc explainers in terms of metrics, including discriminative power and robustness. A key advantage of our approach is being able to efficiently search for a GNN that is both explainable and accurate. Our case studies show the effectiveness of explanations generated by RAGE over the baselines. We provide more results and analysis on RAGE in the supplementary. Our implementation of RAGE is anonymously available at [https://anonymous.4open.science/r/RAGE](https://anonymous.4open.science/r/RAGE). ### Experimental Settings **Datasets:** We consider six graph classification (regression) datasets in our experiments. Table 1 shows the main statistics of them. More details are provided in the Supplementary. **Baselines:** We consider several classical baselines for graph classification and regression including GCN [19], GAT [20], GIN [21], and SortPool [22]). We also compare RAGE against ExpertPool [23], which learns attention weights for node pooling, and against state-of-the-art GNN-based methods such as DropGNN [24], GMT [25], GIB [26], ProtGNN [8], and those that apply graph structure learning including LDS-GNN [27] and VIB-GSL [28]. For methods that use node classification, we add an additional pooling layer to adapt to the graph classification setting. Finally, we consider inductive GNN explainers: PGExplainer [2], RCExplainer [3], TAGE [29]. We also used transductive explainers (GNNExplainer [1], SubgraphX [30], CF\({}^{2}\)[31]) for a Planted Clique case study (Supp. G). **Evaluation metrics:** We compare the methods in terms of accuracy using AUC and AP for classification and also MSE and R\({}^{2}\) for regression. Moreover, we compare explanations in terms of _faithfulness_ (Supp. B), _stability_[32], and _reproducibility_. Faithfulness measures how closely the classifier's prediction aligns with the original graphs and their explanations. Stability (or robustness) quantifies the correlation between explanations generated for the original dataset and its noisy variants. Reproducibility assesses the accuracy of a GNN trained solely using the explanations as a dataset. ### Graph Classification and Regression Table 2 shows the graph classification (regression) results in terms of AUC (MSE) for RAGE and the baselines using five real-world and one synthetic datasets. RAGE outperforms the competing approaches in five datasets and has comparable results for IMDB-B. This indicates that our approach is able to identify subgraphs that are both compact and discriminative. Each of its baselines has its own drawbacks and performs poorly on (at least) one dataset with the exception of ExpertPool, which has consistent performance across datasets. Still, RAGE outperforms ExpertPool for every dataset by \(10.75\%\) on average and by up to \(27.2\%\) on Tree of Life. Surprisingly, most baselines achieve poor results for the Sunglasses and Planted Clique datasets, with the best baselines achieving \(93.68\%\) (ExpertPool) and \(87.78\%\) (GIN) AUC, respectively. This is evidence that existing approaches, including GIB and ProtGNN, are not able to effectively identify compact discriminative subgraphs. We also notice that, comparatively, RAGE achieves the best results for real datasets with large graphs (Sunglasses and Tree of Life). Intuitively, these are datasets for which identifying discriminative subgraphs has the highest impact on performance. Additionally, baselines using graph structure learning have poor performance and are not able to scale to large datasets. \begin{table} \begin{tabular}{c c c c c} \hline \hline & \#Graphs & \#Nodes & \#Edges & \#Features \\ \hline Mutagenicity [12; 13] & 4337 & 131488 & 133447 & 14 \\ Proteins [14; 15] & 1113 & 43471 & 81044 & 32 \\ IMDB-B [16] & 1000 & 19773 & 96531 & 136 \\ Sunglasses [17] & 624 & 2396160 & 9353760 & 1 \\ Tree of Life [18] & 1245 & 944888 & 5634922 & 64 \\ Planted Clique & 100 & 10000 & 49860 & 64 \\ \hline \hline \end{tabular} \end{table} Table 1: The statistics of the datasets. ### Reproducibility Reproducibility measures how well explanations alone can predict class labels. It is a key property as it allows the user to correlate explanations and predictions without neglecting potentially relevant information from the input. In our evaluation, we vary the size of the explanations by thresholding edges based on their values. We then train a GNN using only the explanations and labels. We compare RAGE against post-hoc and ante-hoc explainers and the resulting accuracies are shown in Figure 4. The results demonstrate that RAGE outperforms competing explainers in terms of reproducibility. Depending on the dataset, post-hoc and ante-hoc baselines may emerge as the second-best methods. TAGE (post-hoc), GIB (ante-hoc) and ProtGNN (ante-hoc), which aim to generalize the explanations through task-agnostic learning, bilevel optimization, and prototyping respectively, are among the most competitive baselines. This also highlights the importance of generalizability, which RAGE incorporates through meta-training and bilevel optimization. Two other post-hoc explainers, PGExplainer and RCExplainer, perform poorly. As expected, larger explanations lead to better reproducibility. ### Robustness Effective explanations should be robust to noise in the data. We evaluate the robustness of RAGE and the baselines using MutagenicityNoisyX--i.e. noisy versions of Mutagenicity with random edges (Supp. H.4 for details). We discuss results in terms of accuracy (Supp. C) and stability. **Stability:** Figure 5 presents a comparison of explanations obtained from Mutagenicity dataset and its noisy variants, evaluated based on cosine distance and Pearson correlation. Our results demonstrate that RAGE outperforms other graph explainers in both metrics. Furthermore, TAGE and GIB are identified as competitive baselines, which is consistent with the reproducibility metric, while prototyping fails. These findings provide further evidence that RAGE's approach for generalizability through meta-training and bilevel optimization contributes to the robustness of explanations. Furthermore, post-hoc explainers, PGExplainer and RCExplainer, are sensitive to noise, lacking stability. \begin{table} \begin{tabular}{c c c c c c c} \hline \hline & \multicolumn{4}{c}{**Classification (AUC \%)**} & \multicolumn{2}{c}{**Regression (MSE)**} \\ \hline & Mutagenicity & Proteins & IMDB-B & Sunglasses & Planted Clique & Tree of Life \\ \hline GCN [19] & \(86.82\pm 0.39\) & \(82.71\pm 1.08\) & \(81.49\pm 1.16\) & \(79.66\pm 13.12\) & \(52.89\pm 15.87\) & \(0.222\pm 0.010\) \\ GAT [20] & \(86.05\pm 0.59\) & \(82.31\pm 1.70\) & \(80.66\pm 1.56\) & \(67.80\pm 15.37\) & \(51.78\pm 22.36\) & \(0.179\pm 0.018\) \\ GIN [21] & \(88.15\pm 0.37\) & \(82.65\pm 0.90\) & \(84.14\pm 1.20\) & \(55.25\pm 4.62\) & \(87.78\pm 12.36\) & \(0.751\pm 0.584\) \\ ExpertPool [23] & \(86.81\pm 0.47\) & \(81.33\pm 1.21\) & \(83.20\pm 0.48\) & \(93.68\pm 1.15\) & \(80.00\pm 19.12\) & \(0.010\pm 0.015\) \\ SortPool [22] & \(85.34\pm 0.64\) & \(82.76\pm 1.16\) & \(80.62\pm 1.43\) & \(93.26\pm 2.52\) & \(54.44\pm 26.97\) & \(0.098\pm 0.014\) \\ DropGNN [24] & \(84.86\pm 2.11\) & \(82.59\pm 4.13\) & \(84.73\pm 2.00\) & \(54.74\pm 2.30\) & \(69.66\pm 12.70\) & \(2.690\pm 1.298\) \\ GMT [25] & \(86.06\pm 1.17\) & \(82.19\pm 3.13\) & \(80.82\pm 1.38\) & \(52.32\pm 1.21\) & \(56.39\pm 26.64\) & \(0.087\pm 0.004\) \\ GIB [26] & \(85.53\pm 0.99\) & \(82.71\pm 0.95\) & \(82.21\pm 2.04\) & \(61.30\pm 7.26\) & \(53.33\pm 16.33\) & \(0.305\pm 0.046\) \\ ProtoGNN [8] & \(86.72\pm 0.62\) & \(81.21\pm 2.07\) & \(82.53\pm 2.37\) & NS & \(57.8\pm 13.33\) & N/A \\ LDS-GNN [27] & \(86.12\pm 1.50\) & \(81.73\pm 1.32\) & \(81.12\pm 1.30\) & OOM & \(54.12\pm 15.32\) & OOM \\ VIB-GSL [28] & \(84.19\pm 1.10\) & EG & \(81.11\pm 1.21\) & OOM & \(54.44\pm 12.96\) & OOM \\ RAGE & \(\textbf{89.52}\pm\textbf{0.36}\) & \(\textbf{85.20}\pm\textbf{0.93}\) & \(84.16\pm 0.32\) & \(\textbf{99.36}\pm\textbf{0.44}\) & \(\textbf{97.78}\pm\textbf{4.44}\) & \(\textbf{0.073}\pm\textbf{0.007}\) \\ \hline \hline \end{tabular} \begin{tabular}{c c c c c c} \hline \hline EG: Exploding Gradient & OOM: Out Of Memory & N/S: Not Scalable & N/A: Not Applicable \\ \hline \hline \end{tabular} \end{table} Table 2: Test scores for graph classification/regression. Best and second-best values are in bold and underlined for each dataset. RAGE achieves the best results on average, outperforming the baselines. Figure 4: Reproducibility comparison between methods for different explanation sizes (in percentage) using four datasets. RAGE consistently outperforms the baselines across different sizes and datasets. ### Case Study We present a case study from Sunglasses (an extra case study for the Planted Clique in the Supplementary G) that showcases the explanations generated by RAGE and compares them to those generated by post-hoc and ante-hoc baselines at Figure 6. Sunglasses contains ground truth explanations that are intuitive. It is worth noting that the examples in the dataset have different levels of difficulty due to variations in the poses of the individuals in the pictures (bottom is harder). Related Work **Graph classification with GNNs:** Graph Neural Networks (GNNs) have gained prominence in graph classification due to their ability to learn features directly from data [19; 20; 33; 21]. GNN-based graph classifiers aggregate node-level representations via pooling operators to represent the entire graph. The design of effective graph pooling operators is key for effective graph classification [34; 22; 23; 35]. However, simple pooling operators that disregard the graph structure, such as mean and max, remain popular and have been shown to have comparable performance to more sophisticated alternatives [36]. Recently, [25] proposed a multi-head attention pooling layer to capture structural dependencies between nodes. In this paper, we focus on graph classification and regression tasks. We show that our approach increases the discriminative power of GNNs for classification by learning effective explanations, outperforming state-of-the-art alternatives from the literature [21; 25; 24]. **Explainability of GNNs:** Explainability has become a key requirement for the application of machine learning in many settings (e.g., healthcare, court decisions) [37]. Several post-hoc explainers have been proposed for explaining Graph Neural Networks' predictions using subgraphs [1; 2; 30; 3; 31; 29]. GNNExplainer [1] applies a mean-field approximation to identify subgraphs that maximize the mutual information with GNN predictions. PGExplainer [2] applies a similar objective, but samples subgraphs using the _reparametrization trick_. RCExplainer [3] identifies decision regions based on graph embeddings that generate a subgraph explanation such that removing it changes the prediction of the remaining graph (i.e., counterfactual). While post-hoc explainers treat a trained GNN as a black box --i.e., it only relies on predictions made by the GNN--ante-hoc explainers are model-dependent. GIB [26] applies the _bottleneck principle_ and bilevel optimization to learn subgraphs relevant for classification but different from the corresponding input graph. ProtGNN [8] learns prototypes (interpretable subgraphs) for each class and makes predictions by matching input graphs and class prototypes. Bilevel optimization and prototypes help in generalizability of explanations. Recently, TAGE [29] proposes task-agnostic post-hoc graph explanations which also makes the explanations generalizable compared to existing post-hoc explainers. However, it is still outperformed by our ante-hoc explainer, which applies meta-training and bilevel optimization, in terms of different metrics. Our experiments show that RAGE explanations are more meaningful, faithful, and robust than alternatives and can reproduce the model behavior better than existing post-hoc and ante-hoc explainers. **Bilevel optimization:** Bilevel optimization is a class of optimization problems where two objective functions are nested within each other [38]. Although the problem is known to be NP-hard, recent algorithms have enabled the solution of large-scale problems in machine learning, such as automatic hyperparameter optimization and meta-learning [39]. Bilevel optimization has recently also been applied to graph problems, including graph meta-learning [40] and transductive graph sparsification scheme [41]. Like RAGE, GIB [26] also applies bilevel optimization to identify discriminative subgraphs inductively. However, we show that our approach consistently outperforms GIB in terms of discriminative power, reproducibility, and robustness. **Graph structure learning:** Graph structure learning (GSL) aims to enhance (e.g., complete, demoise) graph information to improve the performance of downstream tasks [42]. LDS-GNN [27] applies bilevel optimization to learn the graph structure that optimizes node classification. VIB-GSL [28] advances GIB [26] by applying a variational information bottleneck on the entire graph instead of only edges. We notice that GSL mainly focuses on learning the entire graph, whereas we only sparsify the graph, which reduces the search space and is more interpretable than possibly adding new edges. Furthermore, learning the entire graph is not scalable in large graph settings. ## 5 Conclusion We investigate the problem of generating explanations for GNN-based graph-level tasks (classification and regression) and propose RAGE, a novel ante-hoc GNN explainer based on bilevel optimization. RAGE inductively learns compact and accurate explanations by optimizing the GNN and explanations jointly. Moreover, different from several baselines, RAGE explanations do not omit any information used by the model, thus enabling the model behavior to be reproduced based on the explanations. We compared RAGE against state-of-the-art graph classification methods and GNN explainers using synthetic and real datasets. The results show that RAGE often outperforms the baselines in terms of multiple evaluation metrics, including accuracy and robustness to noise. Furthermore, our two case studies illustrate the superiority of RAGE over state-of-the-art post-hoc and ante-hoc explainers.

2301.09843

Ab initio Prediction of Mechanical, Electronic, Magnetic and Transport Properties of Bulk and Heterostructure of a Novel Fe-Cr based Full Heusler Chalcogenide

Using electronic structure calculations based on density functional theory, we predict and study the structural, mechanical, electronic, magnetic and transport properties of a new full Heusler chalcogenide, namely, Fe$_2$CrTe, both in bulk and heterostructure form. The system shows a ferromagnetic and half-metallic(HM) like behavior, with a very high (about 95%) spin polarization at the Fermi level, in its cubic phase. Interestingly, under tetragonal distortion, a clear minimum (with almost the same energy as the cubic phase) has also been found, at a c/a value of 1.26, which, however, shows a ferrimagnetic and fully metallic nature. The compound has been found to be dynamically stable in both the phases against the lattice vibration. The elastic properties indicate that the compound is mechanically stable in both the phases, following the stability criteria of the cubic and tetragonal phases. The elastic parameters unveil the mechanically anisotropic and ductile nature of the alloy system. Due to the HM-like behavior of the cubic phase and keeping in mind the practical aspects, we probe the effect of strain as well as substrate on various physical properties of this alloy. Transmission profile of the Fe$_2$CrTe/MgO/Fe$_2$CrTe heterojunction has been calculated to probe it as a magnetic tunneling junction (MTJ) material in both the cubic and tetragonal phases. Considerably large tunneling magnetoresistance ratio (TMR) of 1000% is observed for the tetragonal phase, which is found to be one order of magnitude larger than that of the cubic phase.

Joydipto Bhattacharya, Rajeev Dutt, Aparna Chakrabarti

2023-01-24T07:02:30Z

http://arxiv.org/abs/2301.09843v1

(Ab-initio\) Prediction of Mechanical, Electronic, Magnetic and Transport Properties of Bulk and Heterostructure of a Novel Fe-Cr based Full Heusler Chalcogenide ###### Abstract Using electronic structure calculations based on density functional theory, we predict and study the structural, mechanical, electronic, magnetic and transport properties of a new full Heusler chalcogenide, namely, Fe\({}_{2}\)CrTe, both in bulk and heterostructure form. The system shows a ferromagnetic and half-metallic(HM) like behavior, with a very high (about 95%) spin polarization at the Fermi level, in its cubic phase. Interestingly, under tetragonal distortion, a clear minimum (with almost the same energy as the cubic phase) has also been found, at a c/a value of \(\sim\)1.26, which, however, shows a ferrimagnetic and fully metallic nature. The compound has been found to be dynamically stable in both the phases against the lattice vibration. The elastic properties indicate that the compound is mechanically stable in both the phases, following the stability criteria of the cubic and tetragonal phases. The elastic parameters unveil the mechanically anisotropic and ductile nature of the alloy system. Due to the HM-like behavior of the cubic phase and keeping in mind the practical aspects, we probe the effect of strain as well as substrate on various physical properties of this alloy. Transmission profile of the Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe heterojunction has been calculated to probe it as a magnetic tunneling junction (MTJ) material in both the cubic and tetragonal phases. Considerably large tunneling magnetoresistance ratio (TMR) of \(\approx 10^{3}\) % is observed for the tetragonal phase, which is found to be one order of magnitude larger than that of the cubic phase. ## I Introduction Half-metallic (HM) ferromagnets (FM) have become a topic of active research due to their potential for various technological applications. Theoretically, the HMFM materials are shown to exhibit 100% spin polarization (SP) at the Fermi level (E\({}_{F}\)), with one of the spin channels showing semi-conducting (SC) and the other one possessing metallic nature. In 1983, half-metallicity has been predicted in some half Heusler alloys (HHA), namely, NiMnSb and its isoelectronic compounds, PtMnSb and PdMnSb.[1] Ever since this study has been published in the literature, the field of HM Heusler alloys (HMHA) has attracted immense attention of the researchers, both theoreticians and experimentalists alike. As a result, innumerable studies on half-metallic half as well as full Heusler alloys (FHA) have come to the fore, in order to either understand some fundamental aspects or explore their potential for various applications.[2; 3; 4; 5; 6; 7; 8; 9; 10] It has been seen in the literature that typically many of the FHAs exhibit metallic nature, while a large number of HHAs are SC in nature. Many works have been carried out to show that the number of valence electrons (n\({}_{v}\)) plays a crucial role in defining the electronic as well as magnetic properties of materials. The Slater-Pauling rule established the relation between n\({}_{v}\) and the magnetic moment of a transition metal.[11; 12] Further, for Heusler alloys, specifically for Co-based ones, Slater-Pauling behavior has been seen, as reported in the literature.[13; 14] It has been observed that among the FHAs, primarily Co-based alloys show HM behavior with a typical value of valence electrons (n\({}_{v}\)) of 26 to 28. As discussed above, searching for a new or novel HMHA, which has high to very high (preferably 100 %) spin polarization at E\({}_{F}\), recently become of utmost importance, both from the points of view of fundamental understanding and technological application.[15; 16; 17] To this end, we take a combination of Fe, Cr and Te atoms, yielding a FHA, Fe\({}_{2}\)CrTe, with a n\({}_{v}\) value of 28. This alloy contains no Co atom, on the other hand, contains a chalcogen atom,Te. In the recent past, chalcogen atoms have been shown to be elements of interest[18; 19; 20; 21; 22]. From our \(ab-initio\) electronic structure calculations, it turns out that Fe\({}_{2}\)CrTe alloy is expected to show a HM-like behavior. The HM properties have been observed to be greatly influenced by defects, surfaces and interfaces. In this context, the study of the effect of strain as well as substrate on various physical properties of a HMHA can be interesting and important from practical application points of view. Hence, we embark upon the same in the present work. We apply uniform isotropic strain and also apply a biaxial strain by putting the cubic alloy on a well-known and lattice-matched SC substrate, namely, MgO. In one of our recent works, we have probed the possibility of coexistence of half-metallicity and tetragonal (martensite) transition in a series of Ni- and Co-based FM FHAs, including Ni\({}_{2}\)MnGa and a few other well-known alloys.[5] As a martensite phase transition (MPT) indicates occurrence of a shape memory behavior in a magnetic alloy and a HMFM alloy has the possibility of application in the field of spintronics, studying both these aspects is important. Since typically it has been observed that the MPT and HM behaviors are not seen in the same material, we have dived in the study of the same in the past.[5] We predicted a novel Co-based FHA (Co\({}_{2}\)MoGa), which exhibited a tendency of MPT and also a HM-like behavior. Three of the other studied FHAs have shown a very clear local minimum in the energy versus c/a plot, with a range of values of c/a ratio (\(\sim\)1.25 to 1.35). While the clear display of a tetragonal (martensite) phase is well-known and it is well-studied in many of the FHAs [23; 24; 25; 26; 27; 23; 27], the appearance of a minimum at a c/a ratio other than 1, in an otherwise cubic alloy, has seldom been observed. [5] In this work, we explore the possibility of a tetragonal distortion for the FHA Fe\({}_{2}\)CrTe and find that along with a cubic (austenite) phase, a clear minimum is observed for a tetragonal phase with a c/a ratio of \(\sim 1.26\), leading to a double-minima like structure in the energy versus c/a plot. For spintronic devices, in recent times, an extensive search for new materials suitable for magnetic tunneling junction (MTJ) is going on. [28; 29] These heterojunctions comprise two FM electrode materials and a non-magnetic insulator or semi-conducting spacer material in between the two electrodes. In these systems, the tunnenling magnetoresistance (TMR) is strongly dependent on the relative spin orientations of both the electrodes (parallel or anti-parallel). The TMR ratio has been defined as the difference in conductance of the MTJ in two different magnetic orientations divided by the smaller value. This ratio can in principle (theoretically) be infinitely large if a HMFM material is used as an electrode in the MTJ. In the literature, many studies have been reported where Co-based HMFM alloys have been used. Most of these studies include a thin insulating layer of MgO as the barrier/spacer material and favorable tunneling properties have been observed in these MTJs. [30; 31; 32; 33; 4] As Fe\({}_{2}\)CrTe is expected to exhibit a HM-like character, we first probe the magnetic properties of the Fe\({}_{2}\)CrTe thin film (13 monolayers (ML)) with 5 (7) ML of MgO as a substrate material. We find that the SP at E\({}_{F}\) is about 75% (70%), when 5 (7) ML of MgO substrate. We further calculate the transmission properties of the heterojunctions Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe to understand and explore the potential for MTJ application. In the next section, we discuss the method of electronic structure calculations, which is based on density functional theory. We also briefly discuss the calculational method related to transport properties. In the section followed by methodology, we present our results and discuss the same. Finally, we summarize and conclude our work in the last section. ## II Method The FHAs are known to exist either in a conventional or an inverse Heusler alloy structure. From the structure optimization, we find that in the lowest energy state, Fe\({}_{2}\)CrTe alloy possesses the conventional structure with a \(L2_{1}\) phase that consists of four interpenetrating face-centered-cubic (fcc) sub-lattices with origin at the following fractional positions: Fe atom at \((0.25,0.25,0.25)\) and \((0.75,0.75,0.75)\) sites, Cr atom at (0.5,0.5,0.5) site and Te atom at (0,0,0) site. The structure has been optimized by doing full geometry optimization using Vienna Ab Initio Simulation Package (VASP) [34; 35] with the projector augmented wave (PAW) method. [34; 35] For exchange-correlation (XC) functional, generalized gradient approximation (GGA) over the local density approximation has been used. [36] We use an energy cutoff of 500 eV for the planewaves. The final energies have been calculated with a \(k\) mesh of 15\(\times\)15\(\times\)15 for the cubic symmetry and an equivalent number of k-points for the tetragonal symmetry. The energy and force tolerance for our calculations were 1 \(\mu\)eV and 20 meV/A, respectively. For obtaining the electronic properties, the Brillouin zone integration has been carried out using the tetrahedron method with Blochl corrections. The directional dependencies of different mechanical properties (Young's modulus, inverse of bulk modulus or compressibility, shear modulus, and Poisson's ratio) of this alloy in both the cubic and tetragonal phases have been calculated with the help of the ELATE software. [37] For the calculation of transport properties of the heterojunction of Fe\({}_{2}\)CrTe and MgO, we make use of the PWCOND code [38], which has been implemented in the Quantum ESPRESSO (QE) package [39]. The spin-dependent tunneling conductance has been calculated using the Landauer formula: \[G^{\sigma}=\frac{e^{2}}{h}\sum_{K_{||}}T^{\sigma}(K_{||},E)\] here \(\sigma(=\uparrow,\downarrow)\) is the spin index and \(T^{\sigma}(K_{||},E)\) is the spin-dependent transmission coefficient at a particular energy value \(E\), with \(K_{||}=(K_{x},K_{y})\), where \(K\) are the wave-vectors, x and y are directions. In the literature, Choi and Ihm [40] have given a method to calculate \(T^{\sigma}(K_{||},E)\). We perfom this calculation for the optimized geometry using the GGA exchange functional. [36] We have taken the cut-off energy for the wave function and the charge density as 60 and 600 Ry, respectively. A mesh of 12\(\times\)12\(\times\)1 k-points have been used for the self-consistent-field(SCF) calculation of Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe heterojunction. A high tolerance (10\({}^{-8}\) Ry) and a large k-mesh (100 points in both \(x\) and \(y\) directions) have been taken, which are required to capture the fine spikes in a transmission. [41] The scalar relativistic ultrasoft pseudopotentials(USPP) with the GGA exchange-correlation term have been used, as obtained from the PSLibrary 1.0.0. For further details of calculation of ballistic conductance see Ref. [40]. Convergence of all the relevant parameters for VASP and QE packages have been tested before embarking upon the calculations of the physical properties. ## III Results and discussion In this section, first we predict the energetic stability of the cubic phase of Fe\({}_{2}\)CrTe alloy and then explore the possibility of a stable tetragonal (martensite) phase of this alloy, where the c/a ratio (a and c being the lattice constants along the x and z-directions) has been varied, keeping the volume fixed. We then calculate and present the dynamical and mechanical properties of these two phases. The mechanical properties of the well-known HA Ni\({}_{2}\)MnGa have been discussed in some places, for the sake of comparison. Further, we discuss the electronic and magnetic properties of the cubic and tetragonal phases. Due to the near HM behavior of the cubic phase, keeping in mind the practical aspects, we probe this phase further. An important aspect in materials growth is strain. Hence, we simulate and discuss the effect of isotropic strain on the electronic and magnetic properties of cubic Fe\({}_{2}\)CrTe alloy. Further, to check the effect of substrate (leading to bi-axial strain), we calculate the physical properties of the thin film (having 13 ML) of the cubic Fe\({}_{2}\)CrTe alloy, supported by a suitably lattice-matched substrate MgO (probed both 5 and 7 ML). Finally, the reasonably high SP at E\({}_{F}\) (75%) of the alloy when interfaced with MgO motivated us to perform the calculation of transmission properties of the Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe heterojunctions. We discuss and analyze the results of this heterojunction to probe its MTJ properties. ### Bulk Physical Properties #### iii.1.1 Energetic and Dynamical Stability _Energetics -_ The binding energy(BE) of the cubic phase of Fe\({}_{2}\)CrTe has been found to be -4.0252 eV per atom (for Ni\({}_{2}\)MnGa the BE is -4.3963 eV per atom) and this indicates a stable alloy. As discussed above, the Fe\({}_{2}\)CrTe alloy exhibits a lowest energy state in the conventional cubic Heusler alloy structure (Figure 1(a)), like the well-known Ni\({}_{2}\)MnGa compound, and it has a lattice constant of 5.95 A. In order to assess if a stable tetragonal (martensite) phase is possible in this system or not, we vary the c/a value, by keeping the volume same as the cubic phase, since MPT is known to be a volume conserving transition. In Figure 1(b) we show a schematic figure of the tetragonal phase with the optimized c/a ratio of \(\sim\)1.26. In Figure 1(c), we plot the energy difference between the cubic and tetragonally distorted phase as a function of c/a. We find that the cubic (austenite) phase is very close to the energy of the tetragonal (martensite) phase (lowest energy state) showing a double-minima like plot and the energy difference is as small as \(\sim\)1 meV per atom. In order to cross-check this interesting observation, we carry out an all-electron calculation employing WIEN2k programme package [42] using the GGA XC term. A plot with a double-minima structure is found in this case too. We find that the energy trend is reversed but the energy difference between the two phases continues to be very small (\(\sim\)12 meV per atom). Similar observation of a reversal of energy ordering for very small energy difference between two phases obtained from an all-electron and a pseudopotential calculation has already been reported in the literature. [43] Since the energy difference (between the cubic and the tetragonal phases) is very small and the difference between the phycical properties, such as total magnetic moment and density of states (DOS) are insignificant, when results from both the methods are compared, in this work, we continue to consider and present the results of physical properties, obtained from VASP. [34; 35] In order to understand the energetics further and to probe the possibility of MPT, we calculate the Gibbs free energy for both the cubic and tetragonal states as a function of temperature (Figure 1(d)). Our results show that interestingly, there is no crossing of the curves, which indicates that no MPT is possible in this alloy. This would bring us to the conjecture that since the two phases are energetically rather close and no MPT seems feasible, both these phases will compete and will have equal possibility to form, depending upon the growth conditions. During growth, possibility of finding a material in two (or more) different symmetries has already been discussed by us in our group and the experimental references therein. [7] However, it may be noted from Figure 1(d) that, at higher temperatures, cubic phase has a slight edge over the tetragonal phase. _Lattice Dynamical Stability -_ To probe this, we calculate the phonon dispersion curve for the cubic and tetragonal phases and the results are presented in Figure 2. For the phonon calculations, a 4\(\times\)4\(\times\)4 supercell is taken. The finite displacement method within the phonopy code [44] has been employed in order to obtain the phonon dispersion of the material. From Figure 2 it can be clearly seen that, all the frequencies are positive for both the phases, which is an important prerequisite for the lattice dynamical stability of a material. If the phonon spectra of Fe\({}_{2}\)CrTe are compared with other previously studied FHAs [45; 46], instability in their respective cubic phases are observed. These instabilities are led by the anomalous behavior of the acoustic TA2 branch along the \(\Gamma\) to X direction. However, in the present case, we do not observe clear anomalous dips in the acoustic TA2 branch in the cubic phase (Figure 2). In the cubic phase, along the \(\Gamma\) to X direction, the TA1 and TA2 branches are found to be degenerate and the degeneracy is lifted in the tetragonal phase. The atom projected vibrational density of states (VDOS) for the cubic and tetragonal phases (shown in Figure 2 (a) and (b) ) are consistent with our discussion on the phonon spectra. As expected the Te atoms dominate the vibration at lower frequency range, whereas at the higher frequency range, Cr atoms dominate the vibration for both the phases. Hence, in Fe\({}_{2}\)CrTe, in both the phases, the sequence of the optical vibration is regular, i.e. decreasing as the mass of the atom is increasing. This behavior is quite different from some other well-known FHAs, which show instability in the cubic (austenite) phase. In those systems, VDOS show unexpected anomalous behavior in the cubic phase, where optical vibration of the lighter atom is seen lying below the optical vibration of the heavier atom. [45; 46] These observations collectively indicate that Fe\({}_{2}\)CrTe is stable in both the phases, which gets further support from the variation of the Gibbs free energy with temperature in these two phases, as discussed before. #### iii.1.2 Mechanical Properties Having discussed the stability of the alloy, we now proceed to present and discuss the mechanical properties. For the details of the mathematical expressions for all the elastic constants and parameters, we refer to our earlier work [47] and the references therein. In order to study the mechanical stability criteria, we calculate the elastic constants for Fe\({}_{2}\)CrTe alloy in cubic phase. It is well-known that there are only three independent ones as \(C_{11}=C_{22}=C_{33}\), \(C_{12}=C_{13}=C_{23}\) and \(C_{44}=C_{55}=C_{66}\) in the cubic phase. We list the three constants \(C_{11}\), \(C_{12}\) and \(C_{44}\) in Table 1. It is well-known that if a cubic system fulfills the following stability criteria, then the structure is mechanically stable. [49] \(C_{11}\) - \(C_{12}>0\) ; \(C_{11}+2C_{12}>0\) ; \(C_{11}>C_{44}>0\) In case of Fe\({}_{2}\)CrTe, from the results presented in Table 1, we find that all the above-mentioned criteria are satisfied, suggesting that it is a mechanically stable alloy in the cubic phase. Further, we calculate the tetragonal shear constant (\(C^{\prime}\)) and the Zener ratio (or the elastic anisotropy parameter: \(A_{e}\)) which are defined as: \(C^{\prime}=(C_{11}-C_{12})/2\) \(A_{e}=\frac{2\times C_{44}}{C_{11}-C_{12}}\) We find that while \(C^{\prime}\) has a value of \(\sim\) 13, \(A_{e}\) possesses a value of \(\sim\)8. It has been established in the literature that a negative or very small positive value of \(C^{\prime}\) indicates an unstable cubic phase, as has been observed for Ni\({}_{2}\)MnGa (a value close to 5 has been obtained both from experiments and theory) [47; 50] which has a non-cubic ground state. [24] The calculated value for Fe\({}_{2}\)CrTe alloy can be considered to be somewhat small, as it has been seen that the typical HM systems like Co\({}_{2}\)VGa [51], which exhibit cubic ground state, show much higher \(C^{\prime}\) values. [5] Figure 1: Bulk crystal structure shown in (a) cubic and (b) tetragonal phase. (c) shows the difference in total energy (between cubic and tetragonal phases) with respect to c/a ratio for bulk Fe\({}_{2}\)CrTe, where the energy for the bulk cubic phase has been taken as reference. Since we normalize the difference with respect to the energy of the cubic phase, the cubic phase (c/a = 1) corresponds to an energy value of 0 eV. (d) Shows the temperature dependent Gibbs free energy, for the cubic and tetragonal phases. Figure 2: Schematic representation of phonon dispersion relations and atom projected vibrational density of states (VDOS) of (a) cubic and (b) tetragonal unit cell. LA, TA1 and TA2 represent the longitudinal and transverse acoustic branches, respectively. Further, we find that the \(A_{e}\) value turns out to be much larger than 1. It is well-known that materials with an \(A_{e}\) value much different from 1 often shows the tendency to deviate from the cubic symmetry and may suggest instability in the cubic phase.[52] Presence of a minimum in energy for a tetragonal symmetry (Figure 1(c)) seems to be consistent with the low positive \(C^{\prime}\) and large \(A_{e}\) values corresponding to the cubic bulk phase of Fe\({}_{2}\)CrTe alloy. Now we discuss the mechanical properties, which are important and most-discussed in the literature, namely, the bulk and shear moduli, Young's modulus (E) and Poisson's ratio (\(\sigma\)), which are often used to describe the ductility, malileability and overall mechanical stability of a material. Table 1 presents these values (all the values being rounded off up to second decimal place). For the cubic phase, we find that the values of bulk, shear and Young's moduli are somewhat higher than those of Ni\({}_{2}\)MnGa.[47, 50] This result suggests that in case of tensile, volumetric and shear strains, the present alloy is slightly less compressible compared to Ni\({}_{2}\)MnGa. In other words, it is expected to provide larger deformation resistance. However, since the \(\sigma\) value is very close to that of Ni\({}_{2}\)MnGa as well as many of the metals, Fe\({}_{2}\)CrTe is expected to behave similar to the common metals and well-known HAs in terms of compressibility. A similar conclusion can be drawn from the calculated Pugh's ratio (\(B/G\)), which has been found to be \(\sim\)2.77. On an empirical level, a material with a value higher than the critical value of 1.75 can be considered to have less inherent crystalline brittleness (ICB).[53] Further, according to Pettifor[54], a metal typically exhibits a high positive value of Cauchy pressure. With a value of \(\sim\)80, which is higher than that of Ni\({}_{2}\)MnGa[47], more metallic than directional bonding is expected in case of Fe\({}_{2}\)CrTe alloy. The Kleinman parameter (\(\zeta\)) is a dimensionless parameter which corresponds to the relative ease of bond bending to that of bond stretching[55, 56]. Under given stress, bond stretching (bending) dominates if \(\zeta\) is closer to 0.0 (1.0). We find a value close to 1. Hence, bond lengths are excepted to be largely unchanged if the system is distorted. Next we analyze the elastic stability and mechanical properties of the tetragonal phase. Table 1 also lists the relevant parameters for the tetragonal phase. The mechanical stability of tetragonal materials correspond to the following conditions: (1) all of \(C_{11}\), \(C_{33}\), \(C_{44}\), \(C_{66}\) > 0; (2)(\(C_{11}\) - \(C_{12}\)) > 0; (3)(\(C_{11}\) + \(C_{33}\) - \(2C_{13}\)) > 0; (4) (2(\(C_{11}\) + \(C_{12}\)) + \(C_{33}\) + \(4C_{13}\)) > 0.[49] We find all the criteria are fulfilled and hence the tetragonal phase of the material is mechanically stable. \(C^{\prime}\) value is high and positive, indicating a stable tetragonal phase is possible from the mechanical point of view. However, larger resistance to deformation is indicated by the increased values of \(B\), \(G\) and \(E\), compared to the cubic phase. Though the \(B/G\) value exhibits similar value as the cubic phase, the \(C_{P}\) value becomes negative, indicating the presence of a less metallic and more directional bonding in the tetragonal phase. _Anisotropic character of mechanical properties -_ It is well-known that if the value of \(A_{e}\) is 1, the Young's modulus turns out to be isotropic in nature. As we obtain an \(A_{e}\) value much larger than 1, we calculate the maximum and minimum values as well as study the three-dimensional characters to probe the direction-dependent nature of various mechanical properties, including the Young's modulus. Table 2 gives the maximum and minimum values of Young's modulus (\(E\)), compressibility (\(\beta\)), shear modulus (\(G\)) and Poisson's ratio (\(\sigma\)). We find that except \(\beta\), maximum and minimum values for rest of the parameters differ from each other. Further, we probe the directional mechanical properties in two (2D) and three (3D) dimensions. The results (presented in Figures S1 and S2[57] for cubic and tetragonal phases, respectively) establish the anisotropic nature, more for cubic phase. #### iii.1.3 Electronic and Magnetic Properties _DOS and Band Structure -_ In Figure 3, we plot the density of states (DOS) and the band structures of the cubic phase. From the total density of states, we find that there is a high SP at E\({}_{F}\). It is found to be about 95%. The E\({}_{F}\) for the equilibrium lattice constant is found to be located on the valence band edge. The majority spin DOS in the occupied region near E\({}_{F}\) has dominant contribution from the Cr and Fe d states, with a small contribution from the Te atoms (Figure 3(b)). On the contrary, in case of the minority spin, Fe DOS contributes much more near and at the E\({}_{F}\) than the other atoms. These Fe d states in the minority spin channel leads to the reduction of the SP at E\({}_{F}\) from 100 to 95%. Further, the unoccupied states in the conduction bands near E\({}_{F}\) also has dominant Fe-d character. The orbital projected band structure of Fe\({}_{2}\)CrTe in the cubic phase is shown in Figure 3(a), (c). The \(\Delta_{1}\) symmetry is associated with the \(s,p_{z},d_{z^{2}}\) orbital character. In contrast, \(p_{x},p_{y},d_{xz},d_{yz}\) orbitals specify \(\Delta_{5}\) symmetry and \(d_{xy},d_{x^{2}-y^{2}}\) orbitals are \begin{table} \begin{tabular}{c c c c c c c c c c c c} \hline \hline Phase & \(C_{11}\) & \(C_{12}\) & \(C_{13}\) & \(C_{23}\) & \(C_{44}\) & \(C_{66}\) & \(C^{\prime}\) & \(B\) & \(E\) & \(G\) & \(\sigma\) & \(C_{P}\) \\ \hline Cubic & 208.86 & 182.96 & - & - & 102.89 & - & 13 & 191.60 & 130.52 & 47.07 & 0.38 & 80.10 \\ Tetragonal & 330.830 & 82.493 & 136.696 & 271.440 & 93.966 & 72.366 & 124.17 & 182.76 & 228.63 & 88.51 & 0.29 & -11.50 \\ \hline \hline \end{tabular} \end{table} Table 1: Calculated values of elastic constants (\(C_{ij}\) in GPa) for Fe\({}_{2}\)CrTe in cubic and tetragonal phases. Computed values of bulk modulus (\(B\) in GPa), Young’s modulus (\(E\) in GPa), Shear modulus (\(G\) in GPa), Poisson’s Ratio (\(\sigma\)), Cauchy pressure (\(C_{P}\) in GPa) are also tabulated. \(B\) and \(G\) are calculated using the formalism given by Hill.[48] assigned to the \(\Delta_{2}\) symmetry. We can see the presence of highly dispersive parabolic electron like conduction band in the both majority and minority spin channels around the \(\Gamma\) point and these bands have dominant contribution from \(\Delta_{1}\) symmetric bands, originating from Te 5s states. However, we do not observe any bands crossing the E\({}_{F}\) along the \(\Gamma\) to X (\(i.e.\) along \(<001>\)) direction in the majority spin channel (Figure 3(c)), which has a great importance in the spin dependent transport properties and we discuss it in the later part of our pa \begin{table} \begin{tabular}{c c c c c c c c} \hline \hline Phase & \multicolumn{2}{c}{\(E\)} & \multicolumn{2}{c}{\(\beta\)} & \multicolumn{2}{c}{\(\sigma\)} & \multicolumn{2}{c}{\(G\)} \\ \cline{2-9} & Max & Min & Max & Min & Max & Min & Max & Min \\ \hline Cubic & 261.742 & 37.994 & 1.740 & 1.740 & 1.301 & -0.485 & 102.891 & 12.950 \\ Tetragonal & 264.527 & 181.023 & 1.870 & 1.801 & 0.477 & 0.052 & 124.168 & 69.220 \\ \hline \hline \end{tabular} \end{table} Table 2: Maximum and minimum values of \(E\) (in GPa), \(\beta\) (in TPa\({}^{-1}\)), \(G\) (in GPa) and \(\sigma\) for cubic and tetragonal phases of bulk Fe\({}_{2}\)CrTe alloy. Figure 4: Bulk electronic structure of tetragonal Fe\({}_{2}\)CrTe: (a) and (c) show orbital projected band structure of minority and majority electrons and (b) presents atom projected density of states. Here \(\Delta_{1}(s,p_{z},d_{z^{2}})\), \(\Delta_{2}(d_{xy},d_{x^{2}-y^{2}})\) and \(\Delta_{5}(p_{x},p_{y},d_{xz},d_{yz})\) represent the orbital symmetries of the bands. Figure 3: Bulk electronic structure of cubic Fe\({}_{2}\)CrTe: (a) and (c) depict orbital projected band structure of minority and majority electrons and (b) gives atom projected density of states. Here \(\Delta_{1}(s,p_{z},d_{z^{2}})\), \(\Delta_{2}(d_{xy},d_{x^{2}-y^{2}})\) and \(\Delta_{5}(p_{x},p_{y},d_{xz},d_{yz})\) represent the orbital symmetries of the bands. per. However, in the minority spin channel, we find two bands cross the E\({}_{F}\), which have dominant \(\Delta_{5}\) and \(\Delta_{2}\) orbital symmetries. Further, in the minority spin case the top of the valence band just touches the E\({}_{F}\), leading to negligible DOS at E\({}_{F}\). In case of the tetragonal phase (Figure 4), while the majority DOS contributions near the F\({}_{F}\) remain similar (both from Fe and Cr d states), the minority DOS at (and also above) E\({}_{F}\) gets slightly populated by both Fe and Cr d states, Fe states having more contribution. Due to the increased DOS at E\({}_{F}\) for the minority channel, the SP at E\({}_{F}\) gets reduced significantly (67%). Other than at the E\({}_{F}\), overall DOS of the tetragonal phase for the majority and minority spin channels also show that the peak positions are rather close to each other unlike the cubic case. This leads to a much lower magnetic moment for the former phase. Further, the orbital projected band structure in Figure 4(a), (c) suggests that parabolic conduction and valence bands around the \(\Gamma\) point in the minority spin channel is pushed away from the E\({}_{F}\) and move towards the higher (lower) energy side for the conduction (valence) bands when compared to the cubic case. From the symmetry analyses, we confirm the presence of \(\Delta_{1}\) symmetric band along the \(\Gamma\) - M direction (\(i.e\) along the \(<001>\) direction), in both the spin channels. We have further found that there are spaghetti of bands around the high symmetry point \(\Gamma\) in both the spin channels, increasing the valley degeneracy at \(\Gamma\). Figure 5 shows the DOS contribution of the various d states of the transition metal elements (Fe and Cr) as these populate the DOS near and at E\({}_{F}\). The splitting of the e\({}_{g}\) and t\({}_{2g}\) like states in the cubic case, specifically in case of Cr, which is in an ocataehedral symmetry, being surrounded by Fe atoms, is clearly visible from Figure 5 (bottom panel). Although the Fe atoms are the 2nd nearest neighbor of other Fe atoms, the hybridization between them is qualitatively more important. The t\({}_{2g}\) and e\({}_{g}\) like states for Fe atoms, which is in a tetrahedral symmetry, due to the four transition metal atoms Cr as neighbor can be seen from Figure 5 (middle panel). This aspect of crystal-field splitting of the t\({}_{2g}\) and e\({}_{g}\) like states has been shown to play an important role in yielding a HM like behavior in cubic half and full Heusler alloys.[7; 13] The DOS of Cr atom shows much larger energy gap (\(i.e.\) larger t\({}_{2g}\) and e\({}_{g}\) splitting) around the E\({}_{F}\), larger than what has been observed for Fe\({}_{2}\)CrTe bulk (Figure 5 (top panel)). However, the real gap is determined by the Fe-Fe interaction and the t\({}_{2g}\), e\({}_{g}\) splitting of the Fe atoms. On the contrary, for the case of tetragonal symmetry, due to the absence of clear octahedral/tetrahedral symmetric geometrical environment for the magnetic elements, and consequent absence of crystal-field effect, the splitting between t\({}_{2g}\) and e\({}_{g}\) like states is not clear (Figure 5 (b)). This might have led to the smaller SP value at E\({}_{F}\) as compared to the cubic case. _Effect of Hubbard U term -_ We have also addressed the role of onsite Coulomb interaction (Hubbard U) on the electronic and magnetic properties of Fe\({}_{2}\)CrTe in both the phases. The electron - electron Coulomb interaction and the self-interaction correction are considered in the rotationally invariant way (GGA+U) according to the Dudarev's method[58]. We have considered the U value of Fe and Cr to be 3 eV and 2 eV, respectively. This is in accordance with previous studies reported in the literature.[59; 60; 61]. The results are found to be significantly different for both the phases. In the cubic phase the SP at E\({}_{F}\) is found to be changed drastically with the Hubbard U parameter (Table S1).[57] Further analyses on atom-projected DOS indicate that electronic and magnetic properties show significant dependence on U\({}_{Fe}\) and minimal dependence on U\({}_{Cr}\)(Figure S3).[57] However, the SP value in the tetragonal phase shows moderate change over the range of U\({}_{Fe}\) and U\({}_{Cr}\) values, considered in our calculation (Table S1).[57] and the electronic structure is found to be less affected as compared to the cubic phase (Figure S3).[57] Usually the strength of Hubbard U for each atom in different local environments can be easily estimated by seeking a good agreement between the calculated and the experimental results. However, due to the predictive nature of the present work, the present results await experimental validation. _Fermi Surface -_ We present the results of calculated Fermi surfaces(FS) for the cubic and tetragonal phases of Fe\({}_{2}\)CrTe alloy, for both majority and minority electrons in Figure 6. Further, bands with the respective band indices are shown in Figures S6 and S7[57], whereas Figure.S5 shows the positions of the high symmetry k-points in the irreducible Brillouin zone.[57] By analyzing these figures, we observe the following for the cubic phase. The minority spin channel has three bands, 19, 20 and 21, which are mostly Fe derived (small contributions from the Te atoms) and cross E\({}_{F}\). While the former two bands give rise to only a carrier pocket at the \(\Gamma\) point, band number 21 additionally shows a pocket at the X point. On the other hand, in the majority spin channel the bands, 25, 26 and 27 are mostly Cr derived and have small contributions from Fe and Te atoms, specially for band 26. The FS due to band 26 forms a open spherical cone, indicating an electron-like behavior, whereas the FS is hole-like for band 25. Apart from that, small electron-like pockets are also observed at the W point, due to band 27. In the tetragonal phase, the character of the minority FS is shared by both Fe d and Cr d electrons (see Figure 4). The minority spins generate very small electron-like pockets at the X point and hole-like pockets at the \(\Gamma\) point. But the majority spin FS undergoes significant changes as we go from cubic to tetragonal phase. The majority FS due to band 25, produces small electron-like pockets at the high symmetry points X and N. Large hole-like pockets, centered around the \(\Gamma\) point, can be seen due to band 24. This drastic change in the majority spin FS (as we go from cubic to tetragonal phase) is also accompanied by a change in the spin magnetic moment, as seen for the Fe atoms, which we will discuss in the next section. _Magnetic Properties -_ As it is clear from Table III, the total magnetic moment of the system significantly reduces in the tetragonal phase. This happens due to the change in the partial magnetic moment of the Fe atom. From an overall ferromagnetic coupling observed in the cubic phase, due to the negative moment of Fe, the system assumes an overall ferrimagnetic configuration in the tetragonal phase. The partial moment of the Cr atom remains quite similar in both the cubic and non-cubic cases. The spin-polarized DOS of the d states of the Fe and Cr atom (Figure 5) give clear indication of these. To explore this in more detail, in Figure 7, we plot the total and partial magnetic moments of both the atoms, as a function of c/a values. It is observed that at about c/a of \(\sim\)1.15, a transition is observed for both the total and partial atomic moments. While the partial moment value of Fe goes from positive (\(\sim\)1 \(\mu_{B}\)) to a negative value (-0.23 \(\mu_{B}\)), partial moment of Cr atom make a transition of value of about 2.1 to close to 2.4 \(\mu_{B}\). Hence, it is clear that though Cr is the main moment-carrying atom in both the phases, it is the partial moment of Fe atom which leads to a change in magnetic configuration of the system. Additionally, it appears that such a transition of magnetic configuration from ferromagnetic in the cubic phase to ferrimagnetic in the tetragonal phase is independent of the Hubbard U parameter used in this study (Figure S4).[57] In order to understand the drastic change in the magnetic properties at a particular value of c/a, in Figure 8, we plot the spin-polarized DOS for different c/a values around the value of c/a = 1.15. We find that the Cr atom projected DOS (PDOS) is less affected than the Fe PDOS (Figure 8 (a)). But the overall intensity of the minority Figure 5: Atom and orbital projected DOS (PDOS) of Fe\({}_{2}\)CrTe: (a) cubic, (b) tetragonal Phase, respectively. The e\({}_{g}\) states have d\({}_{x^{2}-y^{2}}\) and d\({}_{z^{2}}\) orbital contributions and the t\({}_{2g}\) states have d\({}_{xy}\), d\({}_{xz}\) and d\({}_{yz}\) orbital contributions. spin DOS for Fe seems to have increased. Further, we have observed strong hybridization between the majority spin states of Fe and Cr d electrons near E\({}_{F}\) (-0.50 to 0 eV) for the c/a values 1.12 and 1.14, which is absent for the c/a values beyond \(\sim\)1.15 (Figure 8(a)). This might give rise to to the difference in Fe and Cr spin moments below and above c/a = 1.15. In Figure 8(b), we have shown the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is also pushed to the higher energy (\(i.e.\) towards E\({}_{F}\)) as c/a ratio changes from 1.12, 1.14 to 1.16 and 1.18. On the contrary in the minority spin states, we see the trend of the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is also pushed to the higher energy (\(i.e.\) towards E\({}_{F}\)) as c/a ratio changes from 1.12, 1.14 to 1.16 and 1.18. On the contrary in the minority spin states, we see the trend of the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is also pushed to the higher energy (\(i.e.\) towards E\({}_{F}\)) as c/a ratio changes from 1.12, 1.14 to 1.16 and 1.18. On the contrary in the minority spin states, we see the trend of the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is also pushed to the higher energy (\(i.e.\) towards E\({}_{F}\)) as c/a ratio changes from 1.12, 1.14 to 1.16 and 1.18. On the contrary in the minority spin states, we see the trend of the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is also pushed to the higher energy (\(i.e.\) towards E\({}_{F}\)) as c/a ratio changes from 1.12, 1.14 to 1.16 and 1.18. On the contrary in the minority spin states, we see the trend of the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is also pushed to the higher energy (\(i.e.\) towards E\({}_{F}\)) as c/a ratio changes from 1.12, 1.14 to 1.16 and 1.18. On the contrary in the minority spin states, we see the trend of the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is also pushed to the higher energy (\(i.e.\) towards E\({}_{F}\)) as c/a ratio changes from 1.12, 1.14 to 1.16 and 1.18. On the contrary in the minority spin states, we see the trend of the DOS of the Fe-d states for different c/a values near the E\({}_{F}\). The peak around \(\sim\)-0.10 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0.10 eV as we increase the c/a ratio. Further the peak around \(\sim\) -1 eV in the majority DOS is shifted to \(\sim\)0. is quite opposite. The minority DOS (around \(\sim\) 0.5 eV and -1 eV) are pushed from the lower binding energy to the occupied side with increasing c/a ratio. This is also corroborates well with decrease in exchange-splitting energy of the Fe atoms from 0.91 eV to 0.07 eV as c/a ratio changes from 1.14 to 1.16. On the other hand for the Cr atom the change in the exchange-splitting energy is rather small ( 1.88 eV and 1.82 eV for c/a ratio 1.14 and 1.16 respectively). The exchange-splitting energy is obtained by calculating the d-band centers of the atoms using VASPKIT programme [62]. iii.1.4 Effect of Isotropic Strain on the Electronic, Magnetic and Elastic Properties of Cubic Fe\({}_{2}\)CrTe It is well-known that, any change in the geometrical properties of Heusler alloy system may affect its electronic, magnetic and mechanical properties [63, 64, 65]. Hence, it is important to probe the effect of lattice constant variation on the electronic structure and magnetic properties of the bulk material. One of the simplest ways is to apply an external pressure or equivalently apply a uniform strain in the system. In our case, we have investigated the electronic, magnetic properties and mechanical stability of the system by applying a uniform strain of \(\pm\)5% (changing pressure from -20 GPa to 20 GPa). In Figure 9, we have shown these effects. The total magnetic moment of the system remains nearly integer (\(\approx\) 3.99 \(\mu_{B}\)), almost over the entire range of lattice constants (5.71 - 6.10 A) and after that the total magnetic moment suddenly increases at 6.22 Aand thereafter decreases (Figure 9(a)). Further, we do not observe any magnetic phase transition ( ferromagnetic to anti-ferromagnetic) over the studied range of lattice constant. Since the cubic phase of Fe\({}_{2}\)CrTe shows high spin polarization, we have also verified its HM property under uniform strain (Figure 9(b)) and found that it shows close to 100 % SP at E\({}_{F}\) on applying a negative uniform strain in the system. We further study the mechanical stability of the system, when the lattice constant changes. Under uniform pressure (P), the elastic constants are modified according to the following equation [63]: \[B_{11}=C_{11}-P\ ;\ B_{12}=C_{11}+P\ ;\ B_{44}=C_{44}-P\] and the stability criteria changes to: \[B_{11}-B_{12}>0\ ;B_{11}+2B_{12}>0\ ;B_{44}>0\] In Figure 9(c), we have shown the change of elastic constants with the lattice constant under uniform strain. The compound is found to be mechanically stable over almost the whole range of lattice constants studied, as it satisfies the stability criteria as discussed above. However, when the lattice constant is too large (\(\sim\)6.25 A), the compound is no longer mechanically stable.This is due to the fact that with increasing lattice constant, the interaction between the atoms weakens and the stability is thus destroyed. ### Fe\({}_{2}\)CrTe on MgO Surface From our previous discussion, we have established that the cubic phase of Fe\({}_{2}\)CrTe behaves like a nearly HM sys Figure 8: Spin-polarized density of states for tetragonal distortion in Fe\({}_{2}\)CrTe for different c/a values. (a) presents orbital projected density of states for both the Cr and Fe atoms and (b) shows the DOS of d orbitals of the Fe atoms corresponding to minority and majority electrons, respectively. tem. But in reality, HM properties can be highly affected by any kind of crystal disorders; such as defects, surfaces and interfaces. The study of a HM system on a substrate and corresponding surface and interface-related effects on its electronic and magnetic properties can lead to interesting results. In order to simulate an interface, we have constructed the Fe\({}_{2}\)CrTe/MgO(001) system (Figure S8) [57], by placing the O atoms (a) on top of the Cr and Te atoms \(i.e\) on a Cr-Te terminated interface and (b) on top of the Fe atoms of a Fe-Fe terminated interface. The Cr-Te terminated interface is found to be energetically more stable. This corroborates well with previous studies on Heusler alloy and MgO based heterojunctions [66; 4; 67], where it has already been reported that YZ interface of X\({}_{2}\)YZ FHA, where Y and Z atoms are situated on the top of O atoms, is the most stable one. Hence we consider this interface for further studies. Here we have considered 13 mono-layers (ML) of Fe\({}_{2}\)CrTe and 7 ML of MgO with \(sim\)15 A of vacuum to prevent interaction between the adjacent surfaces in a periodic arrangement. Further, the in-plane lattice constant of the Fe\({}_{2}\)CrTe/MgO surface, was fixed at 4.21 A (\(\frac{a}{\sqrt{2}}\), a being the lattice constant of bulk Fe\({}_{2}\)CrTe) in the cubic phase, which has an excellent lattice matching with bulk MgO (4.21 A). First we discuss the stability of this interface in the \(ab-initio\) DFT framework. We have calculated the binding energy and also the surface free energy (\(\gamma\)) [68], which is defined as, \[\gamma=\frac{G(T,P_{i})-\sum_{i}n_{i}\mu_{i}}{2A}\] where, G is the Gibbs free energy of the surface, \(n_{i}\) and \(\mu_{i}\) are the number and chemical potential of the i\({}^{th}\) element and A is the surface area of the supercell. The binding energy and surface free energy (\(\gamma\)) are \(\sim\) -4.3767 eV/atom and -1.9781 eV/A\({}^{2}\), respectively and these indicate a stable composite system. From Table 4, we see that there is some buckling in the interface and sub-surface Cr-Te layers, where the Te atoms move towards the substrate (MgO) side due to higher electronegativity of Te as compared to Cr. The increase of magnetic moments of the interface atoms (Table 4) is a well-known phenomenon [69; 70], when the lower hybridization at the surface leads to the enhancement in exchange-splitting of the interface atoms. This can also be confirmed from the atom projected spin-polarized DOS (Figure 10), where we see the majority (minority) spin states of the Cr atoms shift towards higher (lower) binding energy with respect to E\({}_{F}\), as compared to bulk Cr. It is also evident from Figure 10, that the interface states of the minority spin channel are mostly localized at the Fe atoms of the sub-surface layer. As a result, the SP of the surface is significantly reduced as compared to bulk. However, the surface effect is able to penetrate a few ML and rest of the layers show bulk-like properties (as is evident from Table 4 and Figure 10). ### Spin-Transport Properties of Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe Heterojunction From our previous discussion, we predict that the Fe\({}_{2}\)CrTe cubic alloy may be grown on MgO(001) substrate as it forms an energetically stable surface. In bulk Fe\({}_{2}\)CrTe the half-metallic behavior is affected due the highly disperssive bands in the minority spin channel due to the dominant contribution from the Fe atoms (Figure 3), which is also evident from the non-integer spin magnetic moment (\(\sim\) 4 \(\mu_{B}\)). Thus transport in both the spin channels is expected in case of cubic phase of Fe\({}_{2}\)CrTe. Further, the SP at E\({}_{F}\) for the tetragonal phase has been found to be much less than that of the cubic phase. However, we find a significantly strong SP of transport even at high temperature, when we calculate the temperature dependence of the spin-polarized conductivity (Figure S9) [57], specially in the cubic phase. This indicates even though Fe\({}_{2}\)CrTe may not completely be half-metallic, it may be a useful for a spin-injector material even at higher temperature. MTJ materials with an electrode with a reasonably Figure 9: Effect of strain (isotropic pressure) on the (a) magnetic properties; (b) electronic properties; (c) elastic properties of Fe\({}_{2}\)CrTe in the cubic phase. high SP at E\({}_{F}\) have recently gained lots of attention, due to their high TMR ratio, where the resulting current in the junction strongly depends on the relative magnetization of the electrode.[3; 4] Here we investigate the Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe heterojunction to explore its MTJ properties, in both the phases. It may be noted that the tetragonal phase of Fe\({}_{2}\)CrTe exhibits a lattice mismatch of 7% with MgO (in-plane lattice constant = a/\(\sqrt{2}\)). Here we have constructed our heterojunction with 13 ML of Fe\({}_{2}\)CrTe and have taken 5 ML of MgO. In Table 5, we have shown the transmittance value and TMR ratio of the heterojunction for cubic and tetragonal phases of Fe\({}_{2}\)CrTe, where the TMR value is defined as \(\frac{G_{PC}-G_{APC}}{G_{APC}}\), where G\({}_{PC}\) and G\({}_{APC}\) indicate the total conductance for the MTJs in the parallel (PC) and anti-parallel (APC) state. Despite the fact that the cubic phase has a higher SP value, the TMR ratio indicates a 10 fold rise in the TMR ratio value for the tetragonal phase compared to the cubic phase (Table 5). To understand this, we examine the majority spin band structure of both the phases along the \(<001>\) direction (Figure 3 and Figure 4). It has already been established that the \(\Delta_{1}\) band in the majority spin state is essential to obtain a large TMR ratio for MgO-based MTJs.[3; 71] We see that the bands with \(\Delta_{1}\) symmetry along the \(<001>\) direction are only present for the tetragonal phase. Here we must keep in mind the possibility that these theoretical values can be constrained by the presence of a variety of disorders and defects at the interface that may develop during the sample growth. Therefore, our predicted values of the TMR ratio define the upper limit of the same. For a comprehensive understanding of the above spin-dependent conductance and TMR effect, in Figure 11 we show the k-resolved transport properties at the E\({}_{F}\) of the heterojunction with MgO (with layer thickness of 5 ML) in PC and APC state for the cubic phase of Fe\({}_{2}\)CrTe. The majority spin transmission in PC state is found to be negligible around the center of the BZ, though MgO has a small decay constant (\(\kappa\)) around \(\Gamma\) point, as can been seen from the complex band structure of MgO (Figure S10).[57] It is evident from the orbital projected majority spin band structure of bulk Fe\({}_{2}\)CrTe that there are no in Figure 10: The spin-polarized, atom projected density of states are shown for atoms at different layers for the composite system with Cr-Te/MgO interface. Here S, S-1, S-2, and S-3 represent surface and subsurface layers as we go away from the interface, respectively. \begin{table} \begin{tabular}{c c c c c} \hline \hline Atomic Layer & \(\delta\)l & SP & Atomic Magnetic Moments & \\ \hline \hline & & Cr & Fe & Te \\ \hline Interface (S) & 0.21 & 71 & 3.12 & – & -0.05 \\ S-1 & 0.00 & 11 & – & 1.82 & – \\ S-2 & 0.20 & 94 & 2.05 & & -0.07 \\ S-3 & 0.00 & 41 & – & 0.98 & – \\ S-4 & 0.00 & 94 & 2.10 & – & -0.05 \\ Bulk & – & 95 & 2.22 & 0.89 & -0.04 \\ \hline \hline \end{tabular} \end{table} Table 4: Calculated electronic, geometric and magnetic properties of Fe\({}_{2}\)CrTe/MgO interface. Surface buckling (\(\delta\)l in Å), atomic magnetic moments (in \(\mu_{B}\)) and the SP (in %) at E\({}_{F}\) are shown in the table. Bulk values are also given for comparison. coming majority-spin \(\Delta_{1}\) states at the E\({}_{F}\) (Figure 3). In contrast, for the minority spin channel in the PC state, we observe tunneling hot-spots around \(\Gamma\) point, however showing a much weaker transmission. Apart from the highly conducting channel around the \(\Gamma\) point, we observe appearance of conducting channels around the Brillouin zone corners for the majority spin channel showing a four-fold rotational symmetry of the Fe\({}_{2}\)CrTe electrode. These are identified as resonant tunneling states.[3; 71] In the APC state the spin up and down channels exhibit similar transmission properties with considerably large tunneling states around the \(\Gamma\) point (Figure 11). Now as we increase the barrier thickness the transmission around \(\Gamma\) point gets highly affected for the majority spin channel, showing astonishingly small transmission around \(\Gamma\) and the resonant tunneling states are also diminished. However, transmission for the minority states are not largely affected with increasing barrier thickness (Figure S10).[57] This large decrement in the majority spin transmission can be explained form the majority spin band structure of the bulk cubic Fe\({}_{2}\)CrTe (Figure 3), where we do not observe any bands crossing the E\({}_{F}\) along the \(\Gamma\) - X direction (\(i.e\) along the propagation direction (001). These bands are mainly responsible for the highly spin-polarized transmission[3; 71; 3], provided that those bands have some preferred orbital character. Due to the absence of such bands along the \(\Gamma\)-X direction in the majority spin channel, we observe large decrement in the majority spin transmission with increasing barrier thickness (Table V and Figure S10[57]). To understand why larger TMR ratio is possible for the tetragonal phase as compared to the cubic phase, Figure 11: K-resolved Transmittance in parallel magnetization case for Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe heterojunction with Cr-Te interface for 5 ML of with cubic phase of Fe\({}_{2}\)CrTe: Top and bottom panels are for parallel (PC) and anti-parallel spin configurations (APC), respectively. we further investigate the microscopic tunneling process for the tetragonal phase. In Figure 12, we have plotted the spin-and k-resolved transmission coefficients at E\({}_{F}\), T\({}^{\sigma}(E_{F},K_{||})\) for the tetragonal Fe\({}_{2}\)CrTe phase in both PC and APC states. This provides a vivid picture of how tunneling process can be realized in this heterojunction. At a first glance, all the transmission patterns (including parallel and anti-parallel) have a four-fold rotational symmetry, which is in accordance with the C\({}_{4v}\) symmetry of the MTJ heterostructure. We note that for the majority spin electrons in the PC state, the very sharp transmission features around the \(\Gamma\) point dominate the transmission process. However, minority spin electrons in the PC state show \(\Gamma\)-centric transmission, which are of much weaker intensity. We observe for the tetragonal phase that there is an overall increase in the transmission of the majority as well as of the minority spins around the \(\Gamma\) point in the parallel configuration, as compared to the cubic phase. This is primarily due to the presence of \(\Delta_{1}\) symmetric bands in the bulk tetragonal phase, along the \(<001>\) direction. In the APC state, however, we find that there is a dramatic reduction in the transmission of both the spin channels (Figure 12), due to a stronger suppression of the electron tunneling proceess, which leads to the larger TMR ratio for the tetragonal phase as compared to the cubic phase. ## IV Conclusion In this work, we have carried out a first principles study on the structural, mechanical, electronic and transport properties of a novel full Heusler chalcogenide, Fe\({}_{2}\)CrTe. The compound is found to undergo a volume conserving tetragonal distortion and a clear minimum has been observed at c/a \(\sim\)1.26. The cubic phase shows a ferromagnetic behavior with a nearly half metallic character, whereas the tetragonal phase exhibits a ferrimagnetic and fully metallic nature. This behavior has been found to be robust against a sizable value of Hubbard onsite electron-electron correlation term for both the transition metal atoms. The compound is found to possess no negative phonon frequencies in both the phases and no martensite phase transition (MPT) was observed, as suggested from the temperature dependent free energy behavior. Further we have also established the mechanical stability of both the phases. We have also studied the effect of uniform strain on the electronic and mechanical properties of the system in cubic phase. It shows 100% SP on applying a negative uniform strain and the compound is found to be mechanically stable over almost the whole range of lattice constant. To probe the effect of substrate on various physical properties a thin film of 13 mono-layers of Fe\({}_{2}\)CrTe is placed on a MgO substrate, which shows Figure 12: K-resolved Transmittance in parallel magnetization case for Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe heterojunction with Cr-Te interface for 5 ML of MgO and with tetragonal phase of Fe\({}_{2}\)CrTe: Top and bottom panels are for parallel (PC) and anti-parallel spin configurations (APC), respectively. an energetically stable composite system and the spin polarization has been found to continue to be high for the cubic phase (above 70%). We have further investigated the transmission profile of Fe\({}_{2}\)CrTe/MgO/Fe\({}_{2}\)CrTe heterojunction in both the cubic and tetragonal phases. Spin-transport properties for the tetragonal phase looks promising for lower thickness of spacer layer (5 ML). Finally, in light of all the above discussions, synthesis and characterization of the predicted alloy seem essential to understand its structural, electronic, magnetic and spin transport properties and our present work awaits the experimental validation. ## V Acknowledgements Authors thank the director, RRCAT for facilities and encouragement. We thank A. Banerjee, H. Ghosh and T. Ganguli for scientific discussions. The scientific computing group, computer division of RRCAT, Indore is thanked for the help in installing and support in smooth running of the codes. JB thanks D. Pandey, A. Kumar for useful discussions during the work. JB and RD thank RRCAT and HBNI for financial support.

2304.12303

Inoculation strategies for bounded degree graphs

We analyze a game-theoretic abstraction of epidemic containment played on an undirected graph $G$: each player is associated with a node in $G$ and can either acquire protection from a contagious process or risk infection. After decisions are made, an infection starts at a random node $v$ and propagates through all unprotected nodes reachable from $v$. It is known that the price of anarchy (PoA) in $n$-node graphs can be as large as $\Theta(n)$. Our main result is a tight bound of order $\sqrt{n\Delta}$ on the PoA, where $\Delta$ is the maximum degree of the graph. We also study additional factors that can reduce the PoA, such as higher thresholds for contagion and varying the costs of becoming infected vs. acquiring protection.

Mason DiCicco, Henry Poskanzer, Daniel Reichman

2023-04-24T17:54:17Z

http://arxiv.org/abs/2304.12303v1

# Inoculation strategies for bounded degree graphs ###### Abstract We analyze a game-theoretic abstraction of epidemic containment played on an undirected graph \(G\): each player is associated with a node in \(G\) and can either acquire protection from a contagious process or risk infection. After decisions are made, an infection starts at a random node \(v\) and propagates through all unprotected nodes reachable from \(v\). It is known that the price of anarchy (PoA) in \(n\)-node graphs can be as large as \(\Theta(n)\). Our main result is a tight bound of order \(\sqrt{n\Delta}\) on the PoA, where \(\Delta\) is the _maximum degree_ of the graph. We also study additional factors that can reduce the PoA, such as higher thresholds for contagion and varying the costs of becoming infected vs. acquiring protection. ## 1 Introduction Networks can be conducive to the spread of undesirable phenomena such as infectious diseases, computer viruses, and false information. A great deal of research has been aimed at studying computational challenges that arise when trying to contain a contagious process [13, 1, 2, 3]. One factor that can contribute to the spread of contagion is the discrepancy between _locally_ optimal behavior of rational agents and _globally_ optimal behavior that minimizes the total cost to the agents in the network. For example, individuals in a computer network may prefer not to install anti-virus software because it is too expensive, whereas a network administrator may prefer to install copies at key points, limiting the distance a virus could spread and the global damage to the network. The former strategy would be considered a _locally optimal_ solution if each individual minimizes their own individual cost, whereas the latter strategy would be a _socially optimal_ solution if it minimizes the total cost to all individuals in the network. How much worse locally optimal solutions can be compared to the social optimum can be quantified by the classical game theoretic notions of _Nash equilibria_ and _price of anarchy_. (PoA) [14, 21]. Informally, given a multiplayer game, a strategy is a Nash equilibrium if no player can improve her utility by unilaterally switching to another strategy. Then, the PoA is the ratio of the total cost of the _worst_ Nash equilibrium to the social optimum. The larger the PoA, the larger the potential cost players in the game may experience due to selfish, uncoordinated behavior. Hence, it is of interest to investigate methods of reducing the PoA in games. We study the PoA of a game-theoretic abstraction of epidemic containment introduced by [1]. The _inoculation game_ is an \(n\)-player game in which each player is associated with a node in an undirected graph. A player can buy security against infection at a cost of \(C>0\), or they can choose to accept the risk of infection. If a node is infected, its player must pay a cost \(L>0\). After each player has made their decision, an adversary chooses a random starting point for the infection. The infection then propagates through the graph; any unsecured node that is adjacent to an infected node is also infected. It is known that the PoA of the inoculation game can be as large as \(\Omega(n)\), with the \(n\)-star (a node connected to \(n-1\) other nodes) being one example of a network leading to such a PoA*. This raises the question of the relationship between graph-theoretic parameters and the PoA of the inoculation game. This question was explicitly mentioned in [1] as an interesting direction for future research. Additional properties of the game may also influence the PoA, such as the relative costs of infection and security, or the threshold of infection. Footnote *: This is asymptotically the largest possible PoA; it is shown in [1] that in any \(n\)-node network the PoA is at most \(O(n)\). We study the relationship between the aforementioned factors and the PoA. One motivation for our study is that understanding the links between properties of the inoculation game and the PoA may shed light on methods for designing networks that are less susceptible to contagion. It may also shed light on the effectiveness of interventions (e.g., changing the cost of acquiring inoculations) aimed at controlling contagion. Specifically, we examine following questions: * Motivated by the relationship between "superspreaders" and contagion, we analyze how the _maximum degree_ influences the PoA, obtaining asymptotically tight upper and lower bounds in terms of the number of nodes \(n\) and the maximum degree \(\Delta\). We also study the PoA in graphs with certain structural properties, such as planar graphs. * One can try to reduce the PoA by changing the values of \(C\) and \(L\) (e.g., by making inoculations more accessible). Previous results regarding the PoA [1, 1] typically examined fixed values of \(C\) and \(L\). In contrast, we analyze the PoA for specific networks for all \(C\) and \(L\). * _Complex contagion_ refers to contagion models where a node becomes infected only if multiple neighbors are infected. We study the case where the threshold for contagion is 2 (as opposed to 1) and provide very simple analysis of the PoA for certain networks in this contagion model. We also record the asymptotic PoA for graphs families such as trees, planar graphs and random graphs. Details can be found in the Appendix A. ### Preliminaries Following [1], we describe the infection model and the multiplayer game we study as well as a useful characterization of Nash equilibria. #### 1.1.1 Inoculation game Unless stated otherwise, we consider graphs with \(n\) nodes and identify the set of nodes by integers \([n]:=\{1,\cdots,n\}\). An _automorphism_ of a graph \(G\) is a permutation \(\sigma\) of its vertex set \([n]\) such that \(i\) is adjacent to \(j\) if and only if \(\sigma(i)\) is adjacent to \(\sigma(j)\). A graph \(G=(V,E)\) is _vertex transitive_ if for every two vertices \(i,j\in V\) there is automorphism \(f\) of \(G\) such that \(f(i)=j\). **Definition 1** (Inoculation game).: The inoculation game is a one-round, \(n\)-player game, played on an undirected graph \(G\). We assume \(G\) is a connected graph and each node is a player in the game. Every node \(i\) has two possible actions: Inoculate against an infection, or do nothing and risk being infected. Throughout the paper we assign \(1\) to the action of inoculating and \(0\) the action of not inoculating. We say the cost of inoculation is \(C>0\) and the cost of infection is \(L>0\). **Remark 1**.: We always assume that \(C\) and \(L\) are constants independent of \(n\), unless otherwise stated. In particular, our lower bounds generally require that the _ratio_\(C/L=\Theta(1)\). We discuss the relationship between the costs and the PoA in Section 1.2.2. The _strategy_ of each node \(i\) is the probability of inoculating, denoted by \(a_{i}\in[0,1]\), and the _strategy profile_ for \(G\) is represented by the vector \(\overrightarrow{\boldsymbol{a}}\in[0,1]^{n}\). If \(a_{i}\in\{0,1\}\), we call the strategy _pure_, and otherwise _mixed_. Note that a mixed strategy is a probability distribution \(\mathcal{D}\) over pure strategies. The cost of a mixed strategy profile to individual \(i\) is equal to the expected cost over \(\mathcal{D}\), \[\operatorname{cost}_{i}(\overrightarrow{\boldsymbol{a}}) =C\cdot\Pr(i\text{ inoculates})+L\cdot\Pr(i\text{ is infected})\] \[=C\cdot a_{i}+L\cdot(1-a_{i})p_{i}(\overrightarrow{\boldsymbol{a }}),\] where \(p_{i}(\overrightarrow{\boldsymbol{a}})\) denotes the probability that \(i\) becomes infected given strategy profile \(\overrightarrow{\boldsymbol{a}}\)_conditioned on \(i\) not inoculating_. The total social cost of \(\overrightarrow{\boldsymbol{a}}\) is equal to the sum of the individual costs, \[\operatorname{cost}(\overrightarrow{\boldsymbol{a}})=\sum_{i=1}^{n} \operatorname{cost}_{i}(\overrightarrow{\boldsymbol{a}}).\] **Definition 2** (Attack graph).: Given a strategy profile \(\overrightarrow{\boldsymbol{a}}\), let \(I_{\overrightarrow{\boldsymbol{a}}}\) denote the set of secure nodes (nodes which have inoculated). The _attack graph_, which we denote by \(G_{\overrightarrow{\boldsymbol{a}}}\), is the sub-graph induced by the set of insecure nodes: \[G_{\overrightarrow{\boldsymbol{a}}}=G\setminus I_{\overrightarrow{ \boldsymbol{a}}}.\] After every node has decided whether or not to inoculate, a node \(i\in V\) is chosen uniformly at random (over all nodes) as the starting point of the infection. If \(i\) is not inoculated, then \(i\) and every insecure node reachable from \(i\) in \(G_{\overrightarrow{\boldsymbol{a}}}\) are infected. Note that \(I_{\overrightarrow{\boldsymbol{a}}}\) and \(G_{\overrightarrow{\boldsymbol{a}}}\) are random variables unless \(\overrightarrow{\boldsymbol{a}}\) is pure. When the strategies are pure, [1] give the following characterization for the social cost: Figure 1: The two vertices in the shaded region are inoculated. The remaining vertices form the attack graph consisting of two connected components of sizes \(4\) and \(6\) respectively. **Theorem 1** ([1]).: _Let \(\overrightarrow{\mathbf{a}}\) be a pure strategy profile for a graph \(G\). Then,_ \[\operatorname{cost}(\overrightarrow{\mathbf{a}})=C|I_{\overrightarrow{\mathbf{a}}}|+ \frac{L}{n}\sum_{i=1}^{\ell}k_{i}^{2},\] _where \(k_{1},\cdots,k_{\ell}\) denote the sizes of the connected components in \(G_{\overrightarrow{\mathbf{a}}}\)._ #### 1.1.2 Nash equilibria **Definition 3** (Nash equilibrium).: A strategy profile \(\overrightarrow{\mathbf{a}}\) is a _Nash equilibrium_ (NE) if no nodes can decrease their individual cost by changing their own strategy. Formally, let \(\overrightarrow{\mathbf{a^{*}}}:=(a^{*}_{i},\overrightarrow{\mathbf{a^{*}_{-i}}})\) be a strategy profile where \(\overrightarrow{\mathbf{a^{*}_{-i}}}\) denotes the strategy profile of all players except node \(i\). Then, \(\overrightarrow{\mathbf{a^{*}}}\) is a Nash equilibrium if, for all \(i\), \[\operatorname{cost}_{i}((a^{*}_{i},\overrightarrow{\mathbf{a}}^{*}_{-i}))\leq \operatorname{cost}_{i}((a_{i},\overrightarrow{\mathbf{a^{*}_{-i}}}))\text{ for all }a_{i}\neq a^{*}_{i}.\] Similarly to arbitrary strategies, the cost of an NE is simply the sum of expected costs of the individual vertices. In the inoculation game, Nash equilibria are characterized by the expected sizes of the _connected components_ in the attack graph. **Theorem 2** ([1]).: _Let \(S(i)\) denote the expected size of the component containing node \(i\) in the attack graph **conditioned on \(i\) not inoculating**, and let \(t=Cn/L\). A strategy \(\overrightarrow{\mathbf{a}}\) is a Nash equilibrium if and only if every node satisfies the following:_ 1. _if_ \(a_{i}=0\)_, then_ \(S(i)\leq t\)__ 2. _if_ \(a_{i}=1\)_, then_ \(S(i)\geq t\)__ 3. _if_ \(0<a_{i}<1\)_, then_ \(S(i)=t\)__ This follows from the definition of Nash equilibria, recognizing that the threshold on the expected component size, \(t=Cn/L\), is the point where the cost of inoculating equals the (expected) cost of not inoculating, \(C=LS(i)/n\). The following upper bound regarding the cost of every Nash equilbrium was observed in [1]. **Corollary 1** ([1]).: _For any graph \(G\), every Nash equilibrium has cost at most \(\min\{C,L\}n\)._ Proof.: If \(C>L\), then the only Nash equilibrium is the strategy \(\overrightarrow{\mathbf{a}}=0^{n}\) where no node inoculates, which has cost \(Ln\). Otherwise, if \(C\leq L\), then the individual cost to any node is at most \(C\) (any node will switch its strategy to inoculate, if preferable.) **Remark 2**.: Later, we show that there exist graphs whose Nash equilibria meet the upper bound of Corollary 1; for all \(C,L>0\), there exists a Nash equilibrium with cost \(\min\{C,L\}n\). This property yields bounds on the PoA that are "stable" with respect to the costs \(C,L\). #### 1.1.3 Price of Anarchy **Definition 4** (Price of Anarchy).: The Price of Anarchy (PoA) of an inoculation game played on a graph \(G\) is equal to the ratio between the cost of the _worst_ Nash equilibrium to the cost of the socially optimal strategy+, Footnote †: Observe that as \(C,L>0\) the cost is always strictly positive. \[\mathrm{PoA}(G)=\frac{\max_{\overrightarrow{\mathbf{a}}:\mathrm{Nash\leavevmode \nobreak\ eq.}}\mathrm{cost}(\overrightarrow{\mathbf{a}})}{\min_{\overrightarrow{ \mathbf{a}}}\mathrm{cost}(\overrightarrow{\mathbf{a}})}.\] To upper bound the price of anarchy, we must lower bound the cost of the socially optimal strategy and upper bound the cost of the worst Nash equilibrium. By Corollary 1, we have the simple upper bound, \[\mathrm{PoA}(G)\leq\frac{\min\{C,L\}n}{\min_{\overrightarrow{\mathbf{a}}}\mathrm{ cost}(\overrightarrow{\mathbf{a}})} \tag{1}\] with equality when there exists a Nash equilibrium with maximum possible cost, \(\min\{C,L\}n\). ### Summary of results This section contains the statements for all of our main results. For each, we give a brief description of the conceptual idea behind each proof. #### 1.2.1 Bounding the PoA in terms of the maximum degree It was proved in [1] that the price of anarchy can be as large \(\Omega(n)\). Their lower bound is based on the star graph \(K_{1,n-1}\) where the optimal strategy (inoculating the root) has cost \(O(1)\). Note that inoculating the central node of the star is maximally "efficient," in that it splits the attack graph into \(n-1\) components. This notion of efficiency (i.e., number of components created per inoculation) is the crux of the following result. **Theorem 3**.: _Let \(G\) be a graph with maximum degree \(\Delta\). Then, \(\mathrm{PoA}(G)=O(\sqrt{n\Delta})\) for all \(C,L>0\)._ Proof Idea.: We make two observations for the sake of lower bounding the social optimum: 1. The number of components in the attack graph is bounded above by the number of edges leaving secure nodes. Therefore, if every secure node has degree at most \(\Delta\), then there are at most \(|I_{\overrightarrow{\mathbf{a}}}|\Delta\) insecure components. 2. In the ideal case (i.e., the optimal strategy), all components will have the same size. Then, the result follows from a straightforward manipulation of Theorem 1. We note that bounds on the PoA in terms of the number of nodes and the maximum degree have been stated before without proof. Please see the related work section for more details. We also show that Theorem 3 is the strongest possible upper bound; for arbitrary values of \(n\) and \(\Delta\), we can construct a graph \(G\) with price of anarchy \(\Omega(\sqrt{n\Delta})\). **Theorem 4**.: _For all \(n\geq 4\Delta-2\) and \(C\geq L\), there exists a graph \(G\) with \(\mathrm{PoA}(G)=\Omega(\sqrt{n\Delta})\)._ Proof Idea.: We construct a graph which is "ideal" with respect to notion of efficiency used in Theorem 3. In particular, it should be possible to inoculate \(\gamma\) nodes such that the attack graph contains \(\gamma\Delta\) equally-sized components. Such a graph is not difficult to come by. For instance, when \(\Delta=2\), the cycle graph \(C_{n}\) has this property for \(\gamma=\sqrt{n}\); inoculating every \(\sqrt{n}\)'th node will split the cycle into \(\sqrt{n}\) paths of equal length (up to rounding). #### 1.2.2 The relationship between PoA, \(C\) and \(L\) We have seen that if \(C=L\), then the strategy which inoculates no nodes is a Nash equilibrium with cost \(Ln\). Can we significantly decrease the cost of the worst-case equilibrium (and PoA) by decreasing \(C\), say to \(L/2\)? We prove that there are graphs for which the worst-case Nash equilibrium has cost \(Cn\) for any \(0<C\leq L\) (i.e., Corollary 1 cannot be improved due to a matching lower bound). This implies that the asymptotic PoA for these graphs remains the same so long as \(C/L=\Theta(1)\). We sketch the argument. **Lemma 1**.: _For a graph \(G\), let \(f(n):=\mathrm{PoA}(G)\) for costs \(C=L\). Suppose that, if \(L\) remains fixed but the cost of inoculation decreases to \(C^{\prime}<L\), then there is a Nash equilibrium in the new game of cost \(C^{\prime}n\). Let \(g(n):=\mathrm{PoA}(G)\) for costs \(C^{\prime}\) and \(L\). If \(C^{\prime}/L=\Theta(1)\), then \(g(n)=\Omega(f(n))\)._ Proof.: Reducing the cost of inoculation while keeping \(L\) fixed can only decrease the social optimum. On the other hand, by assumption, the cost of the worst case Nash equilibrium for the new game is equal to \(C^{\prime}n\). The result follows as we have seen that, when \(C=L\), the cost of the worst case Nash equilibrium is exactly \(Ln\). It follows that, to establish the asymptotic stability of PoA, it suffices to prove that there is a Nash equilibrium with cost \(Cn\) for all \(C<L\). By Theorem 2, when \(C\geq L\), the pure strategy in which no node inoculates is a Nash equilibrium with cost \(Ln\). Similarly, if \(C\leq L/n\), then the pure strategy in which every node inoculates is a Nash equilibrium with cost \(Cn\). However, if \(C\in(L/n,L)\), then it is not clear whether there is a Nash equilibrium with cost \(Cn\). We now show that, for certain graphs, _there is_ a Nash equilibrium of cost \(Cn\) for all \(0<C<L\) therefore establishing the asymptotic stability of the PoA for such graphs. We say that a Nash equilibrium is _fractional_ if no node has a pure strategy; every node \(i\) chooses her action with probability differing from 0,1. **Lemma 2**.: _The cost of every fractional Nash equilibrium is equal to \(Cn\)._ Proof.: Suppose strategy \(\overrightarrow{\boldsymbol{a}}\) is a Nash equilibrium with \(a_{i}\in(0,1)\) for all \(i\). As a consequence of Theorem 2, the expected component size \(S(i)=Cn/L\) for all \(i\). Thus, probability of infection for any node \(i\) is equal to \(p_{i}(\overrightarrow{\boldsymbol{a}})=C/L\). By definition, \[\mathrm{cost}(\overrightarrow{\boldsymbol{a}})=\sum_{i=1}^{n}C\cdot a_{i}+L \cdot(1-a_{i})\frac{C}{L}=Cn.\] It is non-trivial to show a fractional equilibrium exists (note that Nash's theorem does not guarantee existence because the space of fractional strategies is not compact). However, it is possible to show that some graphs will always exhibit such an equilibrium. **Theorem 5**.: _Let \(G=K_{1,n-1}\) (i.e., the \(n\)-star). For all \(C\in(L/n,L)\), there exists a fractional Nash equilibrium._ Proof Idea.: The structure of the star enables us to explicitly calculate \(S(i)\) for a family of fractional strategies \(\{\overrightarrow{\mathbf{a_{q}}}\}_{q\in(0,1)}\). Furthermore, this family of strategies has the property that \(S(i)\) is the same continuous function of \(q\) for all \(i\), with \(\lim_{q\to 0}S(i)=n\) and \(\lim_{q\to 1}S(i)=1\). Thus, there must exist a \(q\in(0,1)\) such that \(S(i)=Cn/L\) for all \(i\) (i.e., a fractional Nash equilibrium). In fact, we can show that if the graph is very symmetric, then there always exists a fractional Nash equilibrium. **Theorem 6**.: _Suppose \(G\) is vertex-transitive. Then, for all \(C\in(L/n,L)\), there exists a fractional Nash equilibrium._ Proof Idea.: Vertex-transitivity means that every pair of nodes \(i\neq j\) are indistinguishable based on local graph structure. Then, a sufficiently "symmetric" strategy should exhibit symmetry in the expected component sizes. Indeed, consider the strategy \(\overrightarrow{\mathbf{a_{p}}}\) in which every node inoculates with the same probability \(p\). We prove that, under this strategy, \(S(i)\) is the _same_ continuous function of \(p\in(0,1)\) for all \(i\). Thus, there must exist a \(p\) such that \(\overrightarrow{\mathbf{a_{p}}}\) is a fractional Nash equilibrium. #### 1.2.3 Bounding the PoA for larger thresholds of infection We study the price of anarchy when the threshold of infection is higher; the adversary initially infects two different nodes, and an insecure node becomes infected if _multiple_ of its neighbors are infected. In particular, we prove that the price of anarchy can still be \(\Omega(n)\) in this scheme. We first show that the price of anarchy can dramatically decrease when all thresholds are \(2\). Recall that [1] proved that the star graph \(K_{1,n-1}\) has price of anarchy \(\Omega(n)\) (for threshold \(1\)). In contrast, we have the following: **Theorem 7**.: _Suppose that the threshold of every node is \(2\). Then, \(\operatorname{PoA}(K_{1,n-1})=O(1)\)._ Proof Idea.: Because a leaf has degree one, it can only become infected if chosen as the starting point. This means that the only node whose cost is influenced by the rest of the graph is the center. As the majority of players are effectively independent, the price of anarchy must be relatively low. However, even when all thresholds equal \(2\), there are still cases where the price of anarchy is \(\Omega(n)\). **Theorem 8**.: _If \(C\geq L\), then there exists a graph \(G\) for which \(\operatorname{PoA}(G)=\Omega(n)\)._ Proof Idea.: When thresholds are \(1\), the star has a high price of anarchy because any node will infect the entire graph, but only one inoculation is required to split the graph into many components. The natural idea for threshold \(2\) is to construct a graph in which any _two_ nodes will infect the entire graph, but only two inoculations are required to split the graph into many components (see Figure 3). ### Related work The seminal paper of [1] introduced the inoculation game and showed constructively that every instance of the inoculation game has a pure Nash equilibrium, and some instances have many. In the same paper, it is shown that the price of anarchy for an arbitrary graph is at most \(O(n)\), and that there exists a graph with price of anarchy \(n/2\). Subsequent work has studied PoA on graph families such as grid graphs [14] and expanders [13]. Several works have extended the basic model of [1] to analyze the effect of additional _behaviors_ on the PoA. For instance, [14] extend the model to include _malicious_ players whose goal is to maximize the cost to society. They prove that the social cost deteriorates as the number of malicious players increases, and the effect is magnified when the selfish players are _unaware_ of the malicious players. Somewhat conversely, [1] extend the model to include _altruistic_ players who consider a combination of their individual cost and the social cost (weighted by a parameter \(\beta\)). They prove that the social cost does indeed decrease as \(\beta\) increases. Finally, [15] consider a notion of _friendship_ in which players care about the welfare of their immediate neighbors. Interestingly, although a positive friendship factor \(F>0\) is always preferable, the social cost does not necessarily decrease as \(F\) increases. The question of how to reduce the PoA has been studied before (e.g., [12]). For a survey regarding methods to reduce the PoA, see [10]. The general question here is the following: how can we modify some aspect of a game to lower the PoA? To this end, variations on the _infection process_ (rather than the players) have also been studied; [13] examine the price of anarchy in terms of the _distance_, \(d\), that the infection can spread from the starting point. They prove that the when \(d=1\), the price of anarchy is at most \(\Delta+1\), where \(\Delta\) is the maximum degree of the graph. In this work, we comment on a _complex contagion_ extension of the model, where nodes only become infected if _multiple_ neighbors are infected. We show that this modification does not unilaterally decrease the PoA. There is a vast literature on complex contagion for variety of graph families [11, 12, 13, 14, 15]. We are not aware of previous work that studies the PoA in our setting where every node has threshold \(2\) for infection. There are many classical models of epidemic spread. One of the most popular of these is the _SIS model_[10], which simulates infections like the flu, where no immunity is acquired after having been infected (as opposed to the _SIR model_[11], in which individuals recover with permanent immunity). In this model, it was shown by [13] that the strategy which inoculates the highest-degree nodes in power-law random graphs has a much higher chance of eradicating viruses when compared to traditional strategies. It is also known that that the price of anarchy here increases as the expected proportion of high-degree nodes decreases [10]. Furthermore, it is established by [12, 13, 14] that epidemics die out quickly if the _spectral radius_ (which is known to be related to the maximum degree [18]) is below a certain threshold. This initiated the development of graph algorithms dedicated to minimizing the spectral radius by inoculating nodes [1]. [10] consider the PoA in the inoculation game in graphs with maximum degree \(\Delta\). They state in their paper: "Indeed, we can show that even in the basic model of Aspnes et al. without altruism, the Price of Anarchy is bounded by \(\sqrt{n\Delta}\) if all degrees are bounded by \(\Delta\) (whereas the general bound is \(\Theta(n)\))." A similar statement is made in the PhD thesis [10] of one of the authors of [10]. Both [10] and [10] do not include proofs of these statements. We are not aware of a published proof of either a lower bound or an upper bound for the PoA in graph in terms of the maximum degree \(\Delta\) and the number of nodes. ## 2 PoA in terms of maximum degree In this section we prove Theorems 3 and 4. **Remark 3**.: As a mixed strategy is simply a distribution over pure strategies, the optimal cost can always be realized by a pure strategy. This enables the use of Theorem 1 to bound the optimal cost. Proof of Theorem 3.: Suppose \(\gamma>0\) nodes are inoculated by strategy \(\overrightarrow{\boldsymbol{a}}\) and let \(k_{1}\leq\cdots\leq k_{\ell}\) denote the sizes of the connected components in \(G_{\overrightarrow{\boldsymbol{a}}}\). (If \(\gamma=0\), then \(\mathrm{cost}(\overrightarrow{\boldsymbol{a}})=Ln\) and thus \(\mathrm{PoA}(G)=1\).) By convexity, \(\sum_{i=1}^{\ell}k_{i}^{2}\) is minimized when all components have the same size, \(k_{i}=\dfrac{n-\gamma}{\ell}\) for all \(i\). Thus, the optimal solution has cost at least \[\mathrm{cost}(\overrightarrow{\boldsymbol{a}^{\frac{1}{\delta}}})\geq\min\{C,L\}\min_{\gamma}\left(\gamma+\frac{1}{n}\frac{\left(n-\gamma\right)^{2}}{ \ell}\right) \tag{2}\] Note that every inoculation adds at most \(\Delta\) components to the attack graph (i.e., \(\ell\leq\gamma\Delta\)), and (2) becomes \[\mathrm{cost}(\overrightarrow{\boldsymbol{a}^{\frac{1}{\delta}}})\geq\min\{C,L\}\min_{\gamma}\left(\gamma\left(1+\frac{1}{\Delta n}\right)+\frac{n}{ \gamma\Delta}-\frac{2}{\Delta}\right)\] The function \(f(\gamma)=\gamma\left(1+\dfrac{1}{\Delta n}\right)+\dfrac{n}{\gamma\Delta}- \dfrac{2}{\Delta}\) is clearly convex and attains its minimum when \(\gamma=\dfrac{n}{\sqrt{1+\Delta n}}\). Substituting this value yields \[\mathrm{cost}(\overrightarrow{\boldsymbol{a}^{\frac{1}{\delta}}})\geq\min\{C,L\}\dfrac{2\sqrt{n\Delta+1}-1}{\Delta}.\] Corollary 1 completes the proof. Note that the \(\min\{C,L\}\) term is cancelled out; the price of anarchy bound is independent of \(C,L\). Proof of Theorem 4.: Consider an arbitrary \(\Delta\)-regular graph \(G\) on \(m=2\sqrt{n/\Delta}\) vertices \(v_{1},\cdots,v_{m}\). We construct a new graph \(G^{\prime}\) with \(n\) vertices by replacing the edges of \(G\) with (disjoint) paths of length \(\ell=(n-m)/(m\Delta/2)=\sqrt{n/\Delta}-2/\Delta\). (Round path lengths such that the total number of nodes is \(n\).) Consider the strategy which secures \(v_{1},\cdots,v_{m}\). The inoculations cost \(Cm\) and create \(m\Delta/2\) components in \(G^{\prime}\) of size \(\ell\). This strategy upper bounds the cost of the optimal strategy by \[Cm+L(n-m)\frac{\ell}{n}=2C\sqrt{n/\Delta}+2L\frac{\left(n-2\sqrt{n/\Delta} \right)^{2}}{\sqrt{n^{3}\Delta}}=O(\sqrt{n/\Delta}).\] As \(C\geq L\), the worst case Nash equilibrium has cost \(Ln\). ## 3 Existence of fractional equilibria In this section we prove Theorems 5 and 6. Proof of Theorem 5.: Let \(\overrightarrow{\boldsymbol{d}}\) be the strategy in which every leaf inoculates with probability \(p\) and the root inoculates with probability \(q\). Then, * \(S(\text{root})=1+(1-p)(n-1)\), * \(S(\text{leaf})=q+(1-q)[2+(1-p)(n-2)]\). It is easy to verify that \(S(\text{root})=S(\text{leaf})=\dfrac{n-q}{(n-2)q+1}\) when \(p=\dfrac{(n-1)q}{(n-2)q+1}\). The former expression is a continuous function of \(f(q):[0,1]\to[1,n]\), with \(f(0)=n\) and \(f(1)=1\). Thus, for all \(C\in(L/n,L)\), there exists a \(q\in(0,1)\) such that \(S(\text{root})=S(\text{leaf})=\dfrac{Cn}{L}\) (i.e., \(\overrightarrow{\boldsymbol{d}}\) is a fractional Nash equilibrium). Proof of Theorem 6.: We prove that there exists a \(p\in(0,1)\) such that the strategy \(\overrightarrow{\boldsymbol{a_{p}}}=p^{n}\) is a fractional Nash equilibrium. By the definition of vertex-transitivity, for any two nodes \(i\neq j\), there exists an automorphism \(f:G\to G\) such that \(f(i)=j\). Figure 2: The inoculation strategy for this instance the graph constructed in Theorem 4 inoculates 4 nodes, creating six disjoint paths of size 2. This has cost significantly lower than the worst Nash equilibrium which does not inoculate at all. Consider an arbitrary set of inoculated nodes, \(A\), and their image, \(f(A)\). By definition, \[\Pr(I_{\overrightarrow{\boldsymbol{a}}}=A)=\Pr(I_{\overrightarrow{\boldsymbol{a }}}=f(A))=p^{|A|}(1-p)^{n-|A|}\] Let \(S(i|A)\) denote the size of the connected component containing \(i\) in the attack graph \(G\setminus A\). By vertex transitivity, \(S(i|A)=S(f(i)|f(A))=S(j|f(A))\). Then, by linearity of expectation, \[S(i) =\sum_{A}S(i|A)\Pr(I_{\overrightarrow{\boldsymbol{a}}}=A)\] \[=\sum_{A}S(j|f(A))\Pr(I_{\overrightarrow{\boldsymbol{a}}}=f(A))= S(j).\] Also note that \(S(i)\) is a polynomial in \(p\) satisfying \(\lim_{p\to 0}S(i)=n\) and \(\lim_{p\to 1}S(i)=1\). Therefore, for all \(C\in(L/n,L)\), there exists a \(p\in(0,1)\) such that \(S(i)=Cn/L\) for all \(i\). ## 4 Larger thresholds of infection In this section we prove Theorems 7 and 8. Proof of Theorem 7.: Any leaf node has only one neighbor and can only be infected if chosen at the start. Thus, \[p_{\mathrm{leaf}}(\overrightarrow{\boldsymbol{a}})=\frac{n-1}{\binom{n}{2}}= \frac{2}{n},\] and \(\mathrm{cost}_{\mathrm{leaf}}(\overrightarrow{\boldsymbol{a}})=Ca_{i}+\frac {2L(1-a_{i})}{n}\). Then, for large enough \(n\), no leaf node will inoculate in a Nash equilibrium. Therefore, the worst case Nash equilibrium has cost at most \[\max\{L,C\}+L\cdot(n-1)\frac{2}{n}=\max\{L,C\}+2L\left(1-\frac{1}{n}\right)\] Now consider the optimal strategy. If at least one node inoculates with probability \(a_{i}\geq 1/2\), then \(\mathrm{cost}(\overrightarrow{\boldsymbol{a}^{\star}})\geq C/2\). Otherwise, the root (if insecure) is infected with probability at least \(1/4\); either it is chosen at the start, or two insecure nodes are chosen. As the root inoculates with probability at most \(1/2\), the optimal social cost is at least \(L/8\). Proof of Theorem 8.: Consider the graph \(G=K_{2,n-2}\) with an edge between the two nodes on the smaller side. A Nash equilibrium where every node chooses not to inoculate has cost \(Ln\) as every two nodes will infect the entire graph. On the other hand, the strategy which inoculate both nodes on the smaller side upper bounds the cost of the social optimum by \[\mathrm{cost}(\overrightarrow{\boldsymbol{a}^{\star}})\leq 2C+(n-2)\cdot L\cdot \frac{2}{n}\leq 2(C+L)\] Hence \(\mathrm{PoA}(G)=\Omega(n)\), concluding the proof. ## Acknowledgements We are grateful to James Aspnes, David Kempe and Ariel Procaccia for useful comments. We thank the anonymous reviews for their feedback and suggesting a simpler proof of Theorem 4. Part of this work was done while the third author was visiting the Simons Institute for the Theory of Computing. Their hospitality is greatly acknowledged.

2306.04318

$J/Ψ$ suppression in a rotating magnetized holographic QGP matter

We study the dissociation effect of $J/\Psi$ in magnetized, rotating QGP matter at finite temperature and chemical potential using gauge/gravity duality. By incorporating angular velocity into the holographic magnetic catalysis model, we analyze the influence of temperature, chemical potential, magnetic field, and angular velocity on the properties of $J/\Psi$ meson. The results reveal that temperature, chemical potential, and rotation enhance the dissociation effect and increase the effective mass in the QGP phase. However, the magnetic field suppresses dissociation, and its effect on the effective mass is non-trivial. Additionally, we explore the interplay between magnetic field and rotation, identifying a critical angular velocity that determines the dominant effect. As a parallel study, we also examine the rotation effect in the holographic inverse magnetic catalysis model, although the magnetic field exhibits distinctly different behaviors in these two models, the impact of rotation on the dissociation effect of $J/\Psi$ is similar. Finally, we investigate the influence of electric field and demonstrate that it also speeds up the $J/\Psi$ dissociation.

Yan-Qing Zhao, Defu Hou

2023-06-07T10:32:51Z

http://arxiv.org/abs/2306.04318v1

# \(J/\Psi\) suppression in a rotating magnetized holographic QGP matter ###### Abstract We study the dissociation effect of \(J/\Psi\) in magnetized, rotating QGP matter at finite temperature and chemical potential using gauge/gravity duality. By incorporating angular velocity into the holographic magnetic catalysis model, we analyze the influence of temperature, chemical potential, magnetic field, and angular velocity on the properties of \(J/\Psi\) meson. The results reveal that temperature, chemical potential, and rotation enhance the dissociation effect and increase the effective mass in the QGP phase. However, the magnetic field suppresses dissociation, and its effect on the effective mass is non-trivial. Additionally, we explore the interplay between magnetic field and rotation, identifying a critical angular velocity that determines the dominant effect. As a parallel study, we also examine the rotation effect in the holographic inverse magnetic catalysis model, although the magnetic field exhibits distinctly different behaviors in these two models, the impact of rotation on the dissociation effect of \(J/\Psi\) is similar. Finally, we investigate the influence of electric field and demonstrate that it also speeds up the \(J/\Psi\) dissociation. ###### Contents * 1 Introduction * 2 Holographic QCD model * 3 The spectral functions * 3.1 Turning on the angular momentum * 3.2 Adding a constant electric field to the background * 4 Numerical Results of spectral functions in a magnetized rotating plasma * 4.1 Turning on a constant magnetic field * 4.2 Turning on angular momentum * 4.2.1 The case of magnetized-rotating QGP with MC * 4.2.2 The case of magnetized-rotating QGP with IMC * 4.3 Turning on electric field * 5 Summary and discussion * A The effect of rotating QGP on \(J/\Psi\) dissociation in a holographic inverse magnetic catalysis model ## 1 Introduction In ultra-relativistic heavy-ion collisions, a new, strongly interacting matter state known as QGP [1] is created. In order to fully understand the hot and dense plasma, as one of the best probes, the final yield of dilepton from heavy quarkonium (\(J/\Psi\) and \(\Upsilon(1S)\)) is used to study the properties of QGP. The formation time of charm quark is about \(\tau_{c}\sim 1/2m_{c}\approx 0.06\,\)fm/c and about \(\tau_{b}\sim 1/2m_{b}\approx 0.02\,\)fm/c for bottom quark [2]. The original concept of quarkonium suppression is from Matsui and Satz [3]. The bound state is produced in the initial stage of heavy-ion collision and then gets dissociated into free quarks when it passes through the QGP medium, which leads to the decrease of final output(the dilepton), this phenomenon is called quarkonium suppression. So far, there are two mechanisms that can be used to explain the reduction of quarkonium, namely: (1) Hot nuclear matter (HNM) effects---the reduction is caused by the existence of QGP medium; The HNM effects include: 1 The rotation of QGP medium, _rotating effect_; 2 The temperature for QGP medium, _thermal effect_; 3 The baryon chemical potential, _density effect_. (2) Cold nuclear matter (CNM) effects---the decrease is resulted in by those matters other than QGP medium. The CNM effects include [4, 5]: 1 Parton distribution in the nuclei, the _nPDF effects_; 2 Inelastic collision between the quarkonium and nucleons, the _nuclear absorption_; 3 Interaction of the quarkonium with co-moving particles, resulting in the melting of bound state, the _co-mover dissociation_; 4 The Parton energy loss during multiple scattering process, the _energy loss_; \(\circled{5}\) Electromagnetic field generated by bystanders, the _electromagnetic effect_. Experimentally, the suppression of \(J/\Psi\) production has already been observed in Au+Au collisions at \(\sqrt{s_{NN}}=200\,\)GeV through the dimuon channel at STAR [6], where the \(J/\Psi\) yields are measured in a large transverse momentum range(\(0.15\,\)GeV/c \(\leq p_{T}\leq 12\,\)GeV/c) from central to peripheral collisions. They find the \(J/\Psi\) yields are suppressed by a factor of approximately 3 for \(p_{T}>5\,\)GeV/c in the \(0-10\%\) most central collisions. Theoretically, heavy quarkonium may survive, due to the Coulomb attraction between quark and antiquark, as bound states above the deconfinement temperature. By using the maximum entropy method (MEM), Ref. [7] studies the correlation functions of \(J/\Psi\) at finite temperature on \(32^{3}*(32-96)\) anisotropic lattices, the conclusions indicate \(J/\Psi\) could survive in the plasma up to \(T_{d}\sim 1.6T_{c}\) and melt at \(1.6T_{c}\leq T_{d}\leq 1.9T_{c}\). Lattice data [8] find \(J/\Psi\) could survive up to \(1.5T_{c}\) and vanish at \(3T_{c}\). Gauge/gravity duality has emerged as a valuable tool for investigating the properties of heavy quarks. Holographic methods have been extensively employed to study heavy flavor properties [9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]. In Ref. [9], we investigate the vector meson spectral function using a dynamical AdS/QCD model. Our results reveal that the enhancement of heavy quarkonium dissociation is influenced by the magnetic field, chemical potential, and temperature. Specifically, we observe non-trivial changes in the peak position of \(J/\Psi\), which we attribute to the interplay between the interaction of the two heavy quarks and the interaction of the medium with each heavy quark. Interestingly, by introducing a dilaton in the background action, we demonstrate that the magnetic field has a more pronounced impact on heavy meson dissociation when it aligns with the polarization, contrary to the findings in the EM model discussed in Ref. [32]. In Ref. [33], the binding energy of heavy quarkonium in the quark-gluon plasma (QGP) and hadronic phase is examined. The results reveal that the dissociation length of heavy mesons decreases with increasing temperature or quark chemical potential in the QGP. However, in the hadronic phase, the dissociation length increases with an increase in the chemical potential. This phenomenon is attributed to two distinct dissociation mechanisms: the screening of the interaction between heavy quarks by light quarks in the deconfinement phase, and the breaking of the heavy meson into two heavy-light quark bound states in the confinement phase. Furthermore, Ref. [34] identifies the existence of a second lower critical temperature for certain magnetic field intensities, below which stable mesons cease to exist. This is termed Magnetic Meson Melting (MMM), extending the understanding of meson melting in the presence of varying magnetic field intensities. Ref. [35] calculates the ratios of dissociation temperatures for \(J/\Psi\) using the U-ansatz potential and finds agreement with lattice results within a factor of two. Additionally, Ref. [36] investigates heavy quarkonia spectroscopy at both zero and finite temperature using a bottom-up AdS/QCD approach, predicting the melting temperature of \(J/\Psi\) to be approximately 415 MeV (\(\sim 2.92T_{c}\)). In this work, we investigate the behavior of heavy vector mesons in the rotating magnetized quark-gluon plasma (QGP) created at RHIC and LHC. As previously mentioned, although there are numerous non-perturbative methods available, including the state-of-the-art lattice QCD [38, 39, 40, 41, 42], for the study of heavy vector meson spectral functions, the emphasis has primarily been on exploring the thermal and density effects of the quark-gluon plasma (QGP) and the strong magnetic field effects. However, these properties merely capture a fraction of the complete QGP environment. Furthermore, the state-of-the-art lattice data not only support the scenario of inverse magnetic catalysis(IMC) [43], where the transition temperature decreases as the magnetic field increases for temperatures slightly above the critical temperature, but also present compelling evidence for magnetic catalysis(MC) [44] in the deconfinement phase diagram. In MC, the transition temperature increases as the magnetic field intensifies for temperatures not significantly higher than the critical temperature. Therefore, it is of utmost importance to take into account the MC, which holds an equally prominent position as inverse magnetic catalysis, along with other factors in order to simulate the influence of the QGP medium more accurately on the properties of heavy vector mesons. To bridge the existing gap, we also consider additional factors, such as medium rotation, electric fields, and magnetic field effects, which pose significant challenges for the current state-of-the-art lattice techniques. Using holographic methods, one of the non-perturbative approaches, we explore the interplay of these factors and their impact on heavy vector meson properties. The rest structure of this paper is organized as follows. In section 2, we set up the holographic magnetic catalysis model. In section 3, we display the specific derivation process for calculating the spectral functions of \(J/\Psi\) by introducing different field effects. In section 4, we show and discuss the meaningful results. Finally, this work is ended with a summary and a discussion in section 5. ## 2 Holographic QCD model We consider a 5d EMD gravity system with a Maxwell field and a dilaton field as a thermal background for the corresponding hot, dense, magnetized QCD. The action is given as \[\mathcal{S} = \frac{1}{16\pi G_{5}}\int d^{5}x\sqrt{-g}\left[\mathcal{R}-\frac {1}{2}\nabla_{\mu}\phi_{0}\nabla^{\mu}\phi_{0}-\frac{f(\phi_{0})}{4}F_{\mu\nu }F^{\mu\nu}-V(\phi_{0})\right]. \tag{2.1}\] where \(F_{\mu\nu}\) is the field strength tensor for U(1) gauge field, \(f(\phi_{0})\) is the gauge coupling kinetic function, \(\phi_{0}\) is the dilaton field. \(V(\phi_{0})\) is the potential of the \(\phi_{0}\). As the dual system lives in a spatial plane, we choose Poincare coordinates with \(\tilde{z}\) the radial direction in the bulk. The metric ansatz reads [45] \[\tilde{g}_{\mu\nu}d\tilde{x}^{\mu}d\tilde{x}^{\nu} =w_{E}(z)^{2}\bigg{(}-b(z)d\tilde{t}^{2}+\frac{d\tilde{z}^{2}}{b( z)}+(d\tilde{x}_{2}^{2}+d\tilde{x}_{3}^{2})+e^{-Bz^{2}}d\tilde{x}_{1}^{2} \bigg{)},\] \[\phi_{0} =\phi_{0}(\tilde{z}),\quad A_{\mu}=(A_{t}(\tilde{z}),0,0,A_{3}( \tilde{x}_{2}),0), \tag{2.2}\] with \[b(\tilde{z}) =1-\frac{I_{1}(\tilde{z})}{I_{1}(\tilde{z}_{h})}+\frac{\mu^{2}}{I_{2 }^{2}(\tilde{z}_{h})I_{1}(\tilde{z}_{h})}(I_{1}(\tilde{z}_{h})I_{3}(\tilde{z})-I _{1}(\tilde{z})I_{3}(\tilde{z}_{h}))+\frac{B^{2}}{I_{1}(\tilde{z}_{h})}(I_{1}( \tilde{z}_{h})I_{4}(\tilde{z})-I_{1}(\tilde{z})I_{4}(\tilde{z}_{h})),\] \[I_{1}(\tilde{z}) =\int_{0}^{\tilde{z}}\frac{dy}{w_{E}^{3}e^{-\frac{1}{2}By^{2}}}, \hskip 36.135ptI_{2}(\tilde{z})=\int_{0}^{\tilde{z}}\frac{dy}{w_{E}fe^{- \frac{1}{2}By^{2}}},\hskip 36.135ptI_{3}(\tilde{z})=\int_{0}^{\tilde{z}}I_{1}^{ \prime}(y)I_{2}(y)dy,\] \[I_{4}(\tilde{z}) =\int_{0}^{\tilde{z}}I_{1}^{\prime}(y)I_{5}(y)dy,\hskip 36.135ptI _{5}(\tilde{z})=\int_{0}^{\tilde{z}}w_{E}fe^{-\frac{1}{2}By^{2}}dy, \tag{2.3}\] where \(w_{E}(\tilde{z})=\frac{1}{\tilde{z}}e^{\frac{-c\tilde{z}^{2}}{3}-p\tilde{z}^ {4}}\) denotes the warped factor, \(c=1.16\), \(p=0.273\) determines the transition point at \(\tilde{\mu}=B=0\) fixed by fitting the lattice QCD data [46, 47]. It should be noted that we use the notation, \(\tilde{x}^{\mu}=(\tilde{t},\tilde{z},\tilde{x}_{1},\tilde{x}_{2},\tilde{x}_{ 3})\), to represent the static frame and \(x^{\mu}=(t,z,x_{1},x_{2},x_{3})\) to represent the rotating frame. The AdS boundary at \(\tilde{z}=0\). Here we have turned on a constant magnetic field \(B\) along the \(\tilde{x}_{1}\) direction in the dual field theory. The Hawking temperature can be calculated by surface gravity \[T(\tilde{z}_{h},\tilde{\mu},B)=\frac{I_{1}^{\prime}(\tilde{z}_{h})}{4\pi I_{ 1}(\tilde{z}_{h})}(1-\tilde{\mu}^{2}\frac{I_{1}(\tilde{z}_{h})I_{2}(\tilde{z} _{h})-I_{3}(\tilde{z}_{h})}{I_{2}^{2}(\tilde{z}_{h})}-B^{2}(I_{1}(\tilde{z}_{ h})I_{5}(\tilde{z}_{h})-I_{4}(\tilde{z}_{h}))). \tag{2.4}\] In this paper, the deconfinement phase transition temperature for zero chemical potential and magnetic field is at \(\tilde{T}_{c}=0.6\)GeV [45]. ## 3 The spectral functions In this section, we will calculate the spectral function for \(J/\Psi\) state by a phenomenological model proposed in Ref. [37]. In order to go smoothly later, we assume the metric has general forms as follows, \[ds^{2}=-g_{tt}dt^{2}+g_{x_{1}x_{1}}dx_{1}^{2}+g_{tx_{1}}dtdx_{1}+g_{x_{1}t}dx_{ 1}dt+g_{x_{2},x_{2},3}dx_{2,3}^{2}+g_{zz}dz^{2}. \tag{3.1}\] The vector field \(A_{m}=(A_{\mu},A_{z})(\mu=0,1,2,3)\) is used to represent the heavy quarkonium, which is dual to the gauge theory current \(J^{\mu}=\overline{\Psi}\gamma^{\mu}\Psi\). The standard Maxwell action takes the following form \[S=-\int d^{4}xdz\frac{Q}{4}F_{mn}F^{mn}, \tag{3.2}\] where \(F_{mn}=\partial_{m}A_{n}-\partial_{n}A_{m}\), \(Q=\frac{\sqrt{-g}}{h(\phi)g_{5}{}^{2}}\), \(h(\phi)=e^{\phi(z)}\). The function \(\phi(z)\) is used to parameterize vector mesons, \[\phi(z)=\kappa^{2}z^{2}+Mz+\tanh(\frac{1}{Mz}-\frac{\kappa}{\sqrt{\Gamma}}). \tag{3.3}\] where \(\kappa\) labels the quark mass, \(\Gamma\) is the string tension of the quark pair and \(M\) denotes a large mass related to the heavy quarkonium non-hadronic decay. The value of three energy parameters for charmonium in the scalar field, determined by fitting the spectrum of masses [32], are respectively: \[\kappa_{c}=1.2{\rm GeV},\quad\sqrt{\Gamma_{c}}=0.55{\rm GeV},\quad M_{c}=2.2{ \rm GeV}\,. \tag{3.4}\] The spectral functions for \(J/\Psi\) state will be calculated with the help of the membrane paradigm [48]. The equation of motion obtained from Eq. (3.2) are as follows \[\partial_{m}(QF^{mn})=\partial_{z}(QF^{zn})+\partial_{\mu}(QF^{\mu n}), \tag{3.5}\] where \(F^{mn}=g^{m\alpha}g^{n\beta}F_{\alpha\beta}\), \(n=(0,1,2,3,4)\) and \(\mu=(0,1,2,3)\). For the \(z\)-foliation, the conjugate momentum of the gauge field \(A^{\mu}\) is given by the following formula: \[j^{\mu}=-QF^{z\mu}. \tag{3.6}\] Supposing plane wave solution for vector field \(A^{\mu}\) propagates in the \(x_{1}\) direction. The equation of motion (3.5) can be written as two parts: longitudinal-the fluctuations along \((t,x_{1})\); transverse-fluctuations along \((x_{2},x_{3})\). Combined with Eq.(3.6), the dynamical equations for longitudinal case from components \(t,x_{1}\) and \(z\) of Eq.(3.5) can be expressed as \[-\partial_{z}j^{t}-Q(g^{x_{1}x_{1}}g^{tt}+g^{x_{1}t}g^{tx_{1}}) \partial_{x_{1}}F_{x_{1}t}=0, \tag{3.7}\] \[-\partial_{z}j^{x_{1}}+Q(g^{tt}g^{x_{1}x_{1}}+g^{tx_{1}}g^{x_{1} t})\partial_{t}F_{x_{1}t}=0, \tag{3.8}\] The flow \(j^{\mu}\) conservation equation and the Bianchi identity can be written as: \[\partial_{x_{1}}j^{x_{1}}+\partial_{t}j^{t}=0, \tag{3.9}\] \[\partial_{z}F_{x_{1}t}-\frac{g_{zz}}{Q}\partial_{t}[g_{x_{1}x_{1 }}j^{x_{1}}+g_{x_{1}}j^{t}]-\frac{g_{zz}}{Q}\partial_{x_{1}}[g_{tt}j^{t}-g_{ tx_{1}}j^{x_{1}}]=0. \tag{3.10}\] The longitudinal "conductivity" and its derivative are defined as \[\sigma_{L}(\omega,z)=\frac{j^{x_{1}}(\omega,z)}{F_{x_{1}t}(\omega,z)}, \tag{3.11}\] \[\partial_{z}\sigma_{L}(\omega,z)=\frac{\partial_{z}j^{x_{1}}}{F_ {x_{1}t}}-\frac{j^{x_{1}}}{F_{x_{1}t}^{2}}\partial_{z}F_{x_{1}t}. \tag{3.12}\] Kubo's formula shows that the five-dimensional "conductivity" at the boundary is related to the retarded Green's function: \[\sigma_{L}(\omega)=\frac{-G_{R}^{L}(\omega)}{i\omega}. \tag{3.13}\] where \(\sigma_{L}\) is interpreted as the longitudinal AC conductivity. In order to obtain flow equation (3.12), we assume \(A_{\mu}=A_{n}(p,z)e^{-i\omega t+ipx_{1}}\), where \(A_{n}(p,z)\) is the quasinormal modes. Therefore, we have \(\partial_{t}F_{x_{1}t}=-i\omega F_{x_{1}t}\), \(\partial_{t}j^{x_{1}}=-i\omega j^{x_{1}}\). Finally, by using Eq.(3.8), Eq.(3.9), Eq.(3.10) and taking the momentum limit \(P=(\omega,0,0,0)\), the Eq.(3.12) can be written as \[\partial_{z}\sigma_{L}(\omega,z)=\frac{i\omega g_{x_{1}x_{1}}g_{zz}}{Q}( \sigma_{L}^{2}-\frac{Q^{2}(g^{tt}g^{x_{1}x_{1}}+g^{tx_{1}}g^{x_{1}t})}{g_{x_{1 }x_{1}}g_{zz}}). \tag{3.14}\] The initial condition for solving the equation can be obtained by requiring regularity at the horizon \(\partial_{z}\sigma_{L}(\omega,z)=0\). The dynamical equation of transverse channel is as follows: \[\partial_{z}j^{x_{2}}-Q[g^{tx_{1}}g^{x_{2}x_{2}}\partial_{t}F_{x _{1}x_{2}}-g^{tt}g^{x_{2}x_{2}}\partial_{t}F_{tx_{2}}+g^{x_{1}t}g^{x_{2}x_{2}} \partial_{x_{1}}F_{tx_{2}}+g^{x_{1}x_{1}}g^{x_{2}x_{2}}\partial_{x_{1}}F_{x_{1 }x_{2}}]=0, \tag{3.15}\] \[\frac{g_{x_{2}x_{2}}g_{zz}}{Q}\partial_{t}j^{x_{2}}+\partial_{z} F_{tx_{2}}=0,\] (3.16) \[\partial_{x_{1}}F_{tx_{2}}+\partial_{t}F_{x_{2}x_{1}}=0. \tag{3.17}\] The transverse "conductivity" and its derivative are defined as \[\sigma_{T}(\omega,z) =\frac{j^{x_{2}}(\omega,\overrightarrow{p},z)}{F_{x_{2}t}(\omega, \overrightarrow{p},z)}, \tag{3.18}\] \[\partial_{z}\sigma_{T}(\omega,z) =\frac{\partial_{z}j^{x_{2}}}{F_{x_{2}t}}-\frac{j^{x_{2}}}{F_{x_{ 2}t}^{2}}\partial_{z}F_{x_{2}t}. \tag{3.19}\] Similarly, we have \(\partial_{t}F_{x_{1}x_{2}}=-i\omega F_{x_{1}x_{2}},\partial_{t}F_{tx_{2}}=-i \omega F_{tx_{2}},\partial_{t}j^{x_{2}}=-i\omega j^{x_{2}}\). Then the transverse flow equation (3.19) can be written as \[\partial_{z}\sigma_{T}(\omega,z)=\frac{i\omega g_{z_{2}}g_{x_{2}x_{2}}}{Q}( \sigma_{T}^{2}-\frac{Q^{2}g^{zz}g^{tt}}{g_{x_{2}x_{2}}^{2}}). \tag{3.20}\] It is not difficult to find that the metric Eq.(2.2) restores the SO(3) invariance and the flow equations Eq.(3.14) and Eq.(3.20) have the same form when magnetic field \(B=0\)GeV\({}^{2}\). The spectral function is defined by the retarded Green's function \[\rho(\omega)\equiv-ImG_{R}(\omega)=\omega Re\,\sigma(\omega,0) \tag{3.21}\] ### Turning on the angular momentum In the early stage of non-central heavy-ion collisions, produced partons have a large initial orbital angular momentum \(J\propto b\sqrt{s_{NN}}\) where \(b\) is the impact parameter and \(\sqrt{s_{NN}}\) the nucleon-nucleon center-of-mass energy. Although, at the stage of initial impact, most of the angular momentum is carried away by the so-called "spectators", there is a considerable part that remains in the produced QGP [49]. Star collaboration find, by studying the global \(\Lambda\) polarization in nuclear collisions, that the average vorticity of QGP could reach \(\Omega\sim 10^{21}/s\)[50]. Following [51, 52, 53, 54, 29], we extend the holographic magnetic catalysis model to the situation of rotation with a planar horizon. For a general metric in the rest frame \[d\tilde{s}^{2}=-\tilde{g}_{tt}d\tilde{t}^{2}+\tilde{g}_{zz}d\tilde{z}^{2}+ \tilde{g}_{x_{1}x_{1}}d\tilde{x}_{1}^{2}+\tilde{g}_{x_{2,3}x_{2,3}}d\tilde{x}_ {2,3}^{2}, \tag{3.22}\] to introduce the rotation effect, it is convenient to split the 3-dimensional space into two parts as \(\mathcal{M}_{3}=\mathbb{R}\times\Sigma_{2}\). Then we have \[d\tilde{s}^{2}=-\tilde{g}_{tt}d\tilde{t}^{2}+\tilde{g}_{zz}d\tilde{z}^{2}+ \tilde{g}_{x_{1}x_{1}}l^{2}d\tilde{\theta}^{2}+\tilde{g}_{x_{2,3}x_{2,3}}d \sigma^{2}, \tag{3.23}\] where \(l\) denotes the fixed distance to rotating axis and \(d\sigma^{2}\) represents the line element of \(\Sigma_{2}\). Then the angular momentum will be turned on in the \(l\tilde{\theta}\) direction through the standard Lorentz transformation, \[\tilde{t}\rightarrow\gamma(t+\Omega l^{2}\theta),\qquad\tilde{\theta} \rightarrow\gamma(\theta+\Omega t), \tag{3.24}\] where \(\gamma=\frac{1}{\sqrt{1-\Omega^{2}l^{2}}}\) is the usual Lorentz factor. It is estimated that the size of QGP may be around 4-8fm (RHIC) and 6-11fm (LHC) [55]. Without loss of generality, we use \(l=1\,\)GeV\({}^{-1}\) in the subsequent numerical calculation. The metric (3.22) changes to the following form, \[ds^{2}=\gamma^{2}(\tilde{g}_{x_{1}x_{1}}\Omega^{2}l^{2}-\tilde{g}_{tt})dt^{2}+ 2\gamma^{2}\Omega l^{2}(\tilde{g}_{x_{1}x_{1}}-\tilde{g}_{tt})dtd\theta+\gamma ^{2}(\tilde{g}_{x_{1}x_{1}}-\Omega^{2}l^{2}\tilde{g}_{tt})l^{2}d\theta^{2}+ \tilde{g}_{zz}dz^{2}+\tilde{g}_{x_{2,3}x_{2,3}}d\sigma^{2}. \tag{3.25}\] Then the Hawking temperature and chemical potential of the rotating black hole can be calculated by \[T(z_{h},\mu,B,\Omega) = \tilde{T}(\tilde{z}_{h},\tilde{\mu},B)\sqrt{1-\Omega^{2}l^{2}},\] \[\mu(\Omega) = \tilde{\mu}\sqrt{1-\Omega^{2}l^{2}}. \tag{3.26}\] Next, we calculate the spectral function of heavy quarkonium for rotating case. Suppose that, in the limit of zero momentum, the plane wave solution of the vector field has the form \(A_{\mu}(t,z)=e^{-i\omega t}A_{\mu}(z,\omega)\). Due to the appearance of rotation and magnetic field destroying the rotational symmetry of space, the EOM(3.5) can be written in two varying channels: longitudinal-the direction parallel to the magnetic field; transverse-the direction perpendicular to the magnetic field. With the help of Eq.(3.14) and Eq.(3.20), the flow equation can be written as \[\partial_{z}\sigma_{L}(\omega,z)=i\omega\Xi^{//}(\sigma_{L}( \omega,z)^{2}-(\Delta^{//})^{2}),\] \[\partial_{z}\sigma_{T}(\omega,z)=i\omega\Xi^{\perp}(\sigma_{T}( \omega,z)^{2}-(\Delta^{\perp})^{2}). \tag{3.27}\] (1) When the direction of angular velocity is parallel to the direction of the magnetic field, \[\Xi^{//} = \frac{e^{\frac{Bz^{2}}{2}+\phi(z)}\left(l^{2}\Omega^{2}e^{Bz^{2} }b(z)-1\right)}{b(z)\left(l^{2}\Omega^{2}-1\right)w_{E}(z)},\] \[\Delta^{//} = w_{E}(z)e^{\frac{Bz^{2}}{2}-\phi(z)}\sqrt{\frac{l^{2}\Omega^{2 }-1}{l^{2}\Omega^{2}e^{Bz^{2}}b(z)-1}},\hskip 28.452756pt(\Omega//B//P)\] \[\Xi^{\perp} = \frac{e^{\frac{Bz^{2}}{2}+\phi(z)}}{b(z)w_{E}(z)},\] \[\Delta^{\perp} = w_{E}(z)e^{-\frac{Bz^{2}}{2}-\phi(z)}\sqrt{\frac{l^{2}\Omega^{2 }e^{Bz^{2}}b(z)-1}{l^{2}\Omega^{2}-1}}.\hskip 28.452756pt(\Omega//B\perp P) \tag{3.28}\] (2)When the direction of angular velocity is perpendicular to the direction of the magnetic field, \[\Xi^{//} = \frac{e^{Bz^{2}+\phi(z)}\left(1-l^{2}\Omega^{2}b(z)\right)}{b(z)w _{E}(z)\sqrt{e^{Bz^{2}}\left(l^{4}\Omega^{4}-l^{2}\Omega^{2}+1\right)-l^{2} \Omega^{2}+\frac{l^{2}\Omega^{2}\left(1-e^{Bz^{2}}\right)}{b(z)}}},\] \[\Delta^{//} = w_{E}(z)e^{-\frac{Bz^{2}}{2}-\phi(z)}\sqrt{\frac{l^{2}\Omega^{2 }-1}{l^{2}\Omega^{2}g(z)-1}},\hskip 56.905512pt(\Omega//P\perp B)\] \[\Xi^{\perp} = \frac{(1-l^{2}\Omega^{2})\,e^{\phi(z)}}{w_{E}(z)\sqrt{b(z)\left(b (z)\left(e^{Bz^{2}}\left(l^{4}\Omega^{4}-l^{2}\Omega^{2}+1\right)-l^{2}\Omega ^{2}\right)+l^{2}\Omega^{2}\left(1-e^{Bz^{2}}\right)\right)}},\] \[\Delta^{\perp} = w_{E}(z)e^{\frac{Bz^{2}}{2}-\phi(z)}\sqrt{\frac{l^{2}\Omega^{2 }g(z)-1}{l^{2}\Omega^{2}-1}},\hskip 56.905512pt(\Omega\perp B//P)\] \[\Xi^{\perp} = \frac{(1-l^{2}\Omega^{2})\,e^{Bz^{2}+\phi(z)}}{w_{E}(z)\sqrt{b(z) \left(b(z)\left(e^{Bz^{2}}\left(l^{4}\Omega^{4}-l^{2}\Omega^{2}+1\right)-l^{2 }\Omega^{2}\right)+l^{2}\Omega^{2}\left(1-e^{Bz^{2}}\right)\right)}},\] \[\Delta^{\perp} = w_{E}(z)e^{-\frac{Bz^{2}}{2}-\phi(z)}\sqrt{\frac{l^{2}\Omega^{2 }g(z)-1}{l^{2}\Omega^{2}-1}}.\hskip 56.905512pt(\Omega\perp B\perp P) \tag{3.29}\] For vanishing angular momentum \(\Omega\) and magnetic field \(B\), one can easily check that the Eq.(3.28)-(3.29) have the same forms: \[\Xi^{//}=\Xi^{\perp}=\frac{e^{\phi(z)}}{b(z)w_{E}(z)},\quad\Delta^{//}=\Delta^{ \perp}=w_{E}(z)e^{-\phi(z)}. \tag{3.30}\] ### Adding a constant electric field to the background In this subsection, a constant electric field is added on the D-brane, see Ref. [56] for more information. The field strength tensor can be expressed as \(F=Edt\wedge dx_{1}\) where \(E\) is the electric field along the \(x_{1}\) direction. Since the equation of motion only depends on the field strength tensor, this ansatz is still a good solution to supergravity and is the minimal setup to study the E-field correction for the corresponding field theory. Then one can write the E-field metric as \[{\cal F}_{\mu\nu}=\begin{pmatrix}0&2\pi\alpha^{\prime}E&0&0\\ -2\pi\alpha^{\prime}E&0&0&0\\ 0&0&0&0\\ 0&0&0&0\end{pmatrix}. \tag{3.31}\] Further, the background metric can be written as \(ds^{2}=G_{\mu\nu}+{\cal F}_{\mu\nu}\) where \(G_{\mu\nu}\) is from Eq.(3.22). The flow equation Eq.(3.27) becomes: (1) When the direction of electric field is parallel to the direction of magnetic field, \[\Xi^{//}=\frac{e^{\phi(z)-Bz^{2}}}{b(z)w_{E}(z)\sqrt{e^{-Bz^{2}}- \frac{4\pi^{2}\alpha^{2}E^{2}w_{E}(z)^{6}}{b(z)}}},\quad\Delta^{//}=w_{E}(z)e ^{\frac{Bz^{2}}{2}-\phi(z)},\quad(E//B//P)\] \[\Xi^{\perp}=\frac{w_{E}(z)e^{\phi(z)}}{b(z)\sqrt{e^{-Bz^{2}}w_{E} (z)^{4}-\frac{4\pi^{2}\alpha^{2}E^{2}}{b(z)}}},\quad\Delta^{\perp}=w_{E}(z)e^{ -\frac{Bz^{2}}{2}-\phi(z)}.\quad\quad(E//B\perp P) \tag{3.32}\] (2)When the direction of electric field is perpendicular to the direction of magnetic field, \[\Xi^{//}=\frac{w_{E}(z)e^{\frac{Bz^{2}}{2}+\phi(z)}}{b(z)\sqrt{ \frac{b(z)w_{E}(z)^{4}-4\pi^{2}\alpha^{2}E^{2}}{b(z)}}},\quad\Delta^{//}=w_{E }(z)e^{-\frac{Bz^{2}}{2}-\phi(z)},\quad(E//P\perp B)\] \[\Xi^{\perp}=\frac{w_{E}(z)e^{\phi(z)-\frac{Bz^{2}}{2}}}{b(z)\sqrt {\frac{b(z)w_{E}(z)^{4}-4\pi^{2}\alpha^{2}E^{2}}{b(z)}}},\quad\Delta^{\perp}= w_{E}(z)e^{\frac{Bz^{2}}{2}-\phi(z)},\quad(E\perp B//P)\] \[\Xi^{\perp}=\frac{w_{E}(z)e^{\frac{Bz^{2}}{2}+\phi(z)}}{b(z)\sqrt {\frac{b(z)w_{E}(z)^{4}-4\pi^{2}\alpha^{2}E^{2}}{b(z)}}},\quad\Delta^{\perp}= w_{E}(z)e^{-\frac{Bz^{2}}{2}-\phi(z)}.\quad(E\perp B\perp P) \tag{3.33}\] For vanishing E-field and B-field, one can find that the Eq.(3.32)-(3.33) have the same forms as Eq.(3.30). In addition, one can find when the E-field is perpendicular to magnetic field, the flow equation has the same form for \(E//P\perp B\) and \(E\perp B\perp P\). ## 4 Numerical Results of spectral functions in a magnetized rotating plasma The spectral function is described by Eq.(3.21). Firstly, we plot our numerical results of the spectral function for the different temperatures and chemical potential in Fig.1. One can find the increase of temperature and chemical potential decrease the height and increase the width of spectral function peak. The decrease in peak height and the increase in peak width represent the enhancement of dissociation effect for heavy quarkonium. So we can get that increasing temperature and chemical potential promote the dissociation effect of bound state. In Fig.2, we display the effective mass corresponding to the location of spectral function peak as a function of temperature in varying chemical potentials. As increasing temperature, the effective mass remains unchanged in the lower temperature regime, while that increases in the higher temperature regime, the effective mass is reduced in the lower temperature regime. Figure 1: The spectral functions of the \(J/\Psi\) state with different temperature \(T\) (left panel) at \(\mu=0\,\)GeV and \(B=0\,\)GeV\({}^{2}\) and different chemical potential \(\mu\) (right panel) at \(B=0\,\)GeV\({}^{2}\) and \(T=0.6\,\)GeV for magnetic catalysis model. From top to bottom, the curves represent \(T=0.5,0.6,0.7,0.9\,\)GeV in the left panel respectively, and those denote \(\mu=0,0.5,0.709,1\,\)GeV in the right panel respectively. Figure 2: The effective mass of \(J/\Psi\) state as a function of temperature in different chemical potentials for magnetic catalysis model. temperature regime. In the lower temperature regime, chemical potential reduces the effective mass. In the higher temperature regime, chemical potential increases the effective mass. It is easy to understand this phenomenon that increasing temperature enlarges the distance of quark anti-quark pair, which leads to the interaction between quark/anti-quark and medium becoming stronger. Therefore, the effective mass is larger with the increase of temperature. ### Turning on a constant magnetic field The spectral function with respect to the magnetic field is presented in Fig.3 at \(\mu=0\,\mathrm{GeV},T=0.63\,\mathrm{GeV}\). The left panel is for magnetic field parallel to polarization and the right one is for magnetic field perpendicular to polarization. A phenomenon completely opposite to the chemical potential effect and temperature effect is observed. Whether the magnetic field is parallel or perpendicular to the polarization, the strengthened magnetic field increases the peak height and reduces the peak width. That means the presence of magnetic field suppresses the dissociation of bound state, which is completely opposite to the conclusions, the presence of magnetic field Figure 4: The effective mass of \(J/\Psi\) state as a function of temperature in different magnetic fields for magnetic catalysis model. The left picture is for magnetic field parallel to polarization and the right one is for magnetic field perpendicular to polarization. Figure 3: The spectral functions of the \(J/\Psi\) state with different magnetic field \(B\) at \(\mu=0\,\mathrm{GeV}\) and \(T=0.63\,\mathrm{GeV}\) for magnetic catalysis model. From bottom to top, the curves represent \(B=0,0.5,0.96,1.3\,\mathrm{GeV}^{2}\) respectively. enhances the dissociation of bound state, obtained from the inverse magnetic catalysis model in Ref. [9]. While the change of effective mass is non-trivial as is displayed in Fig.4. When magnetic field is parallel to the polarization, the effective mass reduces with the increasing magnetic field in the full temperature regime. When magnetic field is perpendicular to the polarization, in the lower and higher temperature regimes, the increasing magnetic field enlarges the effective mass, while that reduces the effective mass for the middle-temperature regime. In addition, by comparing the left and right panels, one can easily find that the suppression effect is stronger when the magnetic field is perpendicular to polarization, but the effective mass is smaller when the magnetic field is parallel to polarization which is consistent with the conclusion from inverse magnetic catalysis model in Ref. [9]. On balance, an interesting conclusion for the \(J/\Psi\) state can be obtained: Increasing temperature and chemical potential all enhance the dissociation effect, while the magnetic field suppresses the dissociation effect. The dependence of effective mass on magnetic field and chemical potential is non-trivial, which is strictly dependent on the temperature. ### Turning on angular momentum #### 4.2.1 The case of magnetized-rotating QGP with MC In Fig.5 we show the behavior of spectral function for different angular velocities at \(\mu=0\,\mathrm{GeV},B=0\,\mathrm{GeV}^{2},T=0.6\,\mathrm{GeV}\). The left figure is for the rotating direction parallel to polarization and the right figure is for the rotating direction perpendicular to polarization. Whether the rotating direction is parallel or perpendicular to the polarization, increasing angular velocity reduces the height and enlarges the width, which means angular velocity speed up the dissociation effect. In addition, by comparing the parallel and the perpendicular cases in Fig.5, it is found that the dissociation effect is stronger for the perpendicular case. The angular velocity dependence of effective mass is shown in Fig.6. The results suggest that angular velocity increases the effective mass. It is noted that the shadow region denotes the hadronic phase, so the result Figure 5: The spectral functions of the \(J/\Psi\) state with different angular velocity \(\Omega l\) at \(\mu=0\,\mathrm{GeV}\),\(B=0\,\mathrm{GeV}^{2}\) and \(T=0.6\,\mathrm{GeV}\) for magnetic catalysis model. From top to bottom, the curves represent \(\Omega l=0,0.2,0.4,0.6\) respectively. is untrustworthy in the regime. Because we introduce the rotation in the black hole metric on the side of gravity corresponding to the rotation of QGP on the side of the gauge field. The shadow region should be described by introducing the rotation in the thermal gas solution rather than the black hole solution. An interesting behavior can be observed in the perpendicular case when the angular velocity is larger. The effective mass has a maximum near the phase transition temperature, which may be regarded as a dissociation signal of the \(J/\Psi\) state. This point can also be checked in Fig.5, the peak is very low suggesting the quarkonium dissociation. And we find the non-trivial behavior from effective mass occurs only in the perpendicular case. This conclusion also well shows that the dissolution effect is stronger in the perpendicular case, which is consistent with the conclusion obtained by using the height of the spectral function peak in Fig.5. To sum up, we find that temperature, chemical potential, and angular velocity promote the dissolution effect, while magnetic field suppresses it. So one can conclude that there must be a competition effect between magnetic field and temperature, chemical potential, and angular Figure 6: The effective mass of \(J/\Psi\) state as a function of temperature in different angular velocities for magnetic catalysis model. The left picture is for angular velocity parallel to polarization and the right one is for angular velocity perpendicular to polarization. Figure 7: The spectral functions of the \(J/\Psi\) state, by considering the superposition effect of magnetic field and rotation, with different angular velocity \(\Omega l\) at \(\mu=0\,\)GeV, \(B=0.5\,\)GeV\({}^{2}\) and \(T=0.63\,\)GeV for magnetic catalysis model. velocity. As an example, we show the behavior of spectral function for the superposition effect of rotation and magnetic field ( here we only show the case of magnetic field parallel to rotating direction ) in Fig. 7. One can find that there is a critical angular velocity \(\Omega_{crit}(B)l\sim 0.3\) which is the result of the competition between the magnetic field effect and the rotating effect. Here \(\Omega_{crit}(B)\) denotes that the value of critical angular velocity \(\Omega_{crit}\) depends on the size of magnetic field \(B\). When \(\Omega<\Omega_{crit}(B)\), the magnetic field effect plays a leading role and suppresses the dissociation effect, which leads to the dissociation effect being stronger when the rotating direction (magnetic field) is parallel to the polarization. However, when \(\Omega>\Omega_{crit}(B)\), the rotating effect is dominant, which causes the dissolution effect to be more intense when the rotating direction is perpendicular to the polarization. In Fig.8, we show the influence of the superposition effect between magnetic field and rotation on effective mass. One can find, for the parallel case, the magnetic field suppresses the growth of effective mass caused by rotation, while the magnetic field speeds up the growth of effective mass for the perpendicular case. But for this intensity of magnetic field, the behavior of effective mass still is dominant by rotation in the QGP phase. Although the result from the hadronic phase is untrustworthy, we can use it as a reference to conclude the effective mass in hadronic phase is dominant by an intense magnetic field instead of rotation. We will check this conclusion in the future. #### 4.2.2 The case of magnetized-rotating QGP with IMC In addition, as a parallel study, we introduce the rotation in a holographic inverse magnetic catalysis model(refer to appendixA for more details). As we focus primarily on the impact of rotation on the dissociation effect of \(J/\Psi\) in the two different magnetic field models, we present only the behavior of the spectral function in Fig.9 and Fig.10. From Fig.9, one can find that growing angular velocity promotes the dissociation effect and the melting effect is stronger for the direction of angular velocity perpendicular to the direction of polarization. In addition, by considering the superposition effect of magnetic field and rotation, for a smaller angular velocity, Fig.10 straightforwardly illustrates that the dissociation effect is stronger for Figure 8: The effective mass of the \(J/\Psi\) state, by considering the superposition effect of magnetic field and rotation, with different angular velocity \(\Omega l\) at \(\mu=0\,\mathrm{GeV}\), \(B=0.5\,\mathrm{GeV}^{2}\) and \(T=0.63\,\mathrm{GeV}\) for magnetic catalysis model. the direction of angular velocity parallel to the direction of polarization, which indicates the dissociation effect is dominant by magnetic field. As pointed out in Ref. [9], the melting effect produced by the magnetic field is stronger in the parallel case. For a larger angular velocity, an opposing conclusion is obtained that suggests the dissociation effect is controlled by angular velocity. Although the magnetic field exhibits distinctly different behaviors in these two models, the effect of rotation on the dissociation effect of \(J/\Psi\) is similar. In a word, the influences of rotation on the dissociation effect of the bound state can be summarized as follows: (1) As the increase of angular velocity, the dissociation effect becomes stronger and the effective mass becomes larger and the dissociation effect is stronger for the perpendicular case. (2)The superposition effect of magnetic field and rotation, the strength of the dissolution effect depends entirely on the interplay between the magnetic field and the rotation effect and the behavior of effective mass is non-trivial. (3)Whether the magnetic field behaves as magnetic catalysis or inverse magnetic catalysis, the conclusion from the rotating Figure 10: The spectral functions of the \(J/\Psi\) state, by considering the superposition effect of magnetic field and rotation, with different angular velocity \(\Omega l\) at \(\mu=0\,\)GeV,\(B=0.5\,\)GeV and \(T=0.63\,\)GeV for inverse magnetic catalysis model. Figure 9: The spectral functions of the \(J/\Psi\) state with different angular velocity \(\Omega l\) at \(\mu=0\,\)GeV,\(B=0\,\)GeV and \(T=0.6\,\)GeV for inverse magnetic catalysis model. From top to bottom, the curves represent \(\Omega l=0,0.2,0.4,0.6\) respectively. effect is similar. ### Turning on electric field In Fig.11, we draw the spectral function and effective mass of \(J/\Psi\) state for varying electric field at \(B=0\,\mathrm{GeV}^{2},\mu=0\,\mathrm{GeV},T=0.6\,\mathrm{GeV}\). The result shows that the dissociation effect and the effective mass are enhanced by the increasing electric field. But one can find that, whether E-field is parallel or perpendicular to polarization, the dissociation effect is the same. Since the electric field and magnetic field have opposite interactions on the dissociation effect and effective mass. Next, we take into account the superposition of the magnetic field and electric field. As an example, we plot the spectral function and effective mass with respect to the electric field for the electric field parallel to the magnetic field in Fig.12 and Fig.13, respectively. One can find that the difference from the dissociation effect between the magnetic field parallel and perpendicular to polarization reduces with the increase of electric field and the difference will Figure 11: Left: The spectral functions of the \(J/\Psi\) state with different electric field \(E\) at \(\mu=0\,\mathrm{GeV}\),\(B=0\,\mathrm{GeV}^{2}\) and \(T=0.6\,\mathrm{GeV}\) for magnetic catalysis model. Right: The effective mass of \(J/\Psi\) state as a function of temperature in different electric fields for magnetic catalysis model. Figure 12: The spectral functions of the \(J/\Psi\) state with different electric field \(E\) at \(\mu=0\,\mathrm{GeV}\), \(B=0.5\,\mathrm{GeV}^{2}\) and \(T=0.63\,\mathrm{GeV}\) for magnetic catalysis model. vanish when the electric field is large enough. The effective mass in the lower temperature regime entirely depends on the electric field, however, in the higher temperature regime, that is determined by the interplay between the magnetic field and electric field. To make a long story short, the influence of electric field on spectral function can be summarized as follows: (1) The electric field enhances the dissociation effect and enlarges the effective mass of the bound state \(J/\Psi\). (2) The dissociation effect is the same for the electric field parallel and perpendicular to polarization. (3) Increasing electric field reduces the difference from the dissociation effect between the magnetic field parallel and perpendicular to polarization and the difference will vanish for a sufficiently large electric field. ## 5 Summary and discussion In this paper, by calculating the spectral function described by Eq.(3.21), we investigate the dissociation effect of bound state \(J/\Psi\) in a holographic magnetic catalysis model. In order to more truly simulate the non-central collision environment of extremely relativistic heavy ions, we consider a total of five effects, thermal effect, density effect, magnetic effect, rotation effect, and electric effect. The results show that both temperature and chemical potential promote the dissociation effect and enlarge the effective mass of heavy quarkonium \(J/\Psi\) in the QGP phase, while the magnetic field suppresses the dissociation effect and the behavior of effective mass is non-trivial. Interestingly, increasing magnetic field reduces the effective mass for the parallel case but enlarges the effective mass in the lower and higher temperature regimes for the perpendicular case. In addition, by considering the rotating QGP background, we obtain that the dissociation effect becomes stronger and the effective mass becomes larger with the increase of angular velocity. In view of the completely opposite behavior of the spectral functions generated by magnetic field and rotation, we consider the superposition effect of magnetic field and angular velocity. As an example, we show the behavior of spectral function in the case of a magnetic field parallel to Figure 13: The effective mass of the \(J/\Psi\) state, by considering the superposition effect of magnetic field and electric field, with different electric field \(E\) at \(\mu=0\,\mathrm{GeV}\), \(B=0.5\,\mathrm{GeV}^{2}\) and \(T=0.63\,\mathrm{GeV}\) for magnetic catalysis model. the rotating direction. It is found that there exists a critical angular velocity \(\Omega_{crit}(B)\) depending on the magnetic field. For \(\Omega<\Omega_{crit}(B)\), the magnetic field plays a leading role and suppresses the dissociation effect, which leads to the dissociation effect being stronger and the effective mass being smaller when the rotating direction (magnetic field) is parallel to the polarization. For \(\Omega>\Omega_{crit}(B)\), the rotating effect is dominant, which causes the dissolution effect to be more intense and the effective mass is larger when the rotating direction is perpendicular to the polarization. As a parallel study, we also examine the rotation effect in the holographic inverse magnetic catalysis model, although the magnetic field exhibits distinctly different behaviors in these two models, the impact of rotation on the dissociation effect of \(J/\Psi\) is similar. Besides, we consider the influence of electric field on spectral functions, the calculation indicates the increasing electric field enhances the dissociation effect and enlarges the effective mass. It is noted that whether the electric field is parallel or perpendicular to polarization, the dissociation effect is the same. In addition, we find that increasing electric field could reduce the difference in spectral functions between magnetic field parallel and perpendicular to polarization until the difference vanishes. According to the interesting conclusion of this paper, in the future, it will be desirable to study the magneto-rotational and electric-rotational dissociation effects of heavy mesons and analyze the competition between the two effects. Of course, one can also study other heavy vector mesons, such as \(\Upsilon(1S)\), or other physical quantities, such as configuration entropy and QNMs [57], the spin density matrix element \(\rho_{00}\)[58, 59]. As paper [9] points out, the properties of \(J/\Psi\) and \(\Upsilon(1S)\) are very different. In addition, one can also consider the influence of differential rotation on the dissociation effect. Because the rotation generated in the process of heavy ion collision depends on the distance to the rotating axis, which implies that angular velocity has an attenuation along the rotating radius, it is very necessary to consider a differential rotation to simulate the RHIC and LHC experiments. To establish a connection between holographic theory and experimental observations, one can consult Ref. [60] for the calculation of collision energy \(\sqrt{S_{NN}}\). ## Acknowledgements We would like to thank Song He and Hai-cang Ren for the useful discussions. This work is supported in part by the National Key Research and Development Program of China under Contract No. 2022YFA1604900. This work is also partly supported by the National Natural Science Foundation of China (NSFC) under Grants No. 12275104, No. 11890711, No. 11890710, and No. 11735007. The effect of rotating QGP on \(J/\Psi\) dissociation in a holographic inverse magnetic catalysis model Here, we consider a 5d EMD gravity system whose Lagrangian is given as \[\mathcal{L}=\sqrt{-g}(R-\frac{g_{1}(\phi_{0})}{4}F_{(1)\mu\nu}F^{\mu\nu}-\frac{g_ {2}(\phi_{0})}{4}F_{(2)\mu\nu}F^{\mu\nu}-\frac{1}{2}\partial_{\mu}\phi_{0} \partial^{\mu}\phi_{0}-V(\phi_{0})).\] (A.1) where \(F_{(i)\mu\nu}\) (\(i=1,2\)) is the field strength tensor for U(1) gauge field, \(g_{i}(\phi_{0})\) (\(i=1,2\)) denotes the gauge coupling kinetic function, \(\phi_{0}\) represents the dilaton field, \(V(\phi_{0})\) is the potential of the \(\phi_{0}\) (see [61] for exact expression). By introducing an external magnetic field in \(x_{1}\) direction, the metric ansatz in Einstein frame can be written as [61] \[ds^{2} =\frac{R^{2}S(z)}{z^{2}}(-f(z)dt^{2}+dx_{1}^{2}+e^{B^{2}z^{2}}(dx_ {2}^{2}+dx_{3}^{2})+\frac{dz^{2}}{f(z)}),\] \[\phi_{0} =\phi_{0}(z),\quad A_{(1)\mu}=A_{t}(z)\delta_{\mu}^{t},\quad F_{ (2)}=Bdx_{2}\wedge dx_{3},\] (A.2) with \[f(z) =1+\int_{0}^{z}d\xi\xi^{3}e^{-B^{2}\xi^{2}-3A(\xi)}[K+\frac{ \widetilde{\mu}^{2}}{2R_{gg}R^{2}}e^{R_{gg}\xi^{2}}],\] \[K =-\frac{1+\frac{\widetilde{\mu}^{2}}{2R_{gg}R^{2}}\int_{0}^{z_{h} }d\xi\xi^{3}e^{-B^{2}\xi^{2}-3A(\xi)+R_{gg}\xi^{2}}}{\int_{0}^{z_{h}}d\xi\xi^{ 3}e^{-B^{2}\xi^{2}-3A(\xi)}},\] \[\widetilde{\mu} =\frac{\mu}{\int_{0}^{z_{h}}d\xi\frac{\xi e^{-B^{2}\xi^{2}}}{g_{ 1}(\xi)\sqrt{S(\xi)}}},\] (A.3) where \(R\) is the AdS radius, \(S(z)\) labels the scale factor, \(f(z)\) is the blackening function and \(\mu\) denotes the chemical potential. The asymptotic boundary is at \(z=0\) and \(z=z_{h}\) denotes the location of the horizon where \(f(z_{h})=0\). The concrete form of gauge coupling function \(g_{1}\) can be determined by fitting the vector meson mass spectrum. The linear Regge trajectories for \(B=0\) can be restored when \[g_{1}(z)=\frac{e^{-R_{gg}z^{2}-B^{2}z^{2}}}{\sqrt{S(z)}}.\] (A.4) Here, this \(B\), in units GeV, is the 5d magnetic field. The 4d physical magnetic field is \(e\mathcal{B}\sim\frac{const}{R}\times B\) where \(const=1.6\) (See details in Ref. [62]). By taking \(S(z)=e^{2A(z)}\), one can obtain \(R_{gg}=1.16\,\text{GeV}^{2}\) for heavy meson state \(J/\psi\). In the following calculation, we take \(A(z)=-az^{2}\) where \(a=0.15\,\text{GeV}^{2}\) matching with the lattice QCD deconfinement temperature at \(B=0\,\text{GeV}\)[63]. The Hawking temperature has the following form, \[T(z_{h},\mu,B)=\frac{-z_{h}^{3}e^{-3A(z_{h})-B^{2}z_{h}^{2}}}{4\pi}(K+\frac{ \widetilde{\mu}^{2}}{2R_{gg}R^{2}}e^{R_{gg}z_{h}^{2}}).\] (A.5) The paper [61] assumes that the dilaton field \(\phi\) remains real everywhere in the bulk, which leads to magnetic field \(B\leq B_{c}\simeq 0.61\,\text{GeV}\). In this holographic inverse magnetic catalysis model, the deconfinement temperature is \(T_{c}=0.268\,\text{GeV}\) at zero chemical potential and magnetic field. In the rotating background, the metric uses Eq.(3.25), and the temperature and chemical potential takes Eq.(3.26). The flow equation takes Eq.(3.14) and Eq.(3.20). In this holographic inverse magnetic catalysis model, we have \(\tilde{g}_{tt}=\frac{f(z)S(z)}{z^{2}},\tilde{g}_{x_{1}x_{1}}=\frac{S(z)}{z^{2}}, \tilde{g}_{x_{2}x_{2}}=g_{x_{3}x_{3}}=\frac{e^{\tilde{g}^{2}u^{2}}S(z)}{z^{2}},\tilde{g}_{zz}=\frac{S(z)}{z^{2}f(z)}\). Finally, the spectral function can be obtained. We show the behavior of spectral functions for different angular velocities in Fig.9. In Fig.10, the influence of the superposition of angular velocity and magnetic field on the spectral function is studied. One can find the conclusion is similar to the holographic magnetic catalysis model.

2305.05556

Quantum Approximate Optimization Algorithm with Cat Qubits

The Quantum Approximate Optimization Algorithm (QAOA) -- one of the leading algorithms for applications on intermediate-scale quantum processors -- is designed to provide approximate solutions to combinatorial optimization problems with shallow quantum circuits. Here, we study QAOA implementations with cat qubits, using coherent states with opposite amplitudes. The dominant noise mechanism, i.e., photon losses, results in $Z$-biased noise with this encoding. We consider in particular an implementation with Kerr resonators. We numerically simulate solving MaxCut problems using QAOA with cat qubits by simulating the required gates sequence acting on the Kerr non-linear resonators, and compare to the case of standard qubits, encoded in ideal two-level systems, in the presence of single-photon loss. Our results show that running QAOA with cat qubits increases the approximation ratio for random instances of MaxCut with respect to qubits encoded into two-level systems.

Pontus Vikstål, Laura García-Álvarez, Shruti Puri, Giulia Ferrini

2023-05-09T15:44:52Z

http://arxiv.org/abs/2305.05556v2

# Quantum Approximate Optimization Algorithm with Cat Qubits ###### Abstract The Quantum Approximate Optimization Algorithm (QAOA)--one of the leading algorithms for applications on intermediate-scale quantum processors--is designed to provide approximate solutions to combinatorial optimization problems with shallow quantum circuits. Here, we study QAOA implementations with cat qubits, using coherent states with opposite amplitudes. The dominant noise mechanism, i.e., photon losses, results in \(Z\)-biased noise with this encoding. We consider in particular an implementation with Kerr resonators. We numerically simulate solving MaxCut problems using QAOA with cat qubits by simulating the required gates sequence acting on the Kerr non-linear resonators, and compare to the case of standard qubits, encoded in ideal two-level systems, in the presence of single-photon loss. Our results show that running QAOA with cat qubits increases the approximation ratio for random instances of MaxCut with respect to qubits encoded into two-level systems. ## I Introduction Variational quantum algorithms [1; 2], combining quantum and classical computation in a hybrid approach, occupy a central role in current research on quantum algorithms. These algorithms are promising for implementations on NISQ devices [3], since they can in principle run on shallow quantum processors. In particular, the Quantum Approximate Optimization Algorithm (QAOA) [4] can be used to tackle combinatorial optimization problems, which are omnipresent in logistics, with applications within the automotive sector [5; 6], or aviation, e.g., aircraft [7] or gate [8] assignment, financial portfolio optimization [9], among others. First proof-of-principle implementations of QAOA in superconducting qubit devices were used to solve MaxCut [10; 11] and Exact Cover [12; 13] problems. Although the performance of QAOA improves at increasing algorithmic depth provided optimal parameters, current NISQ hardware is limited by noise, which decreases the performance of QAOA after a certain algorithmic depth [11]. As such, research into different avenues for hardware implementations of QAOA that could allow for reaching deeper circuits is needed. In this work, we explore the implementation of QAOA in bosonic systems. These have led to promising quantum computing implementations in a variety of physical settings including optical [14] and microwave radiation [15; 16; 17], trapped ions [18; 19; 20], opto-mechanical systems [21; 22; 23], atomic ensembles [24; 25; 26; 27], and hybrid systems [28]. For example, in the microwave regime, bosonic codes have successfully extended the life-time of quantum information in superconducting cavities compared to the system's constituents [29; 30; 31]. So far, bosonic implementations of QAOA have primarily focused on optimizing continuous functions defined on real numbers [32; 33], with little attempt made to address QAOA for solving discrete optimization problems in the context of bosonic system, which is the focus of our work. Encoding qubits into the coherent states of cavities fields \(|\pm\alpha\rangle\), yielding cat qubits, is an emerging approach that results in biased noise. Such type of noise affects a quantum system in a non-uniform way, i.e., certain types of errors are more likely to occur than others. This has the capability of leading to favorable error-correcting properties [34; 35], and to enhanced algorithmic performance [36]. In a previous work [37], some of the authors have shown that biased-noise qubits also allow for implementing error mitigation techniques and achieving higher performance ratios in QAOA as compared to standard qubits. However, those results where obtained for a generic noise-biased error model, without considering specific implementations. In this work, we explore QAOA using cat qubits, achieved in particular by means of the driven Kerr non-linear resonator [38]. First, we simulate solving a two-qubit Exact Cover problem under the full master equation with cat qubits as a proof of principle demonstration. Second, in order to simulate larger systems of cat qubits, we use the Pauli-transfer matrix formalism to characterize the error channel induced by single-photon losses on the computational subspace. We numerically show that for an 8-qubit MaxCut problem the use of cat qubits yields an improvement of the algorithmic approximation ratio with respect to the case of qubits encoded into discrete two-level systems, given equal average gate fidelities between the two systems. While we are going to focus on driven Kerr-nonlinear resonator, the implementation of QAOA on cat qubits yielding enhanced algorithmic performance unveiled in our work could also be achieved by means of other platforms, both in the superconducting [39], as well as photonics [40], or other bosonic systems [41]. The paper is structured as follows. In Section II we recall the definition of cat qubits as well as the gates needed to operate them. In Section III we outline how QAOA can be run on cat qubits. We first show the principle by considering a two-qubit toy model for solving the Exact Cover problem, and then consider more extensive simulations up to 8 qubits for solving MaxCut, in the presence of photon losses. We then compare the performance of QAOA with cat qubits to the one with standard qubits given the same average gate fidelity of the two systems. We provide our conclusive remarks in Section IV. In Appendix A we recall the definition of quantum gates acting on cat qubits. In Appendix B we provide some details regarding the numerical optimization. Finally, in Appendix C we introduce a bosonic version of QAOA by Trotterizing the relevant quantum annealing Hamiltonian, and we compare its performance to QAOA for the case of a single Ising spin. ## II Cat qubits and how to operate on them In this section we recall the main properties of cat qubits implemented by means of the Kerr nonlinear resonator (KNR) as introduced in Refs. [42; 43], and summarize how to perform gates on such a cat qubit. ### The Kerr nonlinear resonator In Ref. [38] a collection of microwave resonators with Kerr non-linearities was suggested as a candidate architecture for implementing quantum annealing, with the aim of addressing combinatorial optimization problems. The quantum annealing sequence was designed to start from the vacuum in all cavities, and then to slowly evolve the quantum state towards the final state yielding the problem's solution, encoded in coherent states of the cavities field \(\ket{\pm\alpha}\), with superpositions theoreof yielding cat states. In this work, we propose to apply this simple encoding strategy for implementing QAOA, allowing to tackle combinatorial optimization problems with bosonic systems. The cat qubit can be realized in a Kerr parametric oscillator with a two-photon pump [44; 42; 39; 43]. In a frame rotating at the frequency of the two-photon pump and in the rotating-wave approximation, the Hamiltonian for a KNR is given by (we use \(\hbar=1\) throughout this paper) \[\hat{H}_{1}=-\Delta\hat{a}^{\dagger}\hat{a}-K\hat{a}^{\dagger 2}\hat{a}^{2}+G( \hat{a}^{\dagger 2}e^{i2\phi}+\hat{a}^{2}e^{-i2\phi}), \tag{1}\] where \(\Delta=\omega_{r}-2\omega_{p}\) is the detuning of the resonator frequency from twice the two-photon pump frequency, \(K\) is the amplitude of the Kerr non-linearity, \(G\) and \(\phi\) are the amplitude and phase of the two-photon drive respectively. We assume that \(K\) is a nonzero positive constant and that \(\Delta\) is non-negative. When the detuning is zero (i.e. when the two-photon drive frequency is half the resonator frequency) and when the phase \(\phi\) is zero, the KNR Hamiltonian can be written as \[\hat{H}_{1} =-K\hat{a}^{\dagger 2}\hat{a}^{2}+G(\hat{a}^{\dagger 2}+\hat{a}^{2})\] \[=-K\left(\hat{a}^{\dagger 2}-\frac{G}{K}\right)\left(\hat{a}^{2}- \frac{G}{K}\right)+\frac{G^{2}}{K}. \tag{2}\] Since \(\hat{a}\ket{\alpha}=\alpha\ket{\alpha}\), the coherent states \(\ket{\pm\alpha}\) with \(\alpha=\sqrt{G/K}\) are degenerate eigenstates of the Hamiltonian Eq. (2) with eigenenergy \(G^{2}/K\). The combinations of these degenerate eigenstates given by \(|C^{\pm}_{\alpha}\rangle=N_{\pm}(\ket{\alpha}\pm\ket{-\alpha})\) with \(N_{\pm}=\sqrt{2(1\pm e^{-2|\alpha^{2}|})}\) are the cat states. They are also degenerate eigenstates, and are even and odd parity eigenstates of the parity operator \(\hat{\Pi}=e^{i\pi\hat{a}^{\dagger}\hat{a}}\) respectively. We can take advantage of this well-defined subspace to encode our computational basis states \(|\bar{0}\rangle\), \(|\bar{1}\rangle\), defining the qubit (the bar notation is used to distinguish the computational states from the zero and one photon Fock state). To this aim, one possibility is to directly identify the qubit basis states with \(|\alpha\rangle\) and \(|-\alpha\rangle\)[38]. However, these states are quasi-orthogonal as \(\langle-\alpha|\alpha\rangle=e^{-2\alpha^{2}}\), and only become orthogonal in the high photon number limit. Another possibility consists in choosing the following encoding [45]: \[|\bar{0}\rangle=\frac{|C^{+}_{\alpha}\rangle+|C^{-}_{\alpha}\rangle}{\sqrt{2} },\quad|\bar{1}\rangle=\frac{|C^{+}_{\alpha}\rangle-|C^{-}_{\alpha}\rangle}{ \sqrt{2}}. \tag{3}\] In this case, the computational basis states are orthogonal even for small \(\alpha\), while for large \(\alpha\) they are approximately equal to \(|\bar{0}\rangle\approx|\alpha\rangle\) and \(|\bar{1}\rangle\approx|-\alpha\rangle\). For single-photon losses the encoding of Eq. (3) constitutes a noise biased qubit where the loss of a single-photon results in a phase error plus an exponentially small bit-flip error on the computational states with respect to \(\alpha\). Indeed, by defining the projection operator \(\hat{I}=|\bar{0}\rangle\!\langle\bar{0}|+|\bar{1}\rangle\!\langle\bar{1}|\), its action on the annihilation operator \(\hat{a}\) gives \[\hat{I}\hat{a}\hat{I}=\frac{\alpha}{2}(\eta+\eta^{-1})\hat{Z}+i\frac{\alpha}{ 2}(\eta-\eta^{-1})\hat{Y}, \tag{4}\] where \(\eta\equiv N_{+}/N_{-}\), and \(\hat{Z}\), \(\hat{Y}\) are the two Pauli matrices in the computational subspace. For large \(\alpha\), \(\eta\to 1\) which results in \(\hat{I}\hat{a}\hat{I}=\alpha\hat{Z}\), and we thus see that a single-photon loss event corresponds to a phase-error on the computational basis states. We will refer to the encoding in Eq (3) as the cat qubit, and use it throughout the paper. The computational basis states are shown on the Bloch sphere in FIG. 1. In order to run QAOA, one needs to prepare all resonators in state \(\ket{+}\), i.e., in the case of the cat qubit, the cat state \(|C^{+}_{\alpha}\rangle\). Such a cat state can be generated deterministically in KNRs by starting from the vacuum, which is an eigenstate of Hamiltonian Eq. (2) for \(G=0\), and then adiabatically increasing \(G\)[46; 43]. Since the Hamiltonian in Eq. (2) is symmetric under parity inversion \(\hat{a}\rightarrow-\hat{a}\), the KNR follows the adiabatic evolution from the vacuum while also conserving the parity, \([\hat{\Pi},\hat{H}]=0\), thus ending up in the even parity cat state \(|C_{\alpha}^{+}\rangle\). Alternatively, a cat state can also be generated using a sequence of SNAP and displacement gates applied to the vacuum state [47]. ### Set of universal gates on the cat qubit We are now interested in the implementation of gates on the cat qubit. We are going to focus on the following gate set: \[R_{Z}(\phi) =e^{-i\phi\hat{Z}/2}, \tag{5}\] \[R_{X}(\theta) =e^{-i\theta\hat{X}/2},\] (6) \[R_{Y}(\varphi) =e^{-i\varphi\hat{Y}/2},\] (7) \[R_{ZZ}(\Theta) =e^{-i\Theta\hat{Z}_{1}\hat{Z}_{2}/2}, \tag{8}\] where \(\{\hat{X},\hat{Y},\hat{Z}\}\) are the Pauli matrices in the computational basis, which in this case is taken to be the cat qubit Eq. (3). Note that this is an over-complete gate set, as any pair of single-qubit gates \(\{R_{X}(\theta),R_{Y}(\varphi),R_{Z}(\phi)\}\) together with \(R_{ZZ}(\Theta)\) allow for implementing arbitrary qubit operations. The gates are implemented according to Refs. [42; 43], where the \(R_{Z}(\phi)\)-gate is implemented in KNRs by means of a single-photon drive. The \(R_{X}(\theta)\)-gate is implemented through a time-dependent detuning \(\Delta\). The \(R_{Y}(\varphi)\)-gate is implemented by means of single and two-photon drives, and \(R_{ZZ}(\Theta)\)-gate is implemented through a beam-splitter interaction between two KNRs. We provide a more detailed description of these gates in Appendix A, where we also present numerical simulations validating this approach for relevant parameter regimes and in the presence of noise induced by single-photon loss. In TABLE 1 we report the average gate fidelities, without single-photon loss and with single-photon loss rate of \(K/1500\) respectively. ## III QAOA with cat qubits In this section, we use the gate set defined in Section II.2 to implement the QAOA sequence on cat qubits. We start by briefly reviewing QAOA, and we then address numerical simulations of increasing complexity (two to eight qubits), in the presence of single-photon losses, assessing the algorithmic performance in terms of the success probability and the approximation ratio. ### The QAOA algorithm QAOA [4] starts from the superposition of all possible computational basis states, \(\ket{+}^{\otimes n}\), where \(n\) is the number of qubits. Then the alternating sequence of the two parametrized non-commuting quantum gates \(\hat{U}(\gamma)\) and \(\hat{V}(\beta)\) is applied \(p\) times, with \[\hat{U}(\gamma)\equiv e^{-i\gamma\hat{H}_{C}},\quad\hat{V}(\beta)\equiv e^{-i \beta\hat{H}_{M}}, \tag{9}\] where \(\hat{H}_{M}\equiv\sum_{i=1}^{n}\hat{X}_{i}\) is the mixing Hamiltonian, and \(\hat{H}_{C}\) is the cost Hamiltonian that encodes the solution to the considered optimization problem in its ground state, \[\hat{H}_{C}=\sum_{i<j}J_{ij}\hat{Z}_{i}\hat{Z}_{j}+\sum_{i}h_{i}\hat{Z}_{i}. \tag{10}\] Indicating the collection of variational parameters as \(\vec{\gamma}=(\gamma_{1},\dots,\gamma_{p})\) with \(\gamma_{i}\in[0,2\pi)\) if \(\hat{H}_{C}\) has integer-valued \begin{table} \begin{tabular}{l c c} Gate & Avg. gate fid. (\%) & Avg. gate fid. (\%) \\ & with no loss & with single-photon loss \\ \hline \(R_{Z}(\phi)\) & \(>99.99\) & 99.64 \\ \(R_{X}(\theta)\) & \(>99.99\) & 98.59 \\ \(R_{Y}(\varphi)\) & \(99.52\) & 98.72 \\ \(R_{ZZ}(\Theta)\) & \(>99.99\) & 99.15 \\ \end{tabular} \end{table} Table 1: Average gate fidelities for the considered gates within KNR-encoding obtained through master equation simulation. The results are averaged over 20 points evenly spaced between 0 and \(\pi\). The single-photon loss rate was set to \(K/1500\). Figure 1: The computational states that lie along the \(x,y,z\)-axis implemented with cat qubits and visualized on the Bloch sphere along with their Wigner function. eigenvalues, and \(\vec{\beta}=(\beta_{1},\ldots,\beta_{p})\) with \(\beta_{i}\in[0,\pi)\), the final variational state is \[\ket{\psi_{p}(\vec{\gamma},\vec{\beta})}\equiv\hat{V}(\beta_{p})\hat{U}(\gamma_{ p})\ldots\hat{V}(\beta_{1})\hat{U}(\gamma_{1})\ket{+}^{\otimes n}. \tag{11}\] The parametrized quantum gates are then optimized in a closed loop using a classical optimizer with the objective of minimizing the expectation value of the cost Hamiltonian \[(\vec{\gamma}^{*},\vec{\beta}^{*})=\arg\min_{\vec{\gamma},\vec{\beta}}\ \langle\psi_{p}(\vec{\gamma},\vec{\beta})|\hat{H}_{C}|\psi_{p}(\vec{\gamma}, \vec{\beta})\rangle\,. \tag{12}\] Once the optimal variational parameters are found one samples from the state \(\ket{\psi_{p}(\vec{\gamma}^{*},\vec{\beta}^{*})}\) by measuring it in the computational basis, the eigenvalue of the cost Hamiltonian Eq. (10) corresponding to the measured configuration, is evaluated. The success probability is defined as the probability of finding the qubits in the ground state configuration when performing a single shot measurement of the \(\ket{\psi_{p}(\vec{\gamma},\vec{\beta})}\) state, i.e. \[F_{p}(\vec{\gamma},\vec{\beta})\equiv\sum_{z_{i}\in\vec{z}_{\text{sol}}}| \bra{z_{i}}\ket{\psi_{p}(\vec{\gamma},\vec{\beta})}|^{2}, \tag{13}\] where \(z_{i}\) is a bit-string of length \(n\), and \(\vec{z}_{\text{sol}}\) is the set of all bit string solutions. It is clear that QAOA can be run on cat qubits and compiled using the gates discussed in Section II.2. The unitary \(e^{-i\beta\hat{H}_{M}}\) can easily be implemented as single qubit \(R_{X}(2\beta)\)-gates on each individual qubit, and the cost Hamiltonian \(\hat{H}_{C}\) can be implemented as a product of \(R_{Z}(2\gamma h_{i})\)-gates and \(R_{ZZ}(2\gamma J_{ij})\)-gates [48]. ### Solving a toy problem with QAOA on cat qubits In order to test the capability of cat qubits for solving combinatorial optimization problems using QAOA given relevant gate fidelities for the set of operations considered, we run a master equation simulation of a two-qubit Exact Cover problem on cat qubits. Exact Cover is a NP-complete problem [49; 50] that appears in logistics, and notably as a part of the Tail Assignment problem [7]. The Exact Cover is formulated as follows: given a set \(U=\{c_{1},c_{2},\ldots,c_{n}\}\), and a set of subsets \(V=\{V_{1},\ldots,V_{m}\}\) with \(V_{i}\subset U\) such that \[U=\bigcup_{i=1}^{m}V_{i}, \tag{14}\] the goal is to decide if there exist a subset of the set of sets \(\{V_{i}\}\), called \(R\), such that the elements of \(R\) are disjoint sets i.e. \(V_{i}\cap V_{j}=\emptyset\) for \(i\neq j\), and the union of element of \(R\) is \(U\). For two qubits, the simulation of the circuit with the action of the gates can be carried out by solving the Lindblad master equation for the Kerr resonators. Therefore, we start by simulating Exact Cover for the same toy instance that was considered in Ref. [12], i.e. \(U=\{c_{1},c_{2}\}\) and \(V=\{V_{1},V_{2}\}\), with \(V_{1}=\{c_{1},c_{2}\}\) and \(V_{2}=\{c_{2}\}\). This has solution \(|\bar{10}\rangle\), corresponding to choosing subset \(V_{1}\). The mapping onto the cost Hamiltonian Eq. (10) gives us the values \(h_{1}=1/2\), \(h_{2}=0\) and \(J_{12}=1/2\)[7]. Therefore, the quantum circuit for implementing QAOA with \(p=1\) takes the form of the one in FIG. 2. We extend our analysis of the original QAOA proposal, and allow for different input states, namely \(\ket{+}\) and \(\ket{+i}\), and mixing Hamiltonians \(\hat{H}_{M}\). Specifically we do simulations for both \(\hat{X}\) and \(\hat{Y}\)-mixer, which corresponds to replacing the \(R_{X}(\theta)\)-gate with a \(R_{Y}(\theta)\)-gate in FIG. 2. FIG. 3 illustrates the amplitude of the pulse schedule for \(p=1\) with the \(\hat{X}\) and \(\hat{Y}\) mixer respectively for the gates introduced in Section II.2. We simulate QAOA implemented with cat qubits using the numerically best found variational parameters \((\vec{\gamma},\vec{\beta})\) for the ideal, no losses case, up to \(p=2\). The reason for using the variational parameters for the ideal case is that several results have shown that the optimal variational parameters are robust to noise [51; 52], and because it is computational exhaustive to perform an extensive global optimization simulation of the system. The results are summarized in TABLE 2. First of all, we observe that as a general result (independent on the cat qubit implementation), if the initial state is not an eigenstate of the mixer Hamiltonian, 100% success probability is achieved already for \(p=1\). If instead the initial state is an eigenstate of the mixer, \(p=2\) is needed to reach 100% success probability. A similar behavior was observed for the MaxCut problem in Ref. [53], where it was shown that by designing the mixer Hamiltonian to allow for rotations around the \(XY\)-axis lead to a performance increase. In the absence of single-photon losses, these success probabilities are well reproduced when simulating QAOA on cat qubits. Deviations from the ideal case still arise, due to the imperfect average gate fidelities of the gates used to implement the sequence, as per Section II.2. In the presence of single-photon losses, the performances of the \(R_{X}(\theta)\) and \(R_{Y}(\theta)\) mixers are almost the same. Figure 2: The circuit diagram of QAOA with depth \(p=1\) for solving a two-qubit instance of the Exact Cover problem, using the universal gate set introduced in Eq. (5)-(8). Here, the circuit is shown using the \(\hat{X}\)-mixer. ### Numerical results for larger systems: Pauli transfer matrix formalism We now move forward to more complex simulations. In this section, we numerically simulate solving 8-qubit MaxCut problems using QAOA with cat qubits and compare it to the case of standard qubits, encoded in ideal two-level systems, in the presence of single-photon loss for both systems. The MaxCut problem is a NP-complete problem that has been extensively studied in the context of QAOA [54, 11, 55]. The objective of MaxCut is to partition the set of vertices of a graph into two subsets, such that the sum of the edge weights going from one partition to the other is maximum. MaxCut can be formulated as follows: Given a graph \(G=(V,E)\), where \(V\) is the set of vertices, and \(E\) is the set of edges, the MaxCut Hamiltonian is \[\hat{H}_{C}=\frac{1}{2}\sum_{i,j\in E}(1-\hat{Z}_{i}\hat{Z}_{j}), \tag{15}\] where the sum is over all edges. Since the total Hilbert space dimension increases exponentially with the number of KNRs -- The Hilbert space for each KNR is of course infinite but in the simulation we truncate it to 20 levels for each resonator -- simulating more than 2 to 3 KNRs quickly becomes computationally difficult. A different strategy is to perform quantum gate set tomography by using the Pauli transfer matrix (PTM) formalism. This allow us to map the quantum process of each individual gate to effective two-level systems and hence simulate it using the Kraus-operator formalism instead of the Lindblad master equation, which is a lot more computationally efficient. For a quantum channel \(\mathcal{E}(\rho)\) the PTM is formally defined as [56] \[(R_{\mathcal{E}})_{ij}\equiv\frac{1}{d}\operatorname{Tr}\Bigl{[}\hat{P}_{i} \mathcal{E}(\hat{P}_{j})\Bigr{]}, \tag{16}\] where \(\hat{P}_{j}\in\{\hat{I},\hat{X},\hat{Y},\hat{Z}\}^{\otimes n}\) is the Pauli group in the computational basis for \(n\)-qubits, and \(d=2^{n}\) is the Hilbert space dimension. Furthermore, the PTM formalism allows for composite maps to be written as a matrix product of the individual PTMs, i.e. \(\mathcal{E}_{2}\circ\mathcal{E}_{1}=R_{\mathcal{E}_{2}}R_{\mathcal{E}_{1}}\). Using this fact we can deconstruct the PTM as a product of two parts: an ideal part \(R_{\text{ideal}}\), corresponding to the noiseless ideal gate, and a noise part \(R_{\text{noise}}\), corresponding to both coherent errors as a result of imprecise unitary operation, and incoherent errors stemming from single-photon losses. Since the ideal gate operation is known, it is possible to extract the erroneous part from the full quantum process as follows: \[R_{\mathcal{E}}=R_{\text{noise}}R_{\text{ideal}}\Rightarrow R_{\text{noise}} =R_{\mathcal{E}}R_{\text{ideal}}^{-1}. \tag{17}\] We now use the aforementioned procedure in order to transform the continuous time evolution of the KNR gates to PTMs. Since the QAOA implementation of \begin{table} \begin{tabular}{c c c c c c} \(p\) & Input & Mixer & \begin{tabular}{c} Ideal \\ QAOA (\%) \\ \end{tabular} & \begin{tabular}{c} Cat qb. with \\ no losses (\%) \\ \end{tabular} & \begin{tabular}{c} Cat qb. with \\ losses (\%) \\ \end{tabular} \\ \hline 1 & \(|+\rangle\) & \(X\) & 50 & 50.0 & 49.0 \\ 2 & \(|+\rangle\) & \(X\) & 100 & 99.9 & 90.6 \\ 1 & \(|+i\rangle\) & \(X\) & 100 & 99.9 & 96.4 \\ 1 & \(|+i\rangle\) & \(Y\) & 50 & 49.9 & 48.4 \\ 2 & \(|+i\rangle\) & \(Y\) & 100 & 99.9 & 91.3 \\ 1 & \(|+\rangle\) & \(Y\) & 100 & 99.9 & 95.8 \\ \end{tabular} \end{table} Table 2: Performance of QAOA for solving a toy two-qubit instance of Exact Cover on cat qubits for different mixers and initial states. The percentages correspond to the success probability given by Eq. (13), using the numerically best found angles. The noisy case corresponds to a single-photon loss rate of \(K/1500\). The simulation results were obtained by solving the Schrödinger equation for the no losses case, and the Lindblad master equation for the noisy case. Figure 3: QAOA depth \(p=1\) pulse schedule and shape **(a)** with \(X\)-mixer, **(b)** with \(Y\)-mixer. Each label corresponds to a Hamiltonian, for example \(Z_{0}\) corresponds to the amplitude in units of the Kerr non-linearity of the Hamiltonian that implements the \(R_{Z}\)-gate on the zero-th cat qubit. Furthermore, the \(G\)-label in **(b)** corresponds to the amplitude of the two-photon drive, where the unit amplitude corresponds to a net two-photon drive of zero amplitude and the two unit amplitude corresponds to two-photon driving along the \(P\)-quadrature. This is because, in the simulations, the two-photon drive is always on. This is not shown in the figure, just as the always present self-Kerr. Therefore, to turn off the always present two-photon drive an additional two-photon drive Hamiltonian is turned on, but with an opposite amplitude. A more detailed description of how the gates are implemented can be found in Appendix A. MaxCut only requires \(R_{X}(\theta)\) and \(R_{ZZ}(\Theta)\)-gates we will only focus on these two gates, starting with the former. Because the \(R_{X}(\theta)\)-gate is not noise bias preserving, meaning that single-photon losses does not commute through the gate, the noise part \(R_{\rm noise}\) will ultimately depend on the angle \(\theta\). We therefore compute \(R_{\rm noise}\) for 180 evenly spaced points between 0 and \(\pi\) for the \(R_{X}(\theta)\)-gate, and use the closest \(R_{\rm noise}\) for a given \(\theta\) in upcoming simulations. Hence, we do not need to compute \(R_{\mathcal{E}}\) for every possible angle. For the \(R_{ZZ}(\Theta)\)-gate, however, we only compute the PTM for \(\Theta=0\), since this gate is noise bias preserving, because a single-photon loss corresponds to a \(\hat{Z}\) error in the computational subspace, and \(R_{\rm noise}\) is thus independent on the angle \(\Theta\). For the MaxCut problem, the \(R_{Z}(\phi)\)-gate is not needed for the circuit compilation, and we therefore exclude it. Once the PTMs have been obtained, we transform them to Kraus operators, in order to easily simulate the circuit using Cirq [57] as \[\hat{\rho}\rightarrow\sum_{k=1}^{m}\hat{A}_{k}(\hat{U}\hat{\rho}\hat{U}^{ \dagger})\hat{A}_{k}^{\dagger}, \tag{18}\] where \(\hat{U}\) corresponds to the ideal gate and \(\hat{A}_{k}\) is the set of Kraus operators that describe the noise. Transforming the PTM to Kraus operators can be done by first transforming the PTM to the Choi-representation and then transform the Choi-representation to the Kraus-representation. To begin, the PTM for a \(n\)-qubit channel can be transformed to a Choi-matrix according to [56] \[\hat{\rho}_{\mathcal{E}}=\frac{1}{d^{2}}\sum_{i,j=1}^{d^{2}}(R_{\mathcal{E}})_ {ij}\hat{P}_{j}^{T}\otimes\hat{P}_{i}. \tag{19}\] Given the Choi-matrix, the Kraus-representation is obtained by first diagonalizing the Choi-matrix, from which its eigenvalues \(\{\lambda_{i}\}\) and eigenvectors \(\{|\hat{A}_{i}\rangle\}\), where \(|\cdot\rangle\rangle\) is a superoperator. The eigenvalues and eigenvector are then used to construct the Kraus operators as follows [58]: \[\hat{A}_{i}=\sqrt{\lambda_{i}}\text{unvec}(|\hat{A}_{i}\rangle)), \tag{20}\] where unwec is the unvectorization operation. In order to make a fair comparison between the performance of the cat qubit and the one of the standard qubit, we chose the relevant parameter such that the average gate fidelities are the same between the two systems. By doing so, we can compare which encoding, continuous versus discrete, is the best for QAOA. For the standard qubit device, we implement the \(R_{X}(\theta)\)-gate by evolving under the Pauli \(\hat{X}\), and the \(R_{ZZ}(\Theta)\)-gate by evolving under \(\hat{Z}_{i}\hat{Z}_{j}\). The gate time \(T_{g}\) is chosen to be the same as was used for the cat qubit device, i.e. \(T_{g}=10/K\) where \(K\) is the Kerr non-linearity for the \(R_{X}(\theta)\)-gate and \(T_{g}=2/K\) for the \(R_{ZZ}(\Theta)\)-gate. We specifically pick the relaxation rates \(T_{1}\) with the pure dephasing rate \(T_{\phi}\) set to zero, such that the average gate fidelity corresponds to that of the KNR-gates. To this aim we use an expression for the first-order reduction in the average gate fidelity due to relaxation rate [59] \[\bar{F}=1-\frac{d}{2(d+1)}T_{g}n\Gamma_{1}, \tag{21}\] where \(\bar{F}\) is the average gate-fidelity, \(d=2^{n}\), and \(\Gamma_{1}=1/T_{1}\) is the relaxation rate where \(T_{1}\) is the relaxation time which we assume to be the same for all \(n\) qubits. The expression can be re-written to give the relaxation rate in terms of the average gate-fidelity \[\Gamma_{1}=2\frac{(d+1)(1-\bar{F})}{dT_{g}n}. \tag{22}\] Using the average gate-fidelities \(\bar{F}\) that were numerically calculated for the cat qubits in TABLE 1, the corresponding relaxation rates for the standard qubits that results in the same average gate fidelity as for the cat qubits can be obtained. Likewise, we do quantum gate set tomography using the PTM formalism for the standard qubit device, and since neither the \(R_{X}(\theta)\) nor the \(R_{ZZ}(\Theta)\)-gate are noise bias preserving in this case, we compute \(R_{\rm noise}\) for 180 evenly spaced points of \(\theta\) and \(\Theta\) between 0 and \(\pi\) for each of the two gates respectively. In TABLE 3 we report the average gate fidelity for the \(R_{ZZ}(\Theta)\) and \(R_{X}(\theta)\)-gate using the Kraus operator formalism for both cat qubits and the standard qubits after setting the relaxation time \(T_{1}\) found for the standard qubits. From TABLE 3 the average gate fidelities matches very well between the cat and standard qubits, with the \(R_{X}(\theta)\)-gate being 0.02% higher for the standard qubits, which we attribute to the fact that Eq. (21) is only a first order approximation of the average gate fidelity. Using the Kraus-operator formalism, we are able to simulate QAOA with cat qubits and standard qubits for solving 30 randomly generated 8-qubit instances of MaxCut on Erdos-Renyi graphs with edge probability \(p=0.5\). As a metric for comparison between the performance of cat qubits and standard qubits we look at the approximation-ratio, defined as \[r\equiv\frac{\text{Tr}\Big{(}\hat{\rho}\hat{H}_{C}\Big{)}}{C_{\rm max}}, \tag{23}\] where the numerator is the expected cut value with \(\hat{\rho}\) the density matrix output from QAOA, and \(C_{\rm max}\) is the \begin{table} \begin{tabular}{l c c} Avg. gate fid. (\%) & \(R_{ZZ}(\Theta)\) & \(R_{X}(\theta)\) \\ \hline Cat qubits & 99.16 & 98.60 \\ Standard qubits & 99.16 & 98.62 \\ \end{tabular} \end{table} Table 3: Average gate fidelities for the \(R_{ZZ}(\Theta)\) and \(R_{X}(\theta)\)-gate for cat qubits and standard qubits obtained using the Kraus operator formalism. The results are averaged over 20 points evenly spaced between 0 and \(\pi\). value of the maximum cut. The simulation results are presented in FIG. 4. For both cases, the approximation ratio first increases at increasing \(p\), and then starts decreasing when \(p\) is sufficiently high so that the noise in the gates for implementing the QAOA sequence makes it less advantageous to use large depth circuits. The results show that given the same average gate fidelities, the approximation ratio obtained for the KNR device is higher than for the standard qubit device for all iteration levels \(p\), thereby indicating an advantage in the use of the former qubit implementation over the latter. For the case of standard qubits, the highest approximation ratio is achieved for \(p=3\) while for cat qubits the highest approximation ratio is achieved for \(p=4\). The numerical method used to achieve the classical optimization of the various QAOA instances is described in Appendix B, where we also report on the simulation results for the approximation ratios corresponding to the ideal case, the use of cat qubits, and of standard qubits respectively, without averaging over the random instances. We note that the approximation ratio for both standard and cat qubits could be further improved by resorting to error mitigation techniques for estimating expectation values, such as, for instance, virtual distillation [60, 61, 62] which has been shown to be robust against dephasing noise for QAOA [37]. Finally, one might wonder whether a better performance in terms of the approximation ratio could be obtained by defining a genuinely bosonic variant of the QAOA algorithm, i.e. by Trotterizing an appropriate bosonic quantum annealing Hamiltonian [38], which initial optimal eigenstate is the vacuum, and which final optimal eigenstate encodes the solution. We explore this question in Appendix C, where our numerical simulation suggest that such a bosonic QAOA algorithm does not yield an improvement over QAOA on cat qubits. We hypothesize that this missed efficiency stems from the need for bosonic QAOA to bring the state of the system of resonators into the qubit computational basis. ## IV Conclusions In conclusion, we have studied implementations of QAOA with a noise biased qubit, namely the cat qubit, and we have performed numerical simulations in the case that such a cat qubit is implemented by means of a Kerr nonlinear resonator. Despite the algorithmic sequence requires non-bias preserving \(X\)-rotations, running QAOA on such cat qubits yields a performance advantage with respect to the use of standard qubits in the presence of noise caused by single-photon losses for the studied problem, MaxCut. We expect these results not to be dependent on the problem chosen, and that other problems than MaxCut would benefit from the same performance separation. Our results indicate that noise biased qubits that favor dephasing errors, such as cat qubits, are preferable over standard qubits for the implementation of QAOA on near-term intermediate-scale quantum processors, and provide a concrete estimate of the obtainable approximation ratio for MaxCut, for an implementation based on Kerr resonators with realistic noise parameters. An interesting question that stems from our work is how the results here presented, and in particular the performance of QAOA, would change in the case where one would adopt a similar encoding of cat qubits in Kerr resonators, but with a more sophisticated use of the detuning as was recently introduced in Ref. [63], or with the alternative definition of gates considered in the dissipative scenario of Ref. [64]. We leave these analysis for future work. ###### Acknowledgements. We acknowledge useful discussions with Simone Gasparinetti and Timo Hillmann. G. F. acknowledges support from the Vetenskapsradet (Swedish Research Council) Grant QuACVA. G. F., L. G.-A., and P. V. acknowledge support from the Knut and Alice Wallenberg Foundation through the Wallenberg Center for Quantum Technology (WACQT). S. P. was supported by the Air Force Office of Scientific Research under award number FA9550-21-1-0209. ## Code availability The code used for producing the results is made available in Ref. [65]. All master equation simulations are performed using QuTip [66, 67, 68]. Figure 4: Mean approximation ratio averaged over 30 instances of 8-qubit MaxCut graphs. The circle corresponds to the approximation ratio of an ideal (noise free) quantum computer. The square is the approximation ratio obtained using cat qubits and the triangle is with standard qubits encoded into discrete two-level systems. The average gate fidelity was chosen to be close to identical for the cat qubits and standard qubits with values reported in Appendix A. ## Appendix A Quantum gates on cat qubits In this Appendix, we will go through the implementation of a universal gate set for the cat qubits implemented in a Kerr nonlinear resonator. All gates will be evaluated in terms of their average gate fidelity. The average gate fidelity of a quantum channel \(\mathcal{E}\) for a qudit of dimension \(d\) is defined as [69] \[\bar{F}(\mathcal{E},\hat{U})=\frac{\sum_{j}\mathrm{Tr}\!\left(\hat{U}\hat{P}_{j }^{\dagger}\hat{U}^{\dagger}\mathcal{E}(\hat{P}_{j})\right)+d^{2}}{d^{2}(d+1)}, \tag{10}\] where \(\hat{U}\) is the target gate and the sum is over the basis of unitary operators \(\hat{P}_{j}\) for the qudit, with \(\hat{P}_{j}\) satisfying \(\mathrm{Tr}\!\left(\hat{P}_{j}^{\dagger}\hat{P}_{k}\right)=\delta_{jk}d\). In the simulations we set \(d=2\) for single-qubit gates and \(d=4\) for two-qubit gates, and \(\hat{P}_{j}\) is chosen to be one of the Pauli matrices in the computational-basis, e.g \(\hat{P}_{j}\in\{\hat{I},\hat{X},\hat{Y},\hat{Z}\}^{\otimes n}\), where \(n\) is the number of cat qubits. Moreover, we set \(G=4K\) so that \(\alpha=2\) in all subsequent simulations. ### \(R_{z}(\phi)\)-gate The \(R_{Z}(\phi)\) gate can be performed by applying a single-photon drive with an amplitude of \(E(t)\) to the KNR. The Hamiltonian for this drive is given by: \[\hat{H}_{Z}(t)=E(t)(\hat{a}e^{-i\theta}+\hat{a}^{\dagger}e^{i\theta}), \tag{11}\] where \(\theta\) is the phase of the drive. When \(\theta=0\), and \(|E(t)|\ll 4G\) and the variation of \(E(t)\) is sufficiently slow, the cat qubit is approximately kept in the computational basis [70, 42]. Applying the projector onto the computational subspace \(\hat{I}=|\bar{0}\rangle\!\langle\bar{0}|+|\bar{1}\rangle\!\langle\bar{1}|\) to the single-photon drive Hamiltonian Eq. (11) gives for large \(\alpha\) \[\hat{I}E(t)(\hat{a}^{\dagger}+\hat{a})\hat{I}=2E(t)\alpha\hat{Z}. \tag{12}\] We perform numerical simulations where we set \(\Delta=0\) and define \(E(t)\) as \[E(t)=\frac{\pi\phi}{8T_{g}\alpha}\sin\frac{\pi t}{T_{g}}, \tag{13}\] with \(T_{g}=2/K\), and \(\phi\) is the angle for the gate. In FIG. 5 the average gate infidelity \((1-\bar{F})\) as a function of \(\phi\) for the \(R_{Z}(\phi)\)-gate is shown: in **(a)** without losses, and in **(b)** with a single-photon loss rate of \(K/1500\). ### \(R_{x}(\theta)\)-gate An \(R_{X}(\theta)\)-gate can be realized by means of a small non-zero detuning \(\Delta\) between the two-photon drive and the resonator. This can be understood by projecting the number operator in the computational basis: \[\hat{I}\hat{a}^{\dagger}\hat{a}\hat{I}=|\alpha|^{2}\hat{I}-|\alpha|^{2}e^{-2| \alpha|^{2}}\hat{X}.\] If \(\Delta(t)\ll 2G\) the computational states \(|\bar{0}\rangle\) and \(|\bar{1}\rangle\) are approximately kept in the computational subspace. Thus choosing \(\Delta(t)\) as \[\Delta(t)=\frac{\theta\pi}{4T_{g}|\alpha|^{2}e^{-2|\alpha|^{2}}}\sin\frac{\pi t }{T_{g}} \tag{14}\] yields \[e^{-i[-\hat{a}^{\dagger}\hat{a}\int_{0}^{T_{g}}\Delta(t)dt]}=e^{-i\frac{\theta }{2}\hat{X}}, \tag{15}\] corresponding to a \(R_{X}(\theta)\)-gate. The disadvantage of this approach, however, is that the gate time \(T_{g}\) has to be exponentially large with respect to \(\alpha\) in order to satisfy the condition \(\Delta(t)\ll 2G\). For example, if \(\alpha=2\), then a total gate time \(T_{g}>1000/K\) is required. However, a second proposal was put forward by Goto [42], where the detuning is set to a fixed value \(\Delta_{0}\), and the corresponding \(\theta\) that maximizes the average gate fidelity is evaluated. Hence, to perform the \(R_{X}(\theta)\)-gate, \(\Delta(t)\) is set to \[\Delta(t)=\Delta_{0}\sin^{2}\frac{\pi t}{T_{g}}, \tag{16}\] with \(T_{g}=10/K\). Throughout this paper, we use this second method. We find the \(\theta\) that maximizes the average gate fidelity for 20 values of \(\Delta_{0}\) between 0 and \(3.95K\), see FIG. 6a. It can be seen that while \(\Delta_{0}\) changes from 0 to \(3.95K\), the rotation angle \(\theta\) changes from 0 to \(\pi\). In FIG. 6**(b)** and **(c)** the average gate infidelity \((1-\bar{F})\) as a function of \(\theta\) for the \(R_{X}(\theta)\)-gate is shown: in **(b)** without losses, and in **(c)** with a single-photon loss rate of \(K/1500\). ### \(R_{y}(\varphi)\)-gate To perform the \(R_{Y}(\varphi)\)-gate, the two-photon drive is turned off for a total time \(t=\pi/2K\) to let the state evolve freely under the Kerr Hamiltonian. If the initial state is the vacuum state \(\ket{0}_{\mathrm{vac}}\), it will evolve into Figure 5: The average gate infidelity \((1-\bar{F})\) of the \(R_{Z}(\phi)\)-gate**(a)** without noise and **(b)** with a single-photon loss rate of \(K/1500\). \(i\,|C_{-i\alpha}^{-}\rangle)/\sqrt{2}\). Once the state is along the imaginary axis the two-photon drive is turned on, with a \(\pi/2\) phase, so that the state is stabilized along the imaginary-axis. Applying the single-photon drive also with a \(\pi/2\) phase, such that \(\hat{H}_{Z}(t)=E(t)(\hat{a}^{\dagger}e^{i\pi/2}+\hat{a}e^{-i\pi/2})\), where \(E(t)\) is given by Eq. (10), the two cat states will acquire a phase difference. When the two-photon drive is turned off for a second time, that is \(t=\pi/2K\), the resulting gate is \(R_{Y}(\varphi)\), see FIG. 7. In FIG. 8 the average gate infidelity \((1-\bar{F})\) as a function of \(\varphi\) for the \(R_{Y}(\varphi)\)-gate is shown in **(a)** without losses, and with a single-photon loss rate of \(K/1500\) in **(b)**. ### \(R_{zz}(\Theta)\)-gate The two-qubit Ising-zz gate \(R_{ZZ}(\Theta)\) is achieved by means of two-photon exchange between two KNRs, yielding the coupling Hamiltonian \[\hat{H}_{ZZ}=g(t)(\hat{a}_{1}\hat{a}_{2}^{\dagger}+\hat{a}_{1}^{ \dagger}\hat{a}_{2}). \tag{11}\] When \(|g(t)|\ll 2G\), the KNRs are approximately kept in the subspace spanned by \(|\bar{0}\bar{0}\rangle\), \(|\bar{0}\bar{1}\rangle\), \(|\bar{1}\bar{0}\rangle\) and \(|\bar{1}\bar{1}\rangle\). Projection of Eq. (11) onto the computational basis yields for large \(\alpha\) \[\hat{H}_{ZZ}=2\alpha^{2}g(t)\hat{Z}_{1}\hat{Z}_{2}+\text{const}. \tag{12}\] In our numerical simulation we set \(T_{g}=2/K\), and to perform \(R_{ZZ}(\Theta)\), we set \(g(t)\) as \[g(t)=\frac{\pi\Theta}{8T_{g}\alpha^{2}}\sin\frac{\pi t}{T_{g}}. \tag{13}\] In FIG. 9 the average gate infidelity \((1-\bar{F})\) as a function of \(\Theta\) for the \(R_{ZZ}(\Theta)\)-gate is shown: in **(a)** without losses, and in **(b)** with a single-photon loss rate of \(K/1500\). ## Appendix B Numerical optimization and approximation ratios In this section we elaborate on the classical optimization part of QAOA that was used in Section III.3. For \(p=1\), brute force optimization is used where the the cost function \(\langle\psi_{1}(\gamma,\beta)|\hat{H}_{C}|\psi_{1}(\gamma,\beta)\rangle\) is evaluated on a \(100\times 100\) grid. For \(p>1\), we use the interpolation method, described in Ref. [71], together with a local optimizer. This strategy consists in predicting a good starting point for the variational parameters search at level \(p+1\) for each individual instance based on the best vari Figure 8: The average gate infidelity \(1-\bar{F}\) of the \(R_{Y}(\varphi)\)-gate **(a)** without noise and **(b)** with single-photon loss rate of \(K/1500\). Figure 6: **(a)**\(\theta\) maximizing the average gate fidelity \(1-\bar{F}\) as a function of \(\Delta_{0}\). **(b)** Average gate infidelity without noise and **(c)** with single-photon loss rate of \(K/1500\). Figure 7: **(a)-(d)** Wigner function at four different stages of the \(R_{Y}(\pi/2)\)-gate starting from the \(|\bar{0}\rangle\) state. Between **(a)-(b)** the two-photon drive is turned off to let the state evolve freely under the Kerr Hamiltonian. When a time \(t=\pi/2K\) has passed, the two-photon drive is turned on again but this time with a \(\pi/2\) phase such that the state is stabilized along the imaginary axis in the phase space. Between **(b)-(c)** a single-photon drive with a \(\pi/2\) is applied to the cat-state for a time \(t=2\pi/K\). This makes the superposition of the two coherent states acquire a phase difference depending on the angle \(\varphi\). Finally, between **(c)-(d)** the two-photon drive is turned off once more for a time \(t=\pi/2K\) to let the state evolve back an be stabilized along the real axis. ational parameters found at level \(p\) for the same instance. From the produced starting point we run a L-BFGS optimizer. FIG. 10 shows the approximation ratio for each instances for noiseless, ideal QAOA as a function of the level \(p\). As can be seen from the figure the approximation ratio increases at increasing QAOA level for each individual instance, indicating the success of the classical optimizer at finding good variational parameters. ## Appendix C Bosonic QAOA In this Appendix we explore the possibility of deriving a genuinely bosonic version of the QAOA algorithm from Trotterizing a bosonic quantum annealing Hamiltonian, in analogy as what initially done for qubit QAOA in Ref. [4]. We refer to this new algorithm as Bosonic QAOA. We compare numerically its performace to QAOA on cat qubits, for the simple case of fading the ground state of a single Ising spin. ### Trotterization of the CV Quantum Annealing Hamiltonian The time evolution of the quantum annealing algorithm starts from the ground state of a Hamiltonian that is easy to prepare and slowly evolves the system into the ground state of a Hamiltonian encoding the solution to a combinatorial optimization problem. If the evolution is slow enough, as set by the quantum adiabatic theorem, the initial state will follow the instantaneous ground state throughout the evolution and end up in the solution state. The algorithm also works if the initial state is the highest energy eigenstate, or "roof" state, of the initial Hamiltonian, provided the final Hamiltonian encodes the solution in its highest energy eigenstate. The starting point for deriving a bosonic QAOA algorithm is the quantum annealing Hamiltonian \[\hat{H}(t)=\left(1-\frac{t}{\tau}\right)\hat{H}_{M}+\frac{t}{\tau}\hat{H}_{C}, \tag{10}\] where \(\hat{H}_{M}\) is the initial Hamiltonian, whose ground state is easy to prepare, and \(\hat{H}_{C}\) is the final Hamiltonian, whose ground state encodes the solution to an optimization problem. We take inspiration by the annealing protocol using Kerr resonators of Ref. [38]. For \(n\) resonators, we can choose \[\hat{H}_{M}=\sum_{i=1}^{n}(-\Delta\hat{a}_{i}^{\dagger}\hat{a}_{i}-K\hat{a}_{ i}^{\dagger 2}\hat{a}_{i}^{2}), \tag{11}\] which has the vacuum state \(\ket{0}_{\text{vac}}\) as its "roof state", and \[\hat{H}_{C} =\sum_{i=1}^{n}\Big{[}-K\hat{a}_{i}^{\dagger 2}\hat{a}_{i}^{2}+G \Big{(}\hat{a}_{i}^{\dagger 2}+\hat{a}_{i}^{2}\Big{)}\] \[+E_{i}\Big{(}\hat{a}_{i}^{\dagger}+\hat{a}_{i}\Big{)}\Big{]}+\sum _{1\leq i<j\leq n}g_{ij}\Big{(}\hat{a}_{i}^{\dagger}\hat{a}_{j}+\hat{a}_{j}^{ \dagger}\hat{a}_{i}\Big{)}. \tag{12}\] By starting from the vacuum state and slowly increasing \(t\), the instantaneous eigenstate of the Hamiltonian Eq. (10) evolves into the highest energy eigenstate of \(\hat{H}_{C}\) which encodes the solution to an optimization problem upon cat qubit encoding [38]. We will now in the spirit of Farhi et al. [4] Trotterize the bosonic quantum annealing Hamiltonian Eq. (10) to obtain a genuinely bosonic version of QAOA. The continuous-time evolution governed by the time-dependent Hamiltonian of Eq. (10) is given by \[\hat{U}(T) \equiv\mathcal{T}\exp\!\left[-i\int_{0}^{T}\hat{H}(t)dt\right]\] \[\approx\prod_{k=1}^{p}\exp\!\left[-i\hat{H}(k\delta t)\delta t \right]\!, \tag{13}\] where \(\hat{U}(T)\) is the evolution operator from \(0\) to \(T\), \(\mathcal{T}\) is the time-ordering operator, and \(p\) is a large integer so Figure 10: The approximation ratio as a function of the QAOA level \(p\) plotted for each individual instance in the ideal case, meaning no noise. There are 30 instances in total. Figure 9: The average gate infidelity \(1-\bar{F}\) of the \(R_{ZZ}(\Theta)\)-gate **(a)** without noise and **(b)** with single-photon loss rate of \(K/1500\). that \(\delta t=T/p\) is a small time interval. Since \(\hat{H}_{M}\) and \(\hat{H}_{C}\) are two non-commuting Hamiltonians, one can use the Trotter formula: \[e^{i(A+B)\delta t}=e^{iA\delta t}e^{iB\delta t}+\mathcal{O}(\delta t^{2}), \tag{10}\] for two non-commuting operators \(A\) and \(B\) given sufficiently small \(\delta t\), and apply it to the discretized time evolution operator Eq. (11), yielding \[\hat{U}(T)\approx\prod_{k=1}^{p}\exp\biggl{[}-i\biggl{(}1-\frac{k \delta t}{\tau}\biggr{)}\hat{H}_{M}\delta t\biggr{]}\\ \times\exp\biggl{[}-i\frac{k\delta t}{\tau}\hat{H}_{C}\delta t \biggr{]}. \tag{11}\] We have so far approximated the continuous-time evolution by a sequential product of discrete time steps. We can now apply the same idea underlying the QAOA algorithm in Ref. [4], which consists in truncating this product to an arbitrary positive integer \(p\) and redefining the time dependence in each exponent in terms of variational parameters \((1-k\delta t/\tau)\delta t\to\beta_{k}\) and \((k\delta t/\tau)\delta t\to\gamma_{k}\), leading to \[\hat{U}_{p}=\prod_{k=1}^{p}\exp\Bigl{[}-i\beta_{k}\hat{H}_{M}\Bigr{]}\exp \Bigl{[}-i\gamma_{k}\hat{H}_{C}\Bigr{]}. \tag{12}\] We then define our bosonic QAOA algorithm as the sequence in Eq. (12), with \(\hat{H}_{M}\) and \(\hat{H}_{C}\) given by Eq. (10) and (11) respectively, applied to vacuum state chosen as the initial state. It is interesting to compare the bosonic QAOA algorithm that we derived to the standard QAOA from Section III, when the latter is implemented on cat qubits. In TABLE 4 we compare the mixing Hamiltonian, cost Hamiltonian and initial states of bosonic QAOA and QAOA. Clearly, the cost Hamiltonian encoding the problem solution is the same for the two algorithms. Instead, the two-photon drive is not present in the mixer Hamiltonian for bosonic QAOA. The most notable difference is that while the input state for QAOA on cat qubits is the state \(\ket{+}\) in all qubits, corresponding to initializing all qubits into a cat state \(\ket{C_{\alpha}^{+}}\), the input state for bosonic QAOA is the vacuum state. ### Finding the ground state of a single Ising spin To test the performance of bosonic QAOA we consider the simplest problem possible -- finding the ground state of a single Ising spin in a magnetic field. The cost Hamiltonian for the single Ising spin in a magnetic field is \[\hat{H}_{C}=-K\hat{a}^{\dagger 2}\hat{a}^{2}+G(\hat{a}^{\dagger 2}+\hat{a}^{2 })+E(\hat{a}^{\dagger}+\hat{a}). \tag{13}\] In the simulations we begin from the vacuum and we set \(\Delta=K/(\abs{\alpha}^{2}e^{-2\abs{\alpha}^{2}})\) and \(E=K/(2\alpha)\). The cost Hamiltonian in the computational-basis is \(\hat{H}_{C}=\hat{Z}\), whose ground state is \(\ket{\bar{1}}\). From the numerical simulations we obtain a fidelity of \(0.52\) for \(p=1\) and of \(0.785\) for \(p=2\). In both cases these results were obtained by evaluation of the expectation value of the cost Hamiltonian on a \((100\times 100)^{p}\)-grid. The low fidelity finds an interpretation in terms of the expectation value landscape for \(p=1\), given in FIG. 11a. We see that the landscape is very heavily oscillating, hindering optimization. This should also be compared with the same expectation value landscape of QAOA for qubits which appears instead dramatically smoother, see FIG. 11b. The fidelity is moreover equal to \(1\) for the \(p=1\) qubits. A possible interpretation of this difference in the performance of bosonic QAOA and QAOA resides in the fact that bosonic QAOA starts from the vacuum. Hence, first iterations of the algorithm are needed just to bring the system onto the qubit computational subspace. In contrast, QAOA implemented with qubits (possibly cat qubits) starts already in the computational subspace. The difficulty of preparing the initial cat state is however somehow hidden in this comparison. Hence in the next subsection we address the preparation of a cat state with bosonic QAOA. ### Creating a cat state from vacuum using bosonic QAOA Here we investigate the possibility of creating a cat state by starting from the vacuum state and by applying bosonic QAOA. The state evolution is \[\hat{U}_{p}\ket{0}_{\text{vac}}=\prod_{k=1}^{p}\exp\Bigl{[}-i\beta_{k}\hat{H }_{0}\Bigr{]}\exp\Bigl{[}-i\gamma_{k}\hat{H}_{1}\Bigr{]}\ket{0}_{\text{vac}} \tag{14}\] where the two Hamiltonians are given by \[\hat{H}_{0}=-\Delta\hat{a}^{\dagger}\hat{a}-K\hat{a}^{\dagger 2}\hat{a}^{2}, \tag{15}\] Figure 11: **(a)** Expectation value landscape of the single-Ising spin for depth \(p=1\) in bosonic QAOA. **(b)** Expectation value landscape of the single-Ising spin for \(p=1\) for standard QAOA. and \[\hat{H}_{1}=-K\hat{a}^{\dagger 2}\hat{a}^{2}+G(\hat{a}^{\dagger 2}+\hat{a}^{2}). \tag{11}\] In the simulations, we use \(\Delta=K/(|\alpha|^{2}e^{-2\left|\alpha^{2}\right|})\) and \(G=4K\), we optimize the angles \((\vec{\gamma},\vec{\beta})\) numerically with respect to minimizing \(F(\alpha,\beta)=1-\left|\langle C_{\alpha}^{+}|\psi_{1}(\alpha,\beta)\rangle \right|^{2}\). FIG. 12 shows \(F(\alpha,\beta)\), where it can be seen that the landscape is highly non-convex and finding the global minimum is challenging. As a result, we obtain a poor fidelity of the variational state with the target cat state, \(\left|\langle C_{\alpha}^{+}|\psi_{1}(\alpha^{*},\beta^{*})\rangle\right|^{2}=0.57\).

2305.13334

Absence of cross-sublattice spin pumping and spin-transfer torques in collinear antiferromagnets

We resolve the debate over the existence and magnitude of cross-sublattice (CS) contributions to spin pumping and spin-transfer torques in a two-sublattice antiferromagnet connected to a non-magnetic metal. Guided by symmetry considerations, we first relate the controversial CS terms to specific components in the spin conductance matrix. Then we quantify these components by studying the spin-dependent electron scattering on a fully compensated interface. We ascertain the absence of all CS contributions in the collinear regime. Even in the non-collinear regime, the CS contributions only constitute a higher-order correction to the existing theory.

Junyu Tang, Ran Cheng

2023-05-20T02:51:39Z

http://arxiv.org/abs/2305.13334v2

# Absence of cross-sublattice spin pumping and spin-transfer torques in collinear antiferromagnets ###### Abstract There have been debates over the existence of cross-sublattice (CS) contributions to spin pumping and spin-transfer torques in an antiferromagnet (AFM) connected to a non-magnetic metal. By studying the interfacial spin conductance from a symmetry perspective, we first relate the CS spin pumping to the CS spin-transfer torques in a two-sublattice AFM. Then by calculating the interfacial spin-dependent electron scattering microscopically, we ascertain the exact absence of the controversial CS contributions in the collinear regime. Even in the non-collinear regime, we find that the CS components only constitute a higher-order correction to the known theory. ## I Introduction Excitations of magnetic order parameters can generate pure spin currents of electrons either incoherently or coherently. An incoherent generation typically involves thermal magnons to exchange spin angular momenta with electrons, whereas a coherent generation can be achieved by virtue of spin pumping [1; 2]. When a collinear antiferromagnet (AFM) characterized by two unit sublattice-magnetic vectors \(\mathbf{m}_{A}\) and \(\mathbf{m}_{B}\) is interfaced with a non-magnetic metal (NM), the coherent dynamics of the Neel vector \(\mathbf{n}=(\mathbf{m}_{A}-\mathbf{m}_{B})/2\) and of the small magnetic moment \(\mathbf{m}=(\mathbf{m}_{A}+\mathbf{m}_{B})/2\) will generate a total pure spin current [3; 4; 5] \[\frac{e}{\hbar}\mathbf{I}_{s}=G^{\prime}(\mathbf{n}\times\dot{\mathbf{n}}+\mathbf{m}\times\dot {\mathbf{m}})-G^{\prime}\dot{\mathbf{m}}, \tag{1}\] where \(\mathbf{I}_{s}\) is measured in units of an electric current (unit: \(A\)), \(e\) is the absolute electron charge, \(\hbar\) is the reduced Planck constant, \(G^{\prime}\) and \(G^{i}\) are two independent components of the interfacial spin conductance [6] which can be rigorously calculated by considering the microscopic spin-dependent scattering on the AFM/NM interface [7]. Equation (1) can be equivalently written in terms of the sublattice-magnetic vectors as \[\frac{e}{\hbar}\mathbf{I}_{s}=G^{AA}\mathbf{m}_{A}\times\dot{\mathbf{m}}_{A}+G^{BB}\mathbf{m} _{B}\times\dot{\mathbf{m}}_{B}-G^{A}\dot{\mathbf{m}}_{A}-G^{B}\dot{\mathbf{m}}_{B}, \tag{2}\] where \(G^{AA}=G^{BB}=G^{\prime}/2\) and \(G^{A}=G^{B}=G^{\prime}/2\). Recently, coherent spin pumping in collinear AFMs described by the above equations has been experimentally verified in a number of materials, notably in MnF\({}_{2}\)[8], Cr\({}_{2}\)O\({}_{3}\)[9], \(\alpha-\)Fe\({}_{2}\)O\({}_{3}\)[10; 11], and synthetic AFM [12], fostering a vibrant search of new physics in the sub-terahertz frequency range harnessing the unique spin dynamics of AFMs. Latest theoretical studies [13; 14; 15; 16], however, suggest that Eq. (2) should also admit cross-sublattice (CS) terms \(G^{AB}\mathbf{m}_{A}\times\dot{\mathbf{m}}_{B}\) and \(G^{BA}\mathbf{m}_{B}\times\dot{\mathbf{m}}_{A}\), which in turns changes the Gilbert damping constant into a matrix. Such additional terms do not contradict with existing experimental observations, but they do modify the strength of spin pumping predicted directly by Eqs. (1) and (2), thus affecting the numerical extraction of the interfacial spin conductance from different materials. Furthermore, in the non-collinear regime of a two-sublattice AFM (such as the spin-flop phase induced by a strong magnetic field), even the conventional form of spin pumping is questionable, especially whether \(\mathbf{n}\times\dot{\mathbf{n}}\) and \(\mathbf{m}\times\dot{\mathbf{m}}\) in Eq. (1) still share the same coefficient [17; 18]. In direct connection with the CS spin pumping, CS spin-transfer torques are allowed by the Onsager reciprocal relations [14; 15; 16], but their existence remains experimentally elusive. In this Letter, we resolve the puzzle of CS contributions to spin pumping and spin-transfer torques in collinear AFMs from a theoretical perspective. Guided by symmetry considerations, we first clarify several essential relations between spin pumping and spin-transfer torques in the presence of CS contributions, where the controversial CS components are expressed in terms of the corresponding coefficients in the spin conductance matrix. We then quantify these coefficients by studying the microscopic spin-dependent scattering of electrons off a fully compensated AFM/NM interface. We claim that all CS effects vanish in the collinear regime, affirming the validity of the established theories [_viz._ Eqs. (1) and (2)] and the experimental fitting they enable. We find that even in the non-collinear regime of a two-sublattice AFM, the CS effects only bring about higher-order corrections. ## II Phenomenological relations In its most general form, the coherent spin pumping by a two-sublattice AFM into an adjacent NM can be written as \[\frac{e}{\hbar}\mathbf{I}_{s}=(\mathbf{m},\mathbf{n})\times\left(\begin{matrix}G^{mn}&G^{ mn}\\ G^{mn}&G^{mn}\end{matrix}\right)\left(\begin{matrix}\dot{\mathbf{m}}\\ \dot{\mathbf{n}}\end{matrix}\right)-G^{m}\dot{\mathbf{n}}, \tag{3}\] which differs (is generalized) from Eq. (1) by the off-diagonal terms in the interfacial spin conductance \(G^{\mu\nu}\) with \(\{\mu,\nu\}=\{m,n\}\). The dynamics of the AFM can be described by a set of coupled Landau-Lifshitz equations as [19] \[\dot{\mathbf{m}} =\frac{1}{\hbar}\left(\mathbf{f}^{n}\times\mathbf{n}+\mathbf{f}^{m}\times\mathbf{ m}\right), \tag{4a}\] \[\dot{\mathbf{n}} =\frac{1}{\hbar}\left(\mathbf{f}^{m}\times\mathbf{n}+\mathbf{f}^{n}\times\bm {m}\right), \tag{4b}\] where the Gilbert damping is omitted for simplicity, \(\mathbf{f}^{m}=-\partial\epsilon/\partial\mathbf{m}\) and \(\mathbf{f}^{n}=-\partial\epsilon/\partial\mathbf{n}\) are the effective fields (or driving forces) with \(\epsilon\) the magnetic free energy. In our convention, \(\mathbf{f}^{m}\) and \(\mathbf{f}^{n}\) are expressed in units of energy. \(\mathbf{I}_{s}\) can be related to these driving forces through the linear response relation \[I_{s,j}=L_{ij}^{sm}f_{j}^{m}+L_{ij}^{sn}f_{j}^{n},\quad(i,j\text{ run over }x,y,z) \tag{5}\] where the response coefficients \(L_{ij}^{sm}(\mathbf{m},\mathbf{n})\) and \(L_{ij}^{sn}(\mathbf{m},\mathbf{n})\) are determined by combining Eq. (3) and Eqs. (4). Reciprocally, the spin-transfer torques can be obtained as \(T_{i}^{m}=L_{ij}^{ms}V_{j}^{s}\) and \(T_{i}^{n}=L_{ij}^{ns}V_{j}^{s}\), where \(\mathbf{V}^{s}=\mathbf{\mu}_{s}/e\) is the spin voltage with the spin chemical potential \(\mathbf{\mu}_{s}=(\mathbf{\mu}_{\uparrow}-\mathbf{\mu}_{\downarrow})\hat{\mathbf{s}}\) (\(\hat{\mathbf{s}}\) specifies the quantization axis). These response coefficients satisfy the Onsager reciprocal relation \[L_{ij}^{ms}(\mathbf{m},\mathbf{n})=L_{ji}^{sm}(-\mathbf{m},-\mathbf{n}), \tag{6}\] as both \(\mathbf{m}\) and \(\mathbf{n}\) break the time-reversal symmetry. An identical relation is applicable to \(L_{ij}^{ns}\) and \(L_{ji}^{mn}\) as well. When \(\mathbf{V}_{s}\) is treated as a common driving force, \(L^{ms(ns)}\) and \(L^{sm(sn)}\) will share the same unit, which simplifies the following discussions. After some straightforward algebra, we find \[e\mathbf{T}^{m}= G^{mn}\mathbf{m}\times(\mathbf{V}_{s}\times\mathbf{m})+G^{mn}\mathbf{n}\times(\bm {V}_{s}\times\mathbf{m})\] \[+G^{mn}\mathbf{m}\times(\mathbf{V}_{s}\times\mathbf{n})+G^{mn}\mathbf{n}\times(\bm {V}_{s}\times\mathbf{n})\] \[+G^{m}\mathbf{m}\times\mathbf{V}_{s}, \tag{7a}\] \[e\mathbf{T}^{n}= G^{mn}\mathbf{n}\times(\mathbf{V}_{s}\times\mathbf{m})+G^{mn}\mathbf{m}\times(\bm {V}_{s}\times\mathbf{m})\] \[+G^{mn}\mathbf{n}\times(\mathbf{V}_{s}\times\mathbf{n})+G^{mn}\mathbf{m}\times(\bm {V}_{s}\times\mathbf{n})\] \[+G^{m}\mathbf{n}\times\mathbf{V}_{s}, \tag{7b}\] where all spin-transfer torques have been scaled into the inverse-time dimension so that \(\mathbf{T}^{m}\) and \(\mathbf{T}^{n}\) can be directly added to Eqs. (4). The spin-transfer torques exerting on the two sublattice-magnetic moments, \(\mathbf{m}_{A}\) and \(\mathbf{m}_{B}\), are \(\mathbf{T}^{A}=\mathbf{T}^{m}+\mathbf{T}^{n}\) and \(\mathbf{T}^{B}=\mathbf{T}^{m}-\mathbf{T}^{n}\). A simple manipulation of Eq. (7) shows that \[\mathbf{T}^{A}= \tau_{D}^{AA}\mathbf{m}^{A}\times(\mathbf{V}^{s}\times\mathbf{m}^{A})+\tau_{ CS}^{AB}\mathbf{m}^{A}\times(\mathbf{V}^{s}\times\mathbf{m}^{B})\] \[+\tau_{F}^{A}\mathbf{m}^{A}\times\mathbf{V}^{s}, \tag{8a}\] \[\mathbf{T}^{B}= \tau_{D}^{BB}\mathbf{m}^{B}\times(\mathbf{V}^{s}\times\mathbf{m}^{B})+\tau_{ CS}^{BA}\mathbf{m}^{B}\times(\mathbf{V}^{s}\times\mathbf{m}^{A})\] \[+\tau_{F}^{B}\mathbf{m}^{B}\times\mathbf{V}^{s}, \tag{8b}\] where \(\tau_{D}^{AA(BB)}\), \(\tau_{CS}^{AB(BA)}\) and \(\tau_{F}^{A(B)}\) represent the damping-like torques, the CS torques, and the field-like torques, respectively. To relate these torques to the matrix of interfacial spin conductance \(G^{\mu\nu}\) appearing in Eq. (3), we define \(G^{AA(BB)}=e\tau_{D}^{AA(BB)}/2\), \(G^{AB(BA)}=e\tau_{CS}^{AB(BA)}/2\), and \(G^{A(B)}=e\tau_{F}^{A(B)}\), which can be expressed in terms of \(G^{\mu\nu}\) as \[G^{AA} =\frac{1}{4}(G^{mn}+G^{mn}+G^{mn}), \tag{9a}\] \[G^{BB} =\frac{1}{4}(G^{mm}-G^{mn}-G^{mn}+G^{mn}),\] (9b) \[G^{AB} =\frac{1}{4}(G^{mm}+G^{mn}-G^{mn}-G^{mn}),\] (9c) \[G^{BA} =\frac{1}{4}(G^{mm}-G^{mn}+G^{mn}-G^{mn}), \tag{9d}\] and \(G^{A}=G^{B}=G^{m}\). By invoking the Onsager reciprocal relations, we obtain \[\frac{e}{h}\mathbf{I}_{s}=(\mathbf{m}_{A},\mathbf{m}_{B})\times\begin{pmatrix}G^{AA}&G^{AB} \\ G^{BA}&G^{BB}\end{pmatrix}\begin{pmatrix}\dot{\mathbf{m}}_{A}\\ \dot{\mathbf{m}}_{B}\end{pmatrix}-G^{A}\dot{\mathbf{m}}_{A}-G^{B}\dot{\mathbf{m}}_{B}, \tag{10}\] which incorporates Eq. (2) as a special case (when the CS terms \(G^{AB}=G^{BA}=0\)). Because combining Eqs. (9) and (10) can reproduce Eq. (3) under the definitions of \(\mathbf{n}=(\mathbf{m}_{A}-\mathbf{m}_{B})/2\) and \(\mathbf{m}=(\mathbf{m}_{A}+\mathbf{m}_{B})/2\), we have established consistent relations between spin pumping and spin-transfer torques in the presence of CS contributions, which hold in both the \((\mathbf{m},\mathbf{n})\) basis and the \((\mathbf{m}_{A},\mathbf{m}_{B})\) basis. Reversing the labeling of sublattices should not change the system [20], so \(\tau_{D}^{AA}=\tau_{D}^{BB}\) and \(\tau_{CS}^{AB}=\tau_{CS}^{BA}\), imposing a constraint that \(G^{mn}=G^{mn}=0\). This means that \(G^{\mu\nu}\) in Eq. (3) must be diagonal. Accordingly, \[\tau_{D}^{AA} =\tau_{D}^{BB}=\frac{1}{2e}(G^{mn}+G^{m}), \tag{11}\] \[\tau_{CS}^{AB} =\tau_{CS}^{BA}=\frac{1}{2e}(G^{mm}-G^{mn}), \tag{12}\] which indicates that the CS terms exist only when \(G^{mm}\neq G^{mn}\). Therefore, to resolve the puzzle of CS contributions, we just need to quantify and compare \(G^{mm}\) and \(G^{mn}\). ## III Microscopic calculation The microscopic mechanism underlying \(G^{mm}\) and \(G^{m}\) is the spin-dependent scattering of electrons off a fully compensated AFM/NM interface. Without losing generality, let us consider a simple cubic lattice as illustrated in Fig. 1. Following the wavefunction matching method detailed in Chapter 4 of Ref. [7], we shall determine the scattering matrix \(\mathbb{S}\) of the form \[\mathbb{S}=\begin{pmatrix}\mathbb{S}^{++}&\mathbb{S}^{+-}\\ \mathbb{S}^{-+}&\mathbb{S}^{--}\end{pmatrix}, \tag{13}\] where each block is a \(2\times 2\) matrix in the spin space and \(\pm\) accounts for the sublattice (pseudo-spin) degree of freedom. Figure 1: A fully compensated AFM/NM interface with cubic lattice, where \(-t\) (\(-t_{m}\)) is the hopping energy in the NM (AFM), and \(a_{0}\) is the lattice constant. On the interface plane, the magnetic unit cell is indicated by green dashed circles, which are periodic in both the \(\hat{x}\) ([1,1,0]) and \(y\) ([1,-1,0]) directions. Under the adiabatic condition (_i.e._, the dynamics of \(\mathbf{m}\) and \(\mathbf{n}\) is much slower than the electron relaxation), we have \[\mathrm{S}^{\pm\pm} =S_{0}^{\pm\pm}\sigma_{0}+S_{m}^{\pm\pm}\mathbf{m}\cdot\mathbf{\sigma}, \tag{14a}\] \[\mathrm{S}^{\pm\mp} =S_{n}\mathbf{n}\cdot\mathbf{\sigma}\pm S_{mn}(\mathbf{m}\times\mathbf{n})\cdot\bm {\sigma}, \tag{14b}\] where \(\mathbf{\sigma}=\{\sigma_{x},\sigma_{y},\sigma_{z}\}\) is the vectorial Pauli spin matrices and \(\sigma_{0}\) is the identity matrix. The specific expressions of \(S_{0}^{\pm\pm}\), \(S_{m}^{\pm\mp}\), \(S_{n}\) and \(S_{mn}\) in terms of the crystal momentum and other material parameters are listed in the Supplementary Material. If we turn to the collinear regime, \(|\mathbf{n}^{2}|\approx 1\) and \(|\mathbf{m}^{2}|\ll 1\), only \(S_{0}^{\pm\pm}\) and \(S_{n}\) in Eqs. (14) will remain essential, then the spin-flip scattering will be necessarily accompanied by the reversal of pseudo-spin [21]. When we go beyond the collinear regime, however, the locking between spin and pseudo-spin will be lifted. We also notice that previous studies assumed \(S_{m}^{\pm\mp}\approx S_{n}\) in the collinear regime without a rigorous justification [3; 7], so here in a general context we treat all components in Eq. (14) as independent quantities. The pumped spin current polarized in the \(j\) direction (\(j=x,y,z\)) can be calculated by [3; 7] \[I_{s,j}=-\frac{e}{2\pi}\text{Im}\left\{\text{Tr}\left[\mathrm{S}^{\dagger}( \sigma_{0}\otimes\sigma_{j})\mathrm{S}\right]\right\}, \tag{15}\] which, after some tedious algebra, ends up with \[\frac{e}{\hbar}\mathbf{I}_{s}=G_{0}^{m}\mathbf{n}\times\dot{\mathbf{n}}+G_{0}^{mm}\mathbf{m} \times\dot{\mathbf{m}}-G^{m}\dot{\mathbf{m}}+\Delta\mathbf{I}_{s}, \tag{16}\] where \(\Delta\mathbf{I}_{s}=\Delta G([\mathbf{n}\cdot(\mathbf{m}\times\dot{\mathbf{m}})]\mathbf{n}+\mathbf{m} \cdot(\mathbf{n}\times\dot{\mathbf{n}})]\mathbf{m}\) is a new term not claimed by any existing studies. Utilizing the vector identities, we can decompose \(\Delta\mathbf{I}_{s}\) into \[\Delta\mathbf{I}_{s}=\Delta G\left[(\mathbf{n}\times\dot{\mathbf{n}})|\mathbf{m}|^ {2}+(\mathbf{m}\times\dot{\mathbf{m}})|\mathbf{n}|^{2}\right.\] \[\left.+2(\mathbf{n}\times\mathbf{m})(\mathbf{m}\cdot\dot{\mathbf{n}})\right], \tag{17}\] so Eq. (16) can be finally written as \[\frac{e}{\hbar}\mathbf{I}_{s}= (G_{0}^{m}+|\mathbf{m}|^{2}\Delta G)\mathbf{n}\times\dot{\mathbf{n}}+(G_{0}^ {mm}+|\mathbf{n}|^{2}\Delta G)\mathbf{m}\times\dot{\mathbf{m}}\] \[\qquad-G^{m}\dot{\mathbf{m}}+2\Delta G(\mathbf{n}\times\mathbf{m})(\mathbf{m} \cdot\dot{\mathbf{n}}), \tag{18}\] where we mention again that \(G^{mn}\) and \(G^{mm}\) are not present (they vanish identically as required by symmetry). The generalized spin pumping formula Eq. (18) contains four different components of the interfacial spin conductance that are determined by the scattering matrix as \[G_{0}^{mn} =\frac{e^{2}\mathcal{A}}{h\pi^{2}}\int|S_{n}|^{2}\mathrm{d}^{2} \mathbf{k}, \tag{19a}\] \[G_{0}^{mm} =\frac{e^{2}\mathcal{A}}{2h\pi^{2}}\int\left(|S_{m}^{++}|^{2}+|S_ {m}^{--}|^{2}\right)\mathrm{d}^{2}\mathbf{k},\] (19b) \[G^{m} =\frac{e^{2}\mathcal{A}}{2h\pi^{2}}\int\text{Im}\left[(S_{0}^{++} )^{*}S_{m}^{++}+(S_{0}^{--})^{*}S_{m}^{--}\right]\mathrm{d}^{2}\mathbf{k},\] (19c) \[\Delta G =\frac{e^{2}\mathcal{A}}{h\pi^{2}}\int|S_{mn}|^{2}\mathrm{d}^{2} \mathbf{k}, \tag{19d}\] where \(\mathrm{d}^{2}\mathbf{k}=dk_{x}dk_{y}\) and \(\mathcal{A}\) is the area of the interface. Except the last term in Eq. (18), we can read off the effective spin conductance \(G^{m}\) and \(G^{mm}\) as \[G^{m} =G_{0}^{m}+|\mathbf{m}|^{2}\Delta G, \tag{20a}\] \[G^{mm} =G_{0}^{mm}+|\mathbf{n}|^{2}\Delta G, \tag{20b}\] and according to Eqs. (9) we obtain the damping-like torques and the CS torques as \[\tau_{D}^{AA} =\tau_{D}^{BB}=\frac{1}{2e}(G_{0}^{mm}+G_{0}^{mn}+\Delta G), \tag{21a}\] \[\tau_{CS}^{AB} =\tau_{CS}^{BA}=\frac{1}{2e}\left[G_{0}^{mm}-G_{0}^{m}+(|\mathbf{n}|^{2 }-|\mathbf{m}|^{2})\Delta G\right], \tag{21b}\] where \(|\mathbf{n}|^{2}+|\mathbf{m}|^{2}=1\) is used. The above results are valid even in the noncollinear regime. Finally, we point out that the last term in Eq. (18), per the Onsager relations, gives rise to an additional CS torque \[\Delta\mathbf{T}^{A}=\Delta\mathbf{T}^{B}=\frac{\Delta G}{e}[\mathbf{V}^{s}\cdot(\mathbf{m}_{1} \times\mathbf{m}_{2})](\mathbf{m}_{2}\times\mathbf{m}_{1}), \tag{22}\] which is nonlinear in \(\mathbf{m}_{1}\times\mathbf{m}_{2}\) thus not being captured by the phenomenological consideration in the previous section. In the collinear regime, this term is a negligible higher-order correction. ## IV Numerical results Basing on Eq. (19), we numerically plot the four components of spin conductance in Fig. 2 as functions of the exchange coupling \(J\) (between the conduction electrons and the magnetic moments) and the ratio of kinetic energies in the AFM and NM (_i.e._, hopping integrals \(t_{m}\) and \(t\)). Here, the spin conductance is expressed in units of \(e^{2}/h\) per \(a_{0}^{2}\) (area of a magnetic unit cell on the interface), which should be multiplied by the number of magnetic unit cells \(\mathcal{N}\) on the interface to retrieve the total spin conductance. Comparing Fig. 2(a) and (b), we find that \(G_{0}^{m}\) and \(G_{0}^{mn}\) share a very similar pattern as they both culminate around \(J/t=1\) and \(t_{m}/t=0.5\). They are the primary contributions to the damping-like torques [see Eq. (21a)]. Figure 2(c) for \(G^{m}\), on the other hand, shows how the strength of field-like torques varies over \(J\) and \(t_{m}\). It is clear that the damping-like (field-like) torques are dominant in the strong (weak) exchange coupling regime, which is corroborated by a recent experiment [22]. In the collinear limit that \(|\mathbf{n}|^{2}\to 1\) and \(|\mathbf{m}|^{2}\to 0\), the CS torques, according to Eq. (21b), reduce to \[\tau_{CS}^{AB(BA)}=\frac{1}{2e}(G_{0}^{mm}+\Delta G-G_{0}^{m}). \tag{23}\] Using the numerical results shown in Fig. 2, we find that \[G_{0}^{m}=G_{0}^{mm}+\Delta G, \tag{24}\] which yields all CS torques exactly zero. As a matter of fact, concerning the integrands in Eqs. (19) that are functions of the crystal momentum, one can rigorously prove that Eq. (24) is an exact identify (see details in the Supplementary Material). It is interesting to note that even in the highly non-collinear regime where \(|\mathbf{m}^{2}|\) is comparable to \(|\mathbf{n}|^{2}\), the CS torques [proportional to \(G_{0}^{mn}-G_{0}^{mn}+(|\mathbf{n}|^{2}-|\mathbf{m}|^{2})\Delta G\)] is at most a few percents of the damping-like torques since \(\Delta G\) is much smaller than \(G_{0}^{mn}\) and \(G_{0}^{mn}\), as shown in Fig. 2(d). ###### Acknowledgements. The authors acknowledge helpful discussions with Hantao Zhang. This work is support by the Air Force Office of Scientific Research (Grant No. FA9550-19-1-0307). ## Supplementary Material See the supplementary materials for more mathematical details about the interfacial spin conductance. ## Data Availability Statement The data that support the findings of this study are available from the corresponding author upon reasonable request.

2302.00489

Noncommutative Fibrations via Positive Maps and Bimodules

We construct a Leray-Serre spectral sequence for fibrations for de Rham cohomology on noncommutative algebras. The fibrations are bimodules with zero-curvature extendable bimodule connections satisfying an additional condition. By the KSGNS construction, completely positive maps between C*-algebras correspond to Hilbert C*-bimodules. We give examples of fibrations on group algebras and matrix algebras.

Edwin J. Beggs, James E. Blake

2023-02-01T14:53:56Z

http://arxiv.org/abs/2302.00489v1

# Noncommutative Fibrations via Positive Maps and Bimodules ###### Abstract We construct a Leray-Serre spectral sequence for fibrations for de Rham cohomology on noncommutative algebras. The fibrations are bimodules with zero-curvature extendable bimodule connections satisfying an additional condition. By the KSGNS construction, completely positive maps between C*-algebras correspond to Hilbert C*-bimodules. We give examples of fibrations on group algebras and matrix algebras. ## 1 Introduction In classical topology (see [18]), a locally trivial fibration is a map \(\pi:E\to B\) where \(E\) is called the total space and \(B\) the base space. The fibre \(F\) of the fibration is identified with each \(\pi^{-1}\{b\}\) in a continuous manner. A fibration \(\pi\) is called locally trivial if \(B\) has a cover by open sets such that \(\pi^{-1}U\cong F\times U\) where \(\pi\) is projection to the second coordinate and \(\cong\) means homeomorphism. The homeomorphisms \(\pi^{-1}U\cong F\times U\) and \(\pi^{-1}V\cong F\times V\) in the cover are patched together on the intersection \(U\cap W\) by transition functions \(\pi^{-1}U\supset F\times(U\cap W)\xrightarrow{\phi_{UV}}F\times(U\cap W) \subset\pi^{-1}W\) which are homeomorphisms and obey \(\pi\circ\phi_{UV}=\pi\). Given a fibration, there is a spectral sequence called the Leray-Serre spectral sequence with second page entry \((p,q)\) given by \(H^{p}(B,H^{q}(F))\) which converges to \(H^{p+q}(E)\). We give more background on spectral sequences and their convergence later. For a noncommutative version of fibrations where spaces are replaced by algebras with differential calculi, take \(B\) to be an algebra of functions on a hypothetical base space of a fibration, and \(A\) as the algebra corresponding to the total space. Since switching from spaces to algebras reverses the direction of functions, a noncommutative fibration now goes from \(B\) to \(A\). In [2] a definition of such a noncommutative fibration is given, and its Serre spectral sequence is defined. Differential fibrations were later extended using sheaves in [5] as a class of differential graded algebra maps \(B\to A\), and a generalisation of the Leray-Serre spectral sequence was constructed, which converges to the cohomology of \(A\) with coefficients in the bimodule. In the following, we regard certain \(B\)-\(A\) bimodules equipped with a zero-curvature bimodule connection as morphisms and show they behave like differential fibrations, and construct from these a Leray-Serre spectral sequence converging to the cohomology of \(A\) with coefficients in a bimodule. The KSGNS construction gives a correspondence between bimodules with an inner product and completely positive maps, and from this correspondence each bimodule differential fibration (when equipped with the additional data of an inner product and a choice of an element of the bimodule) gives rise to a completely positive map, which may or may not be an algebra map. Under certain additional conditions discussed later (the existence of a connection on the bimodule with a certain property), this positive map can be shown to be differentiable. The existence of algebra maps between two given algebras is by no means guaranteed, so a definition of a differential fibration in terms of the more plentiful bimodules (or completely positive maps) allows for a wider range of examples. In order to get a full theory of fibrations and cofibrations corresponding to the topological theory, it is very possible that we will have to use the more general picture of completely positive maps rather than just algebra maps. Our first example of a bimodule differential fibration is between group algebras \(\mathbb{C}G\to\mathbb{C}X\) for a subgroup \(G\subset X\). This happens to give a differentiable algebra map, and so could also have been calculated using existing theory. Our second example is a bimodule differential fibration between matrix algebras \(M_{2}(\mathbb{C})\to M_{3}(\mathbb{C})\). The bimodule from this example gives a differentiable map which is completely positive but not an algebra map. ## 2 Background ### Spectral Sequences A spectral sequence \((E_{r},d_{r})\) is a series of two-dimensional lattices \(E_{r}\) called pages with page \(r\) having entry \(E_{r}^{p,q}\) in position \((p,q)\in\mathbb{Z}^{2}\) and differentials \(\mathrm{d}_{r}:E_{r}^{p,q}\to E_{r}^{p+r,q+1-r}\) satisfying \(\mathrm{d}_{r}^{2}=0\). Conventionally the \(p\)-axis is drawn horizontally and the \(q\)-axis is drawn vertically. In the case we consider, only the top-right quadrant \((p,q\geq 0)\) of page \(0\) is allowed to have nonzero entries. The differentials \(\mathrm{d}_{r}\) on the \(r\)th page go to the right by \(r\) entries and down by \(r-1\). Seeing as the differentials square to zero, it is possible to take their cohomology. The \((r+1)\)th page is defined as the cohomology of the \(r\)th page. Figure 1 is an image [17] illustrating what a spectral sequence looks like on pages \(r=0,1,2,3\). A spectral sequence is said to converge if there is some fixed page after which all subsequent pages are the same. After taking cohomology no longer cha Figure 1: Illustration of successive pages of a spectral sequence [17] we say that the sequence has stabilised, and denote position \((p,q)\) on the stable pages as \(E_{\infty}^{p,q}\). The spectral sequence used in this paper is a variant of the Leray-Serre spectral sequence, which arises from a filtration. **Definition 2.1**.: _For a cochain complex \(C^{n}\) of vector spaces with linear differential \(\mathrm{d}:C^{n}\to C^{n+1}\) satisfying \(\mathrm{d}^{2}=0\), we say that the sequence of subspaces \(F^{m}C\subset C\) for \(m\geq 0\) are a decreasing filtration of \(C\) if the following three conditions are satisfied._ 1. \(\mathrm{d}F^{m}C\subset F^{m}C\) _for all_ \(m\geq 0\)_._ 2. \(F^{m+1}C\subset F^{m}C\) _for all_ \(m\geq 0\)_._ 3. \(F^{0}C=C\) _and_ \(F^{m}C^{n}:=F^{m}C\cap C^{n}=\{0\}\) _for all_ \(m>n\)_._ Given such a filtration, [11] says that the spectral sequence with first page \(E_{1}^{p,q}=H^{p+q}(\frac{F^{p}C}{F^{p+1}C})\) converges to \(H^{*}(C,\mathrm{d})\) in the sense that \(H^{k}(C,\mathrm{d})=\bigoplus\limits_{p+q=k}E_{\infty}^{p,q}\). This can be read off the stabilised sequence as the direct sum along the north-west to south-east diagonals. ### Bimodules and Connections The idea of a bimodule connection was introduced in [7], [8] and [16] and used in [9], [12]. It was used to construct connections on tensor products in [6]. **Definition 2.2**.: _A calculus on an (associative) algebra \(A\) is an \(A\)-bimodule \(\Omega^{1}_{A}\) satisfying \(\Omega^{1}_{A}=\text{span}\{a^{\prime}\mathrm{d}a\mid a,a^{\prime}\in A\}\) for some linear map \(\mathrm{d}:A\to\Omega^{1}_{A}\) with \(\mathrm{d}(ab)=a\mathrm{d}b+\mathrm{d}a.b\)._ We call the calculus connected if \(\ker\mathrm{d}=\mathbb{K}.1\), where \(\mathbb{K}\) is the field of scalars of \(A\) (in all our examples \(\mathbb{K}=\mathbb{C}\)). There is a linear map \(\wedge:\Omega^{p}\otimes\Omega^{q}\to\Omega^{p+q}\), and every element of the higher calculi \(\Omega^{n}\) is a wedge product of elements of \(\Omega^{1}\). The map \(\mathrm{d}\), called an exterior derivative, can be extended to \(\mathrm{d}:\Omega^{n}\to\Omega^{n+1}\) by \(\mathrm{d}(\xi\wedge\eta)=\mathrm{d}\xi\wedge\eta+(-1)^{|\xi|}\xi\wedge\eta\) and satisfies \(\mathrm{d}^{2}=0\). **Definition 2.3**.: _Suppose \(B\) and \(A\) are algebras with calculi \(\Omega^{1}_{B}\) and \(\Omega^{1}_{A}\) respectively. A right bimodule connection \((\nabla_{E},\sigma_{E})\) on a \(B\)-\(A\) bimodule \(E\) consists of two components. Firstly, a linear map \(\nabla_{E}:E\to E\otimes_{A}\Omega^{1}_{A}\) called a right connection, satisfying \(\nabla_{E}(e.b)=\nabla_{E}(e).b+e\otimes\mathrm{d}b\) for \(e\in E\), \(b\in B\). Secondly, a linear bimodule map \(\sigma_{E}:\Omega^{1}_{B}\otimes_{B}E\to E\otimes_{A}\Omega^{1}_{A}\) called a generalised braiding, satisfying \(\nabla_{E}(be)=\sigma_{E}(\mathrm{d}b\otimes e)+b\nabla_{E}(e)\) for \(e\in E\), \(b\in B\)._ A right connection \(\nabla_{E}\) is called flat if its curvature \(R_{E}=(\mathrm{id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{id})\nabla_{E}:E \to E\otimes_{A}\Omega^{2}_{A}\) is zero. The curvature \(R_{E}\) is always a right module map. The bimodule map \(\sigma_{E}\) is said to be extendable [3] to higher calculi if it extends to a map \(\sigma_{E}:\Omega^{n}_{B}\otimes_{B}E\to E\otimes_{A}\Omega^{n}_{A}\) by the formula \(\sigma_{E}(\xi\wedge\eta\otimes e)=(\sigma_{E}\wedge\mathrm{id})(\xi\otimes \sigma_{E}(\eta\otimes e))\). Extendability can also be written as \((\mathrm{id}\otimes\wedge)(\sigma_{E}\otimes\mathrm{id})(\mathrm{id}\otimes \sigma_{E})=\sigma_{E}(\wedge\otimes\mathrm{id})\). **Definition 2.4**.: _[_3_]_ _Every first order calculus \(\Omega^{1}\) on \(A\) has a'maximal prolongation' \(\Omega_{max}\) to an exterior algebra, where for every relation \(\sum\limits_{i}a_{i}.\mathrm{d}b_{i}=\sum\limits_{j}\mathrm{d}r_{j}.s_{j}\) in \(\Omega^{1}\) for \(a_{i},b_{i},r_{j},s_{j}\in A\) we impose the relation \(\sum\limits_{i}\mathrm{d}a_{i}\wedge\mathrm{d}b_{i}=\sum\limits_{j}\mathrm{d }r_{j}\wedge\mathrm{d}s_{j}\) in \(\Omega_{\max}^{2}\). This is extended to higher forms, but no new relations are added._ **Proposition 2.5**.: _[_3_]_ _If \(A\) and \(B\) are equipped with maximal prolongation calculi for their higher calculi and if the curvature \(R_{E}\) is also a left module map, then extendability of \(\sigma_{E}\) is automatic._ There are a few results which are proven in [3] for left connections but which we need to prove now for right connections, and the following is one such result. **Lemma 2.6**.: _Let \(E\) be a \(B\)-\(A\) bimodule with extendable right bimodule connection \((\nabla_{E},\sigma_{E})\). The connection \(\nabla_{E}\) extends to higher calculi as_ \[\nabla_{E}^{[n]}=\mathrm{id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{id}:E \otimes_{A}\Omega_{A}^{n}\to E\otimes_{A}\Omega_{A}^{n+1} \tag{1}\] **Proof.**_To show this is well-defined over the tensor-product \(\otimes_{A}\), we check that \(\nabla_{E}^{[n]}(ea\otimes\eta)=\nabla_{E}^{[n]}(e\otimes a\eta)\). We then have the following two equations._ \[(\mathrm{id}\otimes\mathrm{d})(ea\otimes\eta)+(\nabla_{E}\wedge \mathrm{id})(ea\otimes\eta)=ea\otimes\mathrm{d}\eta+\nabla_{E}(e)a\wedge\eta+ e\otimes\mathrm{d}a\wedge\eta,\] \[(\mathrm{id}\otimes\mathrm{d})(e\otimes a\eta)+(\nabla_{E}\wedge \mathrm{id})(e\otimes a\eta)=e\otimes\mathrm{d}a\wedge\eta+e\otimes a\wedge \mathrm{d}\eta+\nabla_{E}(e)\wedge a\eta\] _As \(ea\otimes\mathrm{d}\eta=e\otimes a\wedge\mathrm{d}\eta\) and \(\nabla_{E}(e)\wedge a\eta=\nabla_{E}(e)a\wedge\eta\), we see that \(\nabla_{E}^{[n]}(ea\otimes\eta)=\nabla_{E}^{[n]}(e\otimes a\eta)\), giving the required result. _ **Lemma 2.7**.: _Let \(E\) be a \(B\)-\(A\) bimodule with extendable right bimodule connection \((\nabla_{E},\sigma_{E})\). Then \(\nabla_{E}^{[n+1]}\circ\nabla_{E}^{[n]}=R_{E}\wedge\mathrm{id}:E\otimes_{A} \Omega_{A}^{n}\to E\otimes_{A}\Omega_{A}^{n+2}\), where \(R_{E}=(\mathrm{id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{id})\nabla_{E}:E \to E\otimes_{A}\Omega_{A}^{2}\) is the curvature of \(\nabla_{E}\)._ **Proof.**_Writing out \(\nabla_{E}^{[n+1]}\circ\nabla_{E}^{[n]}\) in string diagrams and then expanding \(\mathrm{d}\wedge\) and using associativity of \(\wedge\) gives Figure 2, which gives the desired result. _ The following lemma is a mirrored version of the one on page 304 of [3]. **Lemma 2.8**.: _Let \(E\) be a \(B\)-\(A\) bimodule with extendable right bimodule connection \((\nabla_{E},\sigma_{E})\) whose curvature \(R_{E}\) is a left module map. Then_ \[\nabla_{E}^{[n]}\circ\sigma_{E}=\sigma_{E}(\mathrm{d}\otimes\mathrm{id})+(-1 )^{n}(\sigma_{E}\wedge\mathrm{id})(\mathrm{id}\otimes\nabla_{E}):\Omega_{B}^{ n}\otimes_{B}E\to E\otimes_{A}\Omega_{A}^{n+1}. \tag{2}\] **Proof**.: _Recall that the curvature \(R_{E}=\nabla_{E}^{[1]}\circ\nabla_{E}=(\mathrm{id}\otimes\mathrm{d}+\nabla_{E} \wedge\mathrm{id})\nabla_{E}\) is always a right module map._ _(1) First we show the \(n=1\) case. For \(b\in B\), \(e\in E\), if we write \(\nabla_{E}(e)=f\otimes\xi\), then:_ \[R_{E}(be)=(\mathrm{id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{ id})\nabla_{E}(be)=(\mathrm{id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{id})( bf\otimes\xi+\sigma_{E}(\mathrm{d}b\otimes e))\] \[=\nabla_{E}(bf)\wedge\xi+bf\otimes\mathrm{d}\xi+\nabla^{[1]} \sigma_{E}(\mathrm{d}b\otimes e)\] \[=b.\nabla_{E}(f)\wedge\xi+\sigma_{E}(\mathrm{d}b\otimes f)\wedge \xi+bf\otimes\mathrm{d}\xi+\nabla^{[1]}\sigma_{E}(\mathrm{d}b\otimes e)\] \[=b.R_{E}(e)+\sigma_{E}(\mathrm{d}b\otimes f)\wedge\xi+\nabla^{[ 1]}\sigma_{E}(\mathrm{d}b\otimes e)\] _However, the fact that \(R_{E}\) is a left module map means this reduces to:_ \[0=\sigma_{E}(\mathrm{d}b\otimes f)\wedge\xi+\nabla^{[1]}\sigma_{E}(\mathrm{d} b\otimes e)\] _We use this to calculate for a general 1-form \(\eta=c\mathrm{d}b\) (summation omitted):_ \[\sigma_{E}(c\mathrm{d}b\otimes f)\wedge\xi+\nabla^{[1]}\sigma_{E }(c\mathrm{d}b\otimes e)\wedge\xi=c\sigma_{E}(\mathrm{d}b\otimes f)+\nabla^{[ 1]}(c\sigma_{E}(\mathrm{d}b\otimes e))\] \[=c\big{(}\sigma_{E}(\mathrm{d}b\otimes f)\wedge\xi+\nabla^{[1]} _{E}\sigma_{E}(\mathrm{d}b\otimes e)\big{)}+(\sigma_{E}\wedge\mathrm{id})( \mathrm{d}c\otimes\sigma_{E}(\mathrm{d}b\otimes e))\] \[=0+(\sigma_{E}\wedge\mathrm{id})(\mathrm{d}c\otimes\sigma_{E}( \mathrm{d}b\otimes e))=\sigma_{E}(\mathrm{d}c\wedge\mathrm{d}b\otimes e)= \sigma_{E}(\mathrm{d}(c\mathrm{d}b)\otimes e)\] _where we have used that \(0=\sigma_{E}(\mathrm{d}b\otimes f)+\nabla^{[1]}\sigma_{E}(\mathrm{d}b\otimes e)\) and then the extendability of \(\sigma_{E}\). Re-arranging this, we get:_ \[\nabla^{[1]}\sigma_{E}(\eta\otimes e) =\sigma_{E}(\mathrm{d}\eta\otimes e)-\sigma_{E}(\eta\otimes f)\wedge\xi\] \[=\sigma_{E}(\mathrm{d}\otimes\mathrm{id})(\eta\otimes e)+(-1)^{ 1}(\sigma_{E}\wedge\mathrm{id})(\mathrm{id}\otimes\nabla_{E})(\eta\otimes e)\] _This shows the \(\nabla^{[1]}_{E}\sigma_{E}\) case._ _(2) Next we suppose the formula holds for \(\nabla^{[n]}_{E}\sigma\) and use induction to show it for \(n+1\). Suppose \(\eta,\xi\in\Omega^{1}_{B}\) and \(e\in E\). Expressing \(\nabla^{[n+1]}\sigma_{E}(\eta\wedge\xi\otimes e)\) in string diagrams in Figure 3, we use extendability of \(\sigma_{E}\), then the formula for \(\nabla^{[n+1]}_{E}\), then the Leibniz rule on \(\wedge\), then recognise the formula for \(\nabla^{[n]}_{E}\), then use the induction assumption, then use associativity of \(\wedge\), then recognise the formula for \(\nabla^{[n]}_{E}\), then use the induction assumption again, then finally we re-arrange using the Leibniz rule for \(\wedge\) and associativity of \(\wedge\) and extendability of \(\sigma\). Hence \(\nabla^{[n+1]}_{E}\circ\sigma_{E}=\sigma_{E}(\mathrm{d}\otimes\mathrm{id})+( -1)^{n}(\sigma_{E}\wedge\mathrm{id})(\mathrm{id}\otimes\nabla_{E})\). _ In particular, if \(R_{E}=0\) then the composition \(\nabla^{[n+1]}_{E}\circ\nabla^{[n]}_{E}=R_{E}\wedge\mathrm{id}\) vanishes, making the flat connection \(\nabla_{E}\) a cochain differential. We use this later to give a filtration. ### Positive Maps and the KSGNS Construction Recall that a positive element of a C*-algebra \(A\) is one of the form \(a^{*}a\) for some \(a\in A\). A linear map \(\phi:B\to A\) between C*-algebras is called positive if it sends positive elements to positive elements. It is called completely positive if all maps \(M_{n}(B)\to M_{n}(A)\) for all \(n\geq 2\) given by applying \(\phi\) to each entry, e.g. \(\left(\begin{smallmatrix}b_{1}&b_{2}\\ b_{3}&b_{4}\end{smallmatrix}\right)\rightarrow\left(\begin{smallmatrix}\phi(b_{1} )&\phi(b_{2})\\ \phi(b_{3})&\phi(b_{4})\end{smallmatrix}\right)\), are also positive. Every *-algebra map is completely positive, and so are all positive linear functions \(B\rightarrow\mathbb{C}\). The KSGNS theorem (see [11] for reference) gives a correspondence between bimodules and completely positive maps. Let \(A\) and \(B\) be C*-algebras, and \(E\) a Hilbert bimodule with inner product \(\langle,\rangle:\overline{E}\otimes_{B}E\to A\). We write here \(\overline{E}\) for the conjugate module of \(E\) as defined as in [4], which has elements \(\overline{e}\in\overline{E}\) for each \(e\in E\) and satisfies \(\lambda\overline{e}=\overline{\lambda^{*}e}\) for scalars \(\lambda\in\mathbb{C}\), and has \(A\)-\(B\) bimodule structure given by \(a\overline{e}=\overline{ea^{*}}\) and \(\overline{e}b=\overline{b^{*}e}\) for \(a\in A\), \(b\in B\), \(e\in E\). A right connection \(\nabla_{E}\) is said to preserve an inner product \(\langle,\rangle:\overline{E}\otimes_{B}E\to A\) on \(E\) if \(\mathrm{d}\langle\overline{e_{1}},e_{2}\rangle=\langle\overline{e_{1}},\nabla _{E}(e_{2})_{(1)}\rangle\nabla_{E}(e_{2})_{(2)}+\nabla_{E}(e_{1})_{(2)}^{*} \langle\overline{\nabla_{E}(e_{1})_{(1)}},e_{2}\rangle\) for all \(e_{1},e_{2}\in E\), using a form of Sweedler notation \(\nabla_{E}(e)=\sum\nabla_{E}(e)_{(1)}\otimes\nabla_{E}(e)_{(2)}\) for tensor products. Given a right connection \(\nabla_{E}\) on \(E\), there is a left connection \(\nabla_{\overline{E}}\) on \(\overline{E}\) given by \(\nabla_{\overline{E}}(\overline{e})=\nabla_{E}(e)_{(2)}^{*}\otimes\overline{ \nabla_{E}(e)_{(1)}}\). We use this notation to write the metric preservation in string diagrams in Figure 4. By one side of the KSGNS theorem, every map \(\phi:B\to A\) of the form \(\phi(b)=\langle\overline{e},be\rangle\) for some \(e\in E\) is completely positive. By the other side of the KSGNS theorem, for a completely positive map \(\phi:B\to A\) between unital C*-algebras, there is a Hilbert \(B\)- bimodule \(E\) and an \(e_{0}\in E\) such that \(\phi(b)=\langle\overline{e_{0}},be_{0}\rangle\). The KSGNS construction gives a process to construct this bimodule, whereby we take the \(B\)-\(A\) bimodule \(B\otimes A\) with actions given by multiplication, equipped with inner product \(\langle,\rangle:\overline{B\otimes A}\otimes_{B}B\otimes A\to A\) given by \(\langle\overline{b\otimes a},b^{\prime}\otimes a^{\prime}\rangle=a^{*}\phi(b^ {*}b^{\prime})a^{\prime}\), then quotient by all zero-length elements with respect to this inner product, then take a completion. **Proposition 2.9**.: _[_3_]_ _Suppose that \(A\) is a unital dense *-subalgebra of a C*-algebra, \((E,\nabla_{E},\sigma_{E})\) a right \(B\)-\(A\) bimodule connection which is extendable with curvature \(R_{E}\) a bimodule map and \(\langle,\rangle:\overline{E}\otimes_{B}E\to A\) a semi-inner product \(A\)-module structure preserved by \(\nabla_{E}\). If \(e\in E\) obeys \(\nabla_{E}(e)=0\) then \(\phi:\Omega_{B}\to\Omega_{A}\), \(\phi(\xi)=(\langle,\rangle\otimes\mathrm{id})(\overline{E}\otimes\sigma_{E}( \xi\otimes e))\) is a cochain map, i.e. \(\mathrm{d}\circ\phi=\phi\circ\mathrm{d}\)._ ## 3 Theory: Fibrations (Right-handed Version) In [5] there is a form of differential fibration defined as follows. If we have an algebra map \(\pi:B\to A\) which extends to a map of differential graded algebras, then differential forms of degree \(p\) in the base and \(q\) in the fibre can be defined as a quotient \(\frac{\pi^{*}\Omega_{B}^{p}\cap\Omega_{A}^{q}}{\pi^{*}\Omega_{B}^{p+1}\cap \Omega_{A}^{q+1}}\). In this paper we take a similar approach, but representing such forms by a quotient that doesn't require an algebra map. This comes at the cost of now needing a bimodule with a bimodule connection, but since Hilbert C*-bimodules with inner products correspond via the KSGNS construction to completely positive maps, and every *-algebra map is also a completely positive map, this constitutes a generalisation. We start by defining the filtration. **Proposition 3.1**.: _Let \(E\) be a \(B\)-\(A\) bimodule with extendable zero-curvature right bimodule connection \((\nabla_{E},\sigma_{E})\). For \(m\leq n\), the cochain complex \(C^{n}=E\otimes_{A}\Omega_{A}^{n}\) with differential \(\mathrm{d}_{C}:=\nabla_{E}^{[n]}:C^{n}\to C^{n+1}\) gives the following filtration._ \[F^{m}C^{n}=\text{im}(\sigma_{E}\wedge\mathrm{id}):\Omega_{B}^{m}\otimes_{B}E \otimes_{A}\Omega_{A}^{n-m}\to E\otimes_{A}\Omega_{A}^{n} \tag{3}\] **Proof.**_(1) The first property we need for a filtration is \(\mathrm{d}_{C}F^{m}C\subset F^{m}C\) for all \(m\geq 0\). This means showing \(\nabla_{E}^{[n]}F^{m}(E\otimes_{A}\Omega_{A}^{n})\subset\bigoplus\limits_{n^{ \prime}\geq 0}F^{m}(E\otimes_{A}\Omega_{A}^{n^{\prime}})\)._ _In the calculations in Figure 5 we start with \(\nabla_{E}^{[n]}(\sigma_{E}\wedge\mathrm{id})\), then use the fact that \(\nabla_{E}^{[n]}=\mathrm{id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{id}\), then use associativity of \(\wedge\) and expand \(\mathrm{d}\wedge\), then recognise the formula for \(\nabla_{E}^{[m]}\), then use the formula \(\nabla_{E}^{[m]}\circ\sigma_{E}=\sigma_{E}(\mathrm{d}\otimes\mathrm{id})+(-1) ^{m}(\sigma_{E}\wedge\mathrm{id})(\mathrm{id}\otimes\nabla_{E})\) we showed earlier, then use associativity of \(\wedge\), then recognise the formula for \(\nabla_{E}^{[n-m]}\). This is in \(F^{m+1}C^{n+1}+F^{m}C^{n+1}\). However, as we will show in the next step, the filtration is decreasing, so as required, it is contained in \(F^{m}C\)._ Figure 4: Illustration of the metric preservation equation **(2)** The second property we need for a filtration is \(F^{m+1}C\subset F^{m}C\) for all \(m\geq 0\). In a differential calculus (as opposed to a more general differential graded algebra), elements of the higher calculi can all be decomposed into wedge products of elements of \(\Omega^{1}\), and so \(\Omega^{m+1}_{B}=\Omega^{m}_{B}\wedge\Omega^{1}_{B}\). Let \(\xi\in\Omega^{m}_{B}\), \(\eta\in\Omega^{1}_{B}\), \(e\in E\), \(\kappa\in\Omega^{n-m-1}_{A}\). Then \(\xi\wedge\eta\otimes e\otimes\kappa\in\Omega^{m+1}_{B}\otimes_{B}E\otimes \Omega^{n-m-1}_{A}\), so the map \(\sigma_{E}\wedge id\) takes it to \(E\otimes_{A}\Omega^{n}_{A}\), and the image of all such things is \(F^{m+1}C^{n}\). We have the string diagram Figure 6 for \((\mathrm{id}\otimes\wedge)(\sigma\otimes\mathrm{id})(\wedge\otimes\mathrm{id} \otimes\mathrm{id})(\xi\otimes\eta\otimes e\otimes\kappa)\), where we use that \(\sigma_{E}\) is extendable and that \(\wedge\) is associative. This shows that \(F^{m+1}C^{n}\) lies in \(\text{im}(\sigma_{E}\wedge\mathrm{id}):\Omega^{m}_{B}\otimes_{B}E\otimes_{A} \Omega^{n-m}_{A}\to E\otimes_{A}\Omega^{n}_{A}\), i.e. in \(F^{m}C^{n}\), and hence that the filtration is decreasing in \(m\). **(3)** The third property we need is \(F^{0}C=C\). \[F^{0}C^{n}=\text{im}(\sigma_{E}\wedge\mathrm{id}):B\otimes_{B}E\otimes_{A} \Omega^{n}_{A}\to E\otimes_{A}\Omega^{n}_{A}\] Recalling that \(\sigma_{E}(1\otimes e)=e\otimes 1\) when \(m=0\), the set \(F^{0}C^{n}\) consists of elements \(b.e\otimes\xi\), which gives all of \(C^{n}\). **(4)** The final property we need is \(F^{m}C^{n}:=F^{m}C\cap C^{n}=\{0\}\) for all \(m>n\). This holds because for \(m>n\), we have \(\Omega^{n-m}=0\), giving \(F^{m}C^{n}=im(\sigma_{E}\wedge\mathrm{id}):0\to C^{n}\), which has zero intersection with \(C^{n}\). Figure 6: Proof the filtration is decreasing **Definition 3.2**.: _Using the above filtration, we define differential forms with coefficients in \(E\) of degree \(p\) in the fibre and \(q\) in the base as the following quotient._ \[M_{p,q}:=\frac{F^{p}C^{p+q}}{F^{p+1}C^{p+q}}=\frac{\sigma_{E}(\Omega_{B}^{p} \otimes_{B}E)\wedge\Omega_{A}^{q}}{\sigma_{E}(\Omega_{B}^{p+1}\otimes_{B}E) \wedge\Omega_{A}^{q-1}} \tag{4}\] _From these we denote forms with coefficients in \(E\) of degree \(q\) in the fibre only as follows._ \[N_{q}:=M_{0,q}=\frac{C^{q}}{F^{1}C^{q}}=\frac{E\otimes_{A}\Omega_{A}^{q}}{ \sigma_{E}(\Omega_{B}^{1}\otimes_{B}E)\wedge\Omega_{A}^{q-1}} \tag{5}\] **Proposition 3.3**.: _Let \(E\) be a \(B\)-\(A\) bimodule with extendable zero-curvature right bimodule connection \((\nabla_{E},\sigma_{E})\), with \(M_{p,q}\) and \(N_{q}\) as above. Then there is a well-defined surjective linear map_ \[g:\Omega_{B}^{p}\otimes_{B}N_{q}\to M_{p,q},\qquad\qquad g(\xi\otimes[e \otimes\eta])=[(\sigma_{E}\wedge\mathrm{id})(\xi\otimes e\otimes\eta)]. \tag{6}\] **Proof**.: _Surjectivity follows from the definition of the map, so we only need to show that \(g\) is well-defined on equivalence classes, i.e. that if \([e\otimes\eta]=0\) then we also have \([(\sigma_{E}\wedge\mathrm{id})(\xi\otimes e\otimes\eta)]=0\). By definition, we have \([e\otimes\eta]=0\in N_{q}\) if and only if \(e\otimes\eta=(\sigma_{E}\wedge\mathrm{id})(\xi^{\prime}\otimes f\otimes\eta^ {\prime})\) for some \(\xi^{\prime}\in\Omega_{B}^{1}\), \(f\in E\), \(\eta^{\prime}\in\Omega_{A}^{q-1}\) (summation implicit). Thus, using associativity of \(\wedge\) and then extendability of \(\sigma\), we can re-write \(g(\xi\otimes[e\otimes\eta])\) as in Figure 7. We can see that this lies in \(\mathrm{im}(\sigma_{E}\wedge\mathrm{id}):\Omega_{B}^{p+1}\otimes_{B}\mathrm{E }\otimes_{A}\Omega_{A}^{q-1}\rightarrow\mathrm{E}\otimes_{A}\Omega_{A}^{p+q}\), and hence has equivalence class zero in \(M_{p,q}\). _ **Definition 3.4**.: _We say that a \(B\)-\(A\) bimodule \(E\) with extendable zero-curvature right bimodule connection \((\nabla_{E},\sigma_{E})\) is a (bimodule) differential fibration if \(g\) is an isomorphism for all \(p,q\geq 0\) and if for all \(p\) the calculi \(\Omega_{B}^{p}\) are flat as right modules._ Recall that flatness of \(\Omega_{B}^{p}\) as a right \(B\)-module means that given a short exact sequence of left \(B\)-modules and left \(B\)-module maps \[\begin{CD}0@>{}>{}>E_{1}@>{\phi_{1}}>{}>E_{1}@>{\phi_{2}}>{}>E_{1}@>{}>{}>0, \end{CD}\] the following sequence of left \(B\)-modules and left \(B\)-module maps is also short exact. \[\begin{CD}0@>{}>{}>\Omega_{B}^{p}\otimes_{B}E_{1}@>{\mathrm{id}\otimes\phi_{1 }}>{}>\Omega_{B}^{p}\otimes_{B}E_{2}@>{\mathrm{id}\otimes\phi_{2}}>{}>\Omega_{B }^{p}\otimes_{B}E_{3}@>{}>{}>0.\end{CD}\] If \(\Omega_{B}^{p}\) is finitely generated projective, then flatness is automatic. In the remaining part of this theory section, we show that given such a bimodule differential fibration, we can construct a Leray-Serre spectral sequence. **Lemma 3.5**.: _Suppose that we have a differential fibration \((E,\nabla_{E})\), so \(g:\Omega^{p}_{B}\otimes_{B}N_{q}\to M_{p,q}\) is an isomorphism and \(\Omega^{p}_{B}\) (for all \(p\)) are flat as right modules. We then have the following cochain complex on \(M\) with differential on \(M_{p,q}\) given by \([\nabla^{[p+q]}_{E}]\), whose cohomology we denote as \(\hat{H}^{q}(M_{p,q})\)._ _We then have an isomorphism \(\Omega^{p}_{B}\otimes_{B}\hat{H}^{q}(M_{0,q})\to\hat{H}^{q}(M_{p,q})\) given by:_ \[\xi\otimes[[e\otimes\eta]]\to[[\sigma_{E}(\xi\otimes e)\wedge\eta]]\] _We write \(\hat{H}^{q}(N):=\hat{H}^{q}(M_{0,q})\)._ **Proof**.: _(1) Firstly, we show that the following diagram commutes:_ _Earlier, in the proof that we have a filtration, we calculated (in diagram form) that \(\nabla^{[p+q]}_{E}(\sigma_{E}\wedge\mathrm{id})=\sigma_{E}(\mathrm{d}\otimes \mathrm{id})\wedge\mathrm{id}+(-1)^{p}(\sigma_{E}\wedge\mathrm{id})(\mathrm{ id}\otimes\nabla^{[q]}_{E})\). However, the term \(\sigma_{E}(\mathrm{d}\otimes\mathrm{id})\wedge\mathrm{id}\) has equivalence class zero in \(M_{p,q+1}\), so taking equivalence classes gives \([\nabla^{[p+q]}_{E}\circ g]=(-1)^{p}[(\sigma_{E}\wedge\mathrm{id})(\mathrm{ id}\otimes\nabla^{[q]}_{E})]\)._ _Going the other way around the diagram also gives \(g((-1)^{p}\mathrm{id}\otimes[\nabla^{[q]}_{E}])=(-1)^{p}[(\sigma_{E}\wedge \mathrm{id})(\mathrm{id}\otimes\nabla^{[q]}_{E})]\), so the diagram commutes._ _(2) Secondly, we need to show the map \(\Omega^{p}_{B}\otimes_{B}\hat{H}^{q}(N_{q})\to\hat{H}^{q}(M_{p,q})\) given by \(\xi\otimes[[e\otimes\eta]]\to[[\sigma_{E}(\xi\otimes e)\wedge\eta]]\) is an isomorphism. Define \(Z_{p,q}:=\mathrm{im}(\mathrm{d}):M_{\mathrm{p,q-1}}\to\mathrm{M}_{\mathrm{p,q}}\) and \(K_{p,q}=\ker(\mathrm{d}):M_{p,q}\to M_{p,q+1}\), so \(\hat{H}^{p+q}(M_{p,q})=\frac{K_{p,q}}{Z_{p,q}}\). The differential \(\mathrm{d}:M_{0,q}\to M_{0,q+1}\) is a left \(B\)-module map by \([\nabla^{[q]}(b.e\otimes\eta)]=[\nabla^{[q]}_{E}(b.e\otimes\eta)]=[b.e\otimes \mathrm{d}\eta]+[\nabla_{E}(b.e)\wedge\eta]=[b.e\otimes\mathrm{d}\eta]+[\sigma_ {E}(\mathrm{d}b\otimes e)\wedge\eta]+[b\nabla_{E}(e)\wedge\eta]=[b(\mathrm{ id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{id})(e\otimes\eta)]=[b\nabla^{[q]}(e \otimes\eta)]\). Hence there is an exact sequence of left \(B\)-modules:_ _Tensoring with the flat right module \(\Omega^{p}_{B}\) gives another exact sequence:_ _Applying \(g\) to the elements of this sequence, the first part of the proof tells us that the following diagram commutes._ _Note that the middle instance of \(g\) is an isomorphism, while the first and third are merely injective. It follows from this diagram that \(Z_{p,q+1}\cong\Omega^{p}_{B}\otimes_{B}Z_{0,q+1}\) and \(K_{p,q+1}\cong\Omega^{p}_{B}\otimes_{B}K_{0,q+1}\). Hence \(Z_{p,q}\cong\Omega^{p}_{B}\otimes_{B}Z_{0,q}\) and \(K_{p,q}\cong\Omega^{p}_{B}\otimes_{B}K_{0,q}\). By definition of \(\hat{H}^{q}(N)=\frac{K_{0,q}}{Z_{0,q}}\), we have another short exact sequence:_ _Tensoring with the flat right module \(\Omega^{p}_{B}\) then gives exact sequence:_ _Therefore \(\Omega^{p}_{B}\otimes_{B}\hat{H}^{q}(N)\cong\frac{\Omega^{p}_{B}\otimes_{B}K_{ 0,q}}{\Omega^{p}_{B}\otimes_{B}Z_{0,q}}\cong\frac{K_{p,q}}{Z_{p,q}}=\hat{H}^{p+ q}(M_{p,q})\), which is the isomorphism we wanted to show._ **Proposition 3.6**.: _There is a zero-curvature left connection \(\nabla_{q}:\hat{H}^{q}(N)\to\Omega^{1}_{B}\otimes_{B}\hat{H}^{q}(N)\),_ \[\nabla_{q}([[e\otimes\xi]])=\eta\otimes[[f\otimes\kappa]] \tag{7}\] _where \(\nabla^{[q]}_{E}(e\otimes\xi)=\sigma_{E}(\eta\otimes f)\wedge\kappa\in\sigma_ {E}(\Omega^{1}_{B}\otimes E)\wedge\Omega^{q}_{A}\subset E\otimes_{A}\Omega^{q +1}_{A}\), with summation implicit._ **Proof.**_We need to show that the map \(\nabla_{q}\) is well-defined, satisfies the left Leibniz rule, and has zero curvature._ _(1) Firstly, we show that the map is well-defined. We have \(\nabla^{[q]}_{E}(e\otimes\xi)=\sigma_{E}(\eta\otimes f)\wedge\kappa\in E \otimes_{A}\Omega^{q+1}_{A}\), on account of the fact that \([[e\otimes\xi]]\in H^{q}(N)=\frac{\ker[\nabla^{[q]}_{E}]}{\operatorname{im}[ \nabla^{[q-1]}_{E}]}\), so \([\nabla^{[n]}_{E}(e\otimes\xi)]=[0]\in N_{q+1}=\frac{E\otimes_{A}\Omega^{q+1} _{A}}{\sigma_{E}(\Omega^{1}_{B}\otimes_{B}E)\wedge\Omega^{q}_{A}}\), from which it follows that \(\nabla^{[n]}_{E}(e\otimes\xi)=\sigma_{E}(\eta\otimes f)\wedge\kappa\in\sigma _{E}(\Omega^{1}_{B}\otimes E)\wedge\Omega^{q}_{A}\). Hence by the isomorphism \(g\), we have \(\eta\otimes[f\otimes\kappa]\in\Omega^{1}_{B}\otimes_{B}N_{q}\), from which it follows that \(\eta\otimes[[f\otimes\kappa]]\in\Omega^{1}_{B}\otimes_{B}\hat{H}^{q}(N)\), so the map ends up in the right space._ _(2) Next, we show that \(\nabla_{q}\) satisfies the left Leibniz rule \(\nabla_{q}(b.[[e\otimes\xi]])=\mathrm{d}b\otimes[[e\otimes\xi]]+b\nabla_{q}( [[e\otimes\xi]])\) for all \(b\in B\). We calculate_ \[\nabla^{[q]}_{E}(be\otimes\xi) =(\mathrm{id}\otimes\mathrm{d}+\nabla_{E}\wedge\mathrm{id})(be \otimes\xi)=be\otimes\mathrm{d}\xi+\nabla_{E}(be)\wedge\xi\] \[=be\otimes\mathrm{d}\xi+\sigma_{E}(\mathrm{d}b\otimes e)\wedge\xi+b \nabla_{E}(e)\wedge\xi\] \[=\sigma_{E}(\mathrm{d}b\otimes e)\wedge\xi+b\nabla^{[q]}_{E}(e \otimes\xi)\] _Taking equivalence classes and using the isomorphism \(g\) gives the desired result._ _(3) Lastly, we show that the curvature, \(R_{q}=(\mathrm{d}\otimes\mathrm{id}-\mathrm{id}\wedge\nabla_{q})\nabla_{q}\) vanishes._ _Denoting \(\nabla^{[q]}_{E}(f\otimes\kappa)=\sigma_{E}(\eta^{\prime}\otimes f^{\prime}) \wedge\kappa^{\prime}\), we have:_ \[R_{q}([[e\otimes\xi]])=\mathrm{d}\eta\otimes[[f\otimes\kappa]]+ \eta\wedge\nabla_{q}([[f\otimes\kappa]])\] \[=\mathrm{d}\eta\otimes[[f\otimes\kappa]]+\eta\wedge\eta^{\prime} \otimes[[f^{\prime}\otimes\kappa^{\prime}]]\] _To show this vanishes, we want to show \(\mathrm{d}\eta\otimes[f\otimes\kappa]+\eta\wedge\eta^{\prime}\otimes[f^{ \prime}\otimes\kappa^{\prime}]=0\)._ _As the curvature \(R_{E}\) vanishes, we have:_ \[0=\nabla^{[q+1]}_{E}\circ\nabla^{[q]}_{E}(e\otimes\xi)=\nabla^{[q+1]}_{E}( \sigma_{E}(\eta\otimes f)\wedge\kappa)\] \[=(\mathrm{d}\otimes\mathrm{id}+\mathrm{id}\wedge\nabla_{E})(\sigma_{E}(\eta \otimes f)\wedge\kappa)\] _Taking equivalence classes and using the isomorphism \(g\), we get_ \[0 =(\mathrm{d}\otimes\mathrm{id}+\mathrm{id}\wedge\nabla_{E})(\eta \otimes[f\otimes\kappa])\] \[=\mathrm{d}\eta\otimes[f\otimes\kappa]+\eta\wedge\nabla_{E}([f \otimes\kappa])\] \[=\mathrm{d}\eta\otimes[f\otimes\kappa]+\eta\wedge\eta^{\prime} \otimes[f^{\prime}\otimes\kappa^{\prime}]\] _as required. Hence \(R_{q}=0\). _ Equipping \(\hat{H}^{q}(N)\) with a zero-curvature connection makes it a sheaf [2], which means we can do sheaf cohomology with coefficients in \(\hat{H}^{q}(N)\). By the above results, there is a spectral sequence for the filtration, which has first page \(E_{1}^{p,q}=H^{p+q}(M_{p,q})\cong H^{p+q}(\Omega_{B}^{p}\otimes_{B}N_{q})= \Omega_{B}^{p}\otimes_{B}\hat{H}^{q}(N)\), and second page position \((p,q)\) given by \(H^{p}(B,\hat{H}^{q}(N),\nabla_{q})\), and which converges to \(H(A,E,\nabla_{E})\) in the sense described in the background section. Recall that the sheaf cohomology group \(H^{p}(B,\hat{H}^{q}(N),\nabla_{q})\) is defined as the cohomology at \(\Omega_{\mathbb{C}G}^{p}\otimes_{\mathbb{C}G}\hat{H}^{q}(N)\) in the following sequence (which is not necessarily exact). ## 4 Theory: Fibrations (Left-handed Version) By symmetry of modules, this construction can be mirrored to use an \(A\)-\(B\) bimodule \(E\) with an extendable zero-curvature left bimodule connection \((\nabla_{E},\sigma_{E})\), where \(\nabla_{E}:E\rightarrow\Omega_{A}^{1}\otimes_{A}E\) and \(\sigma_{E}:E\otimes_{B}\Omega_{B}^{1}\rightarrow\Omega_{A}^{1}\otimes_{A}E\). In this case, zero curvature means \(R_{E}=(\mathrm{d}\otimes\mathrm{id}-\mathrm{id}\wedge\nabla_{E})\nabla_{E}=0\). The bimodule connection satisfies \[\nabla_{E}^{[n]}\sigma_{E}=(\mathrm{id}\wedge\sigma_{E})(\nabla_{E}\otimes \mathrm{id})+\sigma_{E}(\mathrm{id}\otimes\mathrm{id}):E\otimes_{B}\Omega_{B }^{n}\rightarrow\Omega_{A}^{n+1}\otimes_{A}E.\] The cochain complex \(C^{n}=\Omega_{A}^{n}\otimes_{A}E\) with differential \(C^{n}\to C^{n+1}\) given by \(\mathrm{d}_{C}=\nabla_{E}^{[n]}=\mathrm{id}\otimes\mathrm{d}+(-1)^{n}\nabla_ {E}\wedge\mathrm{id}\) has a filtration \(F^{m}C^{n}=\mathrm{im}(\mathrm{id}\wedge\sigma_{\mathrm{E}}):\Omega_{\mathrm{ A}}^{n-m}\otimes_{\mathrm{A}}\mathrm{E}\otimes_{\mathrm{B}}\Omega_{\mathrm{B}}^{m} \rightarrow\Omega_{\mathrm{A}}^{n}\otimes_{\mathrm{A}}\mathrm{E}\). The quotients for the fibre are given as follows. \[M_{p,q}:=\frac{F^{p}C^{p+q}}{F^{p+1}C^{p+q}}=\frac{\Omega_{A}^{q} \wedge\sigma_{E}(E\otimes_{B},\Omega_{B}^{p})}{\Omega_{A}^{q-1}\wedge\sigma_{ E}(E\otimes_{B}\Omega_{B}^{p+1})}\] \[N_{q}:=M_{0,q}=\frac{C^{q}}{F^{1}C^{q}}=\frac{\Omega_{A}^{q} \otimes_{A}E}{\Omega_{A}^{q-1}\wedge\sigma_{E}(E\otimes_{B}\Omega_{B}^{1})},\] There is then a well-defined map \(g:N_{q}\otimes_{B}\Omega_{B}^{p}\to M_{p,q}\) given by \(g([\eta\otimes e]\otimes\xi)=[(\mathrm{id}\wedge\sigma)(\eta\otimes e\otimes \xi)]\) which extends to cohomology. We say that \(E\) is a differential fibration if \(g\) is an isomorphism for all \(p,q\geq 0\) and if the calculi \(\Omega_{B}^{p}\) are flat as left modules for all \(p\geq 0\) On the cohomology we have the following a zero-curvature right connection. \[\nabla_{q}:\hat{H}^{q}(N)\rightarrow\hat{H}^{q}(N)\otimes_{B}\Omega_{B}^{1}, \nabla_{q}([[\xi\otimes e]])=[[\kappa\otimes f]]\otimes\eta,\] where \(\nabla_{E}^{[q]}(\xi\otimes e)=\kappa\wedge\sigma_{E}(f\otimes\eta)\in\Omega_ {A}^{q}\wedge\sigma_{E}(E\otimes_{B}\Omega_{B}^{1})\subset\Omega_{A}^{q+1} \otimes_{A}E\) with summation implicit. Assuming that we have a differential fibration, there is then a spectral sequence converging to \(H(A,E,\nabla_{E})\) with first page position \((p,q)\) given by \(E_{1}^{p,q}=\hat{H}^{q}(N)\otimes_{B}\Omega_{B}^{p}\) and second page position \((p,q)\) given by \(H^{p}(B,\hat{H}^{q}(N),\nabla_{q})\). ## 5 Example: Group Algebras The group algebra \(\mathbb{C}X\) of a finite group \(X\) has general elements of the form \(\sum\limits_{x\in X}\lambda_{x}x\), where \(\lambda_{x}\in\mathbb{C}\), and the elements of \(X\) give a basis of the algebra. \(\mathbb{C}X\) is in general not commutative unless \(X\) is commutative. For a right representation \(V\) of \(X\), a surjective map \(\omega:\mathbb{C}X\to V\) satisfying \(\omega(xy)=\omega(x)\triangleleft y+\omega(y)\) for \(x,y\in X\) is called a cocycle. This rule allows the calculation of \(\omega\) on any element of \(X\) as a product of generators, and implies that \(\omega(x^{-1})=-\omega(x)\triangleleft x^{-1}\) and \(\omega(1)=0\). By results in [13], left covariant calculi on \(\mathbb{C}X\) are classified by cocycles, and are given by \(\Omega^{1}_{\mathbb{C}X}=\Lambda^{1}_{\mathbb{C}X}\otimes\mathbb{C}X\) with exterior derivative \(\mathrm{d}x=x\omega(x)\), right action \((v\otimes x).y=v\otimes xy\) and left action \(x.(v\otimes y)=v\triangleleft x^{-1}\otimes xy\). In the following we abbreviate the calculus as \(\Omega^{1}_{\mathbb{C}X}=\Lambda^{1}_{\mathbb{C}X}.\mathbb{C}X\). The calculus is connected if and only if \(\omega(x)\neq 0\) for all \(x\in X\backslash\{0\}\), and in which case \(H_{dR}(\mathbb{C}X)=\Lambda_{\mathbb{C}X}\). **Lemma 5.1**.: _If \(X\) is a finite group with calculus given by a right representation \(V\) and a cocycle \(\omega:\mathbb{C}X\to V\), then for a subgroup \(G\subset X\) the subspace \(W\subset V\) spanned by \(\omega(g)\) for all \(g\in G\) then \(W\) is a right representation of \(G\), and there exists a complement \(W^{\perp}\) which is also right representation of \(G\)._ **Proof**.: _The cocycle condition \(\omega(x)\triangleleft y=\omega(xy)-\omega(y)\) defines a right action on \(W\), which gives a calculus on \(\mathbb{C}G\). Since \(G\) is a finite group, the representation \(V\) has an invariant inner product \(\overline{V}\otimes V\to C\) (invariant meaning \(\langle\overline{v\triangleleft g},v\triangleleft g\rangle=\langle\overline{v },v\rangle\)), from which it follows that \(V=W\oplus W^{\perp}\), where \(W^{\perp}\) is the perpendicular complement of \(W\). The vector space \(W^{\perp}\) is then also a representation of \(G\). _ The restriction of \(\omega\) to a cocycle \(\mathbb{C}G\to W\) gives a calculus on the subgroup \(G\). **Proposition 5.2**.: _If for the higher calculi on \(\mathbb{C}X\) we assume that \(\mathrm{d}(V)=0\), then the wedge product \(\wedge\) is antisymmetric on invariant elements \(\Lambda_{\mathbb{C}X}\)._ **Proof**.: _Since \(v\triangleleft x=x^{-1}vx\), it follows that \(x(v\triangleleft x)=vx\). Applying \(\mathrm{d}\) to this and using the assumption that \(\mathrm{d}(V)=0\) gives \(\mathrm{d}x\wedge(v\triangleleft x)=-v\wedge\mathrm{d}x\)._ _But then \(v\wedge\omega(x)=v\wedge(x^{-1}\mathrm{d}x)=(vx^{-1})\wedge\mathrm{d}x=x^{-1}( v\triangleleft x^{-1})\wedge\mathrm{d}x=-x^{-1}\mathrm{d}x\wedge v=-\omega(x) \wedge v\). Since the images \(\omega(x)\) span \(V\), this proves the result. _ Now we look at fibrations. Suppose \(G\) is a finite subgroup of a group \(X\), and take \(A=\mathbb{C}X\), \(B=\mathbb{C}G\) as in the discussion of fibrations earlier. Equip \(\mathbb{C}X\) with calculus as above for \(\Lambda^{1}_{\mathbb{C}X}=V\) and some cocycle \(\omega:\mathbb{C}X\to V\) for some right representation \(V\) of \(\mathbb{C}X\). For the higher calculi on \(\mathbb{C}X\) take maximal prolongation plus the assumption \(\mathrm{d}(V)=0\). For the calculus on \(\mathbb{C}G\) take \(\Lambda^{1}_{\mathbb{C}G}=W=\omega(\mathbb{C}G)\) with cocycle the restriction of \(\omega\) to \(\mathbb{C}G\), and maximal prolongation for the higher calculi. **Proposition 5.3**.: _A \(\mathbb{C}G\)-\(\mathbb{C}X\) bimodule is given by \(E=\mathbb{C}X\) with left and right actions given by multiplication, and when the algebras are equipped with the calculi above there is a zero-curvature extendable right bimodule connection on \(E\) given by \((\nabla_{E},\sigma_{E})\), where \(\nabla_{E}:\mathbb{C}X\to\mathbb{C}X\otimes_{\mathbb{C}X}\Omega^{1}_{\mathbb{ C}X}\) is given by \(\nabla_{E}(x)=1\otimes\mathrm{d}x\), and the bimodule map \(\sigma_{E}:\Omega^{1}_{\mathbb{C}G}\otimes_{\mathbb{C}G}\mathbb{C}X\to\mathbb{C }X\otimes_{\mathbb{C}X}\Omega^{1}_{\mathbb{C}X}\) is given by \(\sigma_{E}(\mathrm{d}g\otimes x)=1\otimes\mathrm{d}g.x\)._ **Proof**.: _The connection satisfies the condition \(\nabla_{E}(gx)=\sigma_{E}(\mathrm{d}g\otimes x)+g\nabla_{E}(x)\) required to be a bimodule connection, since \(\sigma_{E}(\mathrm{d}g\otimes x)=1\otimes(\mathrm{d}(gx)-g\mathrm{d}x)=1\otimes \mathrm{d}g.x\). The curvature is zero because \(\mathrm{d}\) has zero curvature. The connection is extendable as \(\sigma_{E}(\xi\otimes x)=1\otimes\xi.x\) for all \(\xi\in\Omega^{n}_{\mathbb{C}G}\). _ **Proposition 5.4**.: _Equip \(A=\mathbb{C}X\), \(B=\mathbb{C}G\) with calculi as above, the \(B\)-\(A\) bimodule \(E=\mathbb{C}X\) with actions given by multiplication. The right bimodule connection \((\nabla_{E},\sigma_{E})\) as above, given by \(\nabla_{E}(x)=1\otimes\mathrm{d}x\) and \(\sigma_{E}(\mathrm{d}g\otimes x)=1\otimes\mathrm{d}g.x\), is a differential fibration. The fibres are \(N_{q}\cong(W^{\perp})^{\wedge q}.\mathbb{C}X\), on which a differential \(\mathrm{d}:N_{q}\to N_{q+1}\) is given by_ \[\mathrm{d}(\xi.x)=(-1)^{|\xi|}\xi\wedge\pi^{\perp}(\omega(x)\triangleleft x^{ -1}).x \tag{8}\] _for \(\xi\in(W^{\perp})^{\wedge q}\) and \(x\in X\), and where we write \(\pi^{\perp}\) for the projection \(V\to W^{\perp}\) which has kernel \(W\). The differential \(\nabla_{q}:\hat{H}^{q}(N)\to\Omega^{1}_{\mathbb{C}G}\otimes_{\mathbb{C}G}\hat{ H}^{q}(N)\) is given by_ \[\nabla_{q}([\xi.x])=\pi(\omega(x)\triangleleft x^{-1})\otimes[\xi.x]. \tag{9}\] _The fibration \(E\) gives rise to a spectral sequence converging to \(H(\mathbb{C}X,E,\nabla_{E})\cong H_{\mathrm{dR}}(\mathbb{C}X)\) with second page position \((p,q)\) given by \(H^{p}(\mathbb{C}G,\hat{H}^{q}(N),\nabla_{q})\)_ **Proof**.: _(1) Firstly we show that \(E\) is a differential fibration. The calculi \(\Omega^{p}_{B}=\Omega^{p}_{\mathbb{C}G}\) are finitely generated projective for all \(p\geq 0\) and therefore flat as modules, and the bimodule connection has zero curvature and is extendable. Lastly we need to show that the map \(g:\Omega^{p}_{\mathbb{C}G}\otimes_{\mathbb{C}G}M_{0,q}\to M_{p,q}\) given by \(g(\xi\otimes[e\otimes\eta])=[(\sigma_{E}\wedge\mathrm{id})(\xi\otimes e \otimes\eta)]=[e\otimes\xi\wedge\eta]\) is an isomorphism. Using the fact that \(x\xi=x\xi x^{-1}x=(\xi\triangleleft x^{-1})x\) to move all elements of the group to the right, and then the fact that \(V=W\oplus W^{\perp}\), we calculate:_ \[M_{p,q}=\frac{\sigma_{E}(\Omega^{p}_{\mathbb{C}X}\otimes_{\mathbb{C}X}E)\wedge \Omega^{q}_{\mathbb{C}G}}{\sigma_{E}(\Omega^{p+1}_{\mathbb{C}X}\otimes_{ \mathbb{C}X}E)\wedge\Omega^{q-1}_{\mathbb{C}G}}=\frac{W^{\wedge p}\wedge V^{ \wedge q}}{W^{\wedge p+1}\wedge V^{\wedge q-1}}.\mathbb{C}X\cong W^{\wedge p} \otimes(W^{\perp})^{\wedge q}.\mathbb{C}X.\] _The above isomorphism sends \([w_{i_{1}}\wedge\cdots\wedge w_{i_{p}}\wedge v_{j_{1}}\wedge\cdots\wedge v_{j _{q}}]\to w_{i_{1}}\wedge\cdots\wedge w_{i_{p}}\wedge v_{j_{1}}\wedge\cdots \wedge v_{j_{q}}\) where the \(w_{i_{k}}\) are basis elements of \(W\) and the \(v_{i_{k}}\) are basis elements of \(V\). The map \(g\) sending \(W^{\wedge p}\otimes(W^{\perp})^{\wedge q}\in\Omega^{p}_{\mathbb{C}G}\otimes_{ \mathbb{C}X}M_{0,q}\) to \(W^{\wedge p}\otimes(W^{\perp})^{\wedge q}\in M_{p,q}\) then is an isomorphism. **(2)** The fibres are \(N_{q}\cong\frac{\Omega^{p}_{\mathbb{C}X}}{\Omega^{p}_{\mathbb{C}G}\wedge\Omega ^{q-1}_{\mathbb{C}X}}\cong(W^{\perp})^{\wedge q}.\mathbb{C}X\). The differential \(\mathrm{d}:N_{q}\to N_{q+1}\) is given by \(\mathrm{d}(\xi.x)=(-1)^{q}[\xi\wedge\mathrm{d}x]\) for \(\xi\in(W^{\perp})^{\wedge q}\) and \(x\in X\), but we can use the fact that \(\mathrm{d}x=(\omega(x)\triangleleft x^{-1}).x\) to write the differential on \(N_{q}\) as \(\mathrm{d}(\xi.x)=(-1)^{|\xi|}\xi\wedge\pi^{\perp}(\omega(x)\triangleleft x^{-1 }).x\). The cohomology of the fibre is then \(\hat{H}^{q}(N)=\frac{\ker\mathrm{d}:N^{q-1}\to N^{q}}{imd:N^{q}\to N^{q+1}}\), using this differential. The differential \(\nabla_{q}:\hat{H}^{q}(N)\to\Omega^{1}_{\mathbb{C}G}\otimes_{\mathbb{C}G}\hat{ H}^{q}(N)\) on the cohomology groups is given by_ \[\nabla_{q}([\xi\otimes x])=g^{-1}([\pi(\omega(x)\triangleleft x^{-1})\wedge \xi.x])=\pi(\omega(x)\triangleleft x^{-1})\otimes[\xi.x].\] __ Group algebras are C*-algebras, with a \(*\)-map given by \((\lambda_{x}x)^{*}=\lambda_{x}^{*}x^{-1}\) and extended linearly. The bimodule \(E\) has an inner product \(\langle,\rangle:\overline{E}\otimes_{\mathbb{C}G}E\to\mathbb{C}X\) given by \(\langle\overline{x},y\rangle=x^{*}y=x^{-1}y\), and the Leibniz rule shows that \(\nabla_{E}\) preserves this inner product. On a C*-algebra with an inner product we can use the KSGNS construction to obtain positive maps. The kernel of \(\nabla_{E}\) consists of \(\mathbb{C}.e\), and so the positive map we get via the KSGNS construction is \(\langle\overline{e},ge\rangle=g\). This is just the inclusion map, which is an algebra map. Lastly, we do a full calculation of the spectral sequence for the example of \(S_{3}\) and its subgroup generated by the cycle \(u=(1,2)\). **Example 5.5**.: _Let \(X=S_{3}\), denote transpositions as \(u=(12)\) and \(v=(23)\), and then define a subgroup \(G=\{e,u\}\subset S_{3}\). An example of a right representation of \(X\) is given by \(V=\mathbb{C}^{2}\) with right action \((v_{1},v_{2})\triangleleft x=(v_{1},v_{2})\rho(x)\) for the homomorphism \(\rho:S_{3}\to End(V)\) given by \(\rho(u)=\left(\begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix}\right)\) and \(\rho(v)=\frac{1}{2}\Big{(}\begin{smallmatrix}-1&\sqrt{3}\\ \sqrt{3}&1\end{smallmatrix}\Big{)}\). To define a calculus on \(X=\mathbb{C}S_{3}\) (and therefore by restriction a calculus on \(G\)) we need a cocycle \(\omega:S_{3}\to\mathbb{C}^{2}\) satisfying \(\omega(xy)=\omega(x)\rho(y)+\omega(y)\). For the cocycle to be a well-defined linear map, we need to be able to apply \(\omega\) to the three relations of \(S_{3}\), which are \(u^{2}=e\), \(v^{2}=e\), and \(uvu=vuv\). If we write \(\omega(v)=(a,b)\) and \(\omega(u)=(c,d)\), we have the following._ _(1) Recalling that_ \(\omega(e)=0\)_, the relation_ \(u^{2}=e\) _gives:_ \[0=\omega(u^{2})=\omega(u)\rho(u)+\omega(u)=(c,d)\big{(}\begin{smallmatrix}1&0 \\ 0&-1\end{smallmatrix}\big{)}+(c,d)=(c,-d)+(c,d)=(2c,0).\] _Hence_ \(c=0\)_. We can normalise to get_ \(d=1\) _so that_ \(\omega(u)=(0,1)\)_._ _(2) The relation_ \(v^{2}=e\) _gives:_ \[0 =\omega(v^{2})=\omega(v)\rho(v)+\omega(v)=\omega(v)(\rho(v)+I_{2} )=(a,b)\frac{1}{2}\Big{(}\begin{smallmatrix}1&\sqrt{3}\\ \sqrt{3}&3\end{smallmatrix}\Big{)}\] \[=\frac{1}{2}(a+\sqrt{3}b,\sqrt{3}a+3b)\] _Both equations arising from this give that_ \(a=-\sqrt{3}b\)_. We already normalised when defining_ \(\omega(u)\)_, so we simply have_ \(b\) _as a free parameter, giving_ \(\omega(v)=(-\sqrt{3}b,b)\)_._ _(3) Finally we have the relation_ \(uvu=vuv\)_. We calculate:_ \[\omega(uvu)=\omega(u)+\omega(uv)\rho(u)=\omega(u)+\omega(v)\rho(u )+\omega(u)\rho(v)\rho(u)\] \[=(0,1)+(-\sqrt{3}b,b)(\begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix})+(0,1)\frac{1}{2}\Big{(}\begin{smallmatrix}-1&\sqrt{3} \\ \sqrt{3}&1\end{smallmatrix}\Big{)}(\begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix})\] \[=(0,1)+(-\sqrt{3}b,-b)+(\frac{1}{2}\sqrt{3},-\frac{1}{2})=( \frac{1}{2}\sqrt{3}-\sqrt{3}b,\frac{1}{2}-b).\] _Flipping_ \(u\) _and_ \(v\) _in the above, we calculate:_ \[\omega(vuv)=\omega(v)+\omega(vu)\rho(v)=\omega(v)+\omega(u)\rho(v )+\omega(v)\rho(u)\rho(v)\] \[=(-\sqrt{3}b,b)+(0,1)\frac{1}{2}\Big{(}\begin{smallmatrix}-1& \sqrt{3}\\ \sqrt{3}&1\end{smallmatrix}\Big{)}+(-\sqrt{3}b,b)\frac{1}{2}\big{(}\begin{smallmatrix} 1&0\\ 0&-1\end{smallmatrix}\big{)}\Big{(}\begin{smallmatrix}-1&\sqrt{3}\\ \sqrt{3}&1\end{smallmatrix}\Big{)}\] \[=(-\sqrt{3}b,b)+(\frac{1}{2}\sqrt{3},\frac{1}{2})+(0,-2b)=( \frac{1}{2}\sqrt{3}-\sqrt{3}b,\frac{1}{2}-b).\] _This shows that the equality_ \(\omega(uvu)=\omega(vuv)\) _follows automatically once we assume that_ \(0=\omega(u^{2})=\omega(v^{2})\)_, and hence we get no new restrictions on_ \(b\) _as a result of this relation. This gives a 1-parameter family of 2D calculi on_ \(\mathbb{C}X\)_, with_ \(\Lambda^{1}\) _generated by_ \(e_{u}=\omega(u)=(0,1)\) _and_ \(e_{v}=\omega(v)=b(-\sqrt{3},1)\)_, where_ \(b\in\mathbb{C}\) _is a free parameter. Take the calculus on_ \(\mathbb{C}G\) _to be the vector space_ \(W\) _generated by_ \(e_{u}\)_, so_ \(\Omega^{0}_{\mathbb{C}G}=\mathbb{C}\{1,u\}\) _and_ \(\Omega^{1}_{\mathbb{C}G}=\omega(u).\mathbb{C}\{1,u\}\)_._ _We now calculate the de Rham cohomology. As long as_ \(b\neq\frac{1}{2}\)_, this_ \(\omega\) _doesn't send any elements of_ \(X\) _other than_ \(e\) _to zero, the calculus on_ \(\mathbb{C}X\) _is connected, and hence has de Rham cohomology_ \(H_{dR}(\mathbb{C}X)=\Lambda_{\mathbb{C}X}\)_. This gives_ \(H^{0}_{dR}(\mathbb{C}X)\cong\mathbb{C}\) _and_ \(H^{1}_{dR}(\mathbb{C}X)\cong\mathbb{C}\oplus\mathbb{C}\)_, while_ \(H^{2}_{dR}(\mathbb{C}X)\) _is a quotient of_ \(\mathbb{C}^{2}\wedge\mathbb{C}^{2}\)_. Since the wedge product is antisymmetric under the assumption_ \(\mathrm{d}V=0\)_, a basis of this is given by_ \(\omega(u)\wedge\omega(v)\)_, and_ \(H^{2}_{dR}(\mathbb{C}X)\cong\mathbb{C}\) _We now calculate the Leray-Serre spectral sequence explicitly for this example, where \(E=A=\mathbb{C}X\), \(B=\mathbb{C}G\) for \(X=S_{3}\) and \(G\) the subgroup generated by the cycle \(u=(12)\). As \(\omega(u)=(0,1)\) is a basis of \(W\), it follows that \((1,0)\) is a basis of \(W^{\perp}\), and hence \(\pi^{\perp}(x,y)=(x,0)\)._ _From the formula above that \(N_{q}\cong(W^{\perp})^{\wedge q}.\mathbb{C}X\), we have \(N_{0}\cong\mathbb{C}X\) and \(N_{1}\cong(1,0).\mathbb{C}X\). All the other \(N_{q}\) are zero, since \(W^{\wedge 2}\) and \((W^{\perp})^{\wedge 2}\) are zero, seeing as \(W\) and \(W^{\perp}\) are 1-dimensional and the wedge product is antisymmetric on \(V\). The one non-trivial differential is therefore \(\mathrm{d}:N_{0}\to N_{1}\), given by \(\mathrm{d}x=\pi^{\perp}(\omega(x)\triangleleft x^{-1}).x\). The kernel of \(\mathrm{d}:N_{0}\to N_{1}\) is two-dimensional with basis elements \(e\) and \(u\). The reason that the identity element \(e\) lies in the kernel is because \(\omega(e)=0\), while \(u\) is in the kernel because \(\omega(u)\triangleleft u^{-1}=\omega(u)\rho^{-1}(u)=(0,1)(\begin{smallmatrix}1& 0\\ 0&-1\end{smallmatrix})^{-1}=(0,-1)\), which is sent by \(\pi^{\perp}\) to zero. The image of \(\mathrm{d}:N_{0}\to N_{1}\) is four-dimensional with basis elements \((1,0).v\), \((1,0).uv\), \((1,0).vu\), \((1,0).uvu\). Hence \(H^{0}(N)\) is two-dimensional with basis elements \([e]\) and \([u]\), while \(H^{1}(N)\) is two-dimensional with basis \([(1,0).e]\) and \([(1,0).u]\). The differential \(\nabla_{0}:\hat{H}^{0}(N)\to\Omega^{1}_{B}\otimes_{B}\hat{H}^{0}(N)\) is given on basis elements by \(\nabla_{0}(e)=\pi(\omega(e)\triangleleft e^{-1})\otimes[e]=0\) and \(\nabla_{0}(u)=\pi(\omega(u)\triangleleft u^{-1})\otimes[u]=(0,-1)\otimes[u]\). The differential \(\nabla_{0}:\hat{H}^{1}(N)\to\Omega^{1}_{B}\otimes_{B}\hat{H}^{1}(N)\) is given on basis elements by \(\nabla_{1}([(1,0).e])=\pi(\omega(e)\triangleleft e^{-1})\otimes[(0,1).e]=0\) and \(\nabla_{1}([(0,1).u])=\pi(\omega(u)\triangleleft u^{-1})\otimes[(0,1).u]=(0,-1 )\otimes[(0,1).u]\). Hence \(\nabla_{0}\) has kernel spanned by \([e]\) and image spanned by \((0,1).[u]\), while \(\nabla_{1}\) has kernel spanned by \([(0,1).e]\) and image spanned by \((0,1)\otimes[(0,1).u]\). Seeing as \(\Omega^{p}_{\mathbb{C}X}=0\) for \(p\geq 2\) and \(\hat{H}^{q}(N)=0\) for \(q\geq 2\), the sequences for the cohomology are the following two._ \[\begin{CD}0@>{}>{}>\hat{H}^{0}(N)@>{\nabla_{0}}>{}>\Omega^{1}_{\mathbb{C}G} \otimes_{\mathbb{C}G}\hat{H}^{0}(N)@>{}>{}>0\\ 0@>{}>{}>\hat{H}^{1}(N)@>{\nabla_{1}}>{}>\Omega^{1}_{\mathbb{C}G}\otimes_{ \mathbb{C}G}\hat{H}^{1}(N)@>{}>{}>0\end{CD}\] \(H^{0}(B,\hat{H}^{0}(N),\nabla_{0})\) _is the cohomology at \(\hat{H}^{0}(N)\), which is \(\frac{\ker(\nabla_{0})}{\text{im}(0)}\cong\langle[e]\rangle_{\text{span}}\cong \mathbb{C}\). \(H^{1}(B,\hat{H}^{0}(N),\nabla_{0})\) is the cohomology at \(\Omega^{1}_{\mathbb{C}G}\otimes_{\mathbb{C}G}\hat{H}^{0}(N)\), which is \(\frac{\Omega^{1}_{\mathbb{C}G}\otimes H^{1}(N)}{\text{im}(\nabla_{0})}\cong \langle(0,1)\otimes[e]\rangle_{\text{span}}\cong\mathbb{C}\). \(H^{0}(B,\hat{H}^{1}(N),\nabla_{1})\) is the cohomology at \(\hat{H}^{1}(N)\), which is \(\frac{\ker(\nabla_{1})}{\text{im}(0)}\cong\langle[(0,1).e]\rangle_{\text{span }}\cong\mathbb{C}\). \(H^{1}(B,\hat{H}^{1}(N),\nabla_{1})\) is the cohomology at \(\Omega^{1}_{\mathbb{C}G}\otimes_{\mathbb{C}G}\hat{H}^{1}(N)\), which is \(\frac{\Omega^{1}_{\mathbb{C}G}\otimes_{\mathbb{C}G}}{\text{im}\nabla_{1}}\cong \langle(1,0)\otimes[(1,0).e]\rangle_{\text{span}}\cong\mathbb{C}\)._ _Page 2 of the Leray-Serre spectral sequence has entries \(E_{2}^{p,q}=H^{p}(\mathbb{C}G,\hat{H}^{q}(N),\nabla_{q})\), with \(E_{2}^{0,0},E_{2}^{0,1},E_{2}^{1,0},E_{2}^{1,1}\) as its nonvanishing entries. This is stable already, and hence the nontrivial cohomology groups are the following direct sums along diagonals._ \[\begin{CD}H^{0}(\mathbb{C}S_{3},E,\nabla_{E})&\cong H^{0}(B,\hat{H}^{0}(N), \nabla_{0})\cong\mathbb{C}\\ H^{1}(\mathbb{C}S_{3},E,\nabla_{E})&\cong H^{1}(B,\hat{H}^{0}(N),\nabla_{0}) \oplus H^{0}(B,\hat{H}^{1}(N),\nabla_{1})\cong\mathbb{C}\oplus\mathbb{C}\\ H^{2}(\mathbb{C}S_{3},E,\nabla_{E})&\cong H^{1}(B,\hat{H}^{1}(N),\nabla_{1}) \cong\mathbb{C}\end{CD}\] _This is the same as the de Rham cohomology \(H_{dR}(\mathbb{C}X)\) that we calculated earlier. \(\diamond\)_ Note that in [14], a different calculus on \(S_{3}\) is obtained by using the same right action \(\rho\) but on the representation \(V=M_{2}(\mathbb{C})\) instead of \(V=\mathbb{C}^{2}\). Example: Matrices In [3] an inner calculus on the matrix algebra \(M_{2}(\mathbb{C})\) is given by \(\mathrm{d}b=[\theta^{\prime},b]=\theta^{\prime}b-b\theta^{\prime}\) for \(b\in M_{2}(\mathbb{C})\) and inner element \(\theta^{\prime}=E_{12}s^{\prime}+E_{21}t^{\prime}\), where \(s^{\prime}\) and \(t^{\prime}\) are central (i.e. they commute with any algebra element). The maximal prolongation calculus has the relation \(s^{\prime}\wedge t^{\prime}=t^{\prime}\wedge s^{\prime}\). We extend this idea to \(M_{3}(\mathbb{C})\), giving it an inner calculus by \(\theta=E_{12}s+E_{21}t+E_{33}u\) for central elements \(s,t,u\). The differential \(\mathrm{d}:M_{3}(\mathbb{C})\rightarrow\Omega^{1}_{M_{3}(\mathbb{C})}\) is then given by \(\mathrm{d}a=[\theta,a]=[E_{12},a]s+[E_{21},a]t+[E_{33},a]u\), which on a general matrix in \(M_{3}(\mathbb{C})\) is the following. \[\mathrm{d}\!\left(\begin{smallmatrix}a&b&c\\ d&e&f\\ g&h&i\end{smallmatrix}\right)=\left(\begin{smallmatrix}d&e-a&f\\ 0&-d&0\\ 0&-g&0\end{smallmatrix}\right)s+\left(\begin{smallmatrix}-b&0&0\\ -a-e&b&c\\ -h&0&0\end{smallmatrix}\right)t+\left(\begin{smallmatrix}0&0&-c\\ 0&0&-f\\ g&h&0\end{smallmatrix}\right)u \tag{10}\] From this we can see that \(\mathrm{d}E_{33}=0\), which means the calculus is not connected, since a connected calculus needs \(\mathrm{ker}\,\mathrm{d}=\mathbb{C}.I_{3}\). For a higher order inner calculus, the differential is given by \(\mathrm{d}\xi=\theta\wedge\xi-(-1)^{|\xi|}\xi\wedge\theta\) for the inner element \(\theta\). For example, since \(|u|=1\), we have \(\mathrm{d}u=\theta\wedge u+u\wedge\theta\), and similarly for \(s\) and \(t\). **Proposition 6.1**.: _Equipping \(M_{3}(\mathbb{C})\) with higher order inner calculus for the inner element \(\theta=E_{12}s+E_{21}t+E_{33}u\) necessitates that \(s\wedge t=t\wedge s=u\wedge u\)._ **Proof**.: _As the calculus is inner, the differential is given by \(\mathrm{d}a=\theta a-a\theta\). If we apply the differential twice to an element \(a\in M_{3}(\mathbb{C})\), we get \(\mathrm{d}^{2}a=\theta\wedge(\theta a-a\theta)-(\theta a-a\theta)\wedge\theta= \theta\wedge\theta a-\theta\wedge a\theta+\theta\wedge a\theta-a\theta\wedge \theta=\theta\wedge\theta a-a\theta\wedge\theta=[\theta\wedge\theta,a]\). For \(\mathrm{d}\) to be well-defined as a differential we need \(\mathrm{d}^{2}a\) to vanish, so \(\theta\wedge\theta\) needs to be central so that its commutator with anything vanishes. We calculate \(\theta\wedge\theta=(E_{12}s+E_{21}t+E_{33}u)\wedge(E_{12}s+E_{21}t+E_{33}u)=E_{ 11}s\wedge t+E_{22}t\wedge s+E_{33}u\wedge u\). The only central elements of \(M_{3}(\mathbb{C})\) are multiples of \(I_{3}\), and hence for \(\theta\wedge\theta\) to be central we require \(s\wedge t=t\wedge s=u\wedge u\)._ Although the additional assumptions that \(u\wedge t=t\wedge u\) and \(u\wedge s=s\wedge u\) are not mandatory, we make these as well so that all the generators of the calculi commute. Based on a private communication [10], these extra assumptions bring the growth of the calculi down from exponential to polynomial. With these additional assumptions, the derivatives of the calculi's basis elements are \(\mathrm{d}s=2s\wedge\theta\), \(\mathrm{d}t=2t\wedge\theta\) and \(\mathrm{d}u=2u\wedge\theta\). For \(A=M_{3}(\mathbb{C})\) and \(B=M_{2}(\mathbb{C})\), an example of a \(B\)-\(A\) bimodule is given by \(E=M_{2,3}(\mathbb{C})\). **Proposition 6.2**.: _Suppose we equip \(A\) with inner calculus as above given by inner element \(\theta=E_{12}s+E_{21}t+E_{33}u\). Then a right zero-curvature connection \(\nabla_{E}:E\to E\otimes_{A}\Omega^{1}_{A}\) satisfying \(\nabla_{E}(e_{0})=0\) for \(e_{0}=\left(\begin{smallmatrix}2&0&0\\ 0&2&0\\ \end{smallmatrix}\right)\) is well-defined and takes the form \(\nabla_{E}(e_{0}a)=e_{0}\otimes\mathrm{d}a\). This connection becomes an extendable bimodule connection by the bimodule map \(\sigma_{E}:\Omega^{1}_{B}\otimes_{B}E\to E\otimes_{A}\Omega^{1}_{A}\) given by \(\sigma_{E}(\mathrm{d}(\begin{smallmatrix}a&b\\ c&d\\ 0&0\end{smallmatrix})=e_{0}\otimes\mathrm{d}\!\left(\begin{smallmatrix}a&b&0\\ c&d&0\\ 0&0&0\end{smallmatrix}\right)\), which satisfies \(\sigma_{E}(s^{\prime}\otimes e_{0})=e_{0}\otimes s\) and \(\sigma_{E}(t^{\prime}\otimes e_{0})=e_{0}\otimes t\)._ **Proof**.: _(1) First we show well-definedness of \(\nabla_{E}\). Observing that \(e_{0}\!\left(\begin{smallmatrix}0&0&0\\ 0&0&0\\ g&h&i\end{smallmatrix}\right)=\left(\begin{smallmatrix}0&0&0\\ 0&0&0\\ 0&0&0\end{smallmatrix}\right)\in E\), the image of this under the linear map \(\nabla_{E}\) must be zero, meaning that the differential must satisfy \(e_{0}\otimes\mathrm{d}\!\left(\begin{smallmatrix}0&0&0\\ 0&0&0\\ g&h&i\end{smallmatrix}\right)=0\in E\otimes_{A}\Omega^{1}_{A}\). Note that this wouldn't be true in the universal calculus. We calculate using the differential above that \([E_{33},E_{3i}]u\big{)}=\left(\begin{smallmatrix}2&0&0\\ 0&2&0\end{smallmatrix}\right)\otimes(E_{3i}-\delta_{i,3}E_{3,3})u=(\begin{smallmatrix} 2&0&0\\ 0&2&0\end{smallmatrix})(E_{3i}-\delta_{i,3}E_{3,3})\otimes u=0\), seeing as nonzero entries of \((E_{3i}-\delta_{i,3}E_{3,3})\) can only lie in the third row, and thus \(\nabla_{E}\) is well-defined. **(2)** Secondly, we calculate \(\nabla_{E}\). We can see that every element of \(E\) is of the form \(e_{0}.a\), since \(e_{0}.M_{3}(\mathbb{C})=M_{2,3}(\mathbb{C})=E\). Therefore, using the Leibniz rule and the assumption \(\nabla_{E}(e_{0})=0\), we calculate the connection as \(\nabla_{E}(e_{0}a)=\nabla_{E}(e_{0}).a+e_{0}\otimes\mathrm{d}a=e_{0}\otimes \mathrm{d}a\). **(3)** Thirdly, the map \(\sigma_{E}\) satisfies \(\sigma_{E}(\mathrm{d}b\otimes e_{0})=\nabla_{E}(be_{0})-b\nabla_{E}(e_{0})\). But \(\nabla_{E}(e_{0})=0\), so \(\sigma_{E}(\mathrm{d}\big{(}\begin{smallmatrix}a&b\\ c&d\end{smallmatrix}\big{)}\otimes e_{0})=\nabla_{E}(\left(\begin{smallmatrix} a&b&0\\ c&d&0\end{smallmatrix}\right))=e_{0}\otimes\mathrm{d}\Big{(}\begin{smallmatrix}a&b&0\\ c&d&0\end{smallmatrix}\Big{)}\) as required. **(4)** Next, we show \(\sigma_{E}(s^{\prime}\otimes e_{0})=e_{0}\otimes s\) and \(\sigma_{E}(t^{\prime}\otimes e_{0})=e_{0}\otimes t\). In the calculus on \(B\), we have \(\mathrm{d}E_{21}=[E_{12},E_{21}]s^{\prime}+[E_{21},E_{21}]t^{\prime}=\left( \begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix}\right)s^{\prime}\), and likewise on the calculus on \(A\). Therefore, using the fact that \(\sigma_{E}\) is a bimodule map and that \(s^{\prime}\) is central and also the formula above for \(\sigma_{E}\),_ \[(\begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix})\sigma_{E}(s^{\prime}\otimes e_{0})=\sigma_{E}(s^{ \prime}\big{(}\begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix}\big{)}\otimes e_{0})=\sigma_{E}(\mathrm{d}E_{21} \otimes e_{0})\] \[=e_{0}\otimes\mathrm{d}\Big{(}\begin{smallmatrix}0&0&0\\ 1&0&0\\ 0&0&0\end{smallmatrix}\Big{)}=e_{0}\otimes\left(\begin{smallmatrix}1&0&0\\ 0&-1&0\\ 0&0&0\end{smallmatrix}\right)s=(\begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix})e_{0}\otimes s.\] _However, as \(\left(\begin{smallmatrix}1&0\\ 0&-1\end{smallmatrix}\right)\) is invertible, this implies \(\sigma_{E}(s^{\prime}\otimes e_{0})=e_{0}\otimes s\). The result \(\sigma_{E}(t^{\prime}\otimes e_{0})=e_{0}\otimes t\) follows similarly by considering \(\mathrm{d}E_{12}=[E_{12},E_{12}]s^{\prime}+[E_{21},E_{12}]t^{\prime}=\left( \begin{smallmatrix}-1&0\\ 0&1\end{smallmatrix}\right)t^{\prime}\). **(5)** Lastly, we show extendability. Since \(B=M_{2}(\mathbb{C})\) is equipped with maximal prolongation calculus, Corollary 5.3 of [1] says that every zero-curvature bimodule connection is extendable. _ Next we show that with this bimodule and connection we do indeed get a fibration. **Proposition 6.3**.: _Suppose \(B=M_{2}(\mathbb{C})\) and \(A=M_{3}(\mathbb{C})\) are equipped with the above calculi. Then the \(B\)-\(A\) bimodule \(E=M_{2,3}(\mathbb{C})\) with the bimodule connection \((\nabla_{E},\sigma_{E})\) from earlier gives a differential fibration, and thus a spectral sequence converging to \(H(A,E,\nabla_{E})=H(M_{3}(\mathbb{C}),M_{2,3}(\mathbb{C}),\nabla_{E})\)._ **Proof.**_For all \(p\geq 0\) the calculi \(\Omega^{p}_{B}=\Omega^{p}_{M_{2}(\mathbb{C})}\) are finitely generated projective and hence flat as modules. The bimodule connection \((\nabla_{E},\sigma_{E})\) satisfies the requirements of having zero curvature and being extendable. The last property we need to show is therefore that the map \(g:\Omega^{p}_{B}\otimes_{B}M_{0,q}\to M_{p,q}\) given by \(g(\xi\otimes[e\otimes\eta])=[(\sigma_{E}\wedge\mathrm{id})(\xi\otimes e \otimes\eta)]\) is an isomorphism. Since \(E=e_{0}.M_{3}(\mathbb{C})\), the forms on \(M_{3}(\mathbb{C})\) of degree \(p\) in the fibre and \(q\) in the base are given by the quotient_ \[M_{p,q}=\frac{\sigma_{E}(\Omega^{p}_{B}\otimes_{B}E)\wedge\Omega^{q}_{A}}{ \sigma_{E}(\Omega^{p+1}_{B}\otimes_{B}E)\wedge\Omega^{q-1}_{A}}\cong\frac{ \sigma_{E}(\Omega^{p}_{M_{2}(\mathbb{C})}\otimes_{M_{2}(\mathbb{C})}e_{0}) \wedge\Omega^{q}_{M_{3}(\mathbb{C})}}{\sigma_{E}(\Omega^{p+1}_{M_{2}(\mathbb{C} )}\otimes_{M_{2}(\mathbb{C})}e_{0})\wedge\Omega^{q-1}_{M_{3}(\mathbb{C})}}.\] _Everything in the numerator is of the form \((s\text{ or }t)^{\wedge(p+q-k)}\wedge u^{\wedge k}.M_{3}(\mathbb{C})\) for some \(0\leq k\leq q\), while everything in the denominator is of the form \((s\text{ or }t)^{\wedge(p+q-k+1)}\wedge u^{\wedge(k-1)}.M_{3}(\mathbb{C})\) for \(0\leq k\leq q\). Since \(u\wedge u=s\wedge t\), it follows that if an element of the numerator has \(k\geq 2\) then it lies in the denominator. But if an element of the numerator has \(k<q\) then it has to lie in the denominator. Therefore \(M_{p,q}=0\) for \(q\geq 2\), and (omitting to write the equivalence classes) a basis of \(M_{p,0}\) is given by \(e_{0}\otimes s^{\wedge r}\wedge t^{\wedge(p-r)}\) for some \(0\leq r\leq p\), while a basis of \(M_{p,1}\) is given by \(e_{0}\otimes s^{\wedge r}\wedge t^{\wedge(p-r)}\wedge u\)._ _In the case \(q=0\), the map \(g\) is given on basis elements as_ \[(s^{\prime})^{\wedge r}\wedge(t^{\prime})^{\wedge(p-r)}\otimes e_{0}\longmapsto e _{0}\otimes s^{\wedge r}\wedge t^{\wedge(p-r)}.\] _The map \(g\) here is an isomorphism, since it just re-arranges the order of the tensor product and and re-labels \(s^{\prime}\) and \(t^{\prime}\), which introduces no new relations. Similarly in the case \(q=1\), the map \(g\) is given on basis elements as_ \[(s^{\prime})^{\wedge r}\wedge(t^{\prime})^{\wedge(p-r)}\otimes e_{0}\otimes u \longmapsto e_{0}\otimes s^{\wedge r}\wedge t^{\wedge(p-r)}\wedge u,\] _which is an isomorphism. _ Next we calculate this limit of the spectral sequence. **Proposition 6.4**.: _The nonzero cohomology groups of \(A\) with coefficients in \(E\) can be calculated via the Leray-Serre spectral sequence as \(H^{0}(A,E,\nabla_{E})\cong\mathbb{C}\), \(H^{1}(A,E,\nabla_{E})\cong\mathbb{C}^{6}\), \(H^{2}(A,E,\nabla_{E})\cong\mathbb{C}^{5}\)._ **Proof**.: _(1) The space \(N_{0}\) is isomorphic to \(e_{0}.A\), which has six-dimensional vector space basis \(e_{0}.E_{ij}\) for \(1\leq i\leq 2\) and \(1\leq j\leq 3\) (i.e. excluding the bottom row). The space \(N_{1}\) is isomorphic to \(e_{0}.A\otimes u\), which has six-dimensional vector space basis \(e_{0}.E_{ij}\otimes u\) for \(1\leq i\leq 2\) and \(1\leq j\leq 3\). Since we showed earlier that \(M_{p,q}=0\) for \(q\geq 2\), this means that all the \(N_{i}=M_{0,i}=0\) for \(i\geq 2\). **(2)** The differential \(\mathrm{d}:N_{0}\to N_{1}\) and is given by \(\mathrm{d}([e_{0}.E_{ij}])=[\nabla_{E}(e_{0}.E_{ij})]=[e_{0}\otimes\mathrm{d}E _{ij}]=[e_{0}.[E_{33},E_{ij}]\otimes u]\). The kernel has four-dimensional basis \([e_{0}.E_{11}]\), \([e_{0}.E_{12}]\), \([e_{0}.E_{21}]\), \([e_{0}.E_{22}]\). The image has two-dimensional basis \([e_{0}.E_{13}\otimes u]\) and \([e_{0}.E_{23}\otimes u]\). **(3)** Consequently \(\hat{H}^{0}(N)\) is four-dimensional with basis elements \([[e_{0}.E_{11}]]\), \([[e_{0}.E_{12}]]\), \([[e_{0}.E_{21}]]\), \([[e_{0}.E_{21}]]\), \([[e_{0}.E_{22}]]\). Also \(\hat{H}^{1}(N)\) is four-dimensional with basis elements \([[e_{0}.E_{11}\otimes u]]\), \([[e_{0}.E_{12}\otimes u]]\), \([[e_{0}.E_{21}\otimes u]]\), \([[e_{0}.E_{22}\otimes u]]\). **(4)** Next we calculate \(\nabla_{0}:\hat{H}^{0}(N)\to\Omega^{1}_{B}\otimes_{B}\hat{H}^{0}(N)\) on the basis elements of \(\hat{H}^{0}(N)\). For \(1\leq i,j\leq 2\) we have \(\nabla_{0}([[e_{0}.E_{ij}]])=g^{-1}([[e_{0}\otimes\mathrm{d}E_{ij}]])\). We calculate_ \[\nabla_{0}(e_{0}.E_{12}) =g^{-1}([[e_{0}\otimes(E_{22}-E_{11})t]])=t^{\prime}\otimes[[e_{0 }.(E_{22}-E_{11})]],\] \[\nabla_{0}(e_{0}.E_{21}) =s^{\prime}\otimes[[e_{0}.(E_{11}-E_{22})]],\] \[\nabla_{0}(e_{0}.E_{11}) =-s^{\prime}\otimes[[e_{0}.E_{12}]]+t^{\prime}\otimes[[e_{0}.E_{21 }]]=-\nabla_{0}(e_{0}.E_{22}).\] _Hence \(\nabla_{0}\) has one-dimensional kernel with basis \([[e_{0}.(E_{11}+E_{22})]]\), and three-dimensional image with basis elements \(t^{\prime}\otimes[[e_{0}.(E_{22}-E_{11})]]\), \(s^{\prime}\otimes[[e_{0}.(E_{11}-E_{22})]]\), \(t^{\prime}\otimes[[e_{0}.E_{21}]]-s^{\prime}\otimes[[e_{0}.E_{12}]]\). **(5)** Next we calculate \(\nabla_{1}:\hat{H}^{1}(N)\to\Omega^{1}_{B}\otimes_{B}\hat{H}^{1}(N)\) on the basis elements of \(\hat{H}^{1}(N)\). For \(1\leq i,j\leq 2\), we have_ \[\nabla_{E}^{[1]}(e_{0}.E_{ij}\otimes u) =\nabla_{E}(e_{0}.E_{ij})\wedge u+e_{0}.E_{ij}\otimes\mathrm{d}u =e_{0}\otimes[\theta,E_{ij}]\wedge u+2e_{0}.E_{ij}\otimes\theta\wedge u\] \[=e_{0}\otimes\left((E_{12}E_{ij}+E_{ij}E_{12})s+(E_{21}E_{ij}+E_ {ij}E_{21})t\right)\wedge u\] \[=\sigma_{E}(s^{\prime}\otimes e_{0}.(E_{12}E_{ij}+E_{ij}E_{12}) )\wedge u+\sigma_{E}(t^{\prime}\otimes e_{0}.(E_{21}E_{ij}+E_{ij}E_{21})) \wedge u.\] _Consequently,_ \[\nabla_{1}([[e_{0}.E_{ij}\otimes u]])=s^{\prime}\otimes[[e_{0}.(E_{12}E_{ij}+ E_{ij}E_{12})\otimes u]]+t^{\prime}\otimes[[e_{0}.(E_{21}E_{ij}+E_{ij}E_{21}) \otimes u]].\] _Using this, we calculate \(\nabla_{1}([[e_{0}.E_{12}\otimes u]])=t^{\prime}\otimes[[e_{0}\otimes u]]\) and \(\nabla_{1}([[e_{0}.E_{21}\otimes u]])=s^{\prime}\otimes[[e_{0}\otimes u]]\) and \(\nabla_{1}([[e_{0}.E_{11}\otimes u]])=s^{\prime}\otimes[[e_{0}.E_{11}\otimes u ]])=t^{\prime}\otimes[[e_{0}.E_{21}\otimes u]]=\nabla_{1}([[e_{0}.E_{22} \otimes u]])\). Hence the kernel of \(\nabla_{1}\) has one-dimensional basis \([[e_{0}.(E_{11}-E_{22})\otimes u]]\), while the image has three-dimensional basis \(t^{\prime}\otimes[[e_{0}\otimes u]]\), \(s^{\prime}\otimes[[e_{0}\otimes u]]\), \(s^{\prime}\otimes[[e_{0}.E_{12}\otimes u]]+t^{\prime}\otimes[[e_{0}.E_{21} \otimes u]]\). **(6)** Next we work out the quotients for cohomology. **(i)** Firstly, \(H^{0}(B,\hat{H}^{0}(N),\nabla_{0})\cong\frac{\ker(\nabla_{0})}{im(0)}\cong{\mathbb{ C}}\). **(ii)** Secondly, \(H^{1}(B,\hat{H}^{0}(N),\nabla_{0})\cong\frac{\Omega^{1}_{B}\otimes\hat{H}^{0}( N)}{im(\nabla_{0})}\). Seeing as \(\Omega^{1}_{B}\) is a free module with two basis elements and \(\hat{H}^{0}(N)\) is four-dimensional, the vector space \(\Omega^{1}_{B}\otimes_{B}\hat{H}^{0}(N)\) is eight-dimensional. The quotient is therefore five dimensional, and an example of a basis of \(\frac{\Omega^{1}_{B}\otimes H^{0}(N)}{im(\nabla_{0})}\) is given by \([s^{\prime}\otimes[[e_{0}.E_{11}]]]\), \([s^{\prime}\otimes[[e_{0}.E_{12}]]]\), \([t^{\prime}\otimes[[e_{0}.E_{11}]]]\), \([t^{\prime}\otimes[[e_{0}.E_{11}]]]\), \([t^{\prime}\otimes[[e_{0}.E_{12}]]]\). Hence \(H^{1}(B,\hat{H}^{0}(N),\nabla_{0})\cong{\mathbb{C}}^{5}\). **(iii)** Thirdly, \(H^{0}(B,\hat{H}^{1}(N),\nabla_{1})\cong\frac{\ker(\nabla_{1})}{im(0)}\cong{ \mathbb{C}}\). **(iv)** Lastly, \(H^{1}(B,\hat{H}^{1}(N),\nabla_{1})\cong\frac{\Omega^{1}_{B}\otimes\hat{H}^{1 }(N)}{im(\nabla_{1})}.\) Seeing as \(\Omega^{1}_{B}\) is a free module with two basis elements and \(\hat{H}^{1}(N)\) is four-dimensional, the vector space \(\Omega^{1}_{B}\otimes_{B}\hat{H}^{1}(N)\) is eight-dimensional. Taking the quotient by the three-dimensional \(\mathrm{im}(\nabla_{1})\) gives a five-dimensional vector space. Hence \(H^{1}(B,\hat{H}^{1}(N),\nabla_{1})\cong{\mathbb{C}}^{5}\). **(7)** Page 2 of the Leray-Serre spectral sequence has entries \(E^{p,q}_{2}=H^{p}(B,\hat{H}^{q}(N),\nabla_{q})\), with \(E^{0,0}_{2},E^{0,1}_{2},E^{1,0}_{2},E^{1,1}_{2}\) as its nonvanishing entries. This is stable already, and hence the nontrivial cohomology groups are the following direct sums along diagonals._ \[H^{0}(A,E,\nabla_{E}) \cong H^{0}(B,\hat{H}^{0}(N),\nabla_{0})\cong{\mathbb{C}}\] \[H^{1}(A,E,\nabla_{E}) \cong H^{1}(B,\hat{H}^{0}(N),\nabla_{0})\oplus H^{0}(B,\hat{H}^{1 }(N),\nabla_{1})\cong{\mathbb{C}}^{5}\oplus{\mathbb{C}}\cong{\mathbb{C}}^{6}\] \[H^{2}(A,E,\nabla_{E}) \cong H^{1}(B,\hat{H}^{1}(N),\nabla_{1})\cong{\mathbb{C}}^{5}.\] The bimodule \(E\) has inner product \(\langle,\rangle:\overline{E}\otimes_{B}E\to A\) given by \(\langle\overline{x},y\rangle=x^{*}y\), where \(*\) is the conjugate transpose map. As matrix algebras are C*-algebras, the KSGNS construction says that the map \(\phi:B\to A\) given by \(\phi(b)=\langle\overline{e_{0}},be_{0}\rangle\) is completely positive. For \(e_{0}=(\begin{smallmatrix}2&0&0\\ 0&2&0\end{smallmatrix})\) then \(\phi\) is not an algebra map, seeing as \(\phi(I_{2})=4I_{3}\neq I_{3}\), and algebra maps have to send the identity to the identity. Moreover, \(\nabla_{E}(e_{0})=0\), so for \(\phi\) to be a cochain map we just need metric preservation, which holds because of the following. Recall that for the right connection \(\nabla_{E}\) on \(E\), we have \(\nabla_{E}(e_{0}a)=e_{0}\otimes{\mathrm{d}}a\), which gives a corresponding left connection \(\nabla_{\overline{E}}\) on \(\overline{E}\) given by \(\nabla_{\overline{E}}(\overline{e_{0}a})={\mathrm{d}}a^{*}\otimes\overline{e_{0}}\), and that the inner product on \(E\) is given by \(\langle\overline{x},y\rangle=x^{-1}y\). Then: \[{\mathrm{d}}{a_{1}}^{*}\langle\overline{e_{0}},e_{0}a_{2}\rangle+ \langle\overline{e_{0}a_{1}},e_{0}\rangle{\mathrm{d}}a_{2}={\mathrm{d}}{a_{1}} ^{*}.e_{0}^{*}e_{0}a_{2}+a_{1}^{*}e_{0}^{*}e_{0}{\mathrm{d}}a_{2}=4{\mathrm{d}}{a _{1}}^{*}.a_{2}+4a_{1}^{*}{\mathrm{d}}a_{2}\] \[=4{\mathrm{d}}{a_{1}^{*}}a_{2}={\mathrm{d}}{a_{1}^{*}}e_{0}^{*}e_{0 }a_{2}={\mathrm{d}}\langle\overline{e_{0}a_{1}},e_{0}a_{2}\rangle.\] Thus by Proposition 2.9, \(\phi\) is a completely positive cochain map, but not an algebra map. ## 7 Bibliography In the following Bibliography the websites listed were last accessed in January 2023, at which time they were all current.

2304.04561

Digitization of the Australian Parliamentary Debates, 1998-2022

Public knowledge of what is said in parliament is a tenet of democracy, and a critical resource for political science research. In Australia, following the British tradition, the written record of what is said in parliament is known as Hansard. While the Australian Hansard has always been publicly available, it has been difficult to use for the purpose of large-scale macro- and micro-level text analysis because it has only been available as PDFs or XMLs. Following the lead of the Linked Parliamentary Data project which achieved this for Canada, we provide a new, comprehensive, high-quality, rectangular database that captures proceedings of the Australian parliamentary debates from 1998 to 2022. The database is publicly available and can be linked to other datasets such as election results. The creation and accessibility of this database enables the exploration of new questions and serves as a valuable resource for both researchers and policymakers.

Lindsay Katz, Rohan Alexander

2023-04-07T17:14:14Z

http://arxiv.org/abs/2304.04561v2

# Digitization of the Australian Parliamentary Debates, 1998-2022 ###### Abstract Public knowledge of what is said in parliament is a tenet of democracy, and a critical resource for political science research. In Australia, following the British tradition, the written record of what is said in parliament is known as Hansard. While the Australian Hansard has always been publicly available, it has been difficult to use for the purpose of large-scale macro- and micro-level text analysis because it has only been available as PDFs or XMLs. Following the lead of the Linked Parliamentary Data project which achieved this for Canada, we provide a new, comprehensive, high-quality, rectangular database that captures proceedings of the Australian parliamentary debates from 1998 to 2022. The database is publicly available and can be linked to other datasets such as election results. The creation and accessibility of this database enables the exploration of new questions and serves as a valuable resource for both researchers and policymakers. ## 1 Background & Summary The official written record of parliamentary debates, formally known as Hansard, plays a fundamental role in capturing the history of political proceedings and facilitating the exploration of valuable research questions. Originating in the British parliament, the production of Hansard became tradition in many other Commonwealth countries, such as Canada and Australia (Vice and Farrell 2017). Given the content and magnitude of these records, they have significance, particularly in the context of political science research. In the case of Canada, the Hansard has been digitized for 1901 to 2019 (Beelen et al. 2017). Having a digitized version of Hansard enables researchers to conduct text analysis and statistical modelling. Following the lead of that project, in this paper we introduce a similar database for Australia. This is composed of individual datasets for each sitting day in the House of Representatives from 1998 to 2022, containing details on everything said in parliament in a form that can be readily used by researchers. With the development of tools for large-scale text analysis, this database will serve as a resource for understanding political behaviour in Australia over time. The Australian House of Representatives 'the House' performs a number of crucial governmental functions, such as creating new laws and overseeing government expenditure (House of Representatives 2018, ch. 1). Politicians in the House are referred to as Members of Parliament (MPs). The House operates under a parallel chamber setup, meaning there are two debate venues where proceedings take place: the Chamber, and the Federation Chamber. Sittings of the House follow a predefined order of business, regulated by procedural rules called standing orders (House of Representatives 2018, ch. 8). A typical sitting day in the Chamber has a number of scheduled proceedings including debates on government business, 90 second member statements, and Question Time (House of Representatives 2018, ch. 8). The Federation Chamber was created in 1994 as a subordinate debate venue of the Chamber. This allows for better time management of House business as its proceedings occur simultaneously with those of the Chamber (House of Representatives 2018, ch. 21). Sittings in the Federation Chamber are different to those of the Chamber in terms of their order of business and scope of discussion. Business matters discussed in the Federation Chamber are limited largely to intermediate stages of bill development, and the business of private Members (House of Representatives 2018, ch. 21). It is the recording and compilation of these proceedings on which Hansard is based, and it is essentially, but not entirely, verbatim. A week or so after each sitting day, a transcript is available for download from the official Parliament of Australia website in both PDF and extensible markup language (XML) form. The PDF is the official release. The PDF imposes formatting designed for humans to read with ease, whereas XML is designed for consistency and machine legibility. The nature of XML enables us to more easily use code to manipulate these records at scale, motivating our choice to develop our database solely using the XML formatted files. In cases where we were unsure on how to proceed with processing the XML, we defer first to the PDF, and then to the video recording of the proceeding, if available. At present, the Hansard format that is available on the Parliament of Australia website is not accessible for large scale analysis. To this point, various researchers have had to create their own databases of usable, complete data based on content from the Australian Parliament website. For instance, Sherratt (2016) created an online, easy to read database of Hansard from 1901 to 1980 using the XML files. These data can be navigated by year, parliament, people, and bills (Sherratt 2016). To make the Australian Parliamenty Handbook more accessible, Leslie (2021) has released an R package which includes data on all MPs from 1945 to 2019. Further, Alexander and Hodgetts (2021) created the AustralianPoliticians R package, which contains several datasets related to the political and biographical information of Australian federal politicians who were active between 1901 and 2021. Many papers exist which use components of Australian Hansard to explore various research topics. For example, Salisbury (2011) used the Hansard to investigate occurrences of unparliamentary comments by MPs, where the Speaker tells that MP to withdraw their remark. Rasiah (2010) worked with Question Time data from Hansard transcripts during February and March of 2003, to investigate resistance of politicians in answering questions about Iraq. Fraussen, Graham, and Halpin (2018) use Hansard to quantify political prominence by investigating strategic mentions of interest groups by elected officials. Finally, Alexander and Alexander (2021) construct a dataset of the Australian Hansard, along with an analysis of the effect of elections and changes in Prime Ministers upon topics mentioned in parliament. Alexander and Alexander (2021) created this database with the static PDF versions of Hansard, using OCR to digitize these files into text which is suitable for analysis. This means there are considerable digitization errors especially in the first half of the dataset. While there is evidently a growing body of literature on this topic, there is still no comprehensive database for Australian Hansard based on XML that spans from 1901 to the present day. Our work begins to bridge this gap. ## 2 Methods Our database contains one comma-separated value (CSV) file and one parquet file for each sitting day of the House of Representatives from 02 March 1998 to 08 September 2022. We developed four scripts to produce these files. Each script parses Hansard documents from a specific portion of the 1998 to 2022 time frame. This section is structured as follows. First, we provide an overview of our approach to understanding and parsing an individual Hansard XML document, which informed the scripts used to create our database. This will be supplemented with an excerpt from a Hansard XML to provide a visual example of its structure. Next we will explain the specific differences between the scripts, and outline what structural changes necessitated their separate development. We then provide details on the methodological intricacies of three core components of Hansard proceedings: Question Time, interjections, and stage directions. Finally, we discuss the script we developed to fill in remaining missing details on the MP speaking, which each file in our database was passed to after being parsed and cleaned. ### Overview The approach to parsing contents of an XML document depends on its tree structure. As such, to create this database, we started by looking at a single Hansard XML transcript from 2019. Doing so enabled us to identify the various components of interest in the document, and how each one can be parsed according to its corresponding structural form. Parsing was performed in R using the XML and xml2 packages (Temple Lang, 2022; Wickham, Hester, and Ooms, 2021). Focusing on one transcript also allowed us to ensure that all key components of the transcript were parsed and captured in as much detail as possible. The typical form of a Hansard XML transcript is summarized in the nested list below. This provides an overview, but does not contain every possible nested element that may be found in a Hansard XML. <hansard> 1. <session.header> 2. <chamber.xscript> a) <business.start> b) <debate> i. <debateinfo> ii. <debate.text> iii. <speech> iv. <subdebate.1> (1) <subdebateinfo> (2) <subdebate.text> (3) <speech> (4) <subdebate.2> (a) <subdebateinfo> (b) <subdebate.text> (c) <speech> 3. <fedchamb.xscript> 4. <answers.to.questions> a) <question> b) <answer> The outer-most node, also known as the parent node, is denoted <hansard> and serves as a container for the entire document. This parent node may have up to four child nodes, where the first child node contains details on the specific sitting day. Next, <chamber.xscript> contains all proceedings of the Chamber, <fedchamb.xscript> contains all proceedings of the Federation Chamber, and <answers.to.questions> contains Question Time proceedings. The Federation Chamber does not meet on every sitting day, so this child element is not present in every XML file. The use of separate child nodes allows for the distinction of proceedings between the Chamber and Federation Chamber. The structure of the <chamber.xscript> and <fedchamb.xscript> nodes are generally the same, where the proceeding begins with <business.start> which is followed by a series of debates. Debate nodes can contain a <subdebate.1> child node which has a <subdebate.2> child node nested within it. That said, sometimes <subdebate.2> is not nested within <subdebate.1>. Each of these three elements (i.e. <debate>, <subdebate.1>, and <subdebate.2>) as well as their respective sub-elements contain important information on the topic of discussion, who is speaking, and what is being said. The <speech> node within each one contains the bulk of the text associated with that debate or sub-debate. A typical <speech> node begins with a <talk.start> sub-node, providing information on the MP whose turn it is to speak and the time of their first statement. Unsurprisingly, speeches rarely go uninterrupted in parliamentary debate settings -- they are often composed of a series of interjections and continuations. These statements are categorized under different sub-nodes depending on their nature, such as <interjection> or <continuation>. The final key component of Hansard is Question Time, in which questions and answers are classified as unique elements. More detail on the purpose and processing of Figure 1 provides an example of the beginning of an XML file for Hansard, which illustrates the structure outlined in the nested list above. As stated, the XML structure begins with a parent element <hansard> (highlighted in blue), followed by a child element <session.header> (highlighted in yellow) with sub-child elements such as the date and parliament number, which are all highlighted in pink. Next, there is the child element containing everything that takes place in the Chamber, <chamber.xscript>, which is also highlighted in yellow in Figure 1. As previously mentioned, the first sub-node of <chamber.xscript> is <business.start>. The structure of this can be seen between the nodes highlighted in green in Figure 1, where the content we parse from the business start is highlighted in orange. Evidently, the nature of XML formatting means that different pieces of information are categorized under a series of uniquely named and nested nodes. As a result, to parse each piece of information, one must specify the unique hierarchy of the nodes in which it is structured. This is known as an XPath expression, and tells the parser how to navigate the XML document to obtain the desired information. For example, the session header date in Figure 1 can be accessed using the XPath expression "hansard/session.header/date". When specifying an XPath expression, one can use an "or" operator to obtain elements from multiple node paths at once, in the order that they appear in the document. We did so throughout our script as we parsed uniquely nested speech content. This allows the correct ordering of elements to be maintained. We began our first script by parsing all the business start, speech text, and Question Time contents contained in the XML document, using these unique XPath expressions to do so. The next step was to further develop our script to produce tidy data sets, as defined and Figure 1: Snapshot of the beginning of the XML file for Hansard on 25 February 2020 introduced by Wickham (2014). These contain all parsed text elements, where each statement is separated onto its own row with details about the MP who is speaking, and rows are maintained in chronological order. This first involved correcting the variable classes and adding several indicator variables to differentiate where statements came from, such as Chamber versus Federation Chamber or <subdebate.1> versus <subdebate.2>. The next key task stemmed from the fact that the raw text data were not separated by each statement when parsed. In other words, any interjections, comments made by the Speaker or Deputy Speaker and continuations within an individual speech were all parsed together as a single string. As such, the name, name ID, electorate and party details were only provided for the person whose turn it was to speak. There were many intricacies in the task of splitting these speeches in a way that would be generalizable across sitting days. Details on these are provided in Section 2.4. Since we are looking at a wide time span of documents, there are many changes in the way they are formatted. These became apparent as we ran our script on XML files from earlier sitting days. Some changes are as subtle as a differently named child node, while others are as extensive as a completely different nesting structure. Smaller changes were accounted for as we became aware of them, and embedded into the code in a way that would not cause issues for parsing more current Hansards with subtle differences in formatting. However, as mentioned, more significant changes in the XML structure of Hansard are what necessitated the development of separate scripts as we worked backwards. Further not every sitting day contains every possible XML element. For example, some days did not have <subdebate.2> content, and some days did not have a Federation Chamber proceeding. To improve the generalizability of these scripts, if-else statements were embedded within the code wherever an error might arise due to a missing element. For example, the entire Federation Chamber block of code is wrapped in an if-else statement for each script, so that it only executes if what the code attempts to parse exists in the file. Once the script ran without error for a few recent years of Hansard, we continued to work backwards until extensive changes in tree structure made our script incompatible with parsing earlier XML files. The earliest sitting day this first script can successfully parse is 14 August 2012. Before developing new scripts to parse earlier Hansard documents, we prioritized cleaning and finalizing what we had been able to parse. As such we continued building our script, fixing any problems we noticed in the resulting datasets such as excess whitespace or spacing issues, and splitting up any additional sections of the parsed text onto separate rows where necessary. Specifically, we added a section of our script to separate out general stage directions. More information on this separation will be provided in Section 2.5. After completing our first script, it was formatted as a function which takes a single file name argument and produces one CSV file containing data on all proceedings from the given sitting day. ### Script Differences As mentioned, we developed a total of four scripts to parse the 1998-2022 time frame of Hansard documents. Two main factors motivated us to create four scripts as opposed to just one, the first being structural variation in XML over time, and the second being improved computational efficiency with separate scripts. While all four scripts use the same general approach to parsing described in Section 2.1 and produce the same CSV structure, the first and second scripts use a different method of data processing than the third and fourth scripts. The need for a second script stems from the fact that when established in 1994, the Federation Chamber was originally named the Main Committee. The Main Committee was renamed to the Federation Chamber in mid-2012 (House of Representatives 2018, ch. 21). As a result, the child node under which Federation Chamber proceedings are nested is named <maincomm.xscript> in all XML files prior to 14 August 2012. Having developed our first script based on Hansard from recent years, all XPath expressions contain the <fedchamb.xscript> specification. To avoid causing issues in our first script which successfully parses about 10 years of Hansard, we created a second script where we replaced all occurrences of <fedchamb.xscript> with <maincomm.xscript>. After making this modification and accounting for other small changes such as time stamp formatting, this second script successfully parses all Hansard sitting days from 10 May 2011 to 28 June 2012 (inclusive). While the modifications needed to develop the second script were straightforward, this was not the case for our next script. The typical tree structure of Hansard XMLs spanning from 1998 to March 2011 has an important difference from that of XMLs released after March 2011, necessitating many changes to be made in our methodology. In XMLs after March 2011, which our first two scripts successfully parse, the first two child nodes of <speech> are typically <talk.start>, and <talk.text>. The first child node contains data on the person whose turn it is to speak, and the second contains the entire contents of that speech -- including all interjections, comments, and continuations. After the <talk.text> element closes, there are typically a series of other child nodes which provide a skeleton structure for how the speech proceedings went in chronological order. For example, if the speech began, was interrupted by an MP, and then continued uninterrupted until the end, there would be one <interjection> node and one <continuation> node following the <talk.text> node. These would contain details on the MP who made each statement, such as their party and electorate. In contrast, the speech contents in XMLs from 1998 up to and including 24 March 2011 are nested differently -- there is no <talk.text> node. Rather than this single child node that contains all speech content, statements are categorized in individual child nodes. This means that unlike our code for parsing more current Hansards, we cannot specify a single XPath expression such as "chamber.xscript//debate//speech/talk.text" to extract all speeches, in their entirety, at once. This difference in nesting structure made many components of our second script unusable for processing transcripts preceding 10 May 2011, and required us to change our data processing approach considerably. Since the earlier Hansard XMLs do not have a <talk.text> node, we found that the most straightforward way to preserve the ordering of statements and to parse all speech contents at once was to parse from the <debate> element directly. The reason we did not use its <speech> child node is because every speech has a unique structure of node children, and this makes it difficult to write code for data cleaning which is generalizable across all speeches and sitting days. The challenge with parsing through the <debate> element is that every piece of data stored in that element is parsed as a single string, including all <talk.start> data, and all nested sub-debate data. For example, the data shown in Figure 2 would be parsed as a single string preceding the speech content, like so: This was not isolated to just the beginning of speeches -- details on individuals interjecting or commenting during speeches were also captured this way. To separate statements correctly, we collected all of these patterns using the <talk.start> node, and used them to split statements wherever one of these patterns was found. After separating the statements, we were able to remove these patterns from the body of text. We also used this method of extracting and later removing unwanted patterns for other pieces of data which did not belong to the debate proceedings, such as sub-debate titles. Once we finalized this new method of processing the data, we proceeded with data cleaning using the same general approach as in the first two scripts to produce the same structure of CSV output. We then worked backwards in time and modified the code as needed for generalizability. Throughout this process we found many transcription errors present in the XMLs from earlier years. We fixed these manually, deferring to the official release to ensure the correct information was filled in. Since there were a number of transcription errors specific to the 2000s, we chose to create a fourth script for parsing 1998 and 1999. This allowed us to remove all the code which was needed to resolve specific transcription errors of the 2000s, to avoid an overly long script and in turn improving computational efficiency. As such, our fourth script is essentially the same as the third, with the only difference being that it has code specific to fixing transcription errors from 1998 and 1999. Figure 2: Portion of XML file for Hansard on 12 December 2002 ### Question Time A key characteristic of the Australian parliamentary system is the ability for the executive government to be held accountable for their decisions. One core mechanism by which this is achieved is called Question Time. This is a period of each sitting day in the Chamber where MPs can ask ministers two types of questions: questions in writing which are written in advance, or questions without notice which are asked verbally in the Chamber and are responded to in real time (House of Representatives 2021). Questions without notice are included directly in the "chamber.xscript" child node, with sub-child nodes called "question" and "answer" to differentiate the two. Questions in writing, however, are embedded in their own child node called "answers.to.questions" at the end of the XML file. Our approach to parse the "chamber.xscript" speeches used in all four scripts meant that all questions without notice content was already parsed in order. For the first two scripts, questions and answers were already separated onto their own rows. For the third and fourth scripts, just as we did with the rest of the speech content, we used those patterns of data preceding the text to separate questions and answers. Finally, since questions in writing exist in their own child node we were able to use the same parsing method for all scripts, which was to extract all question and answer elements from the "answers.to.questions" child node. We then added binary flags to differentiate between questions and answers. To do this in the first and second scripts, we separately re-parsed question and answer content using the XPath expressions "chamber.xscript//question" and "chamber.xscript//answer", added the correct question and answer flags accordingly, and then added those flags back to the main dataframe based on exact text matches. For the third and fourth scripts, we made use of the fact that the patterns preceding text transcribed under a question node were stored separately from those transcribed under an answer node. As a result, we could readily use those patterns to flag questions and answers correctly based on which list of patterns it belonged to. Sometimes, questions were incorrectly transcribed under an answer node and vice-versa, in which cases we manually corrected the question and answer flags. For instance, we check for any statements flagged as questions which include the phrase "has provided the following answer to the honourable member's question", in which case we re-code that statement as an answer. The next step was to merge Question Time contents with all the debate speech. Our method of parsing meant that everything was already in order, so we did not have to perform any additional merging. For questions in writing, merging this content was also straightforward due to the fact that it is always at the end of Hansard. This means that we could bind question in writing rows to the bottom of the main dataframe. This approach was used for all four scripts. ### Interjections As mentioned, the text was structured and parsed in such a way that various interjections and comments which happened during a speech were not separated onto individual rows. This was the case across the entire time frame of documents. We will first discuss the methodology employed to split interjections in the first and second scripts, as it informed our approach for the third and fourth scripts. Below is an example of part of a speech we would need to split, extracted from Hansard on 30 November 2021, where Bert van Manen is interrupted by the Speaker who states that the time for members' statements has concluded. "Mr VAN MANEN (Forde--Chief Government Whip) (13:59): It's a great pleasure to share with the House that Windaroo Valley State High School has qualified for the finals of the Australian Space Design Competition, to begin in January next year. The competition is regarded as the premier STEM competition for high school students and is recognised by universities around the country. The students are required to respond to industry-level engineering and requests for tender for design and--The SPEAKER: Order! In accordance with standing order 43, the time for members' statements has concluded." We want each statement on its own row with the correct name, name ID, electorate and party information on the individual speaking. We approached this task in a number of steps. Once all parsed text from the XML was merged into one dataframe called main, our first step was to add a "speech_no" variable. This was done to keep track of which speech each interjection, comment, or continuation belonged to as we separated these components onto their own rows. The next step was to extract all the names and titles preceding these interjections, comments and continuations. This would enable us to then separate the speeches in the correct places using these names and titles in combination with regular expressions, which are patterns of characters that can be used to search bodies of text. We completed this extraction process with a few intermediate steps, due to the large number of name styles and interjection types that had to be accounted for, each requiring their own unique regular expression format. As mentioned in Section 2.2, more recent years of Hansard XMLs contain a series of child nodes which exist to capture the structure of interruptions in that speech. Figure 3 provides an example of this, where the speech was interrupted by a comment from the Deputy Speaker, and then the MP continued their speech. Looking at the element names highlighted in blue, these child nodes do not contain the actual text for the interjection or continuation -- this text is embedded within the speech above it. However, as shown by the content highlighted in pink in Figure 3, we were able to extract useful details on the individual interjecting which we could use later. Making use of this structure, we extracted names and information of all individuals that were categorized within the XML as interjections. We stored this as a dataframe called "interject". We decided not to include this data in our final database, as it is embedded in our resulting datasets which have a flag for interjections. We then created lists using both the interject and main dataframes to capture all the names of individuals who spoke that day. We added the names of all MPs in a number of unique formats, due to the frequent variation in how names are transcribed in Hansard. When an MP interjects or continues a speech, the usual form of their name is a title followed by their first name or first initial and/or last name. There is also variation in the capitalization of these names.1 Another source of variation is in individuals with more than one first name, as sometimes only their initial first name is written, while other times their entire first name is written. Additionally, some surnames have punctuation, and some surnames have specific capitalization such as "McCormack", where even in full capitalization, the first "c" remains lower case. This variation demands careful consideration when writing regular expression patterns. In these lists we also accounted for any general interjection statements that were not attributed to an individual, such as "An opposition member interjecting-". Footnote 1: Sometimes when someone’s first name is included, only their last name is capitalized, while sometimes their full name is capitalized, or other times neither are capitalized. Having these lists enabled us to extract the names of MPs and their associated titles as they exist in the text, by searching for exact matches with regular expression patterns. We then used these extracted names to split all the speeches, using regular expressions with lookarounds. A lookaround can be added to a regular expression pattern to enhance the specificity of matches. Figure 3: Snapshot of XML structure with interjection and continuation from 03 February 2021 Hansard These were used to ensure that the text was not being split in the wrong places, such as places where MPs were being named in the statement of another MP. Once all interjections, comments and continuations were successfully split onto their own rows using the lists we created, we did one final check for any additional names that were not captured in these lists. To do so, we searched for any remaining name matches in speech bodies with general regular expressions and lookarounds, and separated text using those matches when found. We then added an order variable to the dataset based on row number, to keep track of the order in which everything was said. The next step was to fill the name, name ID, electorate and party variables with the correct data for each row. We also wanted to add the gender and unique identifier for each individual as found in the AustralianPoliticians package. To do so, we created a lookup table, which contained the unique incomplete form in which the name was transcribed, and the corresponding full name, name ID, electorate, party, gender, and unique ID for that individual. Figure 4 provides an example of this. We used the main dataset from the AustralianPoliticians package in the creation of each lookup table (Alexander and Hodgetts 2021). Next, we merged our main dataframe with the lookup table to replace any incomplete names with their full names, and to fill in any gaps with available name ID, electorate, party, gender, and unique ID information. Finally, we were able to add a flag for interjections. Grouping our data by the speech number, we defined an interjection as a statement made by anyone who is not the Speaker, the Deputy Speaker, or the MP whose turn it was to speak. Figure 5 provides an example of a Federation Chamber proceeding with interjections. Statements made by the MP whose turn it was to speak, or by the Deputy Speaker Maria Vamvakinou, are not flagged as interjections. Having developed a successful methodology for splitting interjections, we used this to inform our general approach in the third and fourth scripts. However, the difference in data cleaning used Figure 4: First 10 rows of the lookup table from 19 October 2017 Hansard processing Figure 5: Example of speech with interjections from 21 November 2016 Hansard in these scripts necessitated some departure from the original methodology. As discussed in Section 2.2, we used string patterns extracted from <talk.start> nodes to separate speeches. As evident in Figure 3, <talk.start> nodes are nested within <interjection> nodes, meaning that the patterns of data from interjection statements were separated out in the process. In other words, our approach to data cleaning in the third and fourth scripts separated out interjections in the process. This meant that we did not need to create lists of names and titles for which to search in the text as we did before. However, we used the same list of general interjection statements on which to separate as was used in the first two scripts. We then did an additional check for statements that may have not been separated due to how they were embedded in the XML, and separated those out where needed.2 Footnote 2: While most statements were categorized in their own child node and hence captured through pattern-based separation, some were not individually categorized, and had to be split manually in this step. We then proceeded to clean up speeches and fill in correct details on the MP speaking. While we used the same lookup table approach as before, we did so in combination with another means of filling in these details. The patterns parsed from <talk.start> nodes contain important data on the MP making each statement. As such, we could extract those data associated with each pattern by parsing one element inward, using the XPath expression "talk.start/talker". We created a pattern lookup table with these data, and merged it with the main Hansard dataframe by the first pattern detected in each statement. Figure 6 provides an example of that lookup table. This approach enabled us to fill in missing data on each MP speaking using data extracted directly from the XML. Finally, we then used the AustralianPoliticians dataset to fill in other missing data, and flagged for interjections in the same manner as before. ### Stage Directions When building our first scripts, one of the final components needed was to separate general stage directions out from statements made by MPs. Stage directions are general statements included in the transcript to document happenings in parliament. Examples of stage directions are "Bill read a second time", "Question agreed to", or "Debate adjourned". It was unclear to us from the XML and PDF who exactly these statements were attributed to. For further clarification, we watched portions of the video recording for some sitting days, and noticed that while these statements are documented in Hansard, they are not explicitly stated in parliament. For example, when the Deputy Speaker says "The question is that the bill be now read a Figure 6: 10 rows of the pattern lookup table from 12 December 2012 Hansard processing second time", MPs vote, and if the majority is in favour, they proceed reading the bill the second time. This vote and second reading is not explicitly transcribed, rather what is written is: "Question agreed to. Bill read a second time". For this reason, we filled the name variable for these statements with "stage direction". Stage directions were not flagged as interjections. These stage directions are not defined differently from the regular debate speech in the XML, meaning we had to manually create a list of stage directions to separate out of the speeches. We built this list of stage directions as we worked backwards in parsing Hansard, and took the same approach across all four scripts. ### Filling Missing Details While we did our best to maximize the completeness of the files in our database as they were processed in the initial four scripts, there were still a number of rows in which details on the person speaking were missing, or the name transcribed for that individual was in a short form (i.e. "Mr Abbott" instead of "Abbott, Tony, MP"). This was a particularly frequent occurrence for sitting days where an MP spoke whose surname was shared by any other past or present MP, and automated filling of their details using data from the AustralianPoliticians package was avoided to prevent any incorrect detail attribution. In an effort to improve as many of these as possible, we developed a script which identifies short-form names belonging to people with common surnames in each CSV, looks for the full version of that individuals name if available in that same CSV file, and replaces the short-form name with the full name, and fills the rest of the MP details in accordingly with data from the AustralianPoliticians package. This script does the same for anyone who does have a unique surname but is still missing the full name form or any gender, unique ID, name ID, party or electorate details. Each file in our database passed through this script after being created, to ensure it is as complete as possible. Due to the fact that the names of MPs with common surnames were not all in their complete form when we flagged for interjections the first time, it was possible that the name of the MP whose turn it was to speak was transcribed in different forms within their speech. For example, "Smith, Tony, MP" at the start and then "Mr Smith" later on in the speech. By the nature of how we flagged for interjections, this means that rows where the short form like "Mr Smith" is the name would be flagged as an interjection, which is incorrect. To fix this, we re-flagged interjections using the same definition as before, once all names were filled in with this script. ## 3 Data Records Our database is available in both CSV and parquet formats. It covers all sitting days of the House of Representatives from 02 March 1998 to 08 September 2022, so there are 1,517 files for each format. All data records are available on the general-purpose repository Zenodo, at [https://doi.org/10.5281/zenodo.7336075](https://doi.org/10.5281/zenodo.7336075) (Katz and Alexander 2023). For each file, each row contains an individual statement, with details on the individual speaking. For general statements transcribed as made by "Honourable members" for example, these variables cannot be specified. Table 1 provides an overview of each variable found in the database. The name, page.no, time.stamp, name.id, electorate, party, in.gov, first.speech, and body variables all came directly from the XML contents. In addition to these variables, we added a number of flags to enable easy filtering of statements. For example, adding the fedchamb_flag provides a clear distinction between the proceedings of the Chamber with those of the Federation Chamber. As well, the sub1_flag and sub2_flag variables allow us to keep track of where various statements are being parsed from in the XML document. The question, answer, and q_in_writing flags were added to identify statements belonging to Question Time, and the nature of these statements. We also flagged for interjections (interject), and the div_flag variable was added to flag when a division is called for. The gender and uniqueID variables were added based on the main dataset from the AustralianPoliticians package. Details on the usage of uniqueID will be provided in Section 6. Further, the speech_no variable \begin{table} \begin{tabular}{l l} \hline \hline Variable & Description \\ \hline name & Name of speaker \\ order & Row number \\ speech\_no & Speech number \\ page.no & Page number statement can be found on in official Hansard \\ time.stamp & Time of statement \\ name.id & Unique member identification code, based on the Parliamentary Handbook \\ electorate & Speaking member’s electorate \\ party & Speaking member’s party \\ in.gov & Flag for in government (1 if in government, 0 otherwise) \\ first.speech & Flag for first speech (1 if first speech, 0 otherwise) \\ body & Statement text \\ fedchamb\_flag & Flag for Federation Chamber (1 if Federation Chamber, 0 if Chamber) \\ sub1\_flag & Flag for sub-debate 1 contents (1 if sub-debate 1, 0 otherwise) \\ sub2\_flag & Flag for sub-debate 2 contents (1 if sub-debate 2, 0 otherwise) \\ question & Flag for question (1 if question, 0 otherwise) \\ answer & Flag for answer (1 if answer, 0 otherwise) \\ q\_in\_writing & Flag for question in writing (1 if question in writing, 0 otherwise) \\ div\_flag & Flag for division (1 if division, 0 otherwise) \\ gender & Gender of speaker \\ uniqueID & Unique identifier of speaker \\ interject & Flag for interjection (1 if statement is an interjection, 0 otherwise) \\ \hline \hline \end{tabular} \end{table} Table 1: Summary and description of variables in our database allows us to keep track of the speech number that each statement and interjection belongs to. Having the speech number variable offers an easy way to group statements by speech or isolate specific speeches of interest. Finally, the order variable was added to maintain the order of proceedings. ## 4 Technical Validation We developed a script to perform automated tests on each file in our database, to enhance its quality and consistency. Our first test validates that the date specified in each file name matches the date specified in its corresponding XML session header.3 Every file passed this test, and we detected one discrepancy in an XML file from 03 June 2009, where its session header contained the wrong date. We validated that our file name and date was correct by checking the official PDF release from that sitting day. Footnote 3: As seen in Figure 1, the first child node of the <session.header> element is the date. The second test is designed to test for duplication errors in the data, by checking whether two lines that immediately follow each other have the same body (i.e. spoken content). This test detected 129 dates on which duplicate statements were made, and one immediately follows the other. Note that this test does not account for who is making each statement, meaning one MP repeating the words of another MP would be picked up in this test as well. We checked a sample of 40% of these duplicates, and manually validated that they are all repeated statements that do exist and are transcribed closely together in that day's XML file, and by our method should be parsed such that one of these statements is immediately followed by the other. When an MP runs out of allotted time for their speech, Hansard editors transcribe "(Time expired)" after their final word. As a means of checking that we have separated speeches out correctly, our third test checks that when the phrase "(Time expired)" exists in a body of text, it exists at the very end. When this is not the case, we know that we have missed the separation of the next statement onto its own row, and could fix this accordingly. The remaining tests focus on the MPs present on each sitting day. Our fourth test checks that there is one unique party and electorate attributed to each individual on each sitting day. As we parsed Hansard further back in time, we found a number of cases where an individual was associated with the wrong electorate or party due to transcription errors. When we found these data errors we corrected them based on the official release. This test provides us with an automated way to catch these errors and correct them at scale. Next, we test that the unique name identification code attributed to each individual is found in the Australian Parliamenty Handbook. We do so using the ausPH package. This test serves as another means to correct for transcription errors, this time in the case of name IDs. We found and corrected for a number of common name ID transcription errors detected by this test, such as a capital letter "O" in place of a zero. Our sixth test checks that on any given sitting day, the individuals identified are alive. To do so, we utilized the main dataset from the AustralianPoliticians package which contains the birth and where applicable death dates for every politician. This test confirmed that all MPs who are detected to speak on each sitting day are not deceased. Finally, our seventh test validates that all individuals speaking are MPs on that particular day. We use the mps dataset from the AustralianPoliticians package which has the dates when each MP was in parliament. Using these dates, we check that each person speaking on each sitting day is in fact an MP on that day. ## 5 Next Steps While our database makes a substantial contribution to the field, there are a few areas for future development. One important contribution would be to take advantage of similar records that exist for the Senate over this same period and add them to our database. The main challenge of this would be accounting for different parliamentians, but the broad structures would be similar, making many elements of our code and methodology applicable to this work. Earlier House of Representatives records also exist, and would be valuable to include in future versions of our database. In some cases however it is difficult to get XML records for certain dates, and the earlier decades would require more cleaning and likely additional script development to account for changes in structural formatting. Having completed this work, we recognize components of our scripts which could be developed in a more computationally efficient manner such as our approach to splitting interjections and filling in MP details. In future, it would be beneficial to review our methodological approach to these steps, and consider approaches which are more concise where appropriate. Finally, Hansard records contain a number of statements throughout that were not explicitly spoken in parliament. For example, the text in Figure 7 beneath the bold subtitle "Report from Federation Chamber" is not attributed to a particular MP and was not spoken aloud during the parliamentary proceedings. In contrast, the text which comes afterward was spoken aloud in parliament by the Speaker at 14:01. Generally, unspoken text is nested under <debate.text> or <subdebate.text> nodes, while spoken text is categorized under <speech>. Importantly, in our work we focus primarily on parsing spoken speech content (i.e. what is nested within <speech> nodes), such as what is stated by the Speaker in Figure 7. For this reason, many Hansard transcriptions which are not spoken text may not be captured in our database. In future work, capturing this unspoken content in our database would be a priority. ## 6 Usage Notes To enhance the usability of our database, we added a uniqueID variable to each file. This serves as a unique identifier for each speaking MP, and comes from the uniqueID variable present within data from both the AustralianPoliticians and AustralianElections R packages (Alexander and Hodgetts 2021; Alexander 2019). By including this variable, one can readily integrate our data records with those available in these two packages. Further, the name.id variable found in each file is another unique identifier for each MP. This variable was parsed directly from the Hansard XML files, and can be found in the Australian Parliamentary Handbook. As such, our data records can be integrated with those from the ausPH package which provides datasets for contents of the Australian Parliamentary Handbook (Leslie 2021). This will allow for convenient extraction of further details on each MP in a tidy, ready to analyze format. ## 7 Code Availability The code written to build this database is available on the GitHub repository associated with this paper: [https://github.com/lindsaykatz/hansard-proj](https://github.com/lindsaykatz/hansard-proj). All scripts were created using R software (R Core Team 2022). The core packages used to develop these scripts are: the XML package by Temple Lang (2022), the xml2 package by Wickham, Hester, and Ooms (2021), the tidyverse R packages by Wickham et al. (2019), the AustralianPoliticians package by Alexander and Hodgetts (2021), and the ausPH package by Leslie (2021). XML and xml2 were used for parsing the XML documents, AustralianPoliticians and ausPH were used for Figure 7: Snapshot from page 7129 of the PDF file for Hansard on 26 March 2013 cleaning up and filling in MP details in the datasets, and tidyverse packages were used in all steps, for tidy wrangling of data. ## 8 Acknowledgements We thank Kristine Villaluna, Monica Alexander, and Jack Stephenson for helpful comments. ## 9 Author Contributions LK developed and implemented the code to obtain, create, and test, the datasets and wrote the first draft of the paper. RA conceptualized and designed the study, and contributed writing. Both authors approved the final version. ## 10 Competing Interests The authors declare no competing interests.

2307.12653

Unidirectional spin wave emission by travelling pair of magnetic field profiles

We demonstrate that the spin wave Cherenkov effect can be used to design the unidirectional spin wave emitter with tunable frequency and switchable direction of emission. In our numerical studies, we propose to use a pair of traveling profiles of the magnetic field which generate the spin waves, for sufficiently large velocity of their motion. In the considered system, the spin waves of shorter (longer) wavelengths are induced at the front (back) of the moving profiles and interfere constructively or destructively, depending on the velocity of the profiles. Moreover, we showed that the spin waves can be confined between the pair of traveling profiles of the magnetic field. This work opens the perspectives for the experimental studies in hybrid magnonic-superconducting systems where the magnetic vortices in a superconductor can be used as moving sources of the magnetic field driving the spin waves in the ferromagnetic subsystem.

Gauthier Philippe, Mathieu Moalic, Jarosław W. Kłos

2023-07-24T09:51:17Z

http://arxiv.org/abs/2307.12653v4

# Unidirectional spin wave emission by travelling pair of magnetic field profiles ###### Abstract We demonstrate that the spin wave Cherenkov effect can be used to design the unidirectional spin wave emitter with tunable frequency and switchable direction of emission. In our numerical studies, we propose to use a pair of traveling profiles of the magnetic field which generate the spin waves, for sufficiently large velocity of their motion. In the considered system, the spin waves of shorter (longer) wavelengths are induced at the front (back) of the moving profiles and interfere constructively or destructively, depending on the velocity of the profiles. Moreover, we showed that the spin waves can be confined between the pair of traveling profiles of the magnetic field. This work opens the perspectives for the experimental studies in hybrid magnonic-superconducting systems where the magnetic vortices in a superconductor can be used as moving sources of the magnetic field driving the spin waves in the ferromagnetic subsystem. keywords: spin waves, Cherenkov effect, micomagnetic simulations, magnonics + Footnote †: journal: Journal of Magnetism and Magnetic Material ## 1 Introduction The Cherenkov and Doppler effects are the fundamental wave phenomena resulting from a uniform motion of the sources [1]. The Doppler effect is related to the change of the frequency of (monochromatic) wave source \(\omega\rightarrow\omega^{\prime}\)[2] due to its motion with constant velocity \(\mathbf{v}\): \(\omega^{\prime}=\gamma\left(\omega+\mathbf{v}\cdot\mathbf{k}(\omega)\right)\)[3], where \(\gamma=1\) or \(1/\sqrt{1+(v/v_{\varphi})^{2}}\), depending if the transformation between reference frames is described by Galilean or Lorentz transformation. The Cherenkov effect [4] is observed as a generation of the waves by the source moving \(v\) with the velocity equal to or larger than the phase velocity \(v_{\varphi}\) of the medium: \(v\geq v_{\varphi}\). It is worth noting that this effect exists even if the'source' is'static' in moving reference frame: \(\omega=0\). In this case, the equation \(\omega^{\prime}(\mathbf{k})=\mathbf{v}\cdot\mathbf{k}\) determines the frequency(ies) \(\omega^{\prime}\) and the corresponding wave vector(s) of exited waves, which is equal to the condition: \(v_{\varphi}=\omega^{\prime}/k=v\). The Cherenkov effect was observed for the first time in 1934 when the \(\gamma\)-radiation emitted by pure liquids under the action of fast electrons (\(\beta\) - particles of radioactive elements) was detected[5]. The condition \(v>v_{\varphi}\) can be fulfilled because the velocity of the emitted electrons (\(v\simeq c\)) exceeds the phase velocity of light in material medium \(v_{\varphi}=c/n\) of the refractive index \(n>1\). The first theoretical explanation of the Cherenkov effect was presented by I. Tamm and I. Frank [6] in the late thirties. Nowadays, the Cherenkov effect is the subject of intensive studies not only in the field of high-energy physics but also in condensed matter, and in particular in photonics [7; 8] and derivated field: polaritonics [9; 10; 11; 12]. It is worth mentioning that electromagnetic waves are not the only platform on which the Cherenkov effect can be studied and used in nanodevices. Magnonics [13] offers equally interesting possibilities. The phase velocities of spin waves are on the order of single km/s, making the Cherenkov effect relatively easy to observe. Ten years ago, M. Yan [14; 15] demonstrated numerically that Cherenkov effects for spin waves can be excited by the moving pulse of the magnetic field. The authors also found the formation of the Mach cones for 2D and 3D ferromagnetic systems. The experimental realization of this idea is challenging because it requires the generation of the fast-moving profile (barrier) of the magnetic field. Such motion can be approximated, in a time-lapse manner, by sequential application of the voltage to the long sequence of the electrodes deposited on the magnetic layer in which we can induce the magnetocrystalline anisotropy (and related effective field) [16]. Another approach, which is now intensively studied, is based on the motion of fluxons in the superconducting layer. The fluxons produce a stray field and can be pushed through a superconductor with large velocities [17; 18]. It was already experimentally demonstrated that moving fluxons can induce a Cherenkov radiation of spin waves in the ferromagnetic layer underneath the superconductor [19]. The uniform motion of the medium leads also to Doppler or Cherenkov effect. This effect is well known in acoustic and has practical application in ultrasonography [20]. The corresponding effect is observed in magnonics if the spin wave is accompanied by the spin current flowing through the system [21] - i.e., the precessional dynamic of magnetization takes place on the top of the uniform motion of magnetic moments. In such systems, one can observe Doppler [22] of Cherenkov effect [23; 24] for spin waves. In our work, we do not consider the flow of spin current, but we focus on the spin wave generation by the motion of linear barriers of the magnetic field. Such a barrier, moving with a constant velocity, generates spin waves both in the forward and backward direction, with respect to the direction of the barrier's motion. The forward and backward propagating spin waves differ in the wavelenght [14], which makes the considered spin wave emitter non-reciprocal with a change in the direction of its motion. We propose to use pair of such barriers, which move in parallel, to construct the unidirectional spin wave emitter. Research on unidirectional spin wave emitters is being carried out by many groups [25; 26]. The proposed system makes it possible to control the direction of spin wave propagation (forward or backward) by tuning the velocity of the profile. Moreover, we can block the emission of spin waves by confining them between moving barriers. The article is organized as follows. After the introduction, we describe the system under consideration and present the principle of operation of the unidirectional emitter. Then, we briefly introduce the applied model and the computational technique. In the next section, we present the results for a single barrier [14], which is a reference system in our studies. After that, we discuss the outcomes for a pair of barriers illustrating three scenarios: forward emission, backward emission, and spin wave confinement. The work concludes with a summary. ## 2 Structure and model It is known [14; 15] that fastly moving profile of a magnetic field can generate spin waves, which differ in the wavelength, depending on the direction of propagation (see Fig. 2(a)). This effect is known as a spin wave Cherenkov effect. Interestingly, the wavelength (wavenumber) of the forward and backward propagating spin waves change with different rates as the velocity \(v\) of the barrier increases (see Fig. 2(b)). This allows designing _the unidirectional spin wave emitter_ where the spin waves produced by the pair of moving profiles of the magnetic field can interfere constructively or destructively on the opposite sides of the system - see Fig. 2(b). The conditions for the observation of the constructive (and destructive) interference in the front (and in the back) are not accidental and can be tuned by the adjustment of the selection of the velocity \(v\). We considered a ferromagnetic stripe with a thickness of 10 nm and a width of 100 nm as a conduit for spin waves, which has been magnetized alongside the external field \(H_{0}\mu_{0}=1\) T. It means the backward volume configuration for spin waves where their wave vector is parallel to the external field. We assumed that the ferromagnetic material is characterized by the saturation magnetization \(M_{\mathrm{S}}=796\times 10^{3}\) A/m, exchange stiffness \(A_{\mathrm{ex}}=1.3\times 10^{-11}\) J/m, and the low damping \(\alpha=0.02\). On both ends of the stripe, we implemented absorbing boundary conditions by gradually increasing the value of \(\alpha\). We used a modified version of Mumax3 [27], the GPU-accelerated micromagnetic software, which solves the Landau-Lifshitz-Gilbert equation to simulate the magnetization dynamics. To calculate the spin wave dispersion, we applied the harmonic (in time) and _sinc_-shaped (in space) pulse of magnetic field on one side of the magnetic stripe. We assumed the cut-off wave number \(k_{\mathrm{cut}}=1\times 10^{8}\) 1/m and sweeped the frequency \(f\) starting from 14 to 30 GHz by the steps of 0.5 GHz and from 30 to 100 GHz by steps of 1 GHz. After the time \(50/f\), we recorded the spin wave on the opposite side of the wire for each step of the simulations. The recorded spin wave profile was post-processed, using Fourier transform, to determine the leading wave vector corresponding to a given frequency. To observe the spin wave Cherenkov effect, we generated the moving profile of a magnetic field of rectangular shape (\(d=10\) nm in width and \(h_{0}=10\) mT in height) - see Fig. 2(a). We registered the spin waves excited by the moving profile of the magnetic field, for successive values of its velocity. The simulations were performed for different velocities of magnetic profile \(v\) ranging from 500 m/s to 2500 m/s. Figure 1: (a) Spin wave Cherenkov effect. The spin waves of different wave vectors \(\mathbf{k}_{L}\) and \(\mathbf{k}_{B}\) are exited by the linear profile of the magnetic field of rectangular cross-section \(h(x=vt)=h_{0}\,\theta(x+d/2)\,\theta(d/2-x)\), moving uniformly with the velocity \(v\), where \(d\) and \(h_{0}\) denote the width and height of the profile, and \(\theta(x)\) is a unit step. The magnetic layer (grey box) is magnetized in-plane, and the field \(H_{0}\) is applied along the profiles’s motion, which is parallel to the direction of spin waves’ propagation: \(\mathbf{k}_{L}\) (and \(\mathbf{k}_{B}\)). (b) The principle of working for unidirectional spin wave emitter. The spin waves produced by two parallelly moving barriers (separated by fixed distance \(D\)) can interfere destructively or constructively on the opposite sides of the moving barriers. Figure 2: (a) The dispersion relation for considered magnetic film in backward volume geometry: frequency versus wave vector \(f(k)\), and (b) the related dependences of phase velocity \(v_{g}\) (red line) and group velocity \(v_{g}\) (green line) on the wave vector. The horizontal black line denotes (c) the velocity \(v\) of the square profile of the magnetic field. The velocity \(v_{0}\) determines the wave numbers \(k_{L}\) and \(k_{B}\) of (d) the spin waves emitted backward and forward, respectively, generated by the moving profile of the magnetic field. ## 3 Cherenkov radiation of spin waves The Cherenkov effect for electromagnetic waves is usually associated with the radiation which occurs when a charged particle moves through a material with a higher velocity than the material's phase velocity for light. When the charged particle moves with a velocity smaller than the phase velocity of light, there is a deformation of the electric polarisation in the material around the charged particle. In the reverse situation, when the velocity of the charged particle is larger than the phase velocity in the medium, the deformation of the electric field does not have the time to recover its initial state, so the deformation is extended on the particle trajectory, and creates an electromagnetic wave. A similar effect is observed for spin waves when the magnetization is locally modified by the moving magnetic excitation (narrow profile of magnetic field). If the velocity of the excitation \(v\) exceeds (the minimum value) of the phase velocity in the magnetic medium \(v>v_{\varphi_{\rm min}}\), the magnetization does not have the time to recover its initial state in the time of the flight of excitation and a spin wave is generated - see Fig. 2(a). In our study, we are going to demonstrate that the pair of the profiles of the magnetic field moving parallelly at properly selected velocities can work as a unidirectional spin wave emitter - see Fig. 2(b). To test our numerical model and illustrate the principles of the spin wave Cherenkov effect, we reproduced the result of M. Yan [14; 15], where the motion of a single profile of magnetic field was considered. Fig. 2(a) presents the numerically determined dispersion relation \(f(k)\) (frequency versus wave number) for the considered stripe (see Sec. 2). From the relation \(f(k)\), we calculated the dependence of the spin wave phase (and group) velocity \(v_{\varphi}\) (\(v_{g}\)) on the wave number \(v_{\varphi}=2\pi f/k\) (\(v_{g}=2\pi\,df/dk\)) - see Fig. 2(b). It is interesting to notice that the system has a threshold value of the phase velocity for spin waves, corresponding to the minimum \(v_{\varphi_{\rm min}}\) of \(v_{\varphi}(k)\). According to the condition \(v=v_{\varphi}\) describing the spin wave Cherenkov emission, the spin waves cannot be generated when \(v<v_{\varphi_{\rm min}}\) and for \(v>v_{\varphi_{\rm min}}\), the spin waves of two different wave numbers (and corresponding frequencies) are emitted. The minimum of \(v_{\varphi_{\rm min}}\) corresponds to the condition: \(dv_{\varphi}(k)/dk=0\,\Rightarrow v_{\varphi}=\frac{1}{2\pi}dv_{\varphi}/df=v_ {g}\). Therefore, a wave with a smaller (larger) wave number will propagate with the slower (faster) that the field's profile \(v_{g}<v\) (\(v_{g}>v\)) and remain behind (overtake) the moving field's profile. ## 4 Tunable, unidirectional spin wave emitter Let's discuss now the working principles of unidirectional spin wave emitter presented in Fig. 2(b) where two square profiles of the magnetic field move with the same speed \(v\), keeping a constant gap \(D\) between them (Fig. 2(b) and Fig. 3(a)). To observe destructive (constructive) interference of two harmonic sources generating the waves of the wavevector \(k\) and displaced by the distance \(D\), the wave number should fulfill the following condition: \(kD=2\pi n\) (\(kD=\pi(2n+1)\)), where \(n\) is an integer number. In the considered system, we can tune the value of the wave vector of the generated spin wave \(k(v_{\varphi}=v)\) by changing the velocity \(v\) of the moving field's profile. It is worth noting that this tuning \(k(v)\) takes place with a different rate for forward propagating spin waves (of larger wavenumber \(k_{R}\)) and backward propagating spin waves (of smaller wave \(k_{L}\)). It is known that the dipolar-exchange dispersion relation \(f(k)\) is linear: \(f\propto k\) (quadratic \(f\propto k^{2}\)) for small (large) wave numbers. This corresponds to the relation: \(v_{\varphi}\propto 1/k\) (\(v_{\varphi}\propto k\)) for small (large) wave numbers. As a result, the ratio of \(k_{L}(v)/k_{R}(v)\) will vary approximately linearly as the velocity \(v=v_{\varphi}\) increases - see Fig. 3(b). We can consider three particular scenarios. * constructive interference in the back and destructive interference in the front of moving barriers - Fig. 3(c): \[\frac{k_{L}(v)}{k_{R}(v)}=\frac{2n_{L}}{2n_{R}+1}\,\propto\,v.\] (1) * constructive interference in the back and destructive interference in the front of moving barriers - Fig. 3(d): \[\frac{k_{L}(v)}{k_{R}(v)}=\frac{2n_{L}+1}{2n_{R}}\,\propto\,v.\] (2) * constructive interference in the back and destructive interference in the front of moving barriers - Fig. 3(e): \[\frac{k_{L}(v)}{k_{R}(v)}=\frac{2n_{L}+1}{2n_{R}+1}\,\propto\,v.\] (3) The symbols \(n_{L}\) and \(n_{R}\) are two independent integer numbers. Figure 3: (a) Two profiles of the magnetic field which move with the same velocity \(v_{0}\), keeping fixed distance \(D\). (b) The ratio of the wave numbers \(k_{R}/k_{L}\) for different values of the velocity \(v_{0}\); square, circular, and rhombic dots mark the \(k_{R}/k_{L}\) ratios, for which we observe: (c) unidirectional backward spin wave emission, (d) unidirectional forward emission, (e) partial confinement between the field profiles – see Fig. 2(d). For larger velocities \(v\) (i.e. for \(v>1.2\) km/s), the ratio \(k_{L}(v)/k_{R}(v)\) is proportional to \(v\). As the velocity of the profiles \(v\) increases, it can be tuned multiple times to every three mentioned scenarios. Because of the damping of the spin waves, the constructive and destructive interferences cannot be perfect. However, the effects of unidirectional emissions are quite distinctive. For considered backward spin wave emitter (Fig. 3(c)) the intensity of the wave propagating to the left is 2.5 times higher than the wave to the right. For the forward spin wave emitter (Fig. 3(d)) the intensity of the wave to the right is 17 times higher than the wave to the left. The effect of spin wave confinement needs additional discussion. The intensity of the wave enclosed between moving barriers is 6.1 times higher than the waves outside. However, the lack of perfect confinement cannot be solely attributed to the damping but can be related to the appearance of non-linear effects in this externally pumped system. In is worth noting that the ratio \(k_{L}/k_{R}\) must be gather that one: \(k_{L}/k_{R}>1\), which coresponds to the condition for Cherenkov emission \(v>v_{\varphi_{\text{min}}}\). ## 5 Summary Our simulations demonstrate that it is possible to use the spin wave Cherenkov emission to design the unidirectional (backward or forward) spin wave emitter of tunable frequency. We showed that it is feasible to confine and continuously pump the bi-harmonic superposition of spin waves (i.e. the spin waves of two different frequencies). The discussed effects can be potentially implemented in hybrid magic-superconducting systems where the Abricosov lattices vortices can be used as moving sources of the magnetic field that drives the spin waves in the ferromagnetic subsystem. ## Acknowledgements G. P. anf J. W. K. would like to acknowledge the erasmus mundus MaMaSELF programm and the support from the National Science Center - Poland grant No. 2021/43/I/ST3/00550.

2307.03986

The Riemannian Bianchi identities of metric connections with skew torsion and generalized Ricci solitons

Curvature properties of a metric connection with totally skew-symmetric torsion are investigated. It is shown that if either the 3-form $T$ is harmonic, $dT=\delta T=0$ or the curvature of the torsion connection $R\in S^2\Lambda^2$ then the scalar curvature of a $\nabla$-Einstein manifold is determined by the norm of the torsion up to a constant. It is proved that a compact generalized gradient Ricci soliton with closed torsion is Ricci flat if and only if either the norm of the torsion or the Riemannian scalar curvature are constants. In this case the torsion 3-form is harmonic and the gradient function has to be constant. Necessary and sufficient conditions a metric connection with skew torsion to satisfy the Riemannian first Bianchi identity as well as the contracted Riemannian second Binachi identity are presented. It is shown that if the torsion connection satisfies the Riemannian first Bianchi identity then it satisfies the contracted Riemannian second Bianchi identity. It is also proved that a metric connection with skew torsion satisfying the curvature identity $R(X,Y,Z,V)=R(Z,Y,X,V)$ must be flat.

Stefan Ivanov, Nikola Stanchev

2023-07-08T14:25:00Z

http://arxiv.org/abs/2307.03986v5

###### Abstract ###### Abstract Curvature properties of a metric connection with totally skew-symmetric torsion are investigated. It is shown that if either the 3-form \(T\) is harmonic, \(dT=\delta T=0\) or the curvature of the torsion connection \(R\in S^{2}\Lambda^{2}\) then the scalar curvature of a \(\nabla\)-Einstein manifold is determined by the norm of the torsion up to a constant. It is proved that a compact generalized gradient Ricci soliton with closed torsion is Ricci flat if and only if either the norm of the torsion or the Riemannian scalar curvature are constants. In this case the torsion 3-form is harmonic and the gradient function has to be constant. Necessary and sufficient conditions a metric connection with skew torsion to satisfy the Riemannian first Bianchi identity as well as the contracted Riemannian second Binachi identity are presented. It is shown that if the torsion connection satisfies the Riemannian first Bianchi identity then it satisfies the contracted Riemannian second Bianchi identity. It is also proved that a metric connection with skew torsion satisfying the curvature identity \(R(X,Y,Z,V)=R(Z,Y,X,V)\) must be flat. AMS MSC2010: 53C55, 53C21, 53C29, 53Z05 **The Riemannian Bianchi identities of metric connections** **with skew torsion and generalized Ricci solitons** S. Ivanov\({}^{1}\) and N. Stanchev\({}^{2}\) \({}^{1}\) University of Sofia, Faculty of Mathematics and Informatics, blvd. James Bourchier 5, 1164, Sofia, Bulgaria and Institute of Mathematics and Informatics, Bulgarian Academy of Sciences \({}^{2}\) University of Sofia, Faculty of Mathematics and Informatics, blvd. James Bourchier 5, 1164, Sofia, Bulgaria ###### Contents * 1 Introduction * 2 Metric connection with skew-symmetric torsion and its curvature * 2.1 Proof of Theorem 1.3 * 3 The contracted second Bianchi identity * 3.1 Proof of Theorem 1.2 * 4 The \(\nabla\)-Einstein condition * 5 Generalized gradient Ricci solitons. Proof of Theorem 1.1 ## 1 Introduction Riemannian manifolds with metric connections having totally skew-symmetric torsion and special holonomy received a strong interest mainly from supersymmetric string theories and supergravity. The main interest is the existence and properties of such a connection with holonomy inside \(U(n)\) which also preserves the \(U(n)\) structure i.e. metric connections with skew-symmetric torsion on an almost hermitian manifold preserving the almost hermitian structure. Hermitian manifolds have widespread applications in both physics and differential geometry. These are complex manifolds equipped with a metric \(g\), and a Kaehler form \(\omega\) which are of type (1,1) with respect to the complex structure \(J\). There are many examples of Hermitian manifolds as every complex manifold admits a Hermitian structure. In many applications, Hermitian manifolds have additional properties which are expressed as either a condition on \(\omega\) or as a restriction on the holonomy of one of the Hermitian connections. Given a Hermitian manifold \((M,g,J)\) the Strominger-Bismut connection \(\nabla\) is the unique connection on \(M\) that is Hermitian (\(\nabla g=0\) and \(\nabla J=0\)) and has totally skew-symmetric torsion tensor \(T\). Its existence and explicit expression first appeared in Strominger's seminal paper [43] in 1986 in connection with the heterotic supersymmetric string background, where he called it the H-connection. Three years later, Bismut formally discussed and used this connection in his local index theorem paper [6], which leads to the name Bismut connection in literature. Note that this connection was also called KT connection (Kahler with torsion) and characteristic connection. If the torsion 3-form \(T\) of \(\nabla\) is closed, \(dT=0\), which is equivalent to the condition \(\partial\bar{\partial}\omega=0\), the Hermitian metric g is called SKT (strong Kahler with torsion) [24] or pluriclosed. The SKT (pluriclosed) metrics has found many applications in both physics, see e.g. [21, 25, 43, 22, 23, 10] and geometry, see e.g. [33, 27, 28, 12, 44, 17, 18, 11, 14, 40, 35]. For example in type II string theory, the torsion 3-form \(T\) is identified with the 3-form field strength. This is required by construction to satisfy \(dT=0\). Streets and Tian [40] introduced a hermitian Ricci flow under which the pluriclosed or equivalently strong KT structure is preserved. Generalizations of the pluriclosed condition \(\partial\bar{\partial}\omega=0\) on 2n dimensional Hermitian manifolds in the form \(\omega^{\ell}\wedge\partial\bar{\partial}\omega^{k}=0\,\quad 1\leq k+\ell\leq n-1\) has been investigated in [15, 38, 19, 29] etc. Hermitian metrics with the Strominger-Bismut connection being Kahler-like, namely, its curvature satisfies the Riemannian first Bianchi identity ( the identity (2.11) below), have been studied in [4], investigating this property on 6-dimensional solvmanifolds with holomorphically trivial canonical bundle. It was conjectured by Angela-Otal-Ugarte-Villakampa in [4] that such metrics should be SKT (pluriclosed). Support to that can be derived from [Theorem 5][45] where the simply connected hermitian manifolds with flat Strominger-Bismut connection are classified and it easily follows that these spaces are SKT (pluriclosed) with parallel 3-form torsion [4]. The latter conclusion also follows from the Cartan-Schouten theorem [7], (see also [Theorem 2.2][3]). The conjecture by Angela-Otal-Ugarte-Villakampa was proved in [47]. In the first version of [47] in the arXive the authors stated, by a misprint, that the Strominger-Bismut connection is Kahler like if and only if the curvature satisfies the identity \[R(X,Y,Z,V)=R(Z,Y,X,V). \tag{1.1}\] It is shown in [47] that the curvature of Strominger-Bismut connection is Kahler like then one has \(dH=\nabla H=0\). In fact, in the proof, they used the correct Riemannian first Bianchi identity (2.11). The corrected definition of the Kahler-like condition was given in the second version of [47]. It was shown by Fino and Tardini in [13] that the curvature condition (1.1) is strictly stronger than the Riemannian first Bianchi identity by constructing an explicit example whose Strominger-Bismut curvature satisfies the Riemannian first Bianchi identity but it does not obey the condition (1.1). In general, metric connections with skew symmetric and closed torsion \(T,dT=0\), are closely connected with the generalized Ricci flow. Namely, the fixed points of the generalized Ricci flow are Ricci flat metric connections with harmonic torsion 3-form, \(Ric=dT=\delta T=0\), we refer to the recent book [20] and the references given there for mathematical and physical motivation. The first goal in the paper is to investigate peoperties of a metric connection with skew-symmetric torsion with applications to generalized Ricci flow. We consider \(\nabla\)-Einstein spaces determined with the condition that the symmetric part of the Ricci tensor of the torsion connection is a scalar multiple of the metric. These spaces are introduced by Agricola and Ferreira [1, Definition 2.2] as the critical points of the \(\nabla\)-Einstein-Hilbert functional [1, Theorem 2.1]. In the case when the torsion 3-form is \(\nabla\)-parallel the \(\nabla\)-Einstein spaces are investigated in [1, 2, 8, 9] and a large number of examples are given there. The \(\nabla\)-Einstein spaces appear also in generalized geometry. In [20, Proposition 3.47] it is shown that a Riemannian metric \(g\) and a harmonic 3-form \(T\) are critical point of the generalized Einstein-Hilbert functional if and only if it is \(\nabla\)-Einstein. Notice that in contrast to the Riemannian case, for a \(\nabla\)-Einstein manifold the scalar curvature \(Scal\) of the torsion connection is not necessarily constant (for details see [1]). If the torsion is \(\nabla\)- parallel then the scalar curvature of the torsion connection and the Riemannian scalar curvature are constants, similarly to an Einstein manifold [1, Proposition 2.7]. We investigate the constancy of the scalar curvatures of a \(\nabla\)-Einstein space. We show in Theorem 4.2 that if either the 3-form \(T\) has zero torsion 1-forms, \(\delta T\lrcorner T=T\lrcorner dT=0\), (in particular if \(T\) is harmonic, \(dT=\delta T=0\)) or the curvature of the torsion connection \(R\in S^{2}\Lambda^{2}\) then the scalar curvature of a \(\nabla\)-Einstein manifold is determined by the norm of the torsion up to a constant. In particular, the scalar curvature of the torsion connection is constant if and only if the norm of the torsion is constant. Observing that if the torsion is parallel, \(\nabla T=0\), then the torsion 1-forms vanish, \(\theta=\delta T\lrcorner T=0,\Theta=T\lrcorner dT=0\), we obtain that any \(\nabla\)-Einstein manifold with parallel torsion of dimension bigger than 2 the Riemannian scalar curvarture and the scalar curvature of the torsion connections are constants, thus confirm the result of Agricola and Ferreira, [1, Proposition 2.7]. A special phenomena occurs in dimednsion six, namaely (4.32) below imply that if \((M,g,T)\) is a six dimensional Riemannian manifold with zero torsion 1-forms (in particular \(T\) is harmonic 3-form) and the metric connection with torsion \(T\) is \(\nabla\)-Einstein then the Riemannian scalar curvature is constant, Corollary 4.3. We recall [20, Definition 4.31] that a Riemannian manifold \((M,g,T)\) with a closed 3-form \(T\) is a generalized steady Ricci soliton with \(k=0\) if one has \[Ric^{g}=\frac{1}{4}T^{2}-\mathbb{L}_{X}g,\qquad\delta T=-X\lrcorner T,\qquad dT =0.\] If the vector field \(X\) is a gradient of a smooth function \(f\) then we have the notion of a generalized gradient Ricci soliton. A complete generalized gradient Ricci solitons are constructed on complex surfaces in [42]. The existence and classification of non-trivial solitons on compact (complex) 4-manifolds has been recently proved in [39, 41, 5]. Our first main observation is the following **Theorem 1.1**.: _Let \((M,g,T)\) be a compact Riemannian manifold with closed 3-form \(T,dT=0\)._ _If \((M,g,T,f)\) is a generelized gradient Ricci soliton then the following conditions are equivalent:_ 1. _The norm of the torsion is constant,_ \(d||T||^{2}=0\)_;_ 2. _The function_ \(f\) _is constant._ 3. _The torsion connection is Ricci flat,_ \(Ric=0\)_;_ 4. _The Riemannian scalar curvature is constant,_ \(Scal^{g}=const\)_._ _In all four cases the 3-form \(T\) is harmonic._ Examples of Ricci flat torsion connections are constructed in [37, 34]. The second aim of this note is to express necessary and sufficient conditions the curvature of a metric connection with totally skew-symmetric torsion to satisfy the Riemannian first Bianchi identity as well as the contracted Riemannian second Binachi identity ((2.14) below) and equation (1.1). Our second main result is the next **Theorem 1.2**.: _The curvature of a metric connection \(\nabla\) with skew-symmetric torsion \(T\) on a Riemannian manifold \((M,g)\) satisfies the Riemannian first Bianchi identity if and only if the next identities hold_ \[dT=-2\nabla T=\frac{2}{3}\sigma^{T}, \tag{1.2}\] _where the four form \(\sigma^{T}\) corresponding to the 3-form \(T\) is defined below with (2.5)._ _In this case the norm of the 3-form \(T\) is a constant, \(||T||^{2}=const.\) and the curvature of the connection \(\nabla\) satisfies the contracted Riemannian second Bianchi identity._ Clearly, any torsion-free connection satisfying (1.1) must be flat which is a simple consequence of the first Bianchi identity. In particular, a Riemannian manifold satisfies (1.1) if and only if it is flat. We show that this is valid also for metric connections with skew-symmetric torsion which explains the reason for the existence of the example in [13]. We derive from Theorem 1.2 the next general result **Theorem 1.3**.: _A metric connection with skew-symmetric torsion satisfies the condition (1.1) if and only if it is flat, \(R=0\)._ **Remark 1.4**.: _We note that Theorem 4.2 generalizes the Ricci flat case established recently in [36, Lemma 2.21] where it was proved that if the torsion is harmonic (it is sufficient only to be closed) and the Ricci tensor of the torsion connection vanishes then the norm of the torsion is constant._ _The converse is not true in general. Namely not any space with closed torsion of constant norm \(dT=d||T||^{2}=0\) is Ricci flat._ _In some cases the converse holds true. For example in the case of compact generalized gradient Ricci soliton the Ricci flatness is equivalent to the constancy of the norm of the torsion due to Theorem 1.1._ _Another cases occur if the torsion connection has special holonomy, contained in the groups \(SU(3)\), \(G_{2}\) or \(Spin(7)\). It is shown very recently in [31], [32] and [30] that the \(SU(3),G_{2},Spin(7)\)-torsion connection with closed torsion is Ricci flat on a compact manifold if and only if the norm of the torsion is constant._ Everywhere in the paper we will make no difference between tensors and the corresponding forms via the metric as well as we will use Einstein summation conventions, ie repeated Latin indices are summed over up to \(n\). ## 2 Metric connection with skew-symmetric torsion and its curvature On a Riemannian manifold \((M,g)\) of dimension \(n\) any metric connection \(\nabla\) with totally skew-symmetric torsion \(T\) is connected with the Levi-Civita connection \(\nabla^{g}\) of the metric \(g\) by \[\nabla^{g}=\nabla-\frac{1}{2}T. \tag{2.3}\] The exterior derivative \(dT\) has the following expression (see e.g. [26, 28, 16]) \[\begin{split} dT(X,Y,Z,V)=(\nabla_{X}T)(Y,Z,V)+(\nabla_{Y}T)(Z, X,V)+(\nabla_{Z}T)(X,Y,V)\\ +2\sigma^{T}(X,Y,Z,V)-(\nabla_{V}T)(X,Y,Z)\end{split} \tag{2.4}\] where the 4-form \(\sigma^{T}\), introduced in [16], is defined by \[\sigma^{T}(X,Y,Z,V)=\frac{1}{2}\sum_{j=1}^{n}(e_{j}.\lrcorner T)\wedge(e_{j}. \lrcorner T)(X,Y,Z,V), \tag{2.5}\] \((e_{j}.\lrcorner T)(X,Y)=T(e_{j},X,Y)\) is the interior multiplication and \(\{e_{1},\dots,e_{n}\}\) is an orthonormal basis. The properties of the 4-form \(\sigma^{T}\) are studied in detail in [2] where it is shown that \(\sigma^{T}\) measures the 'degeneracy' of the 3-form \(T\). For the curvature of \(\nabla\) we use the convention \(R(X,Y)Z=[\nabla_{X},\nabla_{Y}]Z-\nabla_{[X,Y]}Z\) and \(R(X,Y,Z,V)=g(R(X,Y)Z,V)\). It has the well known properties \[R(X,Y,Z,V)=-R(Y,X,Z,V)=-R(X,Y,V,Z). \tag{2.6}\] The Ricci tensors and scalar curvatures of the Levi-Civita connection \(\nabla^{g}\) and the torsion connection \(\nabla\) are related by [16, Section 2], (see also [20, Prop. 3.18]) \[\begin{split} Ric^{g}(X,Y)=Ric(X,Y)+\frac{1}{2}(\delta T)(X,Y)+ \frac{1}{4}\sum_{i=1}^{n}g(T(X,e_{i}),T(Y,e_{i});\\ Scal^{g}=Scal+\frac{1}{4}||T||^{2},\qquad Ric(X,Y)-Ric(Y,X)=-( \delta T)(X,Y),\end{split} \tag{2.7}\] where \(\delta=(-1)^{np+n+1}*d*\) is the co-differential acting on \(p\)-forms and \(*\) is the Hodge star operator. Following [20] we denote \[T_{ij}^{2}=T_{iab}T_{jab}:=\sum_{a,b=1}^{n}T_{iab}T_{jab}.\] Then the first equality in (2.7) takes the form \[Ric_{ij}^{g}=Ric_{ij}+\frac{1}{2}\delta T_{ij}+\frac{1}{4}T_{ij}^{2}.\] The first Bianchi identity for \(\nabla\) \[\begin{split} R(X,Y,Z,V)+R(Y,Z,X,V)+R(Z,X,Y,V)\\ =(\nabla_{X}T)(Y,Z,V)+(\nabla_{Y}T)(Z,X,V)+(\nabla_{Z}T)(X,Y,V)+ \sigma^{T}(X,Y,Z,V)\end{split}\] can be written in the following form (see e.g. [26, 28, 16]) \[\begin{split} R(X,Y,Z,V)+R(Y,Z,X,V)+R(Z,X,Y,V)\\ =dT(X,Y,Z,V)-\sigma^{T}(X,Y,Z,V)+(\nabla_{V}T)(X,Y,Z)\end{split} \tag{2.8}\] It is proved in [16, p.307] that the curvature of a metric connection \(\nabla\) with totally skew-symmetric torsion \(T\) satisfies also the next identity \[\begin{split} R(X,Y,Z,V)+R(Y,Z,X,V)+R(Z,X,Y,V)-R(V,X,Y,Z)-R(V,Y,Z, X)-R(V,Z,X,Y)\\ =\frac{3}{2}dT(X,Y,Z,V)-\sigma^{T}(X,Y,Z,V).\end{split} \tag{2.9}\] We obtain from (2.9) and (2.8) **Proposition 2.1**.: _The curvature of a metric connection with skew-symmetric torsion satisfies_ \[R(V,X,Y,Z)+R(V,Y,Z,X)+R(V,Z,X,Y)=-\frac{1}{2}dT(X,Y,Z,V)+(\nabla_{V}T)(X,Y,Z) \tag{2.10}\] Following [4] we have **Definition 2.2**.: _We say that the curvature \(R\) satisfies the Riemannian first Bianchi identity if_ \[R(X,Y,Z,V)+R(Y,Z,X,V)+R(Z,X,Y,V)=0. \tag{2.11}\] It is well known algebraic fact that (2.6) and (2.11) imply \(R\in S^{2}\Lambda^{2}\), i.e it holds \[R(X,Y,Z,V)=R(Z,V,X,Y), \tag{2.12}\] Note that, in general, (2.6) and (2.12) do not imply (2.11). The precise condition the curvature of a metric connection \(\nabla\) with totally skew-symmetric torsion \(T\) to satify (2.12) is given in [26, Lemma 3.4], namely the covariant derivative of the torsion with respect to the torsion connection \(\nabla T\) must be a four form, **Lemma 2.3**.: _[_26_, Lemma 3.4]_ _) The next equivalences hold for a metric connection with torsion 3-form_ \[(\nabla_{X}T)(Y,Z,V)=-(\nabla_{Y}T)(X,Z,V)\Longleftrightarrow R(X,Y,Z,V)=R(Z, V,X,Y))\Longleftrightarrow dT=4\nabla^{g}T. \tag{2.13}\] An immediate consequence of (2.13) is the next **Corollary 2.4**.: _Suppose that a metric connection with torsion 3-form \(T\) has curvature \(R\in S^{2}\Lambda^{2}\)._ _Then the torsion 3-form is closed, \(dT=0\), if and only if the torsion is parallel with respect to the Levi-Civita connection, \(\nabla^{g}T=0\)._ **Definition 2.5**.: _We say that a the curvature of a metric connection with skew-symmetric torsion satisfies the contracted Riemannian second Bianchi identity if_ \[d(Scal)(X)-2\sum_{i=1}^{n}(\nabla_{e_{i}}Ric)(X,e_{i})=0. \tag{2.14}\] Following [3], we consider a 1-parameter family of metric connections \(\nabla^{t}\) with torsion \(tT\) defined by \[g(\nabla_{X}^{g}Y,Z)=g(\nabla_{X}^{t}Y,Z)-\frac{t}{2}T(X,Y,Z)\] yielding the equality (see e.g. [3]) \[(\nabla_{X}^{g}T)(Y,Z,V)=(\nabla_{X}^{t}T)(Y,Z,V)+\frac{t}{2}\sigma^{T}(X,Y,Z,V) \tag{2.15}\] We continue with the following result which generalizes [Proposition 2.1][3], [Theorems 3.1,3.2][13] and proves the first part of Theorem 1.2. **Theorem 2.6**.: _The curvature of a metric connection with skew-symmetric torsion \(T\) satisfies the Riemannian first Bianchi identity if and only if the identities (1.2) hold._ _In this case the 3-form \(T\) is parallel with respect to the metric connection \(\nabla^{1/3}\) with torsion equal to \(\frac{1}{3}T,\nabla^{1/3}T=0\). In particular, the norm of the 3-form \(T\) is constant, \(||T||^{2}=const\)._ Proof.: Substitute (1.2) into the right-hand side of (2.8) to get that the Riemannian first Bianchi identity (2.11) holds. For the converse, suppose the curvature \(R\) of \(\nabla\) satisfies the Riemannian first Bianchi identity (2.11). Then it satisfies the identity (2.12) and [26, Lemma 3.4] imply that \(\nabla T\) is a 4-form. Then we have from (2.8), (2.4) and (2.9) \[3\nabla T=-\sigma^{T}=-\frac{3}{2}dT\] which proofs (1.2). One gets from (1.2) \(\nabla T=-\frac{1}{3}\sigma^{T}\) and (2.15) yields \(\nabla^{1/3}T=0\), which was first observed in [3]. ### Proof of Theorem 1.3 Proof.: We will show that (1.1) implies (1.2). Indeed, substitute (1.1) into (2.9) to get \[3dT=2\sigma^{T}. \tag{2.16}\] Further, (1.1) yields \(R(X,Y,Z,V)=R(Z,V,X,Y)\) leading by [26, Lemma 3.4] that \(\nabla T\) is a 4-form which applied to (2.4) gives \[dT(X,Y,Z,V)=(\nabla_{X}T)(Y,Z,V)+(\nabla_{Y}T)(Z,X,V)+(\nabla_{Z }T)(X,Y,V)-(\nabla_{V}T)(X,Y,Z)\] \[+2\sigma^{T}(X,Y,Z,V)=4\nabla T(X,Y,Z,V)+2\sigma^{T}(X,Y,Z,V)= \frac{2}{3}\sigma^{T}(X,Y,Z,V),\] where we have used (2.16). Hence, (1.2) holds and Theorem 1.2 shows the validity of the Riemannian first Bianchi identity. Hence, we get \[0=R(X,Y,Z,V)+R(Y,Z,X,V)+R(Z,X,YV)\] \[=R(Z,Y,X,V)+R(Y,Z,X,V)+R(Z,X,Y,V)=R(Z,X,Y,V)\] where we have applying (1.1) to get the second identity. The proof is completed. The contracted second Bianchi identity In this section we investigate the second Bianchi identity for the curvature of a metric connection with skew-symmetric torsion. First we show the validity of an algebraic identity. **Proposition 3.1**.: _For an arbitrary 3-form \(T\) the next identity holds_ \[T_{abc}\sigma^{T}_{abci}=0 \tag{3.17}\] Proof.: Using (2.5) we calculate \[T_{abc}\sigma^{T}_{abci}=T_{abc}\Big{(}T_{abs}T_{sci}+T_{bcs}T_{sai}+T_{cas}T_{ sbi}\Big{)}=3T_{abc}T_{abs}T_{sci}=0\] since \(T_{abc}T_{abs}\) is symmetric in \(c\) and \(s\) while \(T_{sci}\) is skew-symmetric in \(c\) and \(s\). The next observation expresses the \(\nabla\)-divergence of \(\delta T\), **Proposition 3.2**.: _For a metric connection with torsion 3-form \(T\) the next identity holds_ \[2\nabla_{i}\delta T_{ij}=\delta T_{ia}T_{iaj}. \tag{3.18}\] Proof.: Applying (2.3), we calculate using the Ricci identity for the Levi-Civita connection, the symmetricity of its Ricci tensor and the first Bianchi identity \[\nabla_{i}\delta T_{ij}=\nabla^{g}{}_{i}\delta T_{ij}-\frac{1}{2 }\delta T_{is}T_{ijs}=-\frac{1}{2}\Big{(}\nabla^{g}{}_{i}\nabla^{g}{}_{s}- \nabla^{g}{}_{s}\nabla^{g}{}_{i}\Big{)}T_{sij}+\frac{1}{2}\delta T_{is}T_{ isj}=\\ -\frac{1}{2}\Big{(}R^{g}_{issq}T_{qij}+R^{g}_{isiq}T_{sqj}+R^{g}_ {isjq}T_{isq}\Big{)}+\frac{1}{2}\delta T_{is}T_{isj}\\ =Ric^{g}_{iq}T_{iqj}-\frac{1}{6}\Big{(}R^{g}_{isqj}+R^{g}_{siqj}+ R^{g}_{iqsj}\Big{)}T_{isq}+\frac{1}{2}\delta T_{is}T_{isj}=\frac{1}{2}\delta T _{is}T_{isj}.\] The proof of Proposition 3.2 is completed. **Definition 3.3**.: _For any 3-form \(T\) we define two torsion 1-forms \(\theta,\Theta\) naturally associated to \(T\) by_ \[\theta_{j}=\delta T_{ab}T_{jab},\quad\Theta_{j}=T_{abc}dT_{jabc}.\] Further, we have **Lemma 3.4**.: _The 1-forms \(\theta\) and \(\Theta\) are connected by the equality_ \[3\theta_{j}+\Theta_{j}=\frac{1}{2}\nabla^{g}{}_{j}||T||^{2}-3\nabla^{g}{}_{s }T^{2}_{sj}=\frac{1}{2}\nabla_{j}||T||^{2}-3\nabla_{s}T^{2}_{sj} \tag{3.19}\] Proof.: We obtain from (2.4) \[\Theta_{j}=-dT_{abcj}T_{abc}=-3\nabla^{g}{}_{a}T_{bcj}T_{abc}+\frac{1}{2} \nabla^{g}{}_{j}||T||^{2}=-3\nabla_{a}T_{bcj}T_{abc}+\frac{1}{2}\nabla_{j}||T ||^{2}, \tag{3.20}\] where we used (2.15) and (3.17). On the other hand, we calculate in view of (3.17) and (3.20) that \[\theta_{j}=\delta T_{ia}T_{iaj}=-\nabla_{s}T_{sia}T_{iaj}=-\nabla _{s}T^{2}_{sj}+\nabla_{s}T_{iaj}T_{sia}=-\nabla^{g}{}_{s}T^{2}_{sj}+\nabla^{ g}{}_{s}T_{iaj}T_{sia}\\ =-\nabla^{g}{}_{s}T^{2}_{sj}+\frac{1}{3}(\nabla^{g}{}_{s}T_{iaj}+ \nabla^{g}{}_{i}T_{asj}T_{sia}+\nabla^{g}{}_{a}T_{sij})T_{sia}\\ =-\nabla^{g}{}_{s}T^{2}_{sj}-\frac{1}{3}dT_{jia}T_{sia}+\frac{1}{ 6}\nabla^{g}{}_{j}||T||^{2}=-\nabla^{g}{}_{s}T^{2}_{sj}-\frac{1}{3}\Theta_{j}+ \frac{1}{6}\nabla^{g}{}_{j}||T||^{2}. \tag{3.21}\] The lemma is proved. Note that if the torsion is \(\nabla\)-parallel then \(\theta=\delta T\lrcorner T=0\) and \(\Theta=T\lrcorner dT=2T\lrcorner\sigma^{T}=0\) due to (2.4) and (3.17). **Proposition 3.5**.: _The contracted second Bianchi identity for the curvature of the torsion connection \(\nabla\) reads_ \[d(Scal)(X)-2\sum_{i=1}^{n}(\nabla_{e_{i}}Ric)(X,e_{i})+\frac{1}{6}d||T||^{2}(X) +\theta(X)+\frac{1}{6}\Theta(X)=0. \tag{3.22}\] _If the torsion 1-forms satisfy the identity_ \[6\theta+\Theta=0\] _then_ \[d(Scal)_{j}-2\nabla_{i}Ric_{ji}+\frac{1}{6}\nabla_{j}||T||^{2}=0. \tag{3.23}\] _In particular, if the 3-form \(T\) is harmonic, \(dT=\delta T=0\) then (3.23) holds._ Proof.: The second Bianchi identity for the curvature of a metric connection \(\nabla\) with torsion \(T\) is \[(\nabla_{X}R)(V,Y,Z,W)+(\nabla_{V}R)(Y,X,Z,W)+(\nabla_{Y}R)(X,V,Z,W)\\ +R(T(X,V),Y,Z,W)+R(T(V,Y),X,Z,W)+R(T(Y,X),V,Z,W)=0. \tag{3.24}\] Take the trace of (3.24) to get \[(\nabla_{X}Ric)(Y,Z)+\sum_{i=1}^{n}(\nabla_{e_{i}}R)(Y,X,Z,e_{i})-(\nabla_{Y} Ric)(X,Z)\\ \sum_{i,j=1}^{n}\Big{[}T(X,e_{i},e_{j})R(e_{j},Y,Z,e_{i})+T(e_{i}, Y,e_{j})R(e_{j},X,Z,e_{i})\Big{]}-\sum_{i=1}^{n}T(Y,X,e_{i})Ric(e_{i},Z)=0. \tag{3.25}\] The trace in (3.25) together with (2.7) and (2.10) yields \[0=d(Scal)(X)-2\sum_{i=1}^{n}(\nabla_{e_{i}}Ric)(X,e_{i})-2\sum_{i,j=1}^{n}T(X,e_{i},e_{j})Ric(e_{i},e_{j}) \tag{3.26}\] \[+\frac{1}{3}\sum_{i,j,k=1}^{n}T(e_{i},e_{j},e_{k})\Big{[}R(X,e_{i },e_{j},e_{k})+R(X,e_{j},e_{k},e_{i})+R(X,e_{k},e_{i},e_{j})\Big{]}\] \[=d(Scal)X)-2\sum_{i=1}^{n}(\nabla_{e_{i}}Ric)(X,e_{i})+\sum_{i,j= 1}^{n}T(X,e_{i},e_{j})\delta T(e_{i},e_{j})+\frac{1}{6}\nabla_{X}||T||^{2}\] \[+\frac{1}{6}\sum_{i,j,k=1}^{n}T(e_{i},e_{j},e_{k})dT(X,e_{i},e_{j },e_{k}).\] which proves (3.22). The proof of the Proposition 3.5 is completed. Apply (3.20) to the last term of (3.22) to get **Corollary 3.6**.: _The contracted second Bianchi identity for the curvature of the torsion connection has also the form_ \[d(Scal)_{j}-2\nabla_{s}Ric_{js}+\frac{1}{4}\nabla_{j}||T||^{2}+\theta_{j}- \frac{1}{2}\nabla_{i}T_{jka}T_{ijk}=0. \tag{3.27}\] **Corollary 3.7**.: _The curvature of the torsion connection satisfies the contracted Riemannian second Bianchi identity (2.14) if and only if the next equality holds_ \[6\theta_{j}+\Theta_{j}+\nabla_{j}||T||^{2}=0\Longleftrightarrow 4\theta_{j}+ \nabla_{j}||T||^{2}-2\nabla_{i}T_{jka}T_{ijk}=0 \tag{3.28}\] _In particular, the equation (3.28) holds for any Ricci flat torsion connection._ Note that a special case of Proposition 3.5 and the above corollaries, when the torsion is \(\nabla\)-parallel, is given in [1, Corollary 2.6]. **Theorem 3.8**.: _Let the curvature \(R\) of a metric connection \(\nabla\) with skew-symmetric torsion \(T\) satisfies \(R\in S^{2}\Lambda^{2}\), i.e. (2.12) holds._ _Then the curvature of \(\nabla\) satisfies the contracted Riemannian second Bianchi identity (2.14) if and only if the norm of the torsion is a constant, \(||T||^{2}=const\)._ _In particular, if \(\nabla\) is Ricci flat, \(Ric=0\), then the norm of the torsion is constant, \(||T||=const\)._ Proof.: The condition (2.12) imply the Ricci tensor is symmetric and (2.7) yields \(\delta T=0\). Now, taking into account (2.13) we obtain from (3.27) \[d(Scal)(X)-2\sum_{i=1}^{n}(\nabla_{e_{i}}Ric)(X,e_{i})+\frac{1}{2}\nabla_{X}|| T||^{2}=0\] which completes the proof of Theorem 3.8 since any Ricci flat connection satisfies the contracted Riemannian second Bianchi identity. Theorem 2.6 and Theorem 3.8 imply **Corollary 3.9**.: _If the curvature of the torsion connectin satisfies the Riemannian first Bianchi identity (2.11) then it satisfies the contracted Riemannian second Bianchi identity (2.14)._ ### Proof of Theorem 1.2 The proof of Theorem 1.2 follows from Theorem 2.6 and Corollary 3.9. **Remark 3.10**.: _It is known that if the curvature of a metric connection satisfies the Riemannian first Bianchi identity (2.11) then it satisfies the curvature identity (2.12) but the converse is not true in general._ _In some cases the converse is true. If the torsion connection has special holonomy, contained for example in the group \(SU(3)\) in dimension six or in \(G_{2}\) in dimension seven the first Bianchi identity implies the vanishing of the Ricci tensor, \(Ric=0\). It is shown very recently in [31] and [32] that (2.12) together with \(Ric=0\) for a torsion connection with holonomy contained in \(SU(3)\) or in \(G_{2}\) imply that the Riemannian first Bianchi identity (2.11) follows._ ## 4 The \(\nabla\)-Einstein condition Since the Ricci tensor of the torsion connection is not symmetric, the usual Einstein condition seem to be restrictive. We consider the following weaker condition introduced by Agricola and Ferreira [1] **Definition 4.1**.: _[_1_, Definition 2.2]_ _A metric connection with skew-symmetric torsion is said to be \(\nabla\)-Einsten if the symmetric part of the Ricci tensor is a scalar multiple of the metric,_ \[\frac{Ric(X,Y)+Ric(Y,X)}{2}=\lambda g(X,Y).\] In view of (2.7) the \(\nabla\)-Einstein condition is equivalent to \[Ric(X,Y)=\frac{Scal}{n}g(X,Y)-\frac{1}{2}\delta T(X,Y). \tag{4.29}\] It is shown in [1, Theorem 2.1] that on a compact Riemanian manifold \((M,g,T)\) with a Riemannian metic \(g\) and a \(3\)-form \(T\), the critical points of the \(\nabla\)-Einstein-Hilbert functional \[\mathcal{L}(g,T)=\int_{M}Scal.Vol_{g}\] are precisely the pairs \((g,T)\) satisfying the \(\nabla\)-Einstein condition. We have **Theorem 4.2**.: _Let a metric connection with skew-symmetric torsion \(T\) be \(\nabla\)-Einstein._ * _Then the next identity holds_ \[\frac{n-2}{n}d(Scal)_{j}-\frac{1}{2}\nabla^{g}{}_{s}T_{sj}^{2}+\frac{1}{4}\nabla _{j}||T||^{2}=0\] (4.30) * _If the torsion 1-forms satisfy the identity_ \[3\theta+\Theta=0\] (4.31) _then the scalar curvature is determined by the norm of the torsion up to a constant_ \(C\) _due to_ \[Scal=-\frac{n}{6(n-2)}||T||^{2}+C\quad\text{and}\quad Scal^{g}=Scal+\frac{1}{4} ||T||^{2}=\frac{n-6}{12(n-2)}||T||^{2}+C,\] (4.32) _In particular, if the 3-form_ \(T\) _is harmonic,_ \(dT=\delta T=0\) _then (_4.32_) holds._ * _If the curvature of the torsion connection_ \(R\in S^{2}\Lambda^{2}\) _then the scalar curvature and the norm of the torsion satisfy the next identity with a constant_ \(B\)__ \[Scal=-\frac{n}{2(n-2)}||T||^{2}+B,\quad Scal^{g}=-\frac{n+2}{4(n-2)}||T||^{2}+B,\] (4.33) _In particular, if the scalar curvature of the torsion connection is constant in b) and c) then the norm of the torsion is constant,_ \(||T||^{2}=const\)_._ Proof.: We have from (4.29) and (3.18) that \[\nabla_{i}Ric_{ji}=\frac{d(Scal)_{j}}{n}-\frac{1}{2}\nabla_{i}\delta T_{ji}= \frac{d(Scal)_{j}}{n}+\frac{1}{4}\delta T_{ia}T_{iaj}=\frac{d(Scal)_{j}}{n}+ \frac{1}{4}\theta_{j} \tag{4.34}\] Substitute (4.34) and (3.21) into (3.26) to get \[0=\frac{n-2}{n}d(Scal)_{j}+\frac{1}{2}\delta T_{ia}T_{iaj}+\frac {1}{6}\nabla_{j}||T||^{2}+\frac{1}{6}T_{abc}dT_{jabc}\\ =\frac{n-2}{n}d(Scal)_{j}-\frac{1}{2}\nabla^{g}{}_{s}T_{sj}^{2}+ \frac{1}{4}\nabla_{j}||T||^{2} \tag{4.35}\] since \(\nabla_{j}||T||^{2}=\nabla^{g}{}_{j}||T||^{2}\) due to (3.17). This proves (4.30). If \(3\theta+\Theta=0\) then (4.35) takes the form \[0=d(Scal)_{j}-2\nabla_{i}Ric_{ij}+\frac{1}{6}\nabla_{j}||T||^{2}=d(\frac{n-2}{ n}Scal+\frac{1}{6}||T||^{2})_{j}. \tag{4.36}\] Hence, (4.32) holds. If \(R\in S^{2}\Lambda^{2}\) then \(\nabla T\) is a four form due to [26, Lemma 3.4]. Consequently, we have \(\delta T=0\) and \(\nabla_{s}T_{sj}^{2}=-\frac{1}{2}\nabla_{j}||T||^{2}\) because of (3.21). Now, (4.35) takes the form \[0=d(\frac{n-2}{n}Scal+\frac{1}{2}||T||^{2}),\] which implies (4.33). The proof is completed. We remark that due to (3.19) the condition (4.31) in Theorem 4.2 is equivalent to the condition \[3\theta+\Theta=0\Longleftrightarrow\nabla_{j}||T||^{2}=6\nabla_{i}T_{ij}^{2}.\] The second equality in (4.32) leads to the next **Corollary 4.3**.: _Let \((M,g,T)\) be a six dimensional Riemannian manifold and the 3-form \(T\) satisfies (4.31), (in particular \(T\) be a harmonic 3-form). If the metric connection with torsion \(T\) is \(\nabla\)-Einstein then the Riemannian scalar curvature is constant._ **Remark 4.4**.: _We remark that if the torsion is harmonic then the last equality in (4.36) follows from [20, Proposition 3.47]._ **Remark 4.5**.: _We also remark that if \((M,g,T)\) is Ricci flat with closed torsion then the equality (4.32) yields the norm of the torsion is constant wich recovers the recent result [36, Lemma 2.21]._ Generalized gradient Ricci solitons. Proof of Theorem 1.1 One fundamental consequence of Perelman's energy formula for Ricci flow is that compact steady solitons for Ricci flow are automatically gradient. Adapting these energy functionals to generalized Ricci flow it is proved in [20, Chapter 6] that steady generalized Ricci solitons on compact manifolds are automatically gradient, and moreover satisfy k = 0. We recap [20, Definition 4.31] that a Riemannian manifold \((M,g,T,f)\) with a closed 3-form \(T\) and a smooth function \(f\) is a generalized gradient Ricci soliton with \(k=0\) if one has \[Ric^{g}_{ij}=\frac{1}{4}T^{2}_{ij}-\nabla^{g}{}_{i}\nabla^{g}{}_{j}f,\qquad \delta T_{ij}=-df_{s}T_{sij},\qquad dT=0. \tag{5.37}\] Using the torsion connection \(\nabla\) with 3-form torsion \(T\), (2.3) and the second equation in(5.37), we have \[\nabla_{i}\nabla_{j}f-\nabla_{j}\nabla_{i}f=-df_{s}T_{sij}=\delta T_{ij}. \tag{5.38}\] In view of (2.7) and (5.38) we write (5.37) in the form \[Ric_{ij}=-\frac{1}{2}(\nabla_{i}\nabla_{j}f+\nabla_{j}\nabla_{i}f)-\frac{1}{ 2}\delta T_{ij}=-\nabla_{i}\nabla_{j}f,\quad Scal=-\nabla_{i}\nabla_{i}f= \Delta f. \tag{5.39}\] The second Bianchi identity (3.26) and (5.39) yield \[\nabla_{j}\Delta f-2\nabla_{i}Ric_{ji}+\delta T_{ab}T_{abj}+\frac{1}{6} \nabla_{j}||T||^{2}=\nabla_{j}\Delta f+2\nabla_{i}\nabla_{j}\nabla_{i}f+ \delta T_{ab}T_{abj}+\frac{1}{6}\nabla_{j}||T||^{2}=0 \tag{5.40}\] We evaluate the second term of (5.40) in two ways. First using the Ricci identities for \(\nabla\) and (5.38) \[\nabla_{i}\nabla_{j}\nabla_{i}f=\nabla_{j}\nabla_{i}\nabla_{i}f- R_{ijis}\nabla_{s}f-T_{ija}\nabla_{a}\nabla_{i}f=-\nabla_{j}\Delta f+ Ris_{js}\nabla_{s}f-\frac{1}{2}(\nabla_{a}\nabla_{i}f-\nabla_{i}\nabla_{a}f)T_{aij}\\ =-\nabla_{j}\Delta f-\nabla_{j}\nabla_{s}f.\nabla_{s}f+\frac{1}{ 2}df_{s}T_{sai}T_{aij}=-\nabla_{j}\Delta f-\nabla_{j}\nabla_{s}f.\nabla_{s}f- \frac{1}{2}\delta T_{ai}T_{aij} \tag{5.41}\] Applying (5.38) and (3.18), we obtain \[\nabla_{i}\nabla_{j}\nabla_{i}f=\nabla_{i}(\nabla_{i}\nabla_{j}f-\delta T_{ ij})=\nabla_{i}\nabla_{i}\nabla_{j}f-\nabla_{i}\delta T_{ij}=\nabla_{i} \nabla_{i}\nabla_{j}f-\frac{1}{2}\delta T_{ia}T_{iaj} \tag{5.42}\] Substitute (5.41) and (5.42) into (5.40), we get \[\begin{split}-\nabla_{j}\Delta f-\nabla_{j}||df||^{2}+\frac{1}{ 6}\nabla_{j}||T||^{2}=-\nabla_{j}\Delta f+2Ric_{js}\nabla_{s}f+\frac{1}{6} \nabla_{j}||T||^{2}=0;\\ \nabla_{j}\Delta f+2\nabla_{i}\nabla_{i}\nabla_{j}f+\frac{1}{6} \nabla_{j}||T||^{2}=\nabla_{j}\Delta f-2\nabla_{i}Ric_{ij}+\frac{1}{6} \nabla_{j}||T||^{2}=0.\end{split} \tag{5.43}\] Note that the first equality in (5.43) is precisely [20, Proposition 4.33]. Differentiate the first line in (5.43) apply (5.39) and the second equality in (5.43) to get \[0=\Delta(\Delta f-\frac{1}{6}||T||^{2})+2\nabla_{j}Ric_{js}\nabla _{s}f+2Ric_{js}\nabla_{j}\nabla_{s}f=\Delta(\Delta f-\frac{1}{6}||T||^{2})+2 \nabla_{j}Ric_{js}\nabla_{s}f-2||Ric||^{2}\\ =\Delta(\Delta f-\frac{1}{6}||T||^{2})+\nabla_{j}(\Delta f+\frac{ 1}{6}||T||^{2})\nabla_{j}f-2||Ric||^{2}\\ \leq\Delta(\Delta f-\frac{1}{6}||T||^{2})+g(\nabla(\Delta f+\frac{ 1}{6}||T||^{2}),\nabla f) \tag{5.44}\] If the norm of the torsion \(T\) is constant, \(\nabla||T||^{2}=0\), then (5.44) takes the form \[\Delta\Delta f+g(\nabla\Delta f,\nabla f)\geq 0.\] If \(M\) is compact, \(\Delta f\) is constant due to the strong maximum principle (see e.g. [46, 20]) which yields \(f=const\). Conversely, if the function \(f\) is constant then (5.44) together with the strong maximum principle implies \(d||T||^{2}=0\) which yields the equivalence of a) and b). Assume a) or b). Then \(Ric=Scal=\delta T=0\) due to (5.38) and (5.39). If \(Ric=0\) then \(\Delta f=0\) leading to \(f=const\) since \(M\) is compact. Hence, b) is equivalent to c). To show d) is equivalent to a) we use (2.7) and (5.39) to find \(Scal^{g}=\Delta f+\frac{1}{4}||T||^{2}\) and we can write (5.44) in the form \[0\leq\Delta(Scal^{g}-\frac{5}{12}||T||^{2})+g(\nabla(Scal^{g}-\frac{1}{12}||T ||^{2}),\nabla f). \tag{5.45}\] Then \(Scal^{g}=const.\) if and only \(d||T||^{2}=0\) by the strong maximum principle applied to (5.45). The proof of Theorem 1.1 is completed. **Acknowledgements** We would like to thank Jeffrey Streets and Ilka Agricola for extremly useful remarks, comments and suggestions. The research of S.I. is partially financed by the European Union-Next Generation EU, through the National Recovery and Resilience Plan of the Republic of Bulgaria, project N: BG-RRP-2.004-0008-C01. The research of N.S. is partially supported by Contract 80-10-192 / 17.5.2023 with the Sofia University "St.Kl.Ohridski" and the National Science Fund of Bulgaria, National Scientific Program "VIHREN", Project KP-06-DV-7.

2304.14772

Multisample Flow Matching: Straightening Flows with Minibatch Couplings

Simulation-free methods for training continuous-time generative models construct probability paths that go between noise distributions and individual data samples. Recent works, such as Flow Matching, derived paths that are optimal for each data sample. However, these algorithms rely on independent data and noise samples, and do not exploit underlying structure in the data distribution for constructing probability paths. We propose Multisample Flow Matching, a more general framework that uses non-trivial couplings between data and noise samples while satisfying the correct marginal constraints. At very small overhead costs, this generalization allows us to (i) reduce gradient variance during training, (ii) obtain straighter flows for the learned vector field, which allows us to generate high-quality samples using fewer function evaluations, and (iii) obtain transport maps with lower cost in high dimensions, which has applications beyond generative modeling. Importantly, we do so in a completely simulation-free manner with a simple minimization objective. We show that our proposed methods improve sample consistency on downsampled ImageNet data sets, and lead to better low-cost sample generation.

Aram-Alexandre Pooladian, Heli Ben-Hamu, Carles Domingo-Enrich, Brandon Amos, Yaron Lipman, Ricky T. Q. Chen

2023-04-28T11:33:08Z

http://arxiv.org/abs/2304.14772v2

# Multisample Flow Matching: Straightening Flows with Minibatch Couplings ###### Abstract Simulation-free methods for training continuous-time generative models construct probability paths that go between noise distributions and individual data samples. Recent works, such as Flow Matching, derived paths that are optimal for each data sample. However, these algorithms rely on independent data and noise samples, and do not exploit underlying structure in the data distribution for constructing probability paths. We propose Multisample Flow Matching, a more general framework that uses non-trivial couplings between data and noise samples while satisfying the correct marginal constraints. At very small overhead costs, this generalization allows us to (i) reduce gradient variance during training, (ii) obtain straighter flows for the learned vector field, which allows us to generate high-quality samples using fewer function evaluations, and (iii) obtain transport maps with lower cost in high dimensions, which has applications beyond generative modeling. Importantly, we do so in a completely simulation-free manner with a simple minimization objective. We show that our proposed methods improve sample consistency on downsampled ImageNet data sets, and lead to better low-cost sample generation. Machine Learning, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings, Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings, Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial couplings Non-trivial Non-trivial couplings Non-trivial couplings Non-trivial Non-trivial couplings Non-trivial couplings Non- In turn, it becomes difficult to create paths that are fast to simulate, a desirable property for both likelihood evaluation and sampling. **Contributions:** We present a tractable instance of Flow Matching with joint distributions, which we call _Multi-sample Flow Matching_. Our proposed method generalizes the construction of probability paths by considering non-independent couplings of \(k\)-sample empirical distributions. Among other theoretical results, we show that if an appropriate optimal transport (OT) inspired coupling is chosen, then sample paths become straight as the batch size \(k\to\infty\), leading to more efficient simulation. In practice, we observe both improved sample quality on ImageNet using adaptive ODE solvers and using simple Euler discretizations with a low budget number of function evaluations. Empirically, we find that on ImageNet, we can _reduce the required sampling cost by 30% to 60%_ for achieving a low Frechet Inception Distance (FID) compared to a baseline Flow Matching model, while introducing only 4% more training time. This improvement in sample efficiency comes at no degradation in performance, _e.g._ log-likelihood and sample quality. Within the deep generative modeling paradigm, this allows us to regularize towards the optimal vector field in a _completely simulation-free manner_ (unlike _e.g._ Finlay et al. (2020); Liu et al. (2022)), and avoids adversarial formulations (unlike _e.g._ Makkuva et al. (2020); Albergo and Vanden-Eijnden (2023)). In particular, we are the first work to be able to make use of solutions from optimal solutions on minibatches while preserving the correct marginal distributions, whereas prior works would only fit to the barycentric average (see detailed discussion in Section 5.1). Beyond generative modeling, we also show how our method can be seen as a new way to compute approximately optimal transport maps between arbitrary distributions in settings where the cost function is completely unknown and only minibatch optimal transport solutions are provided. ## 2 Preliminaries ### Continuous Normalizing Flow Let \(\mathbb{R}^{d}\) denote the data space with data points \(x=(x^{1},\ldots,x^{d})\in\mathbb{R}^{d}\). Two important objects we use in this paper are: the _probability path_\(p_{t}:\mathbb{R}^{d}\to\mathbb{R}_{>0}\), which is a time dependent (for \(t\in[0,1]\)) probability density function, _i.e._, \(\int p_{t}(x)dx=1\), and a _time-dependent vector field_, \(u_{t}:[0,1]\times\mathbb{R}^{d}\to\mathbb{R}^{d}\). A vector field \(u_{t}\) constructs a time-dependent diffeomorphic map, called a _flow_, \(\psi:[0,1]\times\mathbb{R}^{d}\to\mathbb{R}^{d}\), defined via the ordinary differential equation (ODE): \[\frac{d}{dt}\psi_{t}(x_{0})=u_{t}(\psi_{t}(x_{0}))\,,\quad\psi_{0}(x_{0})=x_{ 0}\,. \tag{1}\] To create a deep generative model, Chen et al. (2018) suggested modeling the vector field \(u_{t}\) with a neural network, leading to a deep parametric model of the flow \(\psi_{t}\), referred to as a _Continuous Normalizing Flow_ (CNF). A CNF is often used to transform a density \(p_{0}\) to a different one, \(p_{1}\), via the push-forward equation \[p_{t}(x)=[\psi_{t}]_{2}p_{0}(x)=p_{0}(\psi_{t}^{-1}(x))\left|\det\left[\frac{ \partial\psi_{t}^{-1}}{\partial x}(x)\right]\right|, \tag{2}\] where the second equality defines the push-forward (or change of variables) operator \(\sharp\). A vector field \(u_{t}\) is said to _generate_ a probability path \(p_{t}\) if its flow \(\psi_{t}\) satisfies (2). ### Flow Matching A simple simulation-free method for training CNFs is the _Flow Matching_ algorithm (Lipman et al., 2023), which regresses onto an (implicitly-defined) target vector field that generates the desired probability density path \(p_{t}\). Given two marginal distributions \(q_{0}(x_{0})\) and \(q_{1}(x_{1})\) for which we would like to learn a CNF to transport between, Flow Matching seeks to optimize the simple regression objective, \[\mathbb{E}_{t,p_{t}(x)}\left\|v_{t}(x;\theta)-u_{t}(x)\right\|^{2}, \tag{3}\] where \(v_{t}(x;\theta)\) is the parametric vector field for the CNF, and \(u_{t}(x)\) is a vector field that generates a probability path \(p_{t}\) under the two marginal constraints that \(p_{t=0}=q_{0}\) and \(p_{t=1}=q_{1}\). While Equation (3) is the ideal objective function to optimize, not knowing \((p_{t},u_{t})\) makes this computationally intractable. Lipman et al. (2023) proposed a tractable method of optimizing (3), which first defines _conditional_ probability paths and vector fields, such that when marginalized over \(q_{0}(x_{0})\) and \(q_{1}(x_{1})\), provide both \(p_{t}(x)\) and \(u_{t}(x)\). When targeted towards generative modeling, \(q_{0}(x_{0})\) is a simple noise distribution and easy to directly enforce, leading to a one-sided construction: \[p_{t}(x) =\int p_{t}(x|x_{1})q_{1}(x_{1})\;dx_{1} \tag{4}\] \[u_{t}(x) =\int u_{t}(x|x_{1})\frac{p_{t}(x|x_{1})q_{1}(x_{1})}{p_{t}(x)}\; dx_{1}, \tag{5}\] where the conditional probability path is chosen such that \[p_{t=0}(x|x_{1})=q_{0}(x)\quad\text{and}\quad p_{t=1}(x|x_{1})=\delta(x-x_{1}), \tag{6}\] where \(\delta(x-a)\) is a Dirac mass centered at \(a\in\mathbb{R}^{d}\). By construction, \(p_{t}(x|x_{1})\) now satisfies both marginal constraints. Lipman et al. (2023) shows that if \(u_{t}(x|x_{1})\) generates \(p_{t}(x|x_{1})\), then the marginalized \(u_{t}(x)\) generates \(p_{t}(x)\), and furthermore, one can train using the much simpler objective of _Conditional Flow Matching_ (CFM): \[\mathbb{E}_{t,q_{1}(x_{1}),p_{t}(x|x_{1})}\left\|v_{t}(x;\theta)-u_{t}(x_{t}|x_{ 1})\right\|^{2}, \tag{7}\] with \(x_{t}=\psi_{t}(x_{0}|x_{1})\); see 2.2.1 for more details. Note that this objective has the same gradient with respect to the model parameters \(\theta\) as Eq. (3) (Lipman et al., 2023, Theorem 2). #### 2.2.1 Conditional OT (CondOT) path One particular choice of conditional path \(p_{t}(x|x_{1})\) is to use the flow that corresponds to the optimal transport displacement interpolant (McCann, 1997) when \(q_{0}(x_{0})\) is the standard Gaussian, a common convention in generative modeling. The vector field that corresponds to this is \[u_{t}(x_{t}|x_{1})=\frac{x_{1}-x}{1-t}. \tag{8}\] Using this conditional vector field in (1), this gives the conditional flow \[x_{t}=\psi_{t}(x_{0}|x_{1})=(1-t)x_{0}+tx_{1}\,. \tag{9}\] Substituting (9) into (8), one can also express the value of this vector field using a simpler expression, \[u_{t}(x_{t}|x_{1})=x_{1}-x_{0}\,. \tag{10}\] It is evident that this results in conditional flows that _(i)_ tranports all points \(x_{0}\) from \(t=0\) to \(x_{1}\) at exactly \(t=1\) and _(ii)_ are straight paths between the samples \(x_{0}\) and \(x_{1}\). This particular case of straight paths was also studied by Liu et al. (2022) and Albergo and Vanden-Eijnden (2023), where the conditional flow (9) is referred to as a stochastic interpolant. Lipman et al. (2023) additionally showed that the conditional construction can be applied to a large class of Gaussian conditional probability paths, namely when \(p_{t}(x|x_{1})=\mathcal{N}(x|\mu_{t}(x_{1}),\sigma_{t}(x_{1})^{2}I)\). This family of probability paths encompasses most prior diffusion models where probability paths are induced by simple diffusion processes with linear drift and constant diffusion (_e.g._Ho et al. (2020); Song et al. (2021b)). However, existing works mostly consider settings where \(q_{0}(x_{0})\) and \(q_{1}(x_{1})\) are sampled independently when computing training objectives such as (7). ### Optimal Transport: Static & Dynamic Optimal transport generally considers methodologies that define some notion of distance on the space of probability measures (Villani, 2008, 2003; Santambrogio, 2015). Letting \(\mathcal{P}(\mathbb{R}^{d})\) be the space of probability measures over \(\mathbb{R}^{d}\), we define the Wasserstein distance with respect to a cost function \(c:\mathbb{R}^{d}\times\mathbb{R}^{d}\to\mathbb{R}_{+}\) between two measures \(q_{0},q_{1}\in\mathcal{P}(\mathbb{R}^{d})\) as (Kantorovitch, 1942) \[W_{c}(q_{0},q_{1})\coloneqq\min_{q\in\Gamma(q_{0},q_{1})}\mathbb{E}_{q(x_{0}, x_{1})}[c(x_{0},x_{1})]\,, \tag{11}\] where \(\Gamma(q_{0},q_{1})\) is the set of joint measures with left marginal equal to \(q_{0}\) and right marginal equal to \(q_{1}\), called the set of _couplings_. The minimizer to Equation (11) is called the optimal coupling, which we denote by \(q_{c}^{*}\). In the case where \(c(x_{0},x_{1})\coloneqq\|x_{0}-x_{1}\|^{2}\), the squared-Euclidean distance, Equation (11) amounts to the (squared) \(2\)-Wasserstein distance \(W_{2}^{2}(q_{0},q_{1})\), and we simply write the optimal transport plan as \(q^{*}\). Considering again the squared-Euclidean cost, in the case where \(q_{0}\) exhibits a density over \(\mathbb{R}^{d}\) (e.g. if \(q_{0}\) is the standard normal distribution), Benamou and Brenier (2000) states that \(W_{2}^{2}(q_{0},q_{1})\) can be equivalently expressed as a _dynamic_ formulation, \[W_{2}^{2}(q_{0},q_{1})=\min_{p_{t},u_{t}}\int_{0}^{1}\int_{\mathbb{R}^{d}}\|u _{t}(x)\|^{2}\,p_{t}(x)\mathrm{d}x_{0}\mathrm{d}t. \tag{12}\] where \(u_{t}\) generates \(p_{t}\), and \(p_{t}\) satisfies boundary conditions \(p_{t=0}=q_{0}\) and \(p_{t=1}=q_{1}\). The optimality condition ensures that sample paths \(x_{t}\) are straight lines, i.e. minimize the length of the path, and leads to paths that are much easier to simulate. Some prior approaches have sought to regularize the model using this optimality objective (_e.g._Tong et al. (2020); Finlay et al. (2020b)). In contrast, instead of directly minimizing (12), we will discuss an approach based on using solutions of the optimal coupling \(q^{*}\) on minibatch problems, while leaving the marginal constraints intact. ## 3 Flow Matching with Joint Distributions While Conditional Flow Matching in (7) leads to an unbiased gradient estimator for the Flow Matching objective, it was designed with independently sampled \(x_{0}\) and \(x_{1}\) in mind. We generalize the framework from Subsection 2.2 to a construction that uses arbitrary joint distributions of \(q(x_{0},x_{1})\) which satisfy the correct marginal constraints, _i.e._ \[\int\!\!q(x_{0},x_{1})\mathrm{d}x_{1}\!=\!q_{0}(x_{0})\,,\,\int\!\!q(x_{0},x_{ 1})\mathrm{d}x_{0}\!=\!q_{1}(x_{1}). \tag{13}\] We will show in Subsection 4 that this can potentially lead to lower gradient variance during training and allow us to design more optimal marginal vector fields \(u_{t}(x)\) with desirable properties such as improved sample efficiency. Building on top of Flow Matching, we propose modifying the conditional probability path construction (6) so that at \(t=0\), we define \[p_{t=0}(x_{0}|x_{1})=q(x_{0}|x_{1}). \tag{14}\] where \(q(x_{0}|x_{1})\) is the conditional distribution \(\frac{q(x_{0},x_{1})}{q_{1}(x_{1})}\). Using this construction, we still satisfy the marginal constraint, \[p_{0}(x)=\int p_{0}(x|x_{1})q_{1}(x_{1})dx_{1}=\int q(x,x_{1})dx_{1}=q_{0}(x)\] _i.e. \(p_{t=0}(x)=\int q(x,x_{1})dx_{1}=q_{0}(x)\)_ by the assumption made in (13). Then similar to Chen and Lipman (2023), we note that the conditional probability path \(p_{t}(x|x_{1})\)_need not be explicitly formulated_ for training, and that only an appropriate conditional vector field \(u_{t}(x|x_{1})\) needs to be chosen such that all points arrive at \(x_{1}\) at \(t=1\), which ensures \(p_{t=1}(x|x_{1})=\delta(x-x_{1})\). As such, we can make use of the same conditional vector field as prior works, _e.g._ the choice in Equations (8) to (10). We then propose the **Joint CFM** objective as \[\mathcal{L}_{\text{ICFM}}=\mathbb{E}_{t,q(x_{0},x_{1})}\left\|v_{t}(x_{t}; \theta)-u_{t}(x_{t}|x_{1})\right\|^{2}, \tag{15}\] where \(x_{t}=\psi_{t}(x_{0}|x_{1})\) is the conditional flow. Training only involves sampling from \(q(x_{0},x_{1})\) and does not require explicitly knowing the densities of \(q(x_{0},x_{1})\) or \(p_{t}(x|x_{1})\). Note that Equation (15) reduces to the original CFM objective (7) when \(q(x_{0},x_{1})=q_{0}(x_{0})q_{1}(x_{1})\). A quick sanity check shows that this objective can be used with any choice of joint distribution \(q(x_{0},x_{1})\). **Lemma 3.1**.: _The optimal vector field \(v_{t}(\cdot;\theta)\) in (15), which is the marginal vector field \(u_{t}\), maps between the marginal distributions \(q_{0}(x_{0})\) and \(q_{1}(x_{1})\)._ In the remainder of the section, we highlight some motivations for using joint distributions \(q(x_{0},x_{1})\) that are different from the independent distribution \(q_{0}(x_{0})q_{1}(x_{1})\). Variance reductionChoosing a good joint distribution can be seen as a way to reduce the variance of the gradient estimate, which improves and speeds up training. We develop the gradient covariance at a fixed \(x\) and \(t\), and bound its total variance: **Lemma 3.2**.: _The total variance (i.e. the trace of the covariance) of the gradient at a fixed \(x\) and \(t\) is bounded as:_ \[\sigma_{t,x}^{2}=\operatorname{Tr}\bigl{[}\operatorname{Cov}_{p_{t}(x_{1}|x)} \left(\nabla_{\theta}\left\|v_{t}(x;\theta)-u_{t}(x|x_{1})\right\|^{2}\right) \bigr{]} \tag{16}\] _Then \(\mathbb{E}_{t,p_{t}(x)}[\sigma_{t,x}^{2}]\) is bounded above by:_ \[\max_{t,x}\left\|\nabla_{\theta}v_{t}(x;\theta)\right\|^{2}\times\mathcal{L} _{\text{JCFM}} \tag{17}\] This proves that \(\mathbb{E}_{t,p_{t}(x)}[\sigma_{t,x}^{2}]\), which is the average gradient variance at fixed \(x\) and \(t\), is upper bounded in terms of the Joint CFM objective. That means that minimizing the Joint CFM objective help in decreasing \(\mathbb{E}_{t,p_{t}(x)}[\sigma_{t,x}^{2}]\). Note also that \(\mathbb{E}_{t,p_{t}(x)}[\sigma_{t,x}^{2}]\) is not the gradient variance and is always smaller, as it does not account for variability over \(x\) and \(t\), but it is a good proxy for it. The proof is in App. D.2. Sampling \(x_{0}\) and \(x_{1}\) independently generally cannot achieve value zero for \(\mathbb{E}_{t,p_{t}(x)}[\sigma_{t,x}^{2}]\)_even at the optimum_, since there are an infinite number of pairs \((x_{0},x_{1})\) whose conditional path crosses any particular \(x\) at a time \(t\). As shown in (17), having a low optimal value for the Joint CFM objective is a good proxy for low gradient variance and hence a desirable property for choosing a joint distribution \(q(x_{0},x_{1})\). In Section 4, we show that certain joint distributions have optimal Joint CFM values close to zero. Straight flowsIdeally, the flow \(\psi_{t}\) of the marginal vector field \(u_{t}\) (and of the learned \(v_{\theta}\) by extension) should be close to a straight line. The reason is that ODEs with straight trajectories can be solved with high accuracy using fewer steps (i.e. function evaluations), which speeds up sample generation. The quantity \[S=\mathbb{E}_{t,q_{0}(x_{0})}\bigl{[}\|u_{t}(\psi_{t}(x_{0}))\|^{2}-\|\psi_{1 }(x_{0})-x_{0}\|^{2}\bigr{]}, \tag{18}\] which we call the _straightness_ of the flow and was also studied by Liu (2022), measures how straight the trajectories are. Namely, we can rewrite it as \[S=\mathbb{E}_{t,q_{0}(x_{0})}\left[\|u_{t}(\psi_{t}(x_{0}))-\mathbb{E}_{t^{ \prime}}\left[u_{t^{\prime}}(\psi_{t^{\prime}}(x_{0}))\right]\|^{2}\right], \tag{19}\] which shows that \(S\geq 0\) and only zero if \(u_{t}(\psi_{t}(x_{0}))\) is constant along \(t\), which is equivalent to \(\psi_{t}(x_{0})\) being a straight line. When \(x_{0}\) and \(x_{1}\) are sampled independently, the straightness is in general far from zero. This can be seen in the CondOT plots in Figure 2 (right); if flows were close to straight lines, samples generated with one function evaluation (NFE=1) would be of high quality. In Section 4, we show that for certain joint distributions, the straightness of the flow is close to zero. Near-optimal transport costBy Lemma 3.1, the flow \(\psi_{t}\) corresponding to the optimal \(u_{t}\) satisfies that \(\psi_{0}(x_{0})=x_{0}\sim q_{0}\) and \(\psi_{1}(x_{0})\sim q_{1}\). Hence, \(x_{0}\mapsto\psi_{1}(x_{0})\) is a transport map between \(q_{0}\) and \(q_{1}\) with an associated transport cost \[\mathbb{E}_{q_{0}(x_{0})}\|\psi_{1}(x_{0})-x_{0}\|^{2}. \tag{20}\] There is no reason to believe that when \(x_{0}\) and \(x_{1}\) are sampled independently, the transport cost \(\mathbb{E}_{q_{0}(x_{0})}\|\psi_{1}(x_{0})-x_{0}\|^{2}\) will be anywhere near the optimal transport cost \(W_{2}^{2}(p_{0},p_{1})\). Yet, in Section 4 we show that for well chosen \(q\), the transport cost for \(\psi_{1}\) does approach its optimal value. Computing optimal (or near-optimal) transport maps in high dimensions is a challenging task (Makkuva et al., 2020; Amos, 2023) that extends beyond generative modeling and into the field of optimal transport, and it has applications in computer vision (Feydy et al., 2017; Solomon et al., 2015, 2016; Liu et al., 2023) and computational biology (Lubeck et al., 2022; Bunne et al., 2021, 2022; Schiebinger et al., 2019), for instance. Hence, Joint CFM may also be viewed as a practical way to obtain approximately optimal transport maps in this context. ## 4 Multisample Flow Matching Constructing a joint distribution satisfying the marginal constraints is difficult, especially since at least one of the marginal distributions is based on empirical data. We thus discuss a method to construct the joint distribution \(q(x_{0},x_{1})\) implictly by designing a suitable sampling procedure that leaves the marginal distributions invariant. Note that training with (15) only requires sampling from \(q(x_{0},x_{1})\). We use a multisample construction for \(q(x_{0},x_{1})\) in the following manner: 1. Sample \(\{x_{0}^{(i)}\}_{i=1}^{k}\sim q_{0}(x_{0})\) and \(\{x_{1}^{(i)}\}_{i=1}^{k}\sim q_{1}(x_{1})\). 2. Construct a doubly-stochastic matrix with probabilities \(\pi(i,j)\) dependent on the samples \(\{x_{0}^{(i)}\}_{i=1}^{k}\) and \(\{x_{1}^{(i)}\}_{i=1}^{k}\). 3. Sample from the discrete distribution, \(q^{k}(x_{0},x_{1})=\frac{1}{k}\sum_{i,j=1}^{k}\delta(x_{0}-x_{0}^{i})\delta(x_ {1}-x_{1}^{j})\pi(i,j)\). Marginalizing \(q^{k}(x_{0},x_{1})\) over samples from Step 1, we obtain the implicitly defined \(q(x_{0},x_{1})\). By choosing different _couplings_\(\pi(i,j)\), we induce different joint distributions. In this work, we focus on couplings that induce joint distributions which approximates, or at least partially satisfies, the optimal transport joint distribution. The following result, proven in App. D.3, guarantees that \(q\) has the right marginals. **Lemma 4.1**.: _The joint distribution \(q(x_{0},x_{1})\) constructed in Steps [1-3] has marginals \(q_{0}(x_{0})\) and \(q_{1}(x_{1})\)._ That is, the marginal constraints (13) are satisfied and consequently we are allowed to use the framework of Section 3. ### CondOT is Uniform Coupling The aforementioned multisample construction subsumes the independent joint distribution used by prior works, when the joint coupling is taken to be uniformly distributed, _i.e._\(\pi(i,j)=\frac{1}{k}\). This is precisely the coupling used by (Lipman et al., 2023) under our introduced notion of Multisample Flow Matching, and acts as a natural reference point. ### Batch Optimal Transport (BatchOT) Couplings The natural connections between optimal transport theory and optimal sampling paths in terms of straight-line interpolations, lead us to the following pseudo-deterministic coupling, which we call Batch Optimal Transport (BatchOT). While it is difficult to solve (11) at the population level, it can efficiently solved on the level of samples. Let \(\{x_{0}^{(i)}\}_{i=1}^{k}\sim q_{0}(x_{0})\) and \(\{x_{1}^{(i)}\}_{i=1}^{k}\sim q_{1}(x_{1})\). When defined on batches of samples, the OT problem (11) can be solved exactly and efficiently using standard solvers, as in POT(Flamary et al., 2021, Python Optimal Transport). On a batch of \(k\) samples, the runtime complexity is well-understood via either the Hungarian algorithm or network simplex algorithm, with an overall complexity of \(\mathcal{O}(k^{3})\)(Peyre and Cuturi, 2019, Chapter 3). The resulting coupling \(\pi^{k,*}\) from the algorithm is a _permutation matrix_, which is a type of doubly-stochastic matrix that we can incorporate into Step 3 of our procedure. We consider the effect that the sample size \(k\) has on the marginal vector field \(u_{t}(x)\). The following theorem shows that in the limit of \(k\to\infty\), BatchOT satisfies the three criteria that motivate Joint CFM: variance reduction, straight flows, and near-optimal transport cost. **Theorem 4.2** (Informal).: _Suppose that Multisample Flow Matching is run with BatchOT. Then, as \(k\to\infty\),_ 1. _[label=()]_ 2. _The value of the Joint CFM objective (Equation (_15_)) for the optimal_ \(u_{t}\) _converges to 0._ 3. _The straightness_ \(S\) _for the optimal marginal vector field_ \(u_{t}\) _(Equation (_18_)) converges to zero._ 4. _The transport cost_ \(\mathbb{E}_{q_{0}(x_{0})}\|\psi_{1}(x_{0})-x_{0}\|^{2}\) _(Equation (_20_)) associated to_ \(u_{t}\) _converges to the optimal transport cost_ \(W_{2}^{2}(p_{0},p_{1})\)_._ As \(k\to\infty\), result _(i)_ implies that the gradient variance both during training and at convergence is reduced due to Equation (17); result _(ii)_ implies the optimal model will be easier to simulate between \(t\)=0 and \(t\)=1; result _(iii)_ implies that Multisample Flow Matching can be used as a simulation-free algorithm for approximating optimal transport maps. The full version of Thm. 4.2 can be found in App. D, and it makes use of standard, weak technical assumptions which are common in the optimal transport literature. While Thm. 4.2 only analyzes asymptotic properties, we provide theoretical evidence that the transport cost decreases with \(k\), as summarized by a monotonicity result in Thm. D.8. ### Batch Entropic OT (BatchEOT) Couplings For \(k\) sufficiently large, the cubic complexity of the BatchOT approach is not always desirable, and instead one may consider approximate methods that produce couplings sufficiently close to BatchOT at a lower computational cost. A popular surrogate, pioneered in (Cuturi, 2013), is to incorporate an entropic penalty parameter on the doubly stochastic matrix, pulling it closer to the independent coupling: \[\min_{q\in\Gamma(q_{0},q_{1})}\mathbb{E}_{(x_{0},x_{1})\sim q}\|x_{0}-x_{1}\|^{ 2}+\varepsilon H(q)\,,\] where \(H(q)=-\sum_{i,j}q_{i,j}(\log(q_{i,j})-1)\) is the entropy of the doubly stochastic matrix \(q\), and \(\varepsilon>0\) is some finite regularization parameter. The optimality conditions of this strictly convex program leads to Sinkhorn's algorithm, which has a runtime of \(\tilde{\mathcal{O}}(k^{2}/\varepsilon)\)(Altschuler et al., 2017). The output of performing Sinkhorn's algorithm is a doubly-stochastic matrix. The two limiting regimes of the regular ization parameter are well understood (c.f. Peyre & Cuturi (2019), Proposition 4.1, for instance): as \(\varepsilon\to 0\), BatchEOT recovers the BatchOT permutation matrix from Section 4.2; as \(\varepsilon\to\infty\), BatchEOT recovers the independent coupling on the indices from Section 4.1. ### Stable and Heuristic Couplings An alternative approach is to consider faster algorithms that satisfy at least some desirable properties of an optimal coupling. In particular, an optimal coupling is _stable_. A permutation coupling is stable if _no pair of \(x_{0}^{(i)}\) and \(x_{1}^{(j)}\) favor each other over their assigned pairs based on the coupling._ Such a problem can be solved using the Gale-Shapeley algorithm (Gale & Shapley, 1962) which has a compute cost of \(\mathcal{O}(k^{2})\) given the cross set ranking of all samples. Starting from a random assignment, it is an iterative algorithm that reassigns pairs if they violate the stability property and can terminate very early in practice. Note that in a cost-based ranking, one has to sort the coupling costs of each sample with all samples in the opposing set, resulting in an overall \(\mathcal{O}(k^{2}\log(k))\) compute cost. The Gale-Shapeley algorithm is agnostic to any particular costs, however, as stability is only defined in terms of relative rankings of individual samples. We design a modified version of this algorithm based on a heuristic for satisfying the cyclical monotonicity property of optimal transport, namely that should pairs be reassigned, the reassignment should not increase the total cost of already matched pairs. We refer to the output of this modified algorithm as a _heuristic coupling_ and discuss the details in Appendix A.2. ## 5 Related Work Generative modeling and optimal transport are inherently intertwined topics, both often aiming to learn a transport between two distributions but with very different goals. Optimal transport is widely recognized as a powerful tool for large-scale generative modeling as it can be used to stabilize training (Arjovsky et al., 2017). In the context of continuous-time generative modeling, optimal transport has been used to regularize continuous normalizing flows for easier simulation (Finlay et al., 2020; Onken et al., 2021), and increase interpretability (Tong et al., 2020). However, the existing methods for encouraging optimality in a generative model generally require either solving a potentially unstable min-max optimization problem (_e.g._(Arjovsky et al., 2017; Makkuva et al., 2020; Albergo & Vanden-Eijnden, 2023)) or require simulation of the learned vector field as part of training (_e.g._Finlay et al. (2020); Liu et al. (2022)). In contrast, the approach of using batch optimal couplings can be used to avoid the min-max optimization problem, but has not been successfully applied to generative modeling as they do not satisfy marginal constraints--we discuss this further in the following Section 5.1. On the other hand, neural optimal transport approaches are mainly centered around the quadratic cost (Makkuva et al., 2020; Amos, 2023; Finlay et al., 2020) or rely heavily on knowing the exact cost function (Fan et al., 2021; Asadulaev et al., 2022). Being capable of using batch optimal couplings allows us to build generative models to approximate optimal maps under any cost function, and even when the cost function is unknown. Figure 2: Multisample Flow Matching learn probability paths that are much closer to an optimal transport path than baselines such as Diffusion and CondOT paths. (_Left_) Exact marginal probability paths. (_Right_) Samples from trained models at \(t=1\) for different numbers of function evaluations (NFE), using Euler discretization. Furthermore, the final values of the Joint CFM objective (15)—upper bounds on the variance of \(u_{t}\) at convergence—are: CondOT: 10.72; Stable: 1.60, Heuristic: 1.56; BatchEOT: 0.57, BatchOT: 0.24. ### Minibatch Couplings for Generative Modeling Among works that use optimal transport for training generative models are those that make use of batch optimal solutions and their gradients such as Li et al. (2017); Genevay et al. (2018); Fatras et al. (2019); Liu et al. (2019). However, _naively using solutions to batches only produces, at best, the barycentric map_, _i.e._ the map that fits to average of the batch couplings (Ferradans et al., 2014; Seguy et al., 2017; Pooladian and Niles-Weed, 2021), and does not correctly match the true marginal distribution. This is a well-known problem and while multiple works (_e.g._ Fatras et al. (2021); Nguyen et al. (2022)) have attempted to circumvent the issue through alternative formulations of optimality, the lack of marginal preservation has been a major downside of using batch couplings for generative modeling as they do not have the ability to match the target distribution for finite batch sizes. This is due to the use of building models within the _static_ setting, where the map is parameterized directly with a neural network. In contrast, we have shown in Lemma 4.1 that in our _dynamic_ setting, where we parameterize the map as the solution of a neural ODE, it is possible to preserve the marginal distribution exactly. Furthermore, we have shown in Proposition D.7 (App. D.5) that our method produces a map that is no higher cost than the joint distribution induced from BatchOT couplings. Concurrently, Tong et al. (2023) motivates the use of BatchOT solutions within a similar framework as our Joint CFM, but from the perspective of obtaining accurate solutions to dynamic optimal transport problems. Similarly, Lee et al. (2023) propose to explicitly learn a joint distribution, parameterized with a neural network, with the aim of minimizing trajectory curvature; this is done using through an auxiliary VAE-style objective function. In contrast, we propose a family of couplings that all satisfy the marginal constraints, all of which are easy to implement and have negligible cost during training. Our construction allow us to focus on (i) fixing consistency issues within simulation-free generative models, and (ii) using Joint CFM to obtain more optimal solutions than the original BatchOT solutions. ## 6 Experiments We empirically investigate Multisample Flow Matching on a suite of experiments. First, we show how different couplings affect the model on a 2D distribution. We then turn to benchmark, high-dimensional datasets, namely ImageNet (Deng et al., 2009). We use the official _face-blurred_ ImageNet data and then downsample to 32\(\times\)32 and 64\(\times\)64 using the open source preprocessing scripts from Chrabaszcz et al. (2017). Finally, we explore the setting of unknown cost functions while only batch couplings are provided. Full details on the experimental setting can be found in Appendix E.2. ### Insights from 2D experiments Figure 2 shows the proposed Multisample Flow Matching algorithm on fitting to a checkboard pattern distribution in 2D. We show the marginal probability paths induced by different coupling algorithms, as well as low-NFE samples of trained models on these probability paths. The diffusion and CondOT probability paths do not capture intricate details of the data distribution until it is almost at the end of the trajectory, whereas Multisample Flow Matching approaches provide a gradual transition to the target distribution along the flow. We also see that with a fixed step solver, the BatchOT method is able to produce an accurate target distribution in just one Euler step in this low-dimensional setting, while the other coupling approaches also get pretty close. Finally, it is interesting that both Stable and Heuristic exhibit very similar probability paths to \begin{table} \begin{tabular}{l r r r} \hline \hline & \multicolumn{2}{c}{**ImageNet 32\(\times\)32**} & \multicolumn{2}{c}{**ImageNet 64\(\times\)64**} \\ & NFE @ FID = 10 & NFE @ FID = 20 \\ \hline Diffusion & \(\geq\)40 & \(\geq\)40 \\ FM “/ CondOT & 20 & 29 \\ MultisampleFM “/ Heuristic & 18 & 12 \\ MultisampleFM “/ Stable & **14** & **11** \\ MultisampleFM “/ BatchOT & **14** & 12 \\ \hline \hline \end{tabular} \end{table} Table 1: Derived results shown in Figure 3, we can determine the approximate NFE required to achieve a certain FID across our proposed methods. The baseline diffusion-based methods (e.g. ScoreFlow and DDPM) require more than 40 NFE to achieve these FID values. \begin{table} \begin{tabular}{l r r r r} \hline \hline NFE & DDPM & ScoreSDE & BatchOT & Stable \\ \hline Adaptive & 5.72 & 6.84 & **4.68** & 5.79 \\ 40 & 19.56 & 16.96 & **5.94** & 7.02 \\ 20 & 63.08 & 58.02 & **7.71** & 8.66 \\ 8 & 232.97 & 218.66 & 15.64 & **14.89** \\ 6 & 275.28 & 266.76 & 22.08 & **19.88** \\ 4 & 362.37 & 340.17 & 38.86 & **33.92** \\ \hline \hline \end{tabular} \end{table} Table 2: FID of model samples on ImageNet 32\(\times\)32 using varying number of function evaluations (NFE) using Euler discretization. Figure 3: Sample quality (FID) vs compute cost (NFE) using Euler discretization. CondOT has significantly higher FID at lower NFE compared to proposed methods. optimal transport despite only satisfying weaker conditions. ### Image Datasets We find that Multisample Flow Matching retains the performance of Flow Matching while improving on sample quality, compute cost, and variance. In Table 6 of Appendix B.1, we report sample quality using the standard Frechet Inception Distance (FID), negative log-likelihood values using bits per dimension (BPD), and compute cost using number of function evaluations (NFE); these are all standard metrics throughout the literature. Additionally, we report the variance of \(u_{t}(x|x_{0},x_{1})\), estimated using the Joint CFM loss (15) which is an upper bound on the variance. We do not observe any performance degradations while simulation efficiency improves significantly, even with small batch sizes. Additionally, in Appendix B.5, we include runtime comparisons between Flow Matching and Multisample Flow Matching. On ImageNet32, we only observe a 0.8% relative increase in runtime compared to Flow Matching, and a 4% increase on ImageNet64. Higher sample quality on a compute budgetWe observe that with a fixed NFE, models trained using Multisample Flow Matching generally achieve better sample quality. For these experiments, we draw \(x_{0}\sim\mathcal{N}(0,I_{d})\) and simulate \(v_{t}(\cdot,\theta)\) up to time \(t=1\) using a fixed step solver with a fixed NFE. Figures 3 show that even on high dimensional data distributions, the sample quality of of multisample methods improves over the naive CondOT approach as the number of function evaluations drops. We compare to the FID of diffusion baseline methods in Table 2, and provide additional results in Appendix B.4. Interestingly, we find that the Stable coupling actually performs on par, and some times better than the BatchOT coupling, despite having a smaller asymptotic compute cost and only satisfying a weaker condition within each batch. As FID is computed over a full set of samples, it does not show how varying NFE affects individual sample paths. We discuss a notion of consistency next, where we analyze the similarity between low-NFE and high-NFE samples. Consistency of individual samplesIn Figure 1 we show samples at different NFEs, where it can be qualitatively seen that BatchOT produces samples that are more consistent between high- and low-NFE solutions than CondOT, despite achieving similar FID values. To evaluate this quantitatively, we define a metric for establishing the _consistency_ of a model with respect to an integration scheme: let \(x^{(m)}\) be the output of a numerical solver initialized at \(x\) using \(m\) function evaluations to reach \(t=1\), and let \(x^{(*)}\) be a near-exact sample solved using a high-cost solver starting from \(x_{0}\) as well. We define \[\text{Consistency}(m)=\tfrac{1}{D}\mathbb{E}_{x\sim q_{0}}\|\mathcal{F}(x^{(m )})-\mathcal{F}(x^{(*)})\|^{2} \tag{21}\] where \(\mathcal{F}(\cdot)\) outputs the hidden units from a pretrained InceptionNet1, and \(D\) is the number of hidden units. These kinds of perceptual losses have been used before to check the content alignment between two image samples (_e.g._Gatys et al. (2015); Johnson et al. (2016)). We find that Multisample Flow Matching has better consistency at all values of NFE, shown in Table 3. Footnote 1: We take the same layer as used in standard FID computation. Training efficiencyFigure 4 shows the convergence of Multisample Flow Matching with BatchOT coupling compared to Flow Matching with CondOT and diffusion-based methods. We see that by choosing better joint distributions, we obtain faster training. This is in line with our variance estimates reported in Table 6 and supports our hypothesis that gradient variance is reduced by using non-trivial joint distributions. ### Improved Batch Optimal Couplings We further explore the usage of Multisample Flow Matching as an approach to improve upon batch optimal solutions. Here, we experiment with a different setting, where the cost is unknown and only samples from a batch optimal coupling are provided. In the real world, it is often the case that the preferences of each person are not known explicitly, but when given a finite number of choices, people can more easily find their best assignments. This motivates Figure 4: Multisample Flow Matching with BatchOT shows faster convergence due to reduced variance (ImageNet64). \begin{table} \begin{tabular}{l c c c c} \hline \hline & \multicolumn{2}{c}{**ImageNet 32\(\times\)32**} & \multicolumn{2}{c}{**ImageNet 64\(\times\)64**} \\ & CondOT & BatchOT & CondOT & BatchOT \\ \hline Consistency(\(m\)=4) & 0.141 & **0.101** & 0.174 & **0.157** \\ Consistency(\(m\)=6) & 0.105 & **0.071** & 0.151 & **0.134** \\ Consistency(\(m\)=8) & 0.079 & **0.052** & 0.132 & **0.115** \\ Consistency(\(m\)=12) & 0.046 & **0.030** & 0.106 & **0.085** \\ \hline \hline \end{tabular} \end{table} Table 3: BatchOT produces samples with more similar content to its true samples at low NFEs (using midpoint discretization). Visual examples of this consistency are shown in Figure 1. us to consider the case of unknown cost functions, and information regarding the optimal coupling is only given by a weak oracle that acts on finite samples, denoted \(q_{OT,c}^{k}\). We consider two baselines: (i) the BatchOT cost (B) which corresponds to \(\mathbb{E}_{q_{OT,c}^{k}(x_{0},x_{1})}\left[c(x_{0},x_{1})\right]\), and (ii) learning a static map that mimics the BatchOT couplings (B-ST) by minimizing the following objective: \[\mathbb{E}_{q_{OT,c}^{k}(x_{0},x_{1})}\left\|x_{1}-\psi_{\theta}(x_{0})\right\| ^{2}\,. \tag{22}\] This can be viewed as learning the barycentric projection (Ferradans et al., 2014; Seguy et al., 2017), _i.e._\(\psi^{*}(x_{0})=E_{q_{OT,c}^{k}(x_{1}|x_{0})}\left[x_{1}\right]\), a well-studied quantity but is known to not preserve the marginal distribution (Fatras et al., 2019). We experiment with 4 different cost functions on three synthetic datasets in dimensions \(\{2,32,64\}\) where both \(q_{0}\) and \(q_{1}\) are chosen to be Gaussian mixture models. In Table 4 we report both the transport cost and the KL divergence between \(q_{1}\) and the distribution induced by the learned map, _i.e._\([\psi_{1}]_{2}q_{0}\). We observe that while B-ST always results in lower transport costs compared to B-FM, its KL divergence is always very high, meaning that the pushed-forward distribution by the learned static map poorly approximates \(q_{1}\). Another interesting observation is that B-FM always reduces transport costs compared to B, providing experimental support to the theory (Theorem D.8). Flow Matching improves optimalityFigure 6 shows the cost of the learned model as we vary the batch size for computing couplings, where the models are trained sufficiently to achieve the same KL values as reported in Table 4. We see that our approach decreases the cost compared to the BatchOT oracle for any fixed batch size, and furthermore, converges to the OT solution faster than the batchOT oracle. Thus, since Multisample Flow Matching retains the correct marginal distributions, it can be used to better approximate optimal transport solutions than simply relying on a minibatch solution. ## 7 Conclusion We propose Multisample Flow Matching, building on top of recent works on simulation-free training of continuous normalizing flows. While most prior works make use of training algorithms where data and noise samples are sampled independently, Multisample Flow Matching allows the use of more complex joint distribution. This introduces a new approach to designing probability paths. Our framework increases sample efficiency and sample quality when using low-cost solvers. Unlike prior works, our training method does not rely on simulation of the learned vector field during training, and does not introduce any min-max formulations. Finally, we note that our method of fitting to batch optimal couplings is the first to also preserve the marginal distributions, an important property in both generative modeling and solving transport problems. \begin{table} \begin{tabular}{l c c c c c c c c c c c c c c} \hline \hline & \multicolumn{3}{c}{2-D Cost} & \multicolumn{3}{c}{2-D KL} & \multicolumn{3}{c}{32-D Cost} & \multicolumn{3}{c}{32-D KL} & \multicolumn{3}{c}{64-D Cost} & \multicolumn{3}{c}{64-D KL} \\ \cline{2-13} Cost Fn. \(c(x_{0},x_{1})\) & B & B-ST & B-FM & B-ST & B-FM & B & B-ST & B-FM & B & B-ST & B-FM & B-ST & B-FM \\ \hline \(\left\|x_{1}-x_{0}\right\|_{2}^{2}\) & 0.90 & 0.60 & 0.72 & 0.07 & 4E-3 & 41.08 & 31.58 & 38.73 & 151.47 & 0.06 & 92.90 & 65.57 & 87.97 & 335.38 & 0.14 \\ \(\left\|x_{1}-x_{0}\right\|_{1}\) & 1.09 & 0.86 & 0.98 & 0.18 & 4E-3 & 27.92 & 24.51 & 27.26 & 254.59 & 0.08 & 60.27 & 50.49 & 58.38 & 361.16 & 0.16 \\ \(1-\frac{(x_{0},x_{1})}{\left\|x_{0}\right\|_{2}^{2}\)} & 0.03 & 2E-4 & 3E-3 & 5.91 & 4E-3 & 0.62 & 0.53 & 0.58 & 179.48 & 0.06 & 0.71 & 0.60 & 0.68 & 337.63 & 0.12 \\ \(\left\|A(x_{1}-x_{0})\right\|_{2}^{2}\) & 0.91 & 0.54 & 0.65 & 0.07 & 4E-3 & 32.66 & 24.61 & 30.13 & 256.90 & 0.06 & 78.70 & 58.11 & 78.50 & 529.09 & 0.19 \\ \hline \hline \end{tabular} \end{table} Table 4: Matching couplings from an oracle BatchOT solver with unknown costs. Multisample Flow Matching is able to match the marginal distribution correctly while being at least a optimal as the oracle, but static maps fail to preserve the marginal distribution. Figure 5: 2D densities on the 8-Gaussians target distribution. (Left) Ground truth density. (Right) Learned densities with static maps in the top row and Multisample Flow Matching dynamic maps in the bottom row. Models within each column were trained using batch optimal couplings with the corresponding cost function. Figure 6: Transport cost vs. batch size (\(k\)) for computing couplings on the 64D synthetic dataset. The number of samples used for performing gradient steps during training and the resulting KL divergences were kept the same. ## Acknowledgements AAP thanks the Meta AI Mentorship program and NSF Award 1922658 as funding sources. HB was supported by a grant from Israel CHE Program for Data Science Research Centers. Additionally, we acknowledge the Python community (Van Rossum & Drake Jr, 1995; Oliphant, 2007) for developing the core set of tools that enabled this work, including PyTorch (Paszke et al., 2019), PyTorch Lightning (Falcon & team, 2019), Hydra (Yadan, 2019), Jupyter (Kluyver et al., 2016), Matplotlib (Hunter, 2007), seaborn (Waskom et al., 2018), numpy (Oliphant, 2006; Van Der Walt et al., 2011), pandas (McKinney, 2012), SciPy (Jones et al., 2014), pot (Flamary et al., 2021), and torchdiffeq (Chen, 2018).

2306.02769

On simple expectations and observations of intelligent agents: A complexity study

Public observation logic (POL) reasons about agent expectations and agent observations in various real world situations. The expectations of agents take shape based on certain protocols about the world around and they remove those possible scenarios where their expectations and observations do not match. This in turn influences the epistemic reasoning of these agents. In this work, we study the computational complexity of the satisfaction problems of various fragments of POL. In the process, we also highlight the inevitable link that these fragments have with the well-studied Public announcement logic.

Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh, François Schwarzentruber

2023-06-05T10:53:27Z

http://arxiv.org/abs/2306.02769v1

# On simple expectations and observations of intelligent agents: A complexity study ###### Abstract Public observation logic (POL) reasons about agent expectations and agent observations in various real world situations. The expectations of agents take shape based on certain protocols about the world around and they remove those possible scenarios where their expectations and observations do not match. This in turn influences the epistemic reasoning of these agents. In this work, we study the computational complexity of the satisfaction problems of various fragments of POL. In the process, we also highlight the inevitable link that these fragments have with the well-studied Public announcement logic. ## 1 Introduction Reasoning about knowledge among multiple agents plays an important role in studying real-world problems in a distributed setting, e.g., in communicating processes, protocols, strategies and games. _Multi-agent epistemic logic_ (EL) [1] and its dynamic extensions, popularly known as _dynamic epistemic logics_ (DEL) [2] are well-known logical systems to specify and reason about such dynamic interactions of knowledge. Traditionally, agents' knowledge is about facts and EL/DEL mostly deals with this phenomenon of 'knowing that'. More recently, the notions of 'knowing whether', 'knowing why' and 'knowing how' have also been investigated from a formal viewpoint [3]. These agents also have expectations about the world around them, and they reason based on what they observe around them, and such observations may or may not match the expectations they have about their surroundings. Following [4], such perspectives on agent reasoning were taken up by [5] and studied formally in the form of _Public observation logic_ (POL). We present below a situation that POL is adept at modelling. The example is in the lines of the one considered in [6]: **Example 1**.: _Let us consider a robotic vacuum cleaner (\(\mathit{vbot}\)) that is moving on a floor represented as a \(7\times 7\) grid (see Figure 1). On the top right of the floor, there is a debris-disposal area, and on the bottom left, there is a power source to recharge. Two children Alice and Bob are awed by this new robotic cleaner. They are watching it move and trying to guess which direction it is moving. The system is adaptive, thus the global behaviour is not hard-coded but learned. We suppose that \(\mathit{vbot}\) moves on a grid and the children may observe one of the four directions: right (\(\blacktriangleright\)), left (\(\blacktriangle\)), up(\(\blacktriangle\)) or down(\(\blacktriangledown\)), and of course, combinations of them. Note that, for example, observing \(\blacktriangle\) means that the bot moves one step left. Let Alice be aware of a glitch in the bot. Then her expectations regarding the \(\mathit{vbot}\)'s movements include the following possibilities:_ 1. _The bot may go up or right for debris-disposal, but may make an erroneous move, that is, a down or a left move._ 2. _The bot may go towards power source without error._ _The only difference between Bob's expectation and that of Alice is that Bob does not consider the bot to make an error while moving towards debris-disposal since he is unaware of the glitch._ _Suppose the \(vbot\) is indeed moving towards power from the center of the grid. Hence if the bot makes one left move, \(\blacktriangleleft\), Bob would know that the bot is moving towards power whereas Alice would still consider moving towards debris-disposal a possibility._ The example concerns certain rules that we follow in our daily life, they deal with situations where agents expect certain observations at certain states based on some pre-defined _protocols_, viz. the bot mechanism in the example given above. They get to know about the actual situation by observing certain actions which agree with their expectations corresponding to that situation. POL does not deal with the protocols themselves, but the effect those protocols have in our understanding of the world around us in terms of our expectations and observations. In [6] we have investigated the computational complexity of the model-checking problem of different fragments of POL, and in this paper, we will deal with the computational complexity of the satisfaction problem of various proper fragments of POL (cf. Figure 2). We will show how certain simple fragments of POL give rise to high complexity with respect to their computational behaviour. To prove the complexity results of some fragment(s) of POL we use a translation to Public announcement logic (PAL) [7], whereas, for other fragment(s), a tableau method is utilized where the tableau rules provide a mix of modal logic reasoning and computations of language theory residuals. _Outline._ In Section 2, we recall the relevant definitions of POL. In Section 3, we describe an application of the satisfiability problem of POL\({}^{-}\). In Section 4 we present a NEXPTIME algorithm for POL\({}^{-}\) using the tableau method. In Section 5, we prove that POL\({}^{-}\) is in NEXPTIME-Hard. In section 6, we present the complexity results for various fragments of POL\({}^{-}\). Section 7 discusses related work, and Section 8 concludes the paper. ## 2 Background In this section, we provide a brief overview of a fragment of public observation logic (POL) [5], which we term as POL\({}^{-}\). ### A fragment of POL\((\textsf{POL}^{-})\) Let \(Agt\) be a finite set of agents, \(\mathcal{P}\) be a countable set of propositions describing the facts about the state and \(\mathbf{\Sigma}\) be a finite set of actions. An _observation_ is a finite string of actions. In the vacuum bot example, an observation may be \(\blacktriangleleft\blacktriangledown\blacktriangleleft\) and similar others. An agent may expect different potential observations to happen at a given state, but to model human/agent expectations, such expectations are described in a finitary way by introducing the _observation expressions_ (as star-free regular expressions over \(\mathbf{\Sigma}\)): Figure 1: A robotic vacuum cleaner on the floor (in the middle of the grid). The power source is at bottom left, whereas the debris-disposal area is at top right. Figure 2: Complexity results of satisfiability of various fragments of POL\({}^{-}\). **Definition 1** (Observation expressions).: _Given a finite set of action symbols \(\mathbf{\Sigma}\), the language \(\mathcal{L}_{obs}\) of observation expressions is defined by the following BNF:_ \[\pi ::= \emptyset\mid\ \varepsilon\mid a\mid\pi\cdot\pi\mid\pi+\pi\] _where \(\emptyset\) denotes the empty set of observations, the constant \(\varepsilon\) represents the empty string, and \(a\in\mathbf{\Sigma}\)._ In the bot example, the observation expression \((\blacktriangle\blacktriangleright\blacktriangleright\blacktriangle)\) models the expectation of the bot's movement in either way, towards the power source or the debris-disposal area, whereas \((\blacktriangle\blacktriangleright)^{3}\cdot(\blacktriangledown)^{3}\) models the expectation of moving towards the power source. The size of an observation expression \(\pi\) is denoted by \(|\pi|\). The semantics for the observation expressions are given by _sets of observations_ (strings over \(\mathbf{\Sigma}\)), similar to those for regular expressions. Given an observation expression \(\pi\), its _set of observations_ is denoted by \(\mathcal{L}(\pi)\). For example, \(\mathcal{L}(\blacktriangleright)=\{\blacktriangleright\}\), and \(\mathcal{L}(\blacktriangle\blacktriangleright\blacktriangleright\blacktriangle)=\{ \blacktriangle\blacktriangleright,\blacktriangleright\blacktriangle\}\). The (star-free) regular language \(\pi\backslash w\) is the set of words given by \(\{v\in\mathbf{\Sigma}^{\star}\mid wv\in\mathcal{L}(\pi)\}\). The language \(Pre(\pi)\) is the set of prefixes of words in \(\mathcal{L}(\pi)\), that is, \(w\in Pre(\pi)\) iff \(\exists v\in\mathbf{\Sigma}^{\star}\) such that \(wv\in\mathcal{L}(\pi)\) (namely, \(\mathcal{L}(\pi\backslash w)\neq\emptyset\)). **Example 2**.: \((\blacktriangle\blacktriangleright\blacktriangleright)\)\(\blacktriangle\)_ [MISSING_PAGE_POST] \(\blacktriangle\)_ \(\blacktriangle\blacktriangleright\)_ [MISSING_PAGE_POST] Intuitively, \(K_{i}\varphi\) says that 'agent \(i\) knows \(\varphi\) and \([\pi]\varphi\) says that 'after any observation in \(\pi\), \(\varphi\) holds'. The other propositional connectives are defined in the usual manner. We also define \(\langle\pi\rangle\varphi\) as \(\neg[\pi]\neg\varphi\) and \(\hat{K}_{i}\varphi\) as \(\neg K_{i}\neg\varphi\). Typically, \(\langle\pi\rangle\varphi\) says that 'there exists an observation in \(\pi\) such that \(\varphi\) holds'. Formula \(\hat{K}_{i}\varphi\) says that 'agent \(i\) imagines a state in which \(\varphi\) holds'. The logic \(\mathsf{POL}^{-}\) is the \(\mathsf{Star}\)-\(\mathsf{Free}\) **fragment of \(\mathsf{POL}\)**, that is, it is the set of formulas in which the \(\pi\)'s do not contain any Kleene star \(*\). A more restricted version is the \(\mathsf{Word}\) **fragment of \(\mathsf{POL}^{-}\)**, where \(\pi\)'s are words, that is, observation expressions without \(+\) operators. We consider both the **single-agent word fragment of \(\mathsf{POL}^{-}\)**, and **multi-agent word fragment of \(\mathsf{POL}^{-}\)**. Furthermore, we consider **single-agent \(\mathsf{POL}^{-}\)**, and **multi-agent \(\mathsf{POL}^{-}\)** (full \(\mathsf{POL}^{-}\)). **Definition 5** (Truth definition for \(\mathsf{POL}^{-}\)).: _Given an epistemic expectation model \(\mathcal{M}=(S,\sim,V,\mathit{Exp})\), a state \(s\in S\), and a \(\mathsf{POL}^{-}\)-formula \(\varphi\), the truth of \(\varphi\) at \(s\), denoted by \(\mathcal{M},s\models\varphi\), is defined by induction on \(\varphi\) as follows:_ \[\begin{array}{rcl}\mathcal{M},s\models p&\Leftrightarrow&p\in V(s)\\ \mathcal{M},s\models\neg\varphi&\Leftrightarrow&\mathcal{M},s\not\models \varphi\\ \mathcal{M},s\models\varphi\land\psi&\Leftrightarrow&\mathcal{M},s\models \varphi\text{ and }\mathcal{M},s\models\psi\\ \mathcal{M},s\models K_{i}\varphi&\Leftrightarrow&\text{for all }t:(s\sim_{i}t\text{ implies } \mathcal{M},t\models\varphi)\\ \mathcal{M},s\models[\pi]\varphi&\Leftrightarrow&\text{for all observations }w\text{ over }\Sigma,\\ &&w\in\mathcal{L}(\pi)\cap\mathit{Pre}(\mathit{Exp}(s))\\ &&\text{implies }\mathcal{M}|_{w},s\models\varphi\end{array}\] _where \(\mathit{Pre}(\pi)\) is the set of prefixes of words in \(\mathcal{L}(\pi)\), that is, \(w\in\mathit{Pre}(\pi)\) iff \(\exists v\in\mathbf{\Sigma}^{*}\) such that \(wv\in\mathcal{L}(\pi)\) (namely \(\mathcal{L}(\pi\lor w)\neq\emptyset\))._ The truth of \(K_{i}\varphi\) at \(s\) follows the standard possible world semantics of epistemic logic. The formula \([\pi]\varphi\) holds at \(s\) if for every observation \(w\) in the set \(\mathcal{L}(\pi)\) that matches with the beginning of (i.e., is a prefix of) some expected observation in \(s\), \(\varphi\) holds at \(s\) in the updated model \(\mathcal{M}|_{w}\). Note that \(s\) is a state in \(\mathcal{M}|_{w}\) because \(w\in\mathit{Pre}(\mathit{Exp}(s))\). Similarly, the truth definition of \(\langle\pi\rangle\varphi\) can be given as follows: \(\mathcal{M},s\models\langle\pi\rangle\varphi\) iff there exists \(w\in\mathcal{L}(\pi)\cap\mathit{Pre}(\mathit{Exp}(s))\) such that \(\mathcal{M}|_{w},s\models\varphi\). Intuitively, the formula \(\langle\pi\rangle\varphi\) holds at \(s\) if there is an observation \(w\) in \(\mathcal{L}(\pi)\) that matches with the beginning of some expected observation in \(s\), and \(\varphi\) holds at \(s\) in the updated model \(\mathcal{M}|_{w}\). For the example described earlier, we have: * \(\mathcal{M},t\models[\blacktriangle](K_{Bob}\neg debris\land\hat{K}_{Alice} debris)\), if the \(\mathit{vbot}\) moves one step left, \(\blacktriangle\), then while Alice still considers moving to the debris-disposal area a possibility, Bob does not consider that possibility at all. Satisfiability problem for \(\mathsf{POL}^{-}\):Given a formula \(\varphi\), does there exist a pointed epistemic expectation model \(\mathcal{M},s\) such that \(\mathcal{M},s\models\varphi\)? We investigate the complexity of this problem. The fragments of \(\mathsf{POL}^{-}\) that we consider are (i) single-agent word fragment, (ii) multi-agent word fragment, (iii) single-agent \(\mathsf{POL}^{-}\), and, (iv) full \(\mathsf{POL}^{-}\). ## 3 An application Let us now consider a scenario which can be aptly described using the satisfiability problem of \(\mathsf{POL}^{-}\). We go back to the cleaning bot example introduced earlier. Let Alice be agent \(a\) and Bob be agent \(b\). Suppose the \(\mathit{vbot}\) is moving towards the power source without making any error. Evidently, the possibilities considered by the agents, based on the information available to them are given as follows: * Possibilities considered by Alice who has the information about the glitch in the bot: \[\hat{K_{a}debris\land\hat{K_{a}}(\blacktriangle+\blacktriangledown)debris\land \hat{K_{a}}power}\] * Possibilities considered by Bob who is not aware of the glitch in the bot: \[\hat{K_{b}debris\land\hat{K_{b}}power}\] Now, we model the _expectations_ as follows: Consider the expression, \(\pi_{n}^{p}=(\blacktriangledown+\blacktriangle)^{n}\) that represents a sequence of moves of length \(n\) the bot can make to get to to the power source without any error. We use a formula \(P_{n}\) to express the following: As long as the bot is observed to make \(n\) many moves towards the power source, reaching it is still a possibility. \[P_{n}= (\langle\blacktriangle\rangle\top\wedge\langle\blacktriangledown \rangle\top)\] \[\wedge[\pi_{1}^{p}](\langle\blacktriangle\rangle\top\wedge \langle\blacktriangledown\rangle\top)\] \[\wedge[\pi_{2}^{p}](\langle\blacktriangle\rangle\top\wedge \langle\blacktriangledown\rangle\top)\dots\] \[\wedge[\pi_{n}^{n}](\langle\blacktriangle\rangle\top\wedge \langle\blacktriangledown\rangle\top)\] The first conjunct of \(P_{n}\) translates to move towards the power source, a move towards down or left can be observed. The second conjunct translates to the following: after the observation of a single left or down movement, another left or down movement can be observed. The other conjuncts can be described similarly. For the scenario described in the introduction, we can consider \(P_{n}\) to create a formula where n is at most 3, without an error. Let us denote such a formula by \(\psi_{p}\). Similarly, a formula can express the movement towards debris-disposal with at most one error and with no error as \(\psi_{de}\) and \(\psi_{d}\), respectively. A situation where the bot is moving towards the power source without any error, but \(a\) considers the possibility of moving towards debris-disposal with an error can be expressed as \(\hat{K_{a}}\psi_{de}\wedge\psi_{p}\). Similarly, a formula can be considered for modelling the expected observation when both the agents consider the possibility of the bot moving towards debris-disposal area without an error: \(\hat{K_{a}}\psi_{d}\wedge\hat{K_{b}}\psi_{d}\). We call the (finite) set of all such formulas, \(\Gamma_{p}\). Similarly, we can construct a set \(\Gamma_{de}\) of formulas, when the bot can make an error while going towards debris-disposal area or \(\Gamma_{d}\) when it is moving towards the debris-disposal without any error. Suppose we want to conclude the following in the current scenario: After one wrong move, \(b\) knows that the bot is not moving towards debris-disposal, but \(a\) still considers the possibility. The formula, \(\mathit{INFO}_{ab}\), say, turns out to be \[\langle\blacktriangledown+\blacktriangle\rangle(K_{b}power\wedge\hat{K_{a}} debris)\] The actual scenario is that the bot is indeed moving towards \(power\). Hence, to check whether \(\mathit{INFO}_{ab}\) can be concluded in this scenario, a satisfiability solver for \(\mathsf{POL}^{-}\) can check the (un)satisfiability of the formula \[\neg((\bigwedge_{\psi\in\Gamma_{p}}\psi)\to\mathit{INFO}_{ab})\] ## 4 Algorithm for the Satisfiability Problem of \(\mathsf{POL}^{-}\) In this section, we design a proof system using the tableau method to prove satisfiability of \(\mathsf{POL}^{-}\). A term in a tableau proof is of the form \((\sigma\;\;w\;\;\psi)\;|\;(\sigma\;\;w\;\;\blacktriangledown)\;|\;(\sigma,\sigma^{\prime})_{i}\), where \(i\in Agt\). The \(\sigma\) is called a state label that represents a state in the model, \(w\in\Sigma^{*}\) is a word over a finite alphabet and \(\psi\) is a formula in \(\mathsf{POL}^{-}\). The term \((\sigma\;\;w\;\;\psi)\) represents the fact that the state labelled by \(\sigma\) survives after the model is projected on the word \(w\), and after projecting on \(w\), \(\psi\) holds true in the state corresponding to \(\sigma\). The term \((\sigma\;\;w\;\;\blacktriangledown)\) represents the fact that the state labelled by \(\sigma\) survives after the model is projected on word \(w\). The term \((\sigma_{1},\sigma_{2})_{i}\) represents in the model, the states represented by \(\sigma_{1}\) and \(\sigma_{2}\) should be indistinguishable for the agent \(i\in Agt\), where \(Agt\) is a finite set of agents. For space reasons, the term \((\sigma_{1},\sigma_{2})_{i\in Agt}\) stands for the set of terms \(\{(\sigma_{1},\sigma_{2})_{i}\;|\;i\in Agt\}\). Without loss of generality, the formula \(\varphi\) is assumed to be in Negative Normal form, the syntax of which is as follows: \[\varphi:= \top\;\;|\;\;p\;\;|\;\;\neg p\;\;|\;\;\psi\vee\chi\;\;|\;\; \psi\wedge\chi\;|\] \[\hat{K_{i}}\psi\;\;|\;\;K_{i}\psi\;\;|\;\;\langle\pi\rangle\psi \;\;|\;\;[\pi]\psi\] Given a formula we denote by \(\varphi\), \(FL(\varphi)\) the Fischer-Ladner Closure of \(\varphi\), (see [8]). ### The Tableau Rules The tableau rules for this fragment have been shown in Figure 4. Here an inference rule looks like this: \(\frac{A}{C_{1}|C_{2}|\dots|C_{n}}\). Here each \(C_{i}\) and \(A\) is a set of tableau terms. The \(C_{i}\)s are called consequences, \(A\) is the antecedent. Intuitively the rule is interpreted as "If all the terms in \(A\) are true, then all the terms in at least one of \(C_{i}\)'s are true". In Figure 4, the left column is the rule name and the right column is the rule. For example, the Box Project Rule states that "The state labelled by \(\sigma\) survives after projection on word \(w\) and it satisfies \([\pi]\psi\) (\((\sigma\ w\ \ [\pi]\psi)\)) and \(\sigma\) still survives a further projection on letter \(a((\sigma\ w\ \ \swarrow))\) then after further projection on \(a\), \([\pi\setminus a]\psi\) should hold true in the state labelled by \(\sigma\) (\((\sigma\ w\ \ [\pi\setminus a]\psi)\)).". Recall \(\pi\setminus a\) denotes the residual of \(\pi\) by \(a\) (see Section 2). Similarly, the Diamond Project rule says that if a certain state \(\sigma\), under some word projection \(w\) has to satisfy \(\langle a\rangle\psi\), then that state \(\sigma\) has to survive projection on \(wa\) and also satisfy \(\psi\) under the same projection. A tableau proof can be assumed a tree. Each node of the tree is a set of tableau terms \(\Gamma\). An inference rule can be applied in the following way: If \(A\subseteq\Gamma\) and \(C_{i}\)'s are not in \(\Gamma\), the children of \(\Gamma\) are \(\Gamma\cup C_{i}\) for each \(i\in[n]\). When no rules can be applied on a \(\Gamma\), we say \(\Gamma\) is saturated (leaf node in the proof tree). If \(\bot\in\Gamma\), we say that branch is **closed**. If all branch of the proof tree is **closed**, we say the **tableau is closed**, else is open. Given a \(\mathsf{POL}^{-}\) formula \(\varphi\), we start with \(\Gamma=\{(\sigma\ \ \epsilon\ \varphi),(\sigma\ \ \epsilon\ \swarrow)\}\cup\{(\sigma,\sigma)_{i},i\in Agt\}\). Figure 4: Tableau rules. \(\sigma\) is any state symbol, \(w\) is any word, \(p\) is any propositional variable, \(i\) is any agent, \(\pi\) is any regular expression, \(a\) is any letter. **Example 3**.: _Suppose we aim at deciding whether_ \[\varphi:=\hat{K_{i}}\langle a\rangle p\wedge\langle a\rangle K_{i}\neg p\] _is satisfiable or not. For simplicity we suppose there is a single agent \(i\). Here are the terms added to the set of terms:_ 1. \((\sigma\ \epsilon\ \varphi)\)_,_ \((\sigma\ \epsilon\ \check{\ \ }\check{\ })\)_,_ \((\sigma,\sigma)_{i}\)__ _(initialization)_ 2. \((\sigma\ \epsilon\ \hat{K_{i}}\langle a\rangle p)\)_,_ \((\sigma\ \epsilon\ \langle a\rangle K_{i}\neg p)\) _by AND rule_ 3. \((\sigma^{\prime}\ \epsilon\ \langle a\rangle p),(\sigma^{\prime}\ \epsilon\ \check{\ \ } \check{\ }),(\sigma,\sigma^{\prime})_{i},(\sigma^{\prime},\sigma^{\prime})_{i}\) _by Possibility rule_ 4. \((\sigma^{\prime},\sigma)_{i}\) _by Symmetry rule_ 5. \((\sigma^{\prime}\ a\ p),(\sigma^{\prime}\ a\ \check{\ \ }\check{\ })\) _by Diamond Project on 2_ 6. \((\sigma\ a\ \check{\ \ }\check{\ }\check{\ }),(\sigma\ a\ \check{\ \ }K_{i}\neg p)\) _by Diamond Project on 2_ 7. \((\sigma^{\prime}\ a\ \neg p)\) _by Knowledge rule on 3, 5, 6_ 8. \(\bot\) _by Clash rule on 5,7_ _As we obtain \(\bot\), the formula \(\varphi\) is not satisfiable (by the upcoming Theorem 6)._ ### Soundness and Completeness of the Tableau Rules In this section, we provide the soundness and completeness proof of the Tableau method for the satisfiability of \(\mathsf{POL}^{-}\)**Theorem 6**.: _Given a formula \(\varphi\), if \(\varphi\) is satisfiable, then the tableau for \(\Gamma=\{(\sigma\ \epsilon\ \varphi),(\sigma\ \epsilon\ \check{\ \ }\check{\ }),(\sigma,\sigma)_{i\in Agt}\}\) is open._ **Theorem 7**.: _Given a formula \(\varphi\), if the tableau for \(\Gamma=\{(\sigma\ \epsilon\ \varphi),(\sigma\ \epsilon\ \check{\ \ }\check{\ }),(\sigma,\sigma)_{i\in Agt}\}\) is open, then \(\varphi\) is satisfiable._ The proof of Theorem 6 is done by induction. We shift the proof of Theorem 6 to the appendix. We now present the proof of Theorem 7. Proof of Theorem 7.: Since by assumption, the tableau for \(\Gamma=\{(\sigma\ \epsilon\ \varphi),(\sigma\ \epsilon\ \check{\ \ }\check{\ }),(\sigma,\sigma)_{i\in Agt}\}\) is open, there exists a branch in the tableau tree where in the leaf node there is a set of terms \(\Gamma_{l}\) such that it is saturated and \(\bot\notin\Gamma_{l}\). For the purpose of this proof, let us define a relation over the words \(\bar{w}\) that appears in \(\Gamma_{l}\). For any two word \(\bar{w}_{1}\) and \(\bar{w}_{2}\) that appears in \(\Gamma_{l}\), \(\bar{w}_{1}\leq_{pre}\bar{w}_{2}\) if and only if \(\bar{w}_{1}\in\mathit{Pre}(\bar{w}_{2})\)). Now, this relation is reflexive (\(\bar{w}_{1}\in\mathit{Pre}(\bar{w}_{1})\)), asymmetric (if \(\bar{w}_{1}\in\mathit{Pre}(\bar{w}_{2})\) and \(\bar{w}_{2}\in\mathit{Pre}(\bar{w}_{1})\) then \(\bar{w}_{1}=\bar{w}_{2}\)) and transitive (if \(\bar{w}_{1}\in\mathit{Pre}(\bar{w}_{2})\) and \(\bar{w}_{2}\in\mathit{Pre}(\bar{w}_{3})\) then \(\bar{w}_{1}\in\mathit{Pre}(\bar{w}_{3})\)). Hence this relation creates a partial order among all the words occurring in \(\Gamma_{l}\). We also denote \(\bar{w_{1}}<_{pre}\bar{w_{2}}\) to interpret the fact that \(\bar{w_{1}}\leq_{pre}\bar{w_{2}}\) and \(\bar{w_{1}}\neq\bar{w_{2}}\). Now we create a model \(\mathcal{M}=\langle W,\{R_{i}\}_{i\in Agt},V,Exp\rangle\) out of \(\Gamma_{l}\) and prove that \(\varphi\) is satisfied by some state in the model. * \(W=\{s_{\sigma}\ |\ \sigma\text{ is a distinct label in the terms occuring in }\Gamma_{l}\}\) * \(R_{i}=\{\{s_{\sigma_{1}},s_{\sigma_{2}}\}\ |\ (\sigma_{1},\sigma_{2})_{i}\in\Gamma_{l}\}\) * \(V(s_{\sigma})=\{p\ |\ (\sigma\ \epsilon\ \ p)\in\Gamma_{l}\}\) * \(Exp(s_{\sigma})=\sum_{w\in\Lambda_{\sigma}}w\), where \(\Lambda_{\sigma}=\{w\ |\ (\sigma\ \ w\ \check{\ \ })\in\Gamma_{l}\text{ and }\nex Proof of Claim 8.: We induct on the size of \(|w|\). **Base Case.** Let \(|w|=1\). Hence \(w\in\{\epsilon\}\cup\Sigma\). Since \(\Gamma\subseteq\Gamma_{l}\) and \((\sigma\ \ \epsilon\ \ \check{\check{\check{\check{\check{\check{\check{\check{\check{ \check{\check{\check{\check{\check{\check{\check{\checkcheck{\checkcheckcheckcheck{ }}}}}}}}}}})\), and \(s_{\sigma}\) is in \(\mathcal{M}|_{\epsilon}=\mathcal{M}\). For the case \(w=a\) for any \(a\in\Sigma\). Hence there exists a word \(w^{\prime}\) that occurs in a term in \(\Gamma_{l}\) labelled by \(\sigma\) such that \(w\in Pre(w^{\prime}))\) and there is no other word bigger than \(w^{\prime}\) such that \(w^{\prime}\) is in its prefix, since the proof is on finite words and formula, the proof terminates. Hence by definition of \(w^{\prime}\in\mathcal{L}(Exp(s_{\sigma}))\) which guarantees survival of \(s_{\sigma}\) in \(\mathcal{M}|_{a}\). **Induction Hypothesis.** Assume the statement to be true for \(|w|=n\). **Inductive Step.** Consider the case where \(|w|=n+1\). By assumption, \((\sigma\ \ w\ \ \check{\check{\check{\check{\check{\check{\check{\check{\check{ \check{\check{\check{\check{\check{\checkcheck{{ }}}}}}}}}}}})\in \Gamma_{l}\). Hence by the fact that \(\Gamma_{l}\) is saturation and by the rule "Survival Chain", there is \((\sigma\ \ w^{\prime}\ \ \check{\check{\check{\check{\check{\check{\check{\check{ \check{\check{\check{\check{\check{\check{\check{\checkcheck{{ }}}}}}}}}}}}})\in \Gamma_{l}\), where \(w=w^{\prime}a\) for some \(a\in\Sigma\). Hence by IH, the result follows that \(s_{\sigma}\) survives in \(\mathcal{M}|_{w^{\prime}}\). Now, by termination, there are finite many unique words occurring in \(\Gamma_{l}\). Clearly, \(w^{\prime}\leq_{pre}w\). Since there are finite many words, there is a \(w_{*}\), which is of maximum size such that \(w\leq_{pre}w_{*}\) and \((\sigma\ \ w_{*}\ \check{\check{\check{\check{\check{\check{\check{\check{\check{ \check{\check{\check{\check{\check{\checkcheck{\check Proof.: Given the tree \(\mathcal{T}_{\mathsf{P}}\) we create in the procedure, a node \(T_{\sigma}\) is marked satisfiable iff it does not have bot, \(\{(\sigma\;\;w\;\;K_{i}\psi),(\sigma\;\;w\;\;\neg\psi)\}\nsubseteq T_{\sigma}\) and all its successors are marked satisfiable. We prove three statements: * **Statement 1:** Each node is of at most exponential size, that is, has at most exponential many terms. * **Statement 2:** Maximum children a node can have is polynomial. * **Statement 3:** The height of the tree is polynomial. **Proof of Statement \(1\)**. Since a term in a node \(T_{\sigma}\) is of the form \((\sigma\;\;w\;\;\psi)\), where \(w\) is a word over some finite alphabet \(\Sigma\) and \(\psi\) is a formula of \(\mathsf{POL}^{-}\). According to the shape of the rules, a formula that can be derived is always in \(FL(\varphi)\). Since \(|FL(\varphi)|\leq O(|\varphi|)\)[8], hence there can be at most \(O(|\varphi|)\) many formulas. Also, since a regular expression \(\pi\) occuring in a modality is star-free (that is does not contain the Kleene star), hence a word \(w\in\mathcal{L}(\pi)\) is of length at most \(|\pi|\) which is again of length at most \(\varphi\). Also there are at most \(|FL(\varphi)|\) many regular expressions. Hence there are at most \(|\Sigma|^{O(p(|\varphi|))}\), where \(p(X)\) is some polynomial on \(X\), many unique words possible. Hence therefore, there can be at most exponential many terms in a single node. **Proof of Statement \(2\)**. From a node \(T_{\sigma}\), a child is created for every unique triplet of \((\sigma\;\;w\;\;\hat{K}\psi)\) in \(T_{\sigma}\). Number of such triplets possible is, as proved is at most polynomial with respect to \(|\varphi|\). **Proof of Statement \(3\)**. For proving this, we use \(md(\Gamma)\), given a set of formulas \(\Gamma\), is the maximum modal depth over all formulas in \(\Gamma\). Finally we define \(F(T_{\sigma})\) as the set of formulas occuring in the node \(T_{\sigma}\). Consider \(T_{\sigma}\), the node \(T^{i}_{\sigma^{\prime}}\) is \(i\)- successor of \(T_{\sigma}\) and \(T^{j}_{\sigma^{\prime\prime}}\) be the \(j\) successor of \(T^{i}_{\sigma^{\prime}}\) (\(i\neq j\)). Note that all the formulas in \(F(T^{j}_{\sigma^{\prime\prime}})\) are from FL closure of all the \(K_{j}\) and \(\hat{K_{j}}\) formulas from \(F(T^{i}_{\sigma^{\prime}})\). Also all the formulas in \(F(T^{i}_{\sigma^{\prime}})\) are in the FL closure of the \(K_{i}\) and \(\hat{K_{i}}\) formulas occuring in \(T_{\sigma}\). Hence \(md(T^{j}_{\sigma^{\prime\prime}})\leq md(F(T^{j}_{\sigma^{\prime}}))\). Therefore, there can be at most \(O(|\varphi|^{c})\) such agent alterations in one path of \(\mathcal{T}_{\mathcal{P}}\) (not linear because there can be polynomial many words paired with each formula). Now let us consider how many consecutive \(i\) successors can happen in a path. Suppose a \(T_{\sigma}\) has a new \(i\)-successor node \(T_{\sigma^{\prime}}\) for the term \((\sigma\;\;w\;\;\hat{K}_{i}\psi)\). Due to the fact that the indistinguishability relation is equivalence for each agent due to the Transitivity, Symmetry rule and the reflexivity that infers in the possibility rule, hence all the possibility and the knowledge formula terms of the form \((\sigma\;\;w^{\prime}\;\;\hat{K}_{i}\xi)\) or \((\sigma\;\;w^{\prime}\;\;K_{i}\xi)\) of agent \(i\) are in the successor node \(T_{\sigma^{\prime}}\) in the form \((\sigma^{\prime}\;\;w^{\prime}\;\;\hat{K}_{i}\xi)\) or \((\sigma^{\prime}\;\;w^{\prime}\;\;\hat{K}_{i}\xi)\) respectively, along with the term \((\sigma^{\prime}\;\;w\;\;\psi)\). Hence the number of such unique combination of terms will be at most polynomial to the size of \(|FL(\varphi)|\). Therefore, the height of \(\mathcal{T}_{\mathsf{P}}\) is polynomial with respect to the \(|\varphi|\). ## 5 Hardness of Satisfiability in \(\mathsf{POL}^{-}\) In this section, we give a lower bound to the Satisfiability problem of \(\mathsf{POL}^{-}\). We reduce the well-known \(\mathsf{NEXPTIME}\)-Complete Tiling problem to come up with a formula in the \(\mathsf{POL}^{-}\) fragment that only has \(2\) agents. **Theorem 11**.: \(\mathsf{POL}^{-}\) _satisfiability problem is \(\mathsf{NEXPTIME}\)-Hard._ Figure 5: A set of tile types and an empty square, and a solution. Proof.: We reduce the \(\mathtt{NEXPTIME}\)-Complete tiling problem of a square whose size is \(2^{n}\) where \(n\) is encoded in unary [10] (see Figure 5). The instance of the tiling problem is \((T,t_{0},n)\) where \(T\) is a set of tile types (e.g ), \(t_{0}\) is a specific tile that should be at position \((0,0)\), and \(n\) is an integer given in unary. Note that the size of the square is exponential in \(n\). We require the colours of the tiles to match horizontally and vertically. The idea of the reduction works as follows. We consider two tilings A and B. We will construct a formula \(tr(T,t_{0},n)\) expressing that the two tilings are equal, contains \(t_{0}\) at (0, 0), and respect the horizontal and vertical constraints. With the help of two epistemic modalities \(K_{i}\) and \(K_{j}\) we can simulate a standard \(K\) modal logic \(\square\). For the rest of the proof, we consider such a \(\square\) modality and its dual \(\Diamond\). We encode a binary tree whose leaves are pairs of positions (one position in tiling A and one in tiling B). Such a tree is of depth \(4n\): \(n\) bits to encode the \(x\)-coordinate in tiling A, \(n\) bits to encode the \(x\)-coordinate in tiling B, \(n\) bits to encode the \(y\)-coordinate in tiling A, \(n\) bits to encode the \(y\)-coordinate in tiling B. A pair of positions is encoded with the \(4n\) propositional variables: \(p_{0},\ldots,p_{4n-1}\). The first \(p_{0},\ldots,p_{2n-1}\) encodes the position in tiling \(A\) while the later \(p_{2n},\ldots,p_{4n-1}\) encodes the position in tiling \(B\). At each leaf, we also use propositional variables \(q_{t}^{A}\) (resp. \(q_{t}^{B}\)) to say there is tile \(t\) at the corresponding position in tiling \(A\) (resp. tiling \(B\)). The following formula enforces the existence of that binary tree \(\mathcal{T}\) by branching over the truth value of proposition \(p_{\ell}\) at depth \(\ell\): \[\bigwedge_{\ell<4n}\square^{t}\!\!\left(\Diamond p_{\ell}\wedge\Diamond-p_{ \ell}\wedge\bigwedge_{i<\ell}(p_{i}\!\!-\!\!\square p_{i})\wedge(\neg p_{i}\! \!-\!\!\square\neg p_{i})\!\!\right) \tag{1}\] Now, by using of specific Boolean formulas over \(p_{0},\ldots,p_{4n-1}\), it is easy to express equality, presence of \(t_{0}\) at \((0,0)\) and horizontal and vertical constraints: \[\square^{4n}\left(\bigvee_{t}q_{t}^{A}\ \wedge\ \bigwedge_{t\neq t^{\prime}}(\neg q_{t}^{A} \vee\neg q_{t^{\prime}}^{A})\right) \tag{2}\] \[\square^{4n}\left(\bigvee_{t}q_{t}^{B}\ \wedge\ \bigwedge_{t\neq t^{\prime}}(\neg q_{t}^{B} \vee\neg q_{t^{\prime}}^{B})\right)\] (3) \[\square^{4n}(\text{position in tiling $A=0$})\to q_{t_{0}}^{A}\] (4) \[\square^{4n}(\begin{array}{l}x\text{-coordinate of position in $A$}\\ \text{= 1+$x$-coordinate of position in $B$}\end{array})\] (5) \[\rightarrow\bigvee_{t,t^{\prime}|t\text{ matches $t^{\prime}$ horizontally}}(q_{t}^{A}\wedge q_{t^{\prime}}^{B})\] (6) \[\square^{4n}(\begin{array}{l}y\text{-coordinate of position in $A$}\\ \text{= 1+$y$-coordinate of position in $B$}\end{array})\] (7) \[\rightarrow\bigvee_{t,t^{\prime}|t\text{ matches $t^{\prime}$ vertically}}(q_{t}^{A}\wedge q_{t^{\prime}}^{B}) \tag{8}\] The main difficulty is to be sure that all pairs of positions with the same position for - let's say - tiling \(A\) indicates the same tile for the tiling \(A\) (i.e. the same variable \(q_{t}^{A}\) is true). To this aim, we will write a formula of the following form \[[\pi\text{ any position in A}\,]\bigvee_{t}\square^{4n}q_{t}^{A}\ \wedge\ [\pi\text{ any position in B}]\bigvee_{t}\square^{4n}q_{t}^{B}.\] To be able to perform observations to select any position in tiling A (resp. B) whatever the position in tiling B (resp. A) is, we introduce the alphabet \(\Sigma=\{A,\bar{A},B,\bar{B}\}\). We write these two formulas that make a correspondence between valuations on the leaves and observations: \[\square^{4n}\bigwedge_{i=0..2n-1}[A+\bar{A}]^{i}\left(\begin{array}{l}(p_{i} \rightarrow\langle A\rangle\top\wedge[\bar{A}]\bot)\wedge\\ (\neg p_{i}\rightarrow\langle\bar{A}\rangle\top\wedge[\bar{A}]\bot)\end{array}\right) \tag{9}\] \[\square^{4n}\bigwedge_{i=2n..4n-1}[B+\bar{B}]^{i-2n}\left(\begin{array}{l}(p_{i }\rightarrow\langle B\rangle\top\wedge[\bar{B}]\bot)\wedge\\ (\neg p_{i}\rightarrow\langle\bar{B}\rangle\top\wedge[\bar{B}]\bot)\end{array}\right) \tag{10}\] The idea is that a \(2n\)-length word on alphabet \(\{A,\bar{A}\}\) corresponds to a valuation over \(p_{1},\ldots,p_{2n-1}\), and thus a position in tiling A and only that \(2n\)-length word on alphabet \(\{A,\bar{A}\}\) is observable. In the same way, a word on alphabet \(\{B,\bar{B}\}\) corresponds to a valuation over \(p_{2n},\ldots,p_{4n-1}\), thus a position in tiling B. We also say that the inner node (non-leaf) of the binary tree is never pruned by observations (all \(2n\)-length words over \(\{A,\bar{A},B,\bar{B}\}\) are observable): \[\Box^{<4n}\bigwedge_{i=0..2n-1}[\Sigma]^{i}(\langle A\rangle\top\wedge\langle \bar{A}\rangle\top\wedge\langle B\rangle\top\wedge\langle\bar{B}\rangle\top) \tag{11}\] The formula for ensuring the uniqueness of \(q_{t}^{A}\) whatever the position in tiling B, and the other way around are then: \[[(A+\bar{A})^{2n}]\bigvee_{t}\Box^{4n}q_{t}^{A}\wedge[(B+\bar{B})^{2n}]\bigvee _{t}\Box^{4n}q_{t}^{B} \tag{12}\] The intuition works as follows. When evaluating \([(A+\bar{A})^{2n}]\Box^{4n}q_{t}^{A}\), we consider all words \(w\) in \(\mathcal{L}((A+\bar{A})^{2n})\) and we consider any pruning \(\mathcal{M}|_{w}\) of the model \(\mathcal{M}\) which contains the binary tree \(\mathcal{T}\). In \(\mathcal{M}|_{w}\), only the leaves where the valuation on \(p_{0},\ldots,p_{2n-1}\) that corresponds to \(w\) stays. With \(\bigvee_{t}\), we choose a tile type \(t\) in \(T\). The modality \(\Box^{4n}\) then reaches all the leaves and imposes that \(q_{t}^{A}\) holds. The reduction consists of computing from an instance \((T,t_{0},n)\) of the tiling problem the \(\mathsf{POL}^{-}\) formula \(tr(T,t_{0},n)\) which is the conjunction of (1-12), which is computable in poly-time in the size of \((T,t_{0},n)\) (recall \(n\) is in unary). Furthermore, one can check that \((T,t_{0},n)\) is a positive instance of the tiling problem iff \(tr(T,t_{0},n)\) is satisfiable. ## 6 Complexity results of Fragments of \(\mathsf{POL}^{-}\) In this section, we consider a few fragments of \(\mathsf{POL}^{-}\) and we give complexity results for them. First, we consider the single agent fragment of \(\mathsf{POL}^{-}\), and then we prove complexity results for the word fragment of \(\mathsf{POL}^{-}\) (both single and multi-agent) using reductions to \(\mathsf{PAL}\). ### Single agent fragment of \(\mathsf{POL}^{-}\) While we have shown (in Theorem 10) that the satisfiability problem of the \(\mathsf{POL}^{-}\) is \(\mathsf{NEXPTIME}\)-Hard, the hardness proof holds only for the case when the number of agents is at least 2. However, we prove that satisfiability problem in the single Agent fragment of \(\mathsf{POL}^{-}\) is \(\mathsf{PSPACE}\)-Hard, although single-agent epistemic logic \(S5\) is \(\mathsf{NP}\)-Complete. We prove it by reducing TQBF into our problem. The TQBF problem is: given a formula \(\varphi\) of the form \(Q_{1}x_{1}Q_{2}x_{2}\ldots Q_{n}x_{n}\xi(x_{1},x_{2},\ldots,x_{n})\) where \(Q_{i}\in\{\forall,\exists\}\) and \(\xi(x_{1},x_{2},\ldots,x_{n})\) is a Boolean formula in CNF over variables \(x_{1},\ldots,x_{n}\), decide whether the formula \(\varphi\) is true. **Theorem 12**.: _The satisfiability problem for single agent fragment of \(\mathsf{POL}^{-}\) is \(\mathsf{PSPACE}\)-Hard._ The proof follows in the same lines as the proof of \(\mathsf{PSPACE}\)-Hardness of the model-checking problem of the \(\mathsf{POL}^{-}\) ([6]). We present the complete proof of Theorem 12 in the appendix. ### Word fragment of \(\mathsf{POL}^{-}\) To investigate the complexity of the satisfaction problem of the word fragment of \(\mathsf{POL}^{-}\), we use a translation of \(\mathsf{POL}^{-}\) to \(\mathsf{PAL}\). Before going forward, let us give a very brief overview of the syntax and semantics of \(\mathsf{PAL}\). #### 6.2.1 Public announcement logic \((\mathsf{PAL})\) To reason about announcements of agents and their effects on agent knowledge, \(\mathsf{PAL}\)[7] was proposed. The underlying model that is dealt with in \(\mathsf{PAL}\) is epistemic, \(\langle S,\sim,V\rangle\) where \(S\) is a non-empty set of states, \(\sim\) assigns to each agent in \(Agt\) an equivalence relation \(\sim_{i}\subseteq S\times S\), and \(V:S\to 2^{\mathcal{P}}\) is a valuation function. The language is given as follows: **Definition 13** (\(\mathsf{PAL}\) syntax).: _Given a countable set of propositional variables \(\mathcal{P}\), and a finite set of agents \(Agt\), a formula \(\varphi\) in Public Announcement Logic \((\mathsf{PAL})\) can be defined recursively as:_ \[\varphi:=\top\ \ |\ \ p\ |\ \neg\varphi\ |\ \ \varphi\wedge\varphi\ |\ \ K_{i}\varphi\ |\ \ [\varphi]|\varphi\] _where \(p\in\mathcal{P}\), and \(i\in Agt\)._ Typically, \([\varphi]|\psi\) says that 'if \(\varphi\) is true, then \(\psi\) holds after having publicly announced \(\varphi\)'. Similarly, as in \(\mathsf{POL}^{-}\) syntax, the respective dual formulas are defined as, \[\hat{K_{i}}\psi =\neg K_{i}\neg\psi\] \[\langle\varphi]\psi =\neg[\varphi]\neg\psi\] Formula \(\langle\varphi!\rangle\psi\) says that \(\varphi\) is true, and \(\psi\) holds after announcing \(\varphi\). Before going into the truth definitions of the formulas in \(\mathsf{PAL}\), let us first define the notion of model update. **Definition 14** (Model Update by Announcement).: _Given an epistemic model, \(\mathcal{M}=\langle S,\sim,V\rangle\), \(s\in S\), and a \(\mathsf{PAL}\) formula \(\varphi\), the model \(\mathcal{M}|_{\varphi}=\langle S^{\prime},\sim^{\prime},V^{\prime}\rangle\) is defined as:_ * \(S^{\prime}=\{s\in S\mid\mathcal{M},s\vDash\varphi\}\)__ * \(\sim^{\prime}_{i}=\sim_{i}|_{S^{\prime}\times S^{\prime}},\)__ * \(V^{\prime}(s)=V(s)\) _for any_ \(s\in S^{\prime}\)_._ Now we are all set to give the truth definitions of the formulas in \(\mathsf{PAL}\) with respect to pointed epistemic models: **Definition 15** (Truth of a \(\mathsf{PAL}\) formula).: _Given an epistemic model \(\mathcal{M}=\langle S,\sim,V\rangle\) and an \(s\in S\), a \(\mathsf{PAL}\) formula \(\varphi\) is said to hold at \(s\) if the following holds:_ * \(\mathcal{M},s\vDash p\) _iff_ \(p\in V(s)\)_, where_ \(p\in\mathcal{P}\)_._ * \(\mathcal{M},s\vDash\neg\varphi\) _iff_ \(\mathcal{M},s\vDash\varphi\)_._ * \(\mathcal{M},s\vDash\varphi\wedge\psi\) _iff_ \(\mathcal{M},s\vDash\varphi\) _and_ \(\mathcal{M},s\vDash\psi\)_._ * \(\mathcal{M},s\vDash K_{i}\varphi\) _iff for all_ \(t\in S\) _with_ \(s\sim_{i}t\)_,_ \(\mathcal{M},t\vDash\varphi\)_._ * \(\mathcal{M},s\vDash[\psi!]\varphi\) _iff_ \(\mathcal{M},s\vDash\psi\) _implies_ \(\mathcal{M}|_{\psi},s\vDash\varphi\)_._ #### 6.2.2 On complexity To study the satisfiability problem for the word fragment of \(\mathsf{POL}^{-}\), we transfer the following result from \(\mathsf{PAL}\) to \(\mathsf{POL}^{-}\): **Theorem 16**.: _[_11_]_ _The satisfiability problem of \(\mathsf{PAL}\) is \(\mathsf{NP}\)-Complete for the single-agent case and \(\mathsf{PSPACE}\)-Complete for the multi-agent case._ \(\mathsf{PAL}\) is the extension of epistemic logic with dynamic modal constructions of the form \([\varphi!]\psi\) that expresses 'if \(\varphi\) holds, then \(\psi\) holds after having announced \(\varphi\) publicly'. The dynamic operator \(\langle\pi\rangle\) in the word fragment of \(\mathsf{POL}^{-}\) consists in announcing publicly a sequence of observations. W.l.o.g. as \(\pi\) is a word \(a_{1}\ldots a_{k}\), \(\langle\pi\rangle\) can be rewritten as \(\langle a_{1}\rangle\ldots\langle a_{k}\rangle\). In other words, we suppose that the \(\mathsf{POL}^{-}\) dynamic operators only contain a single letter. The mechanism of \(\mathsf{POL}^{-}\) is close to Public announcement logic (\(\mathsf{PAL}\)). Observing \(a\) consists in announcing publicly that \(wa\) occurred where \(w\) is the observations already seen so far. We introduce fresh atomic propositions \(p_{wa}\) to say that letter \(a\) is compatible with the current state given that the sequence \(w\) was already observed. For all words \(w\in\Sigma^{*}\), we then define \(tr_{w}\) that translates a \(\mathsf{POL}^{-}\) formula into a \(\mathsf{PAL}\) formula given that \(w\) is the already seen observations seen so far: \[tr_{w}(p)= p\] \[tr_{w}(\neg\varphi)= \neg tr_{w}(\varphi)\] \[tr_{w}(\varphi\wedge\psi)= tr_{w}(\varphi)\wedge tr_{w}(\psi)\] \[tr_{w}(K_{i}\varphi)= K_{i}tr_{w}(\varphi)\] \[tr_{w}(\langle a\rangle\varphi)= p_{wa}!tr_{wa}(\varphi)\] We finally transform any \(\mathsf{POL}^{-}\) formula \(\varphi\) into \(tr(\varphi):=tr_{e}(\varphi)\). **Example 4**.: _Consider the \(\mathsf{POL}^{-}\) formula \(\varphi:=[a]\bot\wedge\langle a\rangle\langle a\rangle\top\). \(tr(\varphi)\) is \([p_{a}!]\bot\wedge\langle p_{a}!\rangle\langle p_{aa}!\rangle\top\). Note that if \(p_{a}\) is false, the truth value of \(p_{aa}\) is irrelevant._ **Proposition 17**.: \(\varphi\) _is satisfiable in the word fragment of \(\mathsf{POL}^{-}\) iff \(tr(\varphi)\) is satisfiable in \(\mathsf{PAL}\)._ Proof.: (sketch)\(\Rightarrow\) Suppose there is a pointed \(\mathsf{POL}^{-}\) model \(\mathcal{M},s_{0}\) such that \(\mathcal{M},s_{0}\models\varphi\). We define \(\mathcal{M}^{\prime}\) to be like \(\mathcal{M}\) except that for all states \(s\) in \(\mathcal{M}\), for all \(w\in\Sigma^{*}\), we say that \(p_{w}\) is true at \(\mathcal{M}^{\prime}\), \(s\) iff \(\mathit{Exp}(s)\backslash w\neq\emptyset\). It remains to prove that \(\mathcal{M}^{\prime},s_{0}\models tr(\varphi)\). We prove by induction on \(\varphi\) that for all \(w\in words(\varphi)\), if \(\mathit{Exp}(s)\backslash w\neq\emptyset\) then \(\mathcal{M}|_{w},s\models\varphi\) iff \(\mathcal{M}^{\prime},s\models tr_{w}(\varphi)\). We only show the interesting case of \(\varphi=\langle a\rangle\psi\). Here the \(\mathrm{tr}_{w}(\langle a\rangle\psi)=\langle p_{wa}!\rangle\mathrm{tr}_{wa}(\psi)\). By assumption, \(\mathcal{M}|_{w},s\models\langle a\rangle\psi\). Hence \(\mathcal{M}|_{wa},s\vDash\psi\). Therefore \(Exp(s)\backslash wa\neq\emptyset\). By definition of \(\mathcal{M}^{\prime}\), \(p_{wa}\) is true in \(s\). Therefore by IH \(\mathcal{M}^{\prime}\), \(s\vDash\mathrm{tr}_{wa}(\psi)\). And since \(p_{wa}\) is true, hence \(\mathcal{M}^{\prime},s\vDash\mathrm{\langle p_{wa}!\rangle\mathrm{tr}_{wa}\psi\). Conversely, assuming \(\mathcal{M}^{\prime},s\vDash\mathrm{\langle p_{wa}!\rangle\mathrm{tr}_{wa}(\psi)}\). Hence \(p_{wa}\) is true in \(s\). By definition, \(p_{wa}\) is true iff \(\mathit{Exp}(s)\backslash wa\neq\emptyset\). Also by IH, \(\mathcal{M}|_{wa},s\vDash\psi\). Hence \(\mathcal{M}|_{w},s\vDash\psi\). \(\Leftarrow\) Suppose there is a pointed epistemic model \(\mathcal{M}^{\prime}\), \(s_{0}\) such that \(\mathcal{M}^{\prime},s_{0}\models tr(\varphi)\). We define a \(\mathsf{POL}^{-}\) model \(\mathcal{M}\) like \(\overline{\mathcal{M}^{\prime}}\) except that for all states \(s\), \(\mathit{Exp}(s)=\{w\in\Sigma^{*}\mid\mathcal{M},s\models p_{w}\}\). It remains to prove that \(\mathcal{M},s_{0}\models\varphi\). For the rest of the proof, we prove by induction on \(\varphi\) that for all \(w\in\Sigma^{*}\), if \(\mathit{Exp}(s)\backslash w\neq\emptyset\) then \(\mathcal{M}|_{w},s\models\varphi\) iff \(\mathcal{M}^{\prime},s\models tr_{w}(\varphi)\). The proof goes similarly as earlier. Note that the single-agent and multi-agent word fragment of \(\mathsf{POL}^{-}\) is a syntactic extension of propositional logic and the multi-agent epistemic logic respectively, which are \(\mathsf{NP}\)-Hard and \(\mathsf{PSPACE}\)-Hard respectively. From the fact that the satisfiability problem of single agent and the multi-agent fragments of \(\mathsf{PAL}\) is in \(\mathsf{NP}\) and \(\mathsf{PSPACE}\) respectively, we have the following corollaries of Proposition 17. **Corollary 18**.: _The satisfiability problem of the single-agent word fragment of \(\mathsf{POL}^{-}\) is \(\mathsf{NP}\)-Complete._ **Corollary 19**.: _The satisfiability problem of the multi-agent Word fragment of \(\mathsf{POL}^{-}\) is \(\mathsf{PSPACE}\)-Complete._ ## 7 Related work The complexity of Dynamic Epistemic Logic with action models and non-deterministic choice of actions is \(\mathsf{NEXPTIME}\)-Complete too [12] and their proof is similar to the one of Theorem 11. The tableau method described for \(\mathsf{POL}^{-}\) uses a general technique where terms contain the observations/announcements/actions played so far. This technique was already used for PAL [13], DEL [12], and for a non-normal variant of PAL [14]. Decidability of (single-agent) epistemic propositional dynamic logic (EPDL) with Perfect Recall (PR) and No Miracles (\(\mathsf{NM}\)) is addressed in [15]. Although \(\mathsf{PR}\) and \(\mathsf{NM}\) are validities in \(\mathsf{POL}^{-}\), there are differences to consider even in single agent. Firstly, in an EPDL model, a possible state can execute a program \(a\) and can non-deterministically transition to a state among multiple states, whereas in \(\mathsf{POL}^{-}\), if a state survives after observation \(a\), it gives rise to the same state except the \(\mathit{Exp}\) function gets residued. Also, in EPDL, after execution of a program, the state changes hence the propositional valuation in the state changes, whereas in \(\mathsf{POL}^{-}\), the state _survives_ after a certain observation and hence the propositional valuation remains the same. Whereas in \(\mathsf{POL}^{-}\), observations update the model, there are other lines of work in which specifying what agents observe define the epistemic relations in the underlying Kripke model [16] (typically, two states are equivalent for some agent \(i\) if agent \(i\) observes the same facts in the two states). ## 8 Perspectives This work paves the way to an interesting technical open question in modal logic: the connection between \(\mathsf{POL}^{-}\) and product modal logics. Single-agent \(\mathsf{POL}^{-}\) is close to the product modal logic \(S5\times K\), the logic where models are Cartesian products of an S5-model and a K-model. Indeed, the first component corresponds to the epistemic modality \(\tilde{K}_{i}\) while the second component corresponds to observation modalities \(\langle\pi\rangle\). There are however two important differences. First, in \(\mathsf{POL}^{-}\), valuations do not change when observations are made. Second, the modality \(\langle\pi\rangle\) is of branching at most exponential in \(\pi\) while modalities in K-models do not have branching limitations. We conjecture that the two limitations can be circumvented but it requires some care when applying the finite model property of product modal logic \(S5\times K\). If this connection works, it would be a way to prove \(\mathsf{NEXPTIME}\)-Completeness of star-free single-agent \(\mathsf{POL}^{-}\). Recall that \(\mathsf{POL}^{-}\) is close to \(\mathsf{PAL}\) with propositional announcements only (see Proposition 17). We conjecture some connections between \(\mathsf{POL}^{-}\) and arbitrary \(\mathsf{PAL}\)[17], and more precisely with Boolean arbitrary public announcement logic [18]. Indeed, the non-deterministic choice \(+\) enables to check the existence of some observation to make (for instance, \(\langle(a+b)^{10}\rangle\varphi\) checks for the existence of a 10-length word to observe), which is similar to checking the existence of some Boolean announcement. The next perspective is also to tackle \(\mathsf{POL}\) with Kleene-star in the language. This study may rely on techniques used in epistemic temporal logics. PAL with Kleene-star is undecidable [19]. Again, the undecidability proof relies on modal announcements. Since \(\mathsf{POL}\) is close to Boolean announcements, this is a hope for \(\mathsf{POL}\) to be decidable. The idea would be to exploit the link between dynamic epistemic logics and temporal logics [20], and rely on techniques developed for tackling the satisfiability problem in epistemic temporal logics [21].

2305.03127

2D triangular Ising model with bond phonons: An entropic simulation study

In this work, we study and evaluate the impact of a periodic spin-lattice coupling in an Ising-like system on a 2D triangular lattice. Our proposed simple Hamiltonian considers this additional interaction as an effect of preferential phonon propagation direction augmented by the symmetry ofthe underline lattice. The simplified analytical description of this new model brought us consistent information about its ground state and thermal behavior, and allowed us to highlight a singularity where the model behaves as several decoupled one-dimensional Ising systems. A thorough analysis was obtained via entropic simulations based in the Wang-Landau method that estimates the density of states g(E) to explore the phase diagram and other thermodynamic properties of interest. Also, we used the finite size scaling technique to characterize the critical exponents and the nature of the phase transitions that, despite the strong influence of the spin-lattice coupling, turned out to be within the same universality class as the original 2D Ising model.

R. M. L. Nascimento, Claudio J. DaSilva, L. S. Ferreira, A. A. Caparica

2023-05-04T19:56:33Z

http://arxiv.org/abs/2305.03127v2

# The Ising model with a periodic spin-lattice coupling on the triangular lattice ###### Abstract In this work, we study and evaluate the impact of a periodic spin-lattice coupling in an Ising-like system on a 2D triangular lattice. Our proposed simple Hamiltonian considers this additional interaction as an effect of preferential phonon propagation direction augmented by the symmetry of the underline lattice. The simplified analytical description of this new model brought us consistent information about its ground state and thermal behavior, and allowed us to highlight a singularity where the model behaves as several decoupled one-dimensional Ising systems. A thorough analysis was obtained via numerical simulations using the Wang-Landau Monte Carlo method that estimates the density of states \(g(E)\) to explore the phase diagram and other thermodynamic properties of interest. Also, we used the finite size scaling technique to characterize the critical exponents and the nature of the phase transitions that, despite the strong influence of the spin-lattice coupling, turned out to be within the same universality class as the original 2D Ising model. ## I Introduction The study of magnetic systems is one of the most relevant in condensed matter physics. Since its discovery, several scientific works and technological applications have been developed [1; 2]. They focused on proposing several models based on mathematical expressions capable of describing or at least approaching the observed phenomenon. Such approaches start from microscopic modeling of magnetic moments to the point of reproducing the macroscopic behavior of these phenomena[3]. One of the works of great prominence following this approach is the Ising model developed by Ernest Ising in 1920 [4]. Since then, several seminal studies have emerged to improve the comprehension of the spin interaction process. In this list, we can highlight the Heisenberg model and the XY model [5], as well as the Potts model [6], the J1-J2 model [7; 8], among others. Although each model has its particular scope, a common factor among them is that they only use spin-spin exchange interactions. However, modeling these types of systems consists of arranging magnetic moments on a crystalline lattice[9], not taking into account the influence of the lattice vibration on the thermal properties of these systems. Some works investigate what the elastic wave of the crystalline lattice can promote in the dynamics of the spins. One of the first dates back to 1975 [10] where, in addition to other singularities, it was able to present strong indications of the impact that the coupling with the lattice can promote on the critical temperature and the type of phase transition. After this study, other works followed the same approach but allowed greater freedom for the orientation of the spins [11; 12; 13]. This whole trajectory up to the present day has made the approach involving the spin interaction and the degrees of freedom of the lattice relevant to the study of electronic materials such as single-layer semiconductors [14], which make up the list of devices with great potential for spintronics [15]. In addition, still based on this methodology, studies that consider the influence of lattice vibration on interactions also contribute to the comprehension of the phenomena involving superconductivity [16], ferroelectricity [17] and other unique characteristics of great interest for the study of magnetic materials. Faced with the immense influence that lattice vibration can exert on magnetic interactions, we feel motivated to propose this work in which we seek to understand how this vibration can interfere with the behavior of Ising-like spin systems. These studies can become more relevant when we consider the vibration of the crystalline lattice as a whole, i.e., together with its symmetry. Some of the consequences of this proposal culminated in the ability to represent certain models in specific situations and to indicate a more physically acceptable formulation for the description of the observed phenomena. Therefore, the vibration of the crystalline lattice can change the lattice parameters, moving atoms closer or further away. This perspective appears when one is evaluating the impact of phonon dynamics on the behavior of magnetic systems, considering the spin-lattice coupling [18; 19]. In this case, when one couple the spin-exchange interaction and the distances between two magnetic ions, it is possible to obtain a Hamiltonian that describes the interference caused by the phonons to this interaction [20]. In addition, additional energy is also generally proposed that takes into account the elastic energy, which, in its simplest form, only considers the length of bonds or the magnitude of displacements of sites related to bond-phonon models [21] and site-phonon [22], respectively. The first one relies on the fact that each bond vibrates independently, while the other tries to guarantee that each site will have to oscillate independently. Therefore, the system energy will be directly related to the degrees of freedom of the crystalline lattice via negligible displacements of the equilibrium positions, requiring the construction of continuous models. As a result, this requirement increases the complexity of the calculations and proposed models where, in most cases, simulations require a high computational cost [23; 24; 25; 26]. On the other hand, in our proposal, we want to know the influence of the lattice vibration in an Ising-like triangular lattice model, in which we reduce the degrees of freedom of the spins and neglect the instantaneous positions of the atoms. Consequently, the effect of this lattice vibration goes into the exchange interaction dependent on the interacting sites. Promptly, assuming a lattice model has the potential to enable the use of entropic simulations to obtain thermodynamic properties, as well as the analysis of the criticality of the model on the influence of lattice vibration. We start this paper by describing the proposed model in section II. In section III, we address the computational details used to obtain the results. Then, in section IV, we present the thermodynamic properties and discuss the main characteristics of the influence of lattice vibration on the triangular Ising model. Finally, in section V we summarize the results and allude to some final remarks. ## II The model The crystalline lattice vibration can change the lattice parameters, making the atoms approach or move away. Such a situation can produce a variation in the value of the interaction between the spins since it depends on their separation. Generally speaking, a minimum Hamiltonian based on the Heisenberg model deals with the atom displacements from their equilibrium positions[20; 27; 28]. This Hamiltonian may consider the interactions between the first neighbors independent of their length so that the exchange interaction depends on the oscillations around the equilibrium position as \(J_{ij}(|\mathbf{r}_{ij}^{0}+\mathbf{u}_{i}-\mathbf{u}_{j}|)\), where \(\mathbf{r}_{ij}^{0}\) indicates the equilibrium distance between the first neighbors and \(\mathbf{u}_{i}\) (\(\mathbf{u}_{j}\)) corresponds to the displacement vector of each site \(i\) (\(j\)) from its respective regular position. This trick also takes into account the occurrence of small displacements compared to the equilibrium distance between the atoms, that is, \(|\mathbf{u}_{i}|/|\mathbf{r}_{ij}^{0}|\ll 1\). This strategy allows us to carry out an expansion of the exchange interaction around the equilibrium position in such a way that, when we ignore the terms of higher orders, we have: \[(|\mathbf{r}_{ij}^{0}+\mathbf{u}_{i}-\mathbf{u}_{j}|)J_{ij}=J_{ij}(|\mathbf{r }_{ij}^{0}|)+\frac{dJ_{ij}}{dr}|_{r=|\mathbf{r}_{ij}^{0}|}\mathbf{e}_{ij} \cdot(\mathbf{u}_{i}-\mathbf{u}_{j}), \tag{1}\] where \(J_{ij}=J_{ij}(|\mathbf{r}_{ij}^{0}+\mathbf{u}_{i}-\mathbf{u}_{j}|)\) and \(\mathbf{e}_{ij}\equiv\mathbf{r}_{ij}^{0}/|\mathbf{r}_{ij}^{0}|\) is the vector that connects two neighboring sites \(i\) and \(j\) in their respective equilibrium positions. Also, the first term of Eq. (1) is a constant that depends only on the equilibrium distances and therefore represents an undisturbed exchange interaction. The second one allows for the distortions of the crystalline lattice promoted by the negligible displacements of the atoms. More importantly, we can use this exchange interaction also for systems that contain Ising-like spins, obtaining a Hamiltonian of the type \[\mathcal{H}=-\sum_{\langle i,j\rangle}J_{ij}\sigma_{i}\sigma_{j}, \tag{2}\] where \(\sigma_{i}\) is the spin variable that can assume \(\pm 1\). In this work, we adjusted this approach considering that displacements can only occur in a preferred direction, called the main axis. Furthermore, we fix the principal axis along one of the directions connecting two neighboring sites. Then the exchange interaction can be written as \[J_{ij}=J+J_{a}\cos(n\phi_{ij}), \tag{3}\] where \(J_{a}\) is a phenomenological parameter that is related to the influence of phonons on spin interactions and \(\phi_{ij}\) is the angle formed from an orientation taken on the main axis and the line that joins the spins neighbors \(i\) and \(j\). Since we chose to position the main axis in the direction of one of the possible interactions, we can choose the main axis in the direction of the vector \(\hat{v}\) as shown in Fig.1. In this sense, when we adopt a triangular lattice, we observe that the angles formed between the main axis and the interactions between neighboring spins are multiples of \(60^{\circ}\). Another important aspect of our proposal is the role of the variable \(n\) that is responsible for ensuring the isotropy of bonds between two neighboring spins. Basically, on the triangular lattice, we can separate the possible values for \(n\) into two cases: (\(i\)) - \(n\) is a multiple of \(6\), and (\(ii\)) - \(n\) is not a multiple of \(6\). For case (\(i\)) we will have \(J_{ij}=J+J_{a}\) for all connections, so that, for \(J_{a}>0\) Eq. (2) will represent the ferromagnetic triangular Ising model with reinforced interactions, whereas with \(J_{a}<0\) and \(|J_{a}|>J\), we will have the antiferromagnetic triangular Ising model which, in particular, belongs to a frustrated systems class [29]. For case (\(ii\)) we will have \(J_{ij}=J+J_{a}\) for connections in the direction of the main axis and \(J_{ij}=J-J_{a}/2\) for the other connections. In this work, we will adopt case (\(ii\)) using the value \(n=2\). Given the main interest in investigating the effects caused by Figure 1: Representation of a configuration in the triangular lattice. The dotted lines indicate the interactions between the first neighbors of the site \(i\). Taking the direction given by the vector \(\hat{v}\) as the main axis, the angle \(\phi_{i,j}=60^{\circ}\) is represented in the figure. the vibration of atoms in the lattice, we consider \(J=1\). Allied to this, when \(J_{a}=0\), the system represents the standard 2D triangular Ising model. Otherwise, the interaction energy of a spin with its first neighbors is given by \[\frac{\mathcal{H}_{i,j}}{\sigma_{i,j}}= -(1+J_{a})(\sigma_{i,j-1}+\sigma_{i,j+1}) \tag{4}\] \[-(1-\frac{J_{a}}{2})(\sigma_{i-1,j-1}+\sigma_{i-1,j}+\sigma_{i+1,j +1}+\sigma_{i+1,j}),\] where the index \(i(j)\) is associated with translations in the \(\hat{u}(\hat{v})\) direction. In this equation, the first term represents the interactions on the main axis, while the second term refers to the interactions outside this axis. Based on the exposition of Eq.(4), we can verify that for \(J_{a}>0\) the interactions outside the \(\hat{v}\) axis are null when \(J_{a}=2\), making the system analogue to the one-dimensional case. In this case, there is a comparability with the Ising 1D model for \(J=3\). For \(J_{a}>2\) the ground state changes from ferromagnetic to a one formed by stripes (\(ST\)), which are ferromagnetically organized lines as shown in Fig 2. This happens because the ferromagnetic interaction energy located on the \(\hat{v}\) axis is much greater than the interaction energy of the spins outside this axis. An example that supports the representation of this behavior occurs when we consider \(J_{a}=4\). ## III Computational details We will use entropic simulations to obtain the thermodynamic properties of the system to characterize the phase transitions of the model. This tool proved to be effective in the study of critical phenomena due to its ability to obtain thermodynamic quantities at any temperature. Its use became more effective after the publication of the Wang-Landau algorithm [30; 31], whereby leveling the energy histogram, followed at each simulation step, it is possible to obtain a good estimate for the density of states \(g(E)\). This methodology allows estimating any thermodynamic quantity \(X\) through the canonical mean \[\langle X\rangle=\frac{\sum_{E}X_{E}g(E)e^{-\beta E}}{\sum_{E}g(E)e^{-\beta E }}, \tag{5}\] where \(X_{E}\) represents the microcanonical average that was accumulated during the simulation. Since the density of states corresponds to a very large number, it is convenient to adhere to the simulation with the logarithm of the density of states, \(S(E)=\ln g(E)\), identified as the microcanonical entropy. At the beginning of the simulation, we assume \(S(E)=0\) and choose the lowest energy configuration as the starting point. A new configuration is obtained by changing the spin state of a random site, whose acceptance probability is given by \[P(E_{\mu}\to E_{\nu})=min(e^{S(E_{\mu})-S(E_{\nu})},1). \tag{6}\] At each change attempt, we update the energy histogram and the logarithm of the density of states \(H(E_{\nu})\to H(E_{\nu})+1\) and \(S(E_{\nu})\to S(E_{\nu})+F_{i}\), respectively. \(F_{i}=\ln f_{i}\) and \(f_{i}\) the modification factor that initially corresponds to \(f_{0}\equiv e=2.71828\ldots\)[30]. Then, at each flatness condition met, we update \(f_{i}\) based on the criterion \(f_{i+1}=\sqrt{f}_{i}\) and then the histogram is reset. Going beyond what is proposed in the original article by Wang-Landau, in this process we accumulate the microcanonical averages from \(f_{7}\)[32] where the histogram is expected to be flat. We end the simulation at a \(f_{final}\) that ensures the accumulated canonical mean throughout the simulation, whereas in this work we end at \(f_{15}\) which is also recognized as the sixteenth level of Wang-Landau. In addition, a two-dimensional approach to the density of states \(g(E_{1},E_{2})\) can be used, allowing estimation of thermodynamic quantities for any values of the energy parameters of \(E_{1}\) and \(E_{2}\)[33]. Its use allows one to obtain a sketch of the phase diagram of the system. However, there is a significant increase in computational time, using only small lattice sizes. The simulations protocol is kept unchanged, the only changes are that \(g(E)\longrightarrow g(E_{1},E_{2})\) and \(H(E)\longrightarrow H(E_{1},E_{2})\). The canonical mean of a quantity \(X\) is given by \[\langle X\rangle=\frac{\sum_{E_{1},E_{2}}X_{E_{1},E_{2}}g(E_{1},E_{2})e^{- \beta E}}{\sum_{E_{1},E_{2}}g(E_{1},E_{2})e^{-\beta E}}, \tag{7}\] where \(E=JE_{1}+J_{a}E_{2}\). ## IV Results To establish a more in-depth description of the behavior of the model, we initially sought to calculate essential thermodynamic quantities such as energy, specific heat, magnetization, susceptibility and other properties through the simulation method linked to the calculation of the density of states \(g(E,M)\). The two-dimensional approach to the density of states allowed us to explore more quickly the influence provoked in the lattice of spins established by the different values assumed by \(J_{a}\). However, despite this gain, we are limited to smaller lattice sizes corresponding to \(L=6\), \(L=12\) and \(L=18\). To guide the study of this model from the perspective of \(J_{a}>0\), we started our approach at this first moment, Figure 2: Ground states for \(J=1.0\) and \(J_{a}=4.0\). In the direction of the main axis, the spins have a ferromagnetic order. Such configurations will be called Stripes. seeking to highlight the phase diagram of the model (Fig.3). Its construction was established from the extraction of the critical temperature corresponding to the maximum of the specific heat linked to each value attributed to \(J_{a}\) that belongs to the interval of interest. In addition, we also identified that the data shown in Fig.3 has a high degree of similarity with works that, despite having a more complex Hamiltonian, address the same degrees of freedom of spins considered here[34]. In this last reference, for example, it was also observed in the phase diagram of a ferromagnetic system that the coupling with the lattice decreases the transition temperature of the magnetic system before a certain critical coupling value and increases the transition temperature after this value. This fact is clearly described here as observed in Fig.3. Another aspect that deserves attention regarding this graph is when the model behaves similarly to a one-dimensional system, as in \(J_{a}=2.0\). And although this characteristic was already predicted by the equation Eq.(4), in this initial stage the simulations were able to show strong evidence of the existence of a critical temperature associated with this point, as observed in Fig.3 and Fig.5. Given this, it is also worth mentioning that the confirmation of this characteristic is already supported by results from recently published works[35]. Other points that improve the understanding of the model are exposed when we evaluate the thermodynamic properties together with the phase diagram. In Fig.4 we obtain the mean energy per spin so that the value corresponding to the ground state for \(0\leq J_{a}\leq 2\) is equivalent to \(-3J\), whose representation is associated with a ferromagnetic phase in that same interval (a fact already supported by the analytical evaluation of the model). Still in the region of low temperatures when we observe the values of \(J_{a}>2\), a new symmetry appears in the ground state identified as the _stripes_ phase (St) which in this case is composed of vertical lines of spins that align in an ordering _up_ and _down_ alternately, which is also shown according to the analytical exposition. From the graph of the specific heat observed in Fig.5 we verify that with \(J_{a}=0.00\) (pure Ising model in the triangular lattice) a peak appears corresponding to the critical temperature of the ferro-paramagnetic phase transition, whose analyt Figure 4: Energy as a function of temperature for several values of \(J_{a}\). Figure 5: Specific heat as a function of temperature for various values of \(J_{a}\). Figure 6: Magnetization as a function of temperature for several values of \(J_{a}\). ical value is \(k_{B}T_{c}/J\approx 3.65364\). And although this value was extracted from a small lattice, it is reasonable as observed in other works [36] to provide us with even more confidence regarding the adequacy of pure Ising model. Along the same lines, it is also possible to observe a dual behavior of the specific heat peak, whose maximum undergoes a shift to the left in the range of \(0\leq J_{a}\leq 2\) indicating a progressively lower ferromagnetic transition temperature and in the range of \(2<J_{a}\leq 4\) we observe the opposite behavior for the maximum of the specific heat that now undergoes a translation to the right and reaches increasingly higher transition temperatures for each value assigned to the \(J_{a}\) parameter. The abrupt distinction in behavior reinforces the presence of a new ordered state at low temperatures that appears with increasingly lower energies as shown in Fig.4 for the interval \(2<J_{a}\leq 4\) that need to reach higher energy levels to break the ordering of the _stripes_ phase and evolve into the paramagnetic phase. Still from the perspective of the same lattice size, we can observe the magnetization (Fig.6) and susceptibility (Fig.7) behavior of the system for various values of \(J_{a}\). In this context, we can observe that the magnetization of the system starts at 1.0, reinforcing a classic behavior of a ferromagnetic system, and suffers a transition temperature difference for each value of \(J_{a}<2.0\). The correspondence of these transition points is also observed in the maxima presented by the susceptibility for this same range of \(J_{a}\) values. In a completely different direction, we observe an atypical behavior in both graphs for \(J_{a}=2.0\), which was already expected given the fact that this value of \(J_{a}\) signals the threshold of the two phases as it is pronounced in the phase diagram. This feature, which was also predicted by the analytical route of the model, forced the system to have one-dimensional dynamics in the face of the established decoupled columns. From this point on, the _stripes_ phase emerges. To explore this region in more depth, we need to present a new order parameter that is capable of meeting this expectation. This parameter was established as \[Q=\sum_{i=1}^{L}|\sum_{j=1}^{L}\sigma_{ij}|, \tag{8}\] where \(Q\) corresponds to the final result of the sum of the Figure 8: Order parameter and susceptibility as a function of temperature for several values of \(J_{a}\geq 2\). Figure 7: Magnetic susceptibility as a function of temperature for several values of \(J_{a}\). Figure 9: Susceptibility as a function of temperature to \(J_{a}=1.0\) modules obtained from each sum of the spins arranged vertically. Using this artifice, we obtain the characteristic behavior of an order and susceptibility parameter for \(J_{a}=2.0\) and for values greater than this that fall within the _stripes_ phase, as shown in figure Fig.8. The need to better understand the scalability of the system at points whose regions are well defined together with the guarantee of the validity of the parameter \(Q\) raises the confidence level to investigate the _stripes_ phase and the ferromagnetic phase for lattice sizes even bigger. To achieve this goal we performed the simulations with \(g(E)\) instead of \(g(E,M)\) for different lattice sizes ranging from 30 to 60 as can be seen in the figures Fig.9 and Fig.10. In both graphs, it is possible to see the existence of transition signals for each lattice size and a scaling law that is associated with the respective sizes. These results reinforce the feasibility of exploring the behavior of the system for \(J_{a}=1.0\) (representing the ferromagnetic phase) and \(J_{a}=4.0\) (representing the _stripes_ phase). For this, we use the finite size scaling theory so that the results can be projected to an infinite size. According to this theory we obtain a universal form for the molar Helmholtz free energy corresponding to the equation \[f(t,H;L)=L^{-d}Y(atL^{1/\nu},bHL^{\Delta/\nu}), \tag{9}\] this expression identifies the reduced temperature \(t\) which is equivalent to \((T-T_{c})/T_{c}\), the external field \(H\), the metric factors \(a\) and \(b\), the spatial dimension of the system \(d\), the static critical exponents \(\nu\) and \(\Delta\) and the linear dimension of the system \(L\). From this, it is possible to extract system information equivalent to magnetization, susceptibility and specific heat through the equation (9) [37; 38]. At \(H=0\) such features follow the following scaling laws \[m\approx L^{-\beta/\nu}m^{\prime}(tL^{1/\nu}), \tag{10}\] \[\chi\approx L^{\gamma/\nu}\chi^{\prime}(tL^{1/\nu}), \tag{11}\] \[c\approx c_{\infty}+L^{\alpha/\nu}c^{\prime}(tL^{1/\nu}). \tag{12}\] In the critical region (\(t=0\)), we identify the universal scaling functions \(m^{\prime}\), \(\chi^{\prime}\) and \(c^{\prime}\) as constants and the static critical exponents \(\beta\), \(\gamma\) and \(\alpha\) that make up the base responsible for identifying the universality class that the system fits [39]. These exponents obey the scale and hyperscale relationships recognized as the Fisher, Rushbrooke, Widom, and Josephson [40] relationships. Despite the usefulness of these relations, it is observed a certain difficulty in eliminating the dependence that each thermodynamic property of interest has on the exponent \(\nu\). Thus, to obtain it in isolation, we use the equation \[V_{j}\approx(1/\nu)\ln L+V_{j}^{\prime}(tL^{1/\nu}). \tag{13}\] In this equation we have \(j=1,....,6\), where \(V_{j}^{\prime}\) are constants independent of the size of the system that represent thermodynamic quantities extracted from the logarithm of the derivative of magnetization. At the critical temperature, (\(T_{c}\)) these functions converge to their corresponding value in the infinite lattice so that when we perform a linear adjustment of the graph referring to \(V_{j}\) x \(L\) we can calculate \(1/\nu\). Having found the exponent \(\nu\) Figure 10: Susceptibility as a function of temperature for \(J_{a}=4.0\) and the specific heat and susceptibility maxima, we can estimate the critical temperature using the equation \[T_{c}(L)\approx T_{c}+a_{q}L^{-1/\nu}, \tag{14}\] where \(a_{q}\) is identified as a constant. Following all the steps of this theory we managed to obtain the first critical exponent of interest as displayed by the graph Fig.11. In this graph, when we take into account the average standard deviation \(\Delta\nu=\Delta(1/\nu)/(1/\nu)^{2}\) that is associated with this exponent we find for \(J_{a}=1.0\) the value of \(\nu=0.96404(93)\) and for \(J_{a}=4.0\) the value of \(\nu=0.9548(68)\). From these data we extract the critical temperature as shown in the graph Fig.12, in this graph the transition temperature from the ferromagnetic phase (\(J_{a}=1.0\)) to the paramagnetic phase is equivalent to \(T_{c}=3.35160(22)\), on the other hand, the transition temperature from the stripes phase (\(J_{a}=4.0\)) to the paramagnetic phase presents a transition temperature corresponding to \(T_{c}=7.57792(23)\). In the graph Fig.13 we obtain for \(J_{a}=1.0\) the result \(\gamma/\nu=1.7622(15)\) and for \(J_{a}=4.0\) the result \(\gamma/\nu=1.7520(10)\) and the associated error being \(\gamma\) equivalent to \(\Delta\gamma=\Delta\nu(\gamma/\nu)+\nu\Delta(\gamma/\nu)\) it turns out that for \(J_{a}=1.0\) we have \(\gamma=1.6988(31)\) and for \(J_{a}=4.0\) we obtain the exponent \(\gamma=1.673(13)....\) To calculate the last critical exponent we used the results of the graph Fig.14 where for \(J_{a}=1.0\) we have \(\beta/\nu=0.1327(12)\) and for \(J_{a}=4.0\) we obtain \(\beta/\nu=0.1280(19)\), knowing that the error associated with \(\beta\) is \(\Delta\beta=\Delta\nu(\beta/\nu)+\nu\Delta(\beta/\nu)\) we have \(\beta=0.1279(13)\) for \(J_{a}=1.0\) and \(\beta=0.1222(34)\) for \(J_{a}=4.0\). This entire set of results just presented for the critical exponents \(\gamma/\nu\) and \(\beta/\nu\) for the system with \(J_{a}=1.0\) and with \(J_{a}=4.0\) also provides us with strong evidence that the model has the same universality class as the two-dimensional Ising model that has exponents \(\gamma/\nu=7/4=1.75\) and \(\beta/\nu=1/8=0.125\) as it is also adopted as a reference parameter in other works [36; 41]. Furthermore, given the strong evidence exposed so far, it is also possible to infer that the respective transitions from both the ferromagnetic and _Stripes_ phases to the paramagnetic phase fall within transitions characterized as second order. ## V Conclusion In this work, we propose a different and physically more adequate way to describe the dynamics of Ising like magnetic spins located under a crystalline lattice. The main focus of this proposal was to evaluate how the lattice vibration under a preferential direction interferes with the spin interaction dynamics and what is its repercussion on the phase transition temperature for each lattice coupling factor considered. Based on this, we established a Hamiltonian that, as a result of this study, proved capable of meeting this purpose, presenting strong results from classical thermodynamic properties and robust techniques such as finite-size scaling that proved to be useful in determining the universality class of the system. Another merit worth highlighting concerns the additional interaction adopted in this work whose composition considers the symmetry of the chosen lattice. The presence of this artifice in the Hamiltonian managed to promote a rotational anisotropy that altered the interaction dynamics of the spins favoring the interactions taken on a preferential direction that coincides with the direction of propagation of the phonons. As a consequence of this process, the adoption of the proposed Hamiltonian for the triangular lattice demonstrated that up to \(J_{a}=2.0\) the coupling with the lattice favors the ferro-paramagnetic phase transition. On the other hand, after this factor, the coupling with the lattice disfavors the _Stripes_ - paramagnetic transition. The mathematical representation of the model also allowed us to obtain some analytical developments that served to clarify the behavior of the system in its singularity and to guide this entire study developed throughout the simulations. In this sense, despite the simplicity of this approach, the impacts are extremely relevant. Because when we explore a single type of lattice considering only \(J_{a}\geq 0.0\) the system can also represent similar behaviors that are linked to more complex models, in addition to the two-dimensional Ising model in the triangular lattice ( when \(J_{a}=0.0\)) and the one-dimensional Ising model (when \(J_{a}=2.0\)). In this way, it is to be expected that by expanding the range of investigation routes of this proposal, either by changing the degrees of freedom of the spins or the type of lattice, we will be able to achieve even more surprising results.

2307.02440

Membrane Thickness Sensitivity of Avian Prestin: Implications

Avian prestin is sensitive to membrane thickness as much as mammalian prestin, which undergoes conformational transitions in membrane area and thereby drives length changes of the cylindrical cell body of outer hair cells. The membrane thickness dependence of mammalian prestin stems from changes in hydrophobic profile in conformational states, accompanied by changes in their membrane area. Even though such area changes are not detected for avian prestin, it nonetheless bends hair bundles of avian short hair cells. Here it is suggested that the motile function of avian prestin can be based on conformational transitions involving shearing deformation of the membrane protein, which also leads to membrane thickness sensitivity.

Kuni H Iwasa

2023-07-05T17:10:43Z

http://arxiv.org/abs/2307.02440v1

# Membrane Thickness Sensitivity ###### Abstract Avian prestin is sensitive to membrane thickness as much as mammalian prestin, which undergoes conformational transitions in membrane area and thereby drives length changes of the cylindrical cell body of outer hair cells. The membrane thickness dependence of mammalian prestin stems from changes in hydrophobic profile in conformational states, accompanied by changes in their membrane area. Even though such area changes are not detected for avian prestin, it nonetheless bends hair bundles of avian short hair cells. Here it is suggested that the motile function of avian prestin can be based on conformational transitions involving shearing deformation of the membrane protein, which also leads to membrane thickness sensitivity. ## Introduction Membrane thickness dependence of a membrane protein arises from difference in hydrophobic profile of its conformational states. Specifically for mammalian prestin, which undergoes changes in the surface area [1] coupled with charge transfer \(q\) across the membrane, membrane thickness dependence was expected since the volume of the protein is conserved during conformational changes. Indeed, that is the case with mammalian prestin: A reduction of membrane thickness shifts the transition voltage of the protein in the positive direction and an increase in membrane thickness has an opposite effect [2]. This observation is consistent with the expectation that a decreased hydrophobic thickness of the protein is associated with an increase in the surface area on hyperpolarization [3, 4]. Membrane thickness dependence can be closely associated with surface area changes during conformational transitions, which result in changes in the hydrophobic profile associated with thickness changes. It can be also associated with changes in the contour length of the hydrophobic interface between the protein and membrane lipid. The mode of motion, with which avian prestin is associated, differs from that of mammalian prestin. Avian prestin is associated with bending of hair bundles of avian short hair cells [5], which is quite different from length changes of cell body, which mammalian prestin drives [6]. How can these observations provide a physical picture? The present report is an attempt to address this issue.? ## Membrane thickness dependence Chicken prestin shows considerable membrane thickness dependence accompanied by somewhat smaller charge transfer compared with mammalian prestin [7]. Avian prestin has motile charge \(q\) smaller than that of mammalian prestin. However, its membrane thickness dependence is larger than that of mammalian counterpart. Another significant difference in the operating voltage \(V_{pk}\) can be attributed to rather depolarized membrane potential of avian hair cells [8], which is associated large hair bundle current due to cellular turning of the avian ear [9, 10]. ### Interpretation Membrane thickness sensitivity results from difference in interaction energy of a membrane protein, which undergoes conformational transitions, with membrane lipid. Let us assume a model membrane protein has two states \(S_{0}\) and \(S_{1}\). Assume that \(S_{0}\) and \(C_{1}\) has, respectively, length of circumference \(L_{0}\) and \(L_{1}=L_{0}+\Delta L\), at which it interacts with membrane lipid. Let \(\mathcal{E}(d-d_{0})\) be the energy per unit length due to hydrophobic mismatch in state \(S_{0}\) with membrane lipid with thickness \(d\), where \(d_{0}\) is the characteristic hydrophobic thickness of this state. Let \(d_{1}\) be the characteristic thickness of \(S_{1}\). \begin{table} \begin{tabular}{c|c c c} \hline & \(V_{\rm pk}\) & q & thickness sensitivity \\ & (mV) & (\(e\)) & (mV/\%) \\ \hline gerbil & \(-88\pm 11\) & \(0.73\pm 0.07\) & \(2.7\pm 0.2\) \\ platypus & \(-56\pm 11\) & \(0.79\pm 0.10\) & \(4.8\pm 0.1\) \\ **chicken** & \(54\pm 11\) & \(0.35\pm 0.12\) & \(8.9\pm 0.7\) \\ \hline \end{tabular} \end{table} Table 1: Here, Peak potential \(V_{\rm pk}\), motor charge \(q\), and thickness sensitivity. Membrane thickness sensitivity is expressed as voltage shifts per % change in the linear capacitance. \(e\): the electronic charge. Taken from Ref. [7]. The energy \(E_{0}\) and \(E_{1}\) due to hydrophobic mismatch respectively for \(S_{0}\) and for \(S_{0}\) can be expressed by \[E_{0}(d) =L_{0}\mathcal{E}(d-d_{0}), \tag{1a}\] \[E_{1}(d) =(L_{0}+\Delta L)\mathcal{E}(d-d_{1}). \tag{1b}\] It is likely that the function \(\mathcal{E}(x)\) is dominated by even powers of \(x\) because it should increase with the absolute value of the variable \(x\). The simplest case could be \(\mathcal{E}(x)=ax^{2}\), where \(a\) is a constant, but it likely includes higher-order terms. The difference in energy between the two states due to hydrophobic incompatibility is \(E_{\rm diff}(d)=E_{1}(d)-E_{0}(d)\). Now the effect of membrane thickness change \(d\to d+\Delta d\). This change shifts the energy difference between the two states by \[\Delta E=E_{\rm diff}(d+\Delta d)-E_{\rm diff}(d). \tag{2}\] This energy difference changes the relative weight of the conformation states, i.e. the conformational state of lower energy is favored. That leads to a shift of voltage dependence of prestin. If we can assume that \(\Delta d/d\ll 1\) but \(\Delta L/L\) may not be small, Eq. 2 can be approximated by the first-order terms of expansion, i.e. \[\Delta E/\Delta d=L_{0}(\mathcal{E}^{\prime}(d-d_{1})-\mathcal{E}^{\prime}(d- d_{0}))+\Delta L\mathcal{E}^{\prime}(d-d_{1}) \tag{3}\] where \(\mathcal{E}(x)^{\prime}\) is the first derivative of \(\mathcal{E}(x)\) with respect to \(x\). In the simplest case \(\mathcal{E}(x)=ax^{2}\), the first term is proportional to \(d_{1}-d_{0}\). This special case illustrates that the first term in Eq. 3 is due to the difference in hydrophobic Figure 1: Two types of conformational transitions, which result in membrane thickness dependence. Shear transitions (left) undergoe without membrane area changes. A transition from a circle to an ellipse, for example, changes the circumference length from \(L_{0}\) to \(L_{0}+\Delta L\) without changing the area. Area transitions (right) undergo change in the membrane area, which result in thickness change, affecting hydrophobic mismatch. thickness of the two states. The second term is due to the difference \(\Delta L\) in the circumference in the two conformational states. For mammalian prestin, which includes membrane area changes during conformational transitions [1], changes in the hydrophobic thickness is expected by assuming volume conservation. In addition, changes in the circumference can be expected as schematically illustrated in Fig. 1. Eq. 3 also shows that membrane thickness dependence, however, can arise from the difference \(\Delta L\) in the circumference alone without changes in the surface area. If these membrane proteins are randomly oriented, membrane share should cancel each other and no collective motion is expected. This expectation is consistent with the observation that plasma membrane of HEK cells transfected with avian prestin did not show movement of cell membrane elicited by voltage pulses, unlike mammalian prestin [11]. That is because those avian prestin molecules expressed at low densities in the plasma membrane of those transfected cells are likely oriented randomly. The randomness of orientation of this protein does not lead to macroscopic movement. ## Macroscopic shear Mean membrane shear can be achieved by shearing mode of a membrane protein as illustrated in Fig. 2. The main advantage of this mode compared with area motor mode is that bending shear can be provided without geometrical asymmetry of the cell membrane. This advantage, however, requires alignment of the motile molecules. Figure 2: A schematic representation of creating membrane shear. Molecular shear produced by conformational transitions can lead to membrane shear if the motile molecules are aligned. Two of the possible alignments are shown. The red and blue outlines illustrate two conformational states as Fig. 1 does. ## Bending of hair bundle It has been found that avian prestin is also associated with motility [5]. Instead of the cell body as mammalian prestin does, avian prestin drives hair bundles of short hair cells and thereby moves the vectorial membrane associated with those hair bundles [5]. For the mechanism of this motion, localization of avian prestin is critically important. Histochemical study showed that prestin is located in the lateral plasma membrane [5]. The authors point out in the appendix that avian short hair cells prominently expand toward the apex on the neural side and the cuticular place, which is associated with the hair bundle does not cover the neural side of the apical membrane [5]. They propose that the neural side of the lateral membrane contracts on depolarization, tilting the hair bundle in the neural direction [5]. ## Discussion The mechanism proposed by Beurg et al. [5] are based on the assumption that avian prestin undergoes membrane area changes, or "area transitions," similar to mammalian prestin. This proposal is of interest even though the assumption contradicts experimental observations [11]. While the structural asymmetry can be confirmed by prestin-antibody staining, the asymmetry is not so large. It is unclear if relatively small asymmetry of the cell morphology as revealed by these images is sufficient to produce bending of the cell if the mode of the molecular displacement is area changes. Another issue is that the lateral membrane is in contact with the lateral membrane of another cell, unlike mammalian outer hair cells. A necessary condition is that the neighboring cell is compliant in the direction of the movement. This requirement would apply to the submembranous cytoskeletal structure of those cells. The neural side of the apical membrane appears to be the localization, which is logical for driving the hair bundle. However, antibody-staining does not show the presence of prestin. An analogous argument can be made with a molecular motor, which produces shear instead of membrane area changes. Located in the lateral membrane, molecular "shear generator" could bend the hair bundle independent of the morphological asymmetry. However, generation of regional shear of the plasma membrane by molecular shear generators requires molecular alignment of the shear generators. Such alignment could be based on, e.g. cortical protein organization, and is plausible in view of the polarized organization of hair cells. Those observations described here are of theoretical nature. To clarify the mechanism of hair bundle bending of avian short hair cells, further studies in both molecular and cellular levels are essential. Those studies concern details of localization and orientation of avian prestin on the cellular level. In addition, experimental determination of the upper bound of membrane area changes and studies of molecular structure of avian prestin would be critical.

2302.11590

Q-balls in the sky

There may exist extended configurations in the dark matter sector that are analogues of structures in the visible sector. In this work, we explore non-topological solitonic configurations, specifically Q-balls, and study when they may form macroscopic astrophysical structures and what their distinct characteristics might be. We study in some detail theoretical bounds on their sizes and constraints on the underlying parameters, based on criteria for an astrophysical Q-ball's existence, gravitational stability and viability of solutions. Following this path, one is able to obtain novel limits on astrophysical Q-ball sizes and their underlying parameters. We also explore the gravitational lensing features of different astrophysical Q-ball profiles, which are more general than the simple thin-wall limit. It is seen that the magnification characteristics may be very distinct, depending on the actual details of the solution, even for astrophysical Q-balls having the same size and mass. Assuming that such astrophysical Q-balls may form a small component of the dark matter in the universe, we place limits on this fraction from the gravitational microlensing surveys EROS-2, OGLE-IV, HSC-Subaru and the proposed future survey WFIRST. Exploring various astrophysical Q-ball profiles and sizes, it is found that while for most intermediate masses that we consider, the dark matter fraction comprising astrophysical Q-balls is at most sub-percent, for other masses it may be significantly higher.

Arhum Ansari, Lalit Singh Bhandari, Arun M. Thalapillil

2023-02-22T19:00:07Z

http://arxiv.org/abs/2302.11590v3

# Q-balls in the sky ###### Abstract There may exist extended configurations in the dark matter sector that are analogues of structures in the visible sector. In this work, we explore non-topological solitonic configurations, specifically Q-balls, and study when they may form macroscopic astrophysical structures and what their distinct characteristics might be. We study in some detail theoretical bounds on their sizes and constraints on the underlying parameters, based on criteria for an astrophysical Q-ball's existence, gravitational stability and viability of solutions. Following this path, one is able to obtain novel limits on astrophysical Q-ball sizes and their underlying parameters. We also explore the gravitational lensing features of different astrophysical Q-ball profiles, which are more general than the simple thin-wall limit. It is seen that the magnification characteristics may be very distinct, depending on the actual details of the solution, even for astrophysical Q-balls having the same size and mass. Assuming that such astrophysical Q-balls may form a small component of the dark matter in the universe, we place limits on this fraction from the gravitational microlensing surveys EROS-2, OGLE-IV and the proposed future survey WFIRST. Exploring various astrophysical Q-ball profiles and sizes, it is found that while for smaller masses, the dark matter fraction comprising astrophysical Q-balls is at most sub-percent, for larger masses, it may be significantly higher. ## 1 Introduction The true nature of dark matter is among the foremost questions in physics today (See [1; 2] and references therein, for instance). The present evidence suggests that this sector interacts only feebly with visible matter. Given the presence of such an extraordinary dark sector, one is led to speculate if this domain furnishes, apart from some plethora of dark elementary particles, bound states similar to those in the visible sector. This may, for instance, include field-theoretic, extended, solitonic objects as well as gravitationally bound astrophysical objects that are similar to stars. Analogues in the visible sector which are electromagnetically inert, for instance, massive astrophysical compact halo objects (MACHOs) and dark clouds (see, for instance, [3; 4] and related references), have long been investigated [5] with the speculation that they may form at least some fraction of the missing matter in the universe. The constituents of the dark sector could also possibly form a rich set of structures. Potential dark matter structures that have been speculated range from galactic or sub-galactic scales all the way to almost particle-like bound states (See, for example, [6; 7; 8; 9; 10; 11; 12; 13; 14; 15; 16; 17; 18] ). Particularly intriguing in recent years have been bosonic field configurations, either forming expansive diffuse structures or exotic astrophysical compact objects, that mimic ordinary neutron stars or white dwarfs (for instance, see [19; 20; 21; 22; 23; 24; 25] and related references). There have been seminal works on various astrophysical aspects of extended dark matter structures and star-like objects--for instance, looking at their gravitational lensing characteristics [26; 27; 28; 29], signatures from baryonic accretion [17; 27], gravitational wave signatures [30; 31] and so on (For a more comprehensive survey and summary of the existing literature, in these contexts, we kindly refer the interested reader to some of the excellent current reviews and white papers [24; 25; 32; 33; 34]). In this work we focus on non-topological solitions [35; 36] that could form astrophysical structures. Specifically, we would like to study Q-balls [37] in an astrophysical context. These are bound configurations of bosonic fields, owing their existence to a conserved global charge \((Q)\)[37], hence the 'Q' in their nomenclature. Their existence and stability are predicated on unique characteristics in the theory and for large charges, their energy and volume scale linearly with it. It is the latter scaling that makes such objects behave almost like homogeneous lumps of exotic matter- Q-matter--with 'Q' playing the role of a putative particle number. Such objects have been studied in various contexts since their conception--decay of such objects when couplings to other fields are introduced [38], their small charge limits [39], as dark matter candidates [40; 41], in the context of supersymmetry and baryogenesis [42], cosmological phase transitions [43], spinning Q-balls [44], charge-swapping Q-balls [45; 46; 47], gravitational waves during Q-ball formation from condensate fragmentation [48] and so forth. Interest in such objects has persisted, and they have also been subjects of many dedicated recent studies, for instance, in the context of generating lepton asymmetry and enhanced gravitational waves during Q-ball decay [49], Q-ball superradiance [50], stress stability criteria in gauged Q-balls [51], fermion scattering solutions for one-dimensional Q-balls [52], topological and non-topological charged Q-monopole-balls [53], and many others. There exist in the literature few analytical solutions and approximations for particular potentials [54; 55; 56; 57; 58; 59; 60; 61], that accommodate Q-ball solutions, but the analytic tractability of general scenarios has largely been challenging. Recently, there has been some progress [62; 63; 64] in obtaining better analytic approximations to Q-ball profiles and associated quantities. We hope to leverage this recent progress [62; 63; 64] in the analytic approximations for Q-ball profiles by adapting it to study aspects of Q-balls when they may form astrophysically viable objects. Particularly, in this context, we explore a broader set of solutions than the strict thin-wall limit [37]. We theoretically study when the flat spacetime Q-ball solutions may also be considered as good approximations in the astrophysical context. We broach this question by considering Jean's instability arguments and probing the non-gravitational limit of such macroscopic Q-balls. Similarly, for astrophysically viable Q-balls, from a careful study of the mass density profiles and gravitational lensing features, we point out distinct characteristics of various solutions. Through microlensing survey constraints, we also bound the fraction of total dark matter that may be in the form of astrophysical Q-balls. For this latter part, we will partly modify and adapt few of the methodologies in [26; 27]. The actual cosmological origins and formation of astrophysical Q-balls is an intruiging topic of study (see, for instance, [40; 65; 66; 67] and related references). For the aspects we focus on in this study, we will nevertheless be largely agnostic to any specific formation mechanism. In Sec. 2, we briefly review the theoretical framework for Q-balls, fixing conventions and notations along the way. Then, in Sec. 3, we summarise aspects of gravitational lensing, specifically microlensing, that we will subsequently utilise to study astrophysical Q-balls. Sec. 4 contains the main results of the study. Here, we present our theoretical discussions pertaining to the astrophysical viability of Q-ball solutions and their unique gravitational lensing characteristics, as well as microlensing constraints. We summarise and conclude in Sec. 5. ## 2 Non-topological solitons with a conserved charge Q-balls [37] are non-topological solitons that may occur in theories with a conserved global charge. They arise as stable, localised configurations in generic scalar field theories whose potential satisfies specific conditions. For the purposes of our present discussion, consider a theory with a conserved \(U(1)\) charge, described by a Lagrangian density given by \[\mathcal{L}=\partial_{\mu}\Phi\partial^{\mu}\Phi^{\dagger}-U(\Phi^{\dagger} \Phi)\;. \tag{1}\] The stable vacuum is assumed to be at \(|\Phi|=0\), and without loss of generality, the potential is assumed to be vanishing in the vacuum. Q-ball solutions will exist for all potentials \(U(\Phi^{\dagger}\Phi)\) when \(U(\Phi^{\dagger}\Phi)/\Phi^{\dagger}\Phi\) has a minimum, without loss of generality, at a real, positive field value \(\Phi_{\rm Q}\) satisfying \[0\leqslant\frac{U(\Phi_{\rm Q})}{\Phi_{\rm Q}^{2}}\equiv\omega_{\rm Q}^{2}<m^{2}\;. \tag{2}\] Here, the mass of the fundamental scalar quanta \(\Phi\) is defined as \(m^{2}\equiv\frac{d^{2}U(\Phi^{\dagger}\Phi)}{d\Phi^{\dagger}d\Phi}\big{|}_{ \Phi=0}\). The theory defined by Eq. (1) is invariant under a global \(U(1)\) symmetry with the associated conserved charge for Q-balls in the local \(\Phi_{\rm Q}\) minimum given by \[Q\equiv i\int d^{3}x(\Phi\dot{\Phi}^{\dagger}-\Phi^{\dagger}\dot{\Phi})\;. \tag{3}\] The condition for the existence of Q-balls given in Eq. (2) is equivalent, for large \(Q\)-charges, to a requirement that the Q-ball configuration is more energetically favourable than a collection of scalar particles with the same total charge. The Hamiltonian for the theory is \[H=\int d^{3}x\left(|\dot{\Phi}|^{2}+|\nabla\Phi|^{2}+U(|\Phi|)\right)\;, \tag{4}\] and to study the existence and possibility of objects with a fixed charge \(Q\), we may analyse the functional [39] \[\mathcal{F}=H+\omega\left(Q-i\int d^{3}x(\Phi\dot{\Phi}^{\dagger}-\Phi^{ \dagger}\dot{\Phi})\right)\;. \tag{5}\] Here, \(\omega\) is a Lagrange multiplier. Minimising the functional in Eq. (5), it may be shown that the minimum energy configuration, subject to a fixed Q-charge, will have a time dependence that goes like \[\Phi(r,t)=\phi(r)e^{i\omega t}\;. \tag{6}\] The above time dependence gives a stationary solution that helps evade Derrick's theorem [68]. With this time dependence, the equation of motion now becomes \[\phi^{\prime\prime}+\frac{2}{r}\phi^{\prime}=-\frac{1}{2}\frac{\partial}{ \partial\phi}\left[\omega^{2}\phi^{2}-U(\phi)\right]\;, \tag{7}\] and the total charge, energy and equation of motion may be written as \[Q=8\pi\omega\int drr^{2}\phi(r)^{2}\;, \tag{8}\] \[E = 4\pi\int drr^{2}\left[\phi^{\prime 2}+\phi^{2}\omega^{2}+U( \phi)\right]\;, \tag{9}\] \[= \omega Q+\frac{8\pi}{3}\int drr^{2}\phi^{\prime 2}\;.\] At this juncture, we would like to re-emphasize that, in this study, by Q-ball solutions, we mean the solution one obtains strictly from Eq. (7). This distinction is being made to distinguish Q-balls from Q-stars, where the effects of gravity may have to be taken into account by solving a Gross-Pitaevskii-Poisson equation. We will also comment on some of these aspects later in Sec. 4.1. From above, we identify the corresponding charge and energy density profiles for a given field profile to be \[\rho_{\rm Q}^{\rm C}(r)=2\omega\phi(r)^{2}\;, \tag{10}\] \[\rho_{\rm Q}^{\rm M}(r)=2\omega^{2}\phi(r)^{2}+\frac{2}{3}\phi(r)^{\prime 2}\;. \tag{11}\] Also, differentiating Eq. (9) it is seen that [57] \[\frac{{\rm d}E}{{\rm d}\omega}=\omega\frac{{\rm d}Q}{{\rm d}\omega}\;. \tag{12}\] This is an exact relation that shows that \(\omega\) may be interpreted as a chemical potential. When \(dE/dQ>0\), the Q-ball configuration is expected to be unstable or metastable, with it being energetically favourable for the Q-ball to shed fundamental \(\Phi\) quanta. To make the study more concrete, let us specifically look at the simplest potential that allows for Q-ball solutions. Stable quartic potentials do not yield Q-ball configurations. Confining to simple field representations, the simplest potential that contains Q-ball-like solutions is the non-renormalizable sextic potential \[U(\phi)=m^{2}\phi^{2}+\lambda\phi^{4}+\zeta\phi^{6}\;. \tag{13}\] Apart from being the simplest potential where Q-ball configurations may be studied, thereby acting as a good proxy for investigating salient features, it is also a potential where so far no exact solutions have been found. Therefore, unlike few other special potentials where exact Q-ball solutions have been found [54, 55, 56, 57, 58, 59, 60, 61], in this case, improved analytic solutions and studies may be even more pertinent [62]. The second term with \(\lambda<0\) provides the attractive interaction, whereas the third term is repulsive in nature and can balance the attractive interaction, which hints towards forming stable bound states like Q-balls. When \(\lambda<0\), Q-ball solutions may be found, with the model having its global minima at \(\phi=0\) and a local minimum for \(U(\Phi^{\dagger}\Phi)/\Phi^{\dagger}\Phi\) at \[\phi=\phi_{\rm Q}\equiv\sqrt{\frac{|\lambda|}{2\zeta}}\;. \tag{14}\] In the latter minima, the ground state quanta may be Q-ball configurations, subject to the fulfilment of the required conditions. From Eq. (2) we have for this potential [62] \[\omega_{\rm Q}=m\sqrt{1-\frac{\lambda^{2}}{4m^{2}\zeta}}\;. \tag{15}\] It is clear from above that \(\omega_{\rm Q}<m\) is satisfied, and the existence of Q-balls is possible for \[0<\lambda^{2}\leqslant 4m^{2}\zeta\;. \tag{16}\] Note that these restrictions on the Lagrangian parameters, among other features, make diffuse Q-ball structures potentially more distinct than generic bosonic field configurations like bose stars. Analysing the form of the effective potential \(\left(\omega^{2}\phi^{2}-U(\phi)\right)\) appearing in the equation of motion Eq. (7), as a function of \(\omega\), one finds that suitable Q-ball solutions only occur for \(\omega>\omega_{\rm Q}\) and \(\omega<m\). This, in combination with the necessary condition Eq. (2), then implies that we must have \[\omega_{\rm Q}<\omega<m\;, \tag{17}\] for viable Q-ball solutions. In the lower limit of the viable \(\omega\) region, \(\omega\to\omega_{\rm Q}\), one recovers the original Q-ball solution of Coleman [37]. In the limit \(\omega\to\omega_{\rm Q}\), the actual field profile obtained by solving Eq. (7) is very well approximated by [37] \[\phi^{\rm TW}(r)=\begin{cases}\phi_{\rm Q}&r\leqslant R_{\rm Q}\;,\\ 0&r>R_{\rm Q}\;,\end{cases} \tag{18}\] where \(R_{\rm Q}\) is defined implicitly in terms of the actual field profile through \[R_{\rm Q}=\left(\frac{3\omega}{4\pi\omega_{\rm Q}\phi_{\rm Q}^{2}}\int_{0}^{ \infty}d^{3}r\phi(r)^{2}\right)^{\frac{1}{3}}\;. \tag{19}\] We will refer to these solutions as thin-wall (TW) Q-balls. Recently, better theoretical approximations for Q-ball solutions have been found, enabling one to explore more of the \(\omega\)-parameter space regions, encompassing \(\omega_{\rm Q}<\omega<m\). In particular, this allows studies beyond the simplest step-function profiles of the exact thin-wall limit Q-balls. Following methodologies developed in [62], better analytic profiles may be obtained for the interior, exterior and transition regions of the Q-ball. Remarkably, for large Q-balls, the full analytic profile may be approximated by a single function [62] of the form \[\phi(r)=\frac{\phi_{*}}{\sqrt{1+2\exp\left[2\sqrt{m^{2}-\omega_{\rm Q}^{2}} \left(r-R_{\rm Q}\right)\right]}}\;, \tag{20}\] where \[\phi_{*}^{2}=\frac{\phi_{\rm Q}^{2}}{3}\left[2+\sqrt{1+3\left(\frac{\omega^{2 }-\omega_{\rm Q}^{2}}{m^{2}-\omega_{\rm Q}^{2}}\right)}\;\right]\;. \tag{21}\] The radius \(R_{\rm Q}\) in the expression above is defined implicitly through \[\frac{d^{2}\phi(r)}{dr^{2}}\Big{|}_{r=R_{\rm Q}}=0\;, \tag{22}\] using the full field profile approximation. When \(\omega\) is very near the \(\omega_{\rm Q}\) lower limit, the above definition starts coinciding with the thin-wall definition Eq. (19) and the field profile also starts coinciding with that given in Eq. (18). To leading order, Eq. (22) gives large Q-ball radii to be [62] \[R_{\rm Q}=\frac{\sqrt{m^{2}-\omega_{\rm Q}^{2}}}{\omega^{2}-\omega_{\rm Q}^{2 }}\;. \tag{23}\] To distinguish the improved, more general field profile, given in Eq. (20), from a limit of it given by Eq. (18) (i.e. the TW solution limit), we will refer to the former as beyond-thin-wall (BTW) Q-balls. For large Q-balls, the approximate BTW Q-ball profile given by Eq. (20) is in agreement with the relation given by Eq. (12) [62]. \(dE/dQ<0\) and \(E<m\,Q\) ensure the field-theoretic stability of Q-balls, against decay into free scalar quanta. These will restrict the viable Lagrangian parameters in turn. We will, therefore, also impose these field-theoretic stability constraints along with the gravitational stability criteria later in Sec. 4.1, while investigating astrophysically viable Q-balls. If we expand the domain of symmetry, one may make the \(U(1)\) invariance of the Lagrangian, given in Eq.(1), local. This gives rise to gauged Q-balls [69], which imposes some restrictions on the charge and radius of the Q-balls. However, it has been shown that gauged Q-ball profile can still be described by the expression given in Eq.(20) with the following identification of the Lagrange multiplier [63] \[\omega_{\text{\tiny G}}=\omega g\phi_{\text{\tiny Q}}R_{\text{\tiny Q}}\coth(e \phi_{\text{\tiny Q}}R_{\text{\tiny Q}})\;. \tag{24}\] In the above expression, \(\omega_{\text{\tiny G}}\) and \(\omega\) are the Lagrange multipliers for gauged and global Q-balls, respectively, and \(g\) is the coupling constant between the scalar field and the gauge field. Owing to this mapping, some of the analyses for global Q-balls may be translated for gauged Q-balls. We leave a detailed analyses for future work. One may also look at more generalised potentials given that the particular polynomial potential given in Eq.(13), the simplest one which accommodates Q-balls, may be considered as an effective potential coming from some fundamental renormalisable theory. Most renormalisable theories in the low energy limit give rise to polynomial potential with arbitrary exponents whose first few terms can be of the form, \[U(\phi)=m^{2}\phi^{2}+\lambda\phi^{p}+\zeta\phi^{q}\;, \tag{25}\] with arbitrary powers \(p\) and \(q\). General polynomial potentials of the above form were studied in detail recently [64]. It is seen that global properties like total charge and total energy have only a mild dependence on the polynomial powers \(p\) and \(q\)[64]. From such indications, it may be speculated that the sextic potential in (13) may capture some of the more salient features of generic Q-ball configurations while being analytically more tractable. In the next section, we briefly review the theoretical framework for gravitational lensing while defining and clarifying relevant ideas and notations that will be useful to us in our study. ## 3 Gravitational microlensing by extended structures If there is an extended mass distribution in the path of light emanating from astrophysical or cosmological sources, they may be deflected or distorted. This broad effect is termed gravitational lensing [70]. Consider Fig.1 illustrating a typical gravitational lensing system. In the diagram, the light source (S), observer (O) and image position (I) are shown along with the respective source angular position (\(\theta_{S}\)), image angular positions (\(\theta_{I}\)) and deflection angle (\(\hat{\theta}_{D}\)). \(d_{\text{\tiny S}}\) denotes the angular diameter distance of the source from the observer, \(d_{\text{\tiny L}}\) the angular diameter distance of the lensing mass from the observer and \(d_{\text{\tiny LS}}\) is the angular diameter distance from the source to the lensing mass. \(\chi\) denotes the transverse distance to the null ray, and z-distances are measured perpendicular to the lens plane. In almost all cases of interest, and in particular, in the case of interest to us, the deflection angles involved are small, and the lens may be approximated to be a planar mass distribution by projecting the mass of the lens on a sheet orthogonal to the line of sight. For point-like objects, meaning their intrinsic size is negligible compared to the other characteristic length scales in the system, the deflection angle of light rays sufficiently far from an object is directly related to the transverse gradient of the configuration's Newtonian gravitational potential (\(\varphi^{\text{\tiny G}}\)). More precisely, for a total configuration mass \(M\), the point lens approximation is valid when the size of the lens is much smaller than the corresponding Einstein radius of the system defined by [70] \[R_{\rm E}=\left(\frac{4G_{\rm N}M}{c^{2}}\frac{d_{\rm L}d_{\rm LS}}{d_{\rm S}} \right)^{\frac{1}{2}}\;. \tag{1}\] Here \(G_{\rm N}\) is the Newton's gravitational constant. This is, for instance, relevant in many gravitational lensing studies involving compact astrophysical objects like black holes or neutron stars. More pertinently, for our purposes, this is also applicable to small Q-balls. For a total lens mass \(M\), the deflection angle would for instance be given by [71] \[\hat{\theta}_{\rm D}=\frac{2}{c^{2}}\int\nabla_{\chi}\varphi^{\rm C}\ dz=\frac{4G_{\rm N}M}{c^{2}|\vec{\chi}|} \hat{\chi}\;. \tag{2}\] For extended mass distributions, like the Q-ball configurations we are interested in, one essentially adds up the contributions due to the individual mass elements. If \(\chi\) denotes the transverse distance (with respect to some origin) of a light ray passing through an extended mass distribution and \(\chi^{\prime}\) denotes the position of an individual mass element of the distribution, then the deflection angle \(\hat{\theta}_{\rm D}(\chi)\) is given by \[\hat{\theta}_{\rm D}(\chi)=\frac{4G_{\rm N}}{c^{2}}\int\frac{(\vec{\chi}-\vec{ \chi}^{\prime})dM^{\prime}}{|\vec{\chi}-\vec{\chi}^{\prime}|^{2}}=\frac{4G_{ \rm N}}{c^{2}}\int d^{2}\chi^{\prime}\frac{(\vec{\chi}-\vec{\chi}^{\prime}) \sigma(\chi^{\prime})}{|\vec{\chi}-\vec{\chi}^{\prime}|^{2}}\;. \tag{3}\] Here, for a density distribution \(\rho(\chi,z)\), we have defined the planar density distribution \(\sigma(\chi)=\int_{-\infty}^{\infty}\rho(\chi,z)dz\). A special case arises for spherically symmetric lenses. In that case, we can Figure 1: A diagrammatic representation of a lens, observer and source lensing system showing the various relevant quantities involved. The directed solid line illustrates the path of a null ray. The lens plane is shown at the centre, along with a spherical lens. shift the origin to the centre, and Eq.(17) becomes [71] \[\hat{\theta}_{\rm D}(\chi) = \frac{4G_{\rm N}}{c^{2}|\vec{\chi}|}\int_{0}^{\chi}d^{2}\chi^{ \prime}\sigma(\chi^{\prime})\;, \tag{18}\] \[= \frac{4G_{\rm N}\widetilde{M}(\chi)}{c^{2}\chi}\;,\] where \[\widetilde{M}(\chi)=\int_{0}^{\chi}d^{2}\chi^{\prime}\sigma(\chi^{\prime})=2 \pi\int_{0}^{\chi}d\chi^{\prime}\chi^{\prime}\sigma(\chi^{\prime})\;. \tag{19}\] The angular source position and angular image positions are related via the lens equation \[\theta_{\rm S}=\theta_{\rm I}-\theta_{\rm D}(\theta_{\rm I})\;, \tag{20}\] where \[\theta_{\rm D}=\frac{d_{\rm LS}}{d_{\rm S}}\hat{\theta}_{\rm D}\;. \tag{21}\] Using Eq. (18) with the identification \(\chi=d_{\rm L}\theta_{\rm I}\), the lens equation may be written as \[\theta_{\rm S}=\theta_{\rm I}-\frac{d_{\rm LS}}{d_{\rm S}d_{\rm L}}\frac{4G_ {\rm N}\widetilde{M}(\theta_{\rm I})}{c^{2}\theta_{\rm I}}\;. \tag{22}\] For a general extended mass distribution, given a source position \(\theta_{\rm S}\), we solve the above lens equation to find the image positions \(\theta_{\rm I}\). When \(\theta_{\rm S}=0\)--meaning the source, lens and observer are aligned along the line of sight--the angular image position, for a point lens of total mass \(M\), is defined to be at the point-like Einstein angle (\(\theta_{\rm E}\)). This is related to Eq. (16) through \[\theta_{\rm E}=\frac{R_{\rm E}}{d_{\rm L}}\;. \tag{23}\] We will use \(R_{\rm E}\) and \(\theta_{\rm E}\), when required, to normalise the Q-ball radius and relevant lensing angles. By Liouville's theorem, the surface brightness of the source is conserved under gravitational lensing. Under gravitational microlensing, as a Q-ball configuration gradually moves across a light source, say a background galaxy, there will be a waxing and waning of its measured brightness due to the magnification. In this context, for the aforementioned reasons, the magnification of the source would just be given by the ratio of the image area to the source area. For each \(\theta_{\rm I}\) solution of Eq. (22), this magnification (\(\mathfrak{m}_{\rm I}\)) may be expressed as \[\mathfrak{m}_{\rm I}=\frac{\theta_{\rm I}}{\theta_{\rm S}}\frac{{\rm d}\theta _{\rm I}}{{\rm d}\theta_{\rm S}}\;. \tag{24}\] The total magnification (\(\mathfrak{m}\)) obtained in the detector is then just the sum of magnification produced by all the images; obtained as solutions to Eq. (22) \[\mathfrak{m}=\sum_{\rm I}|\mathfrak{m}_{\rm I}|\;. \tag{25}\] Let us now proceed to discuss the main results of the study in the context of Q-ball configurations that may exist in the universe. Astrophysical Q-ball structures In this section, we discuss some of the theoretical considerations for Q-balls, when they may form extended astrophysical structures, followed by discussions of their gravitational lensing characteristics and constraints on astrophysical Q-balls from microlensing surveys. ### Theoretical bounds from existence, stability and viability As we mentioned earlier, by Q-balls, we strictly mean here the pure field theoretical non-topological soliton solutions, ignoring any role of gravity. Obviously, the latter regime puts constraints on how dense these astrophysical Q-ball structures could be and are constrained by relevant Jean's instability criteria. We will be considering diffuse Q-balls in the low compactness regime. When a Q-ball of total mass \(M_{\textsc{Q}}\) is confined within a characteristic radius \(R_{\textsc{Q}}\) and is slightly compressed, there is a propensity for gravity to compress the system, thereby attempting to decrease the gravitational potential energy, while in contrast, the Q-matter inside would try to resist this compression by virtue of outward internal pressure. Assuming a homogeneous medium with almost constant density, which is a good approximation for large Q-ball solutions, we may now formulate the relevant Jean's instability criteria. The characteristic speed of the outward pressure waves is the sound speed in the homogeneous medium (\(v_{\textsc{Q}}^{\mathrm{s}}\)). The relevant time scales are, therefore, the sound crossing time in Q-matter and the corresponding gravitational free-fall time, which is given by \[t_{\textsc{Q}}^{\mathrm{g}}\simeq\frac{1}{\sqrt{G_{\textsc{N}}\,\rho_{\textsc{ Q}}^{\mathrm{M}}}}\;. \tag{10}\] Here, \(G_{\textsc{N}}\) is Newton's gravitational constant and \(\rho_{\textsc{Q}}^{\mathrm{M}}\), as before, is the mass density of the Q-ball. Within this characteristic free-fall time \(t_{\textsc{Q}}^{\mathrm{g}}\) the pressure waves would travel a characteristic length \[d_{\textsc{Q}}^{\mathrm{J}}=v_{\textsc{Q}}^{\mathrm{s}}\,t_{\textsc{Q}}^{ \mathrm{g}}\simeq\frac{v_{\textsc{Q}}^{\mathrm{s}}}{\sqrt{G_{\textsc{N}}\, \rho_{\textsc{Q}}^{\mathrm{M}}}}\;. \tag{11}\] This characteristic length scale \(d_{\textsc{Q}}^{\mathrm{J}}\) is the Jean's length for the Q-ball configuration. The basic idea is that if Q-matter is extended beyond \(d_{\textsc{Q}}^{\mathrm{J}}\) then the pressure waves resisting gravity will not have enough time to travel the length scale and counter the external compressive disturbance due to gravity. In terms of the Lagrangian parameters, assuming to a good approximation almost homogeneous internal densities, we have \[v_{\textsc{Q}}^{\mathrm{s}\,2}\equiv\frac{dP_{\textsc{Q}}}{d\rho_{\textsc{Q} }^{\mathrm{M}}}=\frac{\lambda^{2}}{4m^{2}\zeta}\;. \tag{12}\] We note that as a direct consequence of the existence condition for Q-balls given in Eq. (16), one automatically satisfies the causality criterion \(v_{\textsc{Q}}^{\mathrm{s}}\leqslant 1\) in the Q-matter. From Eq.(23), we have for the radius of a Q-ball \[R_{\textsc{Q}}=\frac{\sqrt{\lambda^{2}/4\zeta}}{(\omega^{2}-\omega_{\textsc{ Q}}^{2})}\;. \tag{13}\] Since \(\omega\) has an upper bound, as prescribed by Eq.(17), from Eqs. (15) and (13) one obtains a minimum radius for the Q-ball solution \[R_{\textsc{Q,\,min}}^{\omega<m}\equiv\sqrt{\frac{4\zeta}{\lambda^{2}}}\;. \tag{14}\] The existence of such a minimum radius was also recently pointed out to be valid even in general polynomial potentials [64]. This agrees with a recently proposed conjecture [72] that all bound states in a theory must be greater than the Compton wavelength \(\lambda_{\phi}^{\rm C}\equiv 1/m\). In the case of Q-balls we note particularly that \(R_{\rm Q,\,min}^{\omega<m}/\lambda_{\phi}^{\rm C}=\sqrt{4\zeta m^{2}/\lambda^{ 2}}\geqslant 1\) by virtue of the Q-ball existence condition Eq. (16). From Eqs. (11), (12), and (13), we may also calculate the corresponding Jean's length explicitly. This gives \[d_{\rm Q}^{\rm J}=\sqrt{\frac{|\lambda|}{4m^{4}G_{\rm N}\left(1-\frac{\lambda^ {2}}{4m^{2}\zeta}\right)}}\equiv R_{\rm Q,\,max}^{\rm J}\,. \tag{14}\] For the pure non-topological soliton-like Q-ball solution to be valid, the radius of the corresponding stable Q-ball must be less than this Jeans length. The above equation, therefore, furnishes an upper bound on the radius of astrophysically viable Q-balls. Otherwise, the initial Q-ball will be unstable to gravitational collapse and potentially reconfigure into a different field configuration, whose features may now depend on the effects of gravity as well. The criterion \[R_{\rm Q}\ <\ d_{\rm Q}^{\rm J}\equiv R_{\rm Q,\,max}^{\rm J}\;, \tag{15}\] for stability with respect to gravitational collapse and continued validity of the pure Q-ball solution, then gives a condition on the Lagrange multiplier \(\omega\) as \[\omega>\omega_{\rm Q}\left[1+\left\{\frac{|\lambda|G_{\rm N}/\zeta}{1-\frac{ \lambda^{2}}{4m^{2}\zeta}}\right\}^{1/2}\right]^{1/2}\equiv\omega_{\rm min}^{ \rm J}\;. \tag{16}\] At \(\omega=\omega_{\rm min}^{\rm J}\) the Q-ball will become unstable to collapse. Therefore, we note that there exists both a minimum and maximum limit on the radius of astrophysical Q-balls. Of course, for physically viable astrophysical Q-ball solutions to actually exist, we must then obviously require \[R_{\rm Q,\,min}^{\,\omega<m}<R_{\rm Q,\,max}^{\rm J}\;. \tag{17}\] As emphasised by the superscripts, the lower and upper bound respectively come from the restriction on the Lagrangian parameter \(\omega\), for the existence of Q-ball solutions, and Jean's stability criteria, signifying stability to gravitational collapse and continued validity of the flat-spacetime Q-ball solutions. From Eqs. (16), (17) and (14) this gives the constraint \[\left\{\left(1-\frac{\lambda^{2}}{4m^{2}\zeta}\right)\frac{G_{\rm N}|\lambda| }{\zeta}\right\}^{1/2}<\frac{\lambda^{2}}{4m^{2}\zeta}\leqslant 1\;. \tag{18}\] Note that here the first part of the inequality comes from Jeans instability criteria, and the second part of the inequality results from the existence condition for Q-balls. A measure of the extent to which gravity influences the global properties of an astrophysical object is quantified by the compactness parameter, which is defined as \(\mathcal{C}\equiv\frac{G_{\rm N}M}{R_{\rm Q}}\). For large Q-balls, we can express this in terms of the Lagrangian parameters and Lagrange multiplier \(\omega\) as follows, \[\mathcal{C}_{\rm Q}=\frac{8\pi G_{\rm N}}{3}\left(\frac{|\lambda|}{2\zeta} \right)\left(m^{2}-\frac{\lambda^{2}}{4\zeta}\right)\frac{\lambda^{2}/4\zeta }{\left[\omega^{2}-\left(m^{2}-\frac{\lambda^{2}}{4\zeta}\right)\right]^{2}}\;. \tag{19}\] The maximum compactness of the profiles that we work with is \(\mathcal{O}(10^{-5})\). Hence we can safely say that gravity has very little role to play in determining the global properties of such Q-balls. Let us examine another perspective to think about the non-gravitational limit and the validity of the flat spacetime Q-ball solutions in an astrophysical context. Let us start from the case where any effects due to gravity are negligible and a scalar field potential with non-zero self-interactions (i.e. \(\lambda\neq 0\), \(\zeta\neq 0\)) gives us viable flat spacetime Q-ball configurations; as a solution to Eq. (7). Let us now consider how slowly incorporating any effects due to gravity may start changing the solutions. Towards this, let us change the flat spacetime metric in the scalar field equation of motion to include gravity. In the weak-field limit this may be done through the substitution \[\eta_{\mu\nu}\to g_{\mu\nu}(x)=(1+2\varphi^{\text{\tiny G}},-1,-1,-1)\;. \tag{12}\] \(\varphi^{\text{\tiny G}}\), as before, is the Newtonian gravitational potential. Let us express the scalar field \(\Phi\) as \[\Phi(r,t)=(2E/N)^{-1/2}\psi(r)e^{-iEt}\;. \tag{13}\] Here, \(N\) is the total number of particles in the configuration, \(E\approx m+2E_{B}\) is the energy of the ground state, and \(E_{B}\ll m\) is the binding energy. The equation of motion takes the form \[E_{B}\,\psi=-\frac{1}{2m}\nabla^{2}\psi+m\varphi^{\text{\tiny G}}\psi+\frac{N \lambda}{2m^{2}}\psi^{3}+\frac{3\zeta N^{2}}{8m^{3}}\psi^{5}\;. \tag{14}\] The second and third term on the right-hand side leads to attraction between bosons; due to gravity and attractive self-interactions (\(\lambda<0\)). The last term on the right-hand side leads to repulsive interactions among the bosons. After inspecting the attractive components in Eq. (14), we discover that the effect of gravitational interaction is weaker than that due to the attractive self-interaction among the fields when \[|m\varphi^{\text{\tiny G}}|<\frac{N|\lambda|}{2m^{2}}\psi^{2}\simeq\frac{M_{ \text{\tiny Q}}|\lambda|}{2\omega m^{2}}\psi^{2}\;. \tag{15}\] Here, as suggested by Eq. (9), \(M_{\text{\tiny Q}}\sim N\omega\) denotes the approximate mass of the Q-ball. Using \(\varphi^{\text{\tiny G}}\sim-\,G_{\text{\tiny N}}M_{\text{\tiny Q}}/R_{\text{ \tiny Q}}\) and \(\psi^{2}\sim 1/R_{\text{\tiny Q}}^{3}\), we may estimate the strength of gravitational and self-interaction terms. From Eqs. (15), (4) and (15), along with the scalings already identified, one finds that the quartic self-interaction among the fields is the dominant attractive interaction when \[\frac{G_{\text{\tiny N}}m^{3}\omega|\lambda|}{2\zeta\left(\omega^{2}-m^{2}+ \frac{|\lambda|^{2}}{4\zeta}\right)^{2}}<1\;. \tag{16}\] This implies that for the Lagrangian parameters satisfying the above condition, gravity does not play a dominant role when compared to the attractive self-interaction. An analogous but slightly different reasoning has been used to converge on the non-gravitational limit for generic Boson stars [21], starting now from an initial configuration which is non-self-interacting (\(\lambda=0\)), and where the scaling, in contrast, is now \(R\sim 1/(G_{\text{\tiny N}}Mm^{2})\). The above discussions mean that with these constraints the field-theoretic Q-ball solutions of Sec. 2 are still good approximations for the astrophysical structures under consideration. In our study, we ensure that the Jean's stability and subservient gravity conditions, given by Eqs. (4.7) and (4.16) respectively, are well satisfied. This legitimises the consideration of these astrophysical configurations as actual Q-balls [37] and, furthermore, the use of the theoretical expressions and profiles we work with. For brevity, we will henceforth refer to Q-balls satisfying the criteria of Secs. 2 and 4.1 as _astrophysical Q-balls_. These bosonic field configurations may be expected to be very similar in characteristics to ideal flat-spacetime Q-balls while satisfying all the requisite existence, stability and non-gravitational limit qualifications. For our studies, we will require these conditions to ensure the theoretical validity and physical viability of the astrophysical Q-ball structures. Let us now discuss the various gravitational lensing characteristics of astrophysical Q-ball structures and how they may change for the various types of profiles possible for such objects. ### Gravitational lensing by thin-wall and beyond-thin-wall Q-balls When an astrophysical Q-ball passes across the field of view of the observer and progressively occludes the source, the gravitational lensing by the Q-ball will cause a waxing and waning of the source brightness. If we have a moving Q-ball lens, then \(\theta_{\rm S}\) may vary with time. Assuming approximately rectilinear motion of the source for the duration of the lensing transit, the temporal dependence will be given by \[\theta_{\rm S}=\frac{\sqrt{d_{\rm L}^{2}\theta_{\rm S,min}^{2}+v^{2}t^{2}}}{d_ {\rm L}}. \tag{4.17}\] where \(\theta_{\rm S,min}\) is the minimum source angle attained during transit. The above relation is just a consequence of the Pythagorean theorem satisfied by the angular diameter distances in the lens plane. As the Q-ball travels across the foreground of the source, gravitational lensing will result in the formation of images, whose positions will be given as a function of time by \[\frac{\sqrt{d_{\rm L}^{2}\theta_{\rm S,min}^{2}+v^{2}t^{2}}}{d_{\rm L}}= \theta_{\rm I}-\frac{d_{\rm LS}}{d_{\rm S}d_{\rm L}}\frac{4G_{\rm N}\widetilde {M}_{\rm Q}(\theta_{\rm I})}{c^{2}\theta_{\rm I}}\, \tag{4.18}\] following Eq. (3.8). In the microlensing context, the images so formed at each instance of time will contribute to the overall magnification of the source. These, when put together for the transit duration, leads to the full microlensing light curve. This gravitational microlensing will depend on the density profile of the spherical Q-ball. Specifically, the maximum magnification and the brightness profile crucially depend on the number and contribution from the images formed and hence on the density profile through \(M(\chi)\). Let us explore these aspects now for thin-walled and beyond-thin-walled Q-ball solutions. From the improved large Q-ball interior, exterior and intermediate region field profiles [62], which are in a unified form well approximated by Eq. (2.20), the charge and mass density profiles may be computed. We find that they have the respective forms \[\rho_{\rm Q}^{\rm C}(r)=\frac{2\omega\phi_{*}^{2}}{1+2\exp\left[2\sqrt{m^{2}- \omega_{\rm Q}^{2}(r-R_{\rm Q})}\right]}\, \tag{4.19}\] \[\rho_{\rm Q}^{\rm M}(r)=2\phi_{*}^{2}\left[\frac{\omega^{2}}{1+2\exp\left[2\sqrt{m^ {2}-\omega_{\rm Q}^{2}}(r-R_{\rm Q})\right]}+\frac{4(m^{2}-\omega_{\rm Q}^{2})}{ 3}\left(\frac{\exp\left[4\sqrt{m^{2}-\omega_{\rm Q}^{2}}(r-R_{\rm Q})\right]}{ \left(1+2\exp\left[2\sqrt{m^{2}-\omega_{\rm Q}^{2}}(r-R_{\rm Q})\right]\right) ^{3}}\right)\right]. \tag{4.20}\] Here, \(\phi_{*}\) is as defined earlier in Eq. (2.21). Note that the quantity \(R_{\rm Q}\) in the above expressions is defined implicitly through Eq. (2.22). For our lensing studies, the mass density \(\rho_{\rm Q}^{\rm M}(r)\) will be of primary interest. The transition field profile in Eq. (2.20), the density profiles of Eqs. (4.19) and (4.20), along with the Q-ball radius defined through Eq. (2.23), all approximate the respective exact numerical profiles very well for large Q-balls [62]. In Fig. 2, we show a comparison of the charge and energy densities calculated using Eqs. (4.19) and (4.20) with the corresponding numerically computed exact density profiles. One notes that the approximation is relatively good across the radial range and even for distinct profiles differing in their radius. The mass profile for a large radius Q-ball may be calculated based on Eq. (4.20), and is given by \[M_{\rm Q}(r) = 4\pi\int_{0}^{r}drr^{2}\rho_{\rm Q}^{\rm M}(r) \tag{4.21}\] \[= 8\pi\phi_{+}^{2}\left[\frac{\omega^{2}}{4\vartheta^{3}}\left\{2 \vartheta r{\rm Li}_{2}\left(-\frac{1}{2}e^{2(R_{\rm Q}-r)\vartheta}\right)+{ \rm Li}_{3}\left(-\frac{1}{2}e^{2(R_{\rm Q}-r)\vartheta}\right)\right.\right.\] \[\left.\left.-{\rm Li}_{3}\left(-\frac{1}{2}e^{2R_{\rm Q}\vartheta }\right)+\vartheta^{2}r^{2}\left(\log(4)-2\log\left(e^{2\vartheta(R_{\rm Q}- r)}+2\right)\right)\right\}\right.\] \[\left.+\frac{1}{24\vartheta}\left\{-{\rm Li}_{2}\left(-2e^{2(r-R_ {\rm Q})\vartheta}\right)+{\rm Li}_{2}\left(-2e^{-2R_{\rm Q}\vartheta}\right) +\frac{4\vartheta r\left(2e^{4\vartheta r}(\vartheta r+1)+e^{2\vartheta(r+R_ {\rm Q})}\right)}{\left(2e^{2\vartheta r}+e^{2\vartheta R_{\rm Q}}\right)^{2}}\right.\right.\] \[\left.\left.-(2\vartheta r+1)\log\left(2e^{2\vartheta(r-R_{\rm Q })}+1\right)+\log\left(2e^{-2\vartheta R_{\rm Q}}+1\right)\right\}\right]\;,\] Figure 2: Plot showing the charge density and energy density profiles calculated using transition profile function (solid) and exact numerical profile (dashed). Here, \(\bar{\rho}_{\rm Q}^{\rm C}\equiv\rho_{\rm Q}^{\rm C}/2\omega_{\rm Q}\phi_{\rm Q }^{2}\), \(\bar{\rho}_{\rm Q}^{\rm M}\equiv\rho_{\rm Q}^{\rm M}/2\omega_{\rm Q}^{2}\phi_{ \rm Q}^{2}\) and \(\bar{r}\equiv r\sqrt{m^{2}-\omega_{\rm Q}^{2}}\). One sees that the agreement between the exact numerical solution and the transition profile approximation are relatively good across most regions, as well as for the two distinct profiles shown. The two profiles shown have been labelled by their \(\omega/m\) ratios. For both cases we have \(m/\omega_{\rm Q}\sim 10^{-5}\). where we have defined \(\vartheta\equiv\sqrt{m^{2}-\omega_{\rm Q}^{2}}=\sqrt{\lambda^{2}/4\zeta}\), for brevity of terms, and defined \[{\rm Li}_{n}(z)=\sum_{k=1}^{\infty}\frac{z^{k}}{k^{n}}. \tag{4.22}\] The total energy and charge for large Q-balls calculated using the above densities satisfy the theoretical consistency condition Eq. (2.12) to a good approximation. In the large radius limit, they also satisfy the corresponding expressions in the literature [62], to the given order. For the BTW Q-ball transition profiles and parameter values that we work with, additionally, all relevant boundary conditions and exact Q-ball relations [62] are well-satisfied with any conservative errors being at most \(\mathcal{O}(10\%)\). Let us note an elementary limit of Eqs. (4.19) and (4.20), the so called simple thin-wall limit mentioned earlier. When \(\omega\to\omega_{\rm Q}\), we have the thin-wall limit, and the field profiles are well-approximated by Eq. (2.18), with the charge and energy density profiles also taking a simple form given by \[\rho_{\rm Q}^{\rm C,TW}(r)\simeq 2\omega_{\rm Q}\phi_{\rm Q}^{2}\theta(R_{ \rm Q}-r)=2m\left(\frac{|\lambda|}{2\zeta}\right)\sqrt{1-\frac{\lambda^{2}}{4 m^{2}\zeta}}\ \Theta(R_{\rm Q}-r)\;, \tag{4.23}\] \[\rho_{\rm Q}^{\rm M,TW}(r)\simeq 2\omega_{\rm Q}^{2}\phi_{\rm Q}^{2}\theta(R_ {\rm Q}-r)=2m^{2}\left(\frac{|\lambda|}{2\zeta}\right)\left\{1-\frac{\lambda^{ 2}}{4m^{2}\zeta}\right\}\ \Theta(R_{\rm Q}-r)\;. \tag{4.24}\] Here, \(\Theta(x)\) is the Heaviside step function. In this strict limit of approximation, some of the gravitational lensing features will start to coincide with that of uniform density profiles [26, 27]. In order to solve the lens equation given in Eq.(3.8), for a given Q-ball solution, we need to know the corresponding mass-ratio function \(\widetilde{M}_{\rm Q}(\theta_{\rm I})/M_{\rm Q}\). This may be calculated starting from Eq.(3.5) as \[\frac{\widetilde{M}_{\rm Q}(\theta_{\rm I})}{M_{\rm Q}}=\frac{\int_{0}^{\theta _{\rm I}/\theta_{\rm E}}du\ u\int_{0}^{\infty}dv\ \rho_{\rm Q}^{\rm M}\left(\sqrt{u^{2}+v^{2}}\right)}{\int_{0}^{\infty}dw\ w^{2} \rho_{\rm Q}^{\rm M}\left(w\right)}\;. \tag{4.25}\] Here, we have normalised all the coordinates with respect to the Einstein radius \(R_{\rm E}=d_{\rm L}\theta_{\rm E}\), as defined in Eq. (3.1), in the following way- \(u\equiv\chi/R_{\rm E}\), \(v\equiv z/R_{\rm E}\) and \(w\equiv r/R_{\rm E}\). \(M_{\rm Q}\) is the total mass of the Q-ball lens. Thus, it is through this mass-ratio function that the precise details of the Q-ball density profile will appear in the lens equation, its solutions and the total magnification finally obtained. Let us start by analysing astrophysical Q-ball solutions very close to the \(\omega\to\omega_{\rm Q}\) limit, the so-called TW Q-balls. For the case of TW Q-ball solutions, evaluating Eq. (4.25) with Eq.(4.24), one obtains the mass-ratio function \[\frac{\widetilde{M}_{\rm Q}(\theta_{\rm I})}{M_{\rm Q}}=\begin{cases}1-\left( 1-\frac{(\theta_{\rm I}/\theta_{\rm E})^{2}}{(R_{\rm Q}/R_{\rm E})^{2}}\right) ^{3/2}&;\quad\left(\frac{\theta_{\rm I}}{\theta_{\rm E}}\right)R_{\rm E}<R_{ \rm Q}\\ 1&;\quad\left(\frac{\theta_{\rm I}}{\theta_{\rm E}}\right)R_{\rm E}\geqslant R_ {\rm Q}\;.\end{cases} \tag{4.26}\] We note from above, with suitable re-scalings, that the dependence on \(\omega_{\rm Q}\) and \(\phi_{\rm Q}\) in the lens equation Eq. (3.8) comes solely through \(R_{\rm Q}/R_{\rm E}\) and \(\theta_{\rm E}\) for thin-wall Q-balls. The lens equation Eq. (3.8) may now be solved with the mass function Eq. (4.26) to find the image positions. It is found that there are two broad regimes for the lens equation with respect to the obtained solutions, depending on the size of the Q-ball. As we see from Eq. (4.26), for \(\theta_{\rm I}/\theta_{\rm E}<R_{\rm Q}/R_{\rm E}\), the lens equation as given in Eq.(3.8) is a quintic polynomial in \(\theta_{\rm I}\). For the special case \(\theta_{\rm S}=0\), it can be factorised into a product of a quartic and linear polynomial. The linear polynomial gives the trivial solution at the origin (i.e. \(\theta_{\rm I}=0\)), irrespective of the value of \(R_{\rm Q}/R_{\rm E}\). The quartic equation has two real solutions for \(0<R_{\rm Q}/R_{\rm E}<\sqrt{3/2}\). For \(R_{\rm Q}/R_{\rm E}\leq 1\) there exits two solutions which are equally spaced from the origin--at \(\theta_{\rm I}=\pm\theta_{\rm E}\)--on the Einstein ring. For \(1<R_{\rm Q}/R_{\rm E}<\sqrt{3/2}\), we again have equally spaced solutions which lie at \(|\theta_{\rm I}|<\theta_{\rm E}\), i.e. inside the Einstein ring. Specifically, they are located at, \[\theta_{\rm I}=\pm\frac{\theta_{\rm E}R_{\rm Q}}{R_{\rm E}\sqrt{2}}\left(3-(R _{\rm Q}/R_{\rm E})^{4}-((R_{\rm Q}/R_{\rm E})^{2}-1)^{3/2}\sqrt{(R_{\rm Q}/R_ {\rm E})^{2}+3}\right)^{1/2}. \tag{4.27}\] For \(R_{\rm Q}/R_{\rm E}\geqslant\sqrt{3/2}\), all four solutions to the quartic equation becomes imaginary and we are left with only one solution at the origin. For non zero \(\theta_{\rm S}\), we can use Descarte's rule of signs (See, for instance, [73]) to get the number of positive and negative real roots. From Descarte's rule of signs, we deduce that there will be two negative real roots and one positive real root. Among them the two negative real roots disappear when either \(\theta_{\rm S}\gg 1\) or \(R_{\rm Q}/R_{\rm E}>\sqrt{3/2}\). Below we will try to get some analytical form of some of these solutions in particular limits. We will be largely restricted to numerical analysis, though, due to the Abel-Ruffini theorem (for instance, see [74]). For a thin-walled Q-ball with a radius satisfying \(R_{\rm Q}>\sqrt{3/2}R_{\rm E}\), Eq. (3.8), with the functional form Eq.(4.26), yields only a single viable solution. The solution may be readily obtained numerically, but in special cases, a semi-analytical expression may be found. If the domain of the solution is such that \((\theta_{\rm I}/\theta_{\rm E})\,R_{\rm E}\ll R_{\rm Q}\simeq\sqrt{m^{2}- \omega_{\rm Q}^{2}}/\left(\omega^{2}-\omega_{\rm Q}^{2}\right)\), which is the Figure 3: Plot showing total magnification produced with changing \(\theta_{\rm S}\) for the case of TW astrophysical Q-balls. Here the legend indicates the ratio \(R_{\rm Q}/(R_{\rm E}\sqrt{3/2})\), where \(\sqrt{3/2}\) denotes the critical ratio of \(R_{\rm Q}/R_{\rm E}\) which separates the regimes with different number of solutions. The dashed line refers to the total magnification produced due to a point lens. case when \(\theta_{\rm s}/\theta_{\rm E}\ll 1\), then in this region we would have \[\frac{\widetilde{M}_{\rm Q}(\theta_{\rm I})}{M_{\rm Q}}\Big{|}_{\left(\frac{ \theta_{\rm I}}{\theta_{\rm E}}\right)R_{\rm E}\ll R_{\rm Q}}\simeq\frac{3}{2} \left(\frac{\theta_{\rm I}R_{\rm E}}{\theta_{\rm E}R_{\rm Q}}\right)^{2}\;, \tag{4.28}\] and Eq. (3.8) may be solved analytically to obtain an approximate solution \[\theta_{\rm I}^{(0)}\simeq\frac{\theta_{\rm S}}{1-\left(3R_{\rm E}^{2}/2R_{ \rm Q}^{2}\right)}\;. \tag{4.29}\] One may calculate the magnification in this regime by taking the derivative of Eq. (4.26), with the limit \((\theta_{\rm I}/\theta_{\rm E})\,R_{\rm E}\ll R_{\rm Q}\) and using the solution in Eq. (4.29). In this regime, from the single viable solution, one obtains a magnification \[\mathfrak{m}\left(\theta_{\rm I}^{(0)}\right)\Big{|}_{\left(\frac{\theta_{\rm I }}{\theta_{\rm E}}\right)R_{\rm E}\ll R_{\rm Q}}=\frac{\theta_{\rm I}^{(0)}}{ \theta_{\rm S}}\frac{d\theta_{\rm I}^{(0)}}{d\theta_{\rm S}}=\left(1-\frac{3} {2(R_{\rm Q}/R_{\rm E})^{2}}\right)^{-2}\left[1-\frac{3(\theta_{\rm S}/\theta _{\rm E})^{2}}{2(R_{\rm Q}/R_{\rm E})^{4}}\left(1-\frac{3}{2(R_{\rm Q}/R_{\rm E })^{2}}\right)^{-3}\right] \tag{4.30}\] It is straightforward to deduce by looking at Eq. (4.30) that as \(\theta_{\rm S}\to 0\), we get a finite maximum magnification. Hence we conclude that for Q-balls with a radius \(R_{\rm Q}>\sqrt{3/2}R_{\rm E}\) the maximum magnification produced is finite and only depends on the ratio \(R_{\rm Q}/R_{\rm E}\). Let us now consider the other regime in Q-ball sizes. For Q-balls satisfying \(R_{\rm Q}<\sqrt{3/2}R_{\rm E}\), there may be three viable solutions for small \(\theta_{\rm S}/\theta_{\rm E}\), two of which disappear as we move towards larger values. Again, one may numerically solve the lens equation to find the solutions, but in special cases, semi-analytic expressions may be obtained. Two out of the three solutions are found in the region satisfying \(\frac{\theta_{\rm I}}{\theta_{\rm E}}\geqslant\frac{R_{\rm Q}}{R_{\rm E}}\). Here, in fact, we can analytically solve the lens equation, which is now only quadratic in \(\theta_{\rm I}/\theta_{\rm E}\). The solutions obtained are \[\theta_{\rm I}^{(\pm)}=\frac{\theta_{\rm S}}{2}\left[1\pm\sqrt{1+\frac{4 \theta_{\rm E}^{2}}{\theta_{\rm S}^{2}}}\right]\;. \tag{4.31}\] These are observed to just coincide with image solutions for a point-like lens. The magnification of each of these images is given by \[\mathfrak{m}\left(\theta_{\rm I}^{(\pm)}\right)\Big{|}_{\left(\frac{\theta_{ \rm I}}{\theta_{\rm E}}\right)R_{\rm E}\geqslant R_{\rm Q}}=\frac{\theta_{\rm I }^{(\pm)}}{\theta_{\rm S}}\frac{d\theta_{\rm I}^{(\pm)}}{d\theta_{\rm S}}=\pm \frac{(\theta_{\rm S}/\theta_{\rm E})^{2}+2}{2\,\theta_{\rm S}/\theta_{\rm E} \sqrt{(\theta_{\rm S}/\theta_{\rm E})^{2}+4}}+\frac{1}{2}\;, \tag{4.32}\] leading to a contribution to the total magnification from these two solutions to be \[\mathfrak{m}\Big{|}_{\left(\frac{\theta_{\rm I}}{\theta_{\rm E}}\right)R_{ \rm E}\geqslant R_{\rm Q}}^{(\pm)}=\Big{|}\mathfrak{m}_{\rm I}^{(+)}\Big{|}+ \Big{|}\mathfrak{m}_{\rm I}^{(-)}\Big{|}=\frac{(\theta_{\rm S}/\theta_{\rm E })^{2}+2}{\theta_{\rm S}/\theta_{\rm E}\sqrt{(\theta_{\rm S}/\theta_{\rm E})^{ 2}+4}}\;. \tag{4.33}\] In this regime of Q-ball sizes, the contribution from two of the solutions, therefore, just coincides with the analogous contribution from point-like lenses. Note that in the above expressions, the characteristics of the Q-ball under consideration are still present, entering through the Einstein angle \(\theta_{\rm E}\). We also note here that the maximum magnification produced due to these images formally diverges as \(\theta_{\rm S}\to 0\). In actuality, this apparent divergence will be mitigated by finite source effects coming into play as we approach the limit. An analytic form for the third solution may also be sought if it lies in the region \((\theta_{\rm I}/\theta_{\rm E})\,R_{\rm E}\ll R_{\rm Q}\). It yields an expression identical to that given in Eq. (4.29), and therefore enhances the image by the same magnification factor as that given in Eq. (4.30). As we discussed before, we can see from Eq. (114), that as we decrease \(\theta_{\rm S}/\theta_{\rm E}\) the total magnification increases. The maximum magnification is produced for \(\theta_{\rm S}=0\) with a magnitude \[\mathfrak{m}_{3}^{\rm max}\approx\left(1-\frac{3}{2(R_{\rm Q}/R_{\rm E})^{2}} \right)^{-2}. \tag{115}\] For intermediate values of \(R_{\rm Q}/R_{\rm E}\), analytical expressions for the solutions and magnification are challenging to obtain in general. In our subsequent studies, we will, therefore, numerically compute all the solutions to the lens equation. The numerically computed total magnification produced by thin-wall Q-balls are shown in Fig. 3, for different values of \(R_{\rm Q}/R_{\rm E}\). From Fig. 3, we see that for TW Q-balls having \(R_{\rm Q}>\sqrt{3/2}R_{\rm E}\), decreasing the value of \(\theta_{\rm S}\) to zero leads to a finite maximum value for the magnification. This is quantified by the analytical expression given in Eq.(114). This may be contrasted with the \(R_{\rm Q}\leqslant\sqrt{3/2}R_{\rm E}\) case where there is formally no upper bound on the total magnification, though in reality it will be regulated when finite source sizes are correctly accounted for, as we mentioned earlier. When the size of TW Q-balls are of the order of their corresponding Einstein radius i.e. \(R_{\rm Q}\approx R_{\rm E}\), the magnification profile displays some interesting features--such as the peak for the case \(R_{\rm Q}/R_{\rm E}=0.5\times\sqrt{3/2}\). Such a peak is termed a 'caustic', and is the value of \(\theta_{\rm S}\) at which the number of solutions changes discontinuously. The sudden divergence of the magnification comes from the fact that the derivative \(d\theta_{\rm S}/d\theta_{\rm I}\) vanishes, and by virtue of Eq.(113) makes the magnification formally diverge. Intuitively, it may also be understood that Q-balls which are not in the vicinity of the line of sight joining the source and the observer should not affect the source brightness significantly. Therefore we see from Fig. 3 that for large values of \(\theta_{\rm S}\), Q-balls of all sizes fail to produce any magnification and therefore the magnification factor \(\mathfrak{m}\to 1\) irrespective of the size of the Q-balls. Having looked at the salient features of lensing due to thin-wall Q-balls, we now move on to investigate the gravitational lensing by BTW Q-balls, where \(\omega\) may take more general values. Here again, in order to solve the lens equation given in Eq.(10), we need to calculate the mass ratio given in Eq.(112), but now using the full mass density profile for BTW Q-balls given in Eq. (115), with arbitrary \(\omega\). This does not yield a simple analytical form, except in very special cases. So, for the case of BTW Q-balls, we will rely on numerical analysis for finding out solutions to lens equation as well as calculating the total magnification. We also ensure that all the requisite criteria for viable astrophysical Q-balls, as encapsulated in Secs. 2 and 4.1 are satified. Note that the mass profile Eq. (110) implicitly appears in Eq. (10), for the definition of \(\widetilde{M}_{\rm Q}(\chi^{\prime})\), through the identification \(r=\sqrt{\chi^{\prime 2}+z^{2}}\), for a fixed transverse distance \(\chi^{\prime}\). The major difference in TW and BTW Q-balls comes from the possibility of a distinct overall functional form and thicker transition region for the latter's field profiles and mass density profiles. It is natural to suspect that such a feature in the mass density profile may have a different overall impact on the microlensing signature, depending on the actual functional form, even for Q-balls which have roughly the same mass and size. One of the astrophysical observables to help contrast the distinct characteristics of TW and BTW Q-balls is to compare their respective magnification profiles. For this particular reason, in Fig. 4, we plot the magnification profile for a thin wall Q-ball and two BTW Q-balls. All three Q-ball profiles have equal radii and roughly the Figure 4: In the above figures, we display the density profiles for three different astrophysical Q-ball profiles with approximately equal radii and average densities and compare their relative magnification profiles. We define \(\alpha\equiv\sqrt{(m^{2}-\omega_{\rm Q}^{2})/(\omega^{2}-\omega_{\rm Q}^{2})}\) to quantify the different Q-ball profiles. **Top:** Density profile for a TW and two BTW Q-balls are shown, all of which have an equal radius, around \(1\,R_{\odot}\). Here, we have normalised the radial coordinate with respect to the solar radius, \(R_{\odot}=6.9\times 10^{8}\,\)m, and the density is normalised to the average solar density, \(\rho_{\odot}=1.4\times 10^{3}\,\)kg/m\({}^{3}\). **Bottom:** The figure shows the dependence of the total magnification on the source position \(\theta_{\rm S}\) for the same set of Q-ball profiles as in the adjoining figure. Though the magnification profiles have similar shapes overall, the position of the caustic progressively shifts towards lower \(\theta_{\rm S}\) values for thicker transition regions. A larger magnification is also seen in the small \(\theta_{\rm S}\) domain for profiles with a thicker transition region. same average density. We can see from the figure that qualitatively the magnification profiles look the same, but the position of the caustic progressively shifts towards lower \(\theta_{\rm S}\) values for profiles with thicker transition regions. Also, for smaller values of \(\theta_{\rm S}\), the profile with the thicker region of transition produces a larger magnification. For large \(\theta_{\rm S}\) values, all three Q-balls lens cases converge to a magnification of unity, which is true for any generic astrophysical object. As we commented earlier, when a lens passes through the line of sight of the observer and the source, it magnifies the background source. Whether this is observed or detected will depend on the microlensing survey instrument's sensitivity to this waxing of brightness. Usually, for categorising an event to be a microlensing event, we define a threshold magnification value (\(\mathfrak{m}^{*}\)) above which an instrument is able to detect it as a viable event. This threshold magnification (\(\mathfrak{m}^{*}\)) is conventionally defined as the magnification generated by a point lens when \(\theta_{\rm S}=\theta_{\rm E}\). Utilising Eq. (4.33), this gives the threshold magnification as \(\mathfrak{m}^{*}=1.34\). The idea is that, with the above prototypical magnification threshold assumption for a survey, all point lenses which are positioned with \(\theta_{\rm S}<\theta_{\rm S}^{*}\) will produce magnification \(\mathfrak{m}>\mathfrak{m}^{*}\), and hence will be detected. For extended distributions of matter like Q-balls, due to the non-trivial density profiles, the value of \(\theta_{\rm S}\) that produces a magnification of \(\mathfrak{m}^{*}\) may not be the same as \(\theta_{\rm E}\), and may even vary depending on the relative size of the Q-ball as compared to its Einstein radius. Figure 5: The threshold value of the source position (denoted by \(\theta_{\rm S}^{*}\)), below which one obtains a total magnification \(\mathfrak{m}\geq\mathfrak{m}^{*}\), is shown as a function of \(R_{\rm Q}/R_{\rm E}\). Here, a range bounded by \(\mathfrak{m}^{*}=1.34\pm 0.01\) is the assumed threshold magnification band (corresponding to the magnification due to a point mass lens when \(\theta_{\rm S}\rightarrow\theta_{\rm E}\)) delimiting what may be detectable by a microlensing survey. The dashed and dotted black curves indicate point lens and TW Q-ball profiles, respectively. The green band is composed of various distinct astrophysical Q-ball profiles with the restriction \(\sqrt{(m^{2}-\omega_{\rm Q}^{2})/(\omega^{2}-\omega_{\rm Q}^{2})}\lesssim 0.5\), so as to comfortably satisfy the field-theoretic stability constraints. For the \(R_{\rm Q}/R_{\rm E}\) values shown, we have verified the existence of astrophysical Q-balls, satisfying the criteria of Secs. 2 and 4.1. The threshold characteristics may be understood more clearly from Fig. 5, where we have computed and plotted how the threshold value of \(\theta_{\rm S}\), which gives magnification in the range \(\mathfrak{m}^{*}=1.34\pm 0.01\), changes with the ratio \(R_{\rm Q}/R_{\rm E}\). In Fig. 5, the green band depicts a range of astrophysical Q-balls, with distinct density profiles. The band is obtained by sifting through numerous Q-ball profiles with the requirement that they satisfy the criteria of Secs. 2 and 4.1. The band is not an artefact of the narrow range (\(\pm 0.01\)) we have assumed for \(\mathfrak{m}^{*}\). From Fig. 5, it is particularly obvious that when \(R_{\rm Q}/R_{\rm E}\to 0\), for all Q-balls, the corresponding \(\theta_{\rm S}\) value goes to the point lens value (i.e. 1), as should be expected. Additionally, the band gets terminated at \(R_{\rm Q}/(R_{\rm E}\sqrt{3/2})\sim 2.7\), because above it the magnification is always smaller than 1.34. When \(R_{\rm Q}/(R_{\rm E}\sqrt{3/2})\) is near 0.4 or in the range [1.4, 2.5] the BTW Q-ball lenses are more effective in magnifying sources than their point-lens counterparts. One also notes that there is a peak near \(R_{\rm Q}/(R_{\rm E}\sqrt{3/2})\sim 0.4\). In the range [0.5, 1.3] the astrophysical Q-ball lenses are weaker lenses than point lenses. In Fig. 6, we further plot the variation of \(\theta_{\rm S}^{*}\) as a function of the lens position \(d_{\rm L}\) for the Large Magellanic Cloud (LMC) and Milky Way bulge (MW) sources; top and bottom figures, respectively. The LMC is located at 50 kpc and the MW at 8.5 kpc from earth. As we shall see in the next section, akin to the data encapsulated in Fig. 6, a dictionary of \(\theta_{\rm S}^{*}\) for various astrophysical Q-ball configurations is critical for determining microlensing event rates and physically viable astrophysical Q-ball populations. Here, the band indicates various astrophysical Q-balls with nearly identical masses and radii but differing density profiles. For Fig. 6, as in Fig. 4, the mass and radius of the Q-ball are taken to be about \(5\times 10^{-6}\,{\rm M}_{\odot}\) and \(1\,{\rm R}_{\odot}\). Clearly, for the MW source, the Q-ball lens is more effective compared to LMC, manifesting as higher values for \(\theta_{\rm S}^{*}\). This will reflect in the microlensing event rates and hence in the limits on viable astrophysical Q-ball populations. In the next section, we place constraints on the population of astrophysical Q-balls, assuming them to form a component of the dark matter sector, by leveraging the observations from microlensing surveys like EROS-2, OGLE-IV and WFIRST (proposed, future survey). ### Contraints on astrophysical Q-balls from microlensing surveys If astrophysical Q-balls exist and may be forming a small fraction of the missing matter in the universe, they may be detected or at least constrained by gravitational microlensing surveys. In this section, we wish to study bounds on the fraction of dark matter that may, in principle, be in the form of Q-balls. The number of microlensing events induced by astrophysical Q-balls will be directly proportional to the number density in the line of sight of the observer and the source. Therefore, the idea is that depending on the number of 'anomalous' events observed in a microlensing survey, we may hope to put crude upper bounds on the population of astrophysical Q-balls in the vicinity of our galaxy. We will adapt the methodologies expounded in [26, 27] for studying our particular cases of interest. If the dark matter density at a distance \(d_{\rm L}\) from observer is \(\rho_{\rm DM}(d_{\rm L})\), then we may write the fraction of that density contained in Q-balls as \(\rho_{\rm DM}^{\rm Q}(d_{\rm L})=f_{\rm DM}\,\rho_{\rm DM}(d_{\rm L})\). Here, \(f_{\rm DM}\) is the fraction of total dark matter contained in the form of Q-balls. This is the quantity we hope to put constraints on. For a single background source, we may quantify the rate of events, assuming unit exposure time, from the differential event rate expression [75] \[\frac{d^{2}\Gamma}{d\gamma d\tau}=\frac{2d_{\rm S}e(\tau)}{v_{\odot}^{2}M_{ \rm Q}}f_{\rm DM}\rho_{\rm DM}(\gamma)v_{\rm Q}^{4}(\gamma)e^{-v_{\rm Q}^{2}( \gamma)/v_{\odot}^{2}}. \tag{4.35}\] Figure 6: The threshold \(\theta_{\rm S}^{*}\) is shown now as a function of the lens distance \(d_{\rm L}\). The lensing source objects are assumed to be the Large Magellanic Cloud (top figure) and the Milky Way bulge (bottom figure). The point lens and TW Q-balls are again represented by dashed and dotted black curves, respectively. The green band, as in Fig. 5, represents various astrophysical Q-ball configurations, all with similar mass and radii but distinct density profiles. The plots have been made for \(M_{\rm Q}\simeq 5\times 10^{-6}\) M\({}_{\odot}\) and \(R_{\rm Q}=1\) R\({}_{\odot}\). We have again adopted \(\mathfrak{m}^{*}\in[1.33,1.35]\) and have restricted \(\sqrt{(m^{2}-\omega_{\rm Q}^{2})/(\omega^{2}-\omega_{\rm Q}^{2})}\lesssim 0.5\) based on field-theoretic stability. We have defined \(\gamma\equiv d_{\rm L}/d_{\rm S}\) and \(v_{\odot}=2.2\times 10^{5}\rm m\,s^{-1}\), which is the circular speed of the solar system around the galactic centre. In the above expression, \(\tau\) is the transit time for a Q-ball to pass through the "lensing tube". The latter is defined as the volume of space between the observer and the source, constructed by cylinders of infinitesimal thickness and radius \(\theta_{\rm S}^{*}d_{\rm L}\). This basically means that as long as the Q-ball resides inside the lensing tube, it produces a magnification greater than the threshold value \(\mathfrak{m}^{*}\). Here, \(\theta_{\rm S}^{*}\) is the threshold source position as a function of \(d_{\rm L}/d_{\rm S}\), similar to Fig. 6. \(e(\tau)\) is the efficiency of detection, \(M_{\rm Q}\) is the mass of the astrophysical Q-ball and \(v_{\rm Q}\equiv 2\theta_{\rm S}^{*}(\gamma)R_{\rm E}(\gamma)/\theta_{\rm E}\tau\) is the velocity of the astrophysical Q-ball. The above expression is derived assuming that dark matter and astrophysical Q-ball velocities follow a simple Maxwell-Boltzmann distribution [75]. For the dark matter distribution concerned, we assume an isothermal profile [76] \[\rho_{\rm DM}(r)=\frac{\rho_{\rm c}}{1+(r/r_{c})^{2}} \tag{4.36}\] where \(\rho_{c}=1.4\,\rm GeV/cm^{3}\) is the dark matter core density and \(r_{c}=4.4\,\rm kpc\) quantifies the size of the dark matter core. We may now integrate Eq.(4.35), along the line joining the source and the observer and between a range of astrophysical Q-ball transit times. This gives the total number of Q-ball microlensing events registered (\(\eta\)) for a single source and for unit observation time \[\eta=\int_{0}^{1}d\gamma\int_{\tau_{\rm min}}^{\tau_{\rm max}}d\tau\frac{d^{2} \Gamma}{d\gamma d\tau}\;. \tag{4.37}\] Multiplying \(\eta\) with the total number of sources in a survey (\(N_{s}\)) and the total observation time (\(T_{o}\)), one obtains the total number of expected astrophysical Q-ball events \[N_{\rm exp}=\eta N_{s}T_{o}\;. \tag{4.38}\] Here, we emphasize that \(\eta\) indirectly contains information about the astrophysical Q-ball density profile distribution through \(\theta_{\rm S}^{*}(\gamma)\). For an astrophysical Q-ball with fixed radius and mass, \(\theta_{\rm S}^{*}/\theta_{\rm E}\) still varies with \(\gamma\); as we already observed in Fig. 6, for instance. This may be partly understood from Eq. (3.1). This information goes into Eq. (4.35) through \(v_{\rm Q}\) and therefore in putting the constraints for Q-balls of different radii and mass. Specifically, the dependence is through relations similar to those encapsulated in Fig. 6. We will leverage the gravitational microlensing surveys EROS-2 [77] and OGLE-IV [78, 79] and the proposed survey WFIRST [80, 81] to put bounds on the astrophysical Q-ball fraction (\(f_{\rm DM}\)). We will place limits on the population of astrophysical Q-balls in the vicinity of our Milky Way based on the number of anomalous events detected (for EROS-2 and OGLE-IV) or assuming future detection (for WFIRST). EROS-2 [77] is pointed at the Large and Small Magellanic Clouds, which are located at a distance of \(50\,\rm kpc\) and \(60\,\rm kpc\) from the Sun, respectively. The total number of source stars in the survey is \(N_{s}=5.49\times 10^{6}\)[82]. The total observation time was \(T_{o}=2500\,\rm days\), with the accommodated transit times ranging from a day up to a thousand days. We have taken the efficiency \(e(\tau)=0.24\), which is the time average over all transit periods. It has detected one event that cannot be fully explained by background modelling. We have placed constraints on the astrophysical Q-ball constituents in dark matter, taking LMC as the source field. The centre of the Milky Way contains a large number of source stars, around \(N_{s}=4.88\times 10^{7}\). OGLE-IV [78] takes its source field as the Milky Way bulge, which is at a distance Figure 7: Bounds on the fraction of dark matter comprised of astrophysical Q-balls are shown from various microlensing surveys. The point lens and TW astrophysical Q-balls are shown by the dashed and dotted lines, respectively. While the solid and dashed-dotted lines represent the two BTW Q-balls. The three profiles have the same radius \(R_{\rm Q}\) in each of the cases. As in Fig. 4 we have taken \(\alpha=\{10^{4},3,2\}\). From top to bottom, the constraints are given for astrophysical Q-balls of sizes \(0.5\,R_{\odot},1\,R_{\odot}\) and \(2\,R_{\odot}\) respectively; again with the solar radius \(R_{\odot}=6.9\times 10^{8}\,{\rm m}\). We note that inspite of having quantitatively disintinct individual magnification signatures, the BTW Q-balls and TW Q-ball have almost the same \(f_{\rm DM}\) bound. The \(M/M_{\odot}\) ranges adopted are accommodating regions where we have verified the existence of astrophysical Q-balls, following the conditions derived in Secs. 2 and 4.1. We have taken \(M_{\odot}=1.98\times 10^{30}\,{\rm kg}\). of \(8.5\,\mathrm{kpc}\) from the Sun [82]. OGLE-IV has observed more than 2500 events in its observation period of \(T_{o}=1826\,\mathrm{days}\). We have taken the efficiency \(e(\tau)=0.1\), which is the time average over all transit periods. Assuming these events to be due to stellar structure, we put conservative constraints on the population of astrophysical Q-balls in the Milky Way. Proposed, future microlensing surveys, like WFIRST, will enable us to look for astrophysical Q-balls in ever smaller mass ranges. The proposed WFIRST mission expects to adopt the Milky Way Buldge as well as Magellanic clouds as its source field. It will scan the sky in intervals spanning \(72\,\mathrm{days}\)[81]. We have taken the efficiency \(e(\tau)=0.5\). As we mentioned, it will be most sensitive to very low sub-solar mass range objects. We have put constraints on the population of low-mass Q-balls--assuming it detects one or zero anomalous events--taking LMC as the source field. While counting events, we assume Poisson statistics for the distribution of microlensing events. Therefore, if the actual number of anomalous events detected by one of these surveys is \(N_{\mathrm{obs}}\), say, then assuming Poisson distribution for these events, we may calculate the expected number \(N_{\mathrm{exp}}\) as \[\sum_{k=0}^{N_{\mathrm{obs}}}P(k,N_{\mathrm{exp}})=0.05\;. \tag{103}\] Here, \(P(k,N_{\mathrm{exp}})=N_{\mathrm{exp}}^{k}e^{-N_{\mathrm{exp}}}/k!\) denotes the probability of observing \(k\) events for a fixed \(N_{\mathrm{exp}}\). So if we have already observed \(N_{\mathrm{obs}}\) events then by virtue of Eq.(103) we can exclude the values of \(N_{\mathrm{exp}}\) such that \(\sum_{k=0}^{N_{\mathrm{obs}}}P(k,N_{\mathrm{exp}})<0.05\) with 95% C.L. This puts an upper bound on \(N_{\mathrm{exp}}\) which can be used to put the upper bound on \(f_{\mathrm{DM}}\) as function of the lens mass through Eq.(100). We have performed this analysis for the surveys mentioned above and our results are shown in Fig. 7. The limits on three astrophysical Q-ball profiles, the same as those displayed in Fig. 4, are shown in Fig. 7. In each case, the astrophysical Q-ball radii are the same. The profiles are chosen to have \(\alpha=\{10^{4},3,2\}\), where \(\alpha\equiv\sqrt{(m^{2}-\omega_{\mathrm{q}}^{2})/(\omega^{2}-\omega_{\mathrm{ q}}^{2})}\). It is worth noting that for sub-earth mass astrophysical Q-balls, very minimal variance exists in the constrained \(f_{\mathrm{DM}}\), for various BTW Q-ball profiles. This is a consequence of the fact that the area under the curve in Fig. 6 is almost the same for the different profiles. This renders the contribution from the lensing tube integration to the number of microlensing events to be almost equal. There are also no significant differences in the \(f_{\mathrm{DM}}\) bounds for higher-mass TW and BTW astrophysical Q-balls. This is because, for large-mass Q-balls (at fixed radii), the ratio \(R_{\mathrm{q}}/R_{\mathrm{E}}\ll 1\) and hence all Q-ball profiles start showing point lens behaviour. This is clearly visible from Fig. 5, for instance. Therefore, one concludes that despite their quantitatively unique individual magnification characteristics, as far as the \(f_{\mathrm{DM}}\) bounds are concerned, the various astrophysical Q-balls generate almost identical bounds. We observe from Fig. 7 that the strictest limits on solar mass astrophysical Q-balls may be placed from OGLE-IV. Also, for \(R_{\mathrm{q}}\sim R_{\odot}\), we see that for the mass range \(10^{-5}-10^{-4}M_{\odot}\), the astrophysical Q-ball population is restricted to being within about 0.1% of the total dark matter. As we move away from \(10^{-5}M_{\odot}\), the \(f_{\mathrm{DM}}\) constraints weaken. For low mass Q-balls with mass range \(10^{-7}M_{\odot}<M_{\mathrm{q}}<10^{-5}M_{\odot}\), we observe that WFIRST and OGLE-IV put stricter bounds than EROS-2 when \(R_{\mathrm{q}}\) is below \(R_{\odot}\). This trend could also have been already speculated based on the characteristics observed in Fig. 6. For \(R_{\mathrm{q}}>R_{\odot}\), in the vicinity of \(10^{-7}M_{\odot}\), EROS-2 currently gives better limits than OGLE-IV, while WFIRST can potentially constrain this region very strongly in the future. For mass range \(10^{-5}M_{\odot}-10^{-2}M_{\odot}\), OGLE-IV and EROS-2 put more strict bounds on \(f_{\mathrm{DM}}\) as compared to WFIRST. This is expected as WFIRST is designed to detect earth-mass astrophysical objects. We also observe that for astrophysical Q-ball mass ranges \(10^{-1}\,M_{\odot}-10\,M_{\odot}\), one cannot put any really strong restrictive bounds on \(f_{\rm DM}\), from the microlensing surveys considered. In these regions, therefore, astrophysical Q-balls, if they exist, could abound. ## 5 Summary and conclusions In this paper, we have explored a few aspects of non-topological solitonic Q-ball solutions when such configurations may form astrophysically viable structures in the universe. We focused on theoretical aspects related to their viability, as well as investigated their gravitational lensing features for different astrophysical Q-ball profiles. Speculating on what fraction of dark matter may be comprised in Q-balls, we derived constraints from microlensing surveys in the viable ranges. Apart from Figs. 3-7, let us summarise below some of the main results. In the context of the theoretical bounds, we deduced novel limits on the size of astrophysical Q-balls in Eqs. (4.5) and (4.6). These were obtained from the analytic form of the Q-ball radius and by considerations of gravitational instability, respectively. In the same context, while exploring the Jeans instability criteria for astrophysical Q-balls, we found a new lower bound in Eq. (4.8) on the Lagrange multiplier, which is akin to a chemical potential in the Q-ball context; as may be motivated from Eq. (2.12). Also, these limits on the astrophysical Q-ball radii provided new inequalities for the Lagrangian parameters, as encapsulated by Eq. (4.10). Through the study of gravitational lensing features by different Q-ball profiles, we noted distinct characteristics as the profiles were varied. We observed, for instance, in Fig. 4 that thin-wall and beyond-thin-wall Q-balls, having roughly the same mass and size, exhibit different magnification profiles. This suggests that the microlensing light curve will also be distinct and may help differentiate profiles, provided sufficient anomalous events are observed in the future, if astrophysical Q-balls indeed exist in the universe. In Figs. 5 and 6, we explored threshold angular source positions, leading to potentially detectable magnifications in surveys, for beyond-thin-wall Q-balls. Finally, we derived gravitational microlensing constraints on astrophysical Q-balls--both for the case of thin wall and beyond-thin-wall profiles--using data from EROS-2, OGLE-IV and projections for the proposed WFIRST survey. The limits on \(f_{\rm DM}\), the fraction of dark matter that may be in the form of astrophysical Q-balls, are shown in Fig. 7. For lower masses, it is seen that this fraction may at most be \(\mathcal{O}(0.1\%)\), while for higher masses, the fraction may be much higher, even in the \(\mathcal{O}(10\%)\) range. ## Acknowledgments We would like to thank Ranjan Laha for discussions. AT would like to thank the organisers of the 'Horizons in Accelerators, Particle/Nuclear Physics and Laboratory-based Quantum Sensors for HEP/NP' and 'Particle Physics: Phenomena, Puzzles, Promises' ICTS conferences, as well as ICTS, Bengaluru, for their kind hospitality during the completion of parts of this work. AA and LB acknowledge support from a Junior Research Fellowship, granted by the Human Resource Development Group, Council of Scientific and Industrial Research, Government of India. AT acknowledges support from an Early Career Research award, from the Department of Science and Technology, Government of India.

2307.14236

UnScientify: Detecting Scientific Uncertainty in Scholarly Full Text

This demo paper presents UnScientify, an interactive system designed to detect scientific uncertainty in scholarly full text. The system utilizes a weakly supervised technique that employs a fine-grained annotation scheme to identify verbally formulated uncertainty at the sentence level in scientific texts. The pipeline for the system includes a combination of pattern matching, complex sentence checking, and authorial reference checking. Our approach automates labeling and annotation tasks for scientific uncertainty identification, taking into account different types of scientific uncertainty, that can serve various applications such as information retrieval, text mining, and scholarly document processing. Additionally, UnScientify provides interpretable results, aiding in the comprehension of identified instances of scientific uncertainty in text.

Panggih Kusuma Ningrum, Philipp Mayr, Iana Atanassova

2023-07-26T15:04:24Z

http://arxiv.org/abs/2307.14236v1

# UnScientificy: Detecting Scientific Uncertainty in Scholarly Full Text ###### Abstract. This demo paper presents UnScientific 1, an interactive system designed to detect scientific uncertainty in scholarly full text. The system utilizes a weakly supervised technique that employs a fine-grained annotation scheme to identify verbally formulated uncertainty at the sentence level in scientific texts. The pipeline for the system includes a combination of pattern matching, complex sentence checking, and authorial reference checking. Our approach automates labeling and annotation tasks for scientific uncertainty identification, taking into account different types of scientific uncertainty, that can serve various applications such as information retrieval, text mining, and scholarly document processing. Additionally, UnScientificy provides interpretable results, aiding in the comprehension of identified instances of scientific uncertainty in text. Footnote 1: Demo app: [https://bit.ly/unscentivity-demo](https://bit.ly/unscentivity-demo) Scholarly document processing, text mining, scientific uncertainty, fine-grained annotation, pattern matching, label automation, authorial reference + Footnote †: journal: ## 1. Introduction Uncertainty is an inherent part of scientific research, as the very nature of scientific inquiry involves posing questions, developing hypotheses, and testing them using empirical evidence. Despite the best efforts of scientists to control for extraneous variables and obtain accurate measurements, there is always a certain degree of uncertainty associated with any scientific findings. This uncertainty can arise from a variety of sources, such as measurement error, sampling bias, or limitations in experimental design. Consequently, researchers resort to various strategies to manage and mitigate uncertainty when presenting their findings in academic articles. These may include using language that is overly definitive or hedging their claims with qualifiers such as "presumably" or "possible" [(1)]. The identification of Scientific Uncertainty (SU) in scientific text is a crucial task that can provide insights into the reliability and validity of scientific claims, help in making informed decisions, and identify areas for further investigation. Besides, detecting uncertainty has become a significant aspect of the peer-review process, which serves as a gatekeeper for the dissemination of scientific knowledge. However, the identification of scientific uncertainty in text is a complex task that requires expertise in linguistics and scientific knowledge, and is often time-consuming and labor-intensive. The primary issue stems from the fact that handling unstructured textual data in scientific literature is complicated. Previous research has mainly focused on identifying a specific set of uncertainty cues and markers in scientific articles, using a particular section of the text, such as the abstract [(2)] or the full text [(3; 4)]. These studies have helped expand the vocabulary and lexicon associated with uncertainty. However, their practical application is often inaccurate because of the intricate nature of natural language. More sophisticated automation techniques such as machine learning and deep learning have undoubted potential for dealing with Natural Language Processing (NLP) tasks. However, the task of scientific uncertainty identification is challenging due to several factors. Firstly, there is a scarcity of available extensively annotated corpus that can be used by such techniques for scientific uncertainty identification. At present, certain corpora are limited in their scope as they only capture a particular type of uncertainty within a specific domain. For example, the BioScope corpus concentrates solely on negation or uncertainty in biological scientific abstracts [(2)], while the FACTBANK corpus is designed to identify the veracity or factuality of event mentions in text [(5)]. Similarly, the Genia Event corpus is restricted to the annotation of biological events with negation [(6)]. Therefore, there is a need for more diverse corpora that capture a wider range of uncertainty types and domains, to facilitate a more comprehensive understanding of uncertainty in natural language processing. Secondly, identifying scientific uncertainty in text involves complex linguistic features as it is often conveyed through a combination of linguistic cues, including the use of modal verbs (e.g. may, could, might), hedging devices (e.g. seems, appears, suggests), and epistemic adverbs (e.g. possibly, probably, perhaps) [(7; 8)]. Identifying such linguistic markers of uncertainty is not always straightforward, as they can be expressed in a variety of ways depending on the writing style or stance of the scientist. Another challenge concerns scientists' discourse in scientific writing. A typical scientific text contains various statements and information which not only discuss the current or present study but also the former studies [(9)]. While writing the article, scientists can use uncertainty claims from other studies as a rhetorical tool to persuade others or to describe and organize some state of knowledge. As a result, distinguishing the reference of the uncertainty feature - whether the statement actually demonstrates uncertainty in the current study or in the former study, is a crucial factor in better understanding the context of scientific uncertainty. A study conducted by Bongelli et al. [(8)] is one of few that was aware of this concern. In more detail, this study only focused on the certainty and uncertainty expressed by the speakers/writers in the here-and-now of communication and excluded those that were expressed by the other party. To overcome these challenges, we propose a weakly supervised technique that employs a fine-grained annotation scheme to construct a system for scientific uncertainty identification from scientific text focusing on the sentence level. Our approach can be used to automate labeling or annotating tasks for scientific uncertainty identification. Moreover, our annotation scheme provides interpretable results, which can aid in the understanding of the identified instances of scientific uncertainty in text. We anticipate that our approach will contribute to the development of more accurate and efficient scientific uncertainty identification systems, and facilitate the analysis and interpretation of scholarly documents in NLP. ## 2. Data The present study employs three annotated corpora as the training set. These corpora consist of 59 journals from four different disciplines: Medicine, Biochemistry, Genetics & Molecular Biology, Multidisciplinary, and Empirical Social Science2 which represent Science, Technology, and Medicine (STM) as well as Social Sciences and Humanities (SSH). The corpora consist of 1001 randomly selected English sentences from 312 articles across 59 journals. These sentences were annotated to identify uncertainty expressions and authorial references. By utilizing multiple corpora from different disciplines, this study aims to capture a diverse range of uncertainty expressions and improve the generalizability of the results. Table 1 illustrates the distribution of the data in the corpora and Table 2 shows the sample of annotated sentences. Footnote 2: All social science articles are from SSOAR ([https://www.ssoar.info/](https://www.ssoar.info/)); we selected articles from 53 social science journals indexed in SSOAR. ## 3. Approach Identifying scientific uncertainty in academic texts is a complex task due to various reasons. Previous research indicates that relying solely on cues or markers such as hedging words or modal verbs may not accurately identify scientific uncertainty (Selvin et al., 2015). The natural language and writing styles used by scientists, along with variations in domain-specific terminology, add to the complexity of identifying uncertainty in scientific text. Moreover, the lack of clear boundaries for expressions of uncertainty makes n-gram-based approaches too inflexible to capture the various forms and expressions of uncertainty in scientific language. To address these limitations, our research proposes a fine-grained annotation scheme for identifying uncertainty in scientific texts. ### Fine-grained SU annotation scheme and patterns formulation The present study adopts a span-based approach for identifying scientific uncertainty in academic text. Rather than relying solely on linguistic cues, the scheme classifies spans of text into several groups based on their linguistic features, including Part of Speech (POS) tags, morphology, and dependency. The scheme is also informed by a comprehensive analysis of scientific language, allowing for a more nuanced and accurate understanding of uncertainty expression. During the annotation process, a list of annotated spans was created and classified into twelve groups of scientific uncertainty (SU) patterns based on their semantic meaning and characteristics. The groups include conditional expressions, hypotheses, predictions, and subjectivity, among others. In other words, the classification is based on the types of expressions used to convey uncertainty and the context in which they are used. Additionally, the scheme considers spans of text that signal disagreement statements as one of SU groups, despite ongoing debate regarding whether disagreement expressions should be considered as such. The justification for this approach is rooted in the idea that uncertainty in research can stem from conflicting information or data, where multiple sources provide contradictory knowledge (Selvin et al., 2015). This type of uncertainty cannot be reduced by increasing the amount of information. Once the annotated spans are classified, Scientific Uncertainty Span Patterns (SUSP) are formulated based on the word patterns of each span and its linguistic features. Figure 1 illustrates the output from the spans annotation process. Figure 1 shows the application of span annotation to identify scientific uncertainty in each sentence. Each span is assigned a label corresponding to its SU pattern group. It should be noted that a sentence can have multiple labels assigned to different SU pattern groups, as seen in the second example, where labels for both conditional expression and modality are present. This feature of our annotation scheme enables the identification of complex expressions of uncertainty in scientific text. Table 3 shows more details about the list of SU pattern groups and samples from each group and more detailed information about the pattern formulation process can be seen in the demo's documentation 3. Footnote 3: Demo’s documentation: [https://bit.ly/unsecurity-demo](https://bit.ly/unsecurity-demo) ### Authorial Reference Checking Authorial reference is crucial in scientific writing to provide context, especially when identifying scientific uncertainty. It helps to indicate the authorship of the argument and distinguish between the claims of the author and those of others. This can be achieved through various styles of authorial reference, such as in-text citations, reference or co-reference (Selvin et al., 2015). Additionally, there are Figure 1. Two annotated sentences with SU expressions. Samples of output from span annotation process are shown in different colours based on their SU Pattern Group. disciplinary variations in both the frequency and use of personal and impersonal authorial references (Kumar et al., 2017). Proper attribution of uncertain claims is important to determine their origin and evaluate the credibility of the argument. For instance, when stating a hypothesis, it is essential to indicate whether it is the author's hypothesis or cited from another source. This helps the reader to assess the level of uncertainty associated with the hypothesis. In the present study, the authorial reference of each sentence was annotated based on the citation & co-citation patterns, and the use of personal & impersonal authorial references. Furthermore, sentences were labeled into three groups including 1) author(s) of the present article, or 2) author(s) of previous research. The last group, 3) both, is intended to accommodate complex sentences that may refer to both the author(s) and the previous study(s). Here, we present some examples of typical authorial reference mentions in context: 1. <l/We/Our study...> <text> 2. <Author/The former study...> <text> 3. (Author) (Year) <Text> 4. <Text> (Author1, Year1; Author2, Year2...) 5. <Text> [Ref-No1, Ref-No2...] ## 4. Demo System The demo system4 for identifying SU expressions operates at the sentence level and consists of three main components: 1) Pattern Matching, 2) Complex Sentence Checking, and 3) Authorial Reference Checking, as shown in Figure 2. Footnote 4: The demo is publicly available on [https://bit.ly/unscientify-demo](https://bit.ly/unscientify-demo). The first step, Pattern Matching, employs a list of patterns derived from 12 SU pattern groups (see Table 3). The input sentence is matched against these patterns, and if a match is found, a list of SU span candidates is generated. If there is no match, the sentence is labeled as 'Non-SU expression'. To optimize the matching process, we customized a rule-based matcher from Spacy, which considers both keyword matches and patterns and linguistic features. The second step, Complex Sentence Checking, determines whether there are any rebuttal or confirmation statements that can cancel the uncertainty expressed in the sentence. If no such statements are detected, the system labels the sentence as 'SU Expression' and provides a list of final SU spans that provide information on the reason why a particular sentence is considered a 'SU expression'. The third step, Authorial Reference Checking, identifies the authorship of the uncertainty expression, whether it belongs to the authors, to a previous study, or both. The output of this step is the authorial reference of the sentence. Figure 3 provides an overview of the functioning of UnScientify. The input sentence is annotated as an SU expression, matching the 'Hypothesis group' pattern. This demonstrates that UnScientify not only detects uncertainty expressions in sentences but also provides information about which sentence elements support the outcome as well as descriptive information about why the sentence is considered an SU expression. In this case, the output identifies the sentence as an SU expression due to the occurrence of the "Hypothesis group' pattern in the sentence, indicating a tentative explanation or assumption that requires further testing for confirmation. Additionally, UnScientify checks for authorial references, labeling this instance as 'Author(s)', suggesting that the sentence originates from the author rather than being cited from other sources or previous studies. As a result, it provides more contextual and interpretable results. Further demonstrations of UnScientify can be viewed in Appendix A. ## 5. Conclusion Our demonstration system offers a comprehensive approach to identifying uncertainty expressions in scientific text. By utilizing pattern matching, complex sentence checking, and authorial reference checking, we provide clear and interpretable output that explains why a sentence is flagged as expressing uncertainty, \begin{table} \begin{tabular}{l l r r} \hline \hline Discipline & Journal & Articles & Sentences \\ \hline Medicine & BMC Med & 51 & 95 \\ & Cell Mol Gastroenterol Hepatol & 25 & 36 \\ Biochemistry, Genetics \& Molecular Biology & Nucleic Acids Res & 52 & 63 \\ & Cell Rep Med & 22 & 48 \\ Multidisciplinary & Nature & 34 & 57 \\ & PLoS One & 42 & 55 \\ Empirical Social Science & SSOAR (53 journals) & 86 & 647 \\ \hline \hline \end{tabular} \end{table} Table 1. Corpora description \begin{table} \begin{tabular}{l l l} \hline \hline Sentence & SU Check & Authorial Ref. \\ \hline It is possible that corticosteroids prevent some acute gastrointestinal complications. & Yes & Author(s) \\ However, we find no evidence to support this hypothesis either. & No & - \\ But, how this kind of coverage might influence the ”we” feeling among Europeans, still remains & Yes & Author(s) \\ somehow an open question. & & \\ Previous meta-analyses have shown a significant benefit for NaHCO3 in comparison to normal & Yes & Former/Prev. Study(s) \\ saline (NS) infusion (Borda et al., 2017; Borda et al., 2017), although they highlighted the possibility of publication bias. & \\ \hline \hline \end{tabular} \end{table} Table 2. Samples of annotated sentences \begin{table} \begin{tabular}{p{4.3pt} p{113.8pt} p{113.8pt} p{113.8pt}} \hline No & Pattern Group & Description & Examples \\ \hline 1 & Explicit SU & Explicit SU group displays expressions with obvious scientific uncertainty keywords, indicating direct and explicit uncertainty expression & 1) In addition, the role of the public **is often unclear**. 2)... the functional relevance of G4 in vivo in mammalian cells **remains controversial**. 1) Different voters **might have** different interpretations about... 2) There **may also be** behavioral effects. 1) If persons perceive the media as hostile, **it is probable that** the mere-exposure effect is weakened thus we hypothesize... 2) If there are any violations, subsequent inferential procedures may be invalid, and **if so**, the conclusions would be faulty. 1) **Hypotheses** predict that aggregate support for markets should be stronger... 2) **We assume** that post-materialistic individuals may have differing attitudes towards doctors than those... 1) In July 2017, the National Grid’s Future Energy Scenarios **projected that** the UK government... 2) Since aging leads to decreased Sir2, we **predicted that**, in young cells... 1) The study aims to determine **whether** the observed results can be replicated across different populations. 2)...this research literature has also contested **whether or not** citizens’ knowledge about these issues is accurate... 1) Our study... thus **cannot be directly generalized** to low-income nations nor extrapolated into the long-term future. 2)...estimates **may not be generalisable** to women in other to women in other ancestry groups... 1)...direct and indirect readout during the transition from search to recognition mode is **poorly** understood. 2) It will be **quite** certain that they belong to the subpopulation of gender heterogenous... 1) The identity of C34 modification in... is **not clear**. 2) There was **no consistent** evidence for a causal relationship between age at menarche and lifetime number of sexual partners... 1) **We believe that** there are good reasons for voters to care about... 2) **To our knowledge**, this is the first study to provide global... 1) This belief **seems to be** typical for moderate religiosity. 2) Better performance **seems to be linked** to life satisfaction... 1) **In contrast to previous studies**, our results did not show a significant effect... 2) **On the one hand**, some researchers argue that the use of technology in the classroom can enhance... \\ \hline \end{tabular} \end{table} Table 3. SU Pattern Groups and examples of annotated sentences with SU spans written in bold

2310.11781

Blind estimation of audio effects using an auto-encoder approach and differentiable digital signal processing

Blind Estimation of Audio Effects (BE-AFX) aims at estimating the Audio Effects (AFXs) applied to an original, unprocessed audio sample solely based on the processed audio sample. To train such a system traditional approaches optimize a loss between ground truth and estimated AFX parameters. This involves knowing the exact implementation of the AFXs used for the process. In this work, we propose an alternative solution that eliminates the requirement for knowing this implementation. Instead, we introduce an auto-encoder approach, which optimizes an audio quality metric. We explore, suggest, and compare various implementations of commonly used mastering AFXs, using differential signal processing or neural approximations. Our findings demonstrate that our auto-encoder approach yields superior estimates of the audio quality produced by a chain of AFXs, compared to the traditional parameter-based approach, even if the latter provides a more accurate parameter estimation.

Côme Peladeau, Geoffroy Peeters

2023-10-18T08:20:54Z

http://arxiv.org/abs/2310.11781v2

Blind estimation of audio effects using an auto-encoder approach and differentiable signal processing ###### Abstract Blind Estimation of Audio Effects (BE-AFX) aims at estimating the Audio Effects (AFXs) applied to an original, unprocessed audio sample solely based on the processed audio sample. To train such a system traditional approaches optimize a loss between ground truth and estimated AFX parameters. This involves knowing the exact implementation of the AFXs used for the process. In this work, we propose an alternative solution that eliminates the requirement for knowing this implementation. Instead, we introduce an auto-encoder approach, which optimizes an audio quality metric. We explore, suggest, and compare various implementations of commonly used mastering AFXs, using differential signal processing or neural approximations. Our findings demonstrate that our auto-encoder approach yields superior estimates of the audio quality produced by a chain of AFXs, compared to the traditional parameter-based approach, even if the latter provides a more accurate parameter estimation. ## 1 Introduction Audio Effects (AFXs) play an essential role in the music production. They are used during mixing to sculpt sounds for artistic purposes or context requirements (such as when a sound needs to be mixed with others). They are used during mastering, the final stage of production, to improve the clarity of a given mix, adapt it for a given media (such as Vynil or streaming), or harmonize it with other tracks. For these reasons, its automatization has been the subject of several softwares1 which allows learning the mastering of a given track to apply it to new dry mixes. However, those only focus on the equalization. In this work, we study the generalization to other common mastering AFXs. Footnote 1: such as Izotope Ozone 11 or FabFilter Pro Q 3 Blind Estimation of Audio Effects (BE-AFX) aims at estimating the Audio Effects (AFXs) applied to an original, unprocessed (dry) audio sample \(\mathbf{x}\) solely based on the observation of the processed (wet) audio sample \(\mathbf{y}\). This estimation takes the form of the AFXs and their parameters \(\mathbf{p}\). ### Related works. For long BE-AFX techniques has been based on explicit rules and assumptions. For example, Avila et al. [1] proposed to estimate the curve of a memoryless non-linear distortion by assuming that the unprocessed signal has the statistics of a Gaussian white noise. However, nowadays, most BE-AFX approaches rely on training neural networks. Indeed, following SincNet [2] and DDSP [3], modeling audio processes as differential processes has allowed developing differentiable AFXs as specialized neural networks layers with interpretable parameters [4, 5, 6]. Because they are differentiable, they can be integrated transparently in a neural network. Since then, differentiable AFXs have been used for many tasks: automatic mixing and mastering [7, 8], production style transfer [6] or estimation of audio effects [9]. In the case of BE-AFX, neural networks are usually trained to minimize a loss function that aims at reconstructing the AFX ground truth parameters [10, 11]. However, as we will highlight in this work, a parameter distance does not translate well to a perceptual distance between audio effects. This is why we will propose the use of an audio distance here. Estimation of audio effects with an audio loss function and differentiable audio effects has already been investigated. For example, Colonel et al. [12] used it for non-linear distortion using a differentiable Wiener-Hammerstein model and also in [9] for a complete mixing setting. However, in both cases, their approaches require paired \(\mathbf{x}\) and \(\mathbf{y}\) data for the estimation, i.e. they did not perform the blind estimation. In this work, we perform blind estimation, i.e. we aim at estimating the AFXs applied to \(\mathbf{x}\) using only the knowledge of \(\mathbf{y}\). ### Proposal. To solve the BE-AFX problem, we propose an auto-encoder approach which is illustrated in Figure 1. In the left part, we construct synthetic processed mixes by applying a set of (synthesis) audio effects \(\{e^{s}\}\) with known parameters \(\mathbf{p}\) to an unprocessed mix \(\mathbf{x}\). The results are our ground-truth processed mixes \(\mathbf{y}\). Using only \(\mathbf{y}\), an analysis network \(f^{a}\) then estimates the set of parameters \(\hat{\mathbf{p}}\) to be used to process \(\mathbf{x}\) with (analysis) audio effects \(\{e^{a}\}\) to produce an estimated audio sample \(\hat{\mathbf{y}}\). The analysis network \(f^{a}\) is trained to minimize an audio loss function between \(\hat{\mathbf{y}}\) and \(\mathbf{y}\) so that \(\hat{\mathbf{y}}\approx\mathbf{y}\). It therefore closely matches the formulation of an auto-encoder. Doing so, when \(\{e^{a}\}\)=\(\{e^{s}\}\), \(f^{a}\) implicitly learns to replicate the parameters \(\mathbf{p}\) given only \(\mathbf{y}\). When \(\{e^{a}\}\neq\{e^{s}\}\), \(f^{a}\) learns parameters to be used for \(\{e^{a}\}\) such that the effect of the analysis chain sounds similar to the synthesis chain. ### Paper organization. To be able to estimate \(\mathbf{p}\) using this auto-encoder, we should be able to "differentiate" the audio effects \(\{e^{a}\}\) (i.e. compute the derivative of their outputs \(\hat{\mathbf{y}}\) w.r.t. their inputs \(\hat{\mathbf{p}}\)). We therefore discuss various implementations of the audio effects in part 2.1. To be able to estimate \(\mathbf{p}\) we should define an architecture for the analysis network \(f^{a}\). We therefore discuss various possible architectures in part 2.2. During evaluation (part 3), we first decide for each type of effect what is the best implementation \(e^{a}\) (among those of 2.1) and architecture of \(f^{a}\) (among those of 2.2) to reconstruct \(\mathbf{y}\). We then compare our proposed approach (audio reconstruction \(\hat{\mathbf{y}}\approx\mathbf{y}\)) to the previously proposed approach (parameter reconstruction \(\hat{\mathbf{q}}\approx\mathbf{q}\)). Finally, we evaluate the joint estimation of the whole AFX chain defined as the succession of an equalizer, a compressor, and a clipper. We conclude in part 4 and propose future directions. To ensure replicability, we provide the code of this study.2 Footnote 2: [https://github.com/](https://github.com/) peladeaucome/ ICASSP-2024-BEAFX-using-DDSP.git ## 2 Proposal ### Audio effects In this work, we only consider the 3 following AFXs commonly used for mastering: equalizer, dynamic range compressor, and clipper. We distinguish their implementation for synthesis \(\{e^{s}\}\) and for analysis \(\{e^{a}\}\). \(\{e^{s}\}\) is the implementation of the effects that have been used to create the observed master \(\mathbf{y}\). In a real scenario, this implementation is unknown. \(\{e^{a}\}\) is the implementation we use in our model to (a) predict the parameters \(\hat{\mathbf{p}}\) of the effects or (b) replicate the resulting process of the mastering. To perform (a) (comparing the estimated \(\hat{\mathbf{p}}\) to the ground-truth \(\mathbf{p}\)) the implementation of the effect in \(\{e^{s}\}\) and \(\{e^{a}\}\) should be similar. To perform (a) and (b), the implementation in \(\{e^{a}\}\) should be differentiable (in order to be able to estimate the parameters) or, if not, we will have to use neural networks to approximate the effects.. We now detail the implementation of the three AFXs for synthesis and analysis and list them in Table 1. The audio is normalized to \(0\,\mathrm{dBFS}\) before each effect. #### 2.1.1 Equalizer For synthesis, we use a 5-band parametric equalizer: 1 low-shelf, 3 peak, 1 high-shelf. \begin{table} \begin{tabular}{l|l|c|c} \hline \hline Effect & Implementation & Synthesis & Analysis \\ \hline **Equalizer** & Parametric & \(\surd\) & \(\surd\) \\ & Graphic & & \(\surd\) \\ \hline **Compressor** & DSP & \(\surd\) & \\ & Simplified DSP & & \(\surd\) \\ & NP & & \(\surd\) \\ & Hybrid NP & & \(\surd\) \\ \hline **Clipper** & Parametric & \(\surd\) & \(\surd\) \\ & Taylor & & \(\surd\) \\ & Chebyshev & & \(\surd\) \\ \hline \hline \end{tabular} \end{table} Table 1: Considered audio effects and their implementations. or a 10 band graphic equalizer. Each band of a graphic equalizer has a bandwidth of 2 octaves [13]. Each parametric band has 3 parameters: center frequency, gain, and quality factor. Each band of the graphic equalizer has only 1 parameter: the gain. Frequencies of parametric bands are logarithmic parameters, gains (in dB) and quality factors are linear. Differentiable filters are implemented in the frequency domain as we find the time-aliasing error small enough for training a neural network. #### 2.1.2 Dynamic range compressor **For synthesis**, we use the DSP compressor proposed in [14]. It has 5 parameters: threshold, ratio, attack time, release time, and knee width. **For analysis**, we either use a simplified DSP compressor or a Neural Proxy (NP). The simplified DSP compressor is the DSP compressor of [14] but with the attack and release time linked, has proposed by [6] to reduce the computation time. The NP compressor [15] is trained to approximate a DSP compressor3. It uses a TCN conditioned with FiLM [16] layers. In [15] the NP directly outputs \(\hat{\mathbf{y}}\). In our case, we use the same TCN architecture but propose to replace its output activation by a sigmoid such that it provides the compressor gain factor \(\mathbf{g}\) to be applied over time \(n\): \(\hat{y}[n]=g[n]\cdot x[n]\). 4 Footnote 3: To train it, we first process a set of \(\mathbf{x}\) with the DSP compressor using known parameters \(\mathbf{p}\). The output provides ground-truths \(\mathbf{y}\). We then train the NP compressor conditioned with the same parameters \(\mathbf{p}\) such that its output \(\hat{\mathbf{y}}\approx\mathbf{y}\). Footnote 4: We found by experiment that this modification allows to largely reduce the number of parameters (number of TCN channels) with equivalent performances. With 8 channels, our causal model with a receptive field of 3 \(s\) duration has a test mean average error (MAE) of 0.0060 while the TCN from [15] has a test MAE of 0.050. Once trained, the NP compressor, being differentiable, can be inserted in the analysis chain \(\{e^{a}\}\) to train the analysis network \(f^{a}\) and obtain its compressor parameters \(\hat{\mathbf{p}}\). We can of course use \(\hat{\mathbf{p}}\) to process \(\mathbf{x}\) with the NP compressor but also use \(\hat{\mathbf{p}}\) to process \(\mathbf{x}\) with the DSP compressor. We name the latter "hybrid NP compressor". Since it is not differentiable, we only use it during validation and testing (not during training). It has already been used in [6]. The compressors' ratio and time parameters are logarithmic while their threshold and knee (both in dB) are linear. #### 2.1.3 Clipper We propose 3 implementations of the clipper: parametric (both for synthesis and analysis), Taylor, and Chebyshev (only for analysis). The **parametric** clipper is defined by the function \(f\) defined in (1) with hardness parameter \(h\) which blends between \(\tanh\), cubic and hard clipping: \[f(x,h)=\begin{cases}(1-h)\tanh(x)+hf_{\text{cubic}}(x),&h\in[0;1],\\ (2-h)f_{\text{cubic}}(x)+(h-1)f_{\text{hard}}(x),&h\in[1;2].\end{cases} \tag{1}\] with : \[f_{\text{hard}}(x)=\max(-1,\min(1,x)) \tag{2}\] \[f_{\text{cubic}}(x)=\begin{cases}x+4x^{3}/27,&x\in[-\frac{2}{3} ;\frac{2}{3}],\\ \text{sign}(x),&|x|>\frac{2}{3}.\end{cases} \tag{3}\] The effect used for synthesis is constructed with the following parameters: gain \(g\) (in dB), offset \(o\), and hardness \(h\). \[y[n]=\left(f(g\cdot x[n]+o,h)-f(o,h)\right)/g \tag{4}\] We also use two other memory-less models. Both have been proposed for memory-less distortion identification. The **Taylor** clipper is inspired by Taylor Figure 1: Proposed auto-encoder approach for Blind Estimation of Audio Effects (BE-AFX). series expansions [1]: \[y[n]=\sum_{h=0}^{H-1}g_{h}x[n]^{h} \tag{5}\] The **Chebyshev** clipper is inspired by Chebyshev's polynomials as used for non-linear audio effect identification [17]: \[y[n]=\sum_{h=0}^{H-1}g_{h}T_{h}(y[n]). \tag{6}\] with \(g_{h}\in[-1;1]\) being the effect's parameters and : \[\begin{split} T_{n}(x)&=2xT_{n-1}(x)-T_{n-2}(x), \qquad\forall n\geq 2,\\ T_{0}(x)&=1,\qquad T_{1}(x)=x.\end{split} \tag{7}\] In both cases, the parameters to be estimated are the \(\{g_{h}\}\) and we set \(H=24\). All clipper parameters are linear. #### 2.1.4 Parameter ranges All AFX parameters, \(p_{c}/\hat{p}_{c}\), are derived from "normalized" AFX parameters, \(q_{c}/\hat{q}_{c}\in[0,1]\). Linear parameters (see above) are derived from \(q_{c}/\hat{q}_{c}\) using an affine transformation: \[p_{c}=(p_{c,\max}-p_{c,\min})q_{c}+p_{c,\min}. \tag{8}\] Logarithmic parameters (see above) are derived from \(q_{c}/\hat{q}_{c}\) using an exponential transformation: \[p_{c}=e^{(\log(p_{c,\max})-\log(p_{c,\min}))q_{c}}p_{c,\min}. \tag{9}\] In all cases, \(p_{c,\min}/p_{c,\max}\) are the extreme values of the range of parameter \(c\). ### Analysis network \(f^{a}\) The analysis network is divided into two parts: 1. An **encoder**; which outputs a time invariant embedding. We compare 3 implementations of the encoder described below. 2. A MLP with 4 layers of size 2048, 1024, 512, and \(C\) where \(C\) is the total number of parameters \(\hat{\mathbf{p}}\) of the effect chain \(\{e^{a}\}\). Each hidden layer is followed by a Batchnorm1d and a PReLU. The output layer, which estimates normalized parameters \(\hat{\mathbf{q}}\), is followed by a sigmoid. For the encoder, we compared three architectures proposed in the literature: * the Music Effects Encoder proposed by [18]. It consists of a cascade of residual 1D convolutional layers, * a Timbre Encoder inspired by [19]. It consists of a single 2d convolution layer with multiple sizes of filters. The conv2d is applied on the CQT [20] of the signal, * a Time+Frequency Encoder inspired by [21]. It consists of two 2d convolutional nets, one focusing on highlighting temporal motifs, the second frequency motifs. The network's input is the CQT of the signal. MEE has 88M parameters, TE 2.8M, and TFE 3.4M. ## 3 Evaluation ### Dataset For training, validation and testing we used the mix files of MUSDB18 [22]. From those, we extracted randomly clips of 10 s duration. Those are then converted to mono and peak-normalized to 0 dBFS. For each, we randomly pick the normalized parameters \(\mathbf{q}\sim\mathcal{U}(0,1)\), convert them to \(\mathbf{p}\) and apply them to the clip. We used the training, validation and testing splits proposed by MUSDB18 [22]. ### Training Each model \(f^{a}\) is trained using the ADAM algorithm with a learning rate of \(10^{-4}\) and a batch size of 16 during a maximum of 400 epochs, where a single epoch is defined as 430 training examples (5 from each song of the training subset). The learning rate is scheduled to decrease by a factor of 10 when the best validation score has not been improved for 30 epochs. Training stops after 150 epochs without improvement. To ensure the reliability of computed scores the validation is run 5 times and the test 10 times. In the following, we compare 2 approaches for training \(f^{a}\): **Audio reconstruction \(\hat{\mathbf{y}}\approx\mathbf{y}\)**: (our proposal): we minimize the \(\ell^{1}\) norm between the log-magnitude Mel-spectrograms of \(\mathbf{y}\) and \(\hat{\mathbf{y}}\)[23]: \[\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}=\left\|\log(\left| \text{Mel}(\hat{\mathbf{y}}|)-\log(\left|\text{Mel}(\mathbf{y}|\right)\right| _{1}.\right. \tag{10}\] **Parameter reconstruction \(\hat{\mathbf{q}}\approx\mathbf{q}\)** (previously proposed approach): we minimize the \(\ell^{2}\) norm between \(\hat{\mathbf{q}}\) and \(\mathbf{q}\): \[\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}=\frac{1}{C}\sum_{c=0}^{C-1}(\hat{q}_{c }-q_{c})^{2}. \tag{11}\] ### Performance metrics. For evaluation, we compute the following metrics: * \(\text{MSE}_{\hat{\mathbf{y}},\mathbf{y}}\): the MSE between \(\hat{\mathbf{y}}\) and \(\mathbf{y}\) * \(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\)as defined above * \(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\): the MSE between \(\hat{\mathbf{q}}\) and \(\mathbf{q}\) To make audio loss and metrics independent of sound level, we normalize \(\mathbf{y}\) and \(\hat{\mathbf{y}}\) by their respective RMS values. ### Results #### 3.4.1 Single effect estimation. For each type of effect we first decide what is the best implementation (among those of 2.1) and architecture (among those of 2.2) to reconstruct \(\mathbf{y}\). For each, we also indicate: - **Random**\(\hat{\mathbf{q}}\): the results obtained with a random choice of \(\hat{\mathbf{q}}\) (rather than the estimated one), - \(\mathcal{L}(\mathbf{x},\mathbf{y})\): the value of the loss when comparing the input \(\mathbf{x}\) to the output \(\mathbf{y}\). For the **equalizer** (Table 2), Parametric and Graphic provide similar results. Since \(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\) indicates the difference between spectras, it is more suited to measure the performances of an EQ than \(\text{MSE}_{\hat{\mathbf{y}},\mathbf{y}}\). We therefore focus on \(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\) and conclude that the best (0.32) configuration is to use the Parametric implementation for \(\{e^{a}\}\) and TFE for \(f^{a}\). For the **compressor** (Table 3), the best (0.011, 0.076) configuration is to use the Hybrid NP for \(\{e^{a}\}\) and use MEE for \(f^{a}\). As a reminder, the Hybrid NP compressor uses the NP compressor to estimate \(\hat{\mathbf{p}}\) but the DSP compressor (the same used for synthesis) to get \(\hat{\mathbf{y}}\). This works better than using the NP compressor (0.014, 0.098) or the simplified DSP compressor (0.041, 0.16) This is due to the fact that the latter links the attack and release time parameters which might be too restrictive. The fact that the Hybrid NP works better indicates that our proxy performs well enough for the task of estimated parameters usable for the DSP Compressor. #### 3.4.2 Training method comparison. We now compare our proposed training method (based on audio reconstruction \(\hat{\mathbf{y}}\approx\mathbf{y}\)) to the previously proposed one (based on parameter reconstruction \(\hat{\mathbf{q}}\approx\mathbf{q}\)). Results are indicated in Table 5. For each single effect, we use the best configuration found above: \(f^{a}\)=TFE for equalizer, MEE for compression and clipping. For **equalization**, in terms of audio quality (\(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\)), the network trained to minimize \(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\) outperforms (0.32) the one that minimizes \(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\) (0.40). But in terms of parameter estimation (\(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\)) minimizing directly \(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\) leads to better results (0.072). For **compression** and **clipping**, training by minimizing the parameter distance (\(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\)) leads to better results both in terms of audio quality (\(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\)=0.069, 0.064) and parameter estimation (\(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\)=0.069, 0.028). #### 3.4.3 Effects chain estimation We finally evaluate the estimation of the whole **chain** of effect (equalizer+compressor+clipper). In this case, we use \(f^{a}\)=TFE for all. As far as concerned audio quality we see that our approach (minimizing \(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\)) leads to the best results: \(\text{MSE}_{\hat{\mathbf{y}},\mathbf{y}}\)=0.31 and \(\mathcal{L}_{\hat{\mathbf{y}},\mathbf{y}}^{\text{Mel}}\)=0.40. However, as can be predicted, minimizing directly \(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\) leads to better estimation of the parameters: \(\text{MSE}_{\hat{\mathbf{q}},\mathbf{q}}\)=0.072. These contrasting outcomes underscore that achieving accurate parameter estimation (\(\hat{\mathbf{p}}\approx\mathbf{p}\)) does not guarantee high audio quality (\(\hat{\mathbf{y}}\approx\mathbf{y}\)). While our approach may not yield the best parameter estimation, it does yield the best audio transform estimation. ## 4 Conclusion In this work, we proposed an auto-encoder approach for Blind Estimation of Audio Effects. Given only wet (processed) audio signals, we train a neural network to estimate AFX parameters such that when used for effects applied to a dry (unprocessed) signal it approximates the wet signal. This allows training a network using real dry/wet data pairs without knowing the exact effect implementation. We show that our audio-based method better replicates the audio quality of the mastering process than the previous parameter-based method. Future works will focus on including other important mastering effects in the chain and testing their estimation on real mastered music productions.

2305.04884

Predicting the Price Movement of Cryptocurrencies Using Linear Law-based Transformation

The aim of this paper is to investigate the effect of a novel method called linear law-based feature space transformation (LLT) on the accuracy of intraday price movement prediction of cryptocurrencies. To do this, the 1-minute interval price data of Bitcoin, Ethereum, Binance Coin, and Ripple between 1 January 2019 and 22 October 2022 were collected from the Binance cryptocurrency exchange. Then, 14-hour nonoverlapping time windows were applied to sample the price data. The classification was based on the first 12 hours, and the two classes were determined based on whether the closing price rose or fell after the next 2 hours. These price data were first transformed with the LLT, then they were classified by traditional machine learning algorithms with 10-fold cross-validation. Based on the results, LLT greatly increased the accuracy for all cryptocurrencies, which emphasizes the potential of the LLT algorithm in predicting price movements.

Marcell T. Kurbucz, Péter Pósfay, Antal Jakovác

2023-04-27T15:04:08Z

http://arxiv.org/abs/2305.04884v1

# Predicting the Price Movement of Cryptocurrencies Using Linear Law-based Transformation ###### Abstract The aim of this paper is to investigate the effect of a novel method called linear law-based feature space transformation (LLT) on the accuracy of intraday price movement prediction of cryptocurrencies. To do this, the 1-minute interval price data of Bitcoin, Ethereum, Binance Coin, and Ripple between 1 January 2019 and 22 October 2022 were collected from the Binance cryptocurrency exchange. Then, 14-hour nonoverlapping time windows were applied to sample the price data. The classification was based on the first 12 hours, and the two classes were determined based on whether the closing price rose or fell after the next 2 hours. These price data were first transformed with the LLT, then they were classified by traditional machine learning algorithms with 10-fold cross-validation. Based on the results, LLT greatly increased the accuracy for all cryptocurrencies, which emphasizes the potential of the LLT algorithm in predicting price movements. keywords: Time series classification, Linear law, Feature space transformation, Feature engineering, Cryptocurrency, Artificial intelligence + Footnote †: journal: arXiv ## 1 Introduction The advent of cryptocurrencies has revolutionized the world of finance and investment.1 Cryptocurrencies, such as Bitcoin and Ethereum, are decentralized digital assets that operate on blockchain technology. Contrary to traditional financial systems, this technology ignores financial intermediaries and provides a public ledger that records all transactions. Predicting the price movement of these currencies creates a number of challenges, especially due to the extremely high volatility of their exchange prices (Mahayana, Madyaratri & Fadhl'Abbas, 2022). As reflected by current market dynamics, the absence of government regulation and oversight creates obstacles in mitigating the high volatility and consequential losses that may arise (Dag, Dag, Asilkalkan, Simsek & Delen, 2023). For this reason, traders and investors must use appropriate price prediction methods that consider the extreme behavior of cryptocurrency markets (Mba & Mwambi, 2020). In recent years, several studies have been conducted on the classification of intraday price movements of cryptocurrencies. For instance, El-Berawi, Belal & Abd Ellatif (2021) proposed a deep learning model for forecasting and classifying the price of various cryptocurrencies based on a multiple-input architecture. To identify the relevant variables, they applied a two-stage adaptive feature selection procedure. Mahayana et al. (2022) predicted the price movement of Bitcoin's exchange rate using a tree-based classification algorithm with the gradient boosting framework. In Zhou, Song, Xiao & Ren (2023), price movements were predicted by a support vector machine algorithm based on historical trading data, sentiment indicators, and daily Google Trends. Additionally, a data-driven tree augmented naive Bayes methodology was proposed by Dag et al. (2023) that can be used for identifying the most important factors influencing the price movements of Bitcoin. Other works focus on the predictive power of the features obtained from the transaction network of various cryptocurrencies (Abay, Akcora, Gel, Kantarcioglu, Islambekov, Tian & Thuraisingham, 2019; Akcora, Dey, Gel & Kantarcioglu, 2018; Akcora, Dixon, Gel & Kantarcioglu, 2018; Dey, Akcora, Gel & Kantarcioglu, 2020; Kurbucz, 2019). The recently published algorithm called linear law-based feature space transformation (LLT) (Kurbucz, Posfay & Jakovac, 2022) can be applied to facilitate uni- and multivariate time series classification tasks. The aim of this paper is to investigate the effect of LLT on the accuracy of intraday price movement prediction of various cryptocurrencies. To do this, the 1-minute interval price data of Bitcoin, Ethereum, Binance Coin, and Ripple between 1 January 2019 and 22 October 2022 were collected from the Binance cryptocurrency exchange. Then, 14-hour nonoverlapping time windows were applied to sample the price data. The classification was based on the first 12 hours, and the two classes were determined based on whether the closing price rose or fell after the next 2 hours. These price data were first transformed with the LLT, and then they were classified by traditional machine learning algorithms with 10-fold cross-validation and Bayesian hyperparameter optimization. The rest of this paper is organized as follows. Section 2 introduces the employed dataset, the classification task, the LLT algorithm, and the applied software and its settings. Section 3 compares and discusses the classification outcomes obtained with and without the LLT. Finally, conclusions and suggested future research directions are provided in Section 3. ## 2 Data and methodology ### Cryptocurrency dataset This study is based on the 1-minute interval price data of Bitcoin (BTC), Ethereum (ETH), Binance Coin (BNB), and Ripple (XRP) between 1 January 2019 and 22 October 2022. These data were collected from the Binance cryptocurrency exchange by the CryptoDataDownload website ([https://www.cryptodatadowmload.com/](https://www.cryptodatadowmload.com/), retrieved: 19 April 2023). For each cryptocurrency, the obtained dataset contains the opening, closing, high, and low prices, as well as the transaction volume and the volume of Tether (USDT): i.e., the volume of the stablecoin that prices were measured against. Hereinafter, these variables are called the initial features of cryptocurrencies. ### Classification task To define the classification task, we first generated instances by sampling the price datasets based on 14-hour, nonoverlapping time windows. The input data (\(\mathbf{X}\)) of the classification task were the 720 (\(k\)) consecutive values of the 6 (\(m\)) initial features, measured in the first 12 hours. The output variable contains two classes defined by whether the closing price rose or fell after the next 2 hours. After we balanced the number of instances related to the two classes, this sampling procedure resulted in approximately 1 680 (\(n\)) instances in each cryptocurrency: 840 per class. The applied sampling procedure is illustrated in Fig. 1. Formally, input data are denoted by \(\mathbf{X}=\{\mathbf{X}_{t}\mid t\in\{1,2,\ldots,k\}\}\), where \(t\) represents the observation times. The internal structure of the input data is \(\mathbf{X}_{t}=\{\mathbf{x}_{t}^{i,j}\mid i\in\{1,2,\ldots,n\},\ j\in\{1,2,\ldots,m\}\}\), where \(i\) indicates the instances and \(j\) identifies the different initial features belonging to a given instance. The output is a vector \(\mathbf{y}\in\{0,1\}\) identifying the classes of instances (\(\mathbf{y}=\{y^{i}\in\mathbb{R}\mid i\in\{1,2,\ldots,n\}\}\)). The goal of the classification task is to predict the \(\mathbf{y}\) values (classes) from the \(\mathbf{X}\) input data. ### Price movement prediction Price movement prediction is based on the combination of the LLT with traditional machine learning algorithms.2 Footnote 2: The concept of linear laws is detailed in Jakovác (2021) and Jakovác, Kurbucz & Pósfay (2022). The complete mathematical formulation of LLT can be found in Kurbucz et al. (2022). LLT first separates the (\(tr\in\{1,2,\ldots,\tau\}\)) and tests (\(te\in\{\tau+1,\tau+2,\ldots,n\}\)) the sets of instances.3 Then, it identifies the governing patterns (linear laws) of each input sequence in the training set. To this end, we perform the \(l^{\text{th}}\) order (\(l\in\mathbb{Z}^{+}\) and \(l<k\)) time-delay embedding (Takens, 1981) of these series as follows: Footnote 3: Instances are split in such a way that their classes are balanced in the two sets. For transparency, we assume that the original arrangement of the instances in the dataset satisfies this condition for the \(tr\) and \(te\) sets. \[\mathbf{A}^{tr,j}=\begin{pmatrix}\mathbf{x}_{1}^{tr,j}&\mathbf{x}_{2}^{tr,j}&\cdots&\mathbf{x} _{l}^{tr,j}\\ \mathbf{x}_{2}^{tr,j}&\ddots&\ddots&\vdots\\ \vdots&\ddots&\ddots&\vdots\\ \mathbf{x}_{k-l}^{tr,j}&\cdots&\cdots&\mathbf{x}_{k}^{tr,j}\end{pmatrix}, \tag{1}\] for all \(tr\) and \(j\). Then, symmetric \(l\times l\) matrices are generated as \(\mathbf{S}^{tr,j}=\mathbf{A}^{tr,j\intercal}\mathbf{A}^{tr,j}\). The coefficients (\(\mathbf{v}^{tr,j}\)) that satisfy \(\mathbf{S}^{tr,j}\mathbf{v}^{tr,j}\approx\mathbf{0}\) are called the linear law of the input series \(\mathbf{x}_{t}^{tr,j}\). These laws are grouped by input series and classes as follows: \(\mathbf{V}^{j}=\{\mathbf{V}_{0}^{j},\mathbf{V}_{1}^{j}\}\), where \(\mathbf{V}_{0}^{j}\) and \(\mathbf{V}_{1}^{j}\) denote the laws of the training set related to the initial feature \(j\) and the two classes. Figure 1: Applied sampling procedure The next step involves calculating \(\mathbf{S}^{te,j}\) matrices from the test instance's initial features and left multiplying them by the \(\mathbf{V}^{j}\) matrices obtained from the same initial features of the training instances \((\mathbf{S}^{r+1,1}\mathbf{V}^{1},\mathbf{S}^{r+1,2}\mathbf{V}^{2},\ldots,\mathbf{S}^{n,m}\mathbf{V}^{m})\). The product of these matrices gives an estimate of whether the test data belong to the same class as the training instance based on the presence of close-to-null vectors with a small variance in the resulting matrix. The final step reduces the dimensions of the resulting matrices by selecting columns with the smallest variance and/or absolute mean from the \(\mathbf{S}^{te,j}\mathbf{V}^{j}\) matrices for each class. As a result of this step, the transformed feature space of the test set has \(((n-\tau)l)\times(mc+1)\) dimensions combined with the output variable. After the feature space transformation, test instances are classified by decision tree (DT) (Li, Yan & Wu, 2019), k-nearest neighbor (KNN) (Mello, Carvalho, Lyra & Pedreira, 2019), support vector machine (SVM) (Al Tobi, Bevan, Wallace, Harrison & Ramachandran, 2019; Raghu, Sriraam, Temel, Rao, Hegde & Kubben, 2019), and classifier ensemble (ENS) (Oza & Tumer, 2008) algorithms with cross-validation and Bayesian hyperparameter optimization. ### Applied software and settings Datasets were transformed using the LLT R package (version: 0.1.0) (Kurbucz, Posfai & Jakovac, 2023a) with the following settings:4 Footnote 4: The LLT R package is publicly available on GitHub (Kurbucz, Posfai & Jakovac, 2023b). * test_ratio = 0.25: 25% of the instances were included in the test set. The training and test sets contained approximately 1284 (\(\tau\)) and 428 (\(n-\tau\)) independent instances for each cryptocurrency: 642 and 214 from both classes, respectively. * dim = 10: It defined the \(l\) parameter (\(l=10\)). * lag = 11: The successive row lag of the \(\mathbf{A}\) matrix is set to 11. That is, since \(l=10\), \(\mathbf{A}_{1,10}^{tr,j}=\mathbf{x}_{10}^{tr,j}\), \(\mathbf{A}_{2,1}^{tr,j}=\mathbf{x}_{11}^{tr,j}\), \(\mathbf{A}_{2,2}^{tr,j}=\mathbf{x}_{12}^{tr,j}\), and so on. * select = "var": As the last step of the LLT, the column vectors with the smallest variance were selected from the \(\mathbf{S}^{te,j}\mathbf{V}^{j}\) matrices for each class. * seed = 12345: For the reproducibility of the results, the random number generation was fixed. The original and transformed classification tasks were solved in the Classification Learner App of MATLAB.5 For each classifier, 10-fold cross-validation and 300-step Bayesian hyperparameter optimization were applied. Footnote 5: More information can be found at [https://www.mathworks.com/help/stats/classificationlearner-app.html](https://www.mathworks.com/help/stats/classificationlearner-app.html), retrieved: 19 April 2023). ## 3 Results and discussion The results of the original and transformed classification tasks are presented in Table 1.6 Footnote 6: Related confusion matrices and the details of hyperparameter optimization can be found in the Supplementary material. As shown in Table 1, LLT greatly increased the accuracy for all classifiers and cryptocurrencies. In the case of the original feature space, the SVM algorithm achieved the best average performance with an accuracy of 56.9%. After the transformation, the KNN algorithm became the most accurate classifier, with an average accuracy of 81.3%. This result is consistent with our previous work (Kurbucz et al., 2022), in which we tested the same classifiers on human activity recognition data and found that the combination of LLT and KNN achieved the highest accuracy and shortest computation time, outperforming even state-of-the-art methods. Since LLT has a low calculation requirement, it can effectively handle feature spaces with much higher dimensions than previously used methods. Applying additional features, such as sentiment indicators and daily Google Trends (Zhou et al., 2023), can result in even higher classification accuracy. ## 4 Conclusions and future works This paper investigated the effect of LLT on the accuracy of intraday price movement prediction of cryptocurrencies. To do this, the 1-minute interval price data of Bitcoin, Ethereum, Binance Coin, and Ripple between 1 January 2019 and 22 October 2022 were collected from the Binance cryptocurrency exchange. Then, 14-hour nonoverlapping time windows were applied to sample the price data. The classification was based on the first 12 hours, and the two classes were determined based on whether the closing price rose or fell after the next 2 hours. These price data were first transformed with the LLT and then classified by traditional machine learning algorithms with 10-fold cross-validation. Based on the results, LLT greatly increased the accuracy regardless of the type of cryptocurrency and classification algorithm. While the SVM algorithm achieved the best results for the original feature space, after the transformation, we achieved the highest average accuracy with the KNN classifier. By using the LLT algorithm, we managed to increase the best average accuracy from 56.9% to 81.3%. These results not only emphasize the potential of the LLT algorithm in price movement prediction but also provide further research directions. Future works could focus on the classification performance of the LLT-KNN algorithm pair in high-dimensional feature spaces. Other research could extend the LLT algorithm with the adaptive selection of the laws used during the transformation. Finally, due to its low computational cost, LLT could also be useful in the field of portfolio optimization, which would require further investigation. ## Data availability The applied price data were collected from the Binance cryptocurrency exchange by the CryptoDataDownload website ([https://www.cryptodatadownload.com/](https://www.cryptodatadownload.com/), retrieved: 19 April 2023). ## Supplementary material The supplementary material contains the confusion matrices related to Table 1 and the results of hyperparameter optimization applied during the calculations. ## Acknowledgements Project no. PD142593 was implemented with the support provided by the Ministry of Culture and Innovation of Hungary from the National Research, Development, and Innovation Fund, financed under the PD_22 "OTKA" funding scheme. A.J. received support from the Hungarian Scientific Research Fund (OTKA/NRDI Office) under contract number K123815. The research was supported by the Ministry of Innovation and Technology NRDI Office within the framework of the MILAB Artificial Intelligence National Laboratory Program.

2307.04025

Global Lipschitz stability for an inverse coefficient problem for a mean field game system

For an inverse coefficient problem of determining a state-varying factor in the corresponding Hamiltonian for a mean field game system, we prove the global Lipschitz stability by spatial data of one component and interior data in an arbitrarily chosen subdomain over a time interval. The proof is based on Carleman estimates with different norms.

Oleg Imanuvilov, Masahiro Yamamoto

2023-07-08T18:12:27Z

http://arxiv.org/abs/2307.04025v1

# Global Lipschitz stability for an inverse coefficient problem for a mean field game system ###### Abstract For an inverse coefficient problem of determining a state-varying factor in the corresponding Hamiltonian for a mean field game system, we prove the global Lipschitz stability by spatial data of one component and interior data in an arbitrarily chosen subdomain over a time interval. The proof is based on Carleman estimates with different norms. \({}^{1}\) Department of Mathematics, Colorado State University, 101 Weber Building, Fort Collins CO 80523-1874, USA e-mail: oleg@math.colostate.edu \({}^{2}\) Graduate School of Mathematical Sciences, The University of Tokyo, Komaba, Meguro, Tokyo 153-8914, Japan e-mail: myama@ms.u-tokyo.ac.jp ## 1 Introduction Let \(\Omega\subset\mathbb{R}^{d}\) be a bounded domain with smooth boundary \(\partial\Omega\), and let \(T>0\), and \(Q:=\Omega\times(0,T)\). In article concerned a system of the mean field game: \[\left\{\begin{array}{ll}&\partial_{t}u(x,t)+\Delta u(x,t)-\frac{1}{2}p(x)| \nabla u(x,t)|^{2}-c_{0}(x)v(x,t)=0\quad\mbox{in }Q,\\ &\partial_{t}v(x,t)-\Delta v(x,t)-\mbox{div}\left(p(x)v(x,t)\nabla u(x,t) \right)=0\quad\mbox{in }Q,\\ &u|_{\partial\Omega\times(0,T)}=v|_{\partial\Omega\times(0,T)}=0.\end{array}\right. \tag{1.1}\] In (1.1), \(x\) and \(t\) are the state and the time variables, and \(u\) and \(v\) denote the value of the game and the population density of players respectively (e.g., [1], [12]). We note that \(p(x)\) specifies the Hamiltonian for (1.1). We consider **Inverse coefficient problem.**_Let \(\omega\subset\Omega\) be an arbitrarily chosen subdomain and \(t_{0}\in(0,T)\), \(\delta_{0}>0\) be small. One need to determine \(p(x)\), \(x\in\Omega\) by \(u|_{\omega\times(t_{0}-\delta_{0}\,t_{0}+\delta_{0})}\), \(v|_{\omega\times(t_{0}-\delta_{0}\,t_{0}+\delta_{0})}\) and \(u(\cdot,t_{0})\) in \(\Omega\)._ Henceforth we set \(\partial_{i}:=\frac{\partial}{\partial x_{i}}\) for \(1\leq i\leq d\), and define \(H^{2,1}(Q):=\{u\in L^{2}(Q);\,\nabla u,\partial_{i}\partial_{j}u,\partial_{l} u\in L^{2}(Q),\,\,1\leq i,j\leq d\}\), and \(W^{1,\infty}(\Omega)\) denotes the Sobolev space of functions whose first partial derivatives are in \(L^{\infty}(\Omega)\). We state our main result. **Theorem 1**.: _For \(\ell=1,2\), let \((u_{\ell},v_{\ell})\in(H^{2,1}(Q))^{2}\) satisfy (1.1) with \(p:=p_{\ell}\). We assume that_ \[\begin{cases}&\|p_{\ell}\|_{W^{1,\infty}(\Omega)}\leq M,\quad\| \alpha_{0}\|_{L^{\infty}(\Omega)}\leq M,\\ &\|u_{\ell}\|_{W^{1,\infty}(Q)}+\|\partial_{t}u_{\ell}\|_{L^{\infty}(0,T;W^{1, \infty}(\Omega))}\leq M,\,\|v_{\ell}\|_{W^{1,\infty}(Q)}+\|\partial_{t}v_{\ell }\|_{L^{\infty}(0,T;W^{1,\infty}(\Omega))}\leq M,\\ &(\partial_{t}^{k}u_{\ell},\partial_{t}^{k}v_{\ell})\in(H^{2,1}(Q))^{2},\quad k =0,1,\,\ell=1,2\end{cases} \tag{1.2}\] _and there exists a constant \(\delta>0\) such that_ \[|\nabla u_{1}(x,t_{0})|\geq\delta,\;x\in\Omega\quad\text{or}\quad|\nabla u_{ 2}(x,t_{0})|\geq\delta,\;x\in\Omega.\] _Then there exists a constant \(C=C(M,\delta)>0\) such that_ \[\|p_{1}-p_{2}\|_{L^{2}(\Omega)}\leq C(\|u_{1}(\cdot,t_{0})-u_{2}(\cdot,t_{0}) \|_{H^{2}(\Omega)}+\|u_{1}-u_{2}\|_{H^{1}(0,T;L^{2}(\omega))}+\|v_{1}-v_{2}\| _{H^{1}(0,T;L^{2}(\omega))}).\] We emphasize the following features of Theorem 1: 1. The observation subdomain \(\omega\subset\Omega\) can be arbitrarily small. 2. Lipschitz stability over \(\Omega\). 3. We need the positiveness of \(|\nabla u_{1}|\) or \(|\nabla u_{2}|\) only at one moment \(t=t_{0}\). 4. We do not need spatial data neither \(v_{1}\) nor \(v_{2}\) in \(\Omega\times\{t_{0}\}\). The features (1) - (3) are inevitable consequences of our methodology (e.g., [6]). The last (4) is a new aspect by that the unknown is only one spatial function, so that we do not need \(v(\cdot,t_{0})\) but one spatial data are sufficient. We remark that the stability and the uniqueness are open in the cases of \(t_{0}=0\) and \(t_{0}=T\). As for inverse problems for mean field games, see [3], [4], [7] - [11], [13] - [16]. In particular, [8] proves Holder stability with extra data compare to the above inverse problem for the case where the equation contain special non-local term. The proof of Theorem 1 is based on Carleman estimates: Lemma 2 in Section 2 and the modified argument in [6]. ## 2 Main Carleman estimate Setting \(y:=u_{1}-u_{2}\), \(z:=v_{1}-v_{2}\) and \(f:=\frac{1}{2}(p_{1}-p_{2})\), \(g:=|\nabla u_{1}|^{2}\), \(h:=2v_{1}\nabla u_{1}\), \(r_{1}:=\frac{1}{2}p_{2}(\nabla u_{1}+\nabla u_{2})\), \(r_{2}:=p_{2}\nabla u_{1}\) and \(r_{3}:=p_{2}v_{2}.\) From (1.2) we obtain the linearized system: \[\begin{cases}&\partial_{t}y(x,t)+\Delta y(x,t)=c_{0}z+r_{1}\cdot\nabla y+g(x,t )f(x)\quad\text{in }Q,\\ &\partial_{t}z(x,t)-\Delta z(x,t)=\operatorname{div}\left(r_{2}z+r_{3}\nabla y \right)+\operatorname{div}\left(h(x,t)f(x)\right)\quad\text{in }Q\end{cases} \tag{2.1}\] with \(y=z=0\) on \(\partial\Omega\times(0,T)\). By (1.2) we see that \[\partial_{t}^{j}r_{k},\partial_{t}^{j}g,\partial_{t}^{j}h\in L^{\infty}(Q) \quad\text{with }1\leq k\leq 3\text{ and }j=0,1. \tag{2.2}\] For the Carleman estimates, we introduce \(\eta\in C^{2}(\overline{\Omega})\) such that \(\eta>0\) in \(\Omega\), \(\eta|_{\partial\Omega}=0\) and \(|\nabla\eta|>0\) on \(\overline{\Omega\setminus\omega_{0}}\), where \(\omega_{0}\) is some subdomain such that \(\overline{\omega_{0}}\subset\omega\). (For existence of such a function see e.g. [2].) Without loss of generality, we can assume that \(t_{0}=\frac{1}{2}T\) and \((t_{0}-\delta_{0}\,t_{0}+\delta_{0})=(0,T)\). Fixing a constant \(\lambda>0\) sufficiently large, we set \(\mu(t):=t(T-t)\), \(Q_{\omega}:=\omega\times(0,T)\), and \[\varphi(x,t):=\frac{e^{\lambda\eta(x)}}{\mu(t)},\quad\alpha(x,t):=\frac{e^{ \lambda\eta(x)}-e^{2\lambda\|\eta\|_{C(\overline{\Omega})}}}{\mu(t)},\quad(x,t)\in Q.\] Then we state Carleman estimates for single parabolic equations, which can be both backward and forward. **Lemma 1**.: _Let \(\widetilde{y},\widetilde{z}\in H^{2,1}(Q)\) and \(\widetilde{y}|_{\partial\Omega\times(0,T)}=\widetilde{z}|_{\partial\Omega \times(0,T)}=0\). There exist constants \(s_{0}>0\) and \(C>0\) such that for all \(s>s_{0}\), we have_ \[\int_{Q}\left(\frac{1}{s\varphi}\left(\sum_{i,j=1}^{d}|\partial_{t}\partial_{ j}\widetilde{y}|^{2}+|\partial_{t}\widetilde{y}|^{2}\right)+s\varphi|\nabla \widetilde{y}|^{2}+s^{3}\varphi^{3}|\widetilde{y}|^{2}\right)e^{2s\alpha}dxdt\] \[\leq C\int_{Q}|\partial_{t}\widetilde{y}+\Delta\widetilde{y}|^{2}e^{2s\alpha} dxdt+C\int_{Q_{\omega}}s^{3}\varphi^{3}|\widetilde{y}|^{2}e^{2s\alpha}dxdt \tag{2.3}\] _and_ \[\int_{Q}\left(\frac{1}{s\varphi}|\nabla\widetilde{z}|^{2}+s\varphi|\widetilde{ z}|^{2}\right)e^{2s\alpha}dxdt\leq C\int_{Q}|G|^{2}e^{2s\alpha}dxdt+C\int_{Q_{ \omega}}s\varphi|\widetilde{z}|^{2}e^{2s\alpha}dxdt \tag{2.4}\] _where \(\partial_{t}\widetilde{z}-\Delta\widetilde{z}=\text{div}\,G\) in \(Q\)._ The Carleman estimate (2.3) can be proved by applying \(\alpha(x,t)=\alpha(x,T-t)\) and \(\varphi(x,t)=\varphi(x,T-t)\) for \((x,t)\in Q\) to the Carleman estimate in [2], while the proof of (2.4) is found in Imanuvilov and Yamamoto [5]. Henceforth \(C>0\) denotes generic constants independent of \(s>0\). We define \(D(y,z):=\int_{Q_{\omega}}(s^{3}\varphi^{3}|y|^{2}+s\varphi|z|^{2})e^{2s\alpha }dxdt\). Setting \(y_{1}:=\partial_{t}y\) and \(z_{1}:=\partial_{t}z\), and differentiating equations (2.1) respect to \(t\) we have \[\left\{\begin{array}{rl}&\partial_{t}y_{1}+\Delta y_{1}=c_{0}z_{1}+r_{1} \cdot\nabla y_{1}+(\partial_{t}r_{1})\cdot\nabla y+(\partial_{t}g)f\quad\text {in }Q,\\ &\partial_{t}z_{1}-\Delta z_{1}=\text{div}\,(r_{2}z_{1}+r_{3}\nabla y_{1})+ \text{div}\,((\partial_{t}r_{2})z+(\partial_{t}r_{3})\nabla y)+\text{div}\,(( \partial_{t}h)f)\quad\text{in }Q.\end{array}\right. \tag{2.5}\] Applying (2.3) and (2.4) to the first and the second equations in (2.1) respectively, in terms of (2.2) we have \[\int_{Q}\left(\frac{1}{s\varphi}|\partial_{t}y|^{2}+s\varphi|\nabla y|^{2}+s^{ 3}\varphi^{3}|y|^{2}\right)e^{2s\alpha}dxdt\leq C\int_{Q}|z|^{2}e^{2s\alpha}dxdt +C\int_{Q}|f|^{2}e^{2s\alpha}dxdt+CD(y,z) \tag{2.6}\] and \[\int_{Q}s\varphi|z|^{2}e^{2s\alpha}dxdt\leq C\int_{Q}(|y|^{2}+|\nabla y|^{2})e ^{2s\alpha}dxdt+C\int_{Q}|f|^{2}e^{2s\alpha}dxdt+CD(y,z). \tag{2.7}\] Here in terms of (2.2), we estimate \(\int_{Q}|r_{1}\cdot\nabla y|^{2}e^{2s\alpha}dxdt\leq C\int_{Q}|\nabla y|^{2}e^ {2s\alpha}dxdt\), and this term can be absorbed into \(\int_{Q}s\varphi|\nabla y|^{2}e^{2s\alpha}dxdt\) on the left-hand side of (2.3) for large \(s>0\). Throughout the proof, we repeat similar estimation with absorption thanks to the large parameter \(s>0\). Adding (2.6) and (2.7), and choosing \(s>0\) large, we can absorb the resulting term on the right-hand side into the left-hand side, so that \[\int_{Q}\left(\frac{1}{s\varphi}|\partial_{t}y|^{2}+s\varphi|\nabla y|^{2}+s^{ 3}\varphi^{3}|y|^{2}+s\varphi|z|^{2}\right)e^{2s\alpha}dxdt\leq C\int_{Q}|f|^{ 2}e^{2s\alpha}dxdt+CD(y,z). \tag{2.8}\] Next, the application of Lemma 1 to (2.5) yields \[\int_{Q}\left(\frac{1}{s\varphi}|\partial_{t}y_{1}|^{2}+s\varphi|\nabla y_{1}|^{2 }+s^{3}\varphi^{3}|y_{1}|^{2}\right)e^{2s\alpha}dxdt\] \[\leq C\int_{Q}(|\nabla y|^{2}+|z_{1}|^{2})e^{2s\alpha}dxdt+C\int_{Q}|f|^{2}e^{2 s\alpha}dxdt+CD(y_{1},z_{1}) \tag{2.9}\] and \[\int_{Q}s\varphi|z_{1}|^{2}e^{2s\alpha}dxdt\leq C\int_{Q}(|z|^{2}+|\nabla y|^{2 }+|\nabla y_{1}|^{2})e^{2s\alpha}dxdt+C\int_{Q}|f|^{2}e^{2s\alpha}dxdt+CD(y_{1},z_{1}). \tag{2.10}\] Adding (2.9) and (2.10), we can absorb the terms \(|z_{1}|^{2}\), \(|\nabla y_{1}|^{2}\) on the right-hand side into the left-hand side, we can obtain \[\int_{Q}\left(\frac{1}{s\varphi}|\partial_{t}y_{1}|^{2}+s\varphi| \nabla y_{1}|^{2}+s^{3}\varphi^{3}|y_{1}|^{2}+s\varphi|z_{1}|^{2}\right)e^{2s \alpha}dxdt\] \[\leq C\int_{Q}(|\nabla y|^{2}+|z|^{2})e^{2s\alpha}dxdt+C\int_{Q}|f|^{2 }e^{2s\alpha}dxdt+CD(y_{1},z_{1}).\] Substituting (2.8) into the first term on the right-hand side, we reach **Lemma 2** (key Carleman estimate.: _There exist constants \(s_{0}>0\) and \(C>\) such that_ \[\int_{Q}\biggl{(}\frac{1}{s\varphi}|\partial_{t}^{2}y|^{2}+s^{3}\varphi^{3}| \partial_{t}y|^{2})+s\varphi(|z|^{2}+|\partial_{t}z|^{2})\biggr{)}e^{2s\alpha} dxdt\leq C\int_{Q}|f|^{2}e^{2s\alpha}dxdt+C(D(y,z)+D(y_{1},z_{1}))\] _for all \(s>s_{0}\)._ ## 3 Completion of the proof of Theorem 1. By \(e^{2s\alpha(x,0)}=0\) for \(x\in\Omega\), and \(|\partial_{t}\varphi|\leq C\varphi^{2},|\partial_{t}\alpha|\leq C\varphi^{2}\) in \(Q\), we have \[\int_{\Omega}\varphi(x,t_{0})^{-1}|\partial_{t}y(x,t_{0})|^{2}e^{ 2s\alpha(x,t_{0})}dx=\int_{0}^{t_{0}}\frac{d}{dt}\left(\int_{\Omega}\varphi^{- 1}|\partial_{t}y|^{2}e^{2s\alpha}dx\right)dt\] \[= \int_{0}^{t_{0}}\int_{\Omega}(-(\partial_{t}\varphi)\varphi^{-2} |\partial_{t}y|^{2}+2s\varphi^{-1}|\partial_{t}y|^{2}(\partial_{t}\alpha)+2 \varphi^{-1}(\partial_{t}y)(\partial_{t}^{2}y))e^{2s\alpha}dxdt\] \[\leq C\int_{Q}(|\partial_{t}y|^{2}+s\varphi|\partial_{t}y|^{2}+| \partial_{t}y||\partial_{t}^{2}y|)e^{2s\alpha}dxdt\leq C\int_{Q}(s\varphi| \partial_{t}y|^{2}+|\partial_{t}y||\partial_{t}^{2}y|)e^{2s\alpha}dxdt\] \[\leq C\int_{Q}(s\varphi|\partial_{t}y|^{2}+\frac{1}{s\varphi}| \partial_{t}^{2}y|^{2})e^{2s\alpha}dxdt.\] Here we used \(|\partial_{t}y||\partial_{t}^{2}y|=\left(\frac{1}{\sqrt{s\varphi}}|\partial_{t }^{2}y|\right)(\sqrt{s\varphi}|\partial_{t}y|)\leq\frac{1}{2}\left(\frac{1}{s \varphi}|\partial_{t}^{2}y|^{2}+s\varphi|\partial_{t}y|^{2}\right)\). Therefore, by \(\min_{x\in\overline{\Omega}}\varphi(x,t_{0})^{-1}>0\), Lemma 2 yields \[\int_{\Omega}|\partial_{t}y(x,t_{0})|^{2}e^{2s\alpha(x,t_{0})}dx\leq C\int_{ \Omega}\varphi(x,t_{0})^{-1}|\partial_{t}y(x,t_{0})|^{2}e^{2s\alpha(x,t_{0})} dx\leq C\int_{Q}|f|^{2}e^{2s\alpha}dxdt+C_{s}\mathcal{D}.\] Here and henceforth we set \(\mathcal{D}:=\|y\|_{H^{1}(0,T;L^{2}(\omega))}^{2}+\|z\|_{H^{1}(0,T;L^{2}(\omega ))}^{2}\). We can assume that \(|\nabla u_{1}(x,t_{0})|>0\) for \(x\in\overline{\Omega}\). Then, since \(|g(x,t_{0})|=|\nabla u_{1}(x,t_{0})|^{2}>0\) for \(x\in\overline{\Omega}\) and \(g(x,t_{0})f(x)=\partial_{t}y(x,t_{0})+(\Delta y-r_{1}\nabla y)(x,t_{0})-c_{0}( x)z(x,t_{0})\) for \(x\in\Omega\), we obtain \[\int_{\Omega}|f(x)|^{2}e^{2s\alpha(x,t_{0})}dx\leq C\int_{Q}|f|^{2}e^{2s\alpha }dxdt+C_{s}\mathcal{D}+C_{s}\|y(\cdot,t_{0})\|_{H^{2}(\Omega)}^{2}+C\int_{ \Omega}|z(x,t_{0})|^{2}e^{2s\alpha(x,t_{0})}dx. \tag{3.1}\] Next \[\int_{\Omega}|z(x,t_{0})|^{2}e^{2s\alpha(x,t_{0})}dx\leq C\int_{ \Omega}\varphi(x,t_{0})^{-1}|z(x,t_{0})|^{2}e^{2s\alpha(x,t_{0})}dx\] \[= C\int_{0}^{t_{0}}\frac{d}{dt}\left(\int_{\Omega}\varphi^{-1}|z| ^{2}e^{2s\alpha}dx\right)dt\] \[= C\int_{0}^{t_{0}}\int_{\Omega}(-(\partial_{t}\varphi)\varphi^{-2 }|z|^{2}+\varphi^{-1}|z|^{2}2s(\partial_{t}\alpha)+\varphi^{-1}2z(\partial_{t} z))e^{2s\alpha}dxdt\] \[\leq C\int_{Q}(s\varphi|z|^{2}+|z||\partial_{t}z|)e^{2s\alpha}dxdt \leq C\int_{Q}(s\varphi|z|^{2}+|z|^{2}+|\partial_{t}z|^{2})e^{2s\alpha}dxdt.\] Therefore Lemma 2 yields \(\int_{\Omega}|z(x,t_{0})|^{2}e^{2s\alpha(x,t_{0})}dx\leq C\int_{Q}|f|^{2}e^{2s \alpha}dxdt+C_{s}\mathcal{D}\), with which (3.1) implies \[\int_{\Omega}|f(x)|^{2}e^{2s\alpha(x,t_{0})}dx\leq C\int_{Q}|f|^{2}e^{2s\alpha} dxdt+C_{s}(\mathcal{D}+\|y(\cdot,t_{0})\|_{H^{2}(\Omega)}^{2}) \tag{3.2}\] for all large \(s>0\). On the other hand, \[\int_{Q}|f(x)|^{2}e^{2s\alpha(x,t)}dxdt=\int_{\Omega}|f(x)|^{2}e^{2s\alpha(x,t _{0})}\left(\int_{0}^{T}e^{2s(\alpha(x,t)-\alpha(x,t_{0}))}dt\right)dx.\] Since \(\mu(t_{0})>\mu(t)\) for \(t\neq t_{0}\), we verify \(\alpha(x,t_{0})-\alpha(x,t)\geq C_{0}\left(\frac{1}{\mu(t)}-\frac{1}{\mu(t_{0} )}\right)\) for \((x,t)\in Q\), where \(C_{0}:=e^{2\lambda\|\|_{C}(\overline{\Omega})}-e^{\lambda\|\mu\|_{C}(\overline {\Omega})}\). Hence, \[\int_{0}^{T}e^{2s(\alpha(x,t)-\alpha(x,t_{0}))}dt\leq\int_{0}^{T}\exp\left(-2 sC_{0}\left(\frac{1}{\mu(t)}-\frac{1}{\mu(t_{0})}\right)\right)dt\] for \(x\in\Omega\). Since \(\lim_{s\rightarrow\infty}\exp\left(-2sC_{0}\left(\frac{1}{\mu(t)}-\frac{1}{ \mu(t_{0})}\right)\right)=0\) if \(t\neq t_{0}\) and \(\exp\left(-2sC_{0}\left(\frac{1}{\mu(t)}-\frac{1}{\mu(t_{0})}\right)\right)\leq 1\) for \(s>0\) and \(0\leq t\leq T\), the Lebesgue convergence theorem yields \(\sup_{x\in\Omega}\int_{0}^{T}e^{2s(\alpha(x,t)-\alpha(x,t_{0}))}dt=o(1)\) as \(s\rightarrow\infty\), and so \(\int_{Q}|f|^{2}e^{2s\alpha}dxdt=o(1)\int_{\Omega}|f|^{2}e^{2s\alpha(x,t_{0})}dx\). Substituting this into (3.2) and choosing \(s>0\) large, we reach \(\int_{\Omega}|f|^{2}e^{2s\alpha(x,t_{0})}dx\leq C_{s}(\mathcal{D}+\|y(\cdot,t_ {0})\|_{H^{2}(\Omega)}^{2})\). \(\blacksquare\) **Acknowledgments.** The work was supported by Grant-in-Aid for Scientific Research (A) 20H00117 and Grant-in-Aid for Challenging Research (Pioneering) 21K18142 of Japan Society for the Promotion of Science.

2302.10856

Overview of the TREC 2021 Fair Ranking Track

The TREC Fair Ranking Track aims to provide a platform for participants to develop and evaluate novel retrieval algorithms that can provide a fair exposure to a mixture of demographics or attributes, such as ethnicity, that are represented by relevant documents in response to a search query. For example, particular demographics or attributes can be represented by the documents' topical content or authors. The 2021 Fair Ranking Track adopted a resource allocation task. The task focused on supporting Wikipedia editors who are looking to improve the encyclopedia's coverage of topics under the purview of a WikiProject. WikiProject coordinators and/or Wikipedia editors search for Wikipedia documents that are in need of editing to improve the quality of the article. The 2021 Fair Ranking track aimed to ensure that documents that are about, or somehow represent, certain protected characteristics receive a fair exposure to the Wikipedia editors, so that the documents have an fair opportunity of being improved and, therefore, be well-represented in Wikipedia. The under-representation of particular protected characteristics in Wikipedia can result in systematic biases that can have a negative human, social, and economic impact, particularly for disadvantaged or protected societal groups.

Michael D. Ekstrand, Graham McDonald, Amifa Raj, Isaac Johnson

2023-02-21T18:13:06Z

http://arxiv.org/abs/2302.10856v1

# Overview of the TREC 2021 Fair Ranking Track ###### Abstract The TREC Fair Ranking Track aims to provide a platform for participants to develop and evaluate novel retrieval algorithms that can provide a fair exposure to a mixture of demographics or attributes, such as ethnicity, that are represented by relevant documents in response to a search query. For example, particular demographics or attributes can be represented by the documents' topical content or authors. The 2021 Fair Ranking Track adopted a resource allocation task. The task focused on supporting Wikipedia editors who are looking to improve the encyclopedia's coverage of topics under the purview of a WikiProject.1 WikiProject coordinators and/or Wikipedia editors search for Wikipedia documents that are in need of editing to improve the quality of the article. The 2021 Fair Ranking track aimed to ensure that documents that are about, or somehow represent, certain protected characteristics receive a fair exposure to the Wikipedia editors, so that the documents have an fair opportunity of being improved and, therefore, be well-represented in Wikipedia. The under-representation of particular protected characteristics in Wikipedia can result in systematic biases that can have a negative human, social, and economic impact, particularly for disadvantaged or protected societal groups [3, 5]. Footnote 1: [https://en.wikipedia.org/wiki/wikiProject](https://en.wikipedia.org/wiki/wikiProject) ## 2 Task Definition The 2021 Fair Ranking Track used an _ad hoc_ retrieval protocol. Participants were provided with a corpus of documents (a subset of the English language Wikipedia) and a set of queries. A query was of the form of a short list of search terms that represent a WikiProject. Each document in the corpus was relevant to zero to many WikiProjects and associated with zero to many fairness categories. There were two tasks in the 2021 Fair Ranking Track. In each of the tasks, for a given query, participants were to produce document rankings that are: 1. Relevant to a particular WikiProject. 2. Provide a fair exposure to articles that are associated to particular protected attributes. The tasks shared a topic set, the corpus, the basic problem structure and the fairness objective. However, they differed in their target user persona, system output (static ranking vs. sequences of rankings) and evaluation metrics. The common problem setup was as follows: * **Queries** were provided by the organizers and derived from the topics of existing or hypothetical WikiProjects. * **Documents** were Wikipedia articles that may or may not be relevant to any particular WikiProject that is represented by a query. * **Rankings** were ranked lists of articles for editors to consider working on. * **Fairness** of exposure was achieved with respect to the **geographic location** of the articles (geographic location annotations were provided). For the evaluation topics, in addition to geographic fairness, to the extent that biographical articles are relevant to the topic, the rankings should have also been fair with respect to an undisclosed **demographic attribute** of the people that the biographies cover, which was gender. ### Task 1: WikiProject Coordinators The first task focused on WikiProject coordinators as users of the search system; their goal is to search for relevant articles and produce a ranked list of articles needing work that other editors can then consult when looking for work to do. **Output**: The output for this task was a **single ranking per query**, consisting of **1000 articles**. Evaluation was a multi-objective assessment of rankings by the following two criteria: * Relevance to a WikiProject topic. Relevance assessments were provided for articles for the training queries derived from existing Wikipedia data; evaluation query relevance were assessed by NIST assessors. Ranking relevance was computed with nDCG, using binary relevance and logarithmic decay. * Fairness with respect to the exposure of different fairness categories in the articles returned in response to a query. Section 4.2 contains details on the evaluation metrics. ### Task 2: Wikipedia Editors The second task focused on individual Wikipedia editors looking for work associated with a project. The conceptual model is that rather than maintaining a fixed work list as in Task 1, a WikiProject coordinator would create a saved search, and when an editor looks for work they re-run the search. This means that different editors may receive different rankings for the same query, and differences in these rankings may be leveraged for providing fairness. **Output**: The output of this task is **100 rankings per query**, each consisting of **50 articles**. Evaluation was a multi-objective assessment of rankings by the following three criteria: * Relevance to a WikiProject topic. Relevance assessments were provided for articles for the training queries derived from existing Wikipedia data; evaluation query relevance was assessed by NIST assessors. Ranking relevance was computed with nDCG. * Work needed on the article (articles needing more work preferred). We provided the output of an article quality assessment tool for each article in the corpus; for the purposes of this track, we assumed lower-quality articles need more work. * Fairness with respect to the exposure of different fairness categories in the articles returned in response to a query. The goal of this task was _not_ to be fair to work-needed levels; rather, we consider work-needed and topical relevance to be two components of a multi-objective notion of relevance, so that between two documents with the same topical relevance, the one with more work needed is more relevant to the query in the context of looking for articles to improve. This task used _expected exposure_ to compare the exposure article subjects receive in result rankings to the _ideal_ (or _target_) _exposure_ they would receive based on their relevance and work-needed [1]. This addresses fundamental limits in the ability to provide fair exposure in a single ranking by examining the exposure over multiple rankings. For each query, participants provided 100 rankings, which we considered to be samples from the distribution realized by a stochastic ranking policy (given a query \(q\), a distribution \(\pi_{q}\) over truncated permutations of the documents). Note that this is how we interpret the queries, but it did not mean that a stochastic policy is how the system should have been implemented -- other implementation designs were certainly possible. The objective was to provide equitable exposure to documents of comparable relevance and work-needed, aggregated by protected attribute. Section 4.3 has details on the evaluation metrics. ## 3 Data This section provides details of the format of the test collection, topics and ground truth. Further details about data generation and limitations can be found in Section 5.2. ### Obtaining the Data The corpus and query data set is distributed via Globus, and can be obtained in two ways. First, it can be obtained via Globus, from our repository at [https://boi.st/TREC2021Globus](https://boi.st/TREC2021Globus). From this site, you can log in using your institution's Globus account or your own Google account, and synchronize it to your local Globus install or download it with Globus Connect Personal.2 This method has robust support for restarting downloads and dealing with intermittent connections. Second, it can be downloaded directly via HTTP from: [https://data.boisestate.edu/library/Ekstrand-2021/TRECFairRanking2021/](https://data.boisestate.edu/library/Ekstrand-2021/TRECFairRanking2021/). Footnote 2: [https://www.globus.org/globus-connect-personal](https://www.globus.org/globus-connect-personal) The runs and evaluation qrels will be made available in the ordinary TREC archives. ### Corpus The corpus consisted of articles from English Wikipedia. We removed all redirect articles, but left the wikitext (markup Wikipedia uses to describe formatting) intact. This was provided as a JSON file, with one record per line, and compressed with gzip (trec_corpus.json.gz). Each record contains the following fields: **id**: The unique numeric Wikipedia article identifier. **title**: The article title. **url**: The article URL, to comply with Wikipedia licensing attribution requirements. **text**: The full article text. The contents of this corpus were prepared in accordance with, and licensed under, the CC BY-SA 3.0 license.3 The raw Wikipedia dump files used to produce this corpus are available in the source directory; this is primarily for archival purposes, because Wikipedia does not publish dumps indefinitely. Footnote 3: [https://creativecommons.org/licenses/by-sa/3.0/](https://creativecommons.org/licenses/by-sa/3.0/) ### Topics Each of the track's training topics is based on a single Wikiproject. The topic is also GZIP-compressed JSON lines (file trec_topics.json.gz), with each record containing: **id**: A query identifier (int) **title**: The Wikiproject title (string) **keywords**: A collection of search keywords forming the query text (list of str) **scope**: A textual description of the project scope, from its project page (string) **homepage**: The URL for the Wikiproject. This is provided for attribution and not expected to be used by your system as it will not be present in the evaluation data (string) **rel_docs**: A list of the page IDs of relevant pages (list of int) The keywords are the primary query text. The scope is there to provide some additional context and potentially support techniques for refining system queries. In addition to topical relevance, for Task 2: Wikipedia Editors (Section 2.2), participants were also expected to return relevant documents that need more editing work done more highly than relevant documents that need less work done. ### Annotations NIST assessors annotated the retrieved documents with binary relevance score for given topics. We provided additional options like _unassessable_ and _skip_ if the document-topic pair is difficult to assess or the assessor is not familiar with the topic. The annotations are incomplete, for reasons including: * Task 2 requires sequence of rankings which results a large number of dataset, thus it was not possible to annotate all the retrieved documents. * Some documents were not complete and did not have enough information to match with the topic. We obtained assessments through tiered pooling, with the goal of having assessments for a coherent subset of rankings that are as complete as possible. We have assessments for the following tiers: * The first 20 items of all rankings for Task 1 (all queries). * The first 5 items of the first 25 rankings from every submission to Task 2 (about 75% of the queries). Details are included with the annotations and metric code. ### Metadata and Fairness Categories For training data, participants were provided with a geographical fairness ground truth. For the evaluation data, submitted systems were evaluated on how fair their rankings are to the geographical fairness category and an undisclosed personal demographic attribute (gender). We also provided a simple Wikimedia quality score (a float between 0 and 1 where 0 is no content on the page and 1 is high quality) for optimizing for work-needed in Task 2. Work-needed was operationalized as the reverse--i.e. 1 minus this quality score. The discretized quality scores were used as work-needed for final system evaluation. This data was provided together in a metadata file (trec_metadata.json.gz), in which each line is the metadata for one article represented as a JSON record with the following keys: **page_id**: Unique page identifier (int) **quality_score**: Continuous measure of article quality with 0 representing low quality and 1 representing high quality (float in range \([0,1]\)) **quality_score_disc**: Discrete quality score in which the quality score is mapped to six ordinal categories from low to high: Stub, Start, C, B, GA, FA (string) **geographic_locations**: Continents that are associated with the article topic. Zero or many of: Africa, Antarctica, Asia, Europe, Latin America and the Caribbean, Northern America, Oceania (list of string) **gender**: For articles with a gender, the gender of the article's subject, obtained from WikiData. ### Output For **Task 1**, participants outputted results in rank order in a tab-separated file with two columns: **id**: The query ID for the topic **page_id**: ID for the recommended article For **Task 2**, this file had 3 columns, to account for repeated rankings per query: **id**: Query ID **rep_number**: Repeat Number (1-100) **page_id**: ID for the recommended article ## 4 Evaluation Metrics Each task was evaluated with its own metric designed for that task setting. The goal of these metrics was to measure the extent to which a system (1) exposed relevant documents, and (2) exposed those documents in a way that is fair to article topic groups, defined by location (continent) and (when relevant) the gender of the article's subject. This faces a problem in that Wikipedia itself has well-documented biases: if we target the current group distribution within Wikipedia, we will reward systems that simply reproduce Wikipedia's existing biases instead of promoting social equity. However, if we simply target equal exposure for groups, we would ignore potential real disparities in topical relevance. Due to the biases in Wikipedia's coverage, and the inability to retrieve documents that don't exist to fill in coverage gaps, there is not good empirical data on what the distribution for any particular topic _should_ be if systemic biases did not exist in either Wikipedia or society (the "world as it could and should be" [2]). Therefore, in this track we adopted a compromise: we **averaged** the empirical distribution of groups among relevant documents with the world population (for location) or equality (for gender) to derive the target group distribution. Code to implement the metrics is found at [https://github.com/fair-trec/trec2021-fair-public](https://github.com/fair-trec/trec2021-fair-public). ### Preliminaries The tasks were to retrieve documents \(d\) from a corpus \(\mathcal{D}\) that are relevant to a query \(q\). \(\mathtt{r}_{q}\in[0,1]^{|\mathcal{D}|}\) is a vector of relevance judgements for query \(q\). We denote a ranked list by \(L\); \(L_{i}\) is the document at position \(i\) (starting from 1), and \(L_{d}^{-1}\) is the rank of document \(d\). For Task 1, each system returned a single ranked list; for Task 2, it returned a sequence of rankings \(\mathcal{L}\). We represented the group alignment of a document \(d\) with an _alignment vector_\(\mathbf{a}_{d}\in[0,1]^{|\mathcal{G}|}\). \(a_{dg}\) is document \(d\)'s alignment with group \(g\). \(\mathbf{A}\in[0,1]^{|\mathcal{D}|\times|\mathcal{G}|}\) is the alignment matrix for all documents. \(\mathbf{a}_{\text{world}}\) denotes the distribution of the world.4 Footnote 4: Obtained from [https://en.wikipedia.org/wiki/List_of_contiments_and_continental_subregions_by_population](https://en.wikipedia.org/wiki/List_of_contiments_and_continental_subregions_by_population) We considered fairness with respect to two group sets, \(\mathcal{G}_{\text{geo}}\) and \(\mathcal{G}_{\text{gender}}\). We operationalized this intersectional objective by letting \(\mathcal{G}=\mathcal{G}_{\text{geo}}\times\mathcal{G}_{\text{gender}}\), the Cartesian product of the two group sets. Further, alignment under either group set may be unknown; we represented this case by treating "unknown" as its own group (\(g\)?) in each set. In the product set, a document's alignment may be unknown for either or both groups. In all metrics, we use **log discounting** to compute attention weights: \[v_{i}=\frac{1}{\log_{2}\max(i,2)}\] Task 2 also considered the work each document needs, represented by \(w_{d}\in\{1,2,3,4\}\). ### Task 1: WikiProject Coordinators (Single Rankings) For the single-ranking Task 1, we adopted attention-weighted rank fairness (AWRF), first described by Sapiezynski et al. [6] and named by Raj et al. [4]. AWRF computes a vector \(\mathbf{d}_{L}\) of the cumulated exposure a list gives to each group, and a target vector \(\mathbf{d}_{q}^{*}\); we then compared these with the Jenson-Shannon divergence: \[\mathbf{d}_{L}^{\prime} =\sum_{i}v_{i}\mathbf{a}_{L_{i}} \text{cumulated attention}\] \[\mathbf{d}_{L} =\frac{\mathbf{d}_{L}^{\prime}}{\|\mathbf{d}_{L}^{\prime}\|_{1}} \text{normalize to a distribution}\] \[\mathbf{d}_{q}^{*} =\frac{1}{2}\left(\mathbf{A}^{\text{T}}\mathbf{r}_{q}+\mathbf{a }_{\text{world}}\right)\] \[\text{AWRF}(L) =1-\mathsf{d}_{\text{JS}}(\mathbf{d}_{L},\mathbf{d}_{q}^{*}) \tag{1}\] For Task 1, we ignored documents that are fully unknown for the purposes of computing \(\mathbf{d}_{L}\) and \(\mathbf{d}_{q}^{*}\); they do not contribute exposure to any group. The resulting metric is in the range \([0,1]\), with 1 representing a maximally-fair ranking (the distance from the target distribution is minimized). We combined it with an ordinary nDCG metric for utility: \[\text{NDCG}(L)=\frac{\sum_{i}v_{i}r_{qd}}{\text{ideal}} \tag{2}\] \[M_{1}(L)=\text{AWRF}(L)\times\text{NDCG}(L) \tag{3}\] To score well on the final metric \(M_{1}\), a run must be **both** accurate and fair. ### Task 2: Wikipedia Editors (Multiple Rankings) For Task 2, we used Expected Exposure [1] to compare the exposure each group receives in the sequence of rankings to the exposure it would receive in a sequence of rankings drawn from an _ideal policy_ with the following properties: * Relevant documents come before irrelevant documents * Relevant documents are sorted in nonincreasing order of work needed * Within each work-needed bin of relevant documents, group exposure is fairly distributed according to the average of the distribution of relevant documents and the distribution of global population (the same average target as before). We have encountered some confusion about whether this task is requiring fairness towards work-needed; as we have designed the metric, work-needed is considered to be a part of (graded) relevance: a document is more relevant if it is relevant to the topic and needs significant work. In the Expected Exposure framework, this combined relevance is used to derive the target policies. To apply expected exposure, we first define the exposure \(\epsilon_{d}\) a document \(d\) receives in sequence \(\mathcal{L}\): \[\epsilon_{d}=\frac{1}{|\mathcal{L}|}\sum_{L\in\mathcal{L}}w_{L_{d}^{-1}} \tag{4}\] This forms an exposure vector \(\mathbf{\epsilon}\in\mathbb{R}^{|\mathcal{D}|}\). It is aggregated into a group exposure vector \(\mathbf{\gamma}\), including "unknown" as a group: \[\mathbf{\gamma}=\mathbf{A}^{\text{T}}\mathbf{\epsilon} \tag{5}\] Our implementation rearranges the mean and aggregate operations, but the result is mathematically equivalent. We then compare these system exposures with the target exposures \(\mathbf{\epsilon}^{*}\) for each query. This starts with the per-document ideal exposure; if \(m_{w}\) is the number of relevant documents with work-needed level \(w\in\{1,2,3,4\}\), then according to Diaz et al. [1] the ideal exposure for document \(d\) is computed as: \[\epsilon_{d}^{*}=\frac{1}{m_{w_{d}}}\sum_{i=m_{>w_{d}}+1}^{m_{>w_{d}}}v_{i} \tag{6}\] We use this to compute the non-averaged target distribution \(\tilde{\mathbf{\gamma}}^{*}\): \[\tilde{\mathbf{\gamma}}^{*}=\mathbf{A}^{\text{T}}\mathbf{\epsilon}^{*} \tag{7}\] Since we include "unknown" as a group, we have a challenge with computing the target distribution by averaging the empirical distribution of relevant documents and the global population -- global population does not provide any information on the proportion of relevant articles for which the fairness attributes are relevant. Our solution, therefore, is to average the distribution of _known-group_ documents with the world population, and re-normalize so the final distribution is a probability distribution, but derive the proportion of known- to unknown-group documents entirely from the empirical distribution of relevant documents. Extended to handle partially-unknown documents, this procedure proceeds as follows: * Average the distribution of fully-known documents (both gender and location are known) with the global intersectional population (global population by location and equality by gender). * Average the distribution of documents with unknown location but known gender with the equality gender distribution. * Average the distribution of documents with unknown gender but known location with the world population. The result is the target group exposure \(\mathbf{\gamma}^{*}\). We use this to measure the **expected exposure loss**: \[M_{2}(\mathcal{L}_{q}) =\|\mathbf{\gamma}-\mathbf{\gamma}^{*}\|_{2} \tag{8}\] \[=\mathbf{\gamma}\cdot\mathbf{\gamma}-2\mathbf{\gamma}\cdot\mathbf{\gamma}^{*}+ \mathbf{\gamma}^{*}\cdot\mathbf{\gamma}^{*}\] \[\text{EE-D}(\mathcal{L}_{q}) =\mathbf{\gamma}^{*}\cdot\mathbf{\gamma}^{*}\] (9) \[\text{EE-R}(\mathcal{L}_{q}) =\mathbf{\gamma}\cdot\mathbf{\gamma}^{*} \tag{10}\] Lower \(M_{2}\) is better. It decomposes into two submetrics, the **expected exposure disparity** (EE-D) that measures overall inequality in exposure independent of relevance, for which lower is better; and the **expected exposure relevance** (EE-L) that measures exposure/relevance alignment, for which higher is better [1]. ## 5 Results This year four different teams submitted a total of 24 runs. All four teams participated in Task 1: Single Rankings (13 runs total), while only three of the four groups participated in Task 2: Multiple Rankings (11 runs total). ### Task 1: WikiProject Coordinators (Single Rankings) Approaches for Task 1 included: * RoBERTa model to compute embeddings for text fields. * A filtering approach to select top ranked documents from either competing rankers or the union of rankers. * BM25 ranking from pyserini and re-ranked using MMR implicit diversification (without explicit fairness groups). Lambda varied between runs. * BM25 initial ranking with iterative reranking using fairness calculations to select documents to add to the ranking. * Relevance ranking using Terrier plus a fairness component that aims to be fair to both the geographic location attribute and an inferred demographic attribute through tailored diversification plus data fusion. * Optimisation to consider a protected group's distribution in the background collection and the total predicted relevance of the group in the candidate results set. * Allocating positions in the generated ranking to a protected group proportionally with respect to the total relevance score of the group within the candidate results set. \begin{table} \begin{tabular}{l c c c c} \hline \hline & nDCG & AWRF & Score & 95\% CI \\ \hline **UoGTrDExpDisT1** & 0.2071 & 0.8299 & 0.1761 & (0.145, 0.212) \\ **UoGTrDReiDiT1** & 0.2001 & 0.8072 & 0.1639 & (0.138, 0.193) \\ **UoGTrDivPropT1** & 0.2157 & 0.7112 & 0.1532 & (0.128, 0.184) \\ **UoGTrDExpDisLT1** & 0.1776 & 0.8197 & 0.1459 & (0.122, 0.173) \\ **RUN1** & 0.2169 & 0.6627 & 0.1425 & (0.119, 0.172) \\ **UoGTrRelT1** & 0.2120 & 0.6559 & 0.1373 & (0.113, 0.165) \\ **RMITRet** & 0.2075 & 0.6413 & 0.1317 & (0.110, 0.159) \\ **1step_pair** & 0.0838 & 0.6940 & 0.0648 & (0.046, 0.090) \\ **2step_pair** & 0.0824 & 0.6943 & 0.0638 & (0.045, 0.089) \\ **1step_pair_list** & 0.0820 & 0.6908 & 0.0623 & (0.045, 0.085) \\ **2step_pair_list** & 0.0786 & 0.6912 & 0.0607 & (0.044, 0.083) \\ **RMITRetRerank_1** & 0.0035 & 0.6180 & 0.0026 & (0.001, 0.009) \\ **RMITRetRerank_2** & 0.0035 & 0.6158 & 0.0026 & (0.001, 0.009) \\ \hline \hline \end{tabular} \end{table} Table 1: Task 1 runs. Higher score is better (for all metrics). * Relevance-only approaches. Table 1 shows the submitted systems ranked by the official Task 1 metric \(M_{1}\) and its component parts nDCG and AWRF. Figure 1 plots the runs with the component metrics on the \(x\) and \(y\) axes. Notably, each of the approaches from a participating team are clustered in terms of the component metrics and the official \(M_{1}\) metric. ### Task 2: Wikipedia Editors (Multiple Rankings) Approaches for Task 2 included: * A randomized method with BERT and a two-staged Plackett-Luce sampling where relevance scores are combined with work needed. * An iterative approach that uses RoBERTa and computes a score for each of the top-K documents in the current state, based on the expected exposure of each group so far and the original estimated relevance score, integrating an article's quality score. * BM25 plus re-ranking iteratively selecting documents by combining relevance, fairness and quality scores. * Relevance ranking using Terrier plus a fairness component that aims to be fair to both the geographic location attribute and an inferred demographic attribute through tailored diversification plus data fusion to prioritise highly relevant documents while matching the distributions of the protected groups in the generated ranking to their distributions in the background population. * Minimising the predicted divergence, or skew, in the distributions of the protected groups over all of the rankings within a sequence, compared to the background population. * Minimising the disparity between a group's expected and actual exposures and learning the importance of the group relevance and background distributions. Figure 1: Task 1 submissions by individual component metrics (NDCG and AWRF). Higher values are better for both metrics. * Relevance-only ranking. Table 2 shows the submitted systems ranked by the official Task 2 metric EE-L and its component parts EE-D and EE-R. Figure 2 plots the runs with the component metrics on the \(x\) and \(y\) axes. Overall, the submitted systems generally performed better for one of the component metrics than they did for the other. There are, however, a cluster of four points in Figure 2 that make headway in the trade-off between EE-D and EE-L. ## 6 Limitations The data and metrics in this task address a few specific types of unfairness, and do so partially. This is fundamentally true of any fairness intervention, and does not in any way diminish the value of the effort -- it is impossible for any data set, task definition, or metric to fully capture fairness in a universal way, and all data and analyses have limitations. Some of the limitations of the data and task include: * **Fairness criteria* * **Geography**: For each Wikipedia article, we ascertained which, if any, continents are relevant to the content.5 This was determined by directly looking up several community-maintained (Wiki-data) structured data statements about the article. These properties were checked for the presence of countries, which were then mapped to continents via the United Nation's geoscheme.6 While this data must meet Wikidata's verifiability guidelines,7 it does suffer from varying levels of incompleteness. For example, only 73% of people on Wikidata have a country of citizenship property.8 Furthermore, structured data is itself limited--e.g., country of citizenship does not appropriately capture people who are considered stateless though these people may have many strong ties to a country. It is not easy to evaluate whether this data is missing at random or biased against certain regions of the world. Care should be taken when interpreting the absence of associated continents in the data. Further details can be found in the code repository.9 Footnote 5: Code: [https://github.com/geohci/wiki-region-groundtruth/blob/main/wiki-region-data.ipynb](https://github.com/geohci/wiki-region-groundtruth/blob/main/wiki-region-data.ipynb) Footnote 6: [https://en.wikipedia.org/wiki/United_Nations_geoscheme](https://en.wikipedia.org/wiki/United_Nations_geoscheme) Footnote 7: [https://www.wikidata.org/wiki/Wikidata:Verifiability](https://www.wikidata.org/wiki/Wikidata:Verifiability) \begin{table} \begin{tabular}{l c c c c} \hline \hline & EE-R & EE-D & EE-L & EE-L 95\% CI \\ \hline **RUN\_task2** & 9.5508 & 4.1557 & 14.9007 & (12.303, 19.946) \\ **pl\_control\_0.6** & 8.8091 & 3.2733 & 15.5017 & (12.552, 20.477) \\ **UoGTrRelT2** & 11.8281 & 9.4609 & 15.6514 & (13.057, 20.148) \\ **pl\_control\_0.8** & 8.6654 & 3.2550 & 15.7708 & (12.746, 21.251) \\ **pl\_control\_0.92** & 8.4802 & 3.1486 & 16.0348 & (12.820, 21.158) \\ **PL\_IRLab\_07** & 5.2790 & 1.5327 & 20.8213 & (16.283, 28.089) \\ **PL\_IRLab\_05** & 4.9331 & 1.4029 & 21.3832 & (16.579, 28.293) \\ **UoGTrDivPropT2** & 4.9372 & 7.1005 & 27.0726 & (21.098, 35.870) \\ **UoGTrDRelDiT2** & 3.4770 & 5.5891 & 28.4816 & (22.366, 37.739) \\ **UoGTrDExpDisT2** & 3.7459 & 6.1356 & 28.4903 & (22.571, 37.548) \\ **UoGTrLambT2** & 2.2447 & 3.4644 & 28.8216 & (22.799, 37.718) \\ \hline \hline \end{tabular} \end{table} Table 2: Task 2 runs. Lower EE-L is better. **Gender**: For each Wikipedia article, we also ascertained whether it is a biography, and, if so, which gender identity can be associated with the person it is about.10 This data is also directly determined via Wikidata based on the instance-of property indicating the article is about a human (P31:Q5 in Wikidata terms) and then collecting the value associated with the sex-or-gender property (P21). Coverage here is much higher at 99.98% of biographies on Wikipedia having associated gender data on Wikidata. Footnote 10: Code: [https://github.com/geohci/miscellaneous-wikimedia/blob/master/wikidata-properties-spark/wikidata_gender_information.ipynb](https://github.com/geohci/miscellaneous-wikimedia/blob/master/wikidata-properties-spark/wikidata_gender_information.ipynb) Assigning gender identities to people is not a process without errors, biases, and ethical concerns. Since we are using it to calculate aggregate statistics, we judged it to be less problematic than it would be if we were making decisions about individuals. The process for assigning gender is subject to some community-defined technical limitations11 and the Wikidata policy on living people12. While a separate project, English Wikipedia's policies on gender identity13 likely inform how many editors handle gender; in particular, this policy explicitly favors the most recent reliably-sourced _self-identification_ for gender, so misgendering a biography subject is a violation of Wikipedia policy; there may be erroneous data, but such data seems to be a violation of policy instead of a policy decision. Wikidata:WikiProject LGBT has documented some clear limitations of gender data on Wikidata and a list of further discussions and considerations.14 Footnote 11: [https://www.wikidata.org/wiki/Property_talk:P21#Documentation](https://www.wikidata.org/wiki/Property_talk:P21#Documentation) Footnote 12: [https://www.wikidata.org/wiki/Wikidata:Living_people](https://www.wikidata.org/wiki/Wikidata:Living_people) Footnote 13: [https://en.wikipedia.org/wiki/Wikipedia:Manual_of_Style/Gender_identity](https://en.wikipedia.org/wiki/Wikipedia:Manual_of_Style/Gender_identity) Footnote 14: [https://www.wikidata.org/wiki/Wikidata:WikiProject_LGBT/gender](https://www.wikidata.org/wiki/Wikidata:WikiProject_LGBT/gender) In our analysis (see Appendix A), we handle nonbinary gender identities by using 4 gender categories: unknown, male, female, and third. We advise great care when working with the gender data, particularly outside the immediate context of the TREC task (either its original instance or using the data to evaluate comparable systems). Figure 2: Task 2 submissions by expected exposure subcomponents. Lower EE-D is better; higher EE-R is better. * **Relevance Criteria* * **WikiProject Relevance**: For the training queries, relevance was obtained from page lists for existing WikiProjects. While WikiProjects have broad coverage of English Wikipedia and we selected for WikiProjects that had tagged new articles in the recent months in the training data as a proxy for activity, it is certain that almost all WikiProjects are incomplete in tagging relevant content (itself a strong motivation for this task). While it is not easy to measure just how incomplete they are, it should not be assumed that content that has not been tagged as relevant to a WikiProject in the training data is indeed irrelevant.15 Evaluation query relevance was assessed by NIST assessors, but the large sets of relevant documents and limited budget for working through the pool mean these lists are also incomplete. Footnote 15: Current Wikiproject tags were extracted from the database tables maintained by the PageAssessments extension: [https://www.mediawiki.org/wiki/Extension:PageAssessments](https://www.mediawiki.org/wiki/Extension:PageAssessments) * **Work-needed**: Our proxy for work-needed is a coarse proxy. It is based on just a few simple features (page length, sections, images, and references) and does not reflect the nuances of the work needed to craft a top-quality Wikipedia article.16 A fully-fledged system for supporting Wikiprojects would also include a more nuanced approach to understanding the work needed for each article and how to appropriately allocate this work. Footnote 16: For further details, see: [https://meta.wikimedia.org/wiki/Research:Prioritization_of_Wikipedia_Articles/Language-Agnostic_Quality#V1](https://meta.wikimedia.org/wiki/Research:Prioritization_of_Wikipedia_Articles/Language-Agnostic_Quality#V1) * **Task Definition* * **Existing Article Bias**: The task is limited to topics for which English Wikipedia already has articles. These tasks are not able to counteract biases in the processes by which articles come to exist (or are deleted [7])--recommending articles that should exist but don't is an interesting area for future study. * **Fairness constructs**: we focus on gender and geography in this challenge as two metrics for which there is high data coverage and clearer expectations about what "fairer" or more representative coverage might look like. That does not mean these are the most important constructs, but others--e.g., religion, sexuality, culture, race--generally are either more challenging to model or map to fairness goals [5].

2301.09857

Large amplitude problem of BGK model: Relaxation to quadratic nonlinearity

Bhatnagar-Gross-Krook (BGK) equation is a relaxation model of the Boltzmann equation which is widely used in place of the Boltzmann equation for the simulation of various kinetic flow problems. In this work, we study the asymptotic stability of the BGK model when the initial data is not necessarily close to the global equilibrium pointwisely. Due to the highly nonlinear structure of the relaxation operator, the argument developed to derive the bootstrap estimate for the Boltzmann equation leads to a weaker estimate in the case of the BGK model, which does not exclude the possible blow-up of the perturbation. To overcome this issue, we carry out a refined analysis of the macroscopic fields to guarantee that the system transits from a highly nonlinear regime into a quadratic nonlinear regime after a long but finite time, in which the highly nonlinear perturbative term relaxes to essentially quadratic nonlinearity.

Gi-Chan Bae, Gyounghun Ko, Donghyun Lee, Seok-Bae Yun

2023-01-24T08:18:38Z

http://arxiv.org/abs/2301.09857v2

# Large amplitude problem of BGK model: relaxation to quadratic nonlinearity ###### Abstract. Bhatnagar-Gross-Krook (BGK) equation is a relaxation model of the Boltzmann equation which is widely used in place of the Boltzmann equation for the simulation of various kinetic flow problems. In this work, we study the asymptotic stability of the BGK model when the initial data is not necessarily close to the global equilibrium pointwisely. Due to the highly nonlinear structure of the relaxation operator, the argument developed to derive the bootstrap estimate for the Boltzmann equation leads to a weaker estimate in the case of the BGK model, which does not exclude the possible blow-up of the perturbation. To overcome this issue, we carry out a refined analysis of the macroscopic fields to guarantee that the system transits from a highly nonlinear regime into a quadratic nonlinear regime after a long but finite time, in which the highly nonlinear perturbative term relaxes to essentially quadratic nonlinearity. ###### Contents * 1 Introduction * 1.1 BGK model * 1.2 Main theorem and scheme of proof * 2 Linearization and basic estimates * 3 Transition to quadratic nonlinear regime * 4 Local existence theory * 5 Control over the highly nonlinear regime and decay estimate * 5.1 Control of the macroscopic fields * 5.2 Global decay estimate * 5.3 Proof of main theorem * 6 Asymptotic stability for small amplitude regime * A Nonlinear part of the BGK operator ## 1. Introduction ### BGK model The Boltzmann equation is the fundamental equation bridging the particle description and the fluid description of gases [10, 11, 42, 43]. However, the high dimensionality of the equation and the complicated structure of the collision operator have been major obstacles in applying the Boltzmann equation to various flow problems in kinetic theory. In this regard, a relaxational model equation, which now goes by the name BGK model, was introduced in pursuit of a numerically amenable model of the Boltzmann equation [5, 45]: \[\begin{split}\partial_{t}F+v\cdot\nabla_{x}F&= \nu(\mathcal{M}(F)-F),\quad(t,x,v)\in\mathbb{R}^{+}\times\mathbb{T}^{3}\times \mathbb{R}^{3},\\ F(0,x,v)&=F_{0}(x,v).\end{split} \tag{1.1}\] Instead of tracking the complicated collision process using the collision operator of the Boltzmann equation, the BGK model captures the relaxation process by measuring the distance between the velocity distribution to its local equilibrium state: \[\mathcal{M}(F)(t,x,v):=\frac{\rho(t,x)}{\sqrt{(2\pi T(t,x))^{3}}}e^{-\frac{|x -U(t,x)|^{2}}{2T(t,x)}}.\] which is called the local Maxwellian. The macroscopic density \(\rho\), bulk velocity \(U\), and temperature \(T\) are defined by: \[\begin{split}&\rho(t,x):=\int_{\mathbb{R}^{3}}F(t,x,v)dv,\\ &\rho(t,x)U(t,x):=\int_{\mathbb{R}^{3}}F(t,x,v)vdv,\\ & 3\rho(t,x)T(t,x):=\int_{\mathbb{R}^{3}}F(t,x,v)|v-U(t,x)|^{2}dv. \end{split} \tag{1.2}\] Various forms are available for the collision frequency \(\nu\). In this work, we consider the collision frequency of the following form: \[\nu(t,x)=(\rho^{a}T^{b})(t,x),\quad a\geq b\geq 0, \tag{1.3}\] which covers most of the relevant models in the literature. The relaxation operator satisfies the following cancellation property because \(\mathcal{M}\) shares the first three moments with the distribution function: \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\left\{\mathcal{M}(F)-F\right\} \begin{pmatrix}1\\ v\\ |v|^{2}\end{pmatrix}dvdx=0. \tag{1.4}\] This leads to the conservation laws of mass, momentum, and energy: \[\frac{d}{dt}\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}F(t,x,v)\begin{pmatrix}1 \\ v\\ |v|^{2}\end{pmatrix}dvdx=0, \tag{1.5}\] and the celebrated H-theorem: \[\frac{d}{dt}\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}F(t)\ln F(t)dvdx=\int_{ \mathbb{T}^{3}\times\mathbb{R}^{3}}\{\mathcal{M}(F)-F\}\{\ln\mathcal{M}(F)- \ln F\}dvdx\leq 0.\] The first mathematical result was obtained in [35], in which Perthame obtained the global existence of weak solutions when the mass, energy, and entropy of the initial data are bounded. Perthame and Pulvirenti then found in [36] that the existence and uniqueness are guaranteed in a class of weighted \(L^{\infty}\) norm. This result was relaxed to \(L^{p}\) setting [51], extended to BGK models in the external field or mean-field [50] and ellipsoidal BGK [47]. The existence and asymptotic behavior of solutions to the BGK model near equilibrium was considered in [4, 46, 48, 49]. A stationary solution for the BGK model was found using the Schauder fixed point theorem in [34, 44]. The existence and uniqueness of stationary solutions to the BGK model in a slab were investigated in [3, 7]. The argument was extended to a relativistic BGK model [23] and the quantum BGK model [1]. Various macroscopic limits such as the hydrodynamic limit problem and diffusion limit can be found in [13, 30, 31, 40, 41]. For numerical studies on the BGK models, see [18, 24, 32, 33, 37, 38, 39] and references therein. In this paper, we consider \(L^{\infty}_{x,v}\) solution of the BGK equation. Low regularity \(L^{\infty}\) solution via \(L^{2}\)-\(L^{\infty}\) bootstrap argument was developed by Guo [20] to solve the Boltzmann equation with several boundary conditions. The approach was widely used and extended to solve various problems in more general boundaries and to get regularity results. We refer to [9, 12, 21, 22, 25, 26, 27, 28] and references therein. In these works, however, sufficiently small initial (weighted) \(L^{\infty}_{x,v}\) data had to be imposed to obtain global well-posedness and convergence to equilibrium. Restriction to small \(L^{\infty}_{x,v}\) initial data for the Boltzmann equation was removed by Duan et al [14] by imposing small relative entropy and \(L^{p}\) type smallness for initial data in [14, 16]. This type of problem is usually called large amplitude problem, because it allows initial data to be far from the global equilibrium pointwisely. This argument has been further developed into several boundary condition problems and polynomial tail in large velocity. See [8, 15, 16, 29]. Meanwhile, to the best of the author's knowledge, there has been only one result regarding the large amplitude problem of the BGK model [17]. Due to the strong nonlinearity of the relaxation operator of the BGK model, the authors introduced an additional condition which means that the initial data remains close to global Maxwellian \(\mu\) in a weighted \(L^{1}\) norm along the characteristic, as well as small relative entropy. Moreover, the asymptotic behavior was not obtained in [17]. In this paper, we remove the additional initial condition imposed in [17] by performing some refined controls of macroscopic fields which guarantee that the system transits into the quadratic nonlinear regime where we can use bootstrap argument to prove the global existence and convergence to the equilibrium. ### Main theorem and scheme of proof Let us write \(F=\mu+f\) where \(\mu=\mu(v)\) is the global equilibrium: \[\mu(v)=\frac{1}{\sqrt{(2\pi)^{3}}}e^{-\frac{|v|^{2}}{2}},\] and \(f\) denotes the perturbation around the equilibrium. In terms of \(f\), BGK equation (1.1) can be rewritten as \[\partial_{t}f+v\cdot\nabla_{x}f=Lf+\Gamma(f), \tag{1.6}\] where \(L\) denotes the linearized relaxation operator and \(\Gamma\) is nonlinear perturbation. For the derivation (1.6) and explicit form of \(L\) and \(\Gamma\), see Lemma 2.1. To state our main theorem, we need to define relative entropy: \[\mathcal{E}(F)(t)=\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}(F\ln F-\mu\ln\mu) dvdx=\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}F\ln\frac{F}{\mu}dvdx, \tag{1.7}\] where the last equality comes from (1.5). We also introduce some necessary notations: * We define \(q\)-th order velocity weight as \(\langle v\rangle^{q}:=1+|v|^{q}\). * We define the standard \(L^{\infty}\) norm \[\|F(t)\|_{L^{\infty}_{x,v}}:=\operatorname*{ess\,sup}_{(x,v)\in\mathbb{T}^{3} \times\mathbb{R}^{3}}|F(t,x,v)|,\] and weighted \(L^{\infty}\) norm as \[\|F(t)\|_{L^{\infty,q}_{x,v}}:=\operatorname*{ess\,sup}_{(x,v)\in\mathbb{T}^{ 3}\times\mathbb{R}^{3}}\langle v\rangle^{q}|F(t,x,v)|,\quad\|F(t)\|_{L^{ \infty}_{x,v}(m)}:=\operatorname*{ess\,sup}_{(x,v)\in\mathbb{T}^{3}\times \mathbb{R}^{3}}m(v)|F(t,x,v)|.\] * We denote standard \(L^{2}\) norm \[\|F\|_{L^{2}_{v}}:=\left(\int_{\mathbb{R}^{3}}|F(v)|^{2}dv\right)^{\frac{1}{2 }},\quad\|F\|_{L^{2}_{x,v}}:=\left(\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}| F(x,v)|^{2}dvdx\right)^{\frac{1}{2}},\] and weighted \(L^{2}\) norm as \[\|F\|_{L^{2}_{v}(m)}:=\left(\int_{\mathbb{R}^{3}}|m(v)F(v)|^{2}dv\right)^{\frac {1}{2}},\quad\|F\|_{L^{2}_{x,v}(m)}:=\left(\int_{\mathbb{T}^{3}\times\mathbb{ R}^{3}}|m(v)F(x,v)|^{2}dvdx\right)^{\frac{1}{2}}.\] * We define the pairing \(\langle\cdot,\cdot\rangle_{v}\) as (1.8) \[\langle g,h\rangle_{v}:=\int_{\mathbb{R}^{3}}g(v)h(v)dv,\quad\text{ if }\ gh\in L^{1}(\mathbb{R}^{3}_{v}).\] We are now ready to state our main theorem. **Theorem 1.1**.: _Let \(F_{0}\) is non-negative: \(F_{0}(x,v)=\mu(v)+f_{0}(x,v)\geq 0\), and satisfies_ \[\inf_{(t,x)\in[0,\infty)\times\mathbb{T}^{3}}\int_{\mathbb{R}^{3}}F_{0}(x-vt, v)dv\geq C_{0}, \tag{1.9}\] _for some positive constant \(C_{0}>0\). We also assume \(F_{0}\) shares the same mass, momentum, and energy with \(\mu\):_ \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}f_{0}(1,v,|v|^{2})dvdx=0. \tag{1.10}\] _Then, for any \(M_{0}>0\), there exists \(\varepsilon=\varepsilon(M_{0},C_{0})\) such that if initial data \(f_{0}\) satisfies \((q>10)\)_ \[\|f_{0}\|_{L^{\infty,q}_{x,v}}\leq M_{0},\quad\mathcal{E}(F_{0})\leq\varepsilon,\] _then there exists a unique global-in-time solution \(F(t,x,v)=\mu(v)+f(t,x,v)\) to the BGK model (1.6) with collision frequency (1.3). Moreover \(f\) satisfies_ \[\|f(t)\|_{L^{\infty,q}_{x,v}}\leq C_{M_{0}}e^{-kt},\] _where \(C_{M_{0}}\) depending on \(M_{0}\), and \(k\) are positive constants._ In previous results on the BGK model near the global equilibrium [4, 46, 48, 49], the fact that the macroscopic fields \((\rho,U,T)\) remains close to those of global equilibrium \((1,0,1)\) was crucially used to close energy estimates and derive asymptotic stability. Even for the large amplitude setting, developed in [17], conditions that corresponds more or less to the statement that the initial macroscopic fields lie close to the global equilibrium has to be imposed to control nonlinear terms and derive bootstrap estimates. To overcome this restriction, the relaxation of macroscopic fields into the equilibrium macroscopic fields \((1,0,1)\) has to be carefully investigated. In this regard, we divide the evolution of the solution into three different phases, namely, highly nonlinear regime, quadratic nonlinear regime, and small amplitude regime (See Figure 1). In the highly nonlinear regime, the amplitude of the perturbation can be arbitrarily large and its macroscopic fields are not necessarily close to \((1,0,1)\). We show that macroscopic fields relax to \((1,0,1)\) uniformly after a time \(t_{eq}\) which is the onset of the quadratic nonlinear regime. This enables us to carry out the crucial bootstrap argument. After a sufficiently large time \(t_{*}\), the solution enters the near-equilibrium regime (small amplitude regime) for which various existence theories are available. The major difficulties arise in the first two regimes in Figure 1 in which the amplitude of solutions is not necessarily small. In the study of the large-amplitude solution to the Boltzmann equation [14, 15, 16, 29], the fact that the perturbation term is only quadratically nonlinear was crucially used in the derivation of the following key bootstrap estimate: \[\|f(t)\|_{L^{\infty,q}_{x,v}}\lesssim C(\|f_{0}\|_{L^{\infty,q}_{x,v}})\left(1 +\int_{0}^{t}\|f(s)\|_{L^{\infty,q}_{x,v}}ds\right)e^{-\lambda t}+D,\quad D\ll 1.\] In the case of the BGK model, the typical term in the nonlinear perturbation \(\Gamma(f)\) looks like \[\sum_{1\leq i,j\leq 5}\mathcal{A}_{ij}(\rho,(v-U),U,T)\mathcal{M}(F)\int_{ \mathbb{R}^{3}}fe_{i}dv\int_{\mathbb{R}^{3}}fe_{j}dv, \tag{1.11}\] where \(\mathcal{A}_{ij}\) (\(1\leq i,j\leq 5\)) denote generic rational functions and \(e_{i}\) (\(i=1,\ldots,5\)) are the orthogonal basis of the null space of \(L\), and suffers from much stronger nonlinearity than the quadratic nonlinearity of the Boltzmann equation. In the presence of such strong nonlinearity, a naive Figure 1. Three different regimes computation would lead to the following estimate: \[\|f(t)\|_{L^{\infty,q}_{x,v}}\lesssim C(\|f_{0}\|_{L^{\infty,q}_{x,v}})\left(1+ \int_{0}^{t}\left[\|f(s)\|_{L^{\infty,q}_{x,v}}\right]^{n}ds\right)e^{-\lambda t }+D,\] where exponent \(n\) is determined by the order of nonlinearity of \(\Gamma\). Unfortunately, this does not exclude the possibility of a blow-up of \(\|f(t)\|_{L^{\infty,q}_{x,v}}\) and, therefore, cannot be applied to bootstrap arguments. To overcome this difficulty, we first note that the strong nonlinearity of (1.11) comes from the nonlinearity of \(\mathcal{A}_{ij}\). We will perform careful asymptotic analysis of \(\rho,U,T\) to show that after some finite time \(t_{eq}\) the nonlinearity of \(\mathcal{A}_{ij}\) essentially vanishes so that (1.11) become essential quadratically nonlinear. This enables one to derive the desired bootstrap inequality with \(n=1\) in the quadratic nonlinear regime. This paper is organized as follows. In Section 2, we consider the linearization of the BGK model and derive basic estimates for the macroscopic fields. In Section 3, under a priori assumption, we prove the key estimate to control the macroscopic fields. Especially, we obtain the transition time \(t_{eq}\) after which the solution enters the quadratic nonlinear regime. In Section 4, we prove the local-in-time existence and uniqueness of the BGK solutions. In Section 5, we show that the solution satisfies the desired bootstrap inequality in the quadratic nonlinear regime. In Section 6, we prove the well-posedness and exponential decay of the solution to the BGK equation in the small amplitude regime. In Appendix A, we present the explicit form of the nonlinear perturbation \(\Gamma\). ## 2. Linearization and basic estimates In this section, we recall the linearization of the BGK model (1.1), basic estimates for macroscopic fields. **Lemma 2.1**.: _[_2, 46_]_ _Let \(F=\mu+f\). Then the BGK model (1.1) can be rewritten in terms of \(f\) as follows:_ \[\partial_{t}f+v\cdot\nabla_{x}f+f=\mathbf{P}f+\Gamma(f). \tag{2.1}\] _The linear term \(\mathbf{P}f\) is defined as_ \[\mathbf{P}f=\int_{\mathbb{R}^{3}}fdv\mu+\int_{\mathbb{R}^{3}}fvdv\cdot(v\mu)+ \int_{\mathbb{R}^{3}}f\frac{|v|^{2}-3}{\sqrt{6}}dv\left(\frac{|v|^{2}-3}{\sqrt {6}}\mu\right)=\sum_{i=1}^{5}\langle f,e_{i}\rangle_{v}(e_{i}\mu), \tag{2.2}\] _where we used the pairing notation \(\langle\cdot,\cdot\rangle_{v}\) in (1.8) and \((e_{1},\cdots,e_{5})=(1,v,(|v|^{2}-3)/\sqrt{6})\). The nonlinear term \(\Gamma(f)\) is written as_ \[\Gamma(f)=\Gamma_{1}(f)+\Gamma_{2}(f). \tag{2.3}\] _Here,_ \[\Gamma_{1}(f)=(\mathbf{P}f-f)\sum_{1\leq i\leq 5}\int_{0}^{1}A_{i}(\theta)d \theta\langle f,e_{i}\rangle_{v},\] _(precise definition of \(A_{i}(\theta)\) is given in (2.7)) and_ \[\begin{split}\Gamma_{2}(f)&=\rho^{a}T^{b}\sum_{1\leq i,j\leq 5}\int_{0}^{1}\left[\nabla^{2}_{(\rho_{\theta},\rho_{\theta}U_{\theta},G_{ \theta})}\mathcal{M}(\theta)\right]_{ij}(1-\theta)d\theta\langle f,e_{i} \rangle_{v}\langle f,e_{j}\rangle_{v}\\ &=\rho^{a}T^{b}\sum_{1\leq i,j\leq 5}\int_{0}^{1}\frac{\mathcal{P}_{ ij}((v-U_{\theta}),U_{\theta},T_{\theta})}{\rho_{\theta}^{\alpha_{ij}}T_{ \theta}^{\beta_{ij}}}\mathcal{M}(\theta)(1-\theta)d\theta\int_{\mathbb{R}^{3} }fe_{i}dv\int_{\mathbb{R}^{3}}fe_{j}dv,\end{split} \tag{2.4}\] _where the transition of the macroscopic fields are defined as_ \[\rho_{\theta}=\theta\rho+(1-\theta),\qquad\rho_{\theta}U_{\theta}=\theta\rho U,\qquad\rho_{\theta}|U_{\theta}|^{2}+3\rho_{\theta}T_{\theta}-3\rho_{\theta}= \theta(\rho|U|^{2}+3\rho T-3\rho). \tag{2.5}\] _Here, \(\mathcal{P}_{ij}\) denotes a generic polynomial such that \(\mathcal{P}_{ij}(x_{1},\cdots,x_{n})=\sum_{m}a_{m}^{ij}x_{1}^{m_{1}}\cdots x_{n }^{m_{n}}\) and \(\alpha_{ij},\beta_{ij}\geq 0\). Precise definitions of \(\alpha_{ij},\beta_{ij}\), and \(\mathcal{P}_{ij}\) are given in Appendix A._ Proof.: The linearization of the local Maxwellian \(\mathcal{M}(F)\) and \(\nu(t,x)\) can be found in [46] and [2], respectively. But for the reader's convenience, we briefly sketch the proof here. The main idea of linearization is constructing a convex combination of the following macroscopic fields: \[\rho=\int_{\mathbb{R}^{3}}\mu+fdv,\quad\rho U=\int_{\mathbb{R}^{3}}vfdv,\quad G =\frac{\rho|U|^{2}+3\rho T-3\rho}{\sqrt{6}}=\int_{\mathbb{R}^{3}}\frac{|v|^{2} -3}{\sqrt{6}}fdv. \tag{2.6}\] We note that the mapping of the macroscopic fields \((\rho,U,T)\leftrightarrow(\rho,\rho U,G)\) is one to one if \(\rho>0\) because of the following reverse relation: \[U=\frac{\rho U}{\rho},\qquad T=\sqrt{\frac{2}{3}}\frac{G}{\rho}-\frac{|\rho U| ^{2}}{3\rho^{2}}+1.\] Using the transition of the macroscopic fields (2.5), we write the local Maxwellian depending on \((\rho_{\theta},U_{\theta},T_{\theta})\) as \(\mathcal{M}(\theta)\) and we apply Taylor's theorem at \(\theta=0\). \[\mathcal{M}(1)=\mathcal{M}(0)+\frac{d\mathcal{M}(\theta)}{d\theta}\bigg{|}_{ \theta=0}+\int_{0}^{1}\frac{d^{2}\mathcal{M}(\theta)}{d\theta^{2}}(1-\theta)d\theta.\] Since \((\rho_{\theta},U_{\theta},T_{\theta})|_{\theta=1}=(\rho,U,T)\) and \((\rho_{\theta},U_{\theta},T_{\theta})|_{\theta=0}=(1,0,1)\), we have \(\mathcal{M}(1)=\mathcal{M}(F)\) and \(\mathcal{M}(0)=\mu\), respectively. Then we consider the first derivative of \(\mathcal{M}(\theta)\): \[\frac{d\mathcal{M}(\theta)}{d\theta}\bigg{|}_{\theta=0} = \frac{d\rho_{\theta}}{d\theta}\frac{\partial\mathcal{M}(\theta)} {\partial\rho_{\theta}}+\frac{d(\rho_{\theta}U_{\theta})}{d\theta}\frac{ \partial\mathcal{M}(\theta)}{\partial(\rho_{\theta}U_{\theta})}+\frac{dG_{ \theta}}{d\theta}\frac{\partial\mathcal{M}(\theta)}{\partial G_{\theta}}\] \[=\] where we used that the last definition of (2.5) is equivalent to \(G_{\theta}=\theta G\). Then substituting the computation of the Jacobian and \(\nabla_{(\rho_{\theta},U_{\theta},T_{\theta})}\mathcal{M}(\theta)\) in Lemma A.1 at \(\theta=0\) with \[\left(\frac{d(\rho_{\theta},\rho_{\theta}U_{\theta},G_{\theta})}{d\theta} \right)=\left(\int_{\mathbb{R}^{3}}fdv,\int_{\mathbb{R}^{3}}vfdv,\int_{ \mathbb{R}^{3}}\frac{|v|^{2}-3}{\sqrt{6}}fdv\right),\] we obtain that \[\frac{d\mathcal{M}(\theta)}{d\theta}\bigg{|}_{\theta=0}=\mathbf{P}f.\] For the nonlinear term, applying the chain rule twice yields \[\frac{d^{2}\mathcal{M}(\theta)}{d\theta^{2}} = (\rho-1,\rho U,G)^{T}\left\{D^{2}_{(\rho_{\theta},\rho_{\theta}U _{\theta},G_{\theta})}\mathcal{M}(\theta)\right\}(\rho-1,\rho U,G)\] \[= \left[\nabla^{2}_{(\rho_{\theta},\rho_{\theta}U_{\theta},G_{ \theta})}\mathcal{M}(\theta)\right]_{ij}\langle f,e_{i}\rangle_{v}\langle f,e_ {j}\rangle_{v}.\] The explicit form of \(\nabla^{2}_{(\rho_{\theta},\rho_{\theta}U_{\theta},G_{\theta})}\mathcal{M}(\theta)\) will be given in Appendix A. Now we consider the collision frequency \(\nu=\rho^{a}T^{b}\). We define \(\nu(\theta)=\rho_{\theta}^{a}T_{\theta}^{b}\), and by Taylor's theorem, we have \[\nu(1)=\nu(0)+\int_{0}^{1}\frac{d}{d\theta}\nu(\theta)d\theta.\] By an explicit computation, we have \[\nu(t,x)=1+\sum_{1\leq i\leq 5}\int_{0}^{1}A_{i}(\theta)d\theta\langle f,e_{i} \rangle_{v},\] where \[\begin{split} A_{1}(\theta)&=a\rho_{\theta}^{a-1}T_ {\theta}^{b},\qquad A_{i+1}(\theta)=-a\rho_{\theta}^{a-2}U_{\theta i}T_{\theta }^{b},\quad i=1,2,3,\\ A_{5}(\theta)&=\frac{|U_{\theta}|^{2}-3T_{\theta}+3 }{3\rho_{\theta}}a\rho_{\theta}^{a-1}T_{\theta}^{b}+\sqrt{\frac{2}{3}}b\rho_{ \theta}^{a-1}T_{\theta}^{b-1}.\end{split} \tag{2.7}\] Therefore, we obtain \[\nu(\mathcal{M}(F)-F)=(\mathbf{P}f-f)+\Gamma_{1}(f)+\Gamma_{2}(f).\] **Lemma 2.2**.: _Recall the macroscopic fields defined in (1.2). Let \((t,x)\in\mathbb{R}^{+}\times\mathbb{T}^{3}\) and \(q>5\). Then, we have the upper bounds for macroscopic fields:_ \[\left(\begin{array}{c}\rho(t,x)\\ \rho(t,x)U(t,x)\\ 3\rho(t,x)T(t,x)+\rho(t,x)|U(t,x)|^{2}\end{array}\right)=\int_{\mathbb{R}^{3}} F(t,x,v)\left(\begin{array}{c}1\\ v\\ |v|^{2}\end{array}\right)dv\leq C_{q}\sup_{0\leq s\leq t}\|F(s)\|_{L^{\infty,q}_{ x,v}},\] _where \(C_{q}=\frac{1}{5}+\frac{1}{q-5}\)._ Proof.: We only consider the last inequality since the other inequalities are similar. Note that \[\int_{\mathbb{R}^{3}}|v|^{2}Fdv=\int_{\mathbb{R}^{3}}\frac{\langle v\rangle^{q }}{\langle v\rangle^{q}}|v|^{2}Fdv\leq\int_{\mathbb{R}^{3}}\frac{1}{\langle v \rangle^{q}}|v|^{2}dv\|F(s)\|_{L^{\infty,q}_{v}}.\] Then by the following explicit computation \[\int_{\mathbb{R}^{3}}|v|^{2}\langle v\rangle^{-q}dv=4\pi\int_{0}^{\infty} \frac{|v|^{4}}{1+|v|^{q}}d|v|\leq 4\pi\left(\int_{0}^{1}|v|^{4}d|v|+\int_{1}^{ \infty}|v|^{4-q}d|v|\right)\leq\frac{1}{5}+\frac{1}{q-5},\] we obtain desired result. We present some \(L^{\infty}\) estimates for the macroscopic fields: **Lemma 2.3**.: _[_36_]_ _Consider a non-negative function \(F\in L^{\infty}_{x}(\mathbb{T}^{3})L^{1}_{v}(\mathbb{R}^{3})\) and recall corresponding macroscopic fields defined in (1.2). The macroscopic fields enjoy the following estimates:_ \[\begin{array}{l}(1)\ \frac{\rho}{T^{\frac{3}{2}}}\leq C\|F\|_{L^{ \infty}_{x,v}},\\ (2)\ |v|^{q}\mathcal{M}(F)\leq C_{q}\|F\|_{L^{\infty,q}_{x,v}},\qquad\text{ for }\qquad q=0,\quad 5<q.\end{array}\] Proof.: We refer to [36]. ## 3. Transition to quadratic nonlinear regime As mentioned before, the highly nonlinear behavior of the BGK operator combined with large amplitude \(\|f(s)\|_{L^{\infty,q}_{x,v}}\) is one of the main obstacles in proving the asymptotic behavior of the solution. In this section, we prove that the macroscopic fields \((\rho,U,T)\) are uniformly close to \((1,0,1)\) for \(t\geq t_{eq}\) so that \(\Gamma\) of (2.3) becomes quadratic nonlinear in terms of \(f\). We also note that \(t_{eq}\) should be chosen so that it depends only on initial data and other generic constants. Throughout this section, we impose a priori assumption \[\sup_{0\leq s\leq t_{*}}\|f(s)\|_{L^{\infty,q}_{x,v}}\leq\overline{M},\quad \text{for}\quad q>10, \tag{3.1}\] where \(t_{*}\) is arbitrary large as much as needed. Both \(\overline{M}\) and \(t_{*}\) will be chosen depending on initial data in the proof of Theorem 1.1 in Section 5. **Proposition 3.1**.: _Let us assume (1.9) and the a priori assumption (3.1). For any given positive constant \(\delta\in(0,1)\), there exists sufficiently small \(\mathcal{E}(\overline{M},t_{*},\delta)\) such that if \(\mathcal{E}(F_{0})\leq\mathcal{E}(\overline{M},t_{*},\delta)\), then the following estimate holds on \(t\in[0,t_{*}]\):_ \[\left|\int_{\mathbb{R}^{3}}\langle v\rangle^{2}f(t,x,v)dv\right|\leq C_{q}M_{ 0}e^{-t}+\frac{3}{4}\delta. \tag{3.2}\] The above proposition implies the following two important properties. First, the macroscopic fields \((\rho,U,T)\) become uniformly close to \((1,0,1)\) after time \(t\geq t_{eq}(M_{0},\delta)\), i.e., \[|\rho-1|,\ |\rho U|,\ |3\rho T+\rho|U|^{2}-3|\leq\delta,\quad\text{for}\quad t \geq t_{eq}.\] This will be proved in Lemma 3.7. And after \(t_{eq}\), the high order nonlinearity of \(\Gamma\) on the BGK model is transformed into quadratic nonlinear form for which we are able to prove the asymptotic behavior of the solution. To prove Proposition 3.1, we first decompose the L.H.S of (3.2) into several pieces. **Lemma 3.1**.: _Let us assume the a priori assumption (3.1). For an arbitrary real number \(N>1\), we have_ \[\left|\int_{\mathbb{R}^{3}}\langle v\rangle^{2}f(t,x,v)dv\right| \leq C_{q}M_{0}e^{-t}+\frac{C_{q}}{N^{q-5}}\overline{M}\] \[\quad+\int_{0}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2}| \mathbf{P}f(s,x-v(t-s),v)|dvds\] \[\quad+\int_{0}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2}| \Gamma(f)(s,x-v(t-s),v)|dvds.\] Proof.: We split the velocity integration into \(\{|v|\leq N\}\) and \(\{|v|\geq N\}\) for arbitrary real number \(N>1\): \[\int_{\mathbb{R}^{3}}\langle v\rangle^{2}f(t,x,v)dv=\int_{|v|\geq N}\langle v \rangle^{2}f(t,x,v)dv+\int_{|v|\leq N}\langle v\rangle^{2}f(t,x,v)dv.\] For the large velocity region \(\{|v|\geq N\}\), applying the a priori bound \(\sup_{0\leq s\leq t_{*}}\|f(s)\|_{L^{\infty,v}_{*,v}}\leq\overline{M}\), we have \[\left|\int_{|v|\geq N}\langle v\rangle^{2}f(t,x,v)dv\right|\leq\int_{|v|\geq N }\langle v\rangle^{-q+2}\langle v\rangle^{q}|f(t,x,v)|dv\leq\frac{C_{q}}{N^{q -5}}\overline{M},\] for \(t\in[0,t_{*}]\). For the bounded velocity region \(\{|v|\leq N\}\), we use the mild formulation of the reformulated BGK equation (2.1) to get \[\begin{split}\left|\int_{|v|\leq N}\langle v\rangle^{2}f(t,x,v) dv\right|&\leq e^{-t}\int_{|v|\leq N}\langle v\rangle^{2}|f_{0}(x-vt,v)|dv \\ &\quad+\int_{0}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2} |\mathbf{P}f(s,x-v(t-s),v)|dvds\\ &\quad+\int_{0}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2} |\Gamma(f)(s,x-v(t-s),v)|dvds.\end{split} \tag{3.3}\] The first term on the R.H.S of (3.3) is bounded as follows: \[e^{-t}\int_{|v|\leq N}\langle v\rangle^{2}|f_{0}(x-vt,v)|dv=e^{-t}\int_{|v| \leq N}\langle v\rangle^{-q+2}\langle v\rangle^{q}|f_{0}(x-vt,v)|dv\leq C_{q} e^{-t}M_{0},\] which gives the desired result. The estimates for the second and third terms on the R.H.S of (3.3) will be given in Lemma 3.3 and Lemma 3.6, respectively. Before we present the estimate of the second term of (3.3), we note the following important property about the relative entropy. Since H-theorem holds for the BGK equation, the proof of the following Lemma is very similar to that of [19] or [29]. For the convenience of readers, we provide detailed proof. **Lemma 3.2**.: _[_17, 19, 29_]_ _Assume that \(F(t,x,v)=\mu(v)+f(t,x,v)\) is a solution of the BGK model (1.1). For any \(t\geq 0\), we have_ \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\frac{1}{4\mu(v)}|f(t,x,v)|^{2} \mathbf{1}_{|f(t,x,v)|\leq\mu(v)}dvdx+\int_{\mathbb{T}^{3}\times\mathbb{R}^{3 }}\frac{1}{4}|f(t,x,v)|\mathbf{1}_{|f(t,x,v)|>\mu(v)}dvdx\leq\mathcal{E}(F_{0}),\] _where initial relative entropy \(\mathcal{E}(F_{0})\) was defined in (1.7)._ Proof.: Notice that the mean value theorem gives \[F\ln F-\mu\ln\mu=(1+\ln\mu)(F-\mu)+\frac{1}{2\tilde{F}}|F-\mu|^{2},\] where \(\tilde{F}\) is between \(F\) and \(\mu\). If we define the function \(\psi(x):=x\ln x-x+1\), we have \[\frac{1}{2\tilde{F}}|F-\mu|^{2}=F\ln F-\mu\ln\mu-(1+\ln\mu)(F-\mu)=\psi\left( \frac{F}{\mu}\right)\mu.\] Hence, one obtains that \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\frac{1}{2\tilde{F}}|F-\mu|^{2}dvdx=\int_ {\mathbb{T}^{3}\times\mathbb{R}^{3}}\psi\left(\frac{F}{\mu}\right)\mu dvdx. \tag{3.4}\] For the L.H.S in (3.4), we divide \[1=\mathbf{1}_{|F-\mu|\leq\mu}+\mathbf{1}_{|F-\mu|>\mu}.\] On \(\{|F-\mu|>\mu\}\), we have \[\frac{|F-\mu|}{\tilde{F}}=\frac{F-\mu}{\tilde{F}}>\frac{F-\frac{1}{2}F}{F}= \frac{1}{2},\] where we used the fact \(F>2\mu\). On the other hand, over \(\{|F-\mu|\leq\mu\}\), we obtain \(0\leq F\leq 2\mu\). This implies that \[\frac{1}{\tilde{F}}\geq\frac{1}{2\mu}.\] Thus, it follows from (3.4) that \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\frac{1}{4\mu}|F-\mu|^{2}\mathbf{1}_ {|F-\mu|\leq\mu}dvdx+\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\frac{1}{4}|F- \mu|\mathbf{1}_{|F-\mu|>\mu}dvdx\leq\int_{\mathbb{T}^{3}\times\mathbb{R}^{3} }\psi\left(\frac{F}{\mu}\right)\mu dvdx. \tag{3.5}\] By \(\psi^{\prime}(x)=\ln x\), we can deduce from (1.1) that \[\partial_{t}\left[\mu\psi\left(\frac{F}{\mu}\right)\right]+\nabla_{x}\cdot \left[\mu\psi\left(\frac{F}{\mu}\right)v\right]=\nu(\mathcal{M}(F)-F)\ln\frac{ F}{\mu}.\] By taking integration over \((x,v)\in\mathbb{T}^{3}\times\mathbb{R}^{3}\), we obtain \[\frac{d}{dt}\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\psi\left(\frac{F}{\mu} \right)\mu dvdx=\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\nu(\mathcal{M}(F)-F )\ln Fdvdx.\] Because of the following inequality \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\nu(\mathcal{M}(F)-F)\ln Fdvdx\leq 0,\] we get \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\psi\left(\frac{F}{\mu}\right)\mu dvdx \leq\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\psi\left(\frac{F_{0}}{\mu} \right)\mu dvdx=\mathcal{E}(F_{0}). \tag{3.6}\] Combining (3.5) and (3.6) yields that \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\frac{1}{4\mu}|F-\mu|^{2}\mathbf{1} _{|F-\mu|\leq\mu}dvdx+\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}\frac{1}{4}|F- \mu|\mathbf{1}_{|F-\mu|>\mu}dvdx\leq\mathcal{E}(F_{0}).\] We complete the proof of Lemma 3.2. Now, we estimate the linear \(\mathbf{P}f\) part on the R.H.S of (3.3). **Lemma 3.3**.: _For \(q>5\), if a priori assumption (3.1) holds, then we have the following estimate_ \[\int_{0}^{t}\int_{|v|\leq N}e^{-(t-s)}\langle v\rangle^{2}| \mathbf{P}f(s,x-v(t-s),v)|dvds \leq C_{q}N^{5}(1-e^{-\lambda})\overline{M}+\frac{C_{q}}{N^{q-10} }\overline{M}\] \[\quad+CN^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}(F_{0})+N^{ \frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right),\] _for some arbitrary constants \(N>1\) and \(\lambda\in(0,t)\)._ Proof.: We split the integration region into \(I\), \(II_{1}\), and \(II_{2}\) as follows: \[\int_{0}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2}|\mathbf{P}f(s,x-v(t-s ),v)|dvds\leq I+II_{1}+II_{2},\] where \[I =\int_{t-\lambda}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2 }\int_{\mathbb{R}^{3}}|f(s,x-v(t-s),u)|(1+|u|+|u|^{2})dudvds,\] \[II_{1} =\int_{0}^{t-\lambda}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2 }\int_{|u|\geq 2N}|f(s,x-v(t-s),u)|(1+|u|+|u|^{2})dudvds,\] \[II_{2} =\int_{0}^{t-\lambda}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2 }\int_{|u|\leq 2N}|f(s,x-v(t-s),u)|(1+|u|+|u|^{2})dudvds,\] for a positive constant \(\lambda\in(0,t)\). (Estimate of \(I\)) Multiplying and dividing \(\langle u\rangle^{q}\), we have \[I \leq\int_{t-\lambda}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v \rangle^{2}\int_{\mathbb{R}^{3}}\langle u\rangle^{-q+2}\langle u\rangle^{q}|f (s,x-v(t-s),u)|dudvds\] \[\leq C_{q}N^{5}(1-e^{-\lambda})\sup_{0\leq s\leq t_{*}}\|f(s)\|_ {L^{\infty,q}_{x,v}}\] \[\leq C_{q}N^{5}(1-e^{-\lambda})\overline{M}, \tag{3.7}\] where we used \(\int_{|v|\leq N}\langle v\rangle^{2}dv\leq CN^{5}\) and \(\int_{\mathbb{R}^{3}}\langle u\rangle^{-q+2}du\leq C_{q}\) for \(q>5\). (Estimate of \(II_{1}\)) Similarly, we multiply and divide \(\langle u\rangle^{q}\) on \(II_{1}\): \[II_{1} =\int_{0}^{t-\lambda}e^{-(t-s)}\int_{|v|\leq N}\int_{|u|\geq 2N} \langle v\rangle^{2}|f(s,x-v(t-s),u)|(1+|u|+|u|^{2})dudvds\] \[\leq\int_{0}^{t-\lambda}e^{-(t-s)}ds\int_{|v|\leq N}\langle v \rangle^{2}dv\int_{|u|\geq 2N}\langle u\rangle^{-q+2}du\sup_{0\leq s\leq t_{*}} \|f(s)\|_{L^{\infty,q}_{x,v}}\] \[\leq\frac{C_{q}}{N^{q-10}}\overline{M}, \tag{3.8}\] where we used \(\int_{|v|\leq N}\langle v\rangle^{2}dv\leq CN^{5}\) and \(\int_{|u|\geq 2N}\langle u\rangle^{-q+2}du\leq CN^{-q+5}\) for \(q>5\). (Estimate of \(II_{2}\)) Using the upper bound \(\langle v\rangle^{2}\leq N^{2}\) and \((1+|u|+|u|^{2})\leq 4N^{2}\), we have \[II_{2}\leq 4N^{6}\int_{0}^{t-\lambda}e^{-(t-s)}\int_{|v|\leq N}\int_{|u|\leq 2 N}|f(s,x-v(t-s),u)|dudvds.\] Then we apply a change of variable \(y=x-v(t-s)\) with \(dy=-(t-s)^{3}dv\) to make a change \(dv\) integral to space integral \(dy\). Such a change of variable transforms the integral region \(\{|v|\leq N\}\) to a sphere with a center \(x\) and radius \(v(t-s)\). We note that the maximum radius is \(N(t-s)\). Since the space variable is in the torus, if \(N(t-s)\geq 1\), then the maximum number of cubic reached by \(y\) is \((N(t-s))^{3}\). Conversely, if \(N(t-s)\leq 1\), then the minimum number of cubic reached by \(y\) is \(1\). Thus we have \[II_{2}\leq 4N^{6}\int_{0}^{t-\lambda}e^{-(t-s)}\frac{1+(N(t-s))^{3}}{(t-s)^{3}} \int_{\mathbb{T}^{3}}\int_{|u|\leq 2N}|f(s,y,u)|dudyds.\] In order to apply Lemma 3.2, we split the integral region into \(\{|f|>\mu\}\) and \(\{|f|\leq\mu\}\), and we multiply \(1/\sqrt{\mu(u)}\geq 1\) on the region \(\{|f|\leq\mu\}\): \[II_{2} \leq 4N^{6}\int_{0}^{t-\lambda}e^{-(t-s)}\frac{1+(N(t-s))^{3}}{(t- s)^{3}}\left(\int_{\mathbb{T}^{3}}\int_{|u|\leq 2N}|f(s,y,u)|\mathbf{1}_{|f(s,y,u)|> \mu(u)}dudy\right.\] \[\left.+\int_{\mathbb{T}^{3}}\int_{|u|\leq 2N}\frac{1}{\sqrt{\mu(u)}}|f (s,y,u)|\mathbf{1}_{|f(s,y,u)|\leq\mu(u)}dudy\right)ds.\] By the Holder inequality on the second term, and applying Lemma 3.2, we have \[\begin{split} II_{2}&\leq CN^{6}\int_{0}^{t-\lambda}e^{ -(t-s)}\frac{1+(N(t-s))^{3}}{(t-s)^{3}}\left[\int_{\mathbb{T}^{3}}\int_{|u| \leq 2N}|f(s,y,u)|\mathbf{1}_{|f(s,y,u)|>\mu(u)}dudy\right.\\ &\left.+\left(\int_{\mathbb{T}^{3}}\int_{|u|\leq 2N}\frac{1}{\mu(u)}|f (s,y,u)|^{2}\mathbf{1}_{|f(s,y,u)|\leq\mu(u)}dudy\right)^{\frac{1}{2}}\left( \int_{\mathbb{T}^{3}}\int_{|u|\leq 2N}1dudy\right)^{\frac{1}{2}}\right]ds\\ &\leq CN^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}(F_{0})+N^{ \frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right),\end{split} \tag{3.9}\] where we used \[\int_{0}^{t-\lambda}e^{-(t-s)}\frac{1+(N(t-s))^{3}}{(t-s)^{3}}ds=\int_{\lambda }^{t}e^{-\tau}\frac{1+(N\tau)^{3}}{\tau^{3}}d\tau\leq C(\lambda^{-2}+N^{3}).\] Combining (3.7), (3.8) and (3.9), we finish the proof. The third term of the R.H.S of (3.3) has the nonlinear term \(\Gamma(f)\). To control the nonlinear term, we should control the macroscopic fields under a priori assumption (3.1). **Lemma 3.4**.: _Assume (1.9) and (3.1). Then the macroscopic fields \((\rho,U,T)\) are bounded as follows:_ \[\begin{split}&(1)\ C_{0}e^{-C_{q}\overline{M}^{a}t}\leq\rho(t,x )\leq C_{q}\overline{M},\\ &(2)\ |U(t,x)|\leq C_{q}\overline{M}e^{C_{q}\overline{M}^{a}t},\\ &(3)\ C\overline{M}^{-\frac{2}{3}}e^{-\frac{2}{3}C_{q}\overline{ M}^{a}t}\leq T(t,x)\leq C_{q}\overline{M}e^{C_{q}\overline{M}^{a}t},\end{split} \tag{3.10}\] _for a generic constant \(C_{q}\)._ Proof.: Note that the collision frequency \(\nu(t,x)=\rho^{a}T^{b}\) for \(a\geq b\) is bounded as \[\nu(t,x)=\rho^{a}T^{b}=(\rho)^{a-b}(\rho T)^{b}\leq C_{q}\sup_{0\leq s\leq t_{ *}}\|F(s)\|_{L^{a}_{x,v},}^{a}, \tag{3.11}\] by Lemma 2.2. The estimates for the macroscopic fields in Lemma 2.2 and the estimate for collision frequency in (3.11) yields \[(\rho,\rho U,3\rho T+\rho|U|^{2})\leq C_{q}\overline{M},\qquad\nu\leq C_{q} \overline{M}^{a}. \tag{3.12}\] (1) The lower bound of \(\rho\) comes from the mild formulation of the BGK model, \[\begin{split} F(t,x,v)&=e^{-\int_{0}^{t}\nu(\tau,x-v(t-\tau))d\tau}F_{0}(x-vt,v)\\ &\quad+\int_{0}^{t}e^{-\int_{x}^{t}\nu(\tau,x-v(t-\tau))d\tau} \mathcal{M}(F)(s,x-v(t-s),v)ds.\end{split}\] Combining with the upper bound of \(\nu\) in (3.12) and using (1.9), we get \[\rho(t,x)=\int_{\mathbb{R}^{3}}F(t,x,v)dv\geq\int_{\mathbb{R}^{3}}e^{-\int_{0 }^{t}\nu(\tau,x-v\tau)d\tau}F_{0}(x-vt,v)dv\geq C_{0}e^{-C_{q}\overline{M}^{a }t}. \tag{3.13}\] (2) Applying (3.13), we have \[|U|=\frac{|\rho U|}{\rho}\leq\frac{C_{q}\overline{M}}{C_{0}e^{-C_{q}\overline {M}^{a}t}}\leq C_{q}\overline{M}e^{C_{q}\overline{M}^{a}t}.\] (3) Similar to (2), we have the following upper bound of the temperature. \[|T|=\frac{3\rho T+\rho|U|^{2}}{3\rho}-\frac{1}{3}|U|^{2}\leq\frac{C_{q} \overline{M}}{3C_{0}e^{-C_{q}\overline{M}^{a}t}}\leq C_{q}\overline{M}e^{C_{q} \overline{M}^{a}t}.\] For the lower bound of the temperature, we use (1) in Lemma 2.3 and (3.13) to obtain \[T^{\frac{3}{2}}\geq\frac{\rho}{C\|F\|_{L^{\infty}_{x,v}}}\geq\frac{C_{0}e^{-C_ {q}\overline{M}^{a}t}}{C\overline{M}}\geq\frac{C}{\overline{M}}e^{-C_{q} \overline{M}^{a}t}.\] **Lemma 3.5**.: _Let (1.9) and the a priori assumption (3.1) hold. Then the transitions of the macroscopic fields \((\rho_{\theta},\,U_{\theta},\,T_{\theta})\) enjoy the following estimates_ \[\begin{split}&(1)\ C_{0}e^{-C_{q}\overline{M}^{-t}}\leq\rho_{ \theta}\leq C_{q}\overline{M},\\ &(2)\ |U_{\theta}|\leq C_{q}\overline{M}e^{C_{q}\overline{M}^{-t}},\\ &(3)\ C_{q}\overline{M}^{-\frac{5}{3}}e^{-\frac{5}{3}C_{q} \overline{M}^{-t}}\leq T_{\theta}\leq C_{q}\overline{M}e^{C_{q}\overline{M}^{ -t}},\end{split} \tag{3.14}\] _for \(0\leq\theta\leq 1\) and some generic constant \(C_{q}\)._ Proof.: Recall the definition of the transition of the macroscopic fields in (2.5): \[\rho_{\theta}=\theta\rho+(1-\theta),\quad\rho_{\theta}U_{\theta}=\theta\rho U,\quad 3\rho_{\theta}T_{\theta}+\rho_{\theta}|U_{\theta}|^{2}-3\rho_{\theta}= \theta(3\rho T+\rho|U|^{2}-3\rho).\] (1) Applying the upper and lower bound of \(\rho\) from \(\eqref{eq:1}_{1}\) in Lemma 3.4, we have \[\rho_{\theta}=\theta\rho+(1-\theta)\leq\theta C_{q}\overline{M}+(1-\theta) \leq C_{q}\overline{M},\] \[\rho_{\theta}=\theta\rho+(1-\theta)\geq\theta C_{0}e^{-C_{q}\overline{M}^{-t} }+(1-\theta)\geq C_{0}e^{-C_{q}\overline{M}^{-t}}.\] (2) Upper bound of \(\rho U\) in (3.12) and the lower bound of \(\rho_{\theta}\) (3.14)\({}_{1}\) yield \[|U_{\theta}|=\left|\frac{\theta\rho U}{\rho_{\theta}}\right|\leq\frac{\theta C _{q}\overline{M}}{C_{0}e^{-C_{q}\overline{M}^{-t}}}\leq C_{q}\overline{M}e^{C _{q}\overline{M}^{-t}}.\] (3) By the definition of \(T_{\theta}\), we have \[\begin{split} 3\rho_{\theta}T_{\theta}&=\theta(3 \rho T+\rho|U|^{2}-3\rho)-\rho_{\theta}|U_{\theta}|^{2}+3\rho_{\theta}\\ &=(3\rho T+\rho|U|^{2})\theta+3(1-\theta)-\rho_{\theta}|U_{ \theta}|^{2},\end{split} \tag{3.15}\] where we used \[3\rho_{\theta}-3\theta\rho=3(\theta\rho+(1-\theta))-3\theta\rho=3(1-\theta).\] For an upper bound of \(T_{\theta}\), we apply \(\eqref{eq:1}_{1}\) and upper bound of \(3\rho T+\rho|U|^{2}\) in (3.12) to obtain \[T_{\theta}=\frac{(3\rho T+\rho|U|^{2})\theta+3(1-\theta)-\rho_{\theta}|U_{ \theta}|^{2}}{3\rho_{\theta}}\leq\frac{\theta C_{q}\overline{M}+3(1-\theta)}{3 C_{0}e^{-C_{q}\overline{M}^{-t}}}\leq C_{q}\overline{M}e^{C_{q}\overline{M}^{ -t}}.\] For a lower bound of \(T_{\theta}\), we substitute the following computation \[\theta\rho|U|^{2}-\rho_{\theta}|U_{\theta}|^{2}=\frac{\theta\rho_{\theta}\rho| U|^{2}-|\rho_{\theta}U_{\theta}|^{2}}{\rho_{\theta}}=\frac{\theta(\theta \rho+(1-\theta))\rho|U|^{2}-\theta^{2}|\rho U|^{2}}{\rho_{\theta}}=\frac{ \theta(1-\theta)\rho|U|^{2}}{\rho_{\theta}}\] into (3.15) to obtain \[3\rho_{\theta}T_{\theta}=(3\rho T)\theta+3(1-\theta)+\frac{\theta(1-\theta) \rho|U|^{2}}{\rho_{\theta}}.\] Then we use \(\eqref{eq:1}_{1}\), \(\eqref{eq:1}_{1}\), and \(\eqref{eq:1}_{3}\) to get \[T_{\theta}\geq\frac{\theta\rho T+(1-\theta)}{\rho_{\theta}}\geq\frac{(C_{0}e^ {-C_{q}\overline{M}^{-t}})(C\overline{M}^{-\frac{2}{3}}e^{-\frac{2}{3}C_{q} \overline{M}^{-t}})}{C_{q}\overline{M}}\geq C_{q}\overline{M}^{-\frac{5}{3}}e^{ -\frac{5}{3}C_{q}\overline{M}^{-t}}.\] Now we are ready to estimate the nonlinear term on the R.H.S of (3.3). **Lemma 3.6**.: _Let (1.9) and the a priori assumption (3.1) hold. We have the following estimate for the third term of the right-hand side of (3.3)_ \[\begin{split}&\int_{0}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle ^{2}|\Gamma(f)(s,x-v(t-s),v)|dvds\\ &\leq C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{n}t}\bigg{[}N^{ 5}(1-e^{-\lambda})\overline{M}+\frac{\overline{M}}{N^{q-10}}+N^{6}(\lambda^{-2 }+N^{3})\left(\mathcal{E}(F_{0})+N^{\frac{3}{2}}\sqrt{\mathcal{E}(F_{0})} \right)\bigg{]},\end{split}\] _for some generic constants \(n>1\) and \(C_{q}>0\)._ Proof.: In this proof, we claim the following estimate: \[\langle v\rangle^{2}|\Gamma(f)(t,x,v)|\leq C_{q}\overline{M}^{n}e^{C_{q}\overline{ M}^{n}t}\int_{\mathbb{R}^{3}}|f(u)|(1+|u|^{2})du, \tag{3.16}\] for some generic constants \(n>1\) and \(C_{q}>0\). Recall definition of the full nonlinear term in Lemma 2.1. We first consider the nonlinear term \(\Gamma_{2}(f)\) which contains some second derivative terms of the local Maxwellian. Note that the second derivative of the local Maxwellian can be written by the following polynomial form (2.4): \[\Big{[}\nabla^{2}_{(\rho_{\theta},\rho_{\theta}U_{\theta},G_{\theta})}\mathcal{ M}(\theta)\Big{]}_{ij}=\frac{\mathcal{P}_{ij}((v-U_{\theta}),U_{\theta},T_{ \theta})}{\rho_{\theta}^{\alpha_{ij}}T_{\theta}^{\beta_{ij}}}\mathcal{M}( \theta),\] where \(\mathcal{P}(x_{1},\cdots,x_{n})\) is generic polynomial for \(x_{1},\cdots,x_{n}\). Applying \(\langle v\rangle^{2}\leq 1+|v-U|^{2}+|U|^{2}\), we get \[\begin{split}\left|\langle v\rangle^{2}\left[\nabla^{2}_{(\rho_ {\theta},\rho_{\theta}U_{\theta},G_{\theta})}\mathcal{M}(\theta)\right]_{ij} \right|&\leq C\bigg{|}(1+|v-U_{\theta}|^{2}+|U_{\theta}|^{2}) \frac{\mathcal{P}_{ij}((v-U_{\theta}),U_{\theta},T_{\theta})}{\rho_{\theta}^{ \alpha_{ij}}T_{\theta}^{\beta_{ij}}}\mathcal{M}(\theta)\bigg{|}\\ &\leq C\bigg{|}(1+T_{\theta}+|U_{\theta}|^{2})\frac{\mathcal{P}_{ ij}(\sqrt{T_{\theta}},U_{\theta},T_{\theta})}{\rho_{\theta}^{\alpha_{ij}}T_{ \theta}^{\beta_{ij}}}\bigg{|},\end{split} \tag{3.17}\] where we used the following inequality \[\left|\frac{(v-U)^{n}}{T^{\frac{n}{2}}}\exp\left(-\frac{|v-U|^{2}}{2T}\right) \right|\leq C,\] to control the \((v-U)\) part on the numerator part. Then, putting \((1+T_{\theta}+|U_{\theta}|^{2})\) term on the generic polynomial \(\mathcal{P}(\sqrt{T_{\theta}},U_{\theta},T_{\theta})\), we apply Lemma 3.5 to estimate the transition of the macroscopic fields \((\rho_{\theta},U_{\theta},T_{\theta})\): \[\left|\langle v\rangle^{2}\left[\nabla^{2}_{(\rho_{\theta},\rho_{\theta}U_{ \theta},G_{\theta})}\mathcal{M}(\theta)\right]_{ij}\right|\leq C\bigg{|}\frac{ \mathcal{P}_{ij}(\sqrt{C_{q}\overline{M}e^{C_{q}\overline{M}^{q}t}},C_{q} \overline{M}e^{C_{q}\overline{M}^{q}t},C_{q}\overline{M}e^{C_{q}\overline{M}^{ q}t})}{(C_{0}e^{-C_{q}\overline{M}^{q}t})^{\alpha_{ij}}(C_{q}\overline{M}^{- \frac{5}{3}}e^{-\frac{5}{3}C_{q}\overline{M}^{q}t})^{\beta_{ij}}}\bigg{|}.\] Thus, using Appendix A, there exists a positive constant \(n\) such that \[\bigg{|}\left[\nabla^{2}_{(\rho_{\theta},\rho_{\theta}U_{\theta},G_{\theta})} \mathcal{M}(\theta)\right]_{ij}\bigg{|}\leq C_{q}\overline{M}^{n}e^{C_{q} \overline{M}^{n}t}. \tag{3.18}\] From now on, we use the positive number \(n\) as a generic positive constant. By using the estimate of the collision frequency \(\nu=\rho^{a}T^{b}\leq C_{q}\overline{M}^{a}\) in (3.11) and \[\langle f,e_{i}\rangle_{v}\leq C_{q}\|f(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q} \overline{M},\] we can bound the nonlinear term \(\Gamma_{2}\) as \[\Gamma_{2}(f)\leq C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{q}t}\int_{ \mathbb{R}^{3}}|f(u)|(1+|u|^{2})du. \tag{3.19}\] Similarly, applying the estimates for \((\rho_{\theta},U_{\theta},T_{\theta})\) in Lemma 3.5, the nonlinear part of the collision frequency \(A_{i}(\theta)\) in Lemma 2.1 can be bounded as \[A_{i}(\theta)\leq C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{q}t},\quad\text{ for}\quad i=1,\cdots,5.\] Combining with the estimate of \(\mathbf{P}f-f\), \[\|(\mathbf{P}f-f)(t)\|_{L^{\infty,q}_{x,v}}\leq\|f(t)\|_{L^{\infty,q}_{x,v}} \leq\overline{M},\] we also have \[\Gamma_{1}(f)\leq C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{q}t}\int_{ \mathbb{R}^{3}}|f(u)|(1+|u|^{2})du. \tag{3.20}\] From (3.20) and (3.19), we obtain (3.16). Now, applying (3.16) yields \[\int_{0}^{t}e^{-(t-s)}\int_{|v|\leq N}\langle v\rangle^{2}|\Gamma(f)(s,x-v(t-s ),v)|dvds\] \[\leq C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{n}t}\int_{0}^{t}e^{-(t-s)}\int_{|v| \leq N}\langle v\rangle^{2}\int_{\mathbb{R}^{3}}|f(s,x-v(t-s),u)|(1+|u|^{2})dudvds.\] We note that the R.H.S is the same with the estimate of \(\mathbf{P}f\) in Lemma 3.3 except the term \(C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{2}t}\). Thus we finish the proof. Now we go back to the proof of Proposition 3.1. Proof of Proposition 3.1.: Combining Lemma 3.1, Lemma 3.3 and Lemma 3.6, we obtain \[\int_{\mathbb{R}^{3}}\langle v\rangle^{2}|f(t,x,v)|dv \leq C_{q}M_{0}e^{-t}+\frac{C_{q}}{N^{q-5}}\overline{M}+C_{q} \overline{M}^{n}e^{C_{q}\overline{M}^{n}t}\bigg{[}N^{5}(1-e^{-\lambda}) \overline{M}+\frac{\overline{M}}{N^{q-10}}\] \[\quad+N^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}(F_{0})+N^{\frac{ 3}{2}}\sqrt{\mathcal{E}(F_{0})}\right)\bigg{]}.\] By using the generic constants \(C_{q}\) and \(n\), for the time \(t_{*}\) which satisfies (3.1), we can write the above inequality as \[\begin{split}\int_{\mathbb{R}^{3}}\langle v\rangle^{2}|f(t,x,v)| dv&\leq C_{q}M_{0}e^{-t}+\frac{C_{q}}{N^{q-5}}\overline{M}+C_{q} \overline{M}^{n}e^{C_{q}\overline{M}^{n}t_{*}}\frac{1}{N^{q-10}}\\ &\quad+C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{n}t_{*}}N^{5}(1 -e^{-\lambda})\\ &\quad+C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{n}t_{*}}N^{6}( \lambda^{-2}+N^{3})\left(\mathcal{E}(F_{0})+N^{\frac{3}{2}}\sqrt{\mathcal{E}( F_{0})}\right).\end{split} \tag{3.21}\] Then we choose \(N,\lambda,\mathcal{E}(F_{0})\) to make the second to the fifth terms of the R.H.S in (3.21) sufficiently small. First, for a given \(\delta\in(0,1)\), let us choose a constant \(N\) sufficiently large as follows: \[N:=\max\left\{\left(\frac{8}{\delta}C_{q}\overline{M}\right)^{\frac{1}{q-5}}, \left(\frac{8}{\delta}C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{n}t_{*}} \right)^{\frac{1}{q-10}}\right\},\quad q>10. \tag{3.22}\] Then the second and third terms on the R.H.S of (3.21) become smaller than \(\delta/4\). Now, for \(N\) which was chosen in (3.22), we choose sufficiently small \(\lambda\) as \[\lambda:=-\ln\left(1-\frac{\delta}{4C_{q}\overline{M}^{n}e^{C_{q}\overline{M }^{n}T}N^{5}}\right),\] to make the second line of the R.H.S of (3.21) small: \[C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{n}t_{*}}N^{5}(1-e^{-\lambda})= \frac{\delta}{4}.\] Finally, choosing sufficiently small initial entropy satisfying \[\mathcal{E}(F_{0})\leq\min\left\{\frac{\delta}{8C_{q}\overline{M}^{n}e^{C_{q} \overline{M}^{n}t_{*}}N^{6}(\lambda^{-2}+N^{3})},\left(\frac{\delta}{8C_{q} \overline{M}^{n}e^{C_{q}\overline{M}^{n}t_{*}}N^{\frac{16}{2}}(\lambda^{-2}+N ^{3})}\right)^{2}\right\},\] the third line on the R.H.S of (3.21) become smaller than \(\delta/4\): \[C_{q}\overline{M}^{n}e^{C_{q}\overline{M}^{n}t_{*}}N^{6}(\lambda^{-2}+N^{3}) \left(\mathcal{E}(F_{0})+N^{\frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right)\leq \frac{\delta}{4},\] which implies \[\left|\int_{\mathbb{R}^{3}}\langle v\rangle^{2}f(t,x,v)dv\right|\leq C_{q}M_{ 0}e^{-t}+\frac{3}{4}\delta.\] This completes the proof of Proposition 3.1. **Lemma 3.7**.: _Under a priori assumption (3.1) with sufficiently small \(\mathcal{E}(F_{0})\) satisfying the assumption of Proposition 3.1, there exists \(t_{eq}\) such that if \(t\geq t_{eq}\) then the macroscopic fields are close to the global macroscopic fields for any \(\delta\in(0,1/3)\):_ \[|\rho-1|\,|U|,\ |T-1|\leq 2\delta.\] Proof.: From Proposition 3.1, let us choose sufficiently large time \[t\geq\ln\frac{4C_{q}M_{0}}{\delta},\] for which the followings hold: \[\left|\int_{\mathbb{R}^{3}}\langle v\rangle^{2}f(t,x,v)dv\right|\leq\delta.\] This is equivalent to \[|\rho-1|,\ |\rho U|,\ |3\rho T+\rho|U|^{2}-3|\leq\delta.\] Then the macroscopic velocity and temperature are bounded by \[|U(t,x)|=\frac{|\rho U|}{\rho}\leq\frac{\delta}{1-\delta},\quad T(t,x)\leq \frac{3+\delta}{3(1-\delta)},\quad T(t,x)\geq\frac{3-\delta}{3(1+\delta)}- \frac{\delta^{2}}{3(1-\delta)^{2}},\] where we used the relation \(T=\frac{3\rho T+\rho|U|^{2}}{3\rho}-\frac{|\rho U|^{2}}{3\rho^{2}}\). Once we consider the quantity \(|T-1|\), then we have \[|U|\leq\frac{\delta}{1-\delta},\qquad|T-1|\leq\max\left\{\frac{4\delta}{3(1- \delta)},\frac{4\delta}{3(1+\delta)}+\frac{\delta^{2}}{3(1-\delta)^{2}} \right\}.\] Thus for \(\delta\leq 1/3\), we have \[|\rho-1|,\ |U|,\ |T-1|\leq 2\delta.\] For later convenience, we define the time satisfying Lemma 3.7 as \[t_{eq}:=\ln\frac{4C_{q}M_{0}}{\delta}. \tag{3.23}\] Note that \(t_{eq}\) depends only on the initial data, and fixed constants \(q>10\) and \(\delta\). After this time, the nonlinear term \(\Gamma\) becomes quadratic nonlinear. We will consider the problem after \(t_{eq}\) in Section 6. Now, our main problem is to construct the solution before \(t_{eq}\). ## 4. Local existence theory In this section, we consider the local-in-time unique solution of the BGK equation. **Lemma 4.1**.: _If the two distribution functions \(F=\mu+f\) and \(G=\mu+g\) satisfy \(\|F(t)\|_{L^{\infty,q}_{x,v}}\leq M\), and \(\|G(t)\|_{L^{\infty,q}_{x,v}}\leq M\), for a constant \(M>0\), and the macroscopic fields of \(F\) and \(G\) satisfy Lemma 3.4 for \(M\) instead of \(\overline{M}\), respectively, then we have_ \[\|(\Gamma(f)-\Gamma(g))(t)\|_{L^{\infty,q}_{x,v}}\leq C_{M}\|(f-g)(t)\|_{L^{ \infty,v}_{x,v}},\] _for a positive constant \(C_{M}\)._ Proof.: We denote the macroscopic fields of \(F=\mu+f\) as \((\rho^{f},U^{f},T^{f})\): \[\rho^{f}(t,x):=\int_{\mathbb{R}^{3}}F(t,x,v)dv,\] \[\rho^{f}(t,x)U^{f}(t,x):=\int_{\mathbb{R}^{3}}F(t,x,v)vdv,\] \[3\rho^{f}(t,x)T^{f}(t,x):=\int_{\mathbb{R}^{3}}F(t,x,v)|v-U^{f} (t,x)|^{2}dv.\] We also write the transition of the macroscopic fields comes from the definition (2.5) as \((\rho^{f}_{\theta},U^{f}_{\theta},T^{f}_{\theta})\) and the local Maxwellian depending on the macroscopic fields \((\rho^{f}_{\theta},U^{f}_{\theta},T^{f}_{\theta})\) as \(\mathcal{M}^{f}(\theta)\). Here, we only consider the case \(\Gamma_{2}(f)\), since \(\Gamma_{1}(f)\) can be treated similarly. We split the function dependency as follows: \[\Gamma_{2}(f_{1},f_{2},f_{3},f_{4})=(\rho^{f_{1}})^{a}(T^{f_{1}})^{b}\sum_{1 \leq i,j\leq 5}\int_{0}^{1}\frac{\mathcal{P}_{ij}((v-U^{f_{\theta}}_{\theta}),U^{ f_{2}}_{\theta},T^{f_{2}}_{\theta})}{(\rho^{f_{2}}_{\theta})^{\alpha_{ij}}(T^{f_{ \theta}}_{\theta})^{\beta_{ij}}}\mathcal{M}^{f_{2}}(\theta)(1-\theta)d\theta\] \[\leq C_{M}\int_{\mathbb{R}^{3}}|v||f-g|dv+C_{M}\int_{\mathbb{R}^{3}}|f-g|dv\] \[\leq C_{M}\|f-g\|_{L^{\infty,q}_{x,v}},\] to have \[|\rho^{f}T^{f}-\rho^{g}T^{g}|\leq C_{M}\|f-g\|_{L^{\infty,q}_{x,v}}.\] Thus we obtain \(IV_{2}\leq C_{M}\|f-g\|_{L^{\infty,q}_{x,v}}\). Finally, for \(III\) term, we have \[III\leq C_{M}\Bigg{|}\sum_{1\leq i,j\leq 5}\int_{0}^{1}\langle v\rangle^{q} \left(\frac{\mathcal{P}_{ij}((v-U_{\theta}^{f}),U_{\theta}^{f},T_{\theta}^{f} )}{(\rho_{\theta}^{f})^{\alpha_{ij}}(T_{\theta}^{f})^{\beta_{ij}}}\mathcal{M} ^{f}(\theta)-\frac{\mathcal{P}_{ij}((v-U_{\theta}^{g}),U_{\theta}^{g},T_{ \theta}^{g})}{(\rho_{\theta}^{g})^{\alpha_{ij}}(T_{\theta}^{g})^{\beta_{ij}}} \mathcal{M}^{g}(\theta)\right)(1-\theta)d\theta\Bigg{|}.\] We split the terms inside \(III\) as follows: \[III_{1}^{ij} =\left(\frac{\mathcal{P}_{ij}((v-U_{\theta}^{f}),U_{\theta}^{f},T_{ \theta}^{f})}{(\rho_{\theta}^{g})^{\alpha_{ij}}(T_{\theta}^{f})^{\beta_{ij}}}- \frac{\mathcal{P}_{ij}((v-U_{\theta}^{g}),U_{\theta}^{g},T_{\theta}^{g})}{( \rho_{\theta}^{g})^{\alpha_{ij}}(T_{\theta}^{g})^{\beta_{ij}}}\right)\langle v \rangle^{q}\mathcal{M}^{f}(\theta),\] \[III_{2}^{ij} =\frac{\mathcal{P}_{ij}((v-U_{\theta}^{g}),U_{\theta}^{g},T_{ \theta}^{g})}{(\rho_{\theta}^{g})^{\alpha_{ij}}(T_{\theta}^{g})^{\beta_{ij}}} \langle v\rangle^{q}(\mathcal{M}^{f}(\theta)-\mathcal{M}^{g}(\theta)).\] For the \(III_{1}^{ij}\) term, we apply triangle inequality several times and use the estimate (4.1) and (4.2) to have \(III_{1}^{ij}\leq C_{M}\|f-g\|_{L^{\infty,q}_{x,v}}\). For the term \(\langle v\rangle^{q}(\mathcal{M}^{f}(\theta)-\mathcal{M}^{g}(\theta))\) inside \(III_{2}^{ij}\), we can have the Lipschitz continuity of the local Maxwellian \(III_{2}^{ij}\leq C_{M}\|f-g\|_{L^{\infty,q}_{x,v}}\) as in [35, 47]. This completes the proof. We prove the local wellposedness theory of the BGK solutions. **Proposition 4.1**.: _Consider the BGK equation (2.1) with initial data \(f_{0}\) which satisfies \(\|f_{0}\|_{L^{\infty,q}_{x,v}}<\infty\) and (1.9). Then, there exists a time \(t_{0}=t_{0}(\|f_{0}\|_{L^{\infty,q}_{x,v}})\) depending only on \(\|f_{0}\|_{L^{\infty,q}_{x,v}}\) such that there exists a unique local-in-time solution for \(t\in[0,t_{0}]\) which saf satisfies_ \[\sup_{0\leq s\leq t_{0}}\|f(s)\|_{L^{\infty,q}_{x,v}}\leq 2\|f_{0}\|_{L^{ \infty,q}_{x,v}}.\] Proof.: From (2.1) in Lemma 2.1, we obtain the following mild solution: \[f(t,x,v)=e^{-t}f_{0}(x-vt,v)+\int_{0}^{t}e^{-(t-s)}[\mathbf{P}f+\Gamma(f)](s,x -v(t-s),v)ds.\] Multiplying the above by \(\langle v\rangle^{q}\), we have \[\langle v\rangle^{q}|f(t,x,v)|\leq e^{-t}\|f_{0}\|_{L^{\infty,q}_{x,v}}+\int_ {0}^{t}e^{-(t-s)}\langle v\rangle^{q}|[\mathbf{P}f+\Gamma(f)](s,x-v(t-s),v)|ds.\] By definition (2.2) of \(\mathbf{P}f\) in Lemma 2.1, we directly deduce that \[\langle v\rangle^{q}\mathbf{P}f(s)\leq C_{q}\sup_{0\leq s\leq t}\|f(s)\|_{L^{ \infty,q}_{x,v}},\quad 0\leq s\leq t. \tag{4.3}\] To obtain estimate for \(\Gamma(f)\), we note that the macroscopic fields \((\rho,U,T)\) and \((\rho_{\theta},U_{\theta},T_{\theta})\) are bounded depending on \(M_{0}\) by the assumption (1.9) with Lemma 3.4 and Lemma 3.5. Then using a similar argument in the proof of (3.16), we have \[\langle v\rangle^{q}|\Gamma(f)(s)|\leq C_{q}\left(\sup_{0\leq s\leq t}\|f(s) \|_{L^{\infty,q}_{x,v}}\right)^{n}e^{C_{q}(\sup_{0\leq s\leq t}\|f(s)\|_{L^{ \infty,q}_{x,v}})^{*}t},\quad 0\leq s\leq t,\] where \(C_{q},n\) and \(a\) are the same constant as in (3.16). Note that (3.16) holds for \(\sup_{0\leq s\leq t}\|f(s)\|_{L^{\infty,q}_{x,v}}\) instead of \(\overline{M}\). In sum, we obtain \[\|f(t)\|_{L^{\infty,q}_{x,v}} \leq e^{-t}\|f_{0}\|_{L^{\infty,q}_{x,v}}+C_{q}(1-e^{-t})\sup_{0 \leq s\leq t}\|f(s)\|_{L^{\infty,q}_{x,v}}\] \[\quad+C_{q}\left(\sup_{0\leq s\leq t}\|f(s)\|_{L^{\infty,q}_{x,v} }\right)^{n}te^{C_{q}(\sup_{0\leq s\leq t}\|f(s)\|_{L^{\infty,q}_{x,v}})^{*}t}.\] Hence, there exists \(t_{0}=t_{0}(M_{0})\) such that \[\sup_{0\leq t\leq t_{0}}\|f(s)\|_{L^{\infty,q}_{x,v}}\leq 2\|f_{0}\|_{L^{ \infty,q}_{x,v}}.\] For the uniqueness of solutions, we assume that \(g\) satisfies the reformulated BGK equation (2.1) with the same initial data \(f_{0}\) and \[\sup_{0\leq s\leq t_{0}}\|g(s)\|_{L^{\infty,q}_{x,v}}\leq 2\|f_{0}\|_{L^{ \infty,q}_{x,v}}.\] Using the mild formulation, we have \[(f-g)(t,x,v)=\int_{0}^{t}e^{-(t-s)}[\mathbf{P}(f-g)+\Gamma(f)-\Gamma(g)](s,x-v(t -s),v)ds.\] Moreover, one obtains that \[\|(f-g)(t)\|_{L^{\infty,q}_{x,v}}\leq\int_{0}^{t}e^{-(t-s)}\left(\|\mathbf{P}(f-g) (s)\|_{L^{\infty,q}_{x,v}}+\|(\Gamma(f)-\Gamma(g))(s)\|_{L^{\infty,q}_{x,v}} \right)ds.\] For the \(\mathbf{P}(f-g)\) part above, it follows from (4.3) that \[\int_{0}^{t}e^{-(t-s)}\|\mathbf{P}(f-g)(s)\|_{L^{\infty,q}_{x,v}}ds\leq C_{q} \int_{0}^{t}\|(f-g)(s)\|_{L^{\infty,q}_{x,v}}ds.\] To treat the nonlinear part \(\Gamma(f)-\Gamma(g)\), using Lemma 4.1, we obtain \[\int_{0}^{t}e^{-(t-s)}\langle v\rangle^{q}\|(\Gamma(f)-\Gamma(g))(s)\|_{L^{ \infty,q}_{x,v}}ds\leq C_{f_{0}}\int_{0}^{t}\|(f-g)(s)\|_{L^{\infty,q}_{x,v}}ds,\] where \(C_{f_{0}}\) is a constant depending on \(\|f_{0}\|_{L^{\infty,q}_{x,v}}\). Combining the estimates for \(\mathbf{P}(f-g)\) and \(\Gamma(f)-\Gamma(g)\), one obtains that \[\|(f-g)(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q,f_{0}}\int_{0}^{t}\|(f-g)(s)\|_{L^{ \infty,q}_{x,v}}ds,\] which implies the uniqueness due to Gronwall's inequality. ## 5. Control over the highly nonlinear regime and decay estimate In Section 3, we proved that the BGK equation enters the quadratic nonlinear regime for \(t\geq t_{eq}\). In this section we consider the highly nonlinear regime \(0\leq t\leq t_{eq}\) in Figure 1. Note that we already performed estimates for macroscopic fields in Lemma 3.4. Unfortunately, however, the bounds of the macroscopic fields in Lemma 3.4 depend on the a priori bound \(\overline{M}\), which is not sufficient for our estimates. In this section, instead, our aim is to control macroscopic fields \((\rho,U,T)\) for highly nonlinear regime depending only on the size of initial data \(M_{0}\) and other generic quantities. ### Control of the macroscopic fields **Lemma 5.1**.: _Assume that the initial data satisfies (1.9) and \(\|f_{0}\|_{L^{\infty,q}_{x,v}}\leq M_{0}<\infty\) for \(q>10\). Under a priori assumption (3.1), the macroscopic fields \((\rho,U,T)\) in (1.2) are bounded as follows:_ \[\begin{split}&(1)\ C_{0}e^{-\nu^{max}_{f_{0}}t}\leq\rho(t,x) \leq C_{q}M_{0},\\ &(2)\ |U(t,x)|\leq C_{q}M_{0}e^{\nu^{max}_{f_{0}}t},\\ &(3)\ CM_{0}^{-\frac{2}{3}}e^{-\frac{4}{3}\nu^{max}_{f_{0}}t} \leq T(t,x)\leq C_{q}M_{0}e^{\nu^{max}_{f_{0}}t},\end{split} \tag{5.1}\] _for all \(0\leq t\leq t_{*}\) and a generic constant \(C_{q}>0\), where \(\nu^{max}_{f_{0}}\) is a generic constant that will be defined in (5.3)._ Proof.: By Proposition 3.1, we have the following upper bounds for \(t\in[0,t_{*}]\): \[\rho-1,\ |\rho U|,\ 3\rho T+\rho|U|^{2}-3\leq C_{q}M_{0}+\frac{3}{4}\delta. \tag{5.2}\] Thus the collision frequency is bounded during the time \(t\in[0,t_{*}]\): \[\nu(t,x)=\rho^{a-b}(\rho T)^{b}\leq\left(C_{q}M_{0}+3+\frac{3}{4}\delta\right) ^{a},\] where we used \(a\geq b\) and (5.2). We define the maximum value of the collision frequency as \[\nu^{max}_{f_{0}}:=\left(C_{q}M_{0}+3+\frac{3}{4}\delta\right)^{a}. \tag{5.3}\] For simplicity, since we are considering the case \(M_{0}>1\) with \(\delta<1/3\), we write the upper bound of \(\rho\), \(\rho U\), and \(3\rho T+\rho|U|^{2}\) as \(C_{q}M_{0}\) by using generic constant \(C_{q}\): \[\rho,\ |\rho U|,\ 3\rho T+\rho|U|^{2}\leq C_{q}M_{0}. \tag{5.4}\] (1) By exactly the same argument as (3.13), the mild formulation of the BGK model gives the following lower bound of the density \[\rho(t,x)=\int_{\mathbb{R}^{3}}F(t,x,v)dv\geq e^{-\int_{0}^{t}\nu_{f_{0}}^{max}t \mathcal{A}}\int_{\mathbb{R}^{3}}F_{0}(x-vt,v)dv\geq C_{0}e^{-\nu_{f_{0}}^{max} t},\] where the last inequality comes from (1.9). (2) From \(\eqref{eq:1.1}_{1}\) (lower bound of \(\rho\)) and (5.4), we obtain the upper bound of \(U\) \[|U|=\frac{|\rho U|}{\rho}\leq\frac{C_{q}M_{0}}{C_{0}e^{-\nu_{f_{0}}^{max}t}} \leq C_{q}M_{0}e^{\nu_{f_{0}}^{max}t}.\] (3) For the upper bound of the temperature \(T\), we use \(\eqref{eq:1.1}_{1}\) and (5.4) to obtain \[|T|=\frac{3\rho T+\rho|U|^{2}}{3\rho}-\frac{1}{3}|U|^{2}\leq\frac{C_{q}M_{0}}{3 C_{0}e^{-\nu_{f_{0}}^{max}t}}\leq C_{q}M_{0}e^{\nu_{f_{0}}^{max}t}.\] For the lower bound of the temperature \(T\), we apply (1) in Lemma 2.3. Before that, we change the \(L^{\infty}\) norm of \(F(t)\) to the \(L^{\infty}\) norm of the initial data. By using the uniform upper bound (5.3) of the collision frequency \(\nu\) and (2) in Lemma 2.3, we obtain \[\langle v\rangle^{q}\partial_{t}F+\langle v\rangle^{q}v\cdot\nabla_{x}F=\nu( \langle v\rangle^{q}\mathcal{M}(F)-\langle v\rangle^{q}F)\leq\nu_{f_{0}}^{max }\|F\|_{L^{\infty}_{x,v}},\] for \(q=0\) or \(q>5\). The mild formulation gives \[\|F(t)\|_{L^{\infty}_{x,v}}\leq\|F_{0}\|_{L^{\infty}_{x,v}}+\nu_{f_{0}}^{max }\int_{0}^{t}\|F(s)\|_{L^{\infty}_{x,v}}ds,\] and Gronwall's inequality yields \[\|F(t)\|_{L^{\infty}_{x,v}}\leq e^{\nu_{f_{0}}^{max}t}\|F_{0}\|_{L^{\infty}_{ x,v}}.\] Combining with (1) in Lemma 2.3 and \(\eqref{eq:1.1}_{1}\) (lower bound of \(\rho\)) gives \[T^{\frac{3}{2}}\geq\frac{\rho}{C\|F(t)\|_{L^{\infty}_{x,v}}}\geq\frac{C_{0}e^ {-\nu_{f_{0}}^{max}t}}{Ce^{\nu_{f_{0}}^{max}t}\|F_{0}\|_{L^{\infty}_{x,v}}} \geq CM_{0}^{-1}e^{-2\nu_{f_{0}}^{max}t}.\] Thus, we get the lower bound of \(T\) depending on the initial data. **Lemma 5.2**.: _We suppose all assumptions in Lemma 5.1. For all \(0\leq t\leq t_{*}\), the transition of the macroscopic fields \((\rho_{\theta}\), \(U_{\theta}\), \(T_{\theta})\) in (2.5) has the following estimate_ \[\begin{split}&(1)\ C_{0}e^{-\nu_{f_{0}}^{max}t}\leq\rho_{ \theta}\leq C_{q}M_{0},\\ &(2)\ |U_{\theta}|\leq C_{q}M_{0}e^{\nu_{f_{0}}^{max}t},\\ &(3)\ C_{q}M_{0}^{-\frac{3}{5}}e^{-\frac{7}{3}\nu_{f_{0}}^{max} t}\leq T_{\theta}\leq C_{q}M_{0}e^{\nu_{f_{0}}^{max}t},\end{split}\] _for \(0\leq\theta\leq 1\) and a generic constant \(C_{q}\), where we have denoted \(\nu_{f_{0}}^{max}\) as (5.3)._ Proof.: (1) Applying \(\eqref{eq:1.1}_{1}\) (upper and lower bound of \(\rho\)) in Lemma 5.1, we have \[\begin{split}\rho_{\theta}&=\theta\rho+(1-\theta) \leq\theta C_{q}M_{0}\leq C_{q}M_{0},\\ \rho_{\theta}&=\theta\rho+(1-\theta)\geq\theta C_{0}e ^{-\nu_{f_{0}}^{max}t}+(1-\theta)\geq C_{0}e^{-\nu_{f_{0}}^{max}t}.\end{split} \tag{5.5}\] (2) It follows from the upper bound of \(\rho U\) in (5.4) and \(\eqref{eq:1.1}_{2}\) \[|U_{\theta}|=\left|\frac{\theta\rho U}{\rho_{\theta}}\right|\leq\frac{\theta C_ {q}M_{0}}{C_{0}e^{-\nu_{f_{0}}^{max}t}}\leq C_{q}M_{0}e^{\nu_{f_{0}}^{max}t}.\] (3) We first derive the upper bound of \(T_{\theta}\). By \(\eqref{eq:1.1}_{2}\) and (5.4), we obtain \[T_{\theta}=\frac{(3\rho T+\rho|U|^{2})\theta+3(1-\theta)-\rho_{\theta}|U_{ \theta}|^{2}}{3\rho_{\theta}}\leq\frac{\theta C_{q}M_{0}+3(1-\theta)}{3C_{0}e^{ -\nu_{f_{0}}^{max}t}}\leq C_{q}M_{0}e^{\nu_{f_{0}}^{max}t}.\] For the lower bound of \(T_{\theta}\), we use a similar argument in the proof of Lemma 3.5. Using (5.5)\({}_{1}\) and Lemma 5.1, we have \[T_{\theta}\geq\frac{\theta\rho T+(1-\theta)}{\rho_{\theta}}\geq\frac{(C_{0}e^{- \nu_{f_{0}}^{max}t})(CM_{0}^{-\frac{2}{3}}e^{-\frac{4}{3}\nu_{f_{0}}^{max}t})}{ C_{q}M_{0}}\geq C_{q}M_{0}^{-\frac{5}{3}}e^{-\frac{7}{3}\nu_{f_{0}}^{max}t}.\] Using previous Lemma 5.1 and Lemma 5.2, we derive an improved nonlinear estimate for \(\Gamma\) than (3.16). **Lemma 5.3**.: _Let all assumptions in Lemma 5.1 hold. Recall the nonlinear term \(\Gamma(f)\) in (2.3). The \(v\)-weighted nonlinear term is bounded as follows_ \[\langle v\rangle^{q}|\Gamma(f)(t,x,v)|\leq C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max} t}\|f(t)\|_{L^{\infty,q}_{x,v}}\int_{\mathbb{R}^{3}}|f(u)|(1+|u|^{2})du,\] _where \(n>1\) and \(C_{q}>0\) are generic constants._ Proof.: In the same way with (3.16), we substitute Lemma 5.2 for the estimate (3.17) to get \[\langle v\rangle^{q}\bigg{|}\left[\nabla_{(\rho_{\theta},\rho_{ \theta}U_{\theta},G_{\theta})}^{2}\mathcal{M}(\theta)\right]_{ij}\bigg{|} =\langle v\rangle^{q}\bigg{|}\frac{\mathcal{P}_{ij}((v-U_{\theta} ),U_{\theta},T_{\theta})}{\rho_{\theta}^{\alpha_{ij}}T_{\theta}^{\beta_{ij}}} \mathcal{M}(\theta)\bigg{|}\] \[\leq C\bigg{|}\frac{\mathcal{P}_{ij}(\sqrt{T_{\theta}},U_{\theta},T_{\theta})}{\rho_{\theta}^{\alpha_{ij}}T_{\theta}^{\beta_{ij}}}\bigg{|}\] \[\leq C\bigg{|}\frac{\mathcal{P}_{ij}(\sqrt{C_{q}M_{0}e^{\nu_{f_{ 0}}^{max}t}},C_{q}M_{0}e^{\nu_{f_{0}}^{max}t},C_{q}M_{0}e^{\nu_{f_{0}}^{max}t} )}{(C_{0}e^{-\nu_{f_{0}}^{max}t})^{\alpha_{ij}}(C_{q}M_{0}^{-\frac{5}{3}e^{- \frac{7}{3}\nu_{f_{0}}^{max}t})^{\beta_{ij}}}}\bigg{|}\] \[\leq C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t}, \tag{5.6}\] for generic positive constants \(n>1\), \(C\) and \(C_{q}\). Recall the definition (2.7) of \(A_{i}(\theta)\), which comes from the linearization of \(\nu\). From Lemma 5.2, we have the following bounds: \[A_{i}(\theta)\leq C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t},\quad\text{for}\quad i =1,\cdots,5. \tag{5.7}\] Combining the definition (2.3) of \(\Gamma(f)\), (5.6), (5.7), and \[\bigg{|}\int_{\mathbb{R}^{3}}f(t,x,u)(1,u,|u|^{2})du\bigg{|}\leq C_{q}\|f(t)\| _{L^{\infty,q}_{x,v}},\] we obtain the desired result. ### Global decay estimate Multiplying (1.6) by \(\langle v\rangle^{q}\) for \(q>10\), we obtain \[\partial_{t}(\langle v\rangle^{q}f)+v\cdot\nabla_{x}(\langle v\rangle^{q}f)+ \langle v\rangle^{q}f=\langle v\rangle^{q}(\mathbf{P}f+\Gamma(f)), \tag{5.8}\] where we defined \(\mathbf{P}f\) and \(\Gamma(f)\) in (2.2) and (2.3), respectively. **Proposition 5.1**.: _Let \(f(t,x,v)\) be the solution of the reformulated BGK equation (5.8) with initial data \(f_{0}\) satisfying (1.9) and \(\|f_{0}\|_{L^{\infty,q}_{x,v}}\leq M_{0}\) for \(q>10\). Under a priori assumption (3.1), it holds that_ \[\|f(t)\|_{L^{\infty,q}_{x,v}} \leq C_{q}e^{-t/2}\left(1+\int_{0}^{t}\|f(s)\|_{L^{\infty,q}_{x,v} }ds\right)e^{\nu_{f_{0}}^{max}t_{eq}}\|f_{0}\|_{L^{\infty,q}_{x,v}}^{n+1}+C_{q }\left(1+C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t_{eq}}\overline{M}\right)^{2}\] \[\quad\times\left(N^{5}(1-e^{-\lambda})\overline{M}+\frac{1}{N^{q- 5}}+\frac{\overline{M}}{N^{q-10}}+N^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}( F_{0})+N^{\frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right)\right), \tag{5.9}\] _for some generic positive constants \(n>1\) and \(t\in[0,t_{*}]\), where \(t_{eq}\), \(\nu_{f_{0}}^{max}\), and initial relative entropy \(\mathcal{E}(F_{0})\) were defined in (3.23), (5.3), and (1.7), respectively._ Proof.: Applying Duhamel's principle to (5.8), we have \[\begin{split}|\langle v\rangle^{q}f(t,x,v)|&\leq e^{-t} \|f_{0}\|_{L^{\infty,q}_{x,v}}\\ &+\int_{0}^{t}e^{-(t-s)}\langle v\rangle^{q}\left|\mathbf{P}f(s,x -v(t-s),v)+\Gamma(f)(s,x-v(t-s),v)\right|ds.\end{split} \tag{5.10}\] We split the estimate as follows: \[\begin{split} I_{1}&=\int_{0}^{t}e^{-(t-s)}\langle v \rangle^{q}\left|\mathbf{P}f(s,x-v(t-s),v)\right|ds,\\ I_{2}&=\int_{0}^{t}e^{-(t-s)}\langle v\rangle^{q} \left|\Gamma(f)(s,x-v(t-s),v)\right|ds.\end{split}\] By the definition of \(\mathbf{P}f\) in (2.2), we have \[I_{1}\leq\int_{0}^{t}e^{-(t-s)}\int_{\mathbb{R}^{3}}|f(s,x-v(t-s),u)|(1+|u|^{2 })duds. \tag{5.11}\] For \(I_{2}\), we split the time-integration region into \([0,t_{eq}]\) and \([t_{eq},t]\): \[\begin{split} I_{2}&=\left(\int_{0}^{t_{eq}}+\int_ {t_{eq}}^{t}\right)e^{-(t-s)}\langle v\rangle^{q}\left|\Gamma(f)(s,x-v(t-s),v )\right|ds\\ &:=I_{2,1}+I_{2,2}.\end{split}\] For \(0\leq s\leq t_{eq}\), by Lemma 5.3, it holds that \[I_{2,1}\leq C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t_{eq}}\int_{0}^{t_{eq}}e^{-(t- s)}\|f(s)\|_{L^{\infty,q}_{x,v}}\int_{\mathbb{R}^{3}}\langle u\rangle^{2}|f(s,x-v(t-s ),u)|duds. \tag{5.12}\] Recall that we controlled the macroscopic fields \(|\rho-1|\,|U|,\ |T-1|\leq 2\delta\) for \(t\geq t_{eq}\) in Lemma 3.7. Hence, using the same argument as in Lemma 5.2, we obtain \(|\rho_{\theta}-1|\,|U_{\theta}|,\ |T_{\theta}-1|\leq 2\delta\) when \(t\geq t_{eq}\). This, combined with the argument in the proof of Lemma 5.3, yields \[\langle v\rangle^{q}\Gamma(f)(t,x,v)\leq C\|f(t)\|_{L^{\infty,q}_{x,v}}\int_{ \mathbb{R}^{3}}|f(u)|(1+|u|^{2})du,\quad\text{for}\quad t\geq t_{eq}.\] Thus, \(I_{2,2}\) can be further bounded by \[I_{2,2}\leq C\int_{t_{eq}}^{t}e^{-(t-s)}\|f(s)\|_{L^{\infty,q}_{x,v}}\int_{ \mathbb{R}^{3}}\langle u\rangle^{2}|f(s,x-v(t-s),u)|duds. \tag{5.13}\] Applying (5.11), (5.12) and (5.13) on (5.10), we obtain \[\begin{split}|\langle v\rangle^{q}f(t,x,v)|&\leq e^{-t} \|f_{0}\|_{L^{\infty,q}_{x,v}}+C\int_{0}^{t}e^{-(t-s)}\int_{\mathbb{R}^{3}} \langle u\rangle^{2}|f(s,x-v(t-s),u)|duds\\ &\quad+C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t_{eq}}\int_{0}^{t}e^{- (t-s)}\|f(s)\|_{L^{\infty,q}_{x,v}}\int_{\mathbb{R}^{3}}\langle u\rangle^{2}| f(s,x-v(t-s),u)|duds.\end{split} \tag{5.14}\] We denote \[B:=\int_{\mathbb{R}^{3}}\langle u\rangle^{2}|f(s,x-v(t-s),u)|du,\] and split the integral region as \(\{|u|\geq N\}\) and \(\{|u|\leq N\}\) as follows: \[\begin{split} B_{1}&=\int_{|u|\geq N}\langle u \rangle^{2}|f(s,x-v(t-s),u)|du,\\ B_{2}&=\int_{|u|\leq N}\langle u\rangle^{2}|f(s,x-v(t- s),u)|du.\end{split}\] Over \(\{|u|\geq N\}\), it holds that \[B_{1}\leq\int_{|u|\geq N}\langle u\rangle^{2-q}|\langle u\rangle^{q}f(s,x-v(t -s),u)|du\leq C_{q}\frac{\|f(s)\|_{L^{\infty,q}_{x,v}}}{N^{q-5}}\leq C_{q} \frac{\overline{M}}{N^{q-5}}. \tag{5.15}\] Applying (5.14) again to the integrand \(|\langle u\rangle^{q}f(s,x-v(t-s),u)|\) on \(B_{2}\), we get \[B_{2} \leq C_{q}e^{-s}\|f_{0}\|_{L^{\infty,q}_{x,v}}\] \[\quad+C\int_{0}^{s}e^{-(s-s^{\prime})}\int_{|u|\leq N}\langle u \rangle^{2-q}\int_{\mathbb{R}^{3}}\langle u^{\prime}\rangle^{2-q}|\langle u^{ \prime}\rangle^{q}f(s^{\prime},x-v(t-s)-u(s-s^{\prime}),u^{\prime})|du^{\prime }duds^{\prime}\] \[\quad+C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t_{eq}}\int_{0}^{s}e^{-( s-s^{\prime})}\|f(s^{\prime})\|_{L^{\infty,q}_{x,v}}\int_{|u|\leq N}\langle u \rangle^{2-q}\] \[\qquad\qquad\qquad\qquad\qquad\times\int_{\mathbb{R}^{3}}\langle u ^{\prime}\rangle^{2-q}|\langle u^{\prime}\rangle^{q}f(s^{\prime},x-v(t-s)-u(s -s^{\prime}),u^{\prime})|du^{\prime}duds^{\prime}. \tag{5.16}\] For the integral \(\int du^{\prime}du\) part, applying the same argument as in Lemma 3.3, we have \[\int_{0}^{s}e^{-(s-s^{\prime})}\int_{|u|\leq N}\langle u\rangle^ {2-q}\int_{\mathbb{R}^{3}}\langle u^{\prime}\rangle^{2-q}|\langle u^{\prime} \rangle^{q}f(s^{\prime},x-v(t-s)-u(s-s^{\prime}),u^{\prime})|du^{\prime}duds^{\prime}\] \[\qquad\qquad\leq C_{q}N^{5}(1-e^{-\lambda})\overline{M}+\frac{C_{ q}}{N^{q-10}}\overline{M}+CN^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}(F_{0})+N^{ \frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right). \tag{5.17}\] Substituting the estimate (5.17) in (5.16) yields \[B_{2} \leq C_{q}e^{-s}\|f_{0}\|_{L^{\infty,q}_{x,v}}+C_{q}\left(1+\sup_{ 0\leq s^{\prime}\leq s}\|f(s^{\prime})\|_{L^{\infty,q}_{x,v}}\right)\] \[\qquad\times\left(N^{5}(1-e^{-\lambda})\overline{M}+\frac{ \overline{M}}{N^{q-10}}+N^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}(F_{0})+N^{ \frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right)\right). \tag{5.18}\] We combine (5.15) and (5.18) to obtain \[B\leq C_{q}e^{-s}\|f_{0}\|_{L^{\infty,q}_{x,v}}+\bar{B}\left(N,\lambda, \mathcal{E}(F_{0}),\overline{M}\right), \tag{5.19}\] where \[\bar{B}(N,\lambda, \mathcal{E}(F_{0}),\overline{M}):=C_{q}\left(1+\overline{M}\right)\] \[\times\left(N^{5}(1-e^{-\lambda})\overline{M}+\frac{1}{N^{q-5}}+ \frac{\overline{M}}{N^{q-10}}+N^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}(F_{0} )+N^{\frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right)\right).\] We substitute (5.19) in (5.14) to have \[|\langle v\rangle^{q}f(t,x,v)| \leq e^{-t}\|f_{0}\|_{L^{\infty,q}_{x,v}}\] \[\quad+C_{q}e^{-t/2}\|f_{0}\|_{L^{\infty,q}_{x,v}}+\bar{B}\] \[\quad+C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t_{eq}}\left(e^{-t}\int_ {0}^{t}\|f(s)\|_{L^{\infty,v}_{x,v}}ds\|f_{0}\|_{L^{\infty,v}_{x,v}}+\sup_{0 \leq s\leq t}\|f(s)\|_{L^{\infty,u}_{x,v}}\bar{B}\right).\] Therefore, we obtain \[|\langle v\rangle^{q}f(t,x,v)|\leq C_{q}e^{-t/2}\left(1+\int_{0}^{t}\|f(s)\|_ {L^{\infty,q}_{x,v}}ds\right)M_{0}^{n+1}e^{C\nu_{f_{0}}^{max}t_{eq}}+(1+C_{q} M_{0}^{n}e^{C\nu_{f_{0}}^{max}t_{eq}}\overline{M})\bar{B}.\] Finally, we complete the proof of Proposition 5.1 by taking \(L^{\infty}_{x,v}\)-norm above. ### Proof of main theorem Proof of Theorem 1.1.: For convenience of notation, we rewrite (5.9) in Proposition 5.1 as \[\|f(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1}e^ {-t/2}\left(1+\int_{0}^{t}\|f(s)\|_{L^{\infty,q}_{x,v}}ds\right)+D, \tag{5.20}\] where \[D :=C_{q}\left(1+C_{q}M_{0}^{n}e^{C\nu_{f_{0}}^{max}t_{eq}} \overline{M}\right)^{2}\] \[\quad\times\left(N^{5}(1-e^{-\lambda})\overline{M}+\frac{1}{N^{q-5 }}+\frac{\overline{M}}{N^{q-10}}+N^{6}(\lambda^{-2}+N^{3})\left(\mathcal{E}(F_{ 0})+N^{\frac{3}{2}}\sqrt{\mathcal{E}(F_{0})}\right)\right). \tag{5.21}\] If we define \[Y(t):=1+\int_{0}^{t}\|f(s)\|_{L^{\infty,q}_{x,v}}ds,\] then we directly deduced from (5.20) that \[Y^{\prime}(t)\leq C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1}e^{-t/2}Y(t)+D.\] By multiplying both sides above by \(\exp\left\{-2C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1}(1-e^{-t/2})\right\}\), we have \[\left(Y(t)\exp\left\{-2C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1}(1-e^{-t/2}) \right\}\right)^{\prime}\leq D\exp\left\{-2C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{ 0}^{n+1}(1-e^{-t/2})\right\}\leq D,\] for all \(0\leq t\leq t_{*}\). Taking the time integration over \([0,t]\), one obtains that \[Y(t) \leq(1+Dt)\exp\left\{2C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1 }(1-e^{-t/2})\right\}\] \[\leq(1+Dt)\exp\left\{2C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1 }\right\}. \tag{5.22}\] And then, substituting (5.22) into (5.20), it holds that \[\|f(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1} \exp\left\{2C_{q}e^{\nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1}\right\}(1+Dt)e^{-t/2}+D, \tag{5.23}\] for all \(0\leq t\leq t_{*}\). We now define \[\overline{M}:=4C_{q}M_{0}^{n+1}\exp\left\{\nu_{f_{0}}^{max}t_{eq}+2C_{q}e^{ \nu_{f_{0}}^{max}t_{eq}}M_{0}^{n+1}\right\}, \tag{5.24}\] and \[t_{*}:=4\left[\ln\overline{M}-\ln\delta\right], \tag{5.25}\] for \(0<\delta<1\). From (5.23) and the definition (5.24) of \(\overline{M}\), we have \[\|f(t)\|_{L^{\infty,q}_{x,v}}\leq\frac{1}{4}\overline{M}(1+Dt)e^{-t/2}+D\leq \frac{1}{4}\overline{M}\left[1+2D\right]e^{-t/4}+D, \tag{5.26}\] where we used \(te^{-t/4}\leq 2\). Recall the definition (5.21) of \(D\). We first take \(N=N(\overline{M})>0\) large enough, then \(\lambda=\lambda(N,\overline{M})>0\) sufficiently small, and finally let \(\mathcal{E}(F_{0})\leq\varepsilon=\varepsilon(\delta,\lambda,N,\overline{M})>0\) sufficiently small, so that \[D\leq\min\left\{\frac{\overline{M}}{8},\frac{1}{4},\frac{\delta}{4}\right\}.\] Hence, it follows from (5.26) that \[\|f(t)\|_{L^{\infty,q}_{x,v}}\leq\frac{3}{8}\overline{M}+\frac{1}{8}\overline{ M}\leq\frac{1}{2}\overline{M}, \tag{5.27}\] for all \(0\leq t\leq t_{*}\). Since \(\overline{M}\) depends on \(M_{0}\) and \(\delta\), the parameter \(\epsilon\) also depends only on \(M_{0}\) and \(\delta\)\(\cdot\) Under \(\mathcal{E}(F_{0})\leq\varepsilon=\varepsilon(\delta,M_{0})\), we have shown that a priori assumption (3.1) is closed. The next step is to extend the BGK solution to time interval \(t\in[0,t_{*}]\) by using (5.27) and Proposition 4.1. Firstly, through Proposition 4.1, the solution of the BGK equation \(f(t)\) exists on \(t\in[0,t_{0}]\) satisfying \[\sup_{0\leq t\leq t_{0}}\|f(t)\|_{L^{\infty,q}_{x,v}}\leq 2\|f_{0}\|_{L^{ \infty,q}_{x,v}}\leq\frac{1}{2}\overline{M}.\] We set \(t_{0}\) as an initial time. Then Proposition 4.1 gives the local existence time \(\tilde{t}=t_{0}\left(\overline{M}/2\right)\) satisfying \[\sup_{t_{0}\leq t\leq t_{0}+\tilde{t}}\|f(t)\|_{L^{\infty,q}_{x,v}}\leq 2\|f(t_{0})\|_{L^{ \infty,q}_{x,v}}\leq\overline{M},\] when the initial data starts with \(\|f(t_{0})\|_{L^{\infty,q}_{x}}\leq\frac{1}{2}\overline{M}\). Note that the a priori assumption holds for \(t\in[0,t_{0}+\tilde{t}]\). Hence, we can apply the estimate (5.27), and then the BGK solution \(f(t)\) has the following bound \[\sup_{0\leq t\leq t_{0}+\tilde{t}}\|f(t)\|_{L^{\infty,q}_{x}}\leq\frac{1}{2} \overline{M}.\] Repeating the procedure until \(t_{*}\), the BGK solution \(f(t)\) exists and is unique on \(t\in[0,t_{*}]\) and satisfies (5.27). By definition (5.25) of \(t_{*}\) and the estimate (5.26), we obtain that \[\|f(t_{*})\|_{L^{\infty,q}_{x}}\leq\frac{3}{8}\delta+\frac{1}{4}\delta<\delta,\] due to \(D\leq\delta/4\). The final step is to extend the BGK solution to \([t_{*},\infty]\). From Proposition 6.1 in Section 6, we prove the global well-posedness and exponential decay of the BGK solution with small initial data \(\|f_{0}\|_{L^{\infty,q}_{x}}\leq\delta\). Hence, if we treat \(\|f(t_{*})\|_{L^{\infty,q}_{x}}\) as initial data in Proposition 6.1, then it follows from (3) in Proposition 6.1 that \[\|f(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}e^{-C(t-t_{*})}\|f(t_{*})\|_{L^{\infty, q}_{x,v}},\] for all \(t\geq t_{*}\). ## 6. Asymptotic stability for small amplitude regime In this section, we prove that if the initial \(L^{\infty}\) norm is sufficiently small, then there exists a unique non-negative global solution. **Proposition 6.1**.: _Let \(f_{0}\) satisfy the conservation laws (1.10). There exists \(\delta>0\) such that if \(\|f_{0}\|_{L^{\infty,q}_{x,v}}\leq\delta\), then there exists a unique global solution of the BGK model (1.6). Moreover, the following holds:_ 1. _The solution_ \(f(t,x,v)\) _satisfies the conservation laws_ \[\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}f(t,x,v)(1,v,|v|^{2})dvdx=0.\] 2. _The solution is non-negative:_ \(F(t,x,v)=\mu(v)+f(t,x,v)\geq 0\)_._ 3. _The perturbation decays exponentially:_ \[\|f(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}\delta e^{-kt},\] _for positive constants_ \(k\) _and_ \(C_{q}\)_._ 4. _Let_ \(f\) _and_ \(\tilde{f}\) _be solutions corresponding to the initial data_ \(f_{0}\) _and_ \(\tilde{f}_{0}\)_, respectively. Then_ \[\sup_{s\in[0,t]}e^{ks}\|(f-\tilde{f})(s)\|_{L^{\infty,q}_{x,v}}\leq C_{q}\|f_ {0}-\tilde{f}_{0}\|_{L^{\infty,q}_{x,v}},\] _for positive constants_ \(k\) _and_ \(C_{q}\)_._ To prove the above proposition, we follow the argument of [6] where the asymptotic stability of the Boltzmann equation (with some boundary condition) is proved in \(L^{\infty}\) with small initial data. We decompose (1.6) into the following two equations: \[\partial_{t}f_{1}+v\cdot\nabla_{x}f_{1}+f_{1}=\Gamma(f_{1}+f_{2} ),\qquad f_{1}(0,x,v)=f_{0}(x,v),\] \[\partial_{t}f_{2}+v\cdot\nabla_{x}f_{2}=(\mathbf{P}f_{2}-f_{2})+ \mathbf{P}f_{1},\qquad f_{2}(0,x,v)=0,\] where \(f=f_{1}+f_{2}\). In the following, we study the above two equations to derive the existence and asymptotic behavior of \(f_{1}\) and \(f_{2}\). **Lemma 6.1**.: _There exists \(\delta>0\) such that if \(\|f(t)\|_{L^{\infty,q}_{x,v}}\leq\delta\) and \(\|g(t)\|_{L^{\infty,q}_{x,v}}\leq\delta\), then we have_ 1. \(\|\Gamma(f)(t)\|_{L^{\infty,q}_{x,v}}\leq C\|f(t)\|^{2}_{L^{\infty,q}_{x,v}},\)__ \[(2)\ \|(\Gamma(f)-\Gamma(g))(t)\|_{L^{\infty,q}_{x,v}}\leq C_{\delta}\|(f-g)(t)\|_{L ^{\infty,q}_{x,v}},\] _for positive constants \(C\) and \(0<C_{\delta}<1\)._ Proof.: (1) By Lemma 3.7, the assumption \(\|f\|_{L^{\infty,q}_{x,v}}\leq\delta\) implies \[|\rho-1|,\ |U|,\ |T-1|\leq 2\delta.\] So that, for a sufficiently small \(\delta\), the nonlinear term \(\Gamma_{1}\) can be reduced to \[\big{|}\langle v\rangle^{q}\Gamma_{1}(f)\big{|}\leq C\big{|}\langle v\rangle^{q }(\mathbf{P}f-f)\big{|}\Big{|}\int_{\mathbb{R}^{3}}(1+|v|^{2})fdv\Big{|}\leq C \|f\|_{L^{\infty,q}_{x,v}}^{2}.\] Applying a similar process to Lemma 5.3, we also have \[|\langle v\rangle^{q}\Gamma_{2}(f)| =\rho^{a}T^{b}\sum_{1\leq i,j\leq 5}\int_{0}^{1}\langle v\rangle^{q} \frac{\mathcal{P}_{ij}((v-U_{\theta}),U_{\theta},T_{\theta})}{\rho_{\theta}^{ \alpha_{ij}}T_{\theta}^{\beta_{ij}}}\mathcal{M}(\theta)(1-\theta)d\theta\int _{\mathbb{R}^{3}}fe_{i}dv\int_{\mathbb{R}^{3}}fe_{j}dv\] \[\leq C\|f\|_{L^{\infty,q}_{x,v}}^{2}.\] (2) Since we have \(|\rho-1|,\ |U|,\ |T-1|\leq 2\delta\) for \(f\) and \(g\), applying the same argument as in Lemma 4.1 with \[\int_{\mathbb{R}^{3}}fe_{i}dv\leq C\int_{\mathbb{R}^{3}}(1+|v|+|v|^{2})|f|dv \leq C_{q}\|f\|_{L^{\infty,q}_{x,v}}\leq C_{q}\delta,\quad\text{for}\quad i=1, \cdots,5,\] we can obtain \(C_{\delta}<1\) satisfying \[\|\Gamma(f)-\Gamma(g)\|_{L^{\infty,q}_{x,v}}\leq C_{\delta}\|f-g\|_{L^{\infty, q}_{x,v}},\] for sufficiently small \(\delta\). **Lemma 6.2**.: _There exists \(\delta>0\) such that if \(\|f_{0}\|_{L^{\infty,q}_{x,v}}\leq\delta\) and \(\|g(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}\delta e^{-(1-\epsilon)t}\) for any \(\epsilon\in(0,1)\), then there exists a solution \(f_{1}\) to the following equation_ \[\partial_{t}f_{1}+v\cdot\nabla_{x}f_{1}+f_{1}=\Gamma(f_{1}+g),\qquad f_{1}(0, x,v)=f_{0}(x,v),\] _satisfying_ \[\|f_{1}(t)\|_{L^{\infty,q}_{x,v}}\leq e^{-(1-\epsilon)t}(\|f_{0}\|_{L^{ \infty,q}_{x,v}}+\delta).\] Proof.: We define the following iteration for \(f_{1}^{n}\) starting with \(f_{1}^{0}(t,x,v)=0\) \[\partial_{t}f_{1}^{n+1}+v\cdot\nabla_{x}f_{1}^{n+1}+f_{1}^{n+1}=\Gamma(f_{1}^ {n}+g),\qquad f_{1}(0,x,v)=f_{0}(x,v).\] Then we prove that \(\{f_{1}^{n}\}_{n\geq 0}\) is uniformly bounded and Cauchy. We write the equation in the mild form: \[f_{1}^{n+1}(t,x,v)=e^{-t}f_{0}(x-vt,v)+\int_{0}^{t}e^{-(t-s)}\Gamma(f_{1}^{n}+ g)(s,x-v(t-s),v)ds. \tag{6.1}\] Taking \(L^{\infty,q}_{x,v}\) on (6.1) yields \[\|f_{1}^{n+1}(t)\|_{L^{\infty,q}_{x,v}}\leq e^{-t}\|f_{0}\|_{L^{\infty,q}_{x,v }}+\int_{0}^{t}e^{-(t-s)}\|\Gamma(f_{1}^{n}+g)(s)\|_{L^{\infty,q}_{x,v}}ds.\] We multiply \(e^{(1-\epsilon)t}\) on both sides and use Lemma 6.1 to get \[e^{(1-\epsilon)t}\|f_{1}^{n+1}(t)\|_{L^{\infty,q}_{x,v}} \leq e^{-\epsilon t}\|f_{0}\|_{L^{\infty,q}_{x,v}}+\int_{0}^{t}e^{ (1-\epsilon)s}e^{-\epsilon(t-s)}\|\Gamma(f_{1}^{n}+g)(s)\|_{L^{\infty,q}_{x,v }}ds\] \[\leq\|f_{0}\|_{L^{\infty,q}_{x,v}}+C\sup_{s\in[0,t]}e^{(1-\epsilon )s}\|(f_{1}^{n}+g)(s)\|_{L^{\infty,q}_{x,v}}^{2}.\] Taking supremum on each side, we have \[\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|f_{1}^{n+1}(s)\|_{L^{\infty,q}_{x,v}}\leq \|f_{0}\|_{L^{\infty,q}_{x,v}}+C\sup_{s\in[0,t]}e^{(1-\epsilon)s}\left(\|f_{1 }^{n}(s)\|_{L^{\infty,q}_{x,v}}^{2}\right)+CC_{q}^{2}\delta^{2}.\] Thus, if the \(n\)-th step has the following bound, \[\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|f_{1}^{n}(s)\|_{L^{\infty,q}_{x,v}}\leq\|f_ {0}\|_{L^{\infty,q}_{x,v}}+\delta,\] then the \((n+1)\)-th step satisfies \[\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|f_{1}^{n+1}(s)\|_{L^{\infty,q}_{x,v}}=\|f_{0}\| _{L^{\infty,q}_{x,v}}+C(2\delta)^{2}+CC_{q}^{2}\delta^{2}\leq\|f_{0}\|_{L^{ \infty,q}_{x,v}}+\delta,\] for sufficiently small \(\delta\) satisfying \(C(4+C_{q}^{2})\delta^{2}\leq\delta\). This gives the desired uniform boundedness: \[\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|f_{1}^{n}(s)\|_{L^{\infty,q}_{x,v}}\leq\|f_{ 0}\|_{L^{\infty,q}_{x,v}}+\delta.\] To prove that \(\{f_{1}^{n}\}\) is a Cauchy sequence, we consider the difference between \(f^{n+1}\) and \(f^{n}\): \[e^{t}(f_{1}^{n+1}-f_{1}^{n})(t,x,v)=\int_{0}^{t}e^{s}\left[\Gamma(f_{1}^{n}+g)- \Gamma(f_{1}^{n-1}+g)\right](s,x-v(t-s),v)ds.\] Since, for sufficiently small \(\delta\), we have for all \(n\geq 0\) \[\int_{\mathbb{R}^{3}}(1,v,|v|^{2})(f_{1}^{n}+g)dv\leq\|f_{1}^{n}\|_{L^{\infty, q}_{x,v}}+\|g\|_{L^{\infty,q}_{x,v}}\leq(C_{q}+1)\delta,\] we can employ Lemma 6.1 (2) to get \[\|\Gamma(f^{n}+g)-\Gamma(f^{n-1}+g)\|_{L^{\infty,q}_{x,v}}\leq C_{\delta}\|f^ {n}-f^{n-1}\|_{L^{\infty,q}_{x,v}},\] for \(n\geq 1\). Therefore we have \[\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|(f_{1}^{n+1}-f_{1}^{n})(s)\|_{L^{\infty,q}_ {x,v}}\leq C_{\delta}\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|(f_{1}^{n}-f_{1}^{n-1} )(s)\|_{L^{\infty,q}_{x,v}},\] for \(0<C_{\delta}<1\). This completes the proof. Before we proceed to the next lemma, we define \[\Pi(f) :=\int_{\mathbb{T}^{3}}\mathbf{P}fdx\] \[=\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}fdvdx\mu+\int_{\mathbb{ T}^{3}\times\mathbb{R}^{3}}fvdvdx\cdot(v\mu)+\int_{\mathbb{T}^{3}\times \mathbb{R}^{3}}f\frac{|v|^{2}-3}{\sqrt{6}}dvdx\left(\frac{|v|^{2}-3}{\sqrt{6}} \mu\right).\] Note that, unlike projection operator \(\mathbf{P}\), \(\Pi\) does commutes with transport \(v\cdot\nabla_{x}\). **Lemma 6.3**.: _Let \(\|g\|_{L^{\infty}_{x,v}L^{\infty,q}_{x,v}}<\infty\). Then there exists a unique solution \(f_{2}\in L^{\infty}_{t}L^{\infty}_{x,v}(\mu^{-\zeta})\) to_ \[\partial_{t}f_{2}+v\cdot\nabla_{x}f_{2}=(\mathbf{P}f_{2}-f_{2})+\mathbf{P}g, \qquad f_{2}(0,x,v)=0, \tag{6.2}\] _where \(\zeta\in[0,1)\). Moreover, if \(\Pi(f_{2}+g)=0\) and \(\|g(t)\|_{L^{\infty,q}_{x,v}}\leq e^{-(1-\epsilon)t}(\|f_{0}\|_{L^{\infty,q}_ {x,v}}+\delta)\) for \(\epsilon\in(1-\eta_{s},1)\) (\(\eta_{s}\) will be determined in the proof), then we have_ \[\|f_{2}(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}\leq C_{q}\delta e^{-(1- \epsilon)t}.\] Proof.: Let \(S(t)\) be the semi-group so that \(S(t)f_{0}\) solves the following equation: \[(\partial_{t}+v\cdot\nabla_{x}+1)f=\mathbf{P}f,\qquad f(0)=f_{0},\qquad\Pi f_{ 0}=0. \tag{6.3}\] We first consider the \(L^{\infty}\) decay of \(S(t)\). We write (6.3) in the mild form \[f(t,x,v)=e^{-t}f_{0}(x-vt,v)+\int_{0}^{t}e^{-(t-s)}\mathbf{P}f(s,x-v(t-s),v)ds.\] Multiplying \(\mu^{-\zeta}\) and applying double iteration on \(\mathbf{P}f\), we have \[\|f(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}\lesssim e^{-\frac{1}{2}t}\|f_{0}\|_ {L^{\infty}_{x,v}(\mu^{-\zeta})}+C_{T_{0}}\int_{0}^{t}\|f(s)\|_{L^{2}_{x,v}(\mu^ {-1/2})}ds,\quad\text{for}\quad t\in[0,T_{0}],\] where we used \(\|\mathbf{P}f\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}\leq C\|f\|_{L^{2}_{x,v}(\mu^{ -1/2})}\). Recalling that there is \(\eta\) such that \(\|f(t)\|_{L^{2}_{x,v}(\mu^{-1/2})}\leq Ce^{-\eta t}\|f_{0}\|_{L^{2}_{x,v}(\mu^{ -1/2})}\) (See [46, 48]), we have from Proposition 5.4 in [6] that \[\|S(t)f_{0}\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}\leq e^{-\eta_{s}t}\|f_{0}\|_{L^{ \infty}_{x,v}(\mu^{-\zeta})}, \tag{6.4}\] for \(0<\eta_{s}<1\). Now, we consider the estimate of \(f_{2}\) in (6.2). From \(\Pi(f_{2}+g)=0\), we can estimate \(\Pi f_{2}\) as follows: \[\|\Pi f_{2}(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}=\|\Pi g(t)\|_{L^{\infty}_{x,v} (\mu^{-\zeta})}\leq C_{q}\|g(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}e^{-(1-\epsilon )t}(\|f_{0}\|_{L^{\infty,q}_{x,v}}+\delta). \tag{6.5}\] To estimate \((I-\Pi)f_{2}\), we rewrite \(f_{2}\) by using the definition of the semi-group \(S(t)\): \[f_{2}=\int_{0}^{t}S(t-s)\mathbf{P}gds.\] We claim that \(I-\Pi\) commutes with the semi-group \(S(t)\): \[(I-\Pi)f_{2}=\int_{0}^{t}S(t-s)(I-\Pi)\mathbf{P}gds. \tag{6.6}\] With this claim assumed to be true, we apply (6.4) and (6.5) to obtain \[\begin{split}\|(I-\Pi)f_{2}(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta}) }&\leq\int_{0}^{t}e^{-\eta_{s}(t-s)}\|\mathbf{P}g(s)\|_{L^{\infty }_{x,v}(\mu^{-\zeta})}ds\\ &\leq C_{q}\int_{0}^{t}e^{-\eta_{s}(t-s)}e^{-(1-\epsilon)s}(\|f_ {0}\|_{L^{\infty,q}_{x,v}}+\delta)ds\\ &\leq\frac{C_{q}}{\eta_{s}-(1-\epsilon)}e^{-(1-\epsilon)t}(\|f_{ 0}\|_{L^{\infty,q}_{x,v}}+\delta),\end{split} \tag{6.7}\] where we used \(0<1-\epsilon<\eta_{s}\). Combining (6.5) and (6.7) gives the desired result: \[\begin{split}\|f_{2}(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}& \leq\|\Pi f_{2}(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}+\|(I-\Pi)f_{ 2}(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}\\ &\leq C_{q}e^{-(1-\epsilon)t}(\|f_{0}\|_{L^{\infty}_{x,v}}+ \delta).\end{split}\] Now we go back to the proof of the claim (6.6). We first prove that \(\Pi\) commutes with \(\mathbf{P}\): \[\begin{split}\mathbf{P}\Pi f&=\mathbf{P}\left(\int _{\mathbb{T}^{3}\times\mathbb{R}^{3}}fdvdx\mu+\int_{\mathbb{T}^{3}\times \mathbb{R}^{3}}fvdvdx\cdot(v\mu)+\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}f \frac{|v|^{2}-3}{\sqrt{6}}dvdx\left(\frac{|v|^{2}-3}{\sqrt{6}}\mu\right)\right) \\ &=\mathbf{P}(\mu)\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}fdvdx+ \mathbf{P}(v\mu)\cdot\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}fvdvdx+\mathbf{ P}\left(\frac{|v|^{2}-3}{\sqrt{6}}\mu\right)\int_{\mathbb{T}^{3}\times\mathbb{R}^{3}}f \frac{|v|^{2}-3}{\sqrt{6}}dvdx\\ &=\Pi\mathbf{P}f.\end{split}\] So that \((I-\Pi)(I-\mathbf{P})=(I-\mathbf{P})(I-\Pi)\). We can easily check that \(\Pi\) also commutes with \(v\cdot\nabla_{x}\) as in [6]. Now, we apply \((I-\Pi)\) on (6.2) and use these commutation relations, we get \[\partial_{t}(I-\Pi)f_{2}+v\cdot\nabla_{x}(I-\Pi)f_{2}=(P-I)(I-\Pi)f_{2}+(I-\Pi) \mathbf{P}g.\] This completes the proof of the claim (6.6). Proof of Proposition 6.1.: We define the following iteration: \[\begin{split}&\partial_{t}f_{1}^{n+1}+v\cdot\nabla_{x}f_{1}^{n+1}+f_{1 }^{n+1}=\Gamma(f_{1}^{n+1}+f_{2}^{n}),\qquad f_{1}^{n+1}(0,x,v)=f_{0}(x,v),\\ &\partial_{t}f_{2}^{n+1}+v\cdot\nabla_{x}f_{2}^{n+1}=(\mathbf{P}f _{2}^{n+1}-f_{2}^{n+1})+\mathbf{P}f_{1}^{n+1},\qquad f_{2}^{n+1}(0,x,v)=0,\end{split} \tag{6.8}\] for \(n\geq 0\), start with \(f_{1}^{0}(t,x,v)=0\), and \(f_{2}^{0}(t,x,v)=0\). The existence of a solution is guaranteed by Lemma 6.2 and 6.3 in the following manner: For the \(g=f_{2}^{n}\) case, Lemma 6.2 implies that if \(\|f_{0}\|_{L^{\infty,q}_{x,v}}\leq\delta\) and \(\|f_{2}^{n}(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}\delta e^{-(1-\epsilon)t}\), then there exists solution \(f_{1}^{n+1}\) of equation (6.8)\({}_{1}\), and \(f_{1}^{n+1}\) satisfies \[\|f_{1}^{n+1}(t)\|_{L^{\infty,q}_{x,v}}\leq e^{-(1-\epsilon)t}(\|f_{0}\|_{L^{ \infty,q}_{x,v}}+\delta).\] Similarly, for case \(g=f_{1}^{n+1}\), Lemma 6.3 implies that if \(\|f_{1}^{n+1}\|_{L^{\infty}_{t}L^{\infty,q}_{x,v}}\leq\infty\), then there exists a unique solution \(f_{2}^{n+1}\) of (6.8)\({}_{2}\) in \(L^{\infty}_{t}L^{\infty}_{x,v}(\mu^{-\zeta})\). Moreover, if \(\Pi(f_{2}^{n+1}+f_{1}^{n+1})=0\) and \(\|f_{1}^{n+1}(t)\|_{L^{\infty,q}_{x,v}}\leq e^{-(1-\epsilon)t}(\|f_{0}\|_{L^{ \infty,q}_{x,v}}+\delta)\), then we have \[\|f_{2}^{n+1}(t)\|_{L^{\infty}_{x,v}(\mu^{-\zeta})}\leq C_{q}\delta e^{-(1- \epsilon)t}.\] Since we started the iteration with \(f_{1}^{0}(t,x,v)=0\), and \(f_{2}^{0}(t,x,v)=0\), by induction, we obtain \[\|f_{1}^{n}(t)\|_{L^{\infty,q}_{x,v}}\leq(\|f_{0}\|_{L^{\infty,q}_{x,v}}+\delta) e^{-(1-\epsilon)t},\qquad\|f_{2}^{n}(t)\|_{L^{\infty,q}_{x,v}(\mu^{-\zeta})} \leq C_{q}\delta e^{-(1-\epsilon)t}, \tag{6.9}\] for all \(n\geq 0\). We note that as we proved in Lemma 6.2, sequence \(\{f_{1}^{n}\}_{n\geq 0}\) is the Cauchy sequence. Thus there exists \(f_{1}\in L^{\infty,q}_{x,v}\) such that \[f_{1}^{n}\to f_{1},\qquad\text{with}\qquad\|f_{1}(t)\|_{L^{\infty,q}_{x,v}} \leq(\|f_{0}\|_{L^{\infty,q}_{x,v}}+\delta)e^{-(1-\epsilon)t}.\] For sequence \(\{f_{2}^{n}\}_{n\geq 0}\), we obtained uniform boundedness. Thus there exists a weak star converging subsequence \(f_{2}\) such that \[f_{2}^{n}\stackrel{{*}}{{\rightharpoonup}}f_{2},\qquad\text{ with}\qquad\|f_{2}(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}\delta e^{-(1-\epsilon)t}.\] Thanks to (6.9), \(f_{1}^{n}\) and \(f_{2}^{n}\) are weakly compact in \(L^{1}\), and for any finite time \(T\), there exists a positive constant \(C_{T}\) such that \[\int_{0}^{T}\int_{\mathbb{T}^{3}}\int_{\mathbb{R}^{3}}|v|^{3}(\mu+f_{1}^{n+1}+f _{2}^{n})dvdxdt<C_{T}.\] This third-moment estimate combined with velocity averaging lemma in [35], we have the following strong compactness for the macroscopic fields \[\int_{\mathbb{R}^{3}}(\mu+f_{1}^{n+1}+f_{2}^{n})dv:=\rho^{n}\to\rho,\] \[\int_{\mathbb{R}^{3}}v(\mu+f_{1}^{n+1}+f_{2}^{n})dv:=\rho^{n}U^{n}\to\rho U,\] \[\int_{\mathbb{R}^{3}}|v|^{2}(\mu+f_{1}^{n+1}+f_{2}^{n})dv:=3\rho^{n}T^{n}+\rho ^{n}|U^{n}|^{2}\to 3\rho T+\rho|U|^{2}.\] On the other hand, the weak compactness of \(f_{1}^{n}\) and \(f_{2}^{n}\) gives rise to the weak compactness of the local Maxwellian. The weak compactness of \(\mathcal{M}(\mu+f_{1}^{n+1}+f_{2}^{n})\) together with the strong compactness of \((\rho^{n},U^{n},T^{n})\) yields the following desired weak convergence: \[\mathcal{M}(\mu+f_{1}^{n+1}+f_{2}^{n})\rightharpoonup\mathcal{M}(\mu+f_{1}+f_{ 2}),\] in \(L^{1}([0,T]\times\mathbb{T}^{3})\). See [35, 48] for detailed arguments. This guarantees that \(f_{1}+f_{2}\) is a solution of the system (6.8). Moreover, the solution \(f_{1}+f_{2}\) satisfies \[\|(f_{1}+f_{2})(t)\|_{L^{\infty,q}_{x,v}}\leq C_{q}\delta e^{-(1-\epsilon)t}.\] To prove the conservation laws, we add the two equations in (6.8): \[\partial_{t}(f_{1}^{n+1}+f_{2}^{n+1})+v\cdot\nabla_{x}(f_{1}^{n+1}+f_{2}^{n+1 })+(f_{1}^{n+1}+f_{2}^{n+1})=\mathbf{P}(f_{1}^{n+1}+f_{2}^{n+1})+\Gamma(f_{1}^ {n+1}+f_{2}^{n}).\] We take \(\Pi\) on both sides to have \[\partial_{t}\Pi(f_{1}^{n+1}+f_{2}^{n+1})=\Pi\left(\Gamma(f_{1}^{n+1}+f_{2}^{n} )\right). \tag{6.10}\] Now we show that \(\Pi(\Gamma(f))=0\) for any function \(f\in L^{\infty,q}_{x,v}\). For any function \(f\in L^{\infty,q}_{x,v}\) with \(F=\mu+f\), the cancellation property of the BGK operator (1.4) implies \[\mathbf{P}(\nu(\mathcal{M}(F)-F))=0.\] Applying the linearization of the BGK operator in Lemma 2.1, we have \[0=\mathbf{P}(\nu(\mathcal{M}(F)-F))=\mathbf{P}((\mathbf{P}f-f)+\Gamma(f))= \mathbf{P}(\Gamma(f)),\] which guarantees \(\Pi\left(\Gamma(f_{1}^{n+1}+f_{2}^{n})\right)=0\). This combining with (6.10), we have \[\Pi(f_{1}^{n+1}(t)+f_{2}^{n+1}(t))=\Pi(f_{1}^{n+1}(0)+f_{2}^{n+1}(0))=\Pi f_{0}=0.\] Therefore \(f_{1}^{n}+f_{2}^{n}\) satisfies the conservation laws for all \(n\geq 0\). For stability and uniqueness, let \(f\) and \(\tilde{f}\) be solutions corresponding to the initial data \(f_{0}\) and \(\tilde{f}_{0}\), respectively. Subtracting the following two equations \[\partial_{t}f+v\cdot\nabla_{x}f+f =\mathbf{P}f+\Gamma(f),\] \[\partial_{t}\tilde{f}+v\cdot\nabla_{x}\tilde{f}+\tilde{f} =\mathbf{P}\tilde{f}+\Gamma(\tilde{f}),\] yields \[\partial_{t}(f-\tilde{f})+v\cdot\nabla_{x}(f-\tilde{f})+f-\tilde{f}=\mathbf{P}(f- \tilde{f})+\Gamma(f)-\Gamma(\tilde{f}).\] Using the semi-group operator, we write \[(f-\tilde{f})(t,x,v)=S(t)(f_{0}-\tilde{f}_{0})(x-vt,v)+\int_{0}^{t}S(t-s)( \Gamma(f)-\Gamma(\tilde{f}))(s,x-v(t-s),v)ds.\] Multiplying \(e^{(1-\epsilon)t}\langle v\rangle^{q}\) on both sides and applying Lemma 6.1, we have \[\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|(f-\tilde{f})(s)\|_{L^{\infty,q}_{x,v}} \leq e^{-\epsilon t}\|f_{0}-\tilde{f}_{0}\|_{L^{\infty,q}_{x,v}}+ \int_{0}^{t}e^{-\epsilon(t-s)}e^{(1-\epsilon)s}\|(\Gamma(f)-\Gamma(\tilde{f})) (s)\|_{L^{\infty,q}_{x,v}}ds\] \[\leq\|f_{0}-\tilde{f}_{0}\|_{L^{\infty,q}_{x,v}}+\frac{1}{ \epsilon}C_{\delta}\sup_{s\in[0,t]}e^{(1-\epsilon)s}\|(f-\tilde{f})(s)\|_{L^ {\infty,q}_{x,v}}.\] For sufficiently small \(C_{\delta}<\epsilon\), we obtain stabtility and uniqueness of the solution. For the non-negativity of the solution, we recover the equation for \(F=\mu+f\): \[\partial_{t}F+v\cdot\nabla_{x}F+\nu F=\nu\mathcal{M}(F).\] Then the mild form of \(F\) with non-negativity of \(F_{0}\) and \(\mathcal{M}(F)\) gives the non-negativty of the solution \[F(t,x,v)=e^{-\int_{0}^{t}\nu(s,x)ds}F_{0}(x-vt,v)+\int_{0}^{t}e^{-\int_{s}^{t }\nu(\tau,x)d\tau}\mathcal{M}(F)(s,x-v(t-s),v)ds\geq 0.\] This completes the proof of Proposition 6.1. ## Appendix A Nonlinear part of the BGK operator In this section, we give the explicit form of the nonlinear term of the BGK model. We compute the second derivative of the BGK operator and specify the polynomial form \(\mathcal{P}_{ij}\) and the number \(\alpha_{ij}\) and \(\beta_{ij}\) satisfying \[\left[\nabla^{2}_{(\rho_{\theta},\rho_{\theta}U_{\theta},G_{\theta})}\mathcal{ M}(\theta)\right]_{ij}=\frac{\mathcal{P}_{ij}((v-U_{\theta}),U_{\theta},T_{ \theta})}{\rho_{\theta}^{\alpha_{ij}}T_{\theta}^{\beta_{ij}}}\mathcal{M}( \theta).\] Because \(\mathcal{M}(\theta)\) depends on \((\rho_{\theta},U_{\theta},T_{\theta})\), we need to use the chain rule twice. For brevity, we omit the \(\theta\) dependency in this section. **The first derivative:** We first review the previous computations for the BGK operator: **Lemma A.1**.: _[_46_]_ _When \(\rho>0\), for the relation \((\rho,U,T)\) and \((\rho,\rho U,G)\) in (2.6), we have_ \[J=\frac{\partial(\rho,\rho U,G)}{\partial(\rho,U,T)}=\left[\begin{array}{ ccccc}1&0&0&0&0\\ U_{1}&\rho&0&0&0\\ U_{2}&0&\rho&0&0\\ U_{3}&0&0&\rho&0\\ \frac{3T+|U|^{2}-3}{\sqrt{6}}&\frac{2\rho U_{1}}{\sqrt{6}}&\frac{2\rho U_{2}}{ \sqrt{6}}&\frac{2\rho U_{3}}{\sqrt{6}}&\frac{3\rho}{\sqrt{6}}\end{array}\right],\] _and_ \[J^{-1}=\left(\frac{\partial(\rho,\rho U,G)}{\partial(\rho,U,T)}\right)^{-1}= \left[\begin{array}{cccc}1&0&0&0&0\\ -\frac{U_{1}}{\rho}&\frac{1}{\rho}&0&0&0\\ -\frac{U_{2}}{\rho}&0&\frac{1}{\rho}&0&0\\ -\frac{U_{3}}{\rho}&0&0&\frac{1}{\rho}&0\\ \frac{|U|^{2}-3T+3}{3\rho}&-\frac{2}{3}\frac{U_{1}}{\rho}&-\frac{2}{3}\frac{U_ {2}}{\rho}&-\frac{2}{3}\frac{U_{3}}{\rho}&\sqrt{\frac{2}{3}}\frac{1}{\rho} \end{array}\right].\] _The first derivative of the local Maxwellian with respect to the macroscopic fields gives_ \[\nabla_{(\rho,U,T)}\mathcal{M}(F)=\left(\frac{1}{\rho},\frac{v-U}{T},\left(- \frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right)\right)\mathcal{M}(F).\] Now we compute the first derivative of \(\mathcal{M}(F)\) with respect to \((\rho,\rho U,G)\). Since the local Maxwellian \(\mathcal{M}(F)\) depends on \((\rho,U,T)\), we should apply the following change of variable: (A.1) \[\nabla_{(\rho,\rho U,G)}\mathcal{M}(F)=\left(\frac{\partial(\rho,\rho U,G)}{ \partial(\rho,U,T)}\right)^{-1}\nabla_{(\rho,U,T)}\mathcal{M}(F).\] We denote the right-hand-side of (A.1) as \(R\). Applying Lemma A.1, we have (A.2) \[\begin{split} R&=\left[\begin{array}{cccc}1&0&0& 0&0\\ -\frac{U_{1}}{\rho}&\frac{1}{\rho}&0&0&0\\ -\frac{U_{2}}{\rho}&0&\frac{1}{\rho}&0&0\\ -\frac{U_{3}}{\rho}&0&0&\frac{1}{\rho}&0\\ \frac{|U|^{2}-3T+3}{3\rho}&-\frac{2}{3}\frac{U_{1}}{\rho}&-\frac{2}{3}\frac{U_{ 2}}{\rho}&-\frac{2}{3}\frac{U_{3}}{\rho}&\sqrt{\frac{2}{3}}\frac{1}{\rho}\\ \end{array}\right]\mathcal{M}(F)\\ &=\left[\begin{array}{cccc}\frac{1}{\rho}&-\frac{U_{1}}{\rho^{2}}+\frac{v_{1 }-U_{1}}{\rho T}&\\ -\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{2}}{\rho T}&\\ -\frac{U_{3}}{\rho^{2}}+\frac{v_{3}-U_{3}}{\rho T}&\\ \frac{|U|^{2}-3T+3}{3\rho^{2}}-\frac{2}{3}\frac{U_{\cdot}(v-U)}{\rho T}+\sqrt{ \frac{2}{3}}\frac{1}{\rho}\left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2 }}\right)\\ \end{array}\right]\mathcal{M}(F).\end{split}\] **The second derivative:** Taking \(\nabla_{(\rho,\rho U,G)}\) on (A.1), we apply the change of variable \((\rho,\rho U,G)\to(\rho,U,T)\) once more: (A.3) \[\nabla_{(\rho,\rho U,G)}^{2}\mathcal{M}(F)=\nabla_{(\rho,\rho U,G)}R=\left( \frac{\partial(\rho,\rho U,G)}{\partial(\rho,U,T)}\right)^{-1}\nabla_{(\rho,U,T)}R.\] We first calculate \(\nabla_{(\rho,U,T)}R\), which is a \(5\times 5\) matrix. The first column of \(\nabla_{(\rho,U,T)}R\) is \((\rho,U,T)\) derivative of the first component of (A.2), which is \(\nabla_{(\rho,U,T)}\left(\frac{1}{\rho}\mathcal{M}(F)\right)\): \[\nabla_{(\rho,U,T)}\left(\frac{1}{\rho}\mathcal{M}(F)\right)=\left[\begin{array} []{cccc}-\frac{1}{\rho^{2}}\mathcal{M}+\frac{1}{\rho}\partial_{\rho} \mathcal{M}\\ \frac{1}{\rho}\partial_{U_{1}}\mathcal{M}\\ \frac{1}{\rho}\partial_{U_{2}}\mathcal{M}\\ \frac{1}{\rho}\partial_{U_{3}}\mathcal{M}\\ \frac{1}{\rho}\partial_{T}\mathcal{M}\end{array}\right]=\left[\begin{array}{ ccccc}-\frac{1}{\rho^{2}}\mathcal{M}+\frac{1}{\rho}\partial_{\rho} \mathcal{M}\\ \frac{1}{\rho}\partial_{U_{1}}\mathcal{M}\\ \frac{v_{2}-U_{2}}{\rho T}\\ \frac{v_{2}-U_{3}}{\rho T}\\ \left(-\frac{3}{2}\frac{1}{\rho T}+\frac{|v-U|^{2}}{2\rho T^{2}}\right)\\ \end{array}\right]\mathcal{M}(F).\] Similarly, we can compute the second to the fourth column as follows: \[\nabla_{(\rho,U,T)}\left(\left(-\frac{U_{1}}{\rho^{2}}+\frac{v_{1}-U_{1}}{ \rho T}\right)\mathcal{M}(F)\right)=\left[\begin{array}{cccc}\frac{U_{1}}{ \rho^{2}}&\\ -\left(\frac{1}{\rho^{2}}+\frac{1}{\rho T}\right)+\left(-\frac{U_{1}}{\rho^{2} }+\frac{v_{1}-U_{1}}{\rho T}\right)\frac{v_{1}-U_{1}}{T}&\\ \left(-\frac{U_{1}}{\rho^{2}}+\frac{v_{1}-U_{1}}{\rho T}\right)\frac{v_{2}-U_{ 2}}{T}&\\ -\frac{U_{1}}{\rho^{2}}+\frac{v_{1}-U_{1}}{\rho T}\right)\frac{v_{2}-U_{3}}{T}& \\ -\frac{v_{1}-U_{1}}{\rho T^{2}}+\left(-\frac{U_{1}}{\rho^{2}}+\frac{v_{1}-U_{ 1}}{\rho T}\right)\left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right) \\ \end{array}\right]\mathcal{M}(F),\] and \[\nabla_{(\rho,U,T)}\left(\left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{2}}{ \rho T}\right)\mathcal{M}(F)\right)=\left[\begin{array}{cccc}\frac{U_{2}}{ \rho^{2}}&\\ \left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{2}}{\rho T}\right)\frac{v_{1}-U_{ 1}}{T}&\\ -\left(\frac{1}{\rho^{2}}+\frac{1}{\rho T}\right)+\left(-\frac{U_{2}}{\rho^{2} }+\frac{v_{2}-U_{2}}{\rho T}\right)\frac{v_{2}-U_{2}}{T}&\\ \left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{2}}{\rho T}\right)\frac{v_{2}-U_{ 3}}{T}&\\ -\frac{v_{2}-U_{2}}{\rho T^{2}}+\left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{ 2}}{\rho T}\right)\left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right) \\ \end{array}\right]\mathcal{M}(F),\] and \[\nabla_{(\rho,U,T)}\left(\left(-\frac{U_{3}}{\rho^{2}}+\frac{v_{3}-U_{3}}{\rho T} \right)\mathcal{M}(F)\right)=\left[\begin{array}{c}\frac{U_{3}}{\rho^{3}}\\ \left(-\frac{U_{3}}{\rho^{2}}+\frac{v_{3}-U_{3}}{\rho T}\right)\frac{v_{1}-U_{ 1}}{T}\\ \left(-\frac{U_{3}}{\rho^{2}}+\frac{v_{3}-U_{3}}{\rho T}\right)\frac{v_{2}-U_{ 2}}{T}\\ -\left(\frac{1}{\rho^{2}}+\frac{1}{\rho T}\right)+\left(-\frac{U_{3}}{\rho^{2}} +\frac{v_{3}-U_{3}}{\rho T}\right)\frac{v_{3}-U_{3}}{T}\\ -\frac{v_{3}-U_{3}}{\rho T^{2}}+\left(-\frac{U_{3}}{\rho^{2}}+\frac{v_{3}-U_{ 3}}{\rho T}\right)\left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right) \end{array}\right]\mathcal{M}(F).\] The fifth column of \(\nabla_{(\rho,U,T)}R\) is equal to \(\nabla_{(\rho,U,T)}\left(\left(\frac{|U|^{2}-3T+3}{3\rho^{2}}-\frac{2}{3}\frac {U\cdot(v-U)}{\rho T}+\sqrt{2}\frac{1}{3}\frac{1}{\rho}\left(-\frac{3}{2}\frac {1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right)\right)\mathcal{M}(F)\right)\), and which become \[\left[\begin{array}{c}\frac{2U_{1}}{3\rho^{2}}-\frac{2}{3}\frac{v_{1}-2U_{ 1}}{\rho T}-\sqrt{\frac{2}{3}}\frac{1}{\rho}\left(\frac{v_{1}-U_{1}}{T^{2}} \right)+\frac{v_{1}-U_{1}}{T}\\ \frac{2U_{2}}{3\rho^{2}}+\frac{2v_{2}-U_{2}}{3}\frac{1}{\rho T}-\sqrt{\frac{2} {3}}\frac{1}{\rho}\left(\frac{v_{2}-U_{2}}{T^{2}}\right)+\frac{v_{2}-U_{2}}{T} \\ \frac{2U_{3}}{3\rho^{2}}-\frac{2}{3}\frac{v_{3}-2U_{3}}{\rho T}-\sqrt{\frac{2} {3}}\frac{1}{\rho}\left(\frac{v_{3}-U_{3}}{T^{2}}\right)+\frac{v_{3}-U_{3}}{T} \\ -\frac{1}{\rho^{2}}+\frac{2}{3}\frac{U\cdot(v-U)}{\rho T^{2}}+\sqrt{\frac{2} {3}}\frac{1}{\rho}\left(\frac{3}{2}\frac{1}{T^{2}}-\frac{|v-U|^{2}}{T^{3}} \right)+\left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right)\end{array} \right]\mathcal{M}(F).\] Note that we computed \(\nabla_{(\rho,U,T)}R\) in (A.3). Now we should multiply the matrix \(\nabla_{(\rho,U,T)}R\) by \(\left(\frac{\partial(\rho,\rho U,G)}{\partial(\rho,U,T)}\right)^{-1}\). It is a product of two \(5\times 5\) matrices. We present the calculations for each row. \(\bullet\) The first row of \(\nabla_{(\rho,\rho U,G)}^{2}\mathcal{M}(F)\): \[\left[0\ \frac{U_{1}}{\rho^{3}}\ \frac{U_{2}}{\rho^{3}}\ \frac{U_{3}}{\rho^{3}}\ - \frac{|U|^{2}-3T+3}{3\rho^{3}}\right]\mathcal{M}(F).\] \(\bullet\) The second row of \(\nabla_{(\rho,\rho U,G)}^{2}\mathcal{M}(F)\): \[\left[\begin{array}{c}-\frac{U_{1}^{2}}{\rho^{4}}-\left(\frac{1}{\rho^{3}}+ \frac{1}{\rho^{2}T}\right)+\left(-\frac{U_{1}}{\rho^{3}}+\frac{v_{1}-U_{1}}{ \rho^{2}T}\right)\frac{v_{1}-U_{1}}{T}\\ -\frac{U_{1}U_{2}}{\rho^{4}}+\left(-\frac{U_{2}}{\rho^{3}}+\frac{v_{2}-U_{2}}{ \rho^{2}T}\right)\frac{v_{1}-U_{1}}{T}\\ -\frac{U_{1}U_{3}}{\rho^{2}}+\left(-\frac{U_{3}}{\rho^{3}}+\frac{v_{3}-U_{3}}{ \rho^{2}T}\right)\frac{v_{1}-U_{1}}{T}\\ \frac{U_{1}}{\rho}\frac{|U|^{2}-3T+3}{3\rho^{3}}+\frac{1}{\rho}\left(\frac{2U_ {1}}{3\rho^{2}}-\frac{2}{3}\frac{v_{2}-U_{1}}{\rho T}-\sqrt{\frac{2}{3}}\frac {1}{\rho}\left(\frac{v_{1}-U_{1}}{T^{2}}\right)+\frac{v_{1}-U_{1}}{T}\right) \end{array}\right]^{T}\mathcal{M}(F).\] \(\bullet\) The third row of \(\nabla_{(\rho,\rho U,G)}^{2}\mathcal{M}(F)\): \[\left[\begin{array}{c}\frac{v_{3}-U_{3}}{\rho^{2}T}\\ -\frac{U_{1}U_{3}}{\rho^{4}}+\left(-\frac{U_{1}}{\rho^{3}}+\frac{v_{1}-U_{1}}{ \rho^{2}T}\right)\frac{v_{2}-U_{2}}{T}\\ -\frac{U_{2}^{2}}{\rho^{4}}-\left(\frac{1}{\rho^{3}}+\frac{1}{\rho^{2}T}\right) +\left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{2}}{\rho^{2}T}\right)\frac{v_{2}-U _{2}}{T}\\ -\frac{U_{1}U_{3}}{\rho^{4}}+\left(-\frac{U_{3}}{\rho^{3}}+\frac{v_{3}-U_{3}}{ \rho^{2}T}\right)\frac{v_{2}-U_{2}}{T}\\ \frac{U_{1}}{\rho}\frac{|U|^{2}-3T+3}{3\rho^{3}}+\frac{1}{\rho}\left(\frac{2U_ {2}}{3\rho^{2}}-\frac{2}{3}\frac{v_{2}-2U_{2}}{\rho T}-\sqrt{\frac{2}{3}}\frac {1}{\rho}\left(\frac{v_{2}-U_{2}}{T^{2}}\right)+\frac{v_{2}-U_{2}}{T}\right) \end{array}\right]^{T}\mathcal{M}(F).\] \(\bullet\) The fourth row of \(\nabla_{(\rho,\rho U,G)}^{2}\mathcal{M}(F)\): \[\left[\begin{array}{c}\frac{v_{3}-U_{3}}{\rho^{2}T}\\ -\frac{U_{1}U_{3}}{\rho^{4}}+\left(-\frac{U_{1}}{\rho^{3}}+\frac{v_{1}-U_{1}}{ \rho^{2}T}\right)\frac{v_{3}-U_{3}}{T}\\ -\frac{U_{2}U_{3}}{\rho^{4}}+\left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{2}}{ \rho^{2}T}\right)\frac{v_{3}-U_{3}}{T}\\ -\frac{U_{3}^{2}}{\rho^{4}}-\left(\frac{1}{\rho^{3}}+\frac{1}{\rho^{2}T}\right) +\left(-\frac{U_{3}}{\rho^{3}}+\frac{v_{3}-U_{3}}{\rho^{2}T}\right)\frac{v_{3} -U_{3}}{T}\\ \frac{U_{3}}{\rho}\frac{|U|^{2}-3T+3}{3\rho^{3}}+\frac{1}{\rho}\left(\frac{2U_ {3}}{3\rho^{2}}-\frac{2}{3}\frac{v_{3}-2U_{3}}{\rho T}-\sqrt{\frac{2}{3}}\frac{1} {\rho}\left(\frac{v_{3}-U_{3}}{T^{2}}\right)+\frac{v_{3}-U_{3}}{T}\right) \end{array}\right]^{T}\mathcal{M}(F).\] \(\bullet\) The fifth row of \(\nabla^{2}_{(\rho,\rho U,G)}\mathcal{M}(F)\): Since the fifth row is too complicated, we present each component separately. The first component of the fifth row, i.e. \([\nabla^{2}_{(\rho,\rho U,G)}\mathcal{M}(F)]_{51}\): \[\left(-\frac{2}{3}\frac{U}{\rho}\cdot\frac{v-U}{\rho T}+\sqrt{\frac{2}{3}}\frac {1}{\rho}\left(-\frac{3}{2}\frac{1}{\rho T}+\frac{|v-U|^{2}}{2\rho T^{2}} \right)\right)\mathcal{M}(F).\] The second component of the fifth row, i.e. \([\nabla^{2}_{(\rho,\rho U,G)}\mathcal{M}(F)]_{52}\): \[\left[\frac{|U|^{2}-3T+3}{3\rho}\frac{U_{1}}{\rho^{3}}-\frac{2}{3 }\frac{U}{\rho}\cdot\frac{v-U}{T}\left(\left(-\frac{U_{1}}{\rho^{2}}+\frac{v_ {1}-U_{1}}{\rho T}\right)\right)-\frac{2}{3}\frac{U_{1}}{\rho}\left(-\left( \frac{1}{\rho^{2}}+\frac{1}{\rho T}\right)\right)\right.\] \[\left.+\sqrt{\frac{2}{3}}\frac{1}{\rho}\left(-\frac{v_{1}-U_{1}} {\rho T^{2}}+\left(-\frac{U_{1}}{\rho^{2}}+\frac{v_{1}-U_{1}}{\rho T}\right) \left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right)\right)\bigg{]} \mathcal{M}(F).\] The third component of the fifth row, i.e. \([\nabla^{2}_{(\rho,\rho U,G)}\mathcal{M}(F)]_{53}\): \[\left[\frac{|U|^{2}-3T+3}{3\rho}\frac{U_{2}}{\rho^{3}}-\frac{2}{3 }\frac{U}{\rho}\cdot\frac{v-U}{T}\left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_ {2}}{\rho T}\right)-\frac{2}{3}\frac{U_{2}}{\rho}\left(-\left(\frac{1}{\rho^{2 }}+\frac{1}{\rho T}\right)\right)\right.\] \[\left.+\sqrt{\frac{2}{3}}\frac{1}{\rho}\left(-\frac{v_{2}-U_{2}}{ \rho T^{2}}+\left(-\frac{U_{2}}{\rho^{2}}+\frac{v_{2}-U_{2}}{\rho T}\right) \left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right)\right)\bigg{]} \mathcal{M}(F).\] The fourth component of the fifth row, i.e. \([\nabla^{2}_{(\rho,\rho U,G)}\mathcal{M}(F)]_{54}\): \[\left[\frac{|U|^{2}-3T+3}{3\rho}\frac{U_{3}}{\rho^{3}}-\frac{2}{3 }\frac{U}{\rho}\cdot\frac{v-U}{T}\left(-\frac{U_{3}}{\rho^{2}}+\frac{v_{3}-U_ {3}}{\rho T}\right)-\frac{2}{3}\frac{U_{3}}{\rho}\left(-\left(\frac{1}{\rho^{2 }}+\frac{1}{\rho T}\right)\right)\right.\] \[\left.+\sqrt{\frac{2}{3}}\frac{1}{\rho}\left(-\frac{v_{3}-U_{3}}{ \rho T^{2}}+\left(-\frac{U_{3}}{\rho^{2}}+\frac{v_{3}-U_{3}}{\rho T}\right) \left(-\frac{3}{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right)\right)\bigg{]} \mathcal{M}(F).\] The fifth component of the fifth row, i.e. \([\nabla^{2}_{(\rho,\rho U,G)}\mathcal{M}(F)]_{55}\): \[\left[\frac{|U|^{2}-3T+3}{3\rho}\left(-\frac{|U|^{2}-3T+3}{3\rho^ {3}}\right)-\frac{2}{3}\frac{U}{\rho}\cdot\left(\frac{2U}{3\rho^{2}}-\frac{2} {3}\frac{v-2U}{\rho T}-\sqrt{\frac{2}{3}}\frac{1}{\rho}\left(\frac{v-U}{T^{2}} \right)+\frac{v-U}{T}\right)\right.\] \[\left.+\sqrt{\frac{2}{3}}\frac{1}{\rho}\left(-\frac{1}{\rho^{2}} +\frac{2}{3}\frac{U\cdot(v-U)}{\rho T^{2}}+\sqrt{\frac{2}{3}}\frac{1}{\rho} \left(\frac{3}{2}\frac{1}{T^{2}}-\frac{|v-U|^{2}}{T^{3}}\right)+\left(-\frac{3 }{2}\frac{1}{T}+\frac{|v-U|^{2}}{2T^{2}}\right)\right)\bigg{]}\mathcal{M}(F).\] We completed the calculation of \(5\times 5\) matrix \(\nabla^{2}_{(\rho,\rho U,G)}\mathcal{M}(F)\). **Acknowledgement:** G.-C. Bae is supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. 2021R1C1C2094843). G.-H. Ko and D.-H. Lee are supported by the National Research Foundation of Korea(NRF) grant funded by the Korean government(MSIT)(No. NRF-2019R1C1C1010915). S.-B. Yun is supported by Samsung Science and Technology Foundation under Project Number SSTF-BA1801-02.

2307.13559

The homotopy category of monomorphisms between projective modules

Let $(S, \n)$ be a commutative noetherian local ring and $\omega\in\n$ be non-zerodivisor. This paper deals with the behavior of the category $\mon(\omega, \cp)$ consisting of all monomorphisms between finitely generated projective $S$-modules with cokernels annihilated by $\omega$. We introduce a homotopy category $\HT\mon(\omega, \cp)$, which is shown to be triangulated. It is proved that this homotopy category embeds into the singularity category of the factor ring $R=S/{(\omega)}$. As an application, not only the existence of almost split sequences {ending at indecomposable non-projective objects of} $\mon(\omega, \cp)$ is proven, but also the Auslander-Reiten translation, $\tau_{\mon}(-)$, is completely recognized. Particularly, it will be observed that any non-projective object of $\mon(\omega, \cp)$ with local endomorphism ring is invariant under the square of the Auslander-Reiten translation.

Abdolnaser Bahlekeh, Fahimeh Sadat Fotouhi, Armin Nateghi, Shokrollah Salarian

2023-07-25T15:05:50Z

http://arxiv.org/abs/2307.13559v1

# The homotopy category of monomorphisms between projective modules ###### Abstract. Let \((S,\mathfrak{n})\) be a commutative noetherian local ring and \(\omega\in\mathfrak{n}\) be non-zerodivisor. This paper deals with the behavior of the category \(\mathsf{Mon}(\omega,\mathcal{P})\) consisting of all monomorphisms between finitely generated projective \(S\)-modules with cokernels annihilated by \(\omega\). We introduce a homotopy category \(\mathsf{HMon}(\omega,\mathcal{P})\), which is shown to be triangulated. It is proved that this homotopy category embeds into the singularity category of the factor ring \(R=S/(\omega)\). As an application, not only the existence of almost split sequences ending at indecomposable non-projective objects of \(\mathsf{Mon}(\omega,\mathcal{P})\) is proven, but also the Auslander-Reiten translation, \(\tau_{\mathsf{Mon}}(-)\), is completely recognized. Particularly, it will be observed that any non-projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\) with local endomorphism ring is invariant under the square of the Auslander-Reiten translation. Key words and phrases:monomorphism category, homotopy category, almost split sequence, Auslander-Reiten translation, singularity category 2020 Mathematics Subject Classification: 13D09, 18GS0, 16G70, 16G30 This work is based upon research funded by Iran National Science Foundation (INSF) under project No. 4001480. The research of the second author was in part supported by a grant from IPM where \(e\) is an extension of an injective envelope \(e^{\prime}:\ker(f)\to E\). In a remarkable result, they have shown that, if \(f\) is an indecomposable object of \(\mathsf{Mon}(\Lambda)\), then \(\tau_{\mathsf{Mon}}(f)=\mathsf{Mimor}\tau_{\Lambda}\mathrm{Coker}(f)\); see [30, Theorem 5.1]. Here \(\tau_{\mathsf{Mon}}(f)\) is the Auslander-Reiten translation of \(f\) in \(\mathsf{Mon}(\Lambda)\). This result has been generalized over noetherian algebras in [7, Theorem 5.9]. From now on, assume that \((S,\mathfrak{n})\) is a commutative noetherian local ring with \(\dim S\geq 2\) and \(\omega\in\mathfrak{n}\) is non-zerodivisor. Assume that \(\mathsf{Mon}(\omega,\mathcal{P})\) is the full subcategory of \(\mathsf{Mon}(S)\) consisting of all monomorphisms \((P\stackrel{{ f}}{{\to}}Q)\) in the module category \(\mathsf{mod}S\) such that \(P\) and \(Q\) are finitely generated projective modules and \(\mathrm{Coker}f\) is annihilated by \(\omega\). In this paper, we will show that this category is well-behaved. Firstly, we need to give some definitions. A morphism \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P^ {\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) in \(\mathsf{Mon}(\omega,\mathcal{P})\) is called null-homotopic, if there are \(S\)-homomorphisms \(s_{1}:P\to Q^{\prime}\) and \(s_{0}:Q\to P^{\prime}\) such that \(f^{\prime}\psi_{1}-f^{\prime}s_{0}f=\omega.s_{1}\), or equivalently, \(\psi_{0}f-f^{\prime}s_{0}f=\omega.s_{1}\). Now we define the homotopy category \(\mathsf{HMon}(\omega,\mathcal{P})\) with the same objects as \(\mathsf{Mon}(\omega,\mathcal{P})\) and its morphism sets are morphism sets in \(\mathsf{Mon}(\omega,\mathcal{P})\) modulo null-homotopic. It is fairly easy to see that for a given object \((P\stackrel{{ f}}{{\to}}Q)\in\mathsf{Mon}(\omega,\mathcal{P})\), there is a unique morphism \(Q\stackrel{{ f_{\Sigma}}}{{\to}}P\) such that \(ff_{\Sigma}=\omega.\mathsf{id}_{Q}\) and \(f_{\Sigma}f=\omega.\mathsf{id}_{P}\), and in particular, \((Q\stackrel{{ f_{\Sigma}}}{{\to}}P)\) is also an object of \(\mathsf{Mon}(\omega,\mathcal{P})\); see Lemma 2.4. It is proved that \(\Sigma:\mathsf{HMon}(\omega,\mathcal{P})\longrightarrow\mathsf{HMon}(\omega, \mathcal{P})\), with \(\Sigma(f)=-f_{\Sigma}\) and \(\Sigma(\psi_{1},\psi_{0})=(\psi_{0},\psi_{1})\), is an auto-equivalence functor, and particularly, with \(\Sigma\) being suspension, \(\mathsf{HMon}(\omega,\mathcal{P})\) gets a triangulated structure in a natural way; see Proposition 2.12. Also a tie connection between the homotopy category \(\mathsf{HMon}(\omega,\mathcal{P})\) and the singularity category of the factor ring \(R=S/(\omega)\), will be discovered. Precisely, it will be shown that there is a fully faithful triangle functor \(\mathsf{HMon}(\omega,\mathcal{P})\longrightarrow\mathsf{D_{sg}}(R)\); see Corollary 2.17. By the aid of this result, in the last section, we will able to show that each indecomposable non-projective object of the category \(\mathsf{Mon}(\omega,\mathcal{P})\) appears as the right term of an almost split sequence, provided that \(R\) is a complete Gorenstein ring which is an isolated singularity. Particularly, an explicit description of the Auslander-Reiten translation in \(\mathsf{Mon}(\omega,\mathcal{P})\), which will be also denoted by \(\tau_{\mathsf{Mon}}(-)\), is given. Precisely, it is shown that for a given non-projective indecomposable object \((P\stackrel{{ f}}{{\to}}Q)\in\mathsf{Mon}(\omega,\mathcal{P})\), we have \(\tau_{\mathsf{Mon}}(f)=f\), if \(\mathsf{dim}R\) is even, and otherwise, \(\tau_{\mathsf{Mon}}(f)=f_{\Sigma}\); see Theorem 3.6. This particularly implies that \(\tau_{\mathsf{Mon}}^{2}(f)=f\). This result should be compared with Corollary 6.5 of [30], where they have shown that if \(\Lambda\) is a commutative uniserial algebra, then for an indecomposable non-projective object \((M\stackrel{{ f}}{{\to}}N)\) in \(\mathsf{Mon}(\Lambda)\), there is an isomorphism of objects \(\tau_{\mathsf{Mon}}^{6}(f)\cong f\). Throughout the paper, \((S,\mathfrak{n})\) is a commutative noetherian local ring with maximal ideal \(\mathfrak{n}\), \(\omega\in\mathfrak{n}\) is a non-zerodivisor element, and \(R\) is the factor ring \(S/(\omega)\). Unless otherwise specified, by a module we mean a finitely generated \(S\)-module and \(\mathsf{mod}S\) stands for the category of all finitely generated \(S\)-modules. Moreover, to consider a map \(f:M\to N\) as an object of \(\mathsf{Mor}(S)\) we use parentheses and denote it by \((M\stackrel{{ f}}{{\to}}N)\). ## 2. The homotopy category of monomorphisms This section is devoted to introduce and study the homotopy category of the monomorphism category of projective \(S\)-modules. Among others, we show that this subcategory admits a triangulated structure. Moreover, it is proved that it can be considered as a full triangulated subcategory of the singularity category \(\mathsf{D_{sg}}(R)\) of \(R\). We begin with the following definition. **Definition 2.1**.: By the category \(\mathsf{Mon}(\omega,\mathcal{P})\), we mean a category that whose objects are those \(S\)-monomorphisms \((P\stackrel{{ f}}{{\to}}Q)\), where \(P,Q\in\mathcal{P}(S)\) and \(\mathrm{Coker}f\) is an \(R\)-module. Here \(\mathcal{P}(S)\) is the category of all (finitely generated) projective \(S\)-modules. Moreover, a morphism \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P^{ \prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) between two objects is a pair of \(S\)-homomorphisms \(\psi_{1}:P\to P^{\prime}\) and \(\psi_{0}:Q\to Q^{\prime}\) such that \(\psi_{0}f=f^{\prime}\psi_{1}\). It is clear that \(\mathsf{Mon}(\omega,\mathcal{P})\) is a full additive subcategory of the monomorphism category \(\mathsf{Mon}(S)\). **Definition 2.2**.: We say that a morphism \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P ^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) in \(\mathsf{Mon}(\omega,\mathcal{P})\) is _null-homotopic_, if there are \(S\)-homomorphisms \(s_{1}:P\to Q^{\prime}\) and \(s_{0}:Q\to P^{\prime}\) such that \(f^{\prime}\psi_{1}-f^{\prime}s_{0}f=\omega.s_{1}\), or equivalently, \(\psi_{0}f-f^{\prime}s_{0}f=\omega.s_{1}\). The _homotopy category_\(\mathsf{HMon}(\omega,\mathcal{P})\) of \(\mathsf{Mon}(\omega,\mathcal{P})\), is defined as follows; its objects are the same as \(\mathsf{Mon}(\omega,\mathcal{P})\) and its morphism sets are morphism sets in \(\mathsf{Mon}(\omega,\mathcal{P})\) modulo null-homotopic. It is easily seen that null-homotopies are compatible with addition and composition of morphisms in \(\mathsf{Mon}(\omega,\mathcal{P})\). This, in conjunction with the fact that \(\mathsf{Mon}(\omega,\mathcal{P})\) is an additive category, would imply the result below. **Proposition 2.3**.: _The homotopy category \(\mathsf{HMon}(\omega,\mathcal{P})\) is an additive category._ We should emphasize that although the proof of the next result is the same as for Lemma 2.6 of [8], we include it only for the sake of completeness. **Lemma 2.4**.: _Let \((P\stackrel{{ f}}{{\to}}Q)\in\mathsf{Mon}(\omega,\mathcal{P})\) be arbitrary. Then there exists a unique morphism \((Q\stackrel{{ f_{\mathsf{X}}}}{{\to}}P)\) such that \(ff_{\mathsf{X}}=\omega.\mathsf{id}_{Q}\) and \(f_{\mathsf{X}}f=\omega.\mathsf{id}_{P}\). In particular, \((Q\stackrel{{ f_{\mathsf{X}}}}{{\to}}P)\) is an object of \(\mathsf{Mon}(\omega,\mathcal{P})\)._ Proof.: By our assumption, there is a short exact sequence of \(S\)-modules; \(0\to P\stackrel{{ f}}{{\to}}Q\to\mathrm{Coker}f\to 0\) such that \(\omega\mathrm{Coker}f=0\). Take the following commutative diagram with exact rows; So, applying [28, Lemma 1.1, page 163] gives us the following commutative diagram with exact rows; Since \(\omega\mathrm{Coker}f=0\), the middle row will be split, and so, there is a morphism \(f_{\mathsf{X}}:Q\to P\) such that \(f_{\mathsf{X}}f=\omega.\mathsf{id}_{P}\). Another use of the fact that \(\omega\mathrm{Coker}f=0\), leads us to infer that \(\omega Q\subseteq f(P)\). This fact besides the equality \(f_{\mathfrak{X}}f=\omega.\mathsf{id}_{P}\) would imply that \(ff_{\mathfrak{X}}=\omega.\mathsf{id}_{Q}\). It should be noted that, if there is another morphism \(g:Q\to P\) satisfying the mentioned conditions, then we will have \(ff_{\mathfrak{X}}=fg\), and then, \(f\) being a monomorphism ensures the validity of the equality \(f_{\mathfrak{X}}=g\). Now we show that \((Q\stackrel{{ f_{\mathfrak{X}}}}{{\to}}P)\in\mathsf{Mon}(\omega, \mathcal{P})\). As \(f_{\mathfrak{X}}\) is evidently a monomorphism, we only need to check that \(\omega\) annihilates \(\mathrm{Coker}f_{\mathfrak{X}}\). To see this, consider the short exact sequence \(0\to Q\stackrel{{ f_{\mathfrak{X}}}}{{\to}}P\stackrel{{ \pi}}{{\to}}\mathrm{Coker}f_{\mathfrak{X}}\to 0\). For a given object \(y\in\mathrm{Coker}f_{\mathfrak{X}}\), take \(x\in P\) such that \(\pi(x)=y\). Since \(f_{\mathfrak{X}}f=\omega.\mathsf{id}_{P}\), we have \(\omega P\subseteq f_{\mathfrak{X}}(Q)\). Consequently, \(\omega y=\omega\pi(x)=\pi(\omega x)\in\pi f_{\mathfrak{X}}(Q)=0\), meaning that \(\omega\mathrm{Coker}f_{\mathfrak{X}}=0\), as needed. **Corollary 2.5**.: _For a given object \((P\stackrel{{ f}}{{\to}}Q)\in\mathsf{Mon}(\omega,\mathcal{P})\), \((f_{\mathfrak{X}})_{\mathfrak{X}}=f\)._ **Remark 2.6**.: Assume that \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P^{ \prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) is a morphism in \(\mathsf{Mon}(\omega,\mathcal{P})\). Since \(f^{\prime}\psi_{1}=\psi_{0}f\), we will have the equalities; \(f^{\prime}\psi_{1}f_{\mathfrak{X}}=\psi_{0}ff_{\mathfrak{X}}=\omega.\psi_{0}= f^{\prime}f^{\prime}_{\mathfrak{X}}\psi_{0}\). Now \(f^{\prime}\) being a monomorphism, gives rise to the equality \(\psi_{1}f_{\mathfrak{X}}=f^{\prime}_{\mathfrak{X}}\psi_{0}\). Namely \((\psi_{0},\psi_{1}):(Q\stackrel{{ f_{\mathfrak{X}}}}{{\to}}P) \longrightarrow(Q^{\prime}\stackrel{{ f^{\prime}_{\mathfrak{X}}}}{{ \to}}P^{\prime})\) is also a morphism in the category \(\mathsf{Mon}(\omega,\mathcal{P})\). Particularly, in a similar way, one may see that the morphisms \((\psi_{1},\psi_{0})\) and \((\psi_{0},\psi_{1})\) are null-homotopic, simultaneously. In what follows, we intend to show that the category \(\mathsf{HMon}(\omega,\mathcal{P})\), admits a natural structure of triangulated category. In this direction, we need to determine a translation functor \(\mathfrak{\Sigma}\) and a class of exact triangles. Assume that \((P\stackrel{{ f}}{{\to}}Q)\) is an arbitrary object of \(\mathsf{Mon}(\omega,\mathcal{P})\). In view of Lemma 2.4, there is a unique object \((Q\stackrel{{ f_{\mathfrak{X}}}}{{\to}}P)\in\mathsf{Mon}(\omega, \mathcal{P})\). Now we define \(\mathsf{\Sigma}((P\stackrel{{ f}}{{\to}}Q)):=(Q\stackrel{{ -f_{\mathfrak{X}}}}{{\to}}P)\). Moreover, for a given morphism \(\psi=(\psi_{1},\psi_{0})\) in \(\mathsf{HMon}(\omega,\mathcal{P})\), we set \(\mathsf{\Sigma}((\psi_{1},\psi_{0})):=(\psi_{0},\psi_{1})\). So, one may easily see that \(\mathsf{\Sigma}:\mathsf{HMon}(\omega,\mathcal{P})\longrightarrow\mathsf{HMon }(\omega,\mathcal{P})\) is an additive functor, with \(\mathsf{\Sigma}^{2}\) the identity functor, because by Lemma 2.4, \(\mathsf{\Sigma}(P\stackrel{{ f}}{{\to}}Q)\) is unique. Precisely, we have the result below. **Proposition 2.7**.: \(\mathsf{\Sigma}:\mathsf{HMon}(\omega,\mathcal{P})\longrightarrow\mathsf{HMon }(\omega,\mathcal{P})\) _is an auto-equivalence functor._ Assume that \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P ^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) is a morphism in \(\mathsf{HMon}(\omega,\mathcal{P})\). According to Lemma 2.4, there are objects \((Q\stackrel{{ f_{\mathfrak{X}}}}{{\to}}P)\) and \((Q^{\prime}\stackrel{{ f^{\prime}_{\mathfrak{X}}}}{{\to}}P^{ \prime})\) in \(\mathsf{Mon}(\omega,\mathcal{P})\) such that \(ff_{\mathfrak{X}}=\omega.\mathsf{id}_{Q}\) and \(f^{\prime}f^{\prime}_{\mathfrak{X}}=\omega.\mathsf{id}_{Q^{\prime}}\). Now we define the mapping cone \(C(\psi)\) of \(\psi\), as \(C(\psi):=(P^{\prime}\oplus Q\stackrel{{ c}}{{\to}}Q^{\prime}\oplus P)\), where \(c=\left[\begin{array}{cc}f^{\prime}&\psi_{0}\\ 0&-f_{\mathfrak{X}}\end{array}\right].\) As we will observe below, \(C(\psi)\) is an object of \(\mathsf{Mon}(\omega,\mathcal{P})\). Moreover, we have that \(c_{\mathsf{\Sigma}}=\left[\begin{array}{cc}f^{\prime}_{\mathfrak{X}}&\psi_{ 1}\\ 0&-f\end{array}\right].\) **Lemma 2.8**.: _With the notation above, \(C(\psi)\in\mathsf{Mon}(\omega,\mathcal{P})\)._ Proof.: Consider the exact sequence \(0\longrightarrow(P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{ \prime})\longrightarrow(P^{\prime}\oplus Q\stackrel{{ c}}{{\to}}Q^{ \prime}\oplus P)\longrightarrow(Q\stackrel{{-f_{\mathfrak{X}}}}{{\to}}P)\longrightarrow 0\) with split rows. Since \(f^{\prime}\) and \(f_{\mathfrak{X}}\) are monomorphisms, the same will be true for \(c\). So, it remains to show that \(\omega\mathrm{Coker}c=0\). Take an object \((x,y)\in Q^{\prime}\oplus P\). We intend to find an object \((u,z)\in P^{\prime}\oplus Q\) with \(c(u,z)=(\omega x,\omega y)\). As \(\omega\mathrm{Coker}f_{\mathfrak{X}}=0\), one may find an object \(z\in Q\) such that \(-f_{\mathsf{\Sigma}}(z)=\omega y\). Similarly, there is an object \(t\in P^{\prime}\) in which \(f^{\prime}(t)=\omega x\). So, applying Remark 2.6 gives us the equality \(-f^{\prime}_{\mathsf{\Sigma}}\psi_{0}(z)=\omega\psi_{1}(y)\). Thus, we will have the equality \(-f^{\prime}f^{\prime}_{\mathsf{\Sigma}}\psi_{0}(z)=\omega f^{\prime}\psi_{1}(y)\). Now, since \(f^{\prime}f^{\prime}_{\mathsf{\Sigma}}=\omega.\mathsf{id}_{Q^{\prime}}\) and \(\omega\) is non-zerodivisor, one may deduce that \(-\psi_{0}(z)=f^{\prime}\psi_{1}(y)\). Hence, putting \(u:=t+\psi_{1}(y)\), we will have \(c(u,z)=(\omega x,\omega y)\). This, indeed, means that \(\omega\mathrm{Coker}c=0\), and so, the proof is finished. Now we define a standard triangle in the category \(\mathsf{HMon}(\omega,\mathcal{P})\) as a triangle of the form, \((P\stackrel{{ f}}{{\to}}Q)\stackrel{{\psi}}{{\longrightarrow }}(P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime}) \stackrel{{[\text{\small{id }}0]^{t}}}{{\longrightarrow}}C(\psi) \stackrel{{[\text{\small{$\mathsf{0}$ id}}]}}{{\longrightarrow}}\Sigma(P\stackrel{{ f}}{{\to}}Q)\)= \((Q\stackrel{{-f_{\mathsf{T}}}}{{\to}}P)\). We say that a triangle in \(\mathsf{HMon}(\omega,\mathcal{P})\) is an _exact triangle_, if it is isomorphic to a standard triangle. Assume that \(\Delta\) is the collection of all exact triangles in the homotopy category \(\mathsf{HMon}(\omega,\mathcal{P})\). Before proving that \(\mathsf{HMon}(\omega,\mathcal{P})\) admits a triangulated structure, we need to state some preliminary results. The proof of the next result follows by the same argument given in [8, Lemma 2.14], and we include its proof for the sake of completeness. **Lemma 2.9**.: _Let \(Q\) be a projective \(S\)-module. Then \((Q\stackrel{{\mathsf{id}}}{{\to}}Q)\) and \((Q\stackrel{{\omega}}{{\to}}Q)\) are projective objects in \(\mathsf{Mon}(\omega,\mathcal{P})\)._ Proof.: We deal only with the case \((Q\stackrel{{\omega}}{{\to}}Q)\), because the other one is obtained easily. Take a short exact sequence \(0\longrightarrow(E_{1}\stackrel{{ e_{1}}}{{\to}}E_{0}) \longrightarrow(T_{1}\stackrel{{ g_{1}}}{{\to}}T_{0}) \stackrel{{\varphi}}{{\longrightarrow}}(Q\stackrel{{ \omega}}{{\to}}Q)\longrightarrow 0\) in \(\mathsf{Mon}(\omega,\mathcal{P})\). Now projectivity of \(Q\) gives us a morphism \(\psi_{0}:Q\to T_{0}\) with \(\varphi_{0}\psi_{0}=\mathsf{id}_{Q}\). Since \(\mathrm{Coker}_{1}\) is annihilated by \(\omega\), one may find a morphism \(\psi_{1}:Q\to T_{1}\) making the following diagram commutative Now using the fact that \(\omega\) is non-zerodivisor, we deduce that \(\varphi\psi=\mathsf{id}_{(Q\stackrel{{\omega}}{{\to}}Q)}\), and so \((Q\stackrel{{\omega}}{{\to}}Q)\) is a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\), as required. **Lemma 2.10**.: _Let \((P\stackrel{{ f}}{{\to}}Q)\) be an arbitrary object of \(\mathsf{Mon}(\omega,\mathcal{P})\). Then \((Q\oplus P\stackrel{{ l}}{{\to}}P\oplus Q)\) with \(l=\left[\begin{array}{cc}-f_{\mathsf{T}}&\mathsf{id}\\ 0&f\end{array}\right]\), is a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\) with \(\mathrm{Coker}l=Q/\omega Q\). In particula, \((P\stackrel{{ f}}{{\to}}Q)\) is a homomorphic image of a projective object in \(\mathsf{Mon}(\omega,\mathcal{P})\)._ Proof.: Since \(ff_{\mathsf{T}}=\omega.\mathsf{id}_{Q}\), we may have the following commutative diagram with exact rows; where \(l=\left[\begin{array}{cc}-f_{\mathsf{T}}&\mathsf{id}\\ 0&f\end{array}\right].\) Applying Snake lemma and using the fact that \(\omega\) is non-zerodivisor, guarantee that \(l\) is a monomorphism with \(\mathrm{Coker}l=Q/\omega Q\). Namely, \((Q\oplus P\stackrel{{ l}}{{\to}}P\oplus Q)\) is an object of \(\mathsf{Mon}(\omega,\mathcal{P})\). Moreover, since by Lemma 2.9, \((Q\stackrel{{\omega}}{{\to}}Q)\) and \((P\stackrel{{\mathsf{id}}}{{\to}}P)\) are projective objects of \(\mathsf{Mon}(\omega,\mathcal{P})\), the same is true for \((Q\oplus P\stackrel{{ l}}{{\to}}P\oplus Q)\). Now the epimorphism \(\pi=(\pi_{1},\pi_{0}):(Q\oplus P\stackrel{{ l}}{{\to}}P\oplus Q) \rightarrow(P\stackrel{{ f}}{{\to}}Q)\), where \(\pi_{1}\) and \(\pi_{0}\) are projections, completes the proof. **Remark 2.11**.: Assume that \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q) \longrightarrow(P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) is a morphism in \(\mathsf{Mon}(\omega,\mathcal{P})\). As mentioned in the proof of Lemma 2.8, there is a short exact sequence \(0\longrightarrow(P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{ \prime})\stackrel{{[\text{\small{id }}0]^{t}}}{{\longrightarrow}}(P^{\prime}\oplus Q \stackrel{{ c}}{{\to}}Q^{\prime}\oplus P)\stackrel{{[ \text{\small{$\mathsf{0}$ id}}]}}{{\longrightarrow}}(Q\stackrel{{ \neg f_{\mathsf{T}}}}{{\to}}P)\longrightarrow 0\) in \(\mathsf{Mon}(\omega,\mathcal{P})\), where the middle term is \(C(\psi)\). Then one may observe that \(C([\mathsf{id}\ 0]^{t})\cong(Q\stackrel{{-f_{\mathsf{X}}}}{{\to}}P)\), in \(\mathsf{HMon}(\omega,\mathcal{P})\). In this direction, consider the following short exact sequence in \(\mathsf{Mon}(\omega,\mathcal{P})\); \[0\longrightarrow(P^{\prime}\oplus Q^{\prime}\stackrel{{ l}}{{\to}}Q^{\prime}\oplus P^{\prime}) \stackrel{{[\mathsf{id}\ 0]^{t}}}{{\longrightarrow}}(P^{\prime}\oplus Q\oplus Q^{\prime} \stackrel{{ l^{\prime}}}{{\to}}Q^{\prime}\oplus P\oplus P^{\prime}) \stackrel{{[\mathsf{0}\ \ \mathsf{id}]}}{{\longrightarrow}}(Q\stackrel{{-f_{\mathsf{X}}}}{{\to}}P)\to 0,\] where \(l=\left[\begin{array}{cc}f^{\prime}&\mathsf{id}\\ 0&-f^{\prime}_{\mathsf{X}}\end{array}\right]\) and the middle term of the sequence is \(C([\mathsf{id}\ 0]^{t})\), and then \(l^{\prime}=\left[\begin{array}{cc}f^{\prime}&\psi_{0}&\mathsf{id}\\ 0&-f_{\mathsf{X}}&0\\ 0&0&-f^{\prime}_{\mathsf{X}}\end{array}\right].\) It should be noted that the middle term of the latter exact sequence is the mapping cone of the injection map \((P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\stackrel{{ [\mathsf{id}\ 0]^{t}}}{{\longrightarrow}}(P^{\prime}\oplus Q \stackrel{{ c}}{{\to}}Q^{\prime}\oplus P)\). In view of Lemma 2.10, the left term of the above sequence is a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\). This yields that, the middle and the right terms of the sequence are isomorphic in \(\mathsf{HMon}(\omega,\mathcal{P})\), as claimed. In a similar way, it can be seen that the mapping cone of the morphism \(((P^{\prime}\oplus Q\stackrel{{ c}}{{\to}}Q^{\prime}\oplus P) \stackrel{{[\mathsf{0}\ \ \mathsf{id}]}}{{\longrightarrow}}(Q\stackrel{{-f_{\mathsf{X}}}}{{ \to}}P))\) is isomorphic to \((P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) in \(\mathsf{HMon}(\omega,\mathcal{P})\). Now, we prove that \(\mathsf{HMon}(\omega,\mathcal{P})\) is a triangulated category. The proof should be compared with the argument given in the proof of [18, Theorem 6.7]. **Proposition 2.12**.: _The triple \((\mathsf{HMon}(\omega,\mathcal{P}),\Sigma,\Delta)\) is a triangulated category._ Proof.: We need to prove that the class of exact triangles satisfies Verdier's axioms TR1-TR4 stated in [17, (1.1)]. (TR1) First, one should note that, by our definition, every morphism in \(\mathsf{HMon}(\omega,\mathcal{P})\) is embedded in an exact triangle and also, a triangle which is isomorphic to an exact triangle is also an exact triangle. So, we need to show that for a given object \((P\stackrel{{ f}}{{\to}}Q)\in\mathsf{HMon}(\omega,\mathcal{P})\), there exists an exact triangle \((P\stackrel{{ f}}{{\to}}Q)\stackrel{{\mathsf{id}}}{{ \longrightarrow}}(P\stackrel{{ f}}{{\to}}Q)\longrightarrow 0\longrightarrow(Q\stackrel{{-f_{\mathsf{X}}}}{{ \to}}P)\). By our construction, there is an exact triangle \((P\stackrel{{ f}}{{\to}}Q)\stackrel{{\mathsf{id}}}{{ \longrightarrow}}(P\stackrel{{ f}}{{\to}}Q)\stackrel{{[ \mathsf{id}\ 0]^{t}}}{{\longrightarrow}}C(\mathsf{id})\stackrel{{[\mathsf{0} \ \mathsf{id}]}}{{\longrightarrow}}(Q\stackrel{{-f_{\mathsf{X}}}}{{ \to}}P)\), where \(C(\mathsf{id})=(P\oplus Q\stackrel{{ c}}{{\to}}Q\oplus P)\), with \(c=\left[\begin{array}{cc}f&\mathsf{id}\\ 0&-f_{\mathsf{X}}\end{array}\right].\) By Lemma 2.10, \(C(\mathsf{id})\) is a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\) and so, it is isomorphic to the zero object in the homotopy category \(\mathsf{HMon}(\omega,\mathcal{P})\), as needed. (TR2) We have to show that any rotation of an exact triangle in \(\mathsf{HMon}(\omega,\mathcal{P})\) is also exact. Without loss of generality, one may consider standard triangles. So, for a given standard triangle \((P\stackrel{{ f}}{{\to}}Q)\stackrel{{\psi}}{{ \longrightarrow}}(P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{ \prime})\stackrel{{[\mathsf{id}\ 0]^{t}}}{{\longrightarrow}}C(\psi) \stackrel{{[\mathsf{0}\ \ \mathsf{id}]}}{{\longrightarrow}}(Q\stackrel{{-f_{\mathsf{X}}}}{{ \to}}P)\), we shall prove that the triangle \((P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\stackrel{{ [\mathsf{id}\ 0]^{t}}}{{\longrightarrow}}C(\psi) \stackrel{{[\mathsf{0}\ \ \mathsf{id}]}}{{\longrightarrow}}(Q\stackrel{{-f_{\mathsf{X}}}}{{ \to}}P)\stackrel{{-\Sigma\,\psi}}{{\longrightarrow}}(Q^{\prime} \stackrel{{-f_{\mathsf{X}}^{\prime}}}{{\to}}P^{\prime})\) is an exact triangle. According to Remark 2.11, \((Q\stackrel{{-f_{\mathsf{X}}}}{{\to}}P)\) isomorphic to \(C([\mathsf{id}\ 0]^{t})\). Consequently, the latter triangle is isomorphic in \(\mathsf{HMon}(\omega,\mathcal{P})\) to the standard triangle \((P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\stackrel{{ [\mathsf{id}\ 0]^{t}}}{{\longrightarrow}}C(\psi) \longrightarrow C([\mathsf{id}\ 0]^{t})\longrightarrow(Q^{\prime} \stackrel{{-f^{\prime}_{\mathsf{X}}}}{{\to}}P^{\prime})\), giving the desired result. (TR3) Again it would be enough to verify the axiom for standard triangles. So, assume that is a diagram in \(\mathsf{HMon}(\omega,\mathcal{P})\) such that the left square is commutative. We must find a morphism \(\eta:C(\psi)\longrightarrow C(\epsilon^{\prime})\) which makes the diagram commute. By our hypothesis, there are homotopy morphisms \(s_{0}:Q\to P^{\prime}_{1}\) and \(s_{1}:P\to Q^{\prime}_{1}\) such that \((\epsilon_{0}\psi_{0}-\epsilon^{\prime}_{0}\gamma_{0})f-g^{\prime}s_{0}f=\omega.s_{1}\). Thus, in order to prove that \(s_{1}\) is isomorphic to \((P\stackrel{{ f}}{{\to}}Q)\), we have to show that \(s_{1}\) is isomorphic to \((P\stackrel{{ f}}{{\to}}Q)\). [MISSING_PAGE_POST] (TR14) to complete the diagram to a morphism of triangles, one may define \(\eta=(\eta_{1},\eta_{0}):C(\psi)\longrightarrow C(\epsilon^{\prime})\) by letting \(\eta_{1}=\left[\begin{array}{cc}\epsilon_{1}&s_{0}\\ 0&\gamma_{0}\end{array}\right]\) and \(\eta_{0}=\left[\begin{array}{cc}\epsilon_{0}&s_{1}\\ 0&\gamma_{1}\end{array}\right].\) Now it is easily checked that the constructed squares commute. (TR4) As the previous, it suffices to check the octahedral axiom for standard triangles. Assume that \((P\stackrel{{ f}}{{\rightarrow}}Q)\stackrel{{\psi}} {{\longrightarrow}}(P^{\prime}\stackrel{{ f^{\prime}}}{{ \rightarrow}}Q^{\prime})\stackrel{{\eta}}{{\longrightarrow}}(P^{ \prime\prime}\stackrel{{ f^{\prime\prime}}}{{\rightarrow}}Q^{ \prime\prime})\) is a composition of morphisms in \(\mathsf{HMon}(\omega,\mathcal{P})\). We must prove that there exists the following commutative diagram; in \(\mathsf{HMon}(\omega,\mathcal{P})\) such that rows are exact triangles. To this end, by applying TR1 and TR3, we only need to show the bottom row is an exact triangle. This will be done by proving that it is isomorphic to the standard triangle \(C(\psi)\stackrel{{\varphi}}{{\longrightarrow}}C(\eta\psi) \stackrel{{[\mathsf{id}~{}0]^{t}}}{{\longrightarrow}}C(\varphi) \stackrel{{[\mathsf{0}~{}\mathsf{id}]}}{{\longrightarrow}} \mathfrak{\Sigma}\,C(\psi)\). In order to construct an isomorphism between these triangles, we may take the identity morphisms for the first, second and fourth entries, and for the third entry, we define the following morphism; \[\epsilon=(\epsilon_{1},\epsilon_{0}):C(\eta)=(P^{\prime\prime}\oplus Q^{\prime }\stackrel{{ l}}{{\rightarrow}}Q^{\prime\prime}\oplus P^{\prime}) \longrightarrow C(\varphi)=(P^{\prime\prime}\oplus Q\oplus Q^{\prime}\oplus P \stackrel{{ l^{\prime}}}{{\rightarrow}}Q^{\prime\prime}\oplus P \oplus P^{\prime}\oplus Q),\] by setting \(\epsilon_{i}=\left[\begin{array}{cc}\mathsf{id}&0&0\\ 0&0&\mathsf{id}&0\end{array}\right]^{t}\), where \(l=\left[\begin{array}{cc}f^{\prime\prime}&\eta_{0}\\ 0&-f^{\prime}_{\mathfrak{L}}\end{array}\right]\) and \(l^{\prime}=\left[\begin{array}{cc}f^{\prime\prime}&\eta_{0}\psi_{0}&\eta_{0 }&0\\ 0&0&\mathsf{id}\end{array}\right]^{t}\). Since \(\gamma=(\gamma_{1},\gamma_{0})\) and \(\delta=(\delta_{1},\delta_{0})\) are morphisms with \(\gamma_{1}=\left[\begin{array}{cc}\mathsf{id}&0\\ 0&\psi_{0}\end{array}\right]\), \(\gamma_{0}=\left[\begin{array}{cc}\mathsf{id}&0\\ 0&\psi_{1}\end{array}\right]\) and \(\delta_{i}=\left[\begin{array}{cc}0&\mathsf{id}\\ 0&0\end{array}\right]\), we infer that \([0\,\mathsf{id}]\epsilon=\delta\) and \(\epsilon\gamma-[\mathsf{id}\,0]^{t}\) is null-homotopic with the homotopy morphisms \(s_{0}=\left[\begin{array}{ccc}0&0&0&0\\ 0&0&0&-\mathsf{id}\end{array}\right]^{t}\) and \(s_{1}=\left[\begin{array}{ccc}0&0&0&0\\ 0&0&0&\mathsf{id}\end{array}\right]^{t}\). So, it remains to show that \(\epsilon\) is an isomorphism in \(\mathsf{HMon}(\omega,\mathcal{P})\). To this end, consider the short exact sequence, \(0\longrightarrow C(\eta)\stackrel{{\epsilon}}{{\longrightarrow }}C(\varphi)\longrightarrow(Q\oplus P\stackrel{{ l^{\prime\prime}}}{{ \rightarrow}}P\oplus Q)\longrightarrow 0\) in \(\mathsf{Mon}(\omega,\mathcal{P})\), with \(l^{\prime\prime}=\left[\begin{array}{cc}\mathsf{f_{X}}&\mathsf{id}\\ 0&-f\end{array}\right]\). According to Lemma 2.10, the right term is a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\), and so, \(\epsilon\) will be an isomorphism in \(\mathsf{HMon}(\omega,\mathcal{P})\). So the proof is completed. **2.13**.: Gorenstein projective modules. An acyclic complex of projective \(\Lambda\)-modules; \(\mathbf{P}_{\bullet}:\cdots\longrightarrow P_{n+1}\stackrel{{ d_{n+1}}}{{\longrightarrow}}P_{n}\stackrel{{ d_{n}}}{{\longrightarrow}}P_{n-1}\stackrel{{ d_{n-1}}}{{\longrightarrow}}\cdots\) is called _totally acyclic_, if the acyclicity is preserved by \(\mathsf{Hom}_{\Lambda}(-,P)\) for every projective \(\Lambda\)-module \(P\). A \(\Lambda\)-module \(M\) is said to be _Gorenstein projective_, if it is a syzygy of a totally acyclic complex of projective modules. Clearly, every projective module is Gorenstein projective. It is known that over a Gorenstein ring \(\Lambda\), every acyclic complex is totally acyclic, and also \(d\)-th syzygy of any \(\Lambda\)-module is Gorenstein projective, where \(d=\dim\Lambda\); see [13, Theorem 10.2.14]. Finitely generated Gorenstein projective modules over a noetherian ring are introduced by Auslander and Bridger under the name "modules of G-dimension zero" [2]. Over a commutative Gorenstein ring, these modules are equal to the maximal Cohen-Macaulay modules. The category of all (finitely generated) Gorenstein projective \(\Lambda\)-modules, will be depicted by \(\mathsf{Gp}(\Lambda)\). **Remark 2.14**.: Assume that \((P\stackrel{{ f}}{{\to}}Q)\) is an arbitrary object of \(\mathsf{Mon}(\omega,\mathcal{P})\). Since \(ff_{\Sigma}=\omega.\mathsf{id}_{Q}\) and \(f_{\Sigma}f=\omega.\mathsf{id}_{P}\), one may get an exact sequence of \(R\)-modules; \(0\to\mathrm{Coker}f\to P/\omega P\stackrel{{\bar{f}}}{{\to}}Q/ \omega Q\to\mathrm{Coker}f\to 0\), and so, \(\mathrm{Coker}f\) has a \(2\)-periodic projective resolution. We should emphasize that, as \(\mathrm{Coker}f\) is an \(R\)-module, the equality \(\mathrm{Coker}f=\mathrm{Coker}\bar{f}\) holds. Let us explain the equality \(\mathrm{ker}\bar{f}=\mathrm{Coker}f\). Applying the functor \(-\otimes_{S}R\) to the short exact sequence of \(S\)-modules \(0\to P\stackrel{{ f}}{{\to}}Q\to\mathrm{Coker}f\to 0\), gives rise to the exact sequence \(0\to\mathsf{Tor}_{1}^{S}(\mathrm{Coker}f,R)\to P/\omega P\stackrel{{ \bar{f}}}{{\to}}Q/\omega Q\to\mathrm{Coker}f\to 0\). So it suffices to show that \(\mathsf{Tor}_{1}^{S}(\mathrm{Coker}f,R)=\mathrm{Coker}f\). To derive this, one may apply the functor \(\mathrm{Coker}f\otimes_{S}-\) to the short exact sequence of \(S\)-modules; \(0\to S\stackrel{{\omega}}{{\to}}S\to R\to 0\) and use the fact that \(\mathrm{Coker}f\) is annihilated by \(\omega\). Similarly, we have also an exact sequence of \(R\)-modules; \(0\to\mathrm{Coker}f_{\Sigma}\to Q/\omega Q\stackrel{{\bar{f}_{ \Sigma}}}{{\to}}P/\omega P\to\mathrm{Coker}f_{\Sigma}\to 0\). It should be noted that these exact sequences yield that \(\Omega_{R}(\mathrm{Coker}f)=\mathrm{Coker}f_{\Sigma}\) and \(\Omega_{R}(\mathrm{Coker}f_{\Sigma})=\mathrm{Coker}f\). In particular, we get the acyclic complex of projective \(R\)-modules; \(\cdots\to P/\omega P\stackrel{{\bar{f}}}{{\to}}Q/\omega Q \stackrel{{\bar{f}_{\Sigma}}}{{\to}}P/\omega P\stackrel{{ \bar{f}}}{{\to}}Q/\omega Q\stackrel{{\bar{f}_{\Sigma}}}{{\to}}\cdots\). Since the projective dimensions of \(\mathrm{Coker}f\) and \(\mathrm{Coker}f_{\Sigma}\) over \(S\) are at most one, applying [27, Lemma 2(i), page 140] enables us to deduce that \(\mathsf{Ext}_{R}^{i}(\mathrm{Coker}f,R)=0=\mathsf{Ext}_{R}^{i}(\mathrm{Coker}f _{\Sigma},R)\) for all \(i\geq 1\). Consequently, the latter acyclic complex is totally acyclic, and so, \(\mathrm{Coker}f\) is a Gorenstein projective \(R\)-module; see also [9, Lemma 3.1]. The result below, which is the main result of this section, clarifies the connection between the homotopy category \(\mathsf{HMon}(\omega,\mathcal{P})\) and the stable category of Gorenstein projective \(R\)-modules \(\underline{\mathsf{Gp}}(R)\). **Theorem 2.15**.: _There is a fully faithful functor \(T:\mathsf{HMon}(\omega,\mathcal{P})\longrightarrow\underline{\mathsf{Gp}}(R)\), sending each object \((P\stackrel{{ f}}{{\to}}Q)\) to \(\mathrm{Coker}f\)._ Proof.: Assume that \((P\stackrel{{ f}}{{\to}}Q)\) is an arbitrary object of \(\mathsf{HMon}(\omega,\mathcal{P})\). As noted in Remark 2.14, \(\mathrm{Coker}f\) is a Gorenstein projective \(R\)-module. Moreover, any morphism \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P^ {\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) gives us a unique \(S\) (and also \(R\))-homomorphism \(h:\mathrm{Coker}f\to\mathrm{Coker}f^{\prime}\). Now, we set \(T(\psi):=h\). Assume that \(\psi=(\psi_{1},\psi_{0})\) is null-homotopic. We must show that \(T(\psi)\) is zero in \(\underline{\mathsf{Gp}}(R)\). Take \(S\)-homomorphisms \(s_{0}:Q\to P^{\prime}\) and \(s_{1}:P\to Q^{\prime}\) such that \(f^{\prime}\psi_{1}-f^{\prime}s_{0}f=\omega.s_{1}\). This in conjunction with Lemma 2.10, gives us the following commutative diagram with exact rows; where \(l=\left[\begin{smallmatrix}-f^{\prime}_{\pm}&\id\\ 0&f^{\prime}\end{smallmatrix}\right].\) Since the compositions of the left and the middle columns are \(\psi_{1}\) and \(\psi_{0}\), respectively, \(T(\psi)=\beta\alpha\) factors through the projective \(R\)-module \(Q^{\prime}/\omega Q^{\prime}\). Thus it is zero in \(\mathsf{Gp}(R)\). Consequently, \(T\) is well-defined. The functor \(T\) is full: assume that \((P\stackrel{{ f}}{{\to}}Q)\) and \((P^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) are two objects of \(\mathsf{HMon}(\omega,\mathcal{P})\), and a morphism \(h:\mathrm{Coker}f\to\mathrm{Coker}f^{\prime}\) is given. Since \(Q\) is a projective \(S\)-module, one may get the following commutative diagram with exact rows; This means that \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P^{ \prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) is a morphism in \(\mathsf{HMon}(\omega,\mathcal{P})\) and \(T(\psi)=h\). Now we prove that the functor \(T\) is faithful. To do this, assume that \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\to}}Q)\longrightarrow(P ^{\prime}\stackrel{{ f^{\prime}}}{{\to}}Q^{\prime})\) is a morphism in \(\mathsf{HMon}(\omega,\mathcal{P})\) such that \(T(\psi)=h=0\) in \(\mathsf{Gp}(R)\). We have to show that \(\psi=0\). Since \(h=0\) in \(\mathsf{Gp}(R)\), it factors through a projective \(R\)-module \(P_{1}/\omega P_{1}\), for some projective \(S\)-module \(P_{1}\), because \(R\) is the local factor ring \(S/(\omega)\). Hence, one may obtain the following commutative diagram with exact rows; It should be noted that the existence of morphisms \(t\) and \(t^{\prime}\) come from the projectivity of \(Q\) and \(P_{1}\). So, it is routine to check that there is an \(S\)-homomorphism \(s_{0}:Q\to P^{\prime}\) such that \(f^{\prime}s_{0}=\psi_{0}-t^{\prime}t\). Thus, one gets the equality \(\psi_{0}f-f^{\prime}s_{0}f=t^{\prime}tf\). Now setting \(s_{1}:=t^{\prime}s\), we have the equality \(\omega.s_{1}=t^{\prime}tf\). Combining this with the former equality, gives us the equality \(\psi_{0}f-f^{\prime}s_{0}f=\omega.s_{1}\), meaning that \(\psi=(\psi_{1},\psi_{0})\) is null-homotopic, and then, it is zero in \(\mathsf{HMon}(\omega,\mathcal{P})\). Thus the proof is completed. It is known that the category \(\mathsf{Gp}(R)\) is a Frobenius category. So the stable category \(\mathsf{Gp}(R)\) admits a natural structure of a triangulated category with the quasi-inverse of the syzygy functor \(\Omega^{-1}:\mathsf{Gp}(R)\to\mathsf{Gp}(R)\) as suspension. Indeed, cosyzygies with respect to injective objects in the Frobenius category \(\mathsf{Gp}(R)\) is taken; see [17, Chapter I, Section 2] for more details. **Proposition 2.16**.: _With the notation above, \(T\) is a triangle functor._ Proof.: It suffices to show that for any object \(\mathbf{f}=(P\stackrel{{ f}}{{\to}}Q)\in\mathsf{HMon}(\omega, \mathcal{P})\), \(T\,\Sigma(\mathbf{f})=\Omega^{-1}T(\mathbf{f})\). By our definition, \(T\,\Sigma(\mathbf{f})=T(-\mathbf{f}_{\Sigma})=\operatorname{Coker}(-f_{ \Sigma})\), where \(-\mathbf{f}_{\Sigma}=(Q\stackrel{{-f_{\Sigma}}}{{\to}}P)\). Moreover, \(\Omega^{-1}T(\mathbf{f})=\Omega^{-1}(\operatorname{Coker}\!f)\). So we need to examine that \(\Omega^{-1}(\operatorname{Coker}\!f)=\operatorname{Coker}(-f_{\Sigma})\). To do this, consider the following commutative diagram; Now, according to the right column, we have that \(\operatorname{Coker}(-f_{\Sigma})=\Omega^{-1}(\operatorname{Coker}\!f)\), giving the desired result. The singularity category \(\mathsf{D_{sg}}(R)\) is by definition the Verdier quotient of the bounded derived category \(\mathsf{D^{b}}(R)\) of \(R\) by the perfect complexes. This category measures the homological singularity of \(R\) in the sense that \(R\) has finite global dimension if and only if its singularity category is trivial. This notion was introduced by Buchweitz [12] in the 1980s, and studied actively ever since the relation with mirror symmetry was found by Orlov [29]. It is known that the functor \(T^{\prime}:\mathsf{Gp}(R)\longrightarrow\mathsf{D_{sg}}(R)\), sending each object to its stalk complex, is fully faithful; see [10, Theorem 3.1]. By gluing this with Theorem 2.15, we have the result below. **Corollary 2.17**.: _There is a fully faithful functor \(F:\mathsf{HMon}(\omega,\mathcal{P})\longrightarrow\mathsf{D_{sg}}(R)\), sending each object \((P\stackrel{{ f}}{{\to}}Q)\) to \(\operatorname{Coker}\!f\), viewed as a stalk complex._ ## 3. Specifying the Auslander-Reiten translation in \(\mathsf{Mon}(\omega,\mathcal{P})\) This section aims to determine the Auslander-Reiten translation in the category \(\mathsf{Mon}(\omega,\mathcal{P})\). To be precise, assume that the factor ring \(R\) is a complete Gorenstein ring with \(d=\mathsf{dim}R\). It is known that for any non-projective indecomposable Gorenstein projective \(R\)-module \(M\), there is an almost split sequence ending at \(M\) in the category \(\mathsf{Gp}(R)\), provided that \(R\) is an isolated singularity. In particular, the Auslander-Reiten translation is given by \(\tau(-)=\mathsf{Hom}_{R}(\Omega^{d}\mathrm{Tr}_{R}(-),R)\), where \(\mathrm{Tr}_{R}(-)\) stands for the Auslander transpose and \(\Omega^{i}(-)\) is the \(i\)-th syzygy functor defined as usual by taking the kernels of the projective covers consecutively. By using Theorem 2.15, we give an explicit description of the Auslander-Reiten translation in the category \(\mathsf{Mon}(\omega,\mathcal{P})\). Moreover, it is proved that each indecomposable non-projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\) appears as the right term of an almost split sequence in \(\mathsf{Mon}(\omega,\mathcal{P})\), whenever \(R\) is an isolated singularity. We begin by recalling the definition of almost split sequences. **3.1**.: Almost split sequences. Let \(\mathcal{A}\) be an exact category. A morphism \(f:B\to C\) in \(\mathcal{A}\) is said to be right almost split provided it is not a split epimorphism and every morphism \(h:X\to C\) which is not a split epimorphism factors through \(f\). Dually, a morphism \(g:A\to B\) is left almost split, if it is not a split monomorphism and each morphism \(h:A\to C\) which is not a split monomorphism factors through \(g\). A conflation \(\eta:A\xrightarrow{f}B\xrightarrow{g}C\) is called almost split, provided that \(f\) is left almost split and \(g\) is right almost split; see [21]. We remark that, since this sequence is unique up to isomorphism for \(A\) and for \(C\), we may write \(A=\tau_{\mathcal{A}}C\) and \(C=\tau_{\mathcal{A}}^{-1}A\). It is known that if \(\eta:A\xrightarrow{f}B\xrightarrow{g}C\) is an almost split conflation, then \(A\) and \(C\) have local endomorphism ring; see [1, Proposition II.4.4]. In the reminder, we fix the notation \(\tau:=\tau_{\mathsf{Gp}(R)}\). The existence of almost split sequences also known as the Auslander-Reiten sequences is a fundamental and important component in the study of Auslander-Reiten theory, which was introduced by Auslander and Reiten in [4], where they have proved the first existence theorem for the category of finitely generated modules over an artin algebra. This theory rapidly developed in various contexts such as orders over Gorenstein rings [1] and the category of maximal Cohen-Macaulay modules over a Henselian Cohen-Macaulay local ring which admits a canonical module; see [24, 33]. For the terminology and background on almost split morphisms, we refer the reader to [5, 6, 25]. Moreover, the reader may consult [19] for a general setting of the Auslander-Reiten theory. The next result gives the precise determination of the Auslander-Reiten translation of some specific objects in the category of \(\mathsf{Gp}(R)\). **Proposition 3.2**.: _Let \(M\) be an indecomposable non-projective \(R\)-module which has a 2-periodic projective resolution. Then \(\tau(M)=\Omega M\), if \(d=\mathsf{dim}R\) is an odd number, and \(\tau(M)=M\), whenever \(\mathsf{dim}R\) is even._ Proof.: By our assumption, there exists an exact sequence of \(R\)-modules; \(0\to M\to P_{1}\to P_{0}\to M\to 0\) in which \(P_{0},P_{1}\in\mathcal{P}(R)\). Since \(R\) is Gorenstein, every acyclic complex of projectives is totally acyclic and so, the sequence \(0\to M^{*}\to P_{0}^{*}\to P_{1}^{*}\to M^{*}\to 0\) is also exact, where \((-)^{*}=\mathsf{Hom}_{R}(-,R)\); see [20, Corollary 5.5]. So \(\mathrm{Tr}(M)=M^{*}\), and in particular, \(\mathrm{Tr}(M)\) admits a 2-periodic projective resolution, because \(P_{0}^{*},P_{1}^{*}\in\mathcal{P}(R)\). Consequently, for any even integer \(n\), \(\Omega^{n}\mathrm{Tr}(M)=\mathrm{Tr}(M)\), and then \((\Omega^{n}\mathrm{Tr}(M))^{*}=M^{**}=M\). Next assume that \(n\) is odd. So \(\Omega^{n}\mathrm{Tr}(M)=\Omega(\Omega^{n-1}\mathrm{Tr}(M))=\Omega\mathrm{Tr} (M)\). Now considering the short exact sequence of \(R\)-modules; \(0\to(\Omega\mathrm{Tr}(M))^{*}\to P_{0}\to M\to 0\), we infer that \((\Omega\mathrm{Tr}(M))^{*}=\Omega M\). Finally, since \(\tau(M)=(\Omega^{d}\mathrm{Tr}(M))^{*}\), one obtains that \(\tau(M)=M\), whenever \(d\) is even, and \(\tau(M)=\Omega M\), if \(d\) is odd. Thus the proof is finished. **Proposition 3.3**.: _A morphism \(\psi=(\psi_{1},\psi_{0}):(P\xrightarrow{f}Q)\longrightarrow(P^{\prime} \xrightarrow{f^{\prime}}Q^{\prime})\) is null-homotopic if and only if \(\psi\) factors through a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\)._ Proof.: First, we deal with the 'only if' part. Since \(\psi=(\psi_{1},\psi_{0}):(P\xrightarrow{f}Q)\longrightarrow(P^{\prime} \xrightarrow{f^{\prime}}Q^{\prime})\) is a null-homotopic morphism, there are \(S\)-homomorphisms \(s_{0}:Q\to P^{\prime}\) and \(s_{1}:P\to Q^{\prime}\) such that \(f^{\prime}\psi_{1}-f^{\prime}s_{0}f=\omega.s_{1}\). So, one may obtain the following commutative diagram; where \(l=\left[\begin{smallmatrix}-f^{\prime}_{\Sigma}&\stackrel{{\text{\sf id }}}{{\rightarrow}}\\ 0&\stackrel{{\text{\sf id}}}{{\rightarrow}}\end{smallmatrix} \right].\) That is, the morphism \(\psi\) factors through \((Q^{\prime}\oplus P^{\prime})\stackrel{{ l}}{{\rightarrow}}(P^{ \prime}\oplus Q^{\prime})\) which is a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\), because of Lemma 2.10. For the 'if' part, at first we should highlight that, according to Lemma 2.10, each projective object in \(\mathsf{Mon}(\omega,\mathcal{P})\) is equal to direct summands of finite direct sums of an object of the form \((P_{1}\oplus Q_{1}\stackrel{{ l}}{{\rightarrow}}P_{1}\oplus Q_{1})\), where \(P_{1},Q_{1}\in\mathcal{P}(S)\) and \(l=\left[\begin{smallmatrix}\omega&0\\ 0&\stackrel{{\text{\sf id}}}{{\rightarrow}}\end{smallmatrix} \right].\) This fact allows us to assume that the morphism \(\psi=(\psi_{1},\psi_{0}):(P\stackrel{{ f}}{{\rightarrow}}Q) \longrightarrow(P^{\prime}\stackrel{{ f^{\prime}}}{{\rightarrow}} Q^{\prime})\) factors through a projective object \((P_{1}\oplus Q_{1}\stackrel{{\omega\oplus\text{\sf id}}}{{ \rightarrow}}P_{1}\oplus Q_{1})\). Namely, we have the following commutative diagram; such that the composition of morphisms in the left (resp. right) column is \(\psi_{1}\) (resp. \(\psi_{0}\)). Now set \(s_{0}:=[\alpha^{\prime}_{1}\ \beta^{\prime}_{1}][\alpha_{0}\ \beta_{0}]^{t}-f^{\prime}_{\Sigma}\psi_{0}\) and \(s_{1}:=[\alpha^{\prime}_{0}\ \beta^{\prime}_{0}][\alpha_{1}\ \beta_{1}]^{t}\). Hence, using the facts that \(\omega.\alpha_{1}=\alpha_{0}f\), \(\beta_{0}f=\beta_{1}\), \(\omega.\alpha^{\prime}_{0}=f^{\prime}\alpha^{\prime}_{1}\) and \(f^{\prime}\beta^{\prime}_{1}=\beta^{\prime}_{0}\), one deduce that \(f^{\prime}\psi_{1}-f^{\prime}s_{0}f=\omega.s_{1}\), meaning that \(\psi=(\psi_{1},\psi_{0})\) is a null-homotopic morphism. Thus the proof is completed. **Proposition 3.4**.: _The following assertions are satisfied:_ _(1) A given object_ \((P\stackrel{{ f}}{{\rightarrow}}Q)\in\mathsf{Mon}(\omega, \mathcal{P})\) _is indecomposable if and only if_ \((Q\stackrel{{ f_{\Sigma}}}{{\rightarrow}}P)\) _is so._ _(2) Let_ \((P\stackrel{{ f}}{{\rightarrow}}Q)\) _be an indecomposable object of_ \(\mathsf{Mon}(\omega,\mathcal{P})\)_. Then_ \(\mathrm{Coker}f\) _is an indecomposable object of_ \(\mathsf{Gp}(R)\)_._ _(3) Let_ \((P\stackrel{{ f}}{{\rightarrow}}Q)\) _be an object of_ \(\mathsf{Mon}(\omega,\mathcal{P})\) _such that_ \(Q\stackrel{{\pi}}{{\rightarrow}}\mathrm{Coker}f\) _is the projective cover of_ \(\mathrm{Coker}f\) _over_ \(S\)_. If_ \(\mathrm{Coker}f\) _is an indecomposable non-projective_ \(R\)_-module, then_ \((P\stackrel{{ f}}{{\rightarrow}}Q)\) _is an indecomposable non-projective object of_ \(\mathsf{Mon}(\omega,\mathcal{P})\)_._ _(4) If_ \((P\stackrel{{ f}}{{\rightarrow}}Q)\) _is an indecomposable non-projective object of_ \(\mathsf{Mon}(\omega,\mathcal{P})\)_, then_ \(Q\rightarrow\mathrm{Coker}f\) _is the projective cover of_ \(\mathrm{Coker}f\) _over_ \(S\)_._ _(5) If_ \((P\stackrel{{ f}}{{\rightarrow}}Q)\) _is an indecomposable non-projective object of_ \(\mathsf{Mon}(\omega,\mathcal{P})\)_, then it has local endomorphism ring._ Proof.: (1) This comes up directly from the equality \((f_{\Sigma})_{\Sigma}=f\). (2) Assume on the contrary that \(\mathrm{Coker}f\) is decomposable, and so, we may write \(\mathrm{Coker}f=\mathrm{Coker}f\). \(X_{1}\oplus X_{2}\). As \(S\) is a local ring, applying [13, Theorem 5.3.3] gives us the projective covers \(Q_{1}\stackrel{{\pi_{1}}}{{\to}}X_{1}\) and \(Q_{2}\stackrel{{\pi_{2}}}{{\to}}X_{2}\). Thus \(Q_{1}\oplus Q_{2}\stackrel{{\pi_{1}\oplus\pi_{2}}}{{\to}}X_{1} \oplus X_{2}\) will be the projective cover of \(X_{1}\oplus X_{2}\) over \(S\); see [13, Corollary 5.5.2]. Since \(X_{1}\) and \(X_{2}\) have projective dimension at most one over \(S\), we may take a short exact sequence of \(S\)-modules; \(0\to P_{1}\oplus P_{2}\to Q_{1}\oplus Q_{2}\to\mathrm{Coker}f\to 0\) in which \(P_{1},P_{2}\in\mathcal{P}(S)\). In particular, we get the following commutative diagram with exact rows; where \(h\) is a split monomorphism, because \(Q_{1}\oplus Q_{2}\to\mathrm{Coker}f\) is the projective cover, and so, \(Q_{1}\oplus Q_{2}\) will be a direct summand of Q. Thus \(\mathrm{Coker}h=T\) is a projective \(S\)-module, implying that \(g\) is also a split monomorphism, thanks to the fact that \(\mathrm{Coker}g=T\). Hence, \(\mathrm{Coker}(g,h)=(T\stackrel{{ id}}{{\to}}T)\) is a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\). This, particularly means that \((P_{1}\to Q_{1})\) is a non-zero direct summand of the indecomposable object \((P\stackrel{{ f}}{{\to}}Q)\), which is impossible. Consequently, \(\mathrm{Coker}f\) is an indecomposable object of \(\mathsf{Gp}(R)\). (3) Assume to the contrary that \((P\stackrel{{ f}}{{\to}}Q)\) is a decomposable object of \(\mathsf{Mon}(\omega,\mathcal{P})\). Since \(\mathrm{Coker}f\) is indecomposable and \(R\) is complete, \(\mathsf{End}_{R}(\mathrm{Coker}f)\) will be a local ring, and so, the same will be true for \(\underline{\mathsf{End}}_{R}(\mathrm{Coker}f)\). Moreover, in view of Theorem 2.15, we have an isomorphism \(\underline{\mathsf{End}}_{R}(\mathrm{Coker}f)\cong\underline{\mathsf{End}}_{ \mathsf{Mon}}(P\stackrel{{ f}}{{\to}}Q)\), implying that the latter is also a local ring. This, in conjunction with \((P\stackrel{{ f}}{{\to}}Q)\) being decomposable, forces \((P\stackrel{{ f}}{{\to}}Q)\) to have an indecomposable projective direct summand \((Q^{\prime}\to Q^{\prime})\). According to Lemma 2.9, this should be either \((Q^{\prime}\stackrel{{\mathsf{id}}}{{\to}}Q^{\prime})\) or \((Q^{\prime}\stackrel{{\omega}}{{\to}}Q^{\prime})\). If the latter one takes place, then \(Q^{\prime}/\omega Q^{\prime}\) will be a (projective) direct summand of \(\mathrm{Coker}f\), which is impossible. Consequently, we have \((P\stackrel{{ f}}{{\to}}Q)=(Q_{1}\stackrel{{ g}}{{\to}}P_{1})\oplus(Q^{\prime}\stackrel{{ \mathsf{id}}}{{\to}}Q^{\prime})\), and then, by applying Lemma 2.4 we have \((Q\stackrel{{ f_{\Sigma}}}{{\to}}P)=(P_{1}\stackrel{{ g_{\Sigma}}}{{\to}}Q_{1})\oplus(Q^{\prime}\stackrel{{ \omega}}{{\to}}Q^{\prime})\). This contradicts with the fact that \(\mathrm{Coker}f_{\Sigma}=\Omega_{R}(\mathrm{Coker}f)\) is indecomposable, because \(Q\stackrel{{\pi}}{{\to}}\mathrm{Coker}f\) is the projective cover of \(\mathrm{Coker}f\). Thus \((P\stackrel{{ f}}{{\to}}Q)\) will be an indecomposable object of \(\mathsf{Mon}(\omega,\mathcal{P})\), and so, the proof is completed. (4) First one should note that since \((P\stackrel{{ f}}{{\to}}Q)\) is non-projective, \(\mathrm{Coker}f\) will be a non-zero \(R\)-module. As \(S\) is a local ring, one may take an exact sequence of \(S\)-modules; \(0\to P^{\prime}\to Q^{\prime}\to\mathrm{Coker}f\to 0\), where \(P^{\prime},Q^{\prime}\in\mathcal{P}(S)\) and \(Q^{\prime}\to\mathrm{Coker}f\) is the projective cover of \(\mathrm{Coker}f\). So, as we have observed in the proof of the second assertion, \((P^{\prime}\to Q^{\prime})\) is a direct summand of \((P\to Q)\), and then, they will be equal, because \((P\stackrel{{ f}}{{\to}}Q)\) is indecomposable. Thus \(Q\to\mathrm{Coker}f\) is the projective cover of \(\mathrm{Coker}f\), as needed. (5) First it should be noted that for a given object \(\psi=(\psi_{1},\psi_{0})\in\mathsf{End}_{\mathsf{Mon}}(P\stackrel{{ f}}{{\to}}Q)\), one may get the following commutative diagram of \(S\)-modules with exact rows; Since \((P\stackrel{{ f}}{{\to}}Q)\) is indecomposable, the fourth assertion yields that \(Q\to\operatorname{Coker}\!f\) is the projective cover of \(\operatorname{Coker}\!f\), implying that \(\psi=(\psi_{1},\psi_{0})\) is an isomorphism if and only if \(h\) is an isomorphism as \(S\) (and also \(R\))-homomorphism. Now assume that \(\psi,\psi^{\prime}\in\operatorname{\mathsf{End}}_{\mathsf{Mon}}(P\stackrel{{ f}}{{\to}}Q)\) which are not isomorphism, and \(h,h^{\prime}\) are corresponding morphisms in \(\operatorname{\mathsf{End}}_{R}(\operatorname{Coker}\!f)\). As \(\psi\) and \(\psi^{\prime}\) are non-isomorphisms, as already observed, \(h\) and \(h^{\prime}\) are so. According to the second assertion, \(\operatorname{Coker}\!f\) is indecomposable, and so, it has local endomorphism ring, thanks to the completeness of \(R\). Consequently, \(h+h^{\prime}\) is a non-isomorphism, and then, the same will be true for \(\psi+\psi^{\prime}\), meaning that \(\operatorname{\mathsf{End}}_{\mathsf{Mon}}(P\stackrel{{ f}}{{\to}}Q)\) is a local ring. Hence the proof is finished. The next elementary result is needed for the subsequent theorem. **Lemma 3.5**.: _Let \(\mathcal{A}\) be an additive category with projective objects and let \(g:M\to M^{\prime\prime}\) be an epimorphism in \(\mathcal{A}\). If there is a morphism \(f:M^{\prime\prime}\to M\) such that \(\mathsf{id}_{M^{\prime\prime}}-gf\) factors through a projective object in \(\mathcal{A}\), then \(g\) is a split epimorphism._ Proof.: By our hypothesis, there are morphisms \(M^{\prime\prime}\stackrel{{ h_{1}}}{{\to}}P\stackrel{{ h_{2}}}{{\to}}M^{\prime\prime}\) with \(P\) projective in \(\mathcal{A}\), such that \(\mathsf{id}_{M^{\prime\prime}}-gf=h_{2}h_{1}\). Take a morphism \(u:P\to M\) in which \(gu=h_{2}\). Set \(\psi:=uh_{1}+f\). So one may have the equalities; \(g\psi=g(uh_{1}+f)=guh_{1}+gf=h_{2}h_{1}+gf=\mathsf{id}_{M^{\prime\prime}}\). This indeed means that \(g\) is a split epimorphism. So the proof is finished. **Theorem 3.6**.: _Let \((P\stackrel{{ f}}{{\to}}Q)\) be an indecomposable non-projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\) and set \(M=\operatorname{Coker}\!f\). Then there is an almost split sequence ending at \((P\stackrel{{ f}}{{\to}}Q)\) in \(\mathsf{Mon}(\omega,\mathcal{P})\) if and only if there is an almost split sequence ending at \(M\) in \(\mathsf{Gp}(R)\). In particular, \(\tau_{\mathsf{Mon}}((P\stackrel{{ f}}{{\to}}Q))=(P\stackrel{{ f}}{{\to}}Q)\), if \(\mathsf{dim}R\) is even, and \(\tau_{\mathsf{Mon}}((P\stackrel{{ f}}{{\to}}Q))=(Q\stackrel{{ f_{\mathsf{Y}}}}{{\to}}P)\), if \(\mathsf{dim}R\) is odd._ Proof.: First one should note that, as declared in Remark 2.14, \(M\) is a Gorenstein projective \(R\)-module which has a \(2\)-periodic projective resolution. Assume that there is an almost split sequence; \(0\to\tau(M)\to X\to M\to 0\) in \(\mathsf{Gp}(R)\). We would like to show that there is an almost split sequence in \(\mathsf{Mon}(\omega,\mathcal{P})\) ending at \((P\stackrel{{ f}}{{\to}}Q)\). In the route to this goal, we consider two cases; Case 1: Suppose that \(\mathsf{dim}R\) is odd. Since by Remark 2.14, \(M\) is a Gorenstein projective \(R\)-module having a \(2\)-periodic projective resolution, applying Proposition 3.2 yields that \(\tau(M)=\Omega M\). As \(M\) corresponds to \((P\stackrel{{ f}}{{\to}}Q)\), considering Remark 2.14, \(\Omega M\) will correspond to the object \((Q\stackrel{{ f_{\mathsf{X}}}}{{\to}}P)\) in \(\mathsf{HM}(\omega,\mathcal{P})\). Thus, one may get the following commutative diagram with exact rows and columns; where \(\beta:Q\to X\) is a morphism such that \(f_{2}\beta=\varphi_{0}\). It should be remarked that \((Q\oplus P\to P\oplus Q)\) lies in \(\mathsf{Mon}(\omega,\mathcal{P})\), because \(X\) is an \(R\)-module. In particular, we obtain the short exact sequence, \(\eta:0\longrightarrow(Q\xrightarrow{f_{2}}P)\xrightarrow{\theta}(Q\oplus P \xrightarrow{q}P\oplus Q)\xrightarrow{g}(P\xrightarrow{f}Q)\longrightarrow 0\) in \(\mathsf{Mon}(\omega,\mathcal{P})\). Here \(g=(g_{1},g_{0})\) with \(g_{0}=[0\ \mathsf{id}_{Q}]\) and \(g_{1}=[0\ \mathsf{id}_{P}]\). We claim that this is indeed an almost split sequence in \(\mathsf{Mon}(\omega,\mathcal{P})\). First, we show that \(\eta\) is non-split. Assume on the contrary that \(\eta\) is a split sequence. Hence, there is a morphism \(\psi=(\psi_{1},\psi_{2}):(P\xrightarrow{f}Q)\longrightarrow(Q\oplus P \xrightarrow{q}P\oplus Q)\) such that \(g\psi=\mathsf{id}_{(P\xrightarrow{f}Q)}\). Since by Theorem 2.15, the functor \(T:\mathsf{HMon}(\omega,\mathcal{P})\longrightarrow\mathsf{Gp}(R)\) is fully faithful, one may find a morphism \(h:M\to X\) in \(\mathsf{Gp}(R)\) such that \(T(\psi)=h\). Consequently, \(f_{2}h=T(g)T(\psi)=T(g\psi)=\mathsf{id}_{T(P\to Q)}=\mathsf{id}_{M}\) in \(\underline{\mathsf{Gp}}(R)\), and so, \(f_{2}h-\mathsf{id}_{M}\) factors through a projective \(R\)-module. Now Lemma 3.5 forces \(f_{2}\) to be a split epimorphism in \(\mathsf{Gp}(R)\), which is a contradiction, and then, \(\eta\) is non-split. Next assume that \(\gamma=(\gamma_{1},\gamma_{0}):(P^{\prime}\xrightarrow{f^{\prime}}Q^{\prime} )\longrightarrow(P\xrightarrow{f}Q)\) is a non-split epimorphism in \(\mathsf{Mon}(\omega,\mathcal{P})\). We have to show that \(\gamma\) factors through \(g\). By our hypothesis, there is a commutative diagram of \(S\)-modules with exact rows; A similar argument has been appeared above, reveals that \(e\) is a non-split epimorphism. Now since \(0\to\tau(M)\xrightarrow{f_{1}}X\xrightarrow{f_{2}}M\to 0\) is an almost split sequence, we will have an \(R\)-homomorphism \(k_{1}:\operatorname{Coker}f^{\prime}\to X\) in which \(f_{2}k_{1}=e\). Hence, another use of the fact that the functor \(T\) is full, gives us a morphism \(\alpha=(\alpha_{1},\alpha_{0}):(P^{\prime}\xrightarrow{f^{\prime}}Q^{\prime} )\longrightarrow(Q\oplus P\to P\oplus Q)\) with \(T(\alpha)=k_{1}\). Now the faithfulness of \(T\) enables us to deduce that \(g\alpha=\gamma\) in \(\mathsf{HMon}(\omega,\mathcal{P})\), and so by Proposition 3.3, \(g\alpha-\gamma\) factors through a projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\). Therefore, applying Lemma 3.5, gives us a morphism \(\psi=(\psi_{1},\psi_{0}):(P^{\prime}\xrightarrow{f^{\prime}}Q^{\prime}) \longrightarrow(Q\oplus P\to P\oplus Q)\) in which \(g\psi=\gamma\). Consequently, \(g\) is a right almost split morphism. Moreover, thanks to the existence of an almost split sequence ending at \(M\), one infers that \(M\) is indecomposable, and so, applying Proposition 3.4 yields that \((Q\xrightarrow{f_{1}}P)\) has local endomorphism ring. Thus, \(\eta\) is an almost split sequence. Case 2: \(\mathsf{dim}R\) is even. So, in view of Proposition 3.2\(\tau(M)=M\). Now one may follow the argument that appeared in Case 1 and conclude that there is an almost split sequence in \(\mathsf{Mon}(\omega,\mathcal{P})\), ending at \((P\stackrel{{ f}}{{\rightarrow}}Q)\), and in particular, \(\tau_{\mathsf{Mon}}(P\stackrel{{ f}}{{\rightarrow}}Q)=(P \stackrel{{ f}}{{\rightarrow}}Q)\). Conversely, assume that there is an almost split sequence in \(\mathsf{Mon}(\omega,\mathcal{P})\) terminating in \((P\stackrel{{ f}}{{\rightarrow}}Q)\). So, the above method gives rise to the existence of an almost split sequence ending at \(M\). Thus the proof is completed. Recall that \(R\) is called an isolated singularity, if \(R_{\mathfrak{p}}\) is a regular local ring, for all non-maximal prime ideals \(\mathfrak{p}\) of \(R\). Moreover, an \(R\)-module \(M\) is said to be locally projective on the punctured spectrum of \(R\), provided that \(M_{\mathfrak{p}}\) is a projective \(R_{\mathfrak{p}}\)-module, for all non-maximal prime ideals \(\mathfrak{p}\) of \(R\). Assume that \(M\) is an indecomposable non-projective object of \(\mathsf{Gp}(R)\) which is locally projective on the punctured spectrum of \(R\). So, in view of the main result of [3] (see also [24, Theorem 13.8]), there is an almost split sequence ending at \(M\) in \(\mathsf{Gp}(R)\). Particularly, if \(R\) is an isolated singularity, then any non-projective indecomposable Gorenstein projective \(R\)-module appears as the right term of an almost split sequence in \(\mathsf{Gp}(R)\); see also [24, Corollary 13.9]. This fact together with Theorem 3.6, enables us to quote the following results. **Corollary 3.7**.: _Let \((P\stackrel{{ f}}{{\rightarrow}}Q)\) be an object of \(\mathsf{Mon}(\omega,\mathcal{P})\) such that \(\mathrm{Coker}f\) is an indecomposable non-projective object of \(\mathsf{Gp}(R)\) which is locally projective on the punctured spectrum of \(R\). Then \(\tau_{\mathsf{Mon}}((P\stackrel{{ f}}{{\rightarrow}}Q))=(P \stackrel{{ f}}{{\rightarrow}}Q)\), if \(\mathsf{dim}R\) is even, and \(\tau_{\mathsf{Mon}}((P\stackrel{{ f}}{{\rightarrow}}Q))=(Q \stackrel{{ f_{\mathsf{X}}}}{{\rightarrow}}P)\), otherwise. In particular, \(\tau_{\mathsf{Mon}}^{2}(f)=f\)._ **Corollary 3.8**.: _Let \(R\) be an isolated singularity. Then each indecomposable non-projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\) appears as the right term of an almost split sequence._ Proof.: Assume that \((P\stackrel{{ f}}{{\rightarrow}}Q)\) is a non-projective indecomposable object of \(\mathsf{Mon}(\omega,\mathcal{P})\). So by Propositon 3.4(2), \(\mathrm{Coker}f\) is an indecomposable object of \(\mathsf{Gp}(R)\). Moreover, as \((P\stackrel{{ f}}{{\rightarrow}}Q)\) is non-projective, it is easily verified that the same is true for \(\mathrm{Coker}f\). Now, since \(R\) is an isolated singularity, as already declared above, by the main result of [3] (also [24, Corollary 13.9]), there is an almost split sequence ending at \(M\). Consequently, in view of Theorem 3.6, there is an almost split sequence ending at \((P\stackrel{{ f}}{{\rightarrow}}Q)\). So we are done. **Example 3.9**.: Assume that \(\mathsf{dim}S=1\). So \(\mathsf{dim}R=0\), meaning that \(R\) is artinian. Since \(R\) is self-injective, the categories \(\mathsf{mod}R\) and \(\mathsf{Gp}(R)\) are the same. In this case, it is known that \(\mathsf{Gp}(R)\) admits almost split sequences; see [4]. Consequently, by Corollary 3.8 each indecomposable non-projective object of \(\mathsf{Mon}(\omega,\mathcal{P})\) appears as the right term of an almost split sequence. Particularly, for a given non-projective indecomposable object \((P\stackrel{{ f}}{{\rightarrow}}Q)\in\mathsf{Mon}(\omega, \mathcal{P})\), we have \(\tau_{\mathsf{Mon}}(f)=f\).

2304.12317

Total-Recon: Deformable Scene Reconstruction for Embodied View Synthesis

We explore the task of embodied view synthesis from monocular videos of deformable scenes. Given a minute-long RGBD video of people interacting with their pets, we render the scene from novel camera trajectories derived from the in-scene motion of actors: (1) egocentric cameras that simulate the point of view of a target actor and (2) 3rd-person cameras that follow the actor. Building such a system requires reconstructing the root-body and articulated motion of every actor, as well as a scene representation that supports free-viewpoint synthesis. Longer videos are more likely to capture the scene from diverse viewpoints (which helps reconstruction) but are also more likely to contain larger motions (which complicates reconstruction). To address these challenges, we present Total-Recon, the first method to photorealistically reconstruct deformable scenes from long monocular RGBD videos. Crucially, to scale to long videos, our method hierarchically decomposes the scene into the background and objects, whose motion is decomposed into carefully initialized root-body motion and local articulations. To quantify such "in-the-wild" reconstruction and view synthesis, we collect ground-truth data from a specialized stereo RGBD capture rig for 11 challenging videos, significantly outperforming prior methods. Our code, model, and data can be found at https://andrewsonga.github.io/totalrecon .

Chonghyuk Song, Gengshan Yang, Kangle Deng, Jun-Yan Zhu, Deva Ramanan

2023-04-24T17:59:52Z

http://arxiv.org/abs/2304.12317v2

# Total-Recon: Deformable Scene Reconstruction for Embodied View Synthesis ###### Abstract We explore the task of embodied view synthesis from monocular videos of deformable scenes. Given a minute-long RGBD video of people interacting with their pets, we render the scene from novel camera trajectories derived from in-scene motion of actors: (1) egocentric cameras that simulate the point of view of a target actor and (2) 3rd-person cameras that follow the actor. Building such a system requires reconstructing the root-body and articulated motion of each actor in the scene, as well as a scene representation that supports free-viewpoint synthesis. Longer videos are more likely to capture the scene from diverse viewpoints (which helps reconstruction) but are also more likely to contain larger motions (which complicates reconstruction). To address these challenges, we present Total-Recon, the first method to photorealistically reconstruct deformable scenes from long monocular RGBD videos. Crucially, to scale to long videos, our method hierarchically decomposes the scene motion into the motion of each object, which itself is decomposed into global root-body motion and local articulations. To quantify such "in-the-wild" reconstruction and view synthesis, we collect ground-truth data from a specialized stereo RGBD capture rig for 11 challenging videos, significantly outperforming prior art. Code, videos, and data can be found here. ## 1 Introduction We explore _embodied view synthesis_, a new class of novel-view synthesis tasks that renders deformable scenes from novel 6-DOF trajectories reconstructed from _in_-scene motion of actors: egocentric cameras [39, 6] that simulate the point-of-view of moving actors and 3rd-person-follow cameras [47, 6] that track a moving actor from behind (Figure 1). We focus on everyday scenes of people interacting with their pets, producing renderings from the point-of-view of the person _and pet_ (Figure 1). While such camera trajectories could be manually constructed (e.g., by artists via keyframing), building an _automated_ system is an interesting problem of its own: spatial cognition theory [49] suggests that the ability to visualize behavior from another actor's perspective is necessary for action learning and imitation; in the context of gaming and virtual reality [6, 39], egocentric cameras offer high levels of user immersion, while 3rd-person-follow cameras provide a large field of view that is useful for exploring a user's environment. Challenges.Building a system for embodied view synthesis is challenging for many reasons. First, to reconstruct everyday-but-interesting content, it needs to process long, monocular captures of multiple interacting actors. However, such videos are likely to contain large scene motions, which we demonstrate are difficult to reconstruct with current approaches. Second, it needs to produce a deformable 3D scene representation that supports free-viewpoint synthesis, which also would benefit from long videos that are likely to capture the scene from diverse viewpoints. Recent approaches have extended Neural Radiance Fields (NeRFs) [23] to deformable scenes, but such work is often limited to rigid-only object motion [14; 28], short videos with limited scene motion [35; 30; 17; 48; 31; 52; 8; 53; 50], or reconstructing single objects as opposed the entire scene [57; 58; 59; 4]. Third, it needs to compute global 6-DOF trajectories of root-bodies and articulated body parts (e.g., head) of multiple actors. Key Ideas.To address these challenges, we introduce Total-Recon, the first monocular NeRF that enables embodied view synthesis for deformable scenes with large motions. Given a monocular RGBD video, Total-Recon reconstructs the scene as a composition of object-centric representations, which encode the 3D appearance, geometry, and motion of each deformable object and the background. Crucially, Total-Recon hierarchically decomposes the motion of the scene into the motion of individual objects, which itself is decomposed into global root-body movement and the local deformation of articulated body parts. We demonstrate that this crucial design choice allows reconstruction to scale to longer videos, enabling free-viewpoint synthesis. By reconstructing such motions in a globally-consistent coordinate frame, Total-Recon can generate renderings from egocentric and 3rd-person-follow cameras, as well as static but extreme viewpoints like bird's-eye-views. Evaluation.Due to the difficulty of collecting ground-truth data for embodied view synthesis on in-the-wild videos, we evaluate our method on the proxy task of stereo-view synthesis [30], which compares rendered views to those captured from a stereo pair. To this end, we build a stereo RGBD sensor capture rig for ground-truthing and collect a dataset of 11 long video sequences in various indoor environments, including people interacting with their pets. Total-Recon outperforms the state-of-the-art monocular deformable NeRF methods [31; 52], even when modified to use depth sensor measurements. Contributions.In summary, our contributions are: (1) Total-Recon, a hierarchical 3D representation that models deformable scenes as a composition of object-centric representations, each of which decomposes object motion into its global root-body motion and its local articulations; (2) a system based on Total-Recon for automated embodied view synthesis from casual, minute-long RGBD videos of highly dynamic scenes; (3) a dataset of stereo RGBD videos containing various deformable objects, such as humans and pets, in a host of different background environments. Figure 2: **Method Overview. Total-Recon represents the entire scene as a composition of \(M\) object-centric neural fields, one for the rigid background and for each of the \(M-1\) deformable objects. To render a scene, (1) _each object field_\(j\) is transformed into the camera space with a rigid transformation \(\left(\mathbf{G}_{j}^{t}\right)^{-1}\) that encodes root-body motion and, for each deformable object, an additional deformation field \(\mathbf{J}_{j}^{t,\rightarrow}\) that encodes articulated motion. Next, all (2) _posed object fields_ are combined into a (3) _composite field_, which is then volume-rendered into (4) _color, depth, optical flow, and object silhouettes_. Each rendered output defines a reconstruction loss that derives supervision from a monocular RGBD video captured by a moving iPad Pro. ## 2 Related Work Neural Radiance Fields.Prior works on Neural Radiance Fields (NeRF) optimize a continuous scene function for novel view synthesis given a set of multi-view images, usually under the assumption of a rigid scene and densely sampled views [23, 21, 22, 18, 10, 51]. DS-NeRF [5] and Dense Depth Priors [38] extend NeRFs to the sparse-view setting by introducing depth as additional supervision. Total-Recon also operates in the sparse-view regime and uses depth supervision to reduce the ambiguities inherent to monocular, multibody, non-rigid reconstruction [54, 29]. Another line of work [14, 28] represents rigidly moving scenes as a composition of multiple object-level NeRFs. Total-Recon also leverages such an object-centric scene representation, but models scenes containing _non-rigidly_ moving objects, such as humans and pets. Deformable NeRFs.Recent approaches extend NeRF to monocular deformable scene reconstruction either by learning an additional function that deforms observed points in the camera space to a time-independent canonical space [35, 30, 48, 31, 52] or explicitly modeling density changes over time [8, 53, 50, 17]. Such methods are typically limited to short videos containing little scene and camera motion. They also perform novel-view synthesis only over small baselines. Total-Recon belongs to the former category of prior monocular deformable NeRFs, but unlike them, our method hierarchically decomposes scene motion into the motion of each object, which itself is further decomposed into global root-body motion and local articulations. The proposed motion decomposition is what enables embodied view synthesis: it allows Total-Recon to scale to _minute-long_ videos and reconstruct a deformable 3D scene representation that supports free-viewpoint synthesis; it also makes it easy to extract an object's root-body motion, the key motion primitive required for 3rd-person-follow view synthesis. Several works have taken different approaches to making non-rigid reconstruction more tractable. One group of work leverages human-specific priors [33, 46, 27, 34, 19, 12, 15, 32] such as human body models (e.g., SMPL), 3D skeletons, or 2D poses to achieve high reconstruction quality. We achieve similar levels of fidelity _without_ relying on such shape priors, allowing Total-Recon to generalize to pets and, by extension, reconstruct human-pet interaction videos. Another body of work [11, 41, 16] achieves high-fidelity scene reconstructions by relying on synchronized multi-view video captured from a specialized camera rig ranging from 8 to 18 static cameras. In contrast, Total-Recon only requires a single video captured from a moving RGBD camera equipped with inertial sensors, which has now become widely accessible in consumer products with the advent of Apple's iPhone and iPad Pro. Reconstruction with RGBD Sensors.Depth sensors represent the third class of attempts to make non-rigid reconstruction more tractable, reducing the need for a predefined shape template. Kinect-fusion [25] creates a real-time system for indoor scene localization and mapping. Dynamic Fusion [24] builds a template-free dense SLAM system for dynamic objects. Later works improve RGBD reconstruction to be able to deal with topology changes [43, 44] and use correspondence matching for registration over large motions [2, 3]. Recent works have incorporated neural implicit representations to reconstruct the surface geometry and 3D motion fields for deformable objects [37, 4] or large-scale rigid scenes [1, 36] in isolation. Other works have reconstructed humans alongside small-scale objects and furniture [7, 2], but not the entire background. We aim to go even further by reconstructing the entire scene, which includes the background and multiple deformable targets such as humans and pets; not only do we reconstruct the geometry, but we also recover a radiance field that allows for photorealistic scene rendering from embodied viewpoints and other novel 6-DOF trajectories. We summarize and compare prior work to Total-Recon in terms of the system requirements for embodied view synthesis in Table 1. Concurrent Work.Concurrent work exhibits a subset of the design choices necessary for embodied view synthesis. SLAHMR [61] reconstructs the geometry and in-scene motion of human actors but does not reconstruct scene appearance. Nerflets [63] reconstructs a compositional dynamic scene representation that models each object as a group of posed local NeRFs but is limited to scenes with rigid moving objects. RoDynRF [20] and NeRF-DS [55] reconstructs scenes containing a variety of dynamic objects (including deformable or specular objects), but both methods are limited to short videos and do not learn the object-centric representations required for embodied view synthesis. \begin{table} \begin{tabular}{c||c|c|c|c|c} \hline \multirow{2}{*}{Method} & Entire & Deform. & Beyond & Global & Long \\ & Scenes & Objects & Humans & Traj. & Videos \\ \hline BANMo [59] & ✗ & ✓ & ✓ & ✗ & ✓ \\ PNF [14] & ✓ & ✗ & ✓ & ✓ & ✗ \\ NeuMan [12] & ✓ & ✓ & ✗ & ✓ & ✗ \\ SLAHMR [61] & ✗ & ✓ & ✗ & ✓ & ✗ \\ HyperNeRF [31] & ✓ & ✓ & ✓ & ✗ & ✗ \\ D\({}^{2}\)NeRF [52] & ✓ & ✓ & ✓ & ✗ & ✗ \\ \hline Ours & ✓ & ✓ & ✓ & ✓ & ✓ \\ \hline \end{tabular} \end{table} Table 1: **Comparison to Related Work.** Unlike prior work, Total-Recon exhibits all of the properties required for embodied view synthesis of scenes containing humans and pets: the ability to (1) reconstruct _entire scenes_, (2) model _deformable objects_, (3) extend _beyond humans_, (4) recover _global trajectories_ of objects’ root-bodies and articulated body parts, and (5) process _minute-long videos_ of dynamic scenes. ## 3 Method ### Limitations of Prior Art The state-of-the-art monocular deformable NeRFs [31, 52] decompose a deformable scene into a rigid, canonical template model and a deformation field \(\mathbf{J}^{t,\leftarrow}\) that maps the world space \(\mathbf{G}_{0}^{t}\mathbf{X}^{t}\) to the canonical space \(\mathbf{X}^{*}\), where \(\mathbf{G}_{0}^{t}\) is the _known_ camera pose at time \(t\), and \(\mathbf{X}^{t}\) is a camera space point at time \(t\): \[\mathbf{X}^{*}=\mathcal{W}^{t,\leftarrow}\left(\mathbf{X}^{t}\right)=\mathbf{ J}^{t,\leftarrow}(\mathbf{G}_{0}^{t}\mathbf{X}^{t}). \tag{1}\] In theory, this formulation is sufficient to represent all continuous motion; it performs well on short videos containing near-rigid scenes, as the deformation field only has to learn minute deviations from the template model. However, this motion model is difficult to scale to minute-long videos, which are more likely to contain deformable objects undergoing large translations (e.g., a person walking into another room) and pose changes (e.g., a person sitting down). Here, the deformation field must learn large deviations from the canonical model, significantly complicating optimization. Another critical limitation of HyperNeRF and D\({}^{2}\)NeRF is that they cannot track separate deformable objects and therefore cannot perform 3rd-person-follow view synthesis for scenes with _multiple_ actors. ### Component Radiance Fields To address the limitations of existing monocular deformable NeRFs, we propose Total-Recon, a novel 3D representation that models a deformable scene as a composition of \(M\) object-centric neural fields, one for the rigid background and for each of the \(M-1\) deformable objects (Figure 2). Crucially, Total-Recon hierarchically decomposes the scene motion into the motion of each object, which itself is decomposed into global root-body motion and local articulations. This key design choice scales our method to minute-long videos containing highly dynamic and deformable objects. Background Radiance Field.We begin by modeling the background environment as a Neural Radiance Field (NeRF) [23]. For a 3D point \(\mathbf{X}^{*}\in\mathbb{R}^{3}\) and a viewing direction \(\mathbf{v}^{*}\) in the canonical world space, NeRF defines a color \(\mathbf{c}\) and density \(\sigma\) represented by an MLP. We follow contemporary variants [21] that include a time-specific embedding code \(\omega_{e}^{t}\) to model illumination changes over time and model density with as a function of a neural signed distance function (SDF) \(\mathbf{MLP}_{\sigma}(\cdot)=\alpha\Gamma_{\beta}(\mathbf{MLP}_{\text{SDF}}( \cdot))\)[60] to encourage the reconstruction of a valid surface: \[\sigma=\mathbf{MLP}_{\sigma}(\mathbf{X}^{*}),\qquad\mathbf{c}^{t}=\mathbf{ MLP}_{\mathbf{c}}(\mathbf{X}^{*},\mathbf{v}^{*},\omega_{e}^{t}). \tag{2}\] The pixel color can then be computed with differentiable volume rendering equations (Section 3.3). Most NeRF methods, including HyperNeRF [31] and D\({}^{2}\)NeRF [52], assume images with known cameras. While our capture devices are equipped with inertial sensors, we find their self-reported camera poses have room for improvement. As such, we also model camera pose as an _optimizable_ rigid-body transformation \(\mathbf{G}_{0}^{t}\in SE(3)\) that maps points in a time-specific camera space \(\mathbf{X}^{t}\in\mathbb{R}^{3}\) to the world space (where we assume homogenous notation): \[\mathbf{X}^{*}=\mathbf{G}_{0}^{t}\mathbf{X}^{t}. \tag{3}\] Deformable Field (for Object \(j\)).We model the deformable radiance field of object \(j\in\{1,\cdots,M-1\}\) with BANMo [59], which consists of a canonical rest shape and time-_dependent_ deformation field. The canonical rest shape is represented by the same formulation described by Equation 2, but now defined in a local _object-centric canonical space_ rather than the world space. BANMo represents object motion with a warping function \(\mathcal{W}_{j}^{t,\leftarrow}:\mathbf{X}^{t}\rightarrow\mathbf{X}_{j}^{*}\) that maps the camera space points \(\mathbf{X}^{t}\) to canonical space points \(\mathbf{X}_{j}^{*}\) with a rigid-body transformation \(\mathbf{G}_{j}^{t}\in SE(3)\) and a deformation field \(\mathbf{J}_{j}^{t,\leftarrow}\) modeled by linear blend skinning [9]: \[\mathbf{X}_{j}^{*}=\mathcal{W}_{j}^{t,\leftarrow}\left(\mathbf{X}^{t}\right)= \mathbf{J}_{j}^{t,\leftarrow}(\mathbf{G}_{j}^{t}\mathbf{X}^{t}). \tag{4}\] Note that our choice of deformation field differs from the \(SE(3)\)-field used in HyperNeRF and D\({}^{2}\)NeRF, which has been shown to produce irregular deformation in the presence of complex scene motion [59]. Intuitively, rigid-body transformation \(\mathbf{G}_{j}^{t}\) captures the global root-body pose of object \(j\) relative to the camera at time \(t\), while deformation field \(\mathbf{J}_{j}^{t,\leftarrow}\) aligns more fine-grained articulations relative to its local canonical space (Figure 2). Explicitly disentangling these two sources of object motion (as opposed to conflating them) enables easier optimization of the deformation field, because local articulations are significantly easier to learn than those modeled relative to the world space (Equation 1). Furthermore, this motion decomposition makes the deformation field invariant to rigid-body transformations of the object. A motion model similar to ours was proposed by ST-NeRF [11], but their model encodes an object's global root-body motion with a 3D axis-aligned bounding box that does not explicitly represent object orientation, a prerequisite for embodied view synthesis from 3rd-person-follow cameras. As did BANMo, Total-Recon also models a forward warp \(\mathbf{X}_{j}^{t}=\mathcal{W}_{j}^{t,\rightarrow}\left(\mathbf{X}^{*}\right)= \mathbf{J}_{j}^{t,\rightarrow}\left(\mathbf{G}_{j}^{t}\right)^{-1}\mathbf{X}^{*}\) that maps the canonical space to the camera space, which is used to establish the surface correspondences required for egocentric view synthesis and 3D video filters. ### Composite Rendering of Multiple Objects Given a set of \(M\) object representations (the background is treated as an object as well), we use the composite rendering scheme from prior work [26, 45] to combine the outputs of all object representations and volume-render the entire scene. To volumetrically render the image at frame \(t\), we sample multiple points along each camera ray \(\mathbf{v}^{t}\). Denoting the \(i^{th}\) sample as \(\mathbf{X}_{i}^{t}\), we write the density and color observed at sample \(i\) due to object \(j\) as: \[\sigma_{ij}=\mathbf{MLP}_{\sigma,j}\left(\mathbf{X}_{ij}^{*}\right),\qquad \mathbf{c}_{ij}=\mathbf{MLP}_{\mathbf{c},j}\left(\mathbf{X}_{ij}^{*},\mathbf{ v}_{j}^{*},\omega_{e}^{t}\right),\] where \(\mathbf{X}_{ij}^{*}=\mathcal{W}_{j}^{t,\leftarrow}\left(\mathbf{X}_{i}^{t}\right)\) and \(\mathbf{v}_{j}^{*}=\mathcal{W}_{j}^{t,\leftarrow}(\mathbf{v}^{t})\) are sample \(i\) and camera ray \(\mathbf{v}^{t}\) backward-warped into object \(j\)'s canonical space, respectively. The composite density \(\sigma_{i}\) at sample \(i\) along the ray is then computed as the sum of each object's density \(\sigma_{ij}\); the composite color \(\mathbf{c}_{i}\) is computed as the weighted sum of each object's color \(\mathbf{c}_{ij}\), where the weights are the normalized object densities \(\sigma_{ij}/\sigma_{i}\): \[\sigma_{i}=\sum_{j=0}^{M-1}\sigma_{ij},\quad\mathbf{c}_{i}=\frac{1}{\sigma_{i }}\sum_{j=0}^{M-1}\sigma_{ij}\mathbf{c}_{ij}. \tag{5}\] We can then use the standard volume rendering equations to generate an RGB image of the scene, where \(N\) is the number of sampled points along camera ray \(\mathbf{v}^{t}\), \(\tau_{i}\) is the transmittance, \(\alpha_{i}\) is the alpha value for sample point \(i\) and \(\delta_{i}\) is the distance between sample point \(i\) and the \((i+1)\): \[\mathbf{\hat{c}}=\sum_{i=1}^{N}\tau_{i}\alpha_{i}\mathbf{c}_{i},\quad\tau_{i}= \prod_{k=1}^{i-1}(1-\alpha_{k}),\quad\alpha_{i}=1-e^{-\sigma_{i}\delta_{i}}.\] Rendering Flow, Depth, and Silhouettes.Our composite rendering scheme can be used to render different quantities by replacing the object color \(\mathbf{c}_{ij}\) in Equation 5 with the appropriately defined 3D _feature_\(\mathbf{f}_{ij}\) (Table 2) and rendering the resulting composite feature \(\mathbf{f}_{i}\). To render occlusion-aware object silhouettes, we follow ObSURF [45] to produce a categorical distribution over the \(M\) objects: \[\hat{\mathbf{o}}_{j} =\sum_{i=1}^{N}\tau_{i}\alpha_{ij},\quad\text{where}\quad\tau_{i} =\prod_{k=1}^{i-1}(1-\alpha_{k}), \tag{6}\] \[\alpha_{i} =1-e^{-\sigma_{i}\delta_{i}},\qquad\alpha_{ij}=1-e^{-\sigma_{ij} \delta_{i}}. \tag{7}\] Optimization.Given a monocular RGBD video, we optimize all parameters in our composite scene representation, which for each of the \(M\) objects includes the appearance and shape MLPs (\(\mathbf{MLP}_{c,j}\), \(\mathbf{MLP}_{\sigma,j}\)), rigid-body transformations \(\mathbf{G}_{j}^{t}\), and forward, backward deformation fields \(\mathbf{J}_{j}^{+}\), \(\mathbf{J}_{j}^{\dashrightarrow}\). The model is learned by optimizing three reconstruction losses: a color loss \(\mathcal{L}_{\text{rgb}}\), a flow loss \(\mathcal{L}_{\text{flow}}\), and crucially, a depth loss \(\mathcal{L}_{\text{depth}}\), where the ground truth color \(\mathbf{c}\) and depth \(\mathbf{d}\) are provided by the RGBD video, and the "ground truth" flow \(\mathcal{F}\) is computed by an off-the-shelf flow network [56]. The model also optimizes a 3D-cycle consistency loss \(\mathcal{L}_{\text{cyc},j}\)[59] for each deformable object to encourage their forward and backward warps to be consistent: \[\mathcal{L}_{\text{rgb}} =\sum_{\mathbf{x}^{t}}||\mathbf{c}(\mathbf{x}^{t})-\hat{\mathbf{c} }(\mathbf{x}^{t})||^{2}, \tag{8}\] \[\mathcal{L}_{\text{flow}} =\sum_{\mathbf{x}^{t}}||\mathcal{F}(\mathbf{x}^{t})-\hat{\mathcal{ F}}(\mathbf{x}^{t})||^{2},\] (9) \[\mathcal{L}_{\text{depth}} =\sum_{\mathbf{x}^{t}}||\mathbf{d}(\mathbf{x}^{t})-\hat{\mathbf{d} }(\mathbf{x}^{t})||^{2},\] (10) \[\mathcal{L}_{\text{cyc},j} =\sum_{i}\tau_{i}\alpha_{ij}\left\|\mathcal{W}_{j}^{t^{\prime}, \ \rightarrow}\left(\mathcal{W}_{j}^{t,\ \leftarrow}(\mathbf{X}_{i}^{t})\right)-\mathbf{X}_{i}^{t}\right\|^{2}, \tag{11}\] where \(\mathbf{x}^{t}\in\mathbb{R}^{2}\) is a pixel location at time \(t\). Embodied View Synthesis and 3D Filters.To enable embodied view synthesis and 3D video filters from Total-Recon's scene reconstruction, we design a simple interface that allows a user to select a point on a target object's surface in its reconstructed canonical mesh, and use its forward warping function \(\mathcal{W}_{j}^{t,\rightarrow}:\mathbf{X}^{*}\rightarrow\mathbf{X}^{t}\) followed by the rigid-body transformation \(\mathbf{G}_{0}^{t}\) to place the egocentric camera (or virtual 3D asset) in the world space. The surface normal to the object's mesh at the user-defined point provides a reference frame to align the egocentric camera's viewing direction and place the 3D asset. To implement a 3rd-person-follow camera, we add an user-defined offset to the object's local reference frame, which is defined by its root-body pose. ## 4 Experiments Implementation Details.We initialize the rigid-body transformations of each deformable object \(\mathbf{G}_{j}^{t}\) using a pre-trained PoseNet [59]; we initialize the rigid-body transformation of the background \(\mathbf{G}_{0}^{t}\) with the camera poses provided by the iPad Pro. In practice, what we actually optimize are the _inverse_ of the rigid-body transformations _i.e._, the root-body poses of each object relative to the camera. To train our composite scene representation, we first pre-train each object field separately. When pretraining the deformable objects, we optimize a silhouette loss \(\mathcal{L}_{\text{mask}}=\sum_{\mathbf{x}^{t}}||\mathbf{o}_{j}(\mathbf{x}^ {t})-\hat{\mathbf{o}}_{j}(\mathbf{x}^{t})||^{2}\), where the "ground truth" object silhouette \(\mathbf{o}_{j}\) is computed by an off-the-shelf instance segmentation engine [13]. For pretraining the background, we optimize rgb, flow, and depth losses (Equations 8, 9, 10, 11) on pixels outside the ground truth object silhouettes. Importantly, we don't supervise the object fields on frames that are not provided an object silhouette since it cannot be determined whether the absence of detection is a true or false negative. After pretraining, we composite the pre-trained object fields and jointly finetune them using only the color, depth, flow, and object-specific 3D-cycle consistency losses. Since the silhouette loss is no longer used, the scene representation is supervised on _all_ frames of the training sequence during joint-finetuning. We provide the complete description of implementation details in Appendix A. Dataset.We evaluate Total-Recon on novel-view synthesis for deformable scenes. To enable quantitative evaluation, we built a stereo rig comprised of two iPad-Pros rigidly attached to a camera mount, a setup similar to that of Nerfies [30]. Using the stereo rig, we captured 11 RGBD sequences containing 3 different cats, 1 dog, and 2 human subjects in 4 different indoor environments. The RGBD videos were captured using the Record3D iOS App [42], which also automatically registers the frames captured by each camera. These video sequences, which were subsampled at 10 fps, range from 392 to 901 frames, amounting to, on average minute-long videos that are significantly longer and contain more dynamic motion than the datasets introduced by [30, 31, 52]. The left and right cameras were registered by Figure 3: **Embodied View Synthesis and 3D Filters. For select sequences of our RGBD dataset, we visualize the scene geometry and appearance reconstructed by our method (3D reconstruction) and the resulting downstream applications. The yellow and blue camera meshes in the mesh renderings represent the egocentric and 3rd-person-follow cameras, respectively. To showcase the 3D video filter we attach a sky-blue unicorn horn to the forehead of the target object, which is then automatically propagated across all frames. [Videos]** solving a Perspective-n-Point (PnP) problem using manually annotated correspondences, and their videos were synchronized based on audio. We provide a complete description of our dataset in Appendix B. Reconstruction and Applications.By hierarchically decomposing scene motion into the motion of each object, which itself is decomposed into root-body motion and local articulations, Total-Recon _automatically_ computes novel 6-DoF trajectories such as those traversed by egocentric cameras and 3rd-person follow cameras (Figure 4). In turn, these trajectories enable automated embodied view synthesis and 3D occlusion-aware video filters (Figure 3). These tasks are also enabled by Total-Recon's ability to recover an accurate deformable 3D scene representation, which is currently out of reach for the best of related methods (Figure 5). As shown in the bird's eye view, each reconstructed object is properly situated with respect to the background and other objects, a direct consequence of our use of depth supervision. Furthermore, although the iPad Pro is only able to measure depth up to 4m, Total-Recon can render depth for _beyond_ this sensor limit by pooling the depth information from other frames into a single metric scene reconstruction. We provide results on additional sequences in Appendix D. Baselines and Evaluation.In Figure 5 and Table 3, we compare Total-Recon to D\({}^{2}\)NeRF [52] and HyperNeRF [31], and their depth-supervised equivalents on the proxy task of stereo-view synthesis, a prerequisite for _embodied_ view synthesis: we train each method on the RGBD frames captured from the left camera of our dataset and evaluate the images rendered from the viewpoint of the right camera. The depth-supervised versions of the baselines contain the same depth loss used in Total-Recon. We report LPIPS [62] and RMS depth error in the main paper, but include a more complete set of metrics (PSNR, SSIM, average accuracy at 0.1m) in Appendix C. Because D\({}^{2}\)NeRF and HyperNeRF were not designed to recover a _metric_ scene representation, we replaced their COLMAP [40] camera poses with those metric ones provided by the iPad Pro for a fair comparison. Comparisons.Total-Recon qualitatively and quantitatively outperforms all of the baselines. As shown in Figure 5, Total-Recon successfully reconstructs the entire scene, whereas the baselines are only able to reconstruct the rigid background at best. As shown in Table 3, Total-Recon also significantly outperforms all baselines regarding LPIPS and the RMS depth error. We attribute this huge gap to the baselines' inability to reconstruct the moving deformable objects. We provide more details regarding the baselines and additional visualizations in Appendix C. \(\mathbf{G}_{j}^{t}\) (row 4), where \(j\) denotes a deformable actor. For these experiments, we use the same set of training losses used in Total-Recon and initialize camera pose \(\mathbf{G}_{0}^{t}\) with those reported by ARKit; for ablations that model root-body motions _i.e._, rows (2) - (3), we initialize each deformable actor's root-body pose \(\mathbf{G}_{j}^{t}\) with predictions made by PoseNet [59] and optimize them during reconstruction. We report the novel-view metrics averaged over 6 selected sequences of our dataset: dog 1 (v1), cat 1 (v1), cat 2 (v1), human 1 & dog 1, and human 2 & cat 1. Depth Supervision.Table 4 shows that removing depth supervision (row 2) results in a significant increase in the RMS depth error \(\epsilon_{\text{depth}}\). Figure 7 indicates that this reflects the incorrect arrangement of objects stemming from their scale inconsistency - while removing depth supervision does not significantly deteriorate the training-view RGB renderings, it induces critical failure modes as shown in the _novel-view_ 3D reconstructions: (a) floating foreground objects, as evidenced by their shadows, and (b) the human incorrectly occluding the dog. In other words, without depth supervision, Total-Recon overfits to the training view and learns a degenerate scene representation where the reconstructed objects fail to converge to the same scale. We show results on additional RGBD sequences in Appendix E.1. These diagnostics justify Total-Recon's hierarchical motion representation, which decomposes object motion into global root-body motion and local articulations, especially given that row 3 performs better than row 4, even though row 4 models non-rigid object motion and row 3 does not. In turn, they suggest that conflating these two sources of scene motion is what prevents the baseline methods from reconstructing the highly dynamic objects that appear in our dataset. We provide a more detailed analysis in Appendix E.2 with additional experiments and RGBD sequences. ## 5 Discussion and Limitations We have presented a new system for automated embodied view synthesis from monocular RGBD videos, focusing on videos of people interacting with their pets. Our main technical contribution is Total-Recon, a 3D representation for deformable scenes that hierarchically decomposes scene motion into the motion of each object, which in turn, is decomposed its rigid, root-body motion and local articulations; this key design choice enables easier optimization over long videos containing large motions, which are difficult to reconstruct but necessary for supporting free-viewpoint synthesis. By explicitly reconstructing the geometry, appearance, root-body- and articulated motion of each object, Total-Recon enables seeing through the eyes of people and pets and generating game-like traversals of deformable scenes from behind a target object. Limitations.In Total-Recon, scene decomposition is primarily supervised by object silhouettes computed by an off-the-shelf segmentation model [13], which may be inaccurate, especially in partial occlusion scenarios and hence may damage the resulting reconstructions and embodied view renderings. We believe that incorporating the latest advances in video instance segmentation will enable Total-Recon to be applied to more challenging scenarios. Second, Total-Recon initializes the root-body pose of each deformable object using a PoseNet [59] trained for humans and quadruped animals, which does not generalize to other object categories (e.g., birds, fish). We reserve the reconstruction of generic scenes for future work. Our model needs to be optimized on a per-sequence basis for roughly 15 hours with 4 NVIDIA RTX A5000 GPUs and is therefore not suitable for real-time applications. Incorporating recent advances in fast neural field training methods would also be an interesting avenue for future work. Acknowledgments.We thank Nathaniel Chodosh, Jeff Tan, George Cazenavette, and Jason Zhang for proofreading our paper and Songwei Ge for reviewing our code. We also thank Sheng-Yu Wang, Daohan (Fred) Lu, Tamaki Kojima, Krishna Wadhwani, Takuya Narihira, and Tatsuo Fujiwara as well for providing valuable feedback. This work is supported in part by the Sony Corporation and the CMU Argo AI Center for Autonomous Vehicle Research.